=0;i--){\\n\\t\\t\\tif(!used[vs[i]]){\\n\\t\\t\\t\\trdfs(vs[i],k++);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn k;\\n\\t}\\n};\\n\\ngraph_scc sc;\\n\\nbool C(double v){\\n\\tsc.init(n*2);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<2;j++){\\n\\t\\t\\tfor(int k=i+1;k<n;k++){\\n\\t\\t\\t\\tfor(int l=0;l<2;l++){\\n\\t\\t\\t\\t\\tbool flag=false;\\n\\t\\t\\t\\t\\tfor(int a=0;a<m;a++){\\n\\t\\t\\t\\t\\t\\tfor(int b=0;b<m;b++){\\n\\t\\t\\t\\t\\t\\t\\tdouble diss=stf[i][j][a];\\n\\t\\t\\t\\t\\t\\t\\tdiss+=stf[k][l][b];\\n\\t\\t\\t\\t\\t\\t\\tdiss+=dp[a][b];\\n\\t\\t\\t\\t\\t\\t\\tif(diss<=v)flag=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(!flag){\\n\\t\\t\\t\\t\\t\\tsc.add_edge(i+j*n,k+(1-l)*n);\\n\\t\\t\\t\\t\\t\\tsc.add_edge(k+l*n,i+(1-j)*n);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint k=sc.scc();\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(sc.cmp[i]==sc.cmp[i+n])return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nint main(void){\\n\\tscanf(\\\"%d%d\\\",&n,&m);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tscanf(\\\"%d%d%d%d\\\",&za[i][0].first,&za[i][0].second,&za[i][1].first,&za[i][1].second);\\n\\t}\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tscanf(\\\"%d%d\\\",&factory[i].first,&factory[i].second);\\n\\t}\\n\\tfor(int i=0;i<m;i++){\\n\\t\\tfor(int j=0;j<(1<<m);j++){\\n\\t\\t\\tfor(int k=0;k<15;k++){\\n\\t\\t\\t\\tdist[j][k]=1e9;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdist[(1<<i)][i]=0.0;\\n\\t\\tpriority_queue<data> que;\\n\\t\\tque.push(data(1<<i,i,0.0));\\n\\t\\twhile(que.size()){\\n\\t\\t\\tdata d=que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tif(dist[d.bit][d.v]<d.cost)continue;\\n\\t\\t\\tfor(int j=0;j<m;j++){\\n\\t\\t\\t\\tint valx=(factory[j].first-factory[d.v].first);\\n\\t\\t\\t\\tint valy=(factory[j].second-factory[d.v].second);\\n\\t\\t\\t\\tdouble ncost=sqrt(valx*valx+valy*valy)+d.cost;\\n\\t\\t\\t\\tif(dist[d.bit|(1<<j)][j]>ncost){\\n\\t\\t\\t\\t\\tdist[d.bit|(1<<j)][j]=ncost;\\n\\t\\t\\t\\t\\tque.push(data(d.bit|(1<<j),j,ncost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j=0;j<m;j++){\\n\\t\\t\\tdp[i][j]=dist[(1<<m)-1][j];\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<2;j++){\\n\\t\\t\\tfor(int k=0;k<m;k++){\\n\\t\\t\\t\\tint valx=(za[i][j].first-factory[k].first);\\n\\t\\t\\t\\tint valy=(za[i][j].second-factory[k].second);\\n\\t\\t\\t\\tstf[i][j][k]=sqrt(valx*valx+valy*valy);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tdouble l=0.0,r=114514.0;\\n\\tfor(int i=0;i<100;i++){\\n\\t\\tdouble mid=(l+r)/2.0;\\n\\t\\tif(C(mid))r=mid;\\n\\t\\telse l=mid;\\n\\t}\\n\\tprintf(\\\"%.9f\\\\n\\\",r);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1880,\n \"memory_kb\": 13012,\n \"score_of_the_acc\": -1.0391,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3023_2538721\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb push_back\\n#define all(v) (v).begin(),(v).end()\\n#define fi first\\n#define se second\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\ntypedef complex<double>Point;\\n\\nint N,M;\\nPoint A[222][2];\\n\\nconst double INF=1e18;\\ndouble dp[15][15][1<<15];\\nPoint P[15];\\n\\n\\nnamespace SCC{\\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\\n used[v]=true;\\n for(auto u:G[v]){\\n if(!used[u])visit(G,vs,used,u);\\n }\\n vs.push_back(v);\\n }\\n\\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\\n comp[v]=k;\\n used[v]=true;\\n vec.push_back(v);\\n\\n for(auto u:T[v]){\\n if(!used[u])visit2(T,used,comp,vec,k,u);\\n }\\n }\\n\\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\\n vector<vector<int>>T(G.size());\\n for(int i=0;i<G.size();i++){\\n for(auto v:G[i]){\\n T[v].push_back(i);\\n }\\n }\\n comp.resize(G.size());\\n\\n vector<int>vs(G.size());\\n vector<int>used(G.size());\\n for(int i=0;i<G.size();i++){\\n if(!used[i])visit(G,vs,used,i);\\n }\\n reverse(vs.begin(),vs.end());\\n fill(used.begin(),used.end(),0);\\n\\n int K=0;\\n vector<vector<int>>S;\\n for(auto v:vs){\\n if(!used[v]){\\n S.push_back(vector<int>());\\n visit2(T,used,comp,S.back(),K++,v);\\n }\\n }\\n\\n H.resize(K);\\n fill(used.begin(),used.end(),0);\\n for(int i=0;i<K;i++){\\n for(auto v:S[i]){\\n for(auto u:G[v]){\\n if(used[comp[u]]||comp[v]==comp[u])continue;\\n used[comp[u]]=true;\\n H[comp[v]].push_back(comp[u]);\\n }\\n }\\n for(auto v:H[i])used[v]=false;\\n }\\n\\n }\\n}\\n\\n\\ndouble dist[200][2][200][2];\\n\\nbool C(double d){\\n vector<vint> G(2*N);\\n rep(i,N){\\n rep(j,N){\\n if(i==j)continue;\\n rep(k,2){\\n rep(l,2){\\n if(dist[i][k][j][l]>d)G[i*2+k].pb(j*2+1-l),G[j*2+l].pb(i*2+1-k);\\n }\\n }\\n }\\n }\\n\\n vector<vint>H;\\n vint comp;\\n SCC::decompose(G,H,comp);\\n\\n rep(i,N)if(comp[i*2]==comp[i*2+1])return false;\\n return true;\\n}\\n\\nsigned main(){\\n cin>>N>>M;\\n rep(i,N){\\n int a,b,c,d;\\n cin>>a>>b>>c>>d;\\n A[i][0]=Point(a,b);\\n A[i][1]=Point(c,d);\\n }\\n\\n\\n rep(i,M){\\n int a,b;\\n cin>>a>>b;\\n P[i]=Point(a,b);\\n }\\n\\n fill_n(**dp,15*15*(1<<15),INF);\\n\\n rep(s,M){\\n dp[s][s][1<<s]=0;\\n\\n rep(b,1<<M){\\n rep(v,M){\\n rep(u,M){\\n if(b>>u&1)continue;\\n chmin(dp[s][u][b|(1<<u)],dp[s][v][b]+abs(P[v]-P[u]));\\n }\\n }\\n }\\n }\\n\\n rep(i,N){\\n rep(j,N){\\n rep(k,2){\\n rep(l,2){\\n double mi=INF;\\n rep(v,M)rep(u,M)chmin(mi,abs(P[v]-A[i][k])+dp[v][u][(1<<M)-1]+abs(A[j][l]-P[u]));\\n dist[i][k][j][l]=mi;\\n }\\n }\\n }\\n }\\n\\n\\n double lb=0.0,ub=1e6;\\n rep(i,50){\\n double mid=(ub+lb)/2;\\n if(C(mid))ub=mid;\\n else lb=mid;\\n }\\n\\n printf(\\\"%.20f\\\\n\\\",ub);\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1330,\n \"memory_kb\": 68412,\n \"score_of_the_acc\": -1.1594,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1869,"cells":{"group_id":{"kind":"string","value":"aoj_3027_cpp"},"problem_description":{"kind":"string","value":"Problem B: OOllOll\nProblem\n非負整数$x$を2進数表記したときの各桁の和を$f(x)$とする。\n正整数$N$が与えられるので$f(0)$,$f(1)$,...,$f(N)$の中で最大のものを出力せよ。\n関数$f(5)$の計算の例:\n5を2進数表記すると101で各桁の和は1+0+1=2\nよって$f(5) = 2$となる。\nNote: https://ja.wikipedia.org/wiki/二進法\nInput\n入力は以下の形式で与えられる。\n$N$\n正整数$N$が1行に与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N \\le 10^9$\nOuput\n$f(0)$,$f(1)$,...,$f(N)$の中で最大のものを1行に出力する。\nSample Input 1\n2\nSample Output 1\n1\nSample Input 2\n9\nSample Output 2\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3027_2744398","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\nusing namespace std;\n\nclass Time{\npublic:\n chrono::system_clock::time_point start;\n Time(){reset();}\n void reset(){start = now();}\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\n};\n\nsigned main(){\n Time time;\n int n;\n cin>>n;\n n = min(n,1<<29);\n int ans = __builtin_popcount(n);\n if(n % 2 == 0) n--;\n while(n > 0 && time.time() < 990) ans = max(ans,(int)__builtin_popcount(n)),n-=2;\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.78125,"time_ms":980,"memory_kb":3084,"score_of_the_acc":-2,"final_rank":2},{"submission_id":"aoj_3027_2744382","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\nusing namespace std;\n\nclass Time{\npublic:\n chrono::system_clock::time_point start;\n Time(){reset();}\n void reset(){start = now();}\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\n};\n\nsigned main(){\n Time time;\n int n;\n cin>>n;\n int ans = __builtin_popcount(n);\n if(n % 2 == 0) n--;\n while(n > 0 && time.time() < 990) ans = max(ans,(int)__builtin_popcount(n)),n-=2;\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.78125,"time_ms":980,"memory_kb":3084,"score_of_the_acc":-2,"final_rank":2},{"submission_id":"aoj_3027_2744374","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\" \":\"\")<<t;return o;}\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\nvoid prArr(auto a,string s=\" \"){int i=0;for(auto t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\nclass Time{\npublic:\n chrono::system_clock::time_point start;\n Time(){reset();}\n void reset(){start = now();}\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\n};\n\nsigned main(){\n Time time;\n int n;\n cin>>n;\n int ans = __builtin_popcount(n);\n if(n % 2 == 0) n--;\n while(n > 0 && time.time() < 980) Max(ans,(int)__builtin_popcount(n)),n-=2;\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.78125,"time_ms":970,"memory_kb":3084,"score_of_the_acc":-1.75,"final_rank":1},{"submission_id":"aoj_3027_2744369","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\" \":\"\")<<t;return o;}\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\nvoid prArr(auto a,string s=\" \"){int i=0;for(auto t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\nclass Time{\npublic:\n chrono::system_clock::time_point start;\n Time(){reset();}\n void reset(){start = now();}\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\n};\n\nsigned main(){\n Time time;\n int n;\n cin>>n;\n int ans = __builtin_popcount(n);\n if(n % 2 == 0) n--;\n while(n > 0 && time.time() < 980) Max(ans,(int)__builtin_popcount(n--));\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.09375,"time_ms":970,"memory_kb":3068,"score_of_the_acc":-1.1786,"final_rank":5},{"submission_id":"aoj_3027_2744368","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\" \":\"\")<<t;return o;}\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\nvoid prArr(auto a,string s=\" \"){int i=0;for(auto t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\nclass Time{\npublic:\n chrono::system_clock::time_point start;\n Time(){reset();}\n void reset(){start = now();}\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\n};\n\nsigned main(){\n Time time;\n int n;\n cin>>n;\n int ans = 0;\n while(n > 0 && time.time() < 950) Max(ans,(int)__builtin_popcount(n--));\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.09375,"time_ms":940,"memory_kb":3056,"score_of_the_acc":0,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_3027_2744398\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\nusing namespace std;\\n\\nclass Time{\\npublic:\\n chrono::system_clock::time_point start;\\n Time(){reset();}\\n void reset(){start = now();}\\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\\n};\\n\\nsigned main(){\\n Time time;\\n int n;\\n cin>>n;\\n n = min(n,1<<29);\\n int ans = __builtin_popcount(n);\\n if(n % 2 == 0) n--;\\n while(n > 0 && time.time() < 990) ans = max(ans,(int)__builtin_popcount(n)),n-=2;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.78125,\n \"time_ms\": 980,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -2,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3027_2744382\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\nusing namespace std;\\n\\nclass Time{\\npublic:\\n chrono::system_clock::time_point start;\\n Time(){reset();}\\n void reset(){start = now();}\\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\\n};\\n\\nsigned main(){\\n Time time;\\n int n;\\n cin>>n;\\n int ans = __builtin_popcount(n);\\n if(n % 2 == 0) n--;\\n while(n > 0 && time.time() < 990) ans = max(ans,(int)__builtin_popcount(n)),n-=2;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.78125,\n \"time_ms\": 980,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -2,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3027_2744374\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\\nvoid prArr(auto a,string s=\\\" \\\"){int i=0;for(auto t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\nclass Time{\\npublic:\\n chrono::system_clock::time_point start;\\n Time(){reset();}\\n void reset(){start = now();}\\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\\n};\\n\\nsigned main(){\\n Time time;\\n int n;\\n cin>>n;\\n int ans = __builtin_popcount(n);\\n if(n % 2 == 0) n--;\\n while(n > 0 && time.time() < 980) Max(ans,(int)__builtin_popcount(n)),n-=2;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.78125,\n \"time_ms\": 970,\n \"memory_kb\": 3084,\n \"score_of_the_acc\": -1.75,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3027_2744369\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\\nvoid prArr(auto a,string s=\\\" \\\"){int i=0;for(auto t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\nclass Time{\\npublic:\\n chrono::system_clock::time_point start;\\n Time(){reset();}\\n void reset(){start = now();}\\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\\n};\\n\\nsigned main(){\\n Time time;\\n int n;\\n cin>>n;\\n int ans = __builtin_popcount(n);\\n if(n % 2 == 0) n--;\\n while(n > 0 && time.time() < 980) Max(ans,(int)__builtin_popcount(n--));\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.09375,\n \"time_ms\": 970,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -1.1786,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3027_2744368\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\\nvoid prArr(auto a,string s=\\\" \\\"){int i=0;for(auto t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\nclass Time{\\npublic:\\n chrono::system_clock::time_point start;\\n Time(){reset();}\\n void reset(){start = now();}\\n chrono::system_clock::time_point now(){return chrono::system_clock::now();}\\n double time(){return chrono::duration_cast<chrono::milliseconds>(now()-start).count();}\\n};\\n\\nsigned main(){\\n Time time;\\n int n;\\n cin>>n;\\n int ans = 0;\\n while(n > 0 && time.time() < 950) Max(ans,(int)__builtin_popcount(n--));\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.09375,\n \"time_ms\": 940,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": 0,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1870,"cells":{"group_id":{"kind":"string","value":"aoj_3021_cpp"},"problem_description":{"kind":"string","value":"Problem J: Cluster Network\nProblem\nマイヅ大学にある大規模クラスタ\n†\n型スーパーコンピュータ（通称「SAKURA」）のクラスタは、$N$台のコンピュータ（ノード）と$M$本の相互に通信が可能な物理的通信路で構成される。また、各ノードにはそれぞれ1から$N$までの識別番号が割り当てられている。\nこの度SAKURAの利用を大学関係者だけでなく、県内の企業にも認めることとなった。それに伴い、SAKURAを構成する各ノードを点検する必要がある。しかし、SAKURAの利用スケジュールは数ヶ月先まで埋まっているので、点検中もシステム全体を停止させることはできない。そこで、ノードを1日に1台ずつ順番に点検する。\n点検は$N$日にわたって行われ、$i$日目にノード$i$を点検する。このとき、点検するノードとそのノードに直接接続されている通信路をSAKURAのクラスタから切り離す。それによって、SAKURAのクラスタ全体は1つ以上のクラスタに分断されるので、そのうちのいずれかをSAKURAの代わりに運用する。当然、点検中のノードは運用することができない。\n複数のクラスタに分断された場合、それらの中で最も「総合性能値」の高いクラスタのみを運用する。各クラスタの「総合性能値」はそれを構成する各ノードに設定された「単体性能値」の和である。\nSAKURAを構成するノードの数、通信路の本数と各ノードに設定された「単体性能値」が与えられるので、$i$日目の点検中に運用されるクラスタの「総合性能値」を出力せよ。\n†：クラスタとは、1つ以上のコンピュータを結合してひとまとまりにしたシステムのこと。ここでは、物理的通信路で連結なノードの集合とする。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$\n$w_1$ $w_2$ ... $w_N$\n$u_1$ $v_1$\n$u_2$ $v_2$\n...\n$u_M$ $v_M$\n1行目にクラスタを構成するノードの数$N$と通信路の本数$M$が空白区切りで与えられる。\n2行目には各ノードの「単体性能値」を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$w_i$はノード$i$の「単体性能値」を表す。\n3行目からの$M$行には各通信路がつなぐ2つのノードの識別番号が空白区切りで与えられる。2+$i$行目の入力では、通信路がノード$u_i$とノード$v_i$を相互につなぐことを表す。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 10^5$\n$N-1 \\leq M \\leq min(\\frac{N\\times(N-1)}{2},10^5)$\n$1 \\leq w_i \\leq 10^6$\n$1 \\leq u_i, v_i \\leq N, u_i \\ne v_i$\n$(u_i,v_i) \\ne (u_j,v_j), (u_i,v_i) \\ne (v_j,u_j), i \\ne j$\n入力は全て整数\nOutput\n出力は$N$行からなる。\n$i$行目には、$i$日目に運用されるクラスタの「総合性能値」を出力する。\nSample Input 1\n9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1\nSample Output 1\n44\n25\n42\n30\n40\n39\n30\n37\n36\nSample Input 2\n16 19\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n1 2\n2 3\n3 4\n3 5\n1 6\n6 7\n6 8\n7 8\n8 9\n8 10\n10 11\n11 12\n12 10\n1 13\n13 14\n14 15\n15 13\n14 16\n15 16\nSample Output 2\n63\n122\n124\n132\n131\n73\n129\n86\n127\n103\n125\n124\n78\n122\n121\n120\nSample Input 3\n2 1\n1 2\n1 2\nSample Output 3\n2\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3021_10322927","code_snippet":"// AOJ #3021 Making Pairs\n// 2025.3.25\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\n\nstruct E { int to, cap, rev; };\n\nint S, T;\nvector<vector<E>> g;\nvector<int> lev, it;\n\nvoid add_edge(int s, int t, int cap) {\n g[s].push_back({t, cap, (int)g[t].size()});\n g[t].push_back({s, 0, (int)g[s].size() - 1});\n}\n\nbool bfs(int s, int t) {\n fill(lev.begin(), lev.end(), -1);\n queue<int> qu;\n lev[s] = 0;\n qu.push(s);\n while(!qu.empty()){\n int v = qu.front();\n qu.pop();\n for(auto &e : g[v]){\n if(e.cap && lev[e.to] < 0){\n lev[e.to] = lev[v] + 1;\n qu.push(e.to);\n }\n }\n }\n return lev[t] >= 0;\n}\n\nint dfs(int v, int t, int f) {\n if(v == t) return f;\n for(int &i = it[v]; i < g[v].size(); i++){\n E &e = g[v][i];\n if(e.cap && lev[v] + 1 == lev[e.to]){\n int ret = dfs(e.to, t, min(f, e.cap));\n if(ret){\n e.cap -= ret;\n g[e.to][e.rev].cap += ret;\n return ret;\n }\n }\n }\n return 0;\n}\n\nint main(){\n int n = Cin();\n vector<int> p(n+1);\n p[0] = -1;\n for (int i = 1; i <= n; i++) p[i] = Cin();\n\n vector<int> dep(n+1, 0);\n dep[0] = 0;\n for (int i = 1; i <= n; i++) dep[i] = dep[p[i]] + 1;\n\n int tot = n + 3;\n S = n + 1; T = n + 2;\n g.assign(tot, vector<E>());\n lev.assign(tot, -1);\n it.assign(tot, 0);\n\n int match = 0;\n if(dep[0] % 2 == 0) add_edge(S, 0, 1);\n else add_edge(0, T, 1);\n\n for (int i = 1; i <= n; i++){\n if(dep[i] % 2 == 0) add_edge(S, i, 1);\n else add_edge(i, T, 1);\n\n int u = p[i];\n if(dep[u] % 2 == 0) add_edge(u, i, 1);\n else add_edge(i, u, 1);\n\n while(bfs(S, T)){\n fill(it.begin(), it.end(), 0);\n while (int f = dfs(S, T, INT_MAX)) match += f;\n }\n Cout(match);\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3924,"score_of_the_acc":-0.313,"final_rank":14},{"submission_id":"aoj_3021_4952393","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class T>\nstruct Dinic {\n struct edge {\n int to;\n T cap;\n int rev;\n edge(int t = 0, T c = 0, int r = -1) : to(t), cap(c), rev(r) {}\n };\n int n;\n T finf;\n vector<vector<edge>> g;\n vector<int> id;\n vector<int> d;\n Dinic(int _n = 1, T _finf = (int)(2e9))\n : n(_n), finf(_finf), g(n, vector<edge>()), id(n), d(n) {}\n int add(int st, int go, T cap) {\n g[st].emplace_back(go, cap, (int)g[go].size());\n g[go].emplace_back(st, 0, (int)g[st].size() - 1);\n return (int)g[st].size() - 1;\n }\n void bfs(int st) {\n d.assign(n, -1);\n queue<int> qu;\n d[st] = 0;\n qu.push(st);\n while (qu.size()) {\n int now = qu.front();\n qu.pop();\n for (auto e : g[now])\n if (e.cap > 0 && d[e.to] < 0) {\n d[e.to] = d[now] + 1;\n qu.push(e.to);\n }\n }\n }\n T pathdfs(int now, int goal, T nf) {\n if (now == goal) return nf;\n int len = g[now].size();\n for (int& i = id[now]; i < len; ++i) {\n edge* e = &g[now][i];\n if (e->cap > 0 && d[now] < d[e->to]) {\n T res = pathdfs(e->to, goal, min(nf, e->cap));\n if (res > 0) {\n e->cap -= res;\n g[e->to][e->rev].cap += res;\n return res;\n }\n }\n }\n return 0;\n }\n T sole(int start, int goal, T flimit = 0) {\n if (!flimit) flimit = finf;\n T res = 0, nf = 0;\n while (flimit - res) {\n bfs(start);\n if (d[goal] < 0) return res;\n id.assign(n, 0);\n while ((nf = pathdfs(start, goal, flimit - res)) > 0) res += nf;\n }\n return res;\n }\n};\n\nint n;\nvector<int> p, dist;\nDinic<int> din;\n\nint main() {\n cin >> n;\n p.resize(n);\n dist.assign(n + 1, 0);\n din = Dinic<int>(n + 3);\n din.add(n + 1, 0, 1);\n for (int i = 0; i < n; ++i) {\n cin >> p[i];\n dist[i + 1] = dist[p[i]] ^ 1;\n if (dist[i + 1])\n din.add(i + 1, n + 2, 1);\n else\n din.add(n + 1, i + 1, 1);\n }\n int now = 0;\n for (int i = 0; i < n; ++i) {\n if (dist[i + 1])\n din.add(p[i], i + 1, 1);\n else\n din.add(i + 1, p[i], 1);\n now += din.sole(n + 1, n + 2);\n cout << now << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":4000,"score_of_the_acc":-0.4786,"final_rank":15},{"submission_id":"aoj_3021_3629101","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\ntypedef double ld;\ntypedef complex<ld> Point;\nconst ll INF = mod * mod;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\ntypedef vector<int> vec;\ntypedef vector<string> svec;\n\nvector<int> G[5001];\nbool used[5001]; int ans;\nvoid dfs(int id, int fr) {\n\tbool f = false;\n\trep(j, G[id].size()) {\n\t\tint to = G[id][j];\n\t\tdfs(to, id);\n\t\tif (!used[to]) {\n\t\t\tf = true;\n\t\t}\n\t}\n\tif (f) {\n\t\tused[id] = true; ans++;\n\t}\n\n}\nvoid solve() {\n\tint n;\n\tcin >> n;\n\trep1(i, n) {\n\t\tint p; cin >> p;\n\t\tG[p].push_back(i);\n\t\tfill(used, used + n + 1, false);\n\t\tans = 0;\n\t\tdfs(0, -1);\n\t\t//cout << \"ans is \";\n\t\tcout << ans << endl;\n\t}\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(5);\n\t//while (cin >> n>>h>>m>>s,n)solve();\n\tsolve();\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3412,"score_of_the_acc":-0.1705,"final_rank":4},{"submission_id":"aoj_3021_2666920","code_snippet":"#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}\n\nusing ll = long long;\nusing R = long double;\nconst R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}\ninline R sq(R x) {return sqrt(max(x, 0.0L));}\n\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\n// Problem Specific Parameter:\n\nconst int limit = 5010;\nvector<int> graph[limit];\n\nbool used[limit];\nint match[limit];\n\nbool dfs(int v) {\n\tused[v] = true;\n\tfor (auto &u : graph[v]) {\n\t\tconst int w = match[u];\n\t\tif (w == -1 or (used[w] == false and dfs(w))) {\n\t\t\tmatch[v] = u;\n\t\t\tmatch[u] = v;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main(void) {\n\tint n;\n\tcin >> n;\n\n\tfill_n(match, n + 1, -1);\n\tint ans = 0;\n\n\trep(v, 1, n + 1) {\n\t\tint u;\n\t\tcin >> u;\n\t\tgraph[u].push_back(v);\n\t\tgraph[v].push_back(u);\n\t\tfill_n(used, n + 1, false);\n\t\tif (dfs(v)) ans++;\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3468,"score_of_the_acc":-0.0125,"final_rank":2},{"submission_id":"aoj_3021_2564362","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nenum Type{\n\tCall,\n\tCalled_or_Lonely,\n};\n\nint N,memo[5001][2];\n\nvector<int> V[5001];\n\nint recursive(int node_id,Type type){\n\n\tif(memo[node_id][type] != -1)return memo[node_id][type];\n\n\tint ret = 0,tmp,sum;\n\n\tswitch(type){\n\tcase Call:\n\t\tsum = 0;\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tsum += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Called_or_Lonely));\n\t\t}\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tret = max(ret,sum-max(memo[V[node_id][i]][Call],memo[V[node_id][i]][Called_or_Lonely])+recursive(V[node_id][i],Called_or_Lonely)+1);\n\t\t}\n\t\tbreak;\n\tcase Called_or_Lonely:\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Called_or_Lonely));\n\t\t}\n\t\tbreak;\n\t}\n\n\treturn memo[node_id][type] = ret;\n}\n\nint func(){\n\n\treturn max(recursive(0,Call),recursive(0,Called_or_Lonely));\n}\n\n\nint main(void){\n\n\tscanf(\"%d\",&N);\n\tint tmp;\n\n for(int day = 1;day <= N; day++){\n\n scanf(\"%d\",&tmp);\n V[tmp].push_back(day);\n for(int i = 0; i <= day; i++){\n \tfor(int k = 0; k < 3; k++)memo[i][k] = -1;\n }\n\n printf(\"%d\\n\",func());\n }\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":3488,"score_of_the_acc":-0.5781,"final_rank":17},{"submission_id":"aoj_3021_2564352","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\nenum Type{\n\tCall,\n\tCalled,\n\tLonely,\n};\n\nint N,memo[5001][3];\n\nvector<int> V[5001];\n\nint recursive(int node_id,Type type){\n\n\tif(memo[node_id][type] != -1)return memo[node_id][type];\n\n\tint ret = 0,tmp,sum;\n\n\tswitch(type){\n\tcase Call:\n\t\tsum = 0;\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tsum += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\n\t\t}\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tret = max(ret,sum-max(memo[V[node_id][i]][Call],memo[V[node_id][i]][Lonely])+recursive(V[node_id][i],Called)+1);\n\t\t}\n\t\tbreak;\n\tcase Called:\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\n\t\t}\n\t\tbreak;\n\tcase Lonely:\n\t\tfor(int i = 0; i < V[node_id].size(); i++){\n\t\t\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\n\t\t}\n\t\tbreak;\n\t}\n\n\treturn memo[node_id][type] = ret;\n}\n\nint func(){\n\n\treturn max(recursive(0,Call),recursive(0,Lonely));\n}\n\n\nint main(void){\n\n\tscanf(\"%d\",&N);\n\tint tmp;\n\n for(int day = 1;day <= N; day++){\n\n scanf(\"%d\",&tmp);\n V[tmp].push_back(day);\n for(int i = 0; i <= day; i++){\n \tfor(int k = 0; k < 3; k++)memo[i][k] = -1;\n }\n\n printf(\"%d\\n\",func());\n }\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":3512,"score_of_the_acc":-0.7731,"final_rank":18},{"submission_id":"aoj_3021_2563769","code_snippet":"#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint n;\nint dp[5001][2];\nvector<int> G[5001];\n\nvoid dfs(int v){\n\tint sum=0;\n\tfor(int i=0;i<G[v].size();i++){\n\t\tdfs(G[v][i]);\n\t\tsum+=max(dp[G[v][i]][0],0);\n\t}\n\tdp[v][1]=sum;\n\tint tmp=0;\n\tfor(int i=0;i<G[v].size();i++){\n\t\ttmp=max(dp[G[v][i]][1]+1-dp[G[v][i]][0],tmp);\n\t}\n\tdp[v][0]=sum+tmp;\n}\n\nint main(void){\n\tscanf(\"%d\",&n);\n\tfor(int i=0;i<n;i++){\n\t\tint p;\n\t\tscanf(\"%d\",&p);\n\t\tG[p].push_back(i+1);\n\t\tmemset(dp,-1,sizeof(dp));\n\t\tdfs(0);\n\t\tprintf(\"%d\\n\",max(dp[0][0],dp[0][1]));\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":3480,"score_of_the_acc":-0.2551,"final_rank":13},{"submission_id":"aoj_3021_2557353","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint N;\nvector<int> G[5001];\nint A[5001],B[5001];\n\nvoid dfs(int pos){\n A[pos]=B[pos]=0;\n int maxm=-1e9, sum=0;\n for(int i=0;i<(int)G[pos].size();i++){\n int to=G[pos][i];\n dfs(to);\n B[pos]+=A[to];\n sum+=A[to];\n maxm=max(maxm,-A[to]+B[to]);\n }\n A[pos]=max(sum,sum+maxm+1);\n}\n\nint solve(){\n dfs(0);\n return A[0];\n}\n\nint main(){\n cin>>N;\n for(int i=1;i<=N;i++){\n int id;\n cin>>id;\n G[id].push_back(i);\n printf(\"%d\\n\",solve());\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3492,"score_of_the_acc":-0.2397,"final_rank":12},{"submission_id":"aoj_3021_2542787","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nsigned main(){\n int n;\n cin>>n;\n vector<int> G[5555];\n int dp[2][5555];\n function<int(int,int)> dfs=[&](int x,int v){\n if(G[v].empty()) return 0;\n if(~dp[x][v]) return dp[x][v];\n int res=0;\n for(int u:G[v]) res+=dfs(0,u);\n if(x) return dp[x][v]=res;\n int tmp=res;\n for(int u:G[v])\n res=max(res,tmp-dfs(0,u)+dfs(1,u)+1);\n return dp[x][v]=res;\n };\n for(int i=1;i<=n;i++){\n int p;\n cin>>p;\n G[p].push_back(i);\n memset(dp,-1,sizeof(dp));\n cout<<dfs(0,0)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":3360,"score_of_the_acc":-0.5707,"final_rank":16},{"submission_id":"aoj_3021_2542786","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nstruct BipartiteMatching{\n vector<vector<int> > G;\n int V;\n vector<int> match,used;\n \n BipartiteMatching(){}\n BipartiteMatching(int V):V(V){init();}\n \n void init(){\n for(int i=0;i<(int)G.size();i++) G[i].clear();\n G.clear();\n match.clear();\n used.clear();\n G.resize(V);\n match.resize(V,-1);\n used.resize(V,0);\n }\n \n void add_edge(int u,int v){\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n bool dfs(int v){\n used[v]=true;\n for(int i=0;i<(int)G[v].size();i++){\n int u=G[v][i],w=match[u];\n if(w<0||(!used[w]&&dfs(w))){\n\tmatch[v]=u;\n\tmatch[u]=v;\n\treturn true;\n }\n }\n return false;\n }\n\n int calc(int v){\n int res=0;\n //fill(match.begin(),match.end(),-1);\n fill(used.begin(),used.end(),0);\n if(dfs(v)){\n res++;\n }\n return res;\n }\n};\n\n\nsigned main(){\n int n;\n cin>>n;\n BipartiteMatching bm(n+1);\n int ans=0;\n for(int i=1;i<=n;i++){\n int p;\n cin>>p;\n bm.add_edge(p,i);\n ans+=bm.calc(i);\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3256,"score_of_the_acc":-0.0002,"final_rank":1},{"submission_id":"aoj_3021_2542599","code_snippet":"#include <bits/stdc++.h>\n#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)\n#define INF (1LL << 30)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\n\nll N, P[5001];\nvector<ll> E[5001];\n\npll dfs(ll v, ll p) {\n ll cnt = 0, t = 1;\n for(ll u : E[v]) {\n if(u == p) continue;\n pll d = dfs(u, v);\n cnt += d.first;\n if(d.second == 1) t = 0;\n }\n if(t == 0) cnt++;\n\n // cout << v << \": \" << cnt << \" \" << t << endl;\n\n return pll(cnt, t);\n}\n\nint main(void) {\n cin >> N;\n REP(i, 1, N + 1) cin >> P[i];\n\n REP(i, 1, N + 1) {\n E[P[i]].push_back(i);\n E[i].push_back(P[i]);\n\n cout << dfs(i, -1).first << endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":3484,"score_of_the_acc":-0.1908,"final_rank":6},{"submission_id":"aoj_3021_2538814","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n#define INF 1<<30\n#define LINF 1LL<<60\n\nbool match[5050][5050];\nint ans = 0;\nbool dfs(int u, int k, vector<int>rev, vector<vector<int>>& G) {\n\trev.push_back(u);\n\tbool f = false;\n\tfor (int i = 0; i < G[u].size();i++) {\n\t\tint v = G[u][i]; \n\t\tif (rev.size() > 1) {\n\t\t\tif (v == rev[rev.size() - 2])continue;\n\t\t}\n\t\tif (k == 0 && !match[u][v]) {\n\t\t\tf = true;\n\t\t\tif (dfs(v, 1, rev, G))return true;\n\t\t}\n\t\tif (k == 1 && match[u][v]) {\n\t\t\tf = true;\n\t\t\tif (dfs(v, 0, rev, G))return true;\n\t\t}\n\t}\n\tif (!f && k == 1) {\n\t\tint cnt = 0;\n\t\tfor (int i = rev.size() - 1; i > 0;i--) {\n\t\t\tif (cnt % 2 == 0) {\n\t\t\t\tif (!match[rev[i]][rev[i - 1]]) { ans++;}\n\t\t\t\tmatch[rev[i]][rev[i - 1]] = match[rev[i - 1]][rev[i]] = true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (match[rev[i]][rev[i - 1]]) { ans--; }\n\t\t\t\tmatch[rev[i]][rev[i - 1]] = match[rev[i - 1]][rev[i]] = false;\n\t\t\t}\n\t\t\tcnt++;\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint main() {\n\tcin.tie(0); ios::sync_with_stdio(false);\n\tint N; cin >> N;\n\tvector<vector<int>> G(N+1);\n\tfor (int v = 0; v < N;v++) {\n\t\tint p; cin >> p;\n\t\tG[p].push_back(v + 1);\n\t\tG[v + 1].push_back(p);\n\t\tvector<int> rev;\n\t\tdfs(v + 1, 0, rev, G);\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":20588,"score_of_the_acc":-1.0161,"final_rank":19},{"submission_id":"aoj_3021_2538781","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n//#define int long long\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(c) begin(c),end(c)\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9) + 7;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint N; cin >> N;\n\tvector<vector<int>> g(N + 1);\n\tvector<int> p(N); rep(i, 0, N) {\n\t\tcin >> p[i];\n\t\tg[p[i]].emplace_back(i + 1);\n\n\t\tfunction<int(int)> dfs = [&](int x) {\n\t\t\tint ret = 0;\n\t\t\tbool odd = false;\n\t\t\trep(i, 0, g[x].size()) {\n\t\t\t\tint r = dfs(g[x][i]);\n\t\t\t\tif (r % 2 == 1)\n\t\t\t\t\todd = true;\n\t\t\t\tret += (r / 2) * 2;\n\t\t\t}\n\t\t\tif (odd)\n\t\t\t\tret += 2;\n\t\t\telse\n\t\t\t\tret += 1;\n\t\t\treturn ret;\n\t\t};\n\n\t\tint maxi = dfs(0);\n\t\tdump(maxi);\n\t\tcout << maxi / 2 << endl;\n\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3268,"score_of_the_acc":-0.1945,"final_rank":7},{"submission_id":"aoj_3021_2538757","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nint N;\nvint G[5555];\n\nint dp[5555],topused[5555];\n\nvoid dfs(int v,int p){\n dp[v]=0;\n topused[v]=0;\n\n for(auto u:G[v]){\n if(u==p)continue;\n dfs(u,v);\n dp[v]+=dp[u];\n topused[v]|=!topused[u];\n }\n\n if(topused[v])dp[v]++;\n}\n\nsigned main(){\n cin>>N;\n\n for(int i=1;i<=N;i++){\n int p;cin>>p;\n G[p].pb(i);\n dfs(0,-1);\n cout<<dp[0]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3432,"score_of_the_acc":-0.1878,"final_rank":5},{"submission_id":"aoj_3021_2538727","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef pair<int, int> PI;\nconst ll mod = 1e9 + 7;\n\nconst int N = 5124;\nint par[N];\nVI edges[N];\n\nPI dfs(int n, int v) {\n int tot = 0;\n bool some = false;\n REP(i, 0, edges[v].size()) {\n int w = edges[v][i];\n PI res = dfs(n, w);\n if (res.second) {\n some = true;\n }\n tot += res.first;\n }\n return PI(tot + (some ? 1 : 0), some ? 0 : 1);\n}\n\nint calc(int n) {\n return dfs(n, 0).first;\n}\n\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n cin >> n;\n par[0] = -1;\n REP(i, 0, n) {\n int pp;\n cin >> pp;\n par[i + 1] = pp;\n edges[pp].push_back(i + 1);\n cout << calc(i + 2) << \"\\n\";\n }\n}","accuracy":1,"time_ms":90,"memory_kb":3380,"score_of_the_acc":-0.1364,"final_rank":3},{"submission_id":"aoj_3021_2538704","code_snippet":"// clang-format off\n#include <bits/stdc++.h>\n#define int long long\n#define main signed main()\n#define loop(i, a, n) for (int i = (a); i < (n); i++)\n#define rep(i, n) loop(i, 0, n)\n#define forever for (;;)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define prec(n) fixed << setprecision(n)\ntemplate<typename A> using V = std::vector<A>;\ntemplate<typename A> using F = std::function<A>;\ntemplate<typename A, typename B> using P = std::pair<A, B>;\nusing pii = P<int, int>;\nusing vi = V<int>;\nusing vd = V<double>;\nusing vs = V<std::string>;\nusing vpii = V<pii>;\nusing vvi = V<vi>;\nusing vvpii = V<vpii>;\nconstexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.14159265358979;\ntemplate<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }\ntemplate<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }\nconstexpr bool odd(const int n) { return n & 1; }\nconstexpr bool even(const int n) { return ~n & 1; }\ntemplate<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &x : v) is >> x; return is; }\ntemplate<typename A, typename B> std::istream &operator>>(std::istream &is, std::pair<A, B> &p) { is >> p.first; is >> p.second; return is; }\nusing namespace std;\n// clang-format on\n\nstatic vi child[5010];\nint dp[5010][2];\nvoid dfs(int v) {\n dp[v][0] = dp[v][1] = 0;\n int S = 0;\n for (int u : child[v]) {\n dfs(u);\n S += max(dp[u][0], dp[u][1]);\n }\n dp[v][0] = S;\n for (int u : child[v]) {\n int T = S - max(dp[u][0], dp[u][1]) + dp[u][0] + 1;\n cmax(dp[v][1], T);\n }\n}\n\nmain {\n int n;\n cin >> n;\n rep(i, n) {\n int p;\n cin >> p;\n child[p].push_back(i + 1);\n dfs(0);\n cout << max(dp[0][0], dp[0][1]) << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3448,"score_of_the_acc":-0.2371,"final_rank":11},{"submission_id":"aoj_3021_2538548","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint N;\nvector<vector<int>> t;\nvector<bool> used;\nint eval(int root) {\n\tint ret = 0;\n\tfor (int i = 0; i < t[root].size(); i++) {\n\t\tint node = t[root][i];\n\t\tif (!used[root] && t[node].size() == 0) {\n\t\t\tused[root] = used[node] = true;\n\t\t\tret++;\n\t\t} else ret += eval(node);\n\t\tif (!used[root] && !used[node]) {\n\t\t\tused[root] = used[node] = true;\n\t\t\tret++;\n\t\t}\n\t}\n\treturn ret;\n}\nint main(void) {\n\tcin >> N;\n\tt = vector<vector<int>>(N+1, vector<int>(0));\n\tfor (int i = 1; i <= N; i++) {\n\t\tint pi;\n\t\tcin >> pi;\n\t\tused = vector<bool>(N+1, false);\n\t\tt[pi].push_back(i);\n\t\tcout << eval(0) << endl;\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":3252,"score_of_the_acc":-0.2258,"final_rank":10},{"submission_id":"aoj_3021_2538511","code_snippet":"// ?????????????????????\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct Bipartite_Matching\n{\n vector< vector< int > > graph;\n vector< int > match, alive, used;\n int timestamp;\n\n Bipartite_Matching(int n)\n {\n timestamp = 0;\n graph.resize(n);\n alive.assign(n, 0);\n used.assign(n, 0);\n match.assign(n, -1);\n }\n\n void add_edge(int u, int v)\n {\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n\n bool dfs(int v)\n {\n used[v] = timestamp;\n for(int i = 0; i < graph[v].size(); i++) {\n int u = graph[v][i], w = match[u];\n if(alive[u] == 0) continue;\n if(w == -1 || (used[w] != timestamp && dfs(w))) {\n match[v] = u;\n match[u] = v;\n return (true);\n }\n }\n return (false);\n }\n\n int bipartite_matching()\n {\n int ret = 0;\n for(int i = 0; i < graph.size(); i++) {\n if(alive[i] == 0) continue;\n if(match[i] == -1) {\n ++timestamp;\n ret += dfs(i);\n }\n }\n return (ret);\n }\n\n int add(int k)\n {\n alive[k] = 1;\n ++timestamp;\n return (dfs(k));\n }\n\n};\n\nint main()\n{\n int N, A[150000], idx[150000];\n vector< int > g[150000];\n bool dep[150000] = {};\n\n cin >> N;\n ++N;\n for(int i = 1; i < N; i++) {\n cin >> idx[i];\n g[idx[i]].push_back(i);\n dep[i] = dep[idx[i]] ^ 1;\n }\n\n Bipartite_Matching flow(N);\n vector< int > left, right;\n for(int i = 0; i < N; i++) {\n if(dep[i]) left.push_back(i);\n else right.push_back(i);\n }\n\n for(int i = 1; i < N; i++) {\n int oi, beet;\n if(dep[i]) oi = lower_bound(begin(left), end(left), i) - begin(left);\n else oi = (int) (lower_bound(begin(right), end(right), i) - begin(right)) + left.size();\n\n if(dep[idx[i]]) beet = lower_bound(begin(left), end(left), idx[i]) - begin(left);\n else beet = (int) (lower_bound(begin(right), end(right), idx[i]) - begin(right)) + left.size();\n\n flow.add_edge(oi, beet);\n }\n flow.alive[(int) (lower_bound(begin(right), end(right), 0) - begin(right)) + left.size()] = true;\n\n flow.bipartite_matching();\n int ret = 0;\n for(int i = 1; i < N; i++) {\n int oi;\n if(dep[i]) oi = lower_bound(begin(left), end(left), i) - begin(left);\n else oi = (int) (lower_bound(begin(right), end(right), i) - begin(right)) + left.size();\n ret += flow.add(oi);\n cout << ret << endl;\n }\n\n\n}","accuracy":1,"time_ms":10,"memory_kb":7044,"score_of_the_acc":-0.2187,"final_rank":9},{"submission_id":"aoj_3021_2538498","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n\n// data structure\n#include <bitset>\n//#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <array>\n//#include <tuple>\n//#include <unordered_map>\n#include <unordered_set>\n#include <complex>\n//#include <deque>\n#include<valarray>\n\n// stream\n//#include <istream>\n//#include <sstream>\n//#include <ostream>\n//#include <fstream>\n\n// etc\n#include <cmath>\n#include <cassert>\n#include <functional>\n#include <iomanip>\n//#include <typeinfo>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\n\n// output\n#define OUT(d) std::cout<<d;\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;\n#define SP std::cout<<\" \";\n#define TAB std::cout<<\"\\t\";\n#define BR std::cout<<\"\\n\";\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\n' : ' ');\n#define ENDL std::cout<<std::endl;\n#define FLUSH std::cout<<std::flush;\n#define SHOW(d) {std::cerr << #d << \"\\t:\" << d << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\n\";}\n\n// utility\n#define ALL(a) (a).begin(),(a).end()\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\n#define IN(a, x, b) (a<=x && x<b)\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \"[Time:\" << res << \"ns (\" << res / (1.0e9) << \"s)]\\n\"; }\n\n// test\ntemplate<class T> std::vector<std::vector<T>> VV(int n) {\n\treturn std::vector<std::vector<T>>(n);\n}\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n}\ntemplate<typename S, typename T>\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n\tos << \"(\" << p.first << \", \" << p.second << \")\"; return os;\n}\n\n// type/const\n\n#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\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-7;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\n\nsigned main() {\n\tINIT;\n\tVAR(int, n);\n\tstd::vector<std::vector<int>> g(1);\n\tREP(i, n) {\n\t\tVAR(int, in_p);\n\t\tg.emplace_back();\n\t\tg[i + 1].emplace_back(in_p);\n\t\tg[in_p].emplace_back(i + 1);\n\n\t\tstd::function<PAIR(int, int)> dfs = [&](int v, int par) {\n\t\t\tPAIR p(0, 1);\n\t\t\tbool use = false;\n\t\t\tbool chi = true;\n\t\t\tfor (auto to : g[v]) {\n\t\t\t\tif (to == par) continue;\n\t\t\t\tchi = false;\n\t\t\t\tPAIR pp = dfs(to, v);\n\t\t\t\tp.first += pp.first;\n\t\t\t\tif (pp.second == 1 && p.second == 1) {\n\t\t\t\t\tp.second = 0;\n\t\t\t\t\t++p.first;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn p;\n\t\t};\n\n\t\tOUT(dfs(0, -1).first)BR;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3428,"score_of_the_acc":-0.2037,"final_rank":8},{"submission_id":"aoj_3021_2538478","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n//#define mt make_tuple\n//typedef tuple<double,int,double> tp;\n//typedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\nconst double PI=acos(-1);\nconst double EPS=1e-7;\nDef inf=sizeof(Def)==sizeof(long long)?2e18:1e9;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\nstruct edge{int to,cap,rev;};//ikisaki youryou gyakuhen\nclass MF{//max flow\n\tpublic:\n\tint n;\n\tvector<vector<edge> >G;//[MAX];\n\tvi level,iter;//[MAX];\n\tMF(int size){\n\t\tn=size;\n\t\tG=vector<vector<edge> >(n);\n\t}\n\tvoid add_edge(int from, int to, int cap){\n\t\tedge q={to,cap,int(G[to].size())};\n\t\tG[from].push_back(q);\n\t\tq={from,0,int(G[from].size()-1)};\n\t\tG[to].push_back(q);\n\t}\n\tvoid bfs(int s){\n\t\tlevel=vi(n,-1);\n\t\tqueue<int>q;\n\t\tlevel[s]=0;\n\t\tq.push(s);\n\t\twhile(!q.empty()){\n\t\t\tint v=q.front();q.pop();\n\t\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\t\tedge &e=G[v][i];\n\t\t\t\tif(e.cap>0&&level[e.to]<0){\n\t\t\t\t\tlevel[e.to]=level[v]+1;\n\t\t\t\t\tq.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint dfs(int v,int t, int f) {\n\t\tif(v==t)return f;\n\t\tfor(int &i=iter[v];i<G[v].size();i++){\n\t\t\tedge &e=G[v][i];\n\t\t\tif(level[v]>=level[e.to]||e.cap<=0) continue;\n\t\t\tint d =dfs(e.to,t,min(f,e.cap));\n\t\t\tif(d>0){\n\t\t\t\te.cap-=d;\n\t\t\t\tG[e.to][e.rev].cap+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint mf(int s,int t) {//from s to t,ford_fulkerson\n\t\tint flow=0;\n\t\twhile(1){\n\t\t\tbfs(s);\n\t\t\tif(level[t]<0)return flow;\n\t\t\titer=vi(n);\n\t\t\tint f;\n\t\t\twhile((f=dfs(s,t,inf))>0)flow+=f;\n\t\t}\n\t}\n};\nint main(){\n\tint n;\n\tcin>>n;\n\tMF mf(2*n+4);\n\tint s=2*n+2,t=s+1;\n\trep(i,n+1)mf.add_edge(s,i,1);\n\trep(i,n+1)mf.add_edge(n+i+1,t,1);\n\tint sum=0;\n\trep(i,n){\n\t\tint a;cin>>a;\n\t\tmf.add_edge(a,n+i+2,1);\n\t\tmf.add_edge(i+1,n+a+1,1);\n\t\tsum+=mf.mf(s,t);\n\t\tcout<<sum/2<<endl;\n\t}\n}","accuracy":1,"time_ms":630,"memory_kb":3980,"score_of_the_acc":-1.042,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_3021_10322927\",\n \"code_snippet\": \"// AOJ #3021 Making Pairs\\n// 2025.3.25\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(int n) {\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tif (n < 0) pc('-'), n = -n;\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n\\tpc('\\\\n');\\n}\\n\\n\\nstruct E { int to, cap, rev; };\\n\\nint S, T;\\nvector<vector<E>> g;\\nvector<int> lev, it;\\n\\nvoid add_edge(int s, int t, int cap) {\\n g[s].push_back({t, cap, (int)g[t].size()});\\n g[t].push_back({s, 0, (int)g[s].size() - 1});\\n}\\n\\nbool bfs(int s, int t) {\\n fill(lev.begin(), lev.end(), -1);\\n queue<int> qu;\\n lev[s] = 0;\\n qu.push(s);\\n while(!qu.empty()){\\n int v = qu.front();\\n qu.pop();\\n for(auto &e : g[v]){\\n if(e.cap && lev[e.to] < 0){\\n lev[e.to] = lev[v] + 1;\\n qu.push(e.to);\\n }\\n }\\n }\\n return lev[t] >= 0;\\n}\\n\\nint dfs(int v, int t, int f) {\\n if(v == t) return f;\\n for(int &i = it[v]; i < g[v].size(); i++){\\n E &e = g[v][i];\\n if(e.cap && lev[v] + 1 == lev[e.to]){\\n int ret = dfs(e.to, t, min(f, e.cap));\\n if(ret){\\n e.cap -= ret;\\n g[e.to][e.rev].cap += ret;\\n return ret;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint main(){\\n int n = Cin();\\n vector<int> p(n+1);\\n p[0] = -1;\\n for (int i = 1; i <= n; i++) p[i] = Cin();\\n\\n vector<int> dep(n+1, 0);\\n dep[0] = 0;\\n for (int i = 1; i <= n; i++) dep[i] = dep[p[i]] + 1;\\n\\n int tot = n + 3;\\n S = n + 1; T = n + 2;\\n g.assign(tot, vector<E>());\\n lev.assign(tot, -1);\\n it.assign(tot, 0);\\n\\n int match = 0;\\n if(dep[0] % 2 == 0) add_edge(S, 0, 1);\\n else add_edge(0, T, 1);\\n\\n for (int i = 1; i <= n; i++){\\n if(dep[i] % 2 == 0) add_edge(S, i, 1);\\n else add_edge(i, T, 1);\\n\\n int u = p[i];\\n if(dep[u] % 2 == 0) add_edge(u, i, 1);\\n else add_edge(i, u, 1);\\n\\n while(bfs(S, T)){\\n fill(it.begin(), it.end(), 0);\\n while (int f = dfs(S, T, INT_MAX)) match += f;\\n }\\n Cout(match);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -0.313,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3021_4952393\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class T>\\nstruct Dinic {\\n struct edge {\\n int to;\\n T cap;\\n int rev;\\n edge(int t = 0, T c = 0, int r = -1) : to(t), cap(c), rev(r) {}\\n };\\n int n;\\n T finf;\\n vector<vector<edge>> g;\\n vector<int> id;\\n vector<int> d;\\n Dinic(int _n = 1, T _finf = (int)(2e9))\\n : n(_n), finf(_finf), g(n, vector<edge>()), id(n), d(n) {}\\n int add(int st, int go, T cap) {\\n g[st].emplace_back(go, cap, (int)g[go].size());\\n g[go].emplace_back(st, 0, (int)g[st].size() - 1);\\n return (int)g[st].size() - 1;\\n }\\n void bfs(int st) {\\n d.assign(n, -1);\\n queue<int> qu;\\n d[st] = 0;\\n qu.push(st);\\n while (qu.size()) {\\n int now = qu.front();\\n qu.pop();\\n for (auto e : g[now])\\n if (e.cap > 0 && d[e.to] < 0) {\\n d[e.to] = d[now] + 1;\\n qu.push(e.to);\\n }\\n }\\n }\\n T pathdfs(int now, int goal, T nf) {\\n if (now == goal) return nf;\\n int len = g[now].size();\\n for (int& i = id[now]; i < len; ++i) {\\n edge* e = &g[now][i];\\n if (e->cap > 0 && d[now] < d[e->to]) {\\n T res = pathdfs(e->to, goal, min(nf, e->cap));\\n if (res > 0) {\\n e->cap -= res;\\n g[e->to][e->rev].cap += res;\\n return res;\\n }\\n }\\n }\\n return 0;\\n }\\n T sole(int start, int goal, T flimit = 0) {\\n if (!flimit) flimit = finf;\\n T res = 0, nf = 0;\\n while (flimit - res) {\\n bfs(start);\\n if (d[goal] < 0) return res;\\n id.assign(n, 0);\\n while ((nf = pathdfs(start, goal, flimit - res)) > 0) res += nf;\\n }\\n return res;\\n }\\n};\\n\\nint n;\\nvector<int> p, dist;\\nDinic<int> din;\\n\\nint main() {\\n cin >> n;\\n p.resize(n);\\n dist.assign(n + 1, 0);\\n din = Dinic<int>(n + 3);\\n din.add(n + 1, 0, 1);\\n for (int i = 0; i < n; ++i) {\\n cin >> p[i];\\n dist[i + 1] = dist[p[i]] ^ 1;\\n if (dist[i + 1])\\n din.add(i + 1, n + 2, 1);\\n else\\n din.add(n + 1, i + 1, 1);\\n }\\n int now = 0;\\n for (int i = 0; i < n; ++i) {\\n if (dist[i + 1])\\n din.add(p[i], i + 1, 1);\\n else\\n din.add(i + 1, p[i], 1);\\n now += din.sole(n + 1, n + 2);\\n cout << now << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 4000,\n \"score_of_the_acc\": -0.4786,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3021_3629101\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\ntypedef double ld;\\ntypedef complex<ld> Point;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\ntypedef vector<int> vec;\\ntypedef vector<string> svec;\\n\\nvector<int> G[5001];\\nbool used[5001]; int ans;\\nvoid dfs(int id, int fr) {\\n\\tbool f = false;\\n\\trep(j, G[id].size()) {\\n\\t\\tint to = G[id][j];\\n\\t\\tdfs(to, id);\\n\\t\\tif (!used[to]) {\\n\\t\\t\\tf = true;\\n\\t\\t}\\n\\t}\\n\\tif (f) {\\n\\t\\tused[id] = true; ans++;\\n\\t}\\n\\n}\\nvoid solve() {\\n\\tint n;\\n\\tcin >> n;\\n\\trep1(i, n) {\\n\\t\\tint p; cin >> p;\\n\\t\\tG[p].push_back(i);\\n\\t\\tfill(used, used + n + 1, false);\\n\\t\\tans = 0;\\n\\t\\tdfs(0, -1);\\n\\t\\t//cout << \\\"ans is \\\";\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(5);\\n\\t//while (cin >> n>>h>>m>>s,n)solve();\\n\\tsolve();\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.1705,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3021_2666920\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define _overload(_1,_2,_3,name,...) name\\n#define _rep(i,n) _range(i,0,n)\\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\\n\\n#define _rrep(i,n) _rrange(i,n,0)\\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\\n\\n#define _all(arg) begin(arg),end(arg)\\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define bit(n) (1LL<<(n))\\n#define popcount(n) (__builtin_popcountll(n))\\n\\nusing namespace std;\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}\\ntemplate<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}\\n\\nusing ll = long long;\\nusing R = long double;\\nconst R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\\ninline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}\\ninline R sq(R x) {return sqrt(max(x, 0.0L));}\\n\\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\n// Problem Specific Parameter:\\n\\nconst int limit = 5010;\\nvector<int> graph[limit];\\n\\nbool used[limit];\\nint match[limit];\\n\\nbool dfs(int v) {\\n\\tused[v] = true;\\n\\tfor (auto &u : graph[v]) {\\n\\t\\tconst int w = match[u];\\n\\t\\tif (w == -1 or (used[w] == false and dfs(w))) {\\n\\t\\t\\tmatch[v] = u;\\n\\t\\t\\tmatch[u] = v;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(void) {\\n\\tint n;\\n\\tcin >> n;\\n\\n\\tfill_n(match, n + 1, -1);\\n\\tint ans = 0;\\n\\n\\trep(v, 1, n + 1) {\\n\\t\\tint u;\\n\\t\\tcin >> u;\\n\\t\\tgraph[u].push_back(v);\\n\\t\\tgraph[v].push_back(u);\\n\\t\\tfill_n(used, n + 1, false);\\n\\t\\tif (dfs(v)) ans++;\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.0125,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3021_2564362\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nenum Type{\\n\\tCall,\\n\\tCalled_or_Lonely,\\n};\\n\\nint N,memo[5001][2];\\n\\nvector<int> V[5001];\\n\\nint recursive(int node_id,Type type){\\n\\n\\tif(memo[node_id][type] != -1)return memo[node_id][type];\\n\\n\\tint ret = 0,tmp,sum;\\n\\n\\tswitch(type){\\n\\tcase Call:\\n\\t\\tsum = 0;\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tsum += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Called_or_Lonely));\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tret = max(ret,sum-max(memo[V[node_id][i]][Call],memo[V[node_id][i]][Called_or_Lonely])+recursive(V[node_id][i],Called_or_Lonely)+1);\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase Called_or_Lonely:\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Called_or_Lonely));\\n\\t\\t}\\n\\t\\tbreak;\\n\\t}\\n\\n\\treturn memo[node_id][type] = ret;\\n}\\n\\nint func(){\\n\\n\\treturn max(recursive(0,Call),recursive(0,Called_or_Lonely));\\n}\\n\\n\\nint main(void){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\tint tmp;\\n\\n for(int day = 1;day <= N; day++){\\n\\n scanf(\\\"%d\\\",&tmp);\\n V[tmp].push_back(day);\\n for(int i = 0; i <= day; i++){\\n \\tfor(int k = 0; k < 3; k++)memo[i][k] = -1;\\n }\\n\\n printf(\\\"%d\\\\n\\\",func());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.5781,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3021_2564352\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\nenum Type{\\n\\tCall,\\n\\tCalled,\\n\\tLonely,\\n};\\n\\nint N,memo[5001][3];\\n\\nvector<int> V[5001];\\n\\nint recursive(int node_id,Type type){\\n\\n\\tif(memo[node_id][type] != -1)return memo[node_id][type];\\n\\n\\tint ret = 0,tmp,sum;\\n\\n\\tswitch(type){\\n\\tcase Call:\\n\\t\\tsum = 0;\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tsum += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tret = max(ret,sum-max(memo[V[node_id][i]][Call],memo[V[node_id][i]][Lonely])+recursive(V[node_id][i],Called)+1);\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase Called:\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase Lonely:\\n\\t\\tfor(int i = 0; i < V[node_id].size(); i++){\\n\\t\\t\\tret += max(recursive(V[node_id][i],Call),recursive(V[node_id][i],Lonely));\\n\\t\\t}\\n\\t\\tbreak;\\n\\t}\\n\\n\\treturn memo[node_id][type] = ret;\\n}\\n\\nint func(){\\n\\n\\treturn max(recursive(0,Call),recursive(0,Lonely));\\n}\\n\\n\\nint main(void){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\tint tmp;\\n\\n for(int day = 1;day <= N; day++){\\n\\n scanf(\\\"%d\\\",&tmp);\\n V[tmp].push_back(day);\\n for(int i = 0; i <= day; i++){\\n \\tfor(int k = 0; k < 3; k++)memo[i][k] = -1;\\n }\\n\\n printf(\\\"%d\\\\n\\\",func());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.7731,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3021_2563769\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\nint n;\\nint dp[5001][2];\\nvector<int> G[5001];\\n\\nvoid dfs(int v){\\n\\tint sum=0;\\n\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\tdfs(G[v][i]);\\n\\t\\tsum+=max(dp[G[v][i]][0],0);\\n\\t}\\n\\tdp[v][1]=sum;\\n\\tint tmp=0;\\n\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\ttmp=max(dp[G[v][i]][1]+1-dp[G[v][i]][0],tmp);\\n\\t}\\n\\tdp[v][0]=sum+tmp;\\n}\\n\\nint main(void){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint p;\\n\\t\\tscanf(\\\"%d\\\",&p);\\n\\t\\tG[p].push_back(i+1);\\n\\t\\tmemset(dp,-1,sizeof(dp));\\n\\t\\tdfs(0);\\n\\t\\tprintf(\\\"%d\\\\n\\\",max(dp[0][0],dp[0][1]));\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.2551,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3021_2557353\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint N;\\nvector<int> G[5001];\\nint A[5001],B[5001];\\n\\nvoid dfs(int pos){\\n A[pos]=B[pos]=0;\\n int maxm=-1e9, sum=0;\\n for(int i=0;i<(int)G[pos].size();i++){\\n int to=G[pos][i];\\n dfs(to);\\n B[pos]+=A[to];\\n sum+=A[to];\\n maxm=max(maxm,-A[to]+B[to]);\\n }\\n A[pos]=max(sum,sum+maxm+1);\\n}\\n\\nint solve(){\\n dfs(0);\\n return A[0];\\n}\\n\\nint main(){\\n cin>>N;\\n for(int i=1;i<=N;i++){\\n int id;\\n cin>>id;\\n G[id].push_back(i);\\n printf(\\\"%d\\\\n\\\",solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.2397,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3021_2542787\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<int> G[5555];\\n int dp[2][5555];\\n function<int(int,int)> dfs=[&](int x,int v){\\n if(G[v].empty()) return 0;\\n if(~dp[x][v]) return dp[x][v];\\n int res=0;\\n for(int u:G[v]) res+=dfs(0,u);\\n if(x) return dp[x][v]=res;\\n int tmp=res;\\n for(int u:G[v])\\n res=max(res,tmp-dfs(0,u)+dfs(1,u)+1);\\n return dp[x][v]=res;\\n };\\n for(int i=1;i<=n;i++){\\n int p;\\n cin>>p;\\n G[p].push_back(i);\\n memset(dp,-1,sizeof(dp));\\n cout<<dfs(0,0)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.5707,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3021_2542786\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n\\nstruct BipartiteMatching{\\n vector<vector<int> > G;\\n int V;\\n vector<int> match,used;\\n \\n BipartiteMatching(){}\\n BipartiteMatching(int V):V(V){init();}\\n \\n void init(){\\n for(int i=0;i<(int)G.size();i++) G[i].clear();\\n G.clear();\\n match.clear();\\n used.clear();\\n G.resize(V);\\n match.resize(V,-1);\\n used.resize(V,0);\\n }\\n \\n void add_edge(int u,int v){\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n bool dfs(int v){\\n used[v]=true;\\n for(int i=0;i<(int)G[v].size();i++){\\n int u=G[v][i],w=match[u];\\n if(w<0||(!used[w]&&dfs(w))){\\n\\tmatch[v]=u;\\n\\tmatch[u]=v;\\n\\treturn true;\\n }\\n }\\n return false;\\n }\\n\\n int calc(int v){\\n int res=0;\\n //fill(match.begin(),match.end(),-1);\\n fill(used.begin(),used.end(),0);\\n if(dfs(v)){\\n res++;\\n }\\n return res;\\n }\\n};\\n\\n\\nsigned main(){\\n int n;\\n cin>>n;\\n BipartiteMatching bm(n+1);\\n int ans=0;\\n for(int i=1;i<=n;i++){\\n int p;\\n cin>>p;\\n bm.add_edge(p,i);\\n ans+=bm.calc(i);\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3021_2542599\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)\\n#define INF (1LL << 30)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> pll;\\n\\nll N, P[5001];\\nvector<ll> E[5001];\\n\\npll dfs(ll v, ll p) {\\n ll cnt = 0, t = 1;\\n for(ll u : E[v]) {\\n if(u == p) continue;\\n pll d = dfs(u, v);\\n cnt += d.first;\\n if(d.second == 1) t = 0;\\n }\\n if(t == 0) cnt++;\\n\\n // cout << v << \\\": \\\" << cnt << \\\" \\\" << t << endl;\\n\\n return pll(cnt, t);\\n}\\n\\nint main(void) {\\n cin >> N;\\n REP(i, 1, N + 1) cin >> P[i];\\n\\n REP(i, 1, N + 1) {\\n E[P[i]].push_back(i);\\n E[i].push_back(P[i]);\\n\\n cout << dfs(i, -1).first << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.1908,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3021_2538814\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n#define INF 1<<30\\n#define LINF 1LL<<60\\n\\nbool match[5050][5050];\\nint ans = 0;\\nbool dfs(int u, int k, vector<int>rev, vector<vector<int>>& G) {\\n\\trev.push_back(u);\\n\\tbool f = false;\\n\\tfor (int i = 0; i < G[u].size();i++) {\\n\\t\\tint v = G[u][i]; \\n\\t\\tif (rev.size() > 1) {\\n\\t\\t\\tif (v == rev[rev.size() - 2])continue;\\n\\t\\t}\\n\\t\\tif (k == 0 && !match[u][v]) {\\n\\t\\t\\tf = true;\\n\\t\\t\\tif (dfs(v, 1, rev, G))return true;\\n\\t\\t}\\n\\t\\tif (k == 1 && match[u][v]) {\\n\\t\\t\\tf = true;\\n\\t\\t\\tif (dfs(v, 0, rev, G))return true;\\n\\t\\t}\\n\\t}\\n\\tif (!f && k == 1) {\\n\\t\\tint cnt = 0;\\n\\t\\tfor (int i = rev.size() - 1; i > 0;i--) {\\n\\t\\t\\tif (cnt % 2 == 0) {\\n\\t\\t\\t\\tif (!match[rev[i]][rev[i - 1]]) { ans++;}\\n\\t\\t\\t\\tmatch[rev[i]][rev[i - 1]] = match[rev[i - 1]][rev[i]] = true;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (match[rev[i]][rev[i - 1]]) { ans--; }\\n\\t\\t\\t\\tmatch[rev[i]][rev[i - 1]] = match[rev[i - 1]][rev[i]] = false;\\n\\t\\t\\t}\\n\\t\\t\\tcnt++;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint main() {\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n\\tint N; cin >> N;\\n\\tvector<vector<int>> G(N+1);\\n\\tfor (int v = 0; v < N;v++) {\\n\\t\\tint p; cin >> p;\\n\\t\\tG[p].push_back(v + 1);\\n\\t\\tG[v + 1].push_back(p);\\n\\t\\tvector<int> rev;\\n\\t\\tdfs(v + 1, 0, rev, G);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 20588,\n \"score_of_the_acc\": -1.0161,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3021_2538781\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#ifdef _DEBUG\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\n//#define int long long\\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\\n#define all(c) begin(c),end(c)\\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\\nconst int MOD = (int)(1e9) + 7;\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint N; cin >> N;\\n\\tvector<vector<int>> g(N + 1);\\n\\tvector<int> p(N); rep(i, 0, N) {\\n\\t\\tcin >> p[i];\\n\\t\\tg[p[i]].emplace_back(i + 1);\\n\\n\\t\\tfunction<int(int)> dfs = [&](int x) {\\n\\t\\t\\tint ret = 0;\\n\\t\\t\\tbool odd = false;\\n\\t\\t\\trep(i, 0, g[x].size()) {\\n\\t\\t\\t\\tint r = dfs(g[x][i]);\\n\\t\\t\\t\\tif (r % 2 == 1)\\n\\t\\t\\t\\t\\todd = true;\\n\\t\\t\\t\\tret += (r / 2) * 2;\\n\\t\\t\\t}\\n\\t\\t\\tif (odd)\\n\\t\\t\\t\\tret += 2;\\n\\t\\t\\telse\\n\\t\\t\\t\\tret += 1;\\n\\t\\t\\treturn ret;\\n\\t\\t};\\n\\n\\t\\tint maxi = dfs(0);\\n\\t\\tdump(maxi);\\n\\t\\tcout << maxi / 2 << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.1945,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3021_2538757\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb push_back\\n#define all(v) (v).begin(),(v).end()\\n#define fi first\\n#define se second\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nint N;\\nvint G[5555];\\n\\nint dp[5555],topused[5555];\\n\\nvoid dfs(int v,int p){\\n dp[v]=0;\\n topused[v]=0;\\n\\n for(auto u:G[v]){\\n if(u==p)continue;\\n dfs(u,v);\\n dp[v]+=dp[u];\\n topused[v]|=!topused[u];\\n }\\n\\n if(topused[v])dp[v]++;\\n}\\n\\nsigned main(){\\n cin>>N;\\n\\n for(int i=1;i<=N;i++){\\n int p;cin>>p;\\n G[p].pb(i);\\n dfs(0,-1);\\n cout<<dp[0]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.1878,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3021_2538727\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <ctime>\\n#include <deque>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n\\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\\n\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef vector<int> VI;\\ntypedef vector<ll> VL;\\ntypedef pair<int, int> PI;\\nconst ll mod = 1e9 + 7;\\n\\nconst int N = 5124;\\nint par[N];\\nVI edges[N];\\n\\nPI dfs(int n, int v) {\\n int tot = 0;\\n bool some = false;\\n REP(i, 0, edges[v].size()) {\\n int w = edges[v][i];\\n PI res = dfs(n, w);\\n if (res.second) {\\n some = true;\\n }\\n tot += res.first;\\n }\\n return PI(tot + (some ? 1 : 0), some ? 0 : 1);\\n}\\n\\nint calc(int n) {\\n return dfs(n, 0).first;\\n}\\n\\n\\nint main(void) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n;\\n cin >> n;\\n par[0] = -1;\\n REP(i, 0, n) {\\n int pp;\\n cin >> pp;\\n par[i + 1] = pp;\\n edges[pp].push_back(i + 1);\\n cout << calc(i + 2) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1364,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3021_2538704\",\n \"code_snippet\": \"// clang-format off\\n#include <bits/stdc++.h>\\n#define int long long\\n#define main signed main()\\n#define loop(i, a, n) for (int i = (a); i < (n); i++)\\n#define rep(i, n) loop(i, 0, n)\\n#define forever for (;;)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define prec(n) fixed << setprecision(n)\\ntemplate<typename A> using V = std::vector<A>;\\ntemplate<typename A> using F = std::function<A>;\\ntemplate<typename A, typename B> using P = std::pair<A, B>;\\nusing pii = P<int, int>;\\nusing vi = V<int>;\\nusing vd = V<double>;\\nusing vs = V<std::string>;\\nusing vpii = V<pii>;\\nusing vvi = V<vi>;\\nusing vvpii = V<vpii>;\\nconstexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;\\nconstexpr int MOD = 1000000007;\\nconstexpr double PI = 3.14159265358979;\\ntemplate<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }\\ntemplate<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }\\nconstexpr bool odd(const int n) { return n & 1; }\\nconstexpr bool even(const int n) { return ~n & 1; }\\ntemplate<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &x : v) is >> x; return is; }\\ntemplate<typename A, typename B> std::istream &operator>>(std::istream &is, std::pair<A, B> &p) { is >> p.first; is >> p.second; return is; }\\nusing namespace std;\\n// clang-format on\\n\\nstatic vi child[5010];\\nint dp[5010][2];\\nvoid dfs(int v) {\\n dp[v][0] = dp[v][1] = 0;\\n int S = 0;\\n for (int u : child[v]) {\\n dfs(u);\\n S += max(dp[u][0], dp[u][1]);\\n }\\n dp[v][0] = S;\\n for (int u : child[v]) {\\n int T = S - max(dp[u][0], dp[u][1]) + dp[u][0] + 1;\\n cmax(dp[v][1], T);\\n }\\n}\\n\\nmain {\\n int n;\\n cin >> n;\\n rep(i, n) {\\n int p;\\n cin >> p;\\n child[p].push_back(i + 1);\\n dfs(0);\\n cout << max(dp[0][0], dp[0][1]) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.2371,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3021_2538548\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint N;\\nvector<vector<int>> t;\\nvector<bool> used;\\nint eval(int root) {\\n\\tint ret = 0;\\n\\tfor (int i = 0; i < t[root].size(); i++) {\\n\\t\\tint node = t[root][i];\\n\\t\\tif (!used[root] && t[node].size() == 0) {\\n\\t\\t\\tused[root] = used[node] = true;\\n\\t\\t\\tret++;\\n\\t\\t} else ret += eval(node);\\n\\t\\tif (!used[root] && !used[node]) {\\n\\t\\t\\tused[root] = used[node] = true;\\n\\t\\t\\tret++;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nint main(void) {\\n\\tcin >> N;\\n\\tt = vector<vector<int>>(N+1, vector<int>(0));\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tint pi;\\n\\t\\tcin >> pi;\\n\\t\\tused = vector<bool>(N+1, false);\\n\\t\\tt[pi].push_back(i);\\n\\t\\tcout << eval(0) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3252,\n \"score_of_the_acc\": -0.2258,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3021_2538511\",\n \"code_snippet\": \"// ?????????????????????\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstruct Bipartite_Matching\\n{\\n vector< vector< int > > graph;\\n vector< int > match, alive, used;\\n int timestamp;\\n\\n Bipartite_Matching(int n)\\n {\\n timestamp = 0;\\n graph.resize(n);\\n alive.assign(n, 0);\\n used.assign(n, 0);\\n match.assign(n, -1);\\n }\\n\\n void add_edge(int u, int v)\\n {\\n graph[u].push_back(v);\\n graph[v].push_back(u);\\n }\\n\\n bool dfs(int v)\\n {\\n used[v] = timestamp;\\n for(int i = 0; i < graph[v].size(); i++) {\\n int u = graph[v][i], w = match[u];\\n if(alive[u] == 0) continue;\\n if(w == -1 || (used[w] != timestamp && dfs(w))) {\\n match[v] = u;\\n match[u] = v;\\n return (true);\\n }\\n }\\n return (false);\\n }\\n\\n int bipartite_matching()\\n {\\n int ret = 0;\\n for(int i = 0; i < graph.size(); i++) {\\n if(alive[i] == 0) continue;\\n if(match[i] == -1) {\\n ++timestamp;\\n ret += dfs(i);\\n }\\n }\\n return (ret);\\n }\\n\\n int add(int k)\\n {\\n alive[k] = 1;\\n ++timestamp;\\n return (dfs(k));\\n }\\n\\n};\\n\\nint main()\\n{\\n int N, A[150000], idx[150000];\\n vector< int > g[150000];\\n bool dep[150000] = {};\\n\\n cin >> N;\\n ++N;\\n for(int i = 1; i < N; i++) {\\n cin >> idx[i];\\n g[idx[i]].push_back(i);\\n dep[i] = dep[idx[i]] ^ 1;\\n }\\n\\n Bipartite_Matching flow(N);\\n vector< int > left, right;\\n for(int i = 0; i < N; i++) {\\n if(dep[i]) left.push_back(i);\\n else right.push_back(i);\\n }\\n\\n for(int i = 1; i < N; i++) {\\n int oi, beet;\\n if(dep[i]) oi = lower_bound(begin(left), end(left), i) - begin(left);\\n else oi = (int) (lower_bound(begin(right), end(right), i) - begin(right)) + left.size();\\n\\n if(dep[idx[i]]) beet = lower_bound(begin(left), end(left), idx[i]) - begin(left);\\n else beet = (int) (lower_bound(begin(right), end(right), idx[i]) - begin(right)) + left.size();\\n\\n flow.add_edge(oi, beet);\\n }\\n flow.alive[(int) (lower_bound(begin(right), end(right), 0) - begin(right)) + left.size()] = true;\\n\\n flow.bipartite_matching();\\n int ret = 0;\\n for(int i = 1; i < N; i++) {\\n int oi;\\n if(dep[i]) oi = lower_bound(begin(left), end(left), i) - begin(left);\\n else oi = (int) (lower_bound(begin(right), end(right), i) - begin(right)) + left.size();\\n ret += flow.add(oi);\\n cout << ret << endl;\\n }\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7044,\n \"score_of_the_acc\": -0.2187,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3021_2538498\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n\\n// data structure\\n#include <bitset>\\n//#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <array>\\n//#include <tuple>\\n//#include <unordered_map>\\n#include <unordered_set>\\n#include <complex>\\n//#include <deque>\\n#include<valarray>\\n\\n// stream\\n//#include <istream>\\n//#include <sstream>\\n//#include <ostream>\\n//#include <fstream>\\n\\n// etc\\n#include <cmath>\\n#include <cassert>\\n#include <functional>\\n#include <iomanip>\\n//#include <typeinfo>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\\n\\n// output\\n#define OUT(d) std::cout<<d;\\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;\\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;\\n#define SP std::cout<<\\\" \\\";\\n#define TAB std::cout<<\\\"\\\\t\\\";\\n#define BR std::cout<<\\\"\\\\n\\\";\\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\\\n' : ' ');\\n#define ENDL std::cout<<std::endl;\\n#define FLUSH std::cout<<std::flush;\\n#define SHOW(d) {std::cerr << #d << \\\"\\\\t:\\\" << d << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\n\\\";}\\n\\n// utility\\n#define ALL(a) (a).begin(),(a).end()\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\\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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\\n#define IN(a, x, b) (a<=x && x<b)\\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \\\"[Time:\\\" << res << \\\"ns (\\\" << res / (1.0e9) << \\\"s)]\\\\n\\\"; }\\n\\n// test\\ntemplate<class T> std::vector<std::vector<T>> VV(int n) {\\n\\treturn std::vector<std::vector<T>>(n);\\n}\\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\\n\\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\\n}\\ntemplate<typename S, typename T>\\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\\n\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os;\\n}\\n\\n// type/const\\n\\n#define int ll\\nusing ll = long long;\\nusing ull = unsigned long long;\\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-7;\\nconstexpr int MOD = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\n\\nsigned main() {\\n\\tINIT;\\n\\tVAR(int, n);\\n\\tstd::vector<std::vector<int>> g(1);\\n\\tREP(i, n) {\\n\\t\\tVAR(int, in_p);\\n\\t\\tg.emplace_back();\\n\\t\\tg[i + 1].emplace_back(in_p);\\n\\t\\tg[in_p].emplace_back(i + 1);\\n\\n\\t\\tstd::function<PAIR(int, int)> dfs = [&](int v, int par) {\\n\\t\\t\\tPAIR p(0, 1);\\n\\t\\t\\tbool use = false;\\n\\t\\t\\tbool chi = true;\\n\\t\\t\\tfor (auto to : g[v]) {\\n\\t\\t\\t\\tif (to == par) continue;\\n\\t\\t\\t\\tchi = false;\\n\\t\\t\\t\\tPAIR pp = dfs(to, v);\\n\\t\\t\\t\\tp.first += pp.first;\\n\\t\\t\\t\\tif (pp.second == 1 && p.second == 1) {\\n\\t\\t\\t\\t\\tp.second = 0;\\n\\t\\t\\t\\t\\t++p.first;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn p;\\n\\t\\t};\\n\\n\\t\\tOUT(dfs(0, -1).first)BR;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.2037,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3021_2538478\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<stack>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#include<assert.h>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef int Def;\\ntypedef pair<Def,Def> pii;\\ntypedef vector<Def> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef vector<string> vs;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef pair<Def,pii> pip;\\ntypedef vector<pip>vip;\\n//#define mt make_tuple\\n//typedef tuple<double,int,double> tp;\\n//typedef vector<tp> vt;\\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\\nconst double PI=acos(-1);\\nconst double EPS=1e-7;\\nDef inf=sizeof(Def)==sizeof(long long)?2e18:1e9;\\nint dx[]={0,1,0,-1};\\nint dy[]={1,0,-1,0};\\nstruct edge{int to,cap,rev;};//ikisaki youryou gyakuhen\\nclass MF{//max flow\\n\\tpublic:\\n\\tint n;\\n\\tvector<vector<edge> >G;//[MAX];\\n\\tvi level,iter;//[MAX];\\n\\tMF(int size){\\n\\t\\tn=size;\\n\\t\\tG=vector<vector<edge> >(n);\\n\\t}\\n\\tvoid add_edge(int from, int to, int cap){\\n\\t\\tedge q={to,cap,int(G[to].size())};\\n\\t\\tG[from].push_back(q);\\n\\t\\tq={from,0,int(G[from].size()-1)};\\n\\t\\tG[to].push_back(q);\\n\\t}\\n\\tvoid bfs(int s){\\n\\t\\tlevel=vi(n,-1);\\n\\t\\tqueue<int>q;\\n\\t\\tlevel[s]=0;\\n\\t\\tq.push(s);\\n\\t\\twhile(!q.empty()){\\n\\t\\t\\tint v=q.front();q.pop();\\n\\t\\t\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\t\\t\\tedge &e=G[v][i];\\n\\t\\t\\t\\tif(e.cap>0&&level[e.to]<0){\\n\\t\\t\\t\\t\\tlevel[e.to]=level[v]+1;\\n\\t\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint dfs(int v,int t, int f) {\\n\\t\\tif(v==t)return f;\\n\\t\\tfor(int &i=iter[v];i<G[v].size();i++){\\n\\t\\t\\tedge &e=G[v][i];\\n\\t\\t\\tif(level[v]>=level[e.to]||e.cap<=0) continue;\\n\\t\\t\\tint d =dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.cap-=d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tint mf(int s,int t) {//from s to t,ford_fulkerson\\n\\t\\tint flow=0;\\n\\t\\twhile(1){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t]<0)return flow;\\n\\t\\t\\titer=vi(n);\\n\\t\\t\\tint f;\\n\\t\\t\\twhile((f=dfs(s,t,inf))>0)flow+=f;\\n\\t\\t}\\n\\t}\\n};\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tMF mf(2*n+4);\\n\\tint s=2*n+2,t=s+1;\\n\\trep(i,n+1)mf.add_edge(s,i,1);\\n\\trep(i,n+1)mf.add_edge(n+i+1,t,1);\\n\\tint sum=0;\\n\\trep(i,n){\\n\\t\\tint a;cin>>a;\\n\\t\\tmf.add_edge(a,n+i+2,1);\\n\\t\\tmf.add_edge(i+1,n+a+1,1);\\n\\t\\tsum+=mf.mf(s,t);\\n\\t\\tcout<<sum/2<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -1.042,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1871,"cells":{"group_id":{"kind":"string","value":"aoj_3022_cpp"},"problem_description":{"kind":"string","value":"Problem J: Cluster Network\nProblem\nマイヅ大学にある大規模クラスタ\n†\n型スーパーコンピュータ（通称「SAKURA」）のクラスタは、$N$台のコンピュータ（ノード）と$M$本の相互に通信が可能な物理的通信路で構成される。また、各ノードにはそれぞれ1から$N$までの識別番号が割り当てられている。\nこの度SAKURAの利用を大学関係者だけでなく、県内の企業にも認めることとなった。それに伴い、SAKURAを構成する各ノードを点検する必要がある。しかし、SAKURAの利用スケジュールは数ヶ月先まで埋まっているので、点検中もシステム全体を停止させることはできない。そこで、ノードを1日に1台ずつ順番に点検する。\n点検は$N$日にわたって行われ、$i$日目にノード$i$を点検する。このとき、点検するノードとそのノードに直接接続されている通信路をSAKURAのクラスタから切り離す。それによって、SAKURAのクラスタ全体は1つ以上のクラスタに分断されるので、そのうちのいずれかをSAKURAの代わりに運用する。当然、点検中のノードは運用することができない。\n複数のクラスタに分断された場合、それらの中で最も「総合性能値」の高いクラスタのみを運用する。各クラスタの「総合性能値」はそれを構成する各ノードに設定された「単体性能値」の和である。\nSAKURAを構成するノードの数、通信路の本数と各ノードに設定された「単体性能値」が与えられるので、$i$日目の点検中に運用されるクラスタの「総合性能値」を出力せよ。\n†：クラスタとは、1つ以上のコンピュータを結合してひとまとまりにしたシステムのこと。ここでは、物理的通信路で連結なノードの集合とする。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$\n$w_1$ $w_2$ ... $w_N$\n$u_1$ $v_1$\n$u_2$ $v_2$\n...\n$u_M$ $v_M$\n1行目にクラスタを構成するノードの数$N$と通信路の本数$M$が空白区切りで与えられる。\n2行目には各ノードの「単体性能値」を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$w_i$はノード$i$の「単体性能値」を表す。\n3行目からの$M$行には各通信路がつなぐ2つのノードの識別番号が空白区切りで与えられる。2+$i$行目の入力では、通信路がノード$u_i$とノード$v_i$を相互につなぐことを表す。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 10^5$\n$N-1 \\leq M \\leq min(\\frac{N\\times(N-1)}{2},10^5)$\n$1 \\leq w_i \\leq 10^6$\n$1 \\leq u_i, v_i \\leq N, u_i \\ne v_i$\n$(u_i,v_i) \\ne (u_j,v_j), (u_i,v_i) \\ne (v_j,u_j), i \\ne j$\n入力は全て整数\nOutput\n出力は$N$行からなる。\n$i$行目には、$i$日目に運用されるクラスタの「総合性能値」を出力する。\nSample Input 1\n9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1\nSample Output 1\n44\n25\n42\n30\n40\n39\n30\n37\n36\nSample Input 2\n16 19\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n1 2\n2 3\n3 4\n3 5\n1 6\n6 7\n6 8\n7 8\n8 9\n8 10\n10 11\n11 12\n12 10\n1 13\n13 14\n14 15\n15 13\n14 16\n15 16\nSample Output 2\n63\n122\n124\n132\n131\n73\n129\n86\n127\n103\n125\n124\n78\n122\n121\n120\nSample Input 3\n2 1\n1 2\n1 2\nSample Output 3\n2\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3022_10578791","code_snippet":"#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3022\"\n\n\n#include <cassert>\n#include <concepts>\n#include <vector>\n#include <optional>\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\nnamespace zawa {\n\ntemplate <std::integral T>\nclass BlockCutTree {\npublic:\n\n BlockCutTree() = default;\n\n BlockCutTree(const std::vector<std::vector<T>>& g) : inv_(g.size()) {\n const usize n = g.size();\n std::vector<usize> low(n), ord(n), vs;\n usize time = 1;\n const T INVALID = static_cast<T>(-1);\n auto dfs = [&](auto dfs, T v, T p) -> void {\n low[v] = ord[v] = time++;\n if (g[v].empty()) {\n blocks_.push_back({T{v}});\n return;\n }\n usize deg = 0;\n bool cut = false;\n for (T x : g[v]) {\n if (ord[x]) {\n low[v] = std::min(low[v], ord[x]);\n }\n else {\n deg++;\n dfs(dfs, x, v);\n low[v] = std::min(low[v], low[x]);\n if (low[x] >= ord[v]) {\n std::vector<T> cur{v};\n cut |= p != INVALID;\n while (vs.size() and ord[vs.back()] >= ord[x]) {\n cur.push_back(vs.back());\n vs.pop_back();\n }\n blocks_.push_back(std::move(cur));\n }\n }\n }\n cut |= p == INVALID and deg >= 2;\n if (cut) cuts_.push_back(v);\n vs.push_back(v);\n };\n for (T i = 0 ; i < static_cast<T>(n) ; i++) if (!ord[i]) \n dfs(dfs, i, INVALID);\n const usize m = blocks_.size(), k = cuts_.size();\n for (usize i = 0 ; i < k ; i++) inv_[cuts_[i]] = m + i;\n g_.resize(m + k);\n for (usize i = 0 ; i < m ; i++) {\n for (T v : blocks_[i]) if (inv_[v] >= m) {\n g_[i].push_back(inv_[v]);\n g_[inv_[v]].push_back(i);\n }\n }\n }\n\n inline usize size() const noexcept {\n return g_.size();\n }\n\n const std::vector<T>& operator[](usize i) const {\n assert(i < size());\n return g_[i];\n }\n\n enum class Type {\n BLOCK,\n CUT\n };\n\n Type type(usize i) const {\n assert(i < size());\n return i < blocks_.size() ? Type::BLOCK : Type::CUT;\n }\n\n const std::vector<std::vector<T>>& blocks() const {\n return blocks_;\n }\n\n const std::vector<T>& block(usize i) const {\n assert(i < size() and type(i) == Type::BLOCK);\n return blocks_[i];\n }\n\n const std::vector<T>& cuts() const {\n return cuts_;\n }\n\n const T cut(usize i) const {\n assert(i < size() and type(i) == Type::CUT);\n return cuts_[i - blocks_.size()];\n }\n\n std::vector<T> vertices(usize i) const {\n assert(i < size());\n return i < blocks_.size() ? \n blocks_[i] : std::vector<T>{cuts_[i - blocks_.size()]};\n }\n\n bool isCut(T v) const {\n assert(v < static_cast<T>(inv_.size()));\n return inv_[v] >= blocks_.size();\n }\n\n std::optional<usize> cutId(usize i) const {\n assert(i < size());\n return isCut(i) ? std::optional<usize>{inv_[i]} : std::nullopt;\n }\n\nprivate:\n\n std::vector<std::vector<T>> blocks_;\n\n std::vector<T> cuts_;\n\n std::vector<std::vector<T>> g_;\n\n std::vector<usize> inv_;\n};\n\n} // namespace zawa\nusing namespace zawa;\n\n#include <iostream>\n#include <numeric>\n#include <unordered_set>\n\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int N, M;\n std::cin >> N >> M;\n std::vector<int> W(N);\n for (auto& w : W) std::cin >> w;\n std::vector<std::vector<int>> g(N);\n for (int i = 0 ; i < M ; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n BlockCutTree bct{g};\n const long long sum = std::accumulate(W.begin(), W.end(), 0LL);\n std::vector<long long> ans(N);\n for (int i = 0 ; i < N ; i++) if (!bct.isCut(i)) \n ans[i] = sum - W[i];\n std::vector<bool> vis(bct.size());\n auto rec = [&](auto rec, int v, int p) -> std::pair<std::unordered_set<int>, long long> {\n vis[v] = true;\n long long s = 0LL;\n std::unordered_set<int> set;\n const int pos = bct.type(v) == decltype(bct)::Type::CUT ? bct.cut(v) : -1;\n for (int x : bct[v]) if (x != p) {\n auto [st, k] = rec(rec, x, v);\n if (pos != -1) ans[pos] = std::max(ans[pos], k - (st.contains(pos) ? W[pos] : 0));\n if (set.size() < st.size()) {\n std::swap(set, st);\n std::swap(s, k);\n }\n for (int ch : st) if (!set.contains(ch)) {\n s += W[ch];\n set.insert(ch);\n }\n }\n for (int cur : bct.vertices(v)) {\n if (!set.contains(cur)) {\n set.insert(cur);\n s += W[cur];\n }\n }\n if (pos != -1) ans[pos] = std::max(ans[pos], sum - s);\n return {set, s};\n };\n for (int i = 0 ; i < std::ssize(bct) ; i++) if (!vis[i]) rec(rec, i, -1);\n for (long long i : ans) std::cout << i << '\\n';\n}","accuracy":1,"time_ms":170,"memory_kb":34320,"score_of_the_acc":-1.5905,"final_rank":18},{"submission_id":"aoj_3022_10459581","code_snippet":"#line 1 \"/home/y_midori/cp/test/test.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022\"\n#line 2 \"template.hpp\"\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T>\nconcept Streamable = requires(ostream os, T &x) { os << x; };\ntemplate <class mint>\nconcept is_modint = requires(mint &x) {\n { x.val() } -> std::convertible_to<int>;\n};\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\ntemplate <Streamable T> void print_one(const T &value) { cout << value; }\ntemplate <is_modint T> void print_one(const T &value) { cout << value.val(); }\nvoid print() { cout << '\\n'; }\ntemplate <class T, class... Ts> void print(const T &a, const Ts &...b) {\n print_one(a);\n ((cout << ' ', print_one(b)), ...);\n cout << '\\n';\n}\ntemplate <ranges::range Iterable>\n requires(!Streamable<Iterable>)\nvoid print(const Iterable &v) {\n for(auto it = v.begin(); it != v.end(); ++it) {\n if(it != v.begin())\n cout << \" \";\n print_one(*it);\n }\n cout << '\\n';\n}\nusing vi = vector<int>;\nusing vii = vector<vector<int>>;\nusing pii = pair<int, int>;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vll = vector<vl>;\nusing pll = pair<ll, ll>;\n#define all(v) begin(v), end(v)\n#define UNIQUE(v) ranges::sort(v), v.erase(unique(all(v)), end(v))\ntemplate <typename T> inline bool chmax(T &a, T b) {\n return ((a < b) ? (a = b, true) : (false));\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n return ((a > b) ? (a = b, true) : (false));\n}\n// https://trap.jp/post/1224/\ntemplate <class... T> constexpr auto min(T... a) {\n return min(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate <class... T> constexpr auto max(T... a) {\n return max(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate <class... T> void input(T &...a) { (cin >> ... >> a); }\ntemplate <class T> void input(vector<T> &a) {\n for(T &x : a)\n cin >> x;\n}\n#define INT(...) \\\n int __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define LL(...) \\\n long long __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define REP1(a) for(ll i = 0; i < a; i++)\n#define REP2(i, a) for(ll i = 0; i < a; i++)\n#define REP3(i, a, b) for(ll i = a; i < b; i++)\n#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)\nll inf = 3e18;\nvl dx = {1, -1, 0, 0};\nvl dy = {0, 0, 1, -1};\ntemplate <class T> T floor(T x, T y) {\n return x / y - ((x ^ y) < 0 and x % y);\n}\ntemplate <class T> T ceil(T x, T y) {\n return y < 0 ? floor(-x + -y - 1, -y) : floor(x + y - 1, y);\n}\n// yの符号に関わらず非負で定義 \\bmod:texコマンド\ntemplate <class T> T bmod(T x, T y) {\n T m = x % y;\n return (m < 0) ? m + (y > 0 ? y : -y) : m;\n}\n#line 3 \"graph/graph-template.hpp\"\n/**\n * @brief Graph Template(グラフテンプレート)\n * @see https://ei1333.github.io/library/graph/graph-template.hpp\n */\ntemplate <class T = ll> struct Edge {\n int from, to;\n T cost;\n int idx;\n Edge() = default;\n Edge(int from, int to, T cost = 1, int idx = -1)\n : from(from), to(to), cost(cost), idx(idx) {}\n Edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <class T = ll> struct Graph {\n using cost_type = T;\n vector<vector<Edge<T>>> g;\n int es; // edge_size\n Graph() = default;\n explicit Graph(int n) : g(n), es(0) {};\n int size() const { return ssize(g); }\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n vector<Edge<T>> &operator[](const int &k) { return g[k]; }\n const vector<Edge<T>> &operator[](const int &k) const { return g[k]; }\n void read(int m, int padding = -1, bool weighted = false,\n bool directed = false) {\n for(int i = 0; i < m; ++i) {\n int a, b;\n T c(1);\n cin >> a >> b;\n a += padding;\n b += padding;\n if(weighted)\n cin >> c;\n if(directed)\n add_directed_edge(a, b, c);\n else\n add_edge(a, b, c);\n }\n }\n};\n#line 4 \"graph/block-cut-tree.hpp\"\n/**\n * @brief ブロックカット木的な\n * https://maspypy.github.io/library/graph/block_cut.hpp\n * https://twitter.com/noshi91/status/1529858538650374144\n * N頂点の無向グラフがC個の二重連結成分を持つとき(N+C)頂点の森を作る\n * [0,N)のidxは元のグラフの頂点を表し[N,N+C)のidxは二重連結成分を表す\n * 辺(u,N+v)は頂点uがv番目の二重連結成分に属することを表す\n * 関節点<->次数2以上\n */\ntemplate <class G> Graph<bool> block_cut_tree(const G &g) {\n int n = g.size();\n Graph<bool> tree(n);\n vector<int> low(n, -1), ord(n, -1);\n int id = 0;\n vector<int> tmp;\n tree.g.reserve(2 * n);\n tmp.reserve(n);\n auto dfs = [&](auto &dfs, int cur, int p) -> void {\n ord[cur] = low[cur] = id++;\n tmp.emplace_back(cur);\n int cnt = 0;\n for(auto &to : g[cur]) {\n if(to == p)\n continue;\n if(ord[to] == -1) {\n int sz = ssize(tmp);\n ++cnt;\n dfs(dfs, to, cur);\n chmin(low[cur], low[to]);\n if((p == -1 and cnt > 1) or (p != -1 and low[to] >= ord[cur])) {\n int k = tree.size();\n tree.g.emplace_back();\n tree.add_edge(cur, k);\n while(ssize(tmp) > sz) {\n tree.add_edge(tmp.back(), k);\n tmp.pop_back();\n }\n }\n } else {\n chmin(low[cur], ord[to]);\n }\n }\n if(p == -1) {\n int k = tree.size();\n tree.g.emplace_back();\n for(auto &i : tmp)\n tree.add_edge(i, k);\n tmp.clear();\n }\n };\n for(int i = 0; i < n; ++i) {\n if(ord[i] == -1)\n dfs(dfs, i, -1);\n }\n return tree;\n}\n#line 5 \"/home/y_midori/cp/test/test.test.cpp\"\nvoid solve() {\n INT(n, m);\n vector<ll> v(n);\n input(v);\n Graph<bool> g(n);\n g.read(m);\n auto bct = block_cut_tree(g);\n int N = bct.size();\n vector<ll> sub = v;\n sub.resize(N, 0);\n vector<int> par(N, -1);\n auto dfs = [&](auto &dfs, int cur, int p) -> ll {\n par[cur] = p;\n for(auto &to : bct[cur]) {\n if(to != p) {\n sub[cur] += dfs(dfs, to, cur);\n }\n }\n return sub[cur];\n };\n ll sum = dfs(dfs, 0, -1);\n for(int i = 0; i < n; ++i) {\n ll ans = 0;\n ll tmp = 0;\n for(auto &to : bct[i]) {\n if(to != par[i]) {\n chmax(ans, sub[to]);\n tmp += sub[to];\n }\n }\n if(par[i] != -1) {\n chmax(ans, sum - tmp - v[i]);\n }\n print(ans);\n }\n}\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n solve();\n}","accuracy":1,"time_ms":40,"memory_kb":28500,"score_of_the_acc":-0.628,"final_rank":10},{"submission_id":"aoj_3022_10340579","code_snippet":"// AOJ #3022 Cluster Network\n// 2025.4.1\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(ll n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint n, m, t;\nvector<int> d, low;\nvector<ll> dp, ans, w;\nvector<bool> art;\nvector<ll> sepSum, sepMax;\nvector<vector<int>> g;\n\nvoid dfs(int u, int par) {\n d[u] = low[u] = ++t;\n dp[u] = w[u];\n int cnt = 0;\n for (int v : g[u]) {\n if (v == par) continue;\n if (!d[v]) {\n cnt++;\n dfs(v, u);\n dp[u] += dp[v];\n low[u] = min(low[u], low[v]);\n if (low[v] >= d[u]) {\n art[u] = true;\n sepSum[u] += dp[v];\n sepMax[u] = max(sepMax[u], dp[v]);\n }\n } else low[u] = min(low[u], d[v]);\n }\n if (par == -1 && cnt < 2) art[u] = false;\n}\n\nint main(){\n n = Cin(), m = Cin();\n w.resize(n+1);\n dp.assign(n+1, 0);\n ans.assign(n+1, 0);\n d.assign(n+1, 0);\n low.assign(n+1, 0);\n art.assign(n+1, false);\n sepSum.assign(n+1, 0);\n sepMax.assign(n+1, 0);\n g.assign(n+1, vector<int>());\n\n for (int i = 1; i <= n; i++) w[i] = Cin();\n for (int i = 0; i < m; i++){\n int u = Cin(), v = Cin();\n g[u].push_back(v);\n g[v].push_back(u);\n }\n\n dfs(1, -1);\n\n ll S = 0;\n for (int i = 1; i <= n; i++) S += w[i];\n\n for (int u = 1; u <= n; u++){\n if (!art[u]) ans[u] = S - w[u];\n else if (d[u] == 1) ans[u] = sepMax[u];\n else ans[u] = max(S - w[u] - sepSum[u], sepMax[u]);\n }\n\n for (int i = 1; i <= n; i++) Cout(ans[i]);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":13808,"score_of_the_acc":-0.0618,"final_rank":1},{"submission_id":"aoj_3022_10069875","code_snippet":"//\n// Low-Link を用いた橋列挙と、二重辺連結成分分解・二重頂点連結成分分解\n//\n// cf.\n// hos: グラフ探索アルゴリズムとその応用\n// http://hos.ac/slides/20110504_graph.pdf\n//\n// verified:\n// Yosupo Library Checker - Two-Edge-Connected Components\n// https://judge.yosupo.jp/problem/two_edge_connected_components\n//\n// Yosupo Library Checker - Biconnected Components\n// https://judge.yosupo.jp/problem/biconnected_components\n//\n// ARC 039 D - 旅行会社高橋君（for 二重辺連結成分分解）\n// https://arc039.contest.atcoder.jp/tasks/arc039_d\n//\n// TTPC 2024 DIV1 A - Don't Detect Cycle（for 橋列挙）\n// https://atcoder.jp/contests/ttpc2024_1/tasks/ttpc2024_1_a\n//\n// ARC 045 D - みんな仲良し高橋君（for 二重頂点連結成分分解した Block-Cut 木上の DP）\n// https://atcoder.jp/contests/arc045/tasks/arc045_d\n//\n// AOJ 3022 Problem J: Cluster Network\n// https://onlinejudge.u-aizu.ac.jp/problems/3022\n//\n\n\n/*\n アイディア: DFS をしたとき、DFS 後退辺は橋とはなりえない\n \n ・ord[v] := 頂点を訪れた順番\n ・low[v] := v から「DFS 木の根から葉へ進む」or「後退辺を葉から根へ進む」ことによって辿り着ける頂点の ord の最小値\n \n DFS で u -> ... -> v と来て、v から u への後退辺があると、このサイクルの low がすべて ord[u] (以下) になる感じ\n このことから、\n \n DFS-search で、辺 v - ch を v -> ch の順に探索したときに、\n 辺 v-to が橋 ⇔ ord[v] < low[ch]\n */\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n// Edge Class\ntemplate<class T> struct Edge {\n int from, to;\n T val;\n Edge() : from(-1), to(-1), val(-1) { }\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\n friend ostream& operator << (ostream& s, const Edge& e) {\n return s << e.from << \"->\" << e.to;\n }\n};\n\n// graph class\ntemplate<class T> struct Graph {\n vector<vector<Edge<T>>> list;\n \n Graph() { }\n Graph(int n) : list(n) { }\n Graph(const Graph<T> &G) : list(G.list) { }\n void init(int n) {\n list.assign(n, vector<Edge<T>>());\n }\n Graph &operator = (const Graph &g) {\n list = g.list;\n return *this;\n }\n\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\n const size_t size() const { return list.size(); }\n const void clear() {\n list.clear();\n }\n const void resize(int n) {\n list.resize(n);\n }\n\n void add_edge(int from, int to, T val = -1) {\n list[from].push_back(Edge(from, to, val));\n list[to].push_back(Edge(to, from, val));\n }\n\n friend ostream &operator << (ostream &s, const Graph &G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \" -> \";\n for (const auto &e : G[i]) s << e.to << \" \";\n s << endl;\n }\n return s;\n }\n};\n\n// low-link\ntemplate<class T> struct LowLink {\n // results\n vector<int> ord, low;\n vector<int> aps; // articulation points\n vector<Edge<T>> brs; // brideges\n\n // constructor\n LowLink() { }\n LowLink(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // solver\n int dfs(const Graph<T> &G, int t, int v, int p) {\n ord[v] = low[v] = t++;\n int num_of_children = 0;\n bool exist_articulation = false, is_multiple_edge = false;\n for (const auto &e : G[v]) {\n if (ord[e.to] == -1) {\n num_of_children++;\n t = dfs(G, t, e.to, v);\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\n if (ord[v] < low[e.to]) brs.push_back(e);\n } else if (e.to != p || is_multiple_edge) {\n low[v] = min(low[v], ord[e.to]); // back edge\n } else {\n is_multiple_edge = true;\n }\n }\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\n aps.emplace_back(v);\n }\n return t;\n }\n\n void solve(const Graph<T> &G) {\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\n if (ord[v] == -1) k = dfs(G, k, v, -1);\n }\n }\n};\n\n// Two-Edge-Connected Components decomposition\ntemplate<class T> struct TwoEdgeConnectedComponentsDecomposition {\n // results\n LowLink<T> ll;\n vector<int> cmp;\n vector<vector<int>> groups, tree;\n\n // constructor\n TwoEdgeConnectedComponentsDecomposition() { }\n TwoEdgeConnectedComponentsDecomposition(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // solver\n int dfs(const Graph<T> &G, int t, int v, int p) {\n if (p >= 0 && ll.ord[p] >= ll.low[v]) cmp[v] = cmp[p];\n else cmp[v] = t++;\n for (const auto &e : G[v]) {\n if (cmp[e.to] == -1) t = dfs(G, t, e.to, v);\n }\n return t;\n }\n\n void solve(const Graph<T> &G) {\n ll.init(G);\n cmp.assign(G.size(), -1);\n int t = 0;\n for (int v = 0; v < (int)G.size(); v++) {\n if (cmp[v] == -1) t = dfs(G, t, v, -1);\n }\n groups.resize(t);\n tree.resize(t);\n for (int v = 0; v < (int)G.size(); v++) {\n groups[cmp[v]].push_back(v);\n }\n for (const auto &e : ll.brs) {\n int u = cmp[e.from], v = cmp[e.to];\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n }\n};\n\n// BiConnected Components decomposition\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\n// (A: size of aps, C: num of components)\ntemplate<class T> struct BiConnectedComponentsDecomposition {\n // result\n LowLink<T> ll;\n vector<int> id_ap; // index of the articulation point (size: V)\n vector<int> id_cc; // index of the connected component (size: V)\n vector<vector<int>> groups; // biconnected components (size: C)\n vector<vector<int>> tree; // block-cut tree (size: A + C)\n\n // intermediate results\n vector<int> seen, finished;\n vector<vector<pair<int, int>>> grouped_edges;\n vector<pair<int, int>> tmp_edges;\n\n // constructor\n BiConnectedComponentsDecomposition() { }\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // getter, original graph to block-cut tree (v: node of orignal graph)\n int is_ap_original_graph(int v) const {\n return (id_ap[v] != -1);\n }\n int get_id(int v) const {\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\n }\n\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\n int is_ap(int v) const {\n return (v < ll.aps.size());\n }\n int get_ap(int v) const {\n if (v >= (int)ll.aps.size()) return -1; // not ap\n else return ll.aps[v];\n }\n int get_size(int v) const { // including aps\n if (v < (int)ll.aps.size()) return 1; // ap\n else return groups[v - ll.aps.size()].size();\n }\n vector<int> get_group(int v) const {\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\n else return groups[v - ll.aps.size()];\n }\n\n // solver\n void dfs(const Graph<T> &G, int v, int p) {\n seen[v] = true;\n if (G[v].empty()) {\n groups.emplace_back(vector<int>({v}));\n }\n for (const auto &e : G[v]) {\n if (e.to == p) continue;\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\n tmp_edges.emplace_back(minmax(v, e.to));\n }\n if (!seen[e.to]) {\n dfs(G, e.to, v);\n if (ll.low[e.to] >= ll.ord[v]) {\n groups.emplace_back(vector<int>({v}));\n grouped_edges.emplace_back();\n int ap = v;\n while (!tmp_edges.empty()) {\n const auto &e2 = tmp_edges.back();\n if (!finished[e2.first] && e2.first != ap) {\n groups.back().emplace_back(e2.first);\n finished[e2.first] = true;\n }\n if (!finished[e2.second] && e2.second != ap) {\n groups.back().emplace_back(e2.second);\n finished[e2.second] = true;\n }\n grouped_edges.back().emplace_back(e2);\n tmp_edges.pop_back();\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\n }\n }\n }\n }\n }\n\n void solve(const Graph<T> &G) {\n ll.init(G);\n seen.assign(G.size(), false), finished.assign(G.size(), false);\n for (int v = 0; v < (int)G.size(); v++) {\n if (!seen[v]) dfs(G, v, -1);\n }\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\n for (int i = 0; i < (int)ll.aps.size(); i++) {\n id_ap[ll.aps[i]] = i;\n }\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\n vector<int> last(G.size(), -1);\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\n vector<int> st;\n for (auto [u, v] : grouped_edges[i]) {\n st.push_back(u), st.push_back(v);\n }\n for (auto v : st) {\n if (id_ap[v] == -1) {\n id_cc[v] = i + ll.aps.size();\n } else if (last[v] != i) {\n tree[i + ll.aps.size()].push_back(id_ap[v]);\n tree[id_ap[v]].push_back(i + ll.aps.size());\n last[v] = i;\n }\n }\n }\n }\n};\n\n\n\n//------------------------------//\n// Examples\n//------------------------------//\n\n// Yosupo Library Checker - Two-Edge-Connected Components\nvoid YosupoLibraryCheckerTwoEdgeConnectedComponents() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n int N, M, a, b;\n cin >> N >> M;\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> a >> b;\n G.add_edge(a, b, i);\n }\n TwoEdgeConnectedComponentsDecomposition<int> tecc(G);\n\n cout << tecc.groups.size() << '\\n';\n for (const auto &group : tecc.groups) {\n cout << group.size();\n for (auto v : group) cout << \" \" << v;\n cout << '\\n';\n }\n}\n\n// Yosupo Library Checker - BiConnected Components\nvoid YosupoLibraryCheckerBiConnectedComponents() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n int N, M, a, b;\n cin >> N >> M;\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> a >> b;\n G.add_edge(a, b, i);\n }\n BiConnectedComponentsDecomposition<int> bcc(G);\n\n cout << bcc.groups.size() << '\\n';\n for (const auto &group : bcc.groups) {\n cout << group.size();\n for (auto v : group) cout << \" \" << v;\n cout << '\\n';\n }\n}\n\n// ARC 039 D - 旅行会社高橋君\nvoid ARC_039_D() {\n int V, E, s, t;\n cin >> V >> E;\n Graph<int> original_graph(V);\n for (int i = 0; i < E; ++i) {\n cin >> s >> t, s--, t--;\n original_graph.add_edge(s, t, 1);\n }\n TwoEdgeConnectedComponentsDecomposition<int> tecc(original_graph);\n\n // LCA\n auto tree = tecc.tree;\n int h = 1;\n while ((1<<h) < V) ++h;\n vector<vector<int>> parent(h, vector<int>(V, -1));\n vector<int> depth(V, -1);\n\n auto dfs = [&](auto dfs, int v, int p, int d) -> void {\n parent[0][v] = p;\n depth[v] = d;\n for (auto to : tree[v]) if (to != p) dfs(dfs, to, v, d+1);\n };\n\n dfs(dfs, 0, -1, 0);\n for (int i = 0; i+1 < (int)parent.size(); ++i)\n for (int v = 0; v < V; ++v)\n if (parent[i][v] != -1)\n parent[i+1][v] = parent[i][parent[i][v]];\n\n auto get = [&](int u, int v) -> int {\n if (depth[u] > depth[v]) swap(u, v);\n for (int i = 0; i < (int)parent.size(); ++i)\n if ( (depth[v] - depth[u]) & (1<<i) )\n v = parent[i][v];\n if (u == v) return u;\n for (int i = (int)parent.size()-1; i >= 0; --i) {\n if (parent[i][u] != parent[i][v]) {\n u = parent[i][u];\n v = parent[i][v];\n }\n }\n return parent[0][u];\n };\n\n auto dist = [&](int u, int v) -> int {\n int lca = get(u, v);\n return abs(depth[u] - depth[lca]) + abs(depth[v] - depth[lca]);\n };\n \n // queries\n int Q, a, b, c;\n cin >> Q;\n for (int _ = 0; _ < Q; ++_) {\n cin >> a >> b >> c, a--, b--, c--;\n a = tecc.cmp[a], b = tecc.cmp[b], c = tecc.cmp[c];\n int ab = dist(a, b);\n int bc = dist(b, c);\n int ac = dist(a, c);\n if (ab + bc == ac) puts(\"OK\");\n else puts(\"NG\");\n }\n}\n\n// TTPC 2024 DIV1 A - Don't Detect Cycle\nvoid TTPC_2024_DIV1_A() {\n int T;\n cin >> T;\n\n while (T--) {\n int N, M, u, v;\n cin >> N >> M;\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> u >> v, u--, v--;\n G.add_edge(u, v, i);\n }\n\n vector<int> res, former, latter;\n while (true) {\n set<pair<int,int>> ers;\n\n // erase bridges\n LowLink<int> ll(G);\n for (auto e : ll.brs) {\n former.push_back(e.val);\n ers.insert(minmax(e.from, e.to));\n }\n\n // erase edges whose endpoints with 2 degree\n vector<int> deg(N, 0);\n for (int v = 0; v < N; v++) {\n for (auto e : G[v]) {\n if (ers.count(minmax(e.from, e.to))) continue;\n deg[v]++;\n }\n }\n for (int v = 0; v < N; v++) {\n for (auto e : G[v]) {\n if (e.from > e.to) continue;\n if (ers.count(minmax(e.from, e.to))) continue;\n if (deg[e.from] == 2 && deg[e.to] == 2) {\n latter.push_back(e.val);\n ers.insert(minmax(e.from, e.to));\n }\n }\n }\n\n if (ers.empty()) break;\n\n // build new graph\n Graph<int> G2(N);\n for (int v = 0; v < N; v++) {\n for (auto e : G[v]) {\n if (e.from > e.to) continue;\n if (ers.count(minmax(e.from, e.to))) continue;\n G2.add_edge(e.from, e.to, e.val);\n }\n }\n G = G2;\n }\n\n reverse(latter.begin(), latter.end());\n for (auto v : former) res.push_back(v);\n for (auto v : latter) res.push_back(v);\n if (res.size() < M) {\n cout << -1 << endl;\n } else {\n for (auto id : res) cout << id+1 << \" \";\n cout << endl;\n }\n }\n}\n\n\n// Union-Find\nstruct UnionFind {\n // core member\n vector<int> par, nex;\n\n // constructor\n UnionFind() { }\n UnionFind(int N) : par(N, -1), nex(N) {\n init(N);\n }\n void init(int N) {\n par.assign(N, -1);\n nex.resize(N);\n for (int i = 0; i < N; ++i) nex[i] = i;\n }\n \n // core methods\n int root(int x) {\n if (par[x] < 0) return x;\n else return par[x] = root(par[x]);\n }\n \n bool same(int x, int y) {\n return root(x) == root(y);\n }\n \n bool merge(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y); // merge technique\n par[x] += par[y];\n par[y] = x;\n swap(nex[x], nex[y]);\n return true;\n }\n \n int size(int x) {\n return -par[root(x)];\n }\n \n // get group\n vector<int> group(int x) {\n vector<int> res({x});\n while (nex[res.back()] != x) res.push_back(nex[res.back()]);\n return res;\n }\n vector<vector<int>> groups() {\n vector<vector<int>> member(par.size());\n for (int v = 0; v < (int)par.size(); ++v) {\n member[root(v)].push_back(v);\n }\n vector<vector<int>> res;\n for (int v = 0; v < (int)par.size(); ++v) {\n if (!member[v].empty()) res.push_back(member[v]);\n }\n return res;\n }\n \n // debug\n friend ostream& operator << (ostream &s, UnionFind uf) {\n const vector<vector<int>> &gs = uf.groups();\n for (const vector<int> &g : gs) {\n s << \"group: \";\n for (int v : g) s << v << \" \";\n s << endl;\n }\n return s;\n }\n};\n\nvoid ARC_045_D() {\n // 入力\n int N;\n cin >> N;\n vector<int> X(N*2+1), Y(N*2+1);\n for (int i = 0; i < N*2+1; i++) cin >> X[i] >> Y[i];\n\n // 横方向\n using pint = pair<int,int>;\n vector<vector<pint>> xy(N*2+2), yx(N*2+2);\n for (int i = 0; i < N*2+1; i++) {\n xy[X[i]].emplace_back(Y[i], i);\n yx[Y[i]].emplace_back(X[i], i);\n }\n for (int v = 0; v <= N*2+1; v++) {\n sort(xy[v].begin(), xy[v].end());\n sort(yx[v].begin(), yx[v].end());\n }\n\n // グラフを作る（横・縦に「隣接」「1個飛ばし」のみ辺を張る）\n Graph<int> G(N*2+1);\n for (int v = 0; v <= N*2+1; v++) {\n for (int i = 0; i < xy[v].size(); i++) {\n if (i+1 < xy[v].size()) G.add_edge(xy[v][i].second, xy[v][i+1].second);\n if (i+2 < xy[v].size()) G.add_edge(xy[v][i].second, xy[v][i+2].second);\n }\n for (int i = 0; i < yx[v].size(); i++) {\n if (i+1 < yx[v].size()) G.add_edge(yx[v][i].second, yx[v][i+1].second);\n if (i+2 < yx[v].size()) G.add_edge(yx[v][i].second, yx[v][i+2].second);\n }\n }\n\n // Block-Cut 木の構築\n BiConnectedComponentsDecomposition<int> bcc(G);\n\n // グラフ G の各連結成分のサイズを求めて、間接点以外の点の答えを求める\n UnionFind uf(N*2+1);\n for (int v = 0; v < N*2+1; v++) for (auto e : G[v]) uf.merge(e.from, e.to);\n int odd_num = 0;\n for (int v = 0; v < N*2+1; v++) if (uf.root(v) == v && uf.size(v) % 2 == 1) odd_num++;\n if (odd_num > 1) {\n // 奇数サイズの連結成分が複数個ある場合はすべて NG（以降、奇数サイズの連結成分は 1 個とする)\n for (int v = 0; v < N*2+1; v++) cout << \"NG\" << endl;\n return;\n }\n vector<bool> res(N*2+1, false);\n for (int v = 0; v < N*2+1; v++) {\n // 奇数サイズかつ間接点以外は true (間接点の結果はあとで上書きする)\n if (uf.size(v) % 2 == 1) {\n res[v] = true;\n }\n }\n\n // Block-Cut 木上の探索により、間接点の答えを求める\n auto tree = bcc.tree;\n vector<bool> seen(tree.size(), false);\n auto dfs = [&](auto dfs, int v, int p) -> int {\n seen[v] = true;\n\n // 奇数サイズの連結成分を二重頂点連結成分分解してできる Block-Cut 木を\n // 根付き木として探索したとき、各間接点について、\n // ある子頂点が存在して、それを根とする部分木のサイズが奇数ならば、\"NG\"\n int siz = bcc.get_size(v), odd_num = 0;\n for (auto ch : tree[v]) {\n if (ch == p) continue;\n int tmp = dfs(dfs, ch, v) - 1;\n if (tmp % 2 == 1) odd_num++;\n siz += tmp;\n }\n if (bcc.is_ap(v)) {\n int apv = bcc.get_ap(v); // Block-cut 木の頂点 v に対応するもとのグラフの頂点\n if (uf.size(apv) % 2 == 1 && odd_num > 0) {\n res[apv] = false;\n }\n }\n return siz;\n };\n for (int v = 0; v < tree.size(); v++) {\n if (seen[v]) continue;\n dfs(dfs, v, -1);\n } \n\n // 出力\n for (int v = 0; v < res.size(); v++) {\n if (res[v]) cout << \"OK\" << endl;\n else cout << \"NG\" << endl;\n }\n}\n\n// AOJ 3022 - Cluster Network\nvoid AOJ_3022() {\n long long N, M, u, v, all = 0;\n cin >> N >> M;\n vector<long long> w(N), res(N, 0);\n for (int i = 0; i < N; i++) cin >> w[i], all += w[i];\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> u >> v, u--, v--;\n G.add_edge(u, v), G.add_edge(v, u);\n }\n\n // Block-Cut 木上を形成\n BiConnectedComponentsDecomposition<int> bcc(G);\n\n // 関節点以外について求める\n for (int ov = 0; ov < N; ov++) {\n if (!bcc.is_ap_original_graph(ov)) res[ov] = all - w[ov];\n }\n\n // 関節点について求める：Block-Cut 木上の DP\n auto tree = bcc.tree;\n vector<long long> sum(tree.size(), 0);\n for (int v = 0; v < tree.size(); v++) {\n const auto &group = bcc.get_group(v);\n for (auto ov : group) sum[v] += w[ov];\n }\n auto rec = [&](auto rec, int v, int p) -> long long {\n const auto &group = bcc.get_group(v);\n long long ma = 0, all_weight = sum[v];\n for (auto ch : tree[v]) {\n if (ch == p) continue;\n long long sub = rec(rec, ch, v);\n if (bcc.is_ap(v)) sub -= sum[v];\n else sub -= sum[ch];\n ma = max(ma, sub), all_weight += sub;\n }\n\n // 関節点について処理する\n if (bcc.is_ap(v)) {\n int ov = bcc.get_ap(v);\n long long rem = all - all_weight;\n ma = max(ma, rem);\n res[ov] = ma;\n }\n return all_weight;\n };\n rec(rec, 0, -1);\n\n for (auto val : res) cout << val << endl;\n}\n\nint main() {\n //YosupoLibraryCheckerTwoEdgeConnectedComponents();\n //YosupoLibraryCheckerBiConnectedComponents();\n //ARC_039_D();\n //TTPC_2024_DIV1_A();\n //ARC_045_D();\n AOJ_3022();\n}","accuracy":1,"time_ms":120,"memory_kb":45696,"score_of_the_acc":-1.5711,"final_rank":17},{"submission_id":"aoj_3022_10069868","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// Edge Class\ntemplate<class T> struct Edge {\n int from, to;\n T val;\n Edge() : from(-1), to(-1), val(-1) { }\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\n friend ostream& operator << (ostream& s, const Edge& e) {\n return s << e.from << \"->\" << e.to;\n }\n};\n\n// graph class\ntemplate<class T> struct Graph {\n vector<vector<Edge<T>>> list;\n \n Graph() { }\n Graph(int n) : list(n) { }\n Graph(const Graph<T> &G) : list(G.list) { }\n void init(int n) {\n list.assign(n, vector<Edge<T>>());\n }\n Graph &operator = (const Graph &g) {\n list = g.list;\n return *this;\n }\n\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\n const size_t size() const { return list.size(); }\n const void clear() {\n list.clear();\n }\n const void resize(int n) {\n list.resize(n);\n }\n\n void add_edge(int from, int to, T val = -1) {\n list[from].push_back(Edge(from, to, val));\n list[to].push_back(Edge(to, from, val));\n }\n\n friend ostream &operator << (ostream &s, const Graph &G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \" -> \";\n for (const auto &e : G[i]) s << e.to << \" \";\n s << endl;\n }\n return s;\n }\n};\n\n// low-link\ntemplate<class T> struct LowLink {\n // results\n vector<int> ord, low;\n vector<int> aps; // articulation points\n vector<Edge<T>> brs; // brideges\n\n // constructor\n LowLink() { }\n LowLink(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // solver\n int dfs(const Graph<T> &G, int t, int v, int p) {\n ord[v] = low[v] = t++;\n int num_of_children = 0;\n bool exist_articulation = false, is_multiple_edge = false;\n for (const auto &e : G[v]) {\n if (ord[e.to] == -1) {\n num_of_children++;\n t = dfs(G, t, e.to, v);\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\n if (ord[v] < low[e.to]) brs.push_back(e);\n } else if (e.to != p || is_multiple_edge) {\n low[v] = min(low[v], ord[e.to]); // back edge\n } else {\n is_multiple_edge = true;\n }\n }\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\n aps.emplace_back(v);\n }\n return t;\n }\n\n void solve(const Graph<T> &G) {\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\n if (ord[v] == -1) k = dfs(G, k, v, -1);\n }\n }\n};\n\n// BiConnected Components decomposition\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\n// (A: size of aps, C: num of components)\ntemplate<class T> struct BiConnectedComponentsDecomposition {\n // result\n LowLink<T> ll;\n vector<int> id_ap; // index of the articulation point (size: V)\n vector<int> id_cc; // index of the connected component (size: V)\n vector<vector<int>> groups; // biconnected components (size: C)\n vector<vector<int>> tree; // block-cut tree (size: A + C)\n\n // intermediate results\n vector<int> seen, finished;\n vector<vector<pair<int, int>>> grouped_edges;\n vector<pair<int, int>> tmp_edges;\n\n // constructor\n BiConnectedComponentsDecomposition() { }\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // getter, original graph to block-cut tree (v: node of orignal graph)\n int is_ap_original_graph(int v) const {\n return (id_ap[v] != -1);\n }\n int get_id(int v) const {\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\n }\n\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\n int is_ap(int v) const {\n return (v < ll.aps.size());\n }\n int get_ap(int v) const {\n if (v >= (int)ll.aps.size()) return -1; // not ap\n else return ll.aps[v];\n }\n int get_size(int v) const { // including aps\n if (v < (int)ll.aps.size()) return 1; // ap\n else return groups[v - ll.aps.size()].size();\n }\n vector<int> get_group(int v) const {\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\n else return groups[v - ll.aps.size()];\n }\n\n // solver\n void dfs(const Graph<T> &G, int v, int p) {\n seen[v] = true;\n if (G[v].empty()) {\n groups.emplace_back(vector<int>({v}));\n }\n for (const auto &e : G[v]) {\n if (e.to == p) continue;\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\n tmp_edges.emplace_back(minmax(v, e.to));\n }\n if (!seen[e.to]) {\n dfs(G, e.to, v);\n if (ll.low[e.to] >= ll.ord[v]) {\n groups.emplace_back(vector<int>({v}));\n grouped_edges.emplace_back();\n int ap = v;\n while (!tmp_edges.empty()) {\n const auto &e2 = tmp_edges.back();\n if (!finished[e2.first] && e2.first != ap) {\n groups.back().emplace_back(e2.first);\n finished[e2.first] = true;\n }\n if (!finished[e2.second] && e2.second != ap) {\n groups.back().emplace_back(e2.second);\n finished[e2.second] = true;\n }\n grouped_edges.back().emplace_back(e2);\n tmp_edges.pop_back();\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\n }\n }\n }\n }\n }\n\n void solve(const Graph<T> &G) {\n ll.init(G);\n seen.assign(G.size(), false), finished.assign(G.size(), false);\n for (int v = 0; v < (int)G.size(); v++) {\n if (!seen[v]) dfs(G, v, -1);\n }\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\n for (int i = 0; i < (int)ll.aps.size(); i++) {\n id_ap[ll.aps[i]] = i;\n }\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\n vector<int> last(G.size(), -1);\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\n vector<int> st;\n for (auto [u, v] : grouped_edges[i]) {\n st.push_back(u), st.push_back(v);\n }\n for (auto v : st) {\n if (id_ap[v] == -1) {\n id_cc[v] = i + ll.aps.size();\n } else if (last[v] != i) {\n tree[i + ll.aps.size()].push_back(id_ap[v]);\n tree[id_ap[v]].push_back(i + ll.aps.size());\n last[v] = i;\n }\n }\n }\n }\n};\n\n\nvoid AOJ_3022() {\n long long N, M, u, v, all = 0;\n cin >> N >> M;\n vector<long long> w(N), res(N, 0);\n for (int i = 0; i < N; i++) cin >> w[i], all += w[i];\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> u >> v, u--, v--;\n G.add_edge(u, v), G.add_edge(v, u);\n }\n\n // Block-Cut 木上を形成\n BiConnectedComponentsDecomposition<int> bcc(G);\n\n // 関節点以外について求める\n for (int ov = 0; ov < N; ov++) {\n if (!bcc.is_ap_original_graph(ov)) res[ov] = all - w[ov];\n }\n\n // 関節点について求める：Block-Cut 木上の DP\n auto tree = bcc.tree;\n vector<long long> sum(tree.size(), 0);\n for (int v = 0; v < tree.size(); v++) {\n const auto &group = bcc.get_group(v);\n for (auto ov : group) sum[v] += w[ov];\n }\n auto rec = [&](auto rec, int v, int p) -> long long {\n const auto &group = bcc.get_group(v);\n long long ma = 0, all_weight = sum[v];\n for (auto ch : tree[v]) {\n if (ch == p) continue;\n long long sub = rec(rec, ch, v);\n if (bcc.is_ap(v)) sub -= sum[v];\n else sub -= sum[ch];\n ma = max(ma, sub), all_weight += sub;\n }\n\n // 関節点について処理する\n if (bcc.is_ap(v)) {\n int ov = bcc.get_ap(v);\n long long rem = all - all_weight;\n ma = max(ma, rem);\n res[ov] = ma;\n }\n return all_weight;\n };\n rec(rec, 0, -1);\n\n for (auto val : res) cout << val << endl;\n}\n\n\nint main() {\n AOJ_3022();\n}","accuracy":1,"time_ms":120,"memory_kb":45568,"score_of_the_acc":-1.5678,"final_rank":16},{"submission_id":"aoj_3022_10069864","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\n#define DEBUG 1\n#define COUT(x) if (DEBUG) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, deque<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for (auto it : P) { s << \"<\" << it << \"> \"; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, multiset<T> P)\n{ for (auto it : P) { s << \"<\" << it << \"> \"; } return s; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for (auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s; }\n\n\n\n\n// Union-Find\nstruct UnionFind {\n // core member\n vector<int> par, nex;\n\n // constructor\n UnionFind() { }\n UnionFind(int N) : par(N, -1), nex(N) {\n init(N);\n }\n void init(int N) {\n par.assign(N, -1);\n nex.resize(N);\n for (int i = 0; i < N; ++i) nex[i] = i;\n }\n \n // core methods\n int root(int x) {\n if (par[x] < 0) return x;\n else return par[x] = root(par[x]);\n }\n \n bool same(int x, int y) {\n return root(x) == root(y);\n }\n \n bool merge(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y); // merge technique\n par[x] += par[y];\n par[y] = x;\n swap(nex[x], nex[y]);\n return true;\n }\n \n int size(int x) {\n return -par[root(x)];\n }\n \n // get group\n vector<int> group(int x) {\n vector<int> res({x});\n while (nex[res.back()] != x) res.push_back(nex[res.back()]);\n return res;\n }\n vector<vector<int>> groups() {\n vector<vector<int>> member(par.size());\n for (int v = 0; v < (int)par.size(); ++v) {\n member[root(v)].push_back(v);\n }\n vector<vector<int>> res;\n for (int v = 0; v < (int)par.size(); ++v) {\n if (!member[v].empty()) res.push_back(member[v]);\n }\n return res;\n }\n \n // debug\n friend ostream& operator << (ostream &s, UnionFind uf) {\n const vector<vector<int>> &gs = uf.groups();\n for (const vector<int> &g : gs) {\n s << \"group: \";\n for (int v : g) s << v << \" \";\n s << endl;\n }\n return s;\n }\n};\n\n// Edge Class\ntemplate<class T> struct Edge {\n int from, to;\n T val;\n Edge() : from(-1), to(-1), val(-1) { }\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\n friend ostream& operator << (ostream& s, const Edge& e) {\n return s << e.from << \"->\" << e.to;\n }\n};\n\n// graph class\ntemplate<class T> struct Graph {\n vector<vector<Edge<T>>> list;\n \n Graph() { }\n Graph(int n) : list(n) { }\n Graph(const Graph<T> &G) : list(G.list) { }\n void init(int n) {\n list.assign(n, vector<Edge<T>>());\n }\n Graph &operator = (const Graph &g) {\n list = g.list;\n return *this;\n }\n\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\n const size_t size() const { return list.size(); }\n const void clear() {\n list.clear();\n }\n const void resize(int n) {\n list.resize(n);\n }\n\n void add_edge(int from, int to, T val = -1) {\n list[from].push_back(Edge(from, to, val));\n list[to].push_back(Edge(to, from, val));\n }\n\n friend ostream &operator << (ostream &s, const Graph &G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \" -> \";\n for (const auto &e : G[i]) s << e.to << \" \";\n s << endl;\n }\n return s;\n }\n};\n\n// low-link\ntemplate<class T> struct LowLink {\n // results\n vector<int> ord, low;\n vector<int> aps; // articulation points\n vector<Edge<T>> brs; // brideges\n\n // constructor\n LowLink() { }\n LowLink(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // solver\n int dfs(const Graph<T> &G, int t, int v, int p) {\n ord[v] = low[v] = t++;\n int num_of_children = 0;\n bool exist_articulation = false, is_multiple_edge = false;\n for (const auto &e : G[v]) {\n if (ord[e.to] == -1) {\n num_of_children++;\n t = dfs(G, t, e.to, v);\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\n if (ord[v] < low[e.to]) brs.push_back(e);\n } else if (e.to != p || is_multiple_edge) {\n low[v] = min(low[v], ord[e.to]); // back edge\n } else {\n is_multiple_edge = true;\n }\n }\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\n aps.emplace_back(v);\n }\n return t;\n }\n\n void solve(const Graph<T> &G) {\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\n if (ord[v] == -1) k = dfs(G, k, v, -1);\n }\n }\n};\n\n// BiConnected Components decomposition\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\n// (A: size of aps, C: num of components)\ntemplate<class T> struct BiConnectedComponentsDecomposition {\n // result\n LowLink<T> ll;\n vector<int> id_ap; // index of the articulation point (size: V)\n vector<int> id_cc; // index of the connected component (size: V)\n vector<vector<int>> groups; // biconnected components (size: C)\n vector<vector<int>> tree; // block-cut tree (size: A + C)\n\n // intermediate results\n vector<int> seen, finished;\n vector<vector<pair<int, int>>> grouped_edges;\n vector<pair<int, int>> tmp_edges;\n\n // constructor\n BiConnectedComponentsDecomposition() { }\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\n solve(G);\n }\n void init(const Graph<T> &G) {\n solve(G);\n }\n\n // getter, original graph to block-cut tree (v: node of orignal graph)\n int is_ap_original_graph(int v) const {\n return (id_ap[v] != -1);\n }\n int get_id(int v) const {\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\n }\n\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\n int is_ap(int v) const {\n return (v < ll.aps.size());\n }\n int get_ap(int v) const {\n if (v >= (int)ll.aps.size()) return -1; // not ap\n else return ll.aps[v];\n }\n int get_size(int v) const { // including aps\n if (v < (int)ll.aps.size()) return 1; // ap\n else return groups[v - ll.aps.size()].size();\n }\n vector<int> get_group(int v) const {\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\n else return groups[v - ll.aps.size()];\n }\n\n // solver\n void dfs(const Graph<T> &G, int v, int p) {\n seen[v] = true;\n if (G[v].empty()) {\n groups.emplace_back(vector<int>({v}));\n }\n for (const auto &e : G[v]) {\n if (e.to == p) continue;\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\n tmp_edges.emplace_back(minmax(v, e.to));\n }\n if (!seen[e.to]) {\n dfs(G, e.to, v);\n if (ll.low[e.to] >= ll.ord[v]) {\n groups.emplace_back(vector<int>({v}));\n grouped_edges.emplace_back();\n int ap = v;\n while (!tmp_edges.empty()) {\n const auto &e2 = tmp_edges.back();\n if (!finished[e2.first] && e2.first != ap) {\n groups.back().emplace_back(e2.first);\n finished[e2.first] = true;\n }\n if (!finished[e2.second] && e2.second != ap) {\n groups.back().emplace_back(e2.second);\n finished[e2.second] = true;\n }\n grouped_edges.back().emplace_back(e2);\n tmp_edges.pop_back();\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\n }\n }\n }\n }\n }\n\n void solve(const Graph<T> &G) {\n ll.init(G);\n seen.assign(G.size(), false), finished.assign(G.size(), false);\n for (int v = 0; v < (int)G.size(); v++) {\n if (!seen[v]) dfs(G, v, -1);\n }\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\n for (int i = 0; i < (int)ll.aps.size(); i++) {\n id_ap[ll.aps[i]] = i;\n }\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\n vector<int> last(G.size(), -1);\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\n vector<int> st;\n for (auto [u, v] : grouped_edges[i]) {\n st.push_back(u), st.push_back(v);\n }\n for (auto v : st) {\n if (id_ap[v] == -1) {\n id_cc[v] = i + ll.aps.size();\n } else if (last[v] != i) {\n tree[i + ll.aps.size()].push_back(id_ap[v]);\n tree[id_ap[v]].push_back(i + ll.aps.size());\n last[v] = i;\n }\n }\n }\n }\n};\n\nint main() {\n int N, M, u, v;\n cin >> N >> M;\n vector<long long> w(N), res(N, 0);\n for (int i = 0; i < N; i++) cin >> w[i];\n\n UnionFind uf(N);\n Graph<int> G(N);\n for (int i = 0; i < M; i++) {\n cin >> u >> v, u--, v--;\n G.add_edge(u, v);\n G.add_edge(v, u);\n uf.merge(u, v);\n }\n vector<long long> all_comp_sum(N, 0);\n for (int v = 0; v < N; v++) {\n int r = uf.root(v);\n all_comp_sum[r] += w[v];\n }\n\n // Block-Cut 木上を形成\n BiConnectedComponentsDecomposition<int> bcc(G);\n\n // 関節点以外について求める\n for (int ov = 0; ov < N; ov++) {\n if (!bcc.is_ap_original_graph(ov)) {\n res[ov] = all_comp_sum[uf.root(ov)] - w[ov];\n }\n }\n\n // 関節点について求める：Block-Cut 木上の DP\n auto tree = bcc.tree;\n vector<long long> sum(tree.size(), 0);\n for (int v = 0; v < tree.size(); v++) {\n const auto &group = bcc.get_group(v);\n for (auto ov : group) sum[v] += w[ov];\n\n //cout << v << \": \" << group << \": \" << sum[v] << endl;\n }\n vector<bool> seen(tree.size(), false);\n auto rec = [&](auto rec, int v, int p) -> long long {\n seen[v] = true;\n const auto &group = bcc.get_group(v);\n long long ma = 0, all_weight = sum[v];\n for (auto ch : tree[v]) {\n if (ch == p) continue;\n long long sub = rec(rec, ch, v);\n if (bcc.is_ap(v)) sub -= sum[v];\n else sub -= sum[ch];\n ma = max(ma, sub), all_weight += sub;\n }\n\n // 関節点について処理する\n if (bcc.is_ap(v)) {\n int ov = bcc.get_ap(v);\n long long rem = all_comp_sum[uf.root(ov)] - all_weight;\n ma = max(ma, rem);\n res[ov] = ma;\n }\n \n //cout << v << \": \" << all_weight << endl;\n return all_weight;\n };\n for (int v = 0; v < tree.size(); v++) {\n if (seen[v]) continue;\n rec(rec, v, -1);\n }\n\n for (auto val : res) cout << val << endl;\n}","accuracy":1,"time_ms":120,"memory_kb":47220,"score_of_the_acc":-1.6104,"final_rank":19},{"submission_id":"aoj_3022_9637515","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<vector<int>> adj, adj2;\nvector<int> low, order;\nvector<long long> val;\nint timer = 0;\n\nvoid dfs(int u, int p) {\n low[u] = order[u] = timer++;\n for (int &v: adj[u]) {\n if (order[v] == -1) {\n dfs(v, u);\n adj2[u].push_back(v);\n val[u] += val[v];\n low[u] = min(low[u], low[v]);\n } else if (v != p)\n low[u] = min(low[u], order[v]);\n\n }\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n adj.assign(n + 1, {});\n adj2.assign(n + 1, {});\n low.assign(n + 1, {});\n order.assign(n + 1, -1);\n val.assign(n + 1, -1);\n\n for (int u = 1; u <= n; ++u)\n cin >> val[u];\n\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >> u >> v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n\n dfs(1, 0);\n\n for (int u = 1; u <= n; ++u) {\n long long res = 0, sum = val[1] - val[u];\n for (int &v: adj2[u]) {\n if (order[u] > low[v]) sum += val[v];\n else res = max(res, val[v]);\n }\n cout << max(res, sum) << '\\n';\n }\n}","accuracy":1,"time_ms":60,"memory_kb":14188,"score_of_the_acc":-0.3841,"final_rank":3},{"submission_id":"aoj_3022_9637510","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<vector<int>> adj, adj2;\nvector<int> low, val, order;\nint timer = 0;\n\nvoid dfs(int u, int p) {\n low[u] = order[u] = timer++;\n for (int &v: adj[u]) {\n if (order[v] == -1) {\n dfs(v, u);\n adj2[u].push_back(v);\n val[u] += val[v];\n low[u] = min(low[u], low[v]);\n } else if (v != p)\n low[u] = min(low[u], order[v]);\n\n }\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n adj.assign(n + 1, {});\n adj2.assign(n + 1, {});\n low.assign(n + 1, {});\n order.assign(n + 1, -1);\n val.assign(n + 1, -1);\n\n for (int u = 1; u <= n; ++u)\n cin >> val[u];\n\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >> u >> v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n\n dfs(1, 0);\n\n for (int u = 1; u <= n; ++u) {\n int res = 0, sum = val[1] - val[u];\n for (int &v: adj2[u]) {\n if (order[u] > low[v]) sum += val[v];\n else res = max(res, val[v]);\n }\n cout << max(res, sum) << '\\n';\n }\n}","accuracy":0.3055555555555556,"time_ms":50,"memory_kb":11408,"score_of_the_acc":-0.25,"final_rank":20},{"submission_id":"aoj_3022_8905080","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define CONSTANTS\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr long long INF = 1e18;\n// constexpr long long INF = LONG_LONG_MAX;\n// constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\nconstexpr long double EPS = 1e-10;\nconstexpr long double PI = M_PI;\n\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) begin(A), end(A)\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\n#ifndef CONSTANTS\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\n#endif\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \"\" : \" \"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \" \") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \" \") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\n'; } template<typename T> void print(const deque<T> &que, string sep = \" \") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \" \") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \" \") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\n'; } template<typename T> void print(T out) { cout << out << '\\n'; }\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \":\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \": \" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\"' or names[i] == '\\'') { if (i > 0 and names[i - 1] == '\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \": \" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto &[k, v] : mp) res += v; return res; }\n\nstruct LowLink { const vvi &g; int N; vector<int> ord, low, articulations, is_arti; vector<pair<int, int>> bridges; LowLink(const vvi &_g) : g(_g), N(g.size()), ord(N, -1), low(N, -1), is_arti(N) { for (int i = 0, k = 0; i < N; i++) { if (ord[i] == -1) { k = dfs(i, k, -1); } } sort(ALL(bridges)); } bool is_articulation(int u) { return is_arti[u]; } bool is_bridge(int u, int v) { if (u > v) swap(u, v); auto itr = lower_bound(ALL(bridges), pii{u, v}); return itr != bridges.end() and (*itr) == pii{u, v}; } bool has_articulation() { return articulations.size(); } bool has_bridge() { return bridges.size(); } vector<int> get_articulations() { return articulations; } vector<pii> get_bridges() { return bridges; } private: int dfs(int idx, int k, int par) { low[idx] = (ord[idx] = k++); int cnt = 0; bool arti = false, second = false; for (auto &to : g[idx]) { if (ord[to] == -1) { cnt++; k = dfs(to, k, idx); low[idx] = min(low[idx], low[to]); arti |= (par != -1) && (low[to] >= ord[idx]); if (ord[idx] < low[to]) { bridges.emplace_back(minmax(idx, (int)to)); } } else if (to != par || second) { low[idx] = min(low[idx], ord[to]); } else { second = true; } } arti |= par == -1 && cnt > 1; if (arti) { articulations.push_back(idx); is_arti[idx] = true; } return k; } };\nstruct BiConnectedComponents : LowLink { vector<int> used; vector<vector<pair<int, int>>> bc; vector<pair<int, int>> tmp; BiConnectedComponents(const vvi &_g) : LowLink(_g) { build(); } void build() { used.assign(this->g.size(), 0); for (int i = 0; i < (int)used.size(); i++) { if (!used[i]) dfs(i, -1); } } void dfs(int idx, int par) { used[idx] = true; for (auto &to : this->g[idx]) { if (to == par) continue; if (!used[to] || this->ord[to] < this->ord[idx]) { tmp.emplace_back(minmax<int>(idx, to)); } if (!used[to]) { dfs(to, idx); if (this->low[to] >= this->ord[idx]) { bc.emplace_back(); while (true) { auto e = tmp.back(); bc.back().emplace_back(e); tmp.pop_back(); if (e.first == min<int>(idx, to) && e.second == max<int>(idx, to)) { break; } } } } } } };\nstruct BlockCutTree { const vector<vector<int>> g; BiConnectedComponents bcc; vector<vector<int>> aux, groups; vector<int> idar, idcc, sz, is_arti; BlockCutTree(const vector<vector<int>> &_g) : g(_g), bcc(g) { build(); } void build() { auto ar = bcc.get_articulations(); idar.resize(g.size(), -1); idcc.resize(g.size(), -1); for (int i = 0; i < (int)ar.size(); i++) idar[ar[i]] = i; aux.resize(ar.size() + bcc.bc.size()); vector<int> last(g.size(), -1); for (int i = 0; i < (int)bcc.bc.size(); i++) { vector<int> st; for (auto &[u, v] : bcc.bc[i]) st.push_back(u), st.push_back(v); for (auto &u : st) { if (idar[u] == -1) idcc[u] = i + ar.size(); else if (last[u] != i) { add(i + ar.size(), idar[u]); last[u] = i; } } } sz.resize(aux.size()); is_arti.resize(aux.size()); groups.resize(aux.size()); for (int u = 0; u < g.size(); u++) { groups[this->id(u)].eb(u); sz[this->id(u)]++; if (idar[u] != -1) { is_arti[this->id(u)] = true; } } } vector<int> &operator[](int i) { return aux[i]; } int size() const { return aux.size(); } int size(int k) { return sz[k]; } int id(int i) { return idar[i] == -1 ? idcc[i] : idar[i]; } bool is_articulation(int k) { return is_arti[k]; } vector<vector<int>> get_nodes() { return aux; } vector<vector<int>> get_groups() { return groups; } private: void add(int i, int j) { if (i == -1 or j == -1) return; aux[i].push_back(j); aux[j].push_back(i); }; };\n\nvoid solve() {\n ll N, M;\n cin >> N >> M;\n vector<ll> W(N);\n cin >> W;\n vvi nodes(N);\n rep(i, M) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n nodes[u].eb(v);\n nodes[v].eb(u);\n }\n\n BlockCutTree bct(nodes);\n ll K = bct.size();\n vector<ll> W2(K);\n rep(u, N) {\n W2[bct.id(u)] += W[u];\n }\n ll wsm = sum(W);\n vector<ll> dp(K), ans(N, wsm);\n rep(u, N) {\n ans[u] -= W[u];\n }\n auto groups = bct.get_groups();\n auto dfs = [&](auto &&f, ll u, ll prv) -> void {\n dp[u] = W2[u];\n for (auto v : bct[u]) {\n if (v == prv) continue;\n f(f, v, u);\n dp[u] += dp[v];\n }\n if (bct.is_articulation(u)) {\n ll mx = wsm - dp[u];\n for (auto v : bct[u]) {\n if (v == prv) continue;\n chmax(mx, dp[v]);\n }\n assert(groups[u].size() == 1);\n ans[groups[u][0]] = mx;\n }\n };\n dfs(dfs, 0, -1);\n print(ans, \"\\n\");\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n solve();\n\n // multi test cases\n // int T;\n // cin >> T;\n // while (T--) solve();\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":50212,"score_of_the_acc":-1.4375,"final_rank":15},{"submission_id":"aoj_3022_8905043","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n\n#define CONSTANTS\n#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr long long INF = 1e18;\n// constexpr long long INF = LONG_LONG_MAX;\n// constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\nconstexpr long double EPS = 1e-10;\nconstexpr long double PI = M_PI;\n\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\n#define name4(i, a, b, c, d, e, ...) e\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\n#define pb push_back\n#define eb emplace_back\n#define mkp make_pair\n#define ALL(A) begin(A), end(A)\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\n#define elif else if\n#define tostr to_string\n#ifndef CONSTANTS\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\n#endif\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \"\" : \" \"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \" \") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \" \") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\n'; } template<typename T> void print(const deque<T> &que, string sep = \" \") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \" \") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \" \") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\n'; } template<typename T> void print(T out) { cout << out << '\\n'; }\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \":\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \": \" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\"' or names[i] == '\\'') { if (i > 0 and names[i - 1] == '\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \": \" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto &[k, v] : mp) res += v; return res; }\n\nstruct LowLink { const vvi &g; int N; vector<int> ord, low, articulations, is_arti; vector<pair<int, int>> bridges; LowLink(const vvi &_g) : g(_g), N(g.size()), ord(N, -1), low(N, -1), is_arti(N) { for (int i = 0, k = 0; i < N; i++) { if (ord[i] == -1) { k = dfs(i, k, -1); } } sort(ALL(bridges)); } bool is_articulation(int u) { return is_arti[u]; } bool is_bridge(int u, int v) { if (u > v) swap(u, v); auto itr = lower_bound(ALL(bridges), pii{u, v}); return itr != bridges.end() and (*itr) == pii{u, v}; } bool has_articulation() { return articulations.size(); } bool has_bridge() { return bridges.size(); } vector<int> get_articulations() { return articulations; } vector<pii> get_bridges() { return bridges; } private: int dfs(int idx, int k, int par) { low[idx] = (ord[idx] = k++); int cnt = 0; bool arti = false, second = false; for (auto &to : g[idx]) { if (ord[to] == -1) { cnt++; k = dfs(to, k, idx); low[idx] = min(low[idx], low[to]); arti |= (par != -1) && (low[to] >= ord[idx]); if (ord[idx] < low[to]) { bridges.emplace_back(minmax(idx, (int)to)); } } else if (to != par || second) { low[idx] = min(low[idx], ord[to]); } else { second = true; } } arti |= par == -1 && cnt > 1; if (arti) { articulations.push_back(idx); is_arti[idx] = true; } return k; } };\n\n// see: https://nyaannyaan.github.io/library/graph/biconnected-components.hpp\nstruct BiConnectedComponents : LowLink {\n vector<int> used;\n vector<vector<pair<int, int>>> bc;\n vector<pair<int, int>> tmp;\n\n BiConnectedComponents(const vvi &_g) : LowLink(_g) {\n build();\n }\n\n void build() {\n used.assign(this->g.size(), 0);\n for (int i = 0; i < (int)used.size(); i++) {\n if (!used[i]) dfs(i, -1);\n }\n }\n\n void dfs(int idx, int par) {\n used[idx] = true;\n for (auto &to : this->g[idx]) {\n if (to == par) continue;\n if (!used[to] || this->ord[to] < this->ord[idx]) {\n tmp.emplace_back(minmax<int>(idx, to));\n }\n if (!used[to]) {\n dfs(to, idx);\n if (this->low[to] >= this->ord[idx]) {\n bc.emplace_back();\n while (true) {\n auto e = tmp.back();\n bc.back().emplace_back(e);\n tmp.pop_back();\n if (e.first == min<int>(idx, to) &&\n e.second == max<int>(idx, to)) {\n break;\n }\n }\n }\n }\n }\n }\n};\n\n// see: https://nyaannyaan.github.io/library/tree/block-cut-tree.hpp\nstruct BlockCutTree {\n const vvi g;\n BiConnectedComponents bcc;\n vector<vector<int>> aux, groups;\n vector<int> idar, idcc, sz, is_arti;\n\n BlockCutTree(const vvi &_g) : g(_g), bcc(g) {\n build();\n }\n\n void build() {\n auto ar = bcc.get_articulations();\n idar.resize(g.size(), -1);\n idcc.resize(g.size(), -1);\n for (int i = 0; i < (int)ar.size(); i++) idar[ar[i]] = i;\n\n aux.resize(ar.size() + bcc.bc.size());\n vector<int> last(g.size(), -1);\n for (int i = 0; i < (int)bcc.bc.size(); i++) {\n vector<int> st;\n for (auto &[u, v] : bcc.bc[i]) st.push_back(u), st.push_back(v);\n for (auto &u : st) {\n if (idar[u] == -1) idcc[u] = i + ar.size();\n else if (last[u] != i) {\n add(i + ar.size(), idar[u]);\n last[u] = i;\n }\n }\n }\n\n sz.resize(aux.size());\n is_arti.resize(aux.size());\n groups.resize(aux.size());\n for (int u = 0; u < g.size(); u++) {\n groups[this->id(u)].eb(u);\n sz[this->id(u)]++;\n if (idar[u] != -1) {\n is_arti[this->id(u)] = true;\n }\n }\n }\n\n vector<int> &operator[](int i) {\n return aux[i];\n }\n\n // 連結成分数(縮約後グラフの頂点数)\n int size() const {\n return aux.size();\n }\n\n // (縮約後グラフの)頂点kの連結成分要素数\n int size(int k) {\n return sz[k];\n }\n\n int id(int i) {\n return idar[i] == -1 ? idcc[i] : idar[i];\n }\n\n // (縮約後グラフの)頂点kが元グラフで関節点かどうか\n bool is_articulation(int k) {\n return is_arti[k];\n }\n\n // bool is_arti(int i) {\n // return idar[i] != -1;\n // }\n\n int arti() {\n return bcc.get_articulations().size();\n }\n\n // 縮約後グラフの隣接リスト\n vvi get_nodes() {\n return aux;\n }\n\n // ACLのSCCが返すみたいな各連結成分を表す隣接リスト\n vvi get_groups() {\n return groups;\n }\n\nprivate:\n void add(int i, int j) {\n if (i == -1 or j == -1) return;\n aux[i].push_back(j);\n aux[j].push_back(i);\n };\n};\n\nvoid solve() {\n ll N, M;\n cin >> N >> M;\n vector<ll> W(N);\n cin >> W;\n vvi nodes(N);\n rep(i, M) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n nodes[u].eb(v);\n nodes[v].eb(u);\n }\n\n BlockCutTree bct(nodes);\n ll K = bct.size();\n vector<ll> W2(K);\n rep(u, N) {\n W2[bct.id(u)] += W[u];\n }\n ll wsm = sum(W);\n vector<ll> dp(K), ans(N, wsm);\n rep(u, N) {\n ans[u] -= W[u];\n }\n auto groups = bct.get_groups();\n auto dfs = [&](auto &&f, ll u, ll prv) -> void {\n dp[u] += W2[u];\n for (auto v : bct[u]) {\n if (v == prv) continue;\n f(f, v, u);\n dp[u] += dp[v];\n }\n if (bct.is_articulation(u)) {\n ll mx = wsm - dp[u];\n for (auto v : bct[u]) {\n if (v == prv) continue;\n chmax(mx, dp[v]);\n }\n assert(groups[u].size() == 1);\n ans[groups[u][0]] = mx;\n }\n };\n dfs(dfs, 0, -1);\n print(ans, \"\\n\");\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n // single test case\n solve();\n\n // multi test cases\n // int T;\n // cin >> T;\n // while (T--) solve();\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":50004,"score_of_the_acc":-1.4321,"final_rank":14},{"submission_id":"aoj_3022_8696271","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) {\n os << '-';\n y *= -1;\n }\n std::vector<int> ny;\n while(y > 0) {\n ny.push_back(y % 10);\n y /= 10;\n }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ok - ng) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 2 \"A.cpp\"\n\nstruct lowlink {\n using size_t = std::size_t;\n std::vector<std::vector<std::pair<size_t, size_t>>> graph;\n std::vector<size_t> ord, low, articulation;\n std::vector<std::pair<size_t, size_t>> bridge;\n\n explicit lowlink(const size_t n) : graph(n), ord(n, 0), low(n, 0) {}\n\n void add_edge(const size_t u, const size_t v, const size_t i) {\n assert(u < graph.size());\n assert(v < graph.size());\n graph[u].push_back({v, i});\n graph[v].push_back({u, i});\n }\n\n virtual void build() {\n size_t t = 0;\n std::vector<bool> used(graph.size(), false);\n std::function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\n used[v] = true;\n ord[v] = low[v] = t++;\n\n bool is_articulation = false, parent_checked = false;\n size_t child_cnt = 0;\n for(auto [to, _] : graph[v]) {\n if(to == p and not std::exchange(parent_checked, true)) continue;\n if(not used[to]) {\n child_cnt++;\n dfs(to, v);\n low[v] = std::min(low[v], low[to]);\n is_articulation |= p != -1 and ord[v] <= low[to];\n if(ord[v] < low[to]) bridge.push_back(std::minmax({v, to}));\n } else {\n low[v] = std::min(low[v], ord[to]);\n }\n }\n\n is_articulation |= p == -1 and child_cnt >= 2;\n if(is_articulation) articulation.push_back(v);\n };\n for(size_t v = 0; v < graph.size(); v++) if(not used[v]) dfs(v, -1);\n }\n};\n\nstruct two_edge_connected_components : lowlink {\n using lowlink::lowlink;\n using lowlink::graph;\n using lowlink::ord;\n using lowlink::low;\n using lowlink::bridge;\n\n using size_t = std::size_t;\n std::vector<size_t> id;\n std::vector<std::vector<size_t>> group, tree;\n\n explicit two_edge_connected_components(const size_t n) : lowlink(n), id(n, -1) {}\n\n void build() override {\n lowlink::build();\n\n size_t c = 0;\n function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\n id[v] = (p != -1 and low[v] <= ord[p] ? id[p] : c++);\n for(auto [to, _] : graph[v]) if(id[to] == -1) dfs(to, v);\n };\n for(size_t i = 0; i < graph.size(); i++) if(id[i] == -1) dfs(i, -1);\n\n group.resize(c);\n for(size_t i = 0; i < graph.size(); i++) group[id[i]].push_back(i);\n\n tree.resize(c);\n for(auto [u, v] : bridge) {\n u = id[u], v = id[v];\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n }\n};\n\nstruct biconnected_components : lowlink {\n using lowlink::lowlink;\n using lowlink::graph;\n using lowlink::ord;\n using lowlink::low;\n using size_t = std::size_t;\n std::vector<std::vector<std::tuple<size_t, size_t, size_t>>> bc;\n\n void build() override {\n lowlink::build();\n std::vector<bool> used(graph.size(), false);\n std::vector<std::tuple<size_t, size_t, size_t>> tmp;\n\n function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\n used[v] = true;\n bool parent_checked = false;\n for(auto [to, i] : graph[v]) {\n if(to == p and not exchange(parent_checked, true)) continue;\n if(not used[to] or ord[to] < ord[v]) tmp.emplace_back(v, to, i);\n if(not used[to]) {\n dfs(to, v);\n if(ord[v] <= low[to]) {\n std::vector<std::tuple<size_t, size_t, size_t>> c;\n while(true) {\n auto e = tmp.back(); tmp.pop_back();\n c.emplace_back(e);\n if(get<2>(e) == i) break;\n }\n bc.emplace_back(std::move(c));\n }\n }\n }\n };\n\n for(size_t i = 0; i < graph.size(); i++) if(not used[i]) dfs(i, -1);\n }\n};\n\nstruct block_cut_tree : biconnected_components {\n using biconnected_components::biconnected_components;\n using biconnected_components::graph;\n using biconnected_components::articulation;\n using biconnected_components::bc;\n\n using size_t = std::size_t;\n std::vector<int> rev;\n std::vector<std::vector<size_t>> group, tree;\n\n explicit block_cut_tree(const size_t n) : biconnected_components(n), rev(n, -1) {}\n\n void build() override {\n biconnected_components::build();\n\n size_t c = bc.size();\n for(size_t v : articulation) rev[v] = c++;\n std::vector<size_t> last(c, -1);\n tree.resize(c);\n for(size_t i = 0; i < bc.size(); i++) {\n for(auto [u, v, _] : bc[i]) {\n for(size_t x : {u, v}) {\n if(rev[x] != -1 and bc.size() <= rev[x]) {\n if(std::exchange(last[rev[x]], i) != i) {\n tree[rev[x]].push_back(i);\n tree[i].push_back(rev[x]);\n }\n } else {\n rev[x] = i;\n }\n }\n }\n }\n group.resize(c);\n for(size_t i = 0; i < graph.size(); i++) group[rev[i]].push_back(i);\n }\n};\n\nint main() {\n int N = in(), M = in();\n vector<int> A = in(N);\n block_cut_tree bct(N);\n for(int i : rep(M)) {\n int u = in(), v = in(); u--, v--;\n bct.add_edge(u, v, i);\n }\n bct.build();\n vector<i64> w(bct.tree.size());\n for(int i : rep(N)) w[bct.rev[i]] += A[i];\n i64 SUM = sum_of<i64>(A);\n vector<i64> ans(N, SUM);\n for(int i : rep(N)) ans[i] -= A[i];\n\n function<i64(int,int)> dfs = [&](int v, int p) -> i64 {\n i64 max_ = 0, sum = 0;\n for(size_t to : bct.tree[v]) {\n if(to != p) {\n i64 x = dfs(to, v);\n sum += x;\n chmax(max_, x);\n }\n }\n if(bct.bc.size() <= v) ans[bct.group[v][0]] = max(SUM - sum - w[v], max_);\n return sum + w[v];\n };\n\n dfs(0, -1);\n print_n(ans);\n}","accuracy":1,"time_ms":70,"memory_kb":39092,"score_of_the_acc":-1.0884,"final_rank":13},{"submission_id":"aoj_3022_8122870","code_snippet":"#line 1 \".lib/template.hpp\"\n\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <array>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <bitset>\n#include <cmath>\n#include <functional>\n#include <cassert>\n#include <climits>\n#include <iomanip>\n#include <numeric>\n#include <memory>\n#include <random>\n#define allof(obj) (obj).begin(), (obj).end()\n#define range(i, l, r) for(int i=l;i<r;i++)\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\n#define bit_kth(i, k) ((i >> k)&1)\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\nusing ll = long long;\nusing ld = long double;\nusing ul = uint64_t;\nusing pi = std::pair<int, int>;\nusing pl = std::pair<ll, ll>;\nusing namespace std;\n\ntemplate<typename F, typename S>\nstd::ostream &operator<<(std::ostream &dest, const std::pair<F, S> &p){\n dest << p.first << ' ' << p.second;\n return dest;\n}\ntemplate<typename T>\nstd::ostream &operator<<(std::ostream &dest, const std::vector<std::vector<T>> &v){\n int sz = v.size();\n if(sz==0) return dest;\n for(int i=0;i<sz;i++){\n int m = v[i].size();\n for(int j=0;j<m;j++) dest << v[i][j] << (i!=sz-1&&j==m-1?'\\n':' ');\n }\n return dest;\n}\ntemplate<typename T>\nstd::ostream &operator<<(std::ostream &dest, const std::vector<T> &v){\n int sz = v.size();\n if(sz==0) return dest;\n for(int i=0;i<sz-1;i++) dest << v[i] << ' ';\n dest << v[sz-1];\n return dest;\n}\ntemplate<typename T, size_t sz>\nstd::ostream &operator<<(std::ostream &dest, const std::array<T, sz> &v){\n if(sz==0) return dest;\n for(int i=0;i<sz-1;i++) dest << v[i] << ' ';\n dest << v[sz-1];\n return dest;\n}\ntemplate<typename T>\nstd::ostream &operator<<(std::ostream &dest, const std::set<T> &v){\n for(auto itr=v.begin();itr!=v.end();){\n dest << *itr;\n itr++;\n if(itr!=v.end()) dest << ' ';\n }\n return dest;\n}\ntemplate<typename T, typename E>\nstd::ostream &operator<<(std::ostream &dest, const std::map<T, E> &v){\n for(auto itr=v.begin();itr!=v.end();){\n dest << '(' << itr->first << \", \" << itr->second << ')';\n itr++;\n if(itr!=v.end()) dest << '\\n';\n }\n return dest;\n}\ntemplate<typename T>\nvector<T> make_vec(size_t sz, T val){return std::vector<T>(sz, val);}\ntemplate<typename T, typename... Tail>\nauto make_vec(size_t sz, Tail ...tail){\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\n}\ntemplate<typename T>\nvector<T> read_vec(size_t sz){\n std::vector<T> v(sz);\n for(int i=0;i<(int)sz;i++) std::cin >> v[i];\n return v;\n}\ntemplate<typename T, typename... Tail>\nauto read_vec(size_t sz, Tail ...tail){\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\n for(int i=0;i<(int)sz;i++) v[i] = read_vec<T>(tail...);\n return v;\n}\nvoid io_init(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n}\n\n#line 1 \".lib/graph/graph_algorithm.hpp\"\n\n\n#line 1 \".lib/graph/edge.hpp\"\n\n\n/*\ntemplate<typename edge_weight>\nstruct edge_base{\n using weight = edge_weight;\n int to();\n int from();\n int id();\n weight wei();\n static weight z();\n edge_base<weight> reverse();\n};\n*/\n\ntemplate<typename edge_weight>\nstruct simple_edge{\n using weight = edge_weight;\n int s, t;\n simple_edge(): s(-1), t(-1){}\n simple_edge(int a, int b): s(a), t(b){}\n int to(){return t;}\n int from(){return s;}\n int id(){return -1;}\n weight wei(){return 1;}\n static weight z(){return 0;}\n simple_edge<weight> reverse(){return simple_edge<weight>{t, s};}\n};\n\ntemplate<typename edge_weight>\nstruct weighted_edge{\n using weight = edge_weight;\n int s, t;\n weight w;\n weighted_edge(): s(-1), t(-1), w(0){}\n weighted_edge(int a, int b, weight c): s(a), t(b), w(c){}\n int to(){return t;}\n int from(){return s;}\n int id(){return -1;}\n weight wei(){return w;}\n static weight z(){return 0;}\n weighted_edge<weight> reverse(){return weighted_edge<weight>{t, s, w};}\n};\n\ntemplate<typename edge_weight>\nstruct labeled_edge{\n using weight = edge_weight;\n int s, t, i;\n labeled_edge(): s(-1), t(-1), i(-1){}\n labeled_edge(int a, int b, int i): s(a), t(b), i(i){}\n int to(){return t;}\n int from(){return s;}\n int id(){return i;}\n weight wei(){return 1;}\n static weight z(){return 0;}\n labeled_edge<weight> reverse(){return labeled_edge<weight>{t, s, i};}\n};\n\ntemplate<typename edge_weight>\nstruct weighted_labeled_edge{\n using weight = edge_weight;\n int s, t;\n weight w;\n int i;\n weighted_labeled_edge(): s(-1), t(-1), i(-1), w(0){}\n weighted_labeled_edge(int a, int b, weight w, int i): s(a), t(b), w(w), i(i){}\n int to(){return t;}\n int from(){return s;}\n int id(){return i;}\n weight wei(){return w;}\n static weight z(){return 0;}\n weighted_labeled_edge<weight> reverse(){return weighted_labeled_edge<weight>{t, s, w, i};}\n};\n\n#line 8 \".lib/graph/graph_algorithm.hpp\"\n\nnamespace graph_algorithm{\n template<typename T>\n using vec = std::vector<T>;\n // O(V + E)\n // 辺の重みが1\n template<typename edge>\n struct bfs_shortest_path{\n private:\n using weight = typename edge::weight;\n using dist_p = std::pair<weight, int>;\n vec<vec<edge>> &g;\n public:\n bfs_shortest_path(vec<vec<edge>> &g): g(g){}\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\n vec<weight> dist;\n vec<edge> par;\n void build(int s){\n int n = g.size();\n if(dist.empty()){\n dist.resize(n, inf);\n par.resize(n, edge{});\n }else{\n std::fill(dist.begin(), dist.end(), inf);\n std::fill(par.begin(), par.end(), edge{});\n }\n std::queue<dist_p> que;\n dist[s] = edge::z();\n que.push(dist_p(edge::z(), s));\n while(!que.empty()){\n auto [w, v] = que.top();\n que.pop();\n if(dist[v] < w) continue;\n for(edge &e: g[v]){\n assert(e.wei() == 1);\n weight d = dist[v] + e.wei();\n int to = e.to();\n if(dist[to] > d){\n dist[to] = d;\n par[to] = e;\n que.push(dist_p(d, to));\n }\n }\n }\n }\n vec<edge> get_path(int v){\n assert(!dist.empty());\n vec<edge> ret;\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n weight operator [](int v){return dist[v];}\n };\n\n // O(V + E)\n // 辺の重みが0か1\n template<typename edge>\n struct zero_one_bfs_shortest_path{\n private:\n using weight = typename edge::weight;\n using dist_p = std::pair<weight, int>;\n vec<vec<edge>> &g;\n public:\n zero_one_bfs_shortest_path(vec<vec<edge>> &g): g(g){}\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\n vec<weight> dist;\n vec<edge> par;\n void build(int s){\n int n = g.size();\n if(dist.empty()){\n dist.resize(n, inf);\n par.resize(n, edge{});\n }else{\n std::fill(dist.begin(), dist.end(), inf);\n std::fill(par.begin(), par.end(), edge{});\n }\n std::queue<dist_p> que0, que1;\n dist[s] = edge::z();\n que0.push(dist_p(edge::z(), s));\n while(!que0.empty() && !que1.empty()){\n if(que0.empty()){\n que0 = que1;\n que1.clear();\n }\n auto [w, v] = que0.top();\n que0.pop();\n if(dist[v] < w) continue;\n for(edge &e: g[v]){\n weight w = e.wei();\n assert(w == 0 || w == 1);\n weight d = dist[v] + w;\n int to = e.to();\n if(dist[to] > d){\n dist[to] = d;\n par[to] = e;\n if(w == 0) que0.push(dist_p(d, to));\n else que1.push(dist_p(d, to));\n }\n }\n }\n }\n vec<edge> get_path(int v){\n assert(!dist.empty());\n vec<edge> ret;\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n weight operator [](int v){return dist[v];}\n };\n\n // O((V + E)logV)\n // 辺の重みが非負(負の閉路がなければ一応動く)\n template<typename edge>\n struct dijkstra{\n private:\n using weight = typename edge::weight;\n using dist_p = std::pair<weight, int>;\n vec<vec<edge>> &g;\n public:\n dijkstra(vec<vec<edge>> &g): g(g){}\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\n vec<weight> dist;\n vec<edge> par;\n void build(int s){\n int n = g.size();\n if(dist.empty()){\n dist.resize(n, inf);\n par.resize(n, edge{});\n }else{\n std::fill(dist.begin(), dist.end(), inf);\n std::fill(par.begin(), par.end(), edge{});\n }\n std::priority_queue<dist_p, vec<dist_p>, std::greater<dist_p>> que;\n dist[s] = edge::z();\n que.push(dist_p(edge::z(), s));\n while(!que.empty()){\n auto [w, v] = que.top();\n que.pop();\n if(dist[v] < w) continue;\n for(edge &e: g[v]){\n weight d = dist[v] + e.wei();\n int to = e.to();\n if(dist[to] > d){\n dist[to] = d;\n par[to] = e;\n que.push(dist_p(d, to));\n }\n }\n }\n }\n vec<edge> get_path(int v){\n assert(!dist.empty());\n vec<edge> ret;\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n weight operator [](int v){return dist[v];}\n };\n\n // O(VE)\n // inf: 到達不可, minf: 負の閉路\n template<typename edge>\n struct bellman_ford{\n private:\n using weight = typename edge::weight;\n using dist_p = std::pair<weight, int>;\n vec<vec<edge>> &g;\n public:\n bellman_ford(vec<vec<edge>> &g): g(g){}\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\n vec<weight> dist;\n vec<edge> par;\n\n void build(int s){\n int n = g.size();\n if(dist.empty()){\n dist.resize(n, inf);\n par.resize(n);\n }else{\n std::fill(dist.begin(), dist.end(), inf);\n std::fill(par.begin(), par.end(), edge{});\n }\n dist[s] = edge::z();\n for(int lp = 0; ; lp++){\n bool update = false;\n for(int i = 0; i < n; i++){\n if(dist[i] == inf) continue;\n for(edge e : g[i]){\n weight &dto = dist[e.to()];\n if(dto == minf){\n if(dto != minf) update = true;\n dto = minf;\n }else if(dto == inf || dto > dist[i] + e.wei()){\n dto = (lp > n ? minf : dist[i] + e.wei());\n par[e.to()] = e;\n update = true;\n }\n }\n }\n if(!update) break;\n }\n }\n vec<edge> get_path(int v){\n assert(!dist.empty());\n vec<edge> ret;\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n weight operator [](int v){return dist[v];}\n };\n\n // O(V^3)\n template<typename edge>\n struct warshall_floyd{\n private:\n using weight = typename edge::weight;\n vec<vec<edge>> &g;\n public:\n warshall_floyd(vec<vec<edge>> &g): g(g){}\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\n vec<vec<weight>> dist;\n void build(){\n int n = g.size();\n dist.resize(n, vec<weight>(n, inf));\n for(int i = 0; i < n; i++){\n dist[i][i] = 0;\n for(edge &e : g[i]){\n dist[i][e.to()] = std::min(dist[i][e.to()], e.wei());\n }\n }\n for(int k = 0; k < n; k++){\n for(int s = 0; s < n; s++){\n for(int t = 0; t < n; t++){\n dist[s][t] = std::min(dist[s][t], dist[s][k] + dist[k][t]);\n }\n }\n }\n }\n vec<weight>& operator [](int v){return dist[v];}\n };\n};\n\nnamespace graph_algorithm{\n // {連結成分, DAG}\n template<typename edge>\n std::pair<vec<int>, vec<vec<int>>> scc(vec<vec<edge>> &g){\n int n = g.size();\n vec<int> v(n), cmp(n, 0);\n vec<vec<int>> rg(n), V;\n auto scc_dfs = [&](auto &&scc_dfs, int cur, int &sz)->void{\n cmp[cur] = -1;\n for(edge &e : g[cur]){\n int to = e.to();\n rg[to].push_back(cur);\n if(cmp[to] == 0) scc_dfs(scc_dfs, to, sz);\n }\n v[sz++] = cur;\n };\n auto scc_rdfs = [&](auto &&scc_rdfs, int cur, const int k)->void{\n cmp[cur] = k;\n V[k].push_back(cur);\n for(int to : rg[cur]) if(cmp[to] == -1) scc_rdfs(scc_rdfs, to, k);\n };\n for(int i = 0, j = 0; i < n; i++) if(!cmp[i]) scc_dfs(scc_dfs, i, j);\n for(int i = (int)v.size() - 1, j = 0; i >= 0; i--){\n if(cmp[v[i]] == -1){\n V.push_back(vec<int>());\n scc_rdfs(scc_rdfs, v[i], j++);\n }\n }\n return {cmp, V};\n }\n // {連結成分, 森}\n template<typename edge>\n std::pair<vec<int>, vec<vec<int>>> two_edge_connected(vec<vec<edge>> &g){\n int n = g.size();\n vec<int> v(n), cmp(n, 0);\n vec<vec<int>> V;\n vec<vec<bool>> edge_used(n);\n auto tec_dfs = [&](auto &&tec_dfs, int cur, int &sz)->void{\n cmp[cur] = -1;\n for(int i = 0; i < g[cur].size(); i++){\n int to = g[cur][i].to();\n if(cmp[to] == 0) edge_used[cur][i] = true, tec_dfs(tec_dfs, to, sz);\n }\n v[sz++] = cur;\n };\n auto tec_rdfs = [&](auto &&tec_rdfs, int cur, const int k)->void{\n cmp[cur] = k;\n V[k].push_back(cur);\n for(int i = 0; i < g[cur].size(); i++){\n int to = g[cur][i].to();\n if(cmp[to] == -1 && !edge_used[cur][i]) tec_rdfs(tec_rdfs, to, k);\n }\n };\n for(int i = 0; i < n; i++) edge_used[i].resize(g[i].size(), 0);\n for(int i = 0, j = 0; i < n; i++) if(!cmp[i]) tec_dfs(tec_dfs, i, j);\n for(int i = (int)v.size() - 1, j = 0; i >= 0; i--){\n if(cmp[v[i]] == -1){\n V.push_back(vec<int>());\n tec_rdfs(tec_rdfs, v[i], j++);\n }\n }\n return {cmp, V};\n }\n // 二重頂点連結成分分解\n // {間接点フラグ, 各連結成分が含む頂点}\n template<typename edge>\n std::pair<vec<bool>, vec<vec<int>>> bcc(vec<vec<edge>> &g){\n int n = g.size();\n vec<vec<int>> V;\n vec<int> child(n, 0), dep(n, -1), low(n);\n vec<bool> used(n, false), is_articulation(n, false);\n vec<edge> tmp_edge;\n auto bcc_dfs = [&](auto &&bcc_dfs, int cur, int par, int d)->void{\n if(par != -1) child[par]++;\n dep[cur] = low[cur] = d;\n for(edge &e : g[cur]){\n int to = e.to();\n if(to == par) continue;\n if(dep[to] < dep[cur]) tmp_edge.push_back(e);\n if(dep[e.to()] == -1){\n bcc_dfs(bcc_dfs, to, cur, d + 1);\n if(low[to] >= dep[cur]){\n is_articulation[cur] = true;\n V.push_back(vec<int>());\n bool is_ok = false;\n while(!tmp_edge.empty() && !is_ok){\n edge e = tmp_edge.back();\n tmp_edge.pop_back();\n if(e.from() == cur && e.to() == to) is_ok = true;\n if(!used[e.to()]) V.back().push_back(e.to()), used[e.to()] = true;\n if(!used[e.from()]) V.back().push_back(e.from()), used[e.from()] = true;\n }\n for(int v : V.back()) used[v] = false;\n }\n low[cur] = std::min(low[cur], low[to]);\n }else low[cur] = std::min(low[cur], dep[to]);\n }\n };\n for(int i = 0; i < n; i++){\n if(dep[i] != -1) continue;\n int vsz_pre = V.size();\n bcc_dfs(bcc_dfs, i, -1, 0);\n is_articulation[i] = (child[i] > 1);\n if(V.size() == vsz_pre) V.push_back(vec<int>{i});// 孤立点\n }\n return {is_articulation, V};\n }\n template<typename edge>\n std::tuple<vec<bool>, vec<int>, vec<vec<simple_edge<int>>>> block_cut_tree(vec<vec<edge>> &g){\n auto [is_articulation, V] = bcc<edge>(g);\n int n = g.size();\n vec<int> cmp(n, -1);\n int m = V.size(), a = m;\n for(int i = 0; i < m; i++){\n for(int v : V[i]){\n if(is_articulation[v]) cmp[v] = a++;\n else cmp[v] = i;\n }\n }\n vec<vec<simple_edge<int>>> G(a);\n for(int i = 0; i < m; i++){\n for(int v : V[i]){\n if(is_articulation[v]){\n G[i].push_back({i, cmp[v]});\n G[cmp[v]].push_back({cmp[v], i});\n }\n }\n }\n return {is_articulation, cmp, G};\n }\n};\nnamespace graph_algorithm{\n // 終了時にinが0でない要素がある -> 閉路が存在する\n // 閉路があるなら空のvectorを返す\n template<typename edge>\n vec<int> topological_sort(vec<vec<edge>> &g){\n int n = g.size();\n std::queue<int> que;\n vec<int> in(n, 0), ret;\n for(int i = 0; i < n; i++) for(edge e : g[i]) in[e.to()]++;\n for(int i = 0; i < n; i++) if(!in[i]) que.push(i);\n while(!que.empty()){\n int p = que.front();\n que.pop();\n ret.push_back(p);\n for(edge &e : g[p]){\n int to = e.to();\n if(!(--in[to])) que.push(to);\n }\n }\n for(int i = 0; i < n; i++) if(in[i] != 0) return {};\n return ret;\n }\n\n // プリム法, 連結なら始点sは関係ない\n template<typename edge>\n vec<edge> undirected_mst(vec<vec<edge>> &g, int s = 0){\n int n = g.size();\n assert(s < n);\n static vec<bool> V(n, 0);\n vec<edge> ret;\n using pde = std::pair<typename edge::weight, edge>;\n std::priority_queue<pde, vec<pde>, std::function<bool(pde, pde)>> que([](pde a, pde b){\n return a.first > b.first;\n });\n V[s] = true;\n for(edge &e : g[s]) que.push(pde{e.wei(), e});\n while(!que.empty()){\n auto [d, e] = que.top();\n que.pop();\n if(V[e.to()]) continue;\n V[e.to()] = true;\n ret.push_back(e);\n for(edge &ec : g[e.to()]) if(!V[ec.to()]) que.push({ec.wei(), ec});\n }\n for(edge &e : ret) V[e.to()] = V[e.from()] = false;\n return ret;\n }\n // rを根とするbfs木O(V + E)\n template<typename edge>\n vec<vec<edge>> bfs_tree(vec<vec<edge>> &g, int r){\n int n = g.size();\n std::queue<int> que;\n vec<bool> used(n, false);\n que.push(r);\n vec<vec<edge>> ret(n);\n used[r] = true;\n while(!que.empty()){\n int v = que.front();\n que.pop();\n for(edge &e : g[v]){\n int to = e.to();\n if(used[to]) continue;\n used[to] = true;\n ret[v].push_back(e);\n que.push(to);\n }\n }\n return ret;\n }\n // rを根とするbfs木, 最短経路的 O((V + E)logV)\n// {木, 重みのテーブル}\n template<typename edge>\n std::pair<vec<vec<edge>>, vec<typename edge::weight>> bfs_tree_shortest(vec<vec<edge>> &g, int r){\n int n = g.size();\n using weight = typename edge::weight;\n using pdv = std::pair<weight, int>;\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\n std::priority_queue<pdv, vec<pdv>, std::greater<pdv>> que;\n vec<weight> dist(n, inf);\n dist[r] = edge::z();\n que.push({edge::z(), r});\n vec<vec<edge>> ret(n);\n while(!que.empty()){\n auto [d, v] = que.top();\n que.pop();\n if(dist[v] < d) continue;\n for(edge &e : g[v]){\n int to = e.to();\n weight nxtd = d + e.wei();\n if(dist[to] > nxtd){\n dist[to] = nxtd;\n ret[v].push_back(e);\n que.push({nxtd, to});\n }\n }\n }\n return {ret, dist};\n }\n // g[i]の辺を{同じcmpへの辺, 異なるcmpへの辺}に並び替える, O(V + E)\n template<typename edge>\n void cmp_edge_arrange(const vec<int> &cmp, vec<vec<edge>> &g){\n int n = g.size();\n for(int i = 0; i < n; i++){\n int m = g[i].size();\n int l = 0, r = m - 1;\n while(l < r){\n while(l < m && cmp[i] == cmp[g[i][l].to()]) l++;\n while(0 < r && cmp[i] == cmp[g[i][r].to()]) r--;\n if(l < r) std::swap(g[i][l], g[i][r]);\n }\n }\n }\n};\n\n#line 3 \"a.cpp\"\n\nint main(){\n io_init();\n int n, m;\n std::cin >> n >> m;\n //simple_graph g(n);\n vector<vector<simple_edge<int>>> g(n);\n\n ll S = 0;\n auto a = read_vec<int>(n);\n range(i, 0, n) S += a[i];\n range(i, 0, m){\n int x, y;\n std::cin >> x >> y;\n x--, y--;\n g[x].push_back({x, y});\n g[y].push_back({y, x});\n }\n vector<vector<simple_edge<int>>> F(0);\n vector<bool> is_articulation;\n vector<int> cmp;\n \n std::tie(is_articulation, cmp, F) = graph_algorithm::block_cut_tree(g);\n\n int N = F.size();\n vector<ll> cmp_sum(N, 0), cmp_sum_sub(N, -1), cmp_max(N, 0), root(N, -1), parent(N, -1);\n range(i, 0, n) cmp_sum[cmp[i]] += a[i];\n \n auto f = [&](auto &&f, int cur, int par, int r)->void{\n parent[cur] = par;\n root[cur] = r;\n cmp_sum_sub[cur] = cmp_sum[cur];\n for(auto &e : F[cur]){\n if(e.t == par) continue;\n f(f, e.t, cur, r);\n cmp_sum_sub[cur] += cmp_sum_sub[e.t];\n }\n };\n for(int i = 0; i < N; i++){\n if(cmp_sum_sub[i] == -1){\n f(f, i, -1, i);\n }\n }\n for(int i = 0; i < N; i++){\n cmp_max[i] = cmp_sum_sub[root[i]] - cmp_sum_sub[i];\n for(auto &e : F[i]){\n if(e.t == parent[i]) continue;\n cmp_max[i] = max(cmp_max[i], cmp_sum_sub[e.t]);\n }\n }\n\n vector<ll> ans(n);\n range(i, 0, n){\n if(!is_articulation[i]){\n ans[i] = S - a[i];\n }else{\n ans[i] = cmp_max[cmp[i]];\n }\n }\n //std::cout << cmp_max << '\\n';\n range(i, 0, n) std::cout << ans[i] << '\\n';\n}","accuracy":1,"time_ms":70,"memory_kb":37956,"score_of_the_acc":-1.0592,"final_rank":12},{"submission_id":"aoj_3022_7164702","code_snippet":"#line 1 \"test/graph/bcc/AOJ3022.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022\"\n\n#line 2 \"src/Template.hpp\"\n\n#define CUT\n#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, r) for (int i = (l); i < (r); ++i)\n#define rrep(i, l, r) for (int i = (r); i --> (l);)\n#define all(c) begin(c), end(c)\n\n#ifdef LOCAL\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\ntemplate <class H, class... Ts> void debug_impl(string s, H&& h, Ts&&... ts) {\n cerr << '(' << s << \"): (\" << forward<H>(h);\n ((cerr << \", \" << forward<Ts>(ts)), ..., (cerr << \")\\n\"));\n}\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\n\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\n for (auto& e : v) in >> e;\n return in;\n}\ntemplate <class ...Args> void read(Args&... args) {\n (cin >> ... >> args);\n}\ntemplate <class T> ostream& operator<<(ostream& out, const vector<T>& v) {\n int n = v.size();\n rep(i, 0, n) {\n out << v[i];\n if (i + 1 != n) out << ' ';\n }\n return out;\n}\ntemplate <class H, class ...Ts> void print(H&& h, Ts &&... ts) {\n cout << h, ((cout << ' ' << forward<Ts>(ts)), ..., (cout << '\\n'));\n}\n\nstruct io_setup_ {\n io_setup_() {\n ios::sync_with_stdio(false), cin.tie(nullptr);\n cout << fixed << setprecision(10);\n }\n} io_setup{};\n#undef CUT\n\n#define NOTE compile command: \\texttt{g++ -std=gnu++17 -Wall -Wextra -g -fsanitize=address -fsanitize=undefined \\$\\{file\\} -o \\$\\{fileDirname\\}/\\$\\{fileBasenameNoExtension\\}}\n#undef NOTE\n#define NOTE \\texttt{-DLOCAL} を加えると \\texttt{debug(...)} による出力が有効となる\n#undef NOTE\n#line 3 \"src/graph/BCC.hpp\"\n#define CUT\n#line 2 \"src/graph/LowLink.hpp\"\n\n#line 4 \"src/graph/LowLink.hpp\"\n\n#define CUT\nstruct LowLink {\n int n, m;\n vector<pair<int, int>> edges;\n vector<vector<pair<int, int>>> g;\n vector<int> ord, low, a_ids, b_ids;\n\n bool built = false;\n\n LowLink(const int n = 0): n(n), m(0), g(n), ord(n, -1), low(n) {}\n\n // Returns the id of the added edge\n int add_edge(int u, int v) {\n built = false;\n edges.emplace_back(u, v);\n g[u].emplace_back(v, m);\n g[v].emplace_back(u, m);\n return m++;\n }\n\n void build() {\n if (exchange(built, true)) return;\n int t = 0;\n auto dfs = [&](auto dfs, int u, int id) -> void {\n bool is_root = id < 0, is_art = false;\n int cnt = 0;\n ord[u] = low[u] = t++;\n for (auto [v, id2] : g[u]) if (id != id2) {\n if (ord[v] < 0) {\n ++cnt;\n dfs(dfs, v, id2);\n chmin(low[u], low[v]);\n if (ord[u] <= low[v]) {\n is_art = not is_root;\n if (ord[u] != low[v]) b_ids.push_back(id2);\n }\n } else {\n chmin(low[u], ord[v]);\n }\n }\n if (is_art or (is_root and cnt > 1)) {\n a_ids.push_back(u);\n }\n };\n rep(i, 0, n) if (ord[i] < 0) dfs(dfs, i, -1);\n }\n\n // Returns `\\{i \\mid \\text{$e_i$ is a bridge} \\}`\n const vector<int>& bridge_ids() {\n return build(), b_ids;\n }\n // Returns `\\{i \\mid \\text{$v_i$ is an articulation point} \\}`\n const vector<int>& articulation_points() {\n return build(), a_ids;\n }\n\n bool is_bridge(int u, int v) {\n build();\n if (ord[u] > ord[v]) swap(u, v);\n return ord[u] < low[v];\n }\n};\n#undef CUT\n#line 5 \"src/graph/BCC.hpp\"\n\nstruct BCC {\n // isolated vertex <-> eid is empty\n vector<int> vids, eids;\n};\n\nstruct BCCDecomp: LowLink {\n // cid[i]: the id of BCC to which `e_i` belongs\n vector<int> cid;\n // isolated vertices\n vector<int> iso;\n\n BCCDecomp(int n = 0): LowLink(n) {}\n\n int build() {\n if (built) return iso.size() + (m ? *max_element(all(cid)) + 1 : 0);\n LowLink::build();\n\n vector<int8_t> used(n);\n\n int num = 0;\n cid.assign(m, -1);\n\n auto dfs = [&](auto dfs, int u, int peid) -> void {\n used[u] = true;\n static vector<int> edges;\n for (const auto& [v, eid] : g[u]) if (eid != peid) {\n if (not used[v] or ord[v] < ord[u]) edges.push_back(eid);\n if (used[v]) continue;\n dfs(dfs, v, eid);\n if (low[v] < ord[u]) continue;\n int e;\n do cid[e = edges.back()] = num, edges.pop_back(); while (e != eid);\n num++;\n }\n };\n\n for (int i = 0; i < n; ++i) if (not used[i]) {\n dfs(dfs, i, -1);\n if (g[i].empty()) iso.push_back(i);\n }\n return num + iso.size();\n }\n\n vector<BCC> bcc() {\n const int num = build(), vcmp = iso.size(), ecmp = num - vcmp;\n\n vector<BCC> res(num);\n rep(i, 0, m) {\n res[cid[i]].eids.push_back(i);\n }\n vector<int8_t> seen(n, false);\n rep(id, 0, ecmp) {\n for (int eid : res[id].eids) {\n const auto& [u, v] = edges[eid];\n if (not exchange(seen[u], true)) res[id].vids.push_back(u);\n if (not exchange(seen[v], true)) res[id].vids.push_back(v);\n }\n for (int v : res[id].vids) seen[v] = false;\n }\n rep(id, 0, vcmp) {\n res[ecmp + id].vids = { iso[id] };\n }\n return res;\n }\n\n // Let `C := \\text{set of BCC}` and `A := \\text{set of articulation points}`\n // Vertex set of BCT `V := C\\sqcup A` (`0 \\leq i < |C|` corresponds to the `i`-th BCC and `|C| \\leq i < |C| + |A|` corresponds to the `(i-|C|)`-th articulation point)\n // Edge set of BCT `E := \\{(c, a) \\in C\\times A \\mid a \\in V(C) \\}`\n vector<vector<int>> block_cut_tree(const vector<BCC> &bccs) {\n const int cnum = bccs.size(), anum = a_ids.size();\n\n vector<int> ids(n, -1);\n rep(i, 0, anum) {\n ids[a_ids[i]] = cnum + i;\n }\n\n vector<vector<int>> res(cnum + anum);\n rep(i, 0, cnum) {\n for (int v : bccs[i].vids) {\n if (int j = ids[v]; j >= 0) {\n res[i].push_back(j);\n res[j].push_back(i);\n }\n }\n }\n return res;\n }\n\n // Let `C := \\text{set of BCC}` and `A := \\text{the vertex set of original graph}`\n // Vertex set of BCT `V := C\\sqcup A` (`0 \\leq i < |C|` corresponds to the `i`-th BCC and `|C| \\leq i < |C| + |A|` corresponds to the `(i-|C|)`-th vertex)\n // Edge set of BCT `E := \\{(c, a) \\in C\\times A \\mid a \\in V(C) \\}`\n vector<vector<int>> ext_block_cut_tree(const vector<BCC> &bccs) {\n const int cnum = bccs.size();\n vector<vector<int>> res(cnum + n);\n rep(i, 0, cnum) {\n for (int v : bccs[i].vids) {\n res[i].push_back(cnum + v);\n res[cnum + v].push_back(i);\n }\n }\n return res;\n }\n};\n#undef CUT\n\n#define NOTE 多重辺・自己ループがあってもよい\n#undef NOTE\n#line 4 \"test/graph/bcc/AOJ3022.test.cpp\"\n\nint main() {\n int n, m;\n read(n, m);\n vector<long long> w(n);\n read(w);\n\n const long long sum = accumulate(all(w), 0LL);\n\n BCCDecomp bccd(n);\n rep(i, 0, m) {\n int u, v;\n read(u, v);\n --u, --v;\n bccd.add_edge(u, v);\n }\n bccd.build();\n\n vector<int8_t> is_art(n);\n for (int v : bccd.articulation_points()) {\n is_art[v] = true;\n }\n\n vector<long long> ans(n);\n rep(i, 0, n) {\n ans[i] = sum - w[i];\n }\n\n auto bcc = bccd.bcc();\n auto bct = bccd.block_cut_tree(bcc);\n const int k = bcc.size(), l = (int) bct.size() - k;\n\n vector<long long> s(k + l);\n rep(i, 0, k) {\n for (int v : bcc[i].vids) if (not is_art[v]) {\n s[i] += w[v];\n }\n }\n rep(i, 0, l) {\n s[k + i] = w[bccd.a_ids[i]];\n }\n\n auto dfs = [&](auto dfs, int u, int p) -> long long {\n long long max_child = 0;\n long long res = s[u];\n for (int v : bct[u]) if (v != p) {\n long long resv = dfs(dfs, v, u);\n chmax(max_child, resv);\n res += resv;\n }\n if (u >= k) {\n chmax(max_child, sum - res);\n ans[bccd.a_ids[u - k]] = max_child;\n }\n return res;\n };\n dfs(dfs, 0, -1);\n\n rep(i, 0, n) {\n print(ans[i]);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":34288,"score_of_the_acc":-0.9021,"final_rank":11},{"submission_id":"aoj_3022_6330819","code_snippet":"// https://onlinejudge.u-aizu.ac.jp/problems/3022\n#pragma GCC optimize(\"fast-math\")\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n# include <dbg.h>\n#else\n# define dbg(...) do {} while (0)\n#endif\n\n#define cp_lib_4th(_1, _2, _3, x, ...) x\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\n#define all(a) ::begin(a),::end(a)\n#define trav(a, b) for (auto&& a : (b))\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\n\n\n#ifdef CP_LIB_DEBUG\n#define cp_lib_assert(expr) \\\n do { if (!(expr)) { \\\n ::cerr << \"assertion failed: \" << #expr << \" (\" << __FILE__ << ':' << __LINE__ << \")\\n\"; \\\n ::abort(); \\\n } } while (0)\n#else\n#define cp_lib_assert(expr)\n#endif\n\n\n#if __cplusplus < 202002L\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\n#endif\n#if __cpp_lib_remove_cvref < 201711L\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\n#endif\n\nnamespace cp_lib_type_meta {\n template <class T, class = void> constexpr bool is_tuple_like = false;\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\n}\n\n\nnamespace cp_lib_modint { struct ModIntTag {}; }\n#include <unistd.h>\n\nnamespace cp_lib_io {\n constexpr int BUF_SIZE = 1 << 20;\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\n array<array<char, 4>, 10'000> digits{};\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\n rep(j, 10'000)\n digits[j][i] = char('0' + j / d % 10);\n return digits;\n }();\n array<char, BUF_SIZE> ibuf, obuf;\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\n\n template <class T> constexpr bool is_std_array = false;\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\n\n void flush() {\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\n optr = begin(obuf);\n }\n int _flush_atexit = []{ atexit(flush); return 0; }();\n\n void refill() {\n memmove(begin(ibuf), iptr, iend - iptr);\n iend -= iptr - begin(ibuf);\n iptr = begin(ibuf);\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\n *iend = '\\0';\n }\n\n template <class T, class T2 = remove_cvref_t<T>>\n void print(T&& val) {\n if (end(obuf) - optr < 64)\n flush();\n\n if constexpr (is_same_v<T2, char>)\n *optr++ = val;\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\n return print(int(val));\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\n if (val < 0)\n *optr++ = '-';\n using U = make_unsigned_t<T2>;\n return print(U(val < 0 ? -U(val) : U(val)));\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\n T2 val2 = val;\n array<char, 64> tmp;\n char* tptr = end(tmp);\n while (val2 >= 10'000)\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\n memcpy(optr, &DIGITS[val2][4 - d], d);\n memcpy(optr + d, tptr, end(tmp) - tptr);\n optr += d + int(end(tmp) - tptr);\n } else if constexpr (is_floating_point_v<T2>)\n optr += sprintf(optr, \"%.30Lf\", (long double)val);\n else if constexpr (is_convertible_v<T, string_view>) {\n string_view sv(val);\n if (sz(sv) + 1 <= end(obuf) - optr)\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\n else {\n flush();\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\n }\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\n return print(decltype(T2::mod())(val));\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\n else {\n trav(item, val)\n print(item);\n return;\n }\n *optr++ = ' ';\n }\n\n template <class T>\n void read(T& val) {\n auto skip_ws = [] {\n do {\n for (; iptr != iend && *iptr <= ' '; ++iptr);\n if (iend - iptr < 64)\n refill();\n } while (*iptr <= ' ');\n };\n auto read_other = [&](auto other) {\n read(other);\n return other;\n };\n\n if constexpr (is_same_v<T, char>)\n skip_ws(), val = *iptr++;\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\n val = bool(read_other(uint8_t()));\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\n val = T(read_other(ll()));\n } else if constexpr (is_integral_v<T>) {\n skip_ws();\n if (is_signed_v<T> && *iptr == '-')\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\n else\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\n } else if constexpr (is_floating_point_v<T>)\n skip_ws(), val = T(strtold(iptr, &iptr));\n else if constexpr (is_same_v<T, string>) {\n skip_ws();\n val.clear();\n do {\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\n val.append(iptr, after);\n if ((iptr = after) != iend)\n break;\n refill();\n } while (iptr != iend);\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\n apply([](auto&... items) { (read(items), ...); }, val);\n else\n trav(item, val)\n read(item);\n }\n}\n\nusing cp_lib_io::flush;\n\ntemplate <class... Args>\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\n\ntemplate <class... Args>\nvoid println(Args&&... args) {\n if (sizeof...(Args))\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\n';\n else\n print('\\n'), --cp_lib_io::optr;\n}\n\ntemplate <class... Args>\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\n\n\n\ntemplate <class A, class M = identity,\n class = enable_if_t<!cp_lib_type_meta::is_tuple_like<remove_cvref_t<A>>>>\nauto graph(A&& adj, M&& m = M()) { return make_tuple(ref(adj), sz(adj), m); }\ntemplate <class G, class = enable_if_t<cp_lib_type_meta::is_tuple_like<remove_cvref_t<G>>>>\nauto graph(G g) { return g; }\nnamespace cp_lib_graph {\n template <class G> using AdjListIter = decltype(begin(get<0>(graph(declval<G>()))[0]));\n}\n\n\n\nnamespace cp_lib_graph {\n template <class T, enable_if_t<is_convertible_v<int, remove_cvref_t<T>>, int> = 0>\n auto maybe_edge_idx(T v) { return pair(int(v), 0); }\n template <class T, enable_if_t<!is_convertible_v<int, remove_cvref_t<T>>, int> = 0>\n auto maybe_edge_idx(T p) { auto [v, e] = p; return pair(int(v), int(e)); }\n}\n\ntemplate <class G, class OnComp>\nvoid find_biconnected_components(G&& g, OnComp&& on_comp) {\n auto [adj, n, map] = graph(forward<G>(g));\n vector idx(n, INF);\n vector<pair<int, cp_lib_graph::AdjListIter<G>>> stack;\n\n auto dfs = [&, &adj = adj, &map = map](int v, pair<int, int> pe, auto&& self) -> int {\n int up = idx[v] = sz(stack), cnt = 0;\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\n auto [v2, e] = cp_lib_graph::maybe_edge_idx(map(*it));\n if (pair(v2, e) == pe)\n continue;\n up = min(up, idx[v2]);\n if (idx[v2] == INF || idx[v2] < idx[v])\n stack.emplace_back(v, it);\n if (idx[v2] != INF)\n continue;\n\n int up2 = self(v2, pair(v, e), self);\n up = min(up, up2);\n if (up2 >= idx[v]) {\n auto cut_v = (pe.first == -1 && !cnt++ ? nullopt : optional(v));\n on_comp(cut_v, begin(stack) + idx[v2] - 1, end(stack));\n stack.resize(idx[v2] - 1);\n }\n }\n return up;\n };\n\n rep(i, n)\n if (idx[i] == INF)\n dfs(i, pair(-1, 0), dfs);\n}\n\ntemplate <class G>\nauto block_vertex_tree(G&& g) {\n auto [adj, n, to] = graph(forward<G>(g));\n vector tree(n, vector<int>());\n find_biconnected_components(adj, [&, &to = to](auto, auto it, auto it_end) {\n int vc = sz(tree);\n tree.emplace_back();\n for (; it != it_end; ++it)\n for (int v : {it->first, to(*it->second)})\n if (!sz(tree[v]) || tree[v].back() != vc)\n tree[v].push_back(vc), tree[vc].push_back(v);\n });\n return tree;\n}\n\nint main() {\n int n, m; read(n, m);\n vector w(n, 0ll);\n read(w);\n vector adj(n, vector<int>());\n rep(_, m) {\n int u, v; read(u, v); --u, --v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n\n auto bvt = block_vertex_tree(adj);\n w.resize(sz(bvt));\n auto dfs = [&](int v, int p, auto&& self) -> void {\n trav(v2, bvt[v])\n if (v2 != p)\n self(v2, v, self), w[v] += w[v2];\n };\n dfs(0, -1, dfs);\n\n rep(i, n) {\n ll ans = w[0] - w[i];\n trav(v, bvt[i])\n if (w[v] < w[i])\n ans = max(ans, w[v]);\n println(ans);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":23884,"score_of_the_acc":-0.509,"final_rank":8},{"submission_id":"aoj_3022_6317969","code_snippet":"#pragma GCC optimize(\"fast-math\")\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n# include <dbg.h>\n#else\n# define dbg(...) do {} while (0)\n#endif\n\n#define cp_lib_4th(_1, _2, _3, x, ...) x\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\n#define all(a) ::begin(a),::end(a)\n#define trav(a, b) for (auto&& a : (b))\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\n\n\n#ifdef CP_LIB_DEBUG\n#define cp_lib_assert(expr) \\\n do { if (!(expr)) { \\\n ::cerr << \"assertion failed: \" << #expr << \" (\" << __FILE__ << ':' << __LINE__ << \")\\n\"; \\\n ::abort(); \\\n } } while (0)\n#else\n#define cp_lib_assert(expr)\n#endif\n\n\n#if __cplusplus < 202002L\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\n#endif\n#if __cpp_lib_remove_cvref < 201711L\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\n#endif\n\nnamespace cp_lib_type_meta {\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\n template <class T, class = void> constexpr bool is_tuple_like = false;\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\n}\n\n\nnamespace cp_lib_modint { struct ModIntTag {}; }\n#include <unistd.h>\n\nnamespace cp_lib_io {\n constexpr int BUF_SIZE = 1 << 20;\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\n array<array<char, 4>, 10'000> digits{};\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\n rep(j, 10'000)\n digits[j][i] = char('0' + j / d % 10);\n return digits;\n }();\n array<char, BUF_SIZE> ibuf, obuf;\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\n\n template <class T> constexpr bool is_std_array = false;\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\n\n void flush() {\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\n optr = begin(obuf);\n }\n int _flush_atexit = []{ atexit(flush); return 0; }();\n\n void refill() {\n memmove(begin(ibuf), iptr, iend - iptr);\n iend -= iptr - begin(ibuf);\n iptr = begin(ibuf);\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\n *iend = '\\0';\n }\n\n template <class T, class T2 = remove_cvref_t<T>>\n void print(T&& val) {\n if (end(obuf) - optr < 64)\n flush();\n\n if constexpr (is_same_v<T2, char>)\n *optr++ = val;\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\n return print(int(val));\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\n if (val < 0)\n *optr++ = '-';\n using U = make_unsigned_t<T2>;\n return print(U(val < 0 ? -U(val) : U(val)));\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\n T2 val2 = val;\n array<char, 64> tmp;\n char* tptr = end(tmp);\n while (val2 >= 10'000)\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\n memcpy(optr, &DIGITS[val2][4 - d], d);\n memcpy(optr + d, tptr, end(tmp) - tptr);\n optr += d + int(end(tmp) - tptr);\n } else if constexpr (is_floating_point_v<T2>)\n optr += sprintf(optr, \"%.30Lf\", (long double)val);\n else if constexpr (is_convertible_v<T, string_view>) {\n string_view sv(val);\n if (sz(sv) + 1 <= end(obuf) - optr)\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\n else {\n flush();\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\n }\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\n return print(decltype(T2::mod())(val));\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\n else {\n trav(item, val)\n print(item);\n return;\n }\n *optr++ = ' ';\n }\n\n template <class T>\n void read(T& val) {\n auto skip_ws = [] {\n do {\n for (; iptr != iend && *iptr <= ' '; ++iptr);\n if (iend - iptr < 64)\n refill();\n } while (*iptr <= ' ');\n };\n auto read_other = [&](auto other) {\n read(other);\n return other;\n };\n\n if constexpr (is_same_v<T, char>)\n skip_ws(), val = *iptr++;\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\n val = bool(read_other(uint8_t()));\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\n val = T(read_other(ll()));\n } else if constexpr (is_integral_v<T>) {\n skip_ws();\n if (is_signed_v<T> && *iptr == '-')\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\n else\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\n } else if constexpr (is_floating_point_v<T>)\n skip_ws(), val = T(strtold(iptr, &iptr));\n else if constexpr (is_same_v<T, string>) {\n skip_ws();\n val.clear();\n do {\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\n val.append(iptr, after);\n if ((iptr = after) != iend)\n break;\n refill();\n } while (iptr != iend);\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\n apply([](auto&... items) { (read(items), ...); }, val);\n else\n trav(item, val)\n read(item);\n }\n}\n\nusing cp_lib_io::flush;\n\ntemplate <class... Args>\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\n\ntemplate <class... Args>\nvoid println(Args&&... args) {\n if (sizeof...(Args))\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\n';\n else\n print('\\n'), --cp_lib_io::optr;\n}\n\ntemplate <class... Args>\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\n// #include \"cp-lib/graph/lca.hpp\"\n\ntemplate <class A, class M>\nstruct NewGraph {\n A& adj;\n int n;\n M map;\n\n using Mapped = decltype(declval<M>()(*begin(declval<A>()[0])));\n\n NewGraph(A& adj_, M map_) : adj(adj_), n(sz(adj)), map(move(map_)) {}\n explicit NewGraph(A& adj_) : NewGraph(adj_, identity()) {}\n};\n\ntemplate <class A> NewGraph(A&) -> NewGraph<A, identity>;\n\ntemplate <class G, class OnComp>\nvoid biconnected_components(G&& graph, OnComp&& on_comp) {\n auto [adj, n, map] = NewGraph(forward<G>(graph));\n auto normalize = [&](auto mapped) {\n if constexpr(is_convertible_v<int, decltype(mapped)>)\n return pair(int(mapped), 0);\n else\n return mapped;\n };\n vector idx(n, INF);\n vector<pair<int, decltype(begin(adj[0]))>> stack;\n\n auto dfs = [&, &adj = adj, &map = map](int v, pair<int, int> pe, auto&& self) -> int {\n int up = idx[v] = sz(stack), cnt = 0;\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\n auto [v2, e] = normalize(map(*it));\n if (pair(v2, e) == pe)\n continue;\n up = min(up, idx[v2]);\n if (idx[v2] == INF || idx[v2] < idx[v])\n stack.emplace_back(v, it);\n if (idx[v2] != INF)\n continue;\n\n int up2 = self(v2, pair(v, e), self);\n up = min(up, up2);\n if (up2 >= idx[v]) {\n auto cut_v = (pe.first == -1 && !cnt++ ? nullopt : optional(v));\n on_comp(cut_v, begin(stack) + idx[v2] - 1, end(stack));\n stack.resize(idx[v2] - 1);\n }\n }\n return up;\n };\n\n rep(i, n)\n if (idx[i] == INF)\n dfs(i, pair(-1, 0), dfs);\n}\n\ntemplate <class G>\nvector<vector<int>> block_vertex_tree(G&& graph) {\n NewGraph g(forward<G>(graph));\n vector adj(g.n, vector<int>());\n biconnected_components(g, [&](auto, auto it, auto it_end) {\n int vc = sz(adj);\n adj.emplace_back();\n for (; it != it_end; ++it)\n for (int v : {it->first, g.map(*it->second)})\n if (!sz(adj[v]) || adj[v].back() != vc)\n adj[v].push_back(vc), adj[vc].push_back(v);\n });\n return adj;\n}\n\nint main() {\n // int n, m; read(n, m);\n // vector adj(n, vector<pair<int, int>>());\n // rep(i, m) {\n // int u, v; read(u, v);\n // adj[u].emplace_back(v, i);\n // adj[v].emplace_back(u, i);\n // }\n\n // vector<vector<int>> bicomps;\n // biconnected_components(adj, [&](auto, auto it, auto it_end) {\n // auto& comp = bicomps.emplace_back();\n // for (; it != it_end; ++it)\n // comp.push_back(it->second->second);\n // });\n\n // println(sz(bicomps));\n // trav(comp, bicomps)\n // println(sz(comp), comp);\n\n\n // int n, m; read(n, m);\n // vector adj(n, vector<int>());\n // rep(_, m) {\n // int u, v; read(u, v);\n // adj[u].push_back(v);\n // adj[v].push_back(u);\n // }\n\n // set<int> cut_vertices;\n // biconnected_components(adj, [&](auto cut_v, auto, auto) {\n // if (cut_v)\n // cut_vertices.emplace(*cut_v);\n // });\n\n // trav(v, cut_vertices)\n // println(v);\n\n\n int n, m; read(n, m);\n vector w(n, 0);\n read(w);\n vector adj(n, vector<int>());\n rep(_, m) {\n int u, v; read(u, v); --u, --v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n\n auto bvt = block_vertex_tree(adj);\n int nt = sz(bvt);\n vector wsum(nt, 0ll);\n copy(all(w), begin(wsum));\n auto dfs = [&](int v, int p, auto&& self) -> void {\n trav(v2, bvt[v])\n if (v2 != p)\n self(v2, v, self), wsum[v] += wsum[v2];\n };\n dfs(0, -1, dfs);\n\n rep(i, n) {\n if (sz(bvt[i]) == 1) {\n println(wsum[0] - w[i]);\n continue;\n }\n\n ll mx = wsum[0] - wsum[i];\n trav(v, bvt[i])\n if (wsum[v] < wsum[i])\n mx = max(mx, wsum[v]);\n println(mx);\n }\n\n\n // int n, m; read(n, m);\n // vector adj(n, vector<int>());\n // rep(_, m) {\n // int u, v; read(u, v); --u, --v;\n // adj[u].push_back(v);\n // adj[v].push_back(u);\n // }\n}","accuracy":1,"time_ms":30,"memory_kb":24228,"score_of_the_acc":-0.4554,"final_rank":6},{"submission_id":"aoj_3022_6317771","code_snippet":"#pragma GCC optimize(\"fast-math\")\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n# include <dbg.h>\n#else\n# define dbg(...) do {} while (0)\n#endif\n\n#define cp_lib_4th(_1, _2, _3, x, ...) x\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\n#define all(a) ::begin(a),::end(a)\n#define trav(a, b) for (auto&& a : (b))\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\n\n\n#ifdef CP_LIB_DEBUG\n#define cp_lib_assert(expr) \\\n do { if (!(expr)) { \\\n ::cerr << \"assertion failed: \" << #expr << \" (\" << __FILE__ << ':' << __LINE__ << \")\\n\"; \\\n ::abort(); \\\n } } while (0)\n#else\n#define cp_lib_assert(expr)\n#endif\n\n\n#if __cplusplus < 202002L\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\n#endif\n#if __cpp_lib_remove_cvref < 201711L\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\n#endif\n\nnamespace cp_lib_type_meta {\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\n template <class T, class = void> constexpr bool is_tuple_like = false;\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\n}\n\n\nnamespace cp_lib_modint { struct ModIntTag {}; }\n#include <unistd.h>\n\nnamespace cp_lib_io {\n constexpr int BUF_SIZE = 1 << 20;\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\n array<array<char, 4>, 10'000> digits{};\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\n rep(j, 10'000)\n digits[j][i] = char('0' + j / d % 10);\n return digits;\n }();\n array<char, BUF_SIZE> ibuf, obuf;\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\n\n template <class T> constexpr bool is_std_array = false;\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\n\n void flush() {\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\n optr = begin(obuf);\n }\n int _flush_atexit = []{ atexit(flush); return 0; }();\n\n void refill() {\n memmove(begin(ibuf), iptr, iend - iptr);\n iend -= iptr - begin(ibuf);\n iptr = begin(ibuf);\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\n *iend = '\\0';\n }\n\n template <class T, class T2 = remove_cvref_t<T>>\n void print(T&& val) {\n if (end(obuf) - optr < 64)\n flush();\n\n if constexpr (is_same_v<T2, char>)\n *optr++ = val;\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\n return print(int(val));\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\n if (val < 0)\n *optr++ = '-';\n using U = make_unsigned_t<T2>;\n return print(U(val < 0 ? -U(val) : U(val)));\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\n T2 val2 = val;\n array<char, 64> tmp;\n char* tptr = end(tmp);\n while (val2 >= 10'000)\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\n memcpy(optr, &DIGITS[val2][4 - d], d);\n memcpy(optr + d, tptr, end(tmp) - tptr);\n optr += d + int(end(tmp) - tptr);\n } else if constexpr (is_floating_point_v<T2>)\n optr += sprintf(optr, \"%.30Lf\", (long double)val);\n else if constexpr (is_convertible_v<T, string_view>) {\n string_view sv(val);\n if (sz(sv) + 1 <= end(obuf) - optr)\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\n else {\n flush();\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\n }\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\n return print(decltype(T2::mod())(val));\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\n else {\n trav(item, val)\n print(item);\n return;\n }\n *optr++ = ' ';\n }\n\n template <class T>\n void read(T& val) {\n auto skip_ws = [] {\n do {\n for (; iptr != iend && *iptr <= ' '; ++iptr);\n if (iend - iptr < 64)\n refill();\n } while (*iptr <= ' ');\n };\n auto read_other = [&](auto other) {\n read(other);\n return other;\n };\n\n if constexpr (is_same_v<T, char>)\n skip_ws(), val = *iptr++;\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\n val = bool(read_other(uint8_t()));\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\n val = T(read_other(ll()));\n } else if constexpr (is_integral_v<T>) {\n skip_ws();\n if (is_signed_v<T> && *iptr == '-')\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\n else\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\n } else if constexpr (is_floating_point_v<T>)\n skip_ws(), val = T(strtold(iptr, &iptr));\n else if constexpr (is_same_v<T, string>) {\n skip_ws();\n val.clear();\n do {\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\n val.append(iptr, after);\n if ((iptr = after) != iend)\n break;\n refill();\n } while (iptr != iend);\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\n apply([](auto&... items) { (read(items), ...); }, val);\n else\n trav(item, val)\n read(item);\n }\n}\n\nusing cp_lib_io::flush;\n\ntemplate <class... Args>\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\n\ntemplate <class... Args>\nvoid println(Args&&... args) {\n if (sizeof...(Args))\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\n';\n else\n print('\\n'), --cp_lib_io::optr;\n}\n\ntemplate <class... Args>\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\n\n\ntemplate <class A, class M>\nstruct Graph {\n const A& adj;\n int n;\n M map;\n\n Graph(const A& adj_, int n_, M map_) : adj(adj_), n(n_), map(move(map_)) {}\n Graph(const A& adj_, M map_) : Graph(adj_, sz(adj_), move(map_)) {}\n Graph(const A& adj_, int n_) : Graph(adj_, n_, identity()) {}\n explicit Graph(const A& adj_) : Graph(adj_, identity()) {}\n};\n\ntemplate <class A> Graph(const A&, int) -> Graph<A, identity>;\ntemplate <class A> Graph(const A&) -> Graph<A, identity>;\n\n\n\ntemplate <class T> constexpr inline bool is_pow2(T n) { return n && !(n & (n - 1)); }\ntemplate <class T> constexpr inline int floor_log2(T n) { return n ? 63 - __builtin_clzll(n) : 0; }\ntemplate <class T> constexpr inline int ceil_log2(T n) { return n ? floor_log2(n) + !is_pow2(n) : 0; }\n\nnamespace cp_lib_rmq {\n template <class T, bool Max> T minmax(T a, T b) { return (a < b) ^ Max ? a : b; }\n}\n\ntemplate <class T, T (*Combine)(T, T)>\nstruct SparseTable {\n vector<vector<T>> d = {};\n\n SparseTable() = default;\n explicit SparseTable(const vector<T>& v) {\n int n = sz(v), k = floor_log2(n);\n d.assign(k + 1, v);\n rep(i, k) rep(j, n)\n d[i + 1][j] = Combine(d[i][j], d[i][min(j + (1 << i), n - 1)]);\n }\n\n // Aggregate for [l, r)\n T query(int l, int r) const {\n int k = floor_log2(r - l);\n return Combine(d[k][l], d[k][r - (1 << k)]);\n }\n};\n\ntemplate <class T>\nusing Rmq = SparseTable<T, cp_lib_rmq::minmax<T, false>>;\ntemplate <class T>\nusing Rmaxq = SparseTable<T, cp_lib_rmq::minmax<T, true>>;\n\nstruct LowestCommonAncestor {\n vector<int> time, euler;\n Rmq<int> rmq;\n\n template <class G, class = enable_if_t<!is_same_v<LowestCommonAncestor, remove_cvref_t<G>>>>\n LowestCommonAncestor(G&& graph, int root = 0) {\n auto [adj, n, to] = Graph(forward<G>(graph));\n if (!n) return;\n time = vector(n, -1);\n vector<int> d;\n auto dfs = [&, t=1, &adj=adj, &to=to](int v, int p, int tp, auto&& self) mutable -> void {\n euler.push_back(p);\n d.push_back(tp);\n time[v] = t++;\n trav(e, adj[v])\n if (to(e) != p)\n self(to(e), v, time[v], self);\n };\n dfs(root, -1, 0, dfs);\n rep(i, n)\n if (time[i] == -1)\n dfs(i, -1, 0, dfs);\n rmq = Rmq<int>(d);\n }\n\n int lca(int u, int v) const {\n if (u == v) return u;\n auto [l, r] = minmax(time[u], time[v]);\n return euler[rmq.query(l, r)];\n }\n\n bool on_path(int v, pair<int, int> path) const {\n auto [a, b] = path;\n auto av = lca(a, v), bv = lca(b, v), ab = lca(a, b);\n return av != -1 && bv != -1 && ab != -1 && minmax(av, bv) == minmax(v, ab);\n }\n\n bool is_ancestor(int u, int v) const { return lca(u, v) == u; }\n};\n\ntemplate <class G, class OnCut, class OnComp>\nvoid biconnected_components(G&& graph, OnCut&& on_cut, OnComp&& on_comp) {\n auto [adj, n, map] = Graph(forward<G>(graph));\n vector idx(n, INF);\n vector<pair<int, decltype(begin(adj[0]))>> stack;\n\n auto make_component = [&](int rem) {\n on_comp(begin(stack) + rem, end(stack));\n stack.resize(rem);\n };\n auto dfs = [&, &adj=adj, &map=map](int v, auto pe, int root, auto&& self) -> int {\n int up = idx[v] = sz(stack);\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\n auto [v2, e] = map(*it);\n if (optional(e) == pe)\n continue;\n up = min(up, idx[v2]);\n if (idx[v2] == INF || idx[v2] < idx[v])\n stack.emplace_back(v, it);\n if (idx[v2] != INF)\n continue;\n\n int up2 = self(v2, optional(e), 0, self);\n up = min(up, up2);\n if (up2 >= idx[v]) {\n make_component(idx[v2] - 1);\n if (--root < 1)\n on_cut(v);\n }\n }\n return up;\n };\n\n rep(i, n)\n if (idx[i] == INF)\n dfs(i, nullopt, 2, dfs);\n}\n\nstruct BlockVertexTree {\n vector<vector<int>> adj;\n\n template <class G, class = enable_if_t<!is_same_v<BlockVertexTree, remove_cvref_t<G>>>>\n explicit BlockVertexTree(G&& graph) {\n Graph g(forward<G>(graph));\n auto [_, n, map] = g;\n adj.resize(n);\n\n biconnected_components(\n g, [](auto) {},\n [&, &map=map](auto it, auto it_end) {\n int vc = sz(adj);\n adj.emplace_back();\n for (; it != it_end; ++it) {\n auto [v2, _2] = map(*it->second);\n for (int v : {it->first, v2})\n if (!sz(adj[v]) || adj[v].back() != vc)\n adj[v].push_back(vc), adj[vc].push_back(v);\n }\n });\n }\n\n bool is_cut(int v) { return sz(adj[v]) == 1; }\n};\n\nint main() {\n // int n, m; read(n, m);\n // vector adj(n, vector<pair<int, int>>());\n // rep(i, m) {\n // int u, v; read(u, v);\n // adj[u].emplace_back(v, i);\n // adj[v].emplace_back(u, i);\n // }\n\n // vector<vector<int>> bicomps;\n // biconnected_components(adj, [](auto&&...) {}, [&](auto it, auto it_end) {\n // auto& comp = bicomps.emplace_back();\n // for (; it != it_end; ++it)\n // comp.push_back(it->second->second);\n // });\n\n // println(sz(bicomps));\n // trav(comp, bicomps)\n // println(sz(comp), comp);\n\n // int n, m; read(n, m);\n // vector adj(n, vector<pair<int, int>>());\n // rep(i, m) {\n // int u, v; read(u, v);\n // adj[u].emplace_back(v, i);\n // adj[v].emplace_back(u, i);\n // }\n\n // vector is_cut(n, false);\n // biconnected_components(adj, [&](int v) { is_cut[v] = true; }, [](auto&&...) {});\n\n // rep(i, n)\n // if (is_cut[i])\n // println(i);\n\n int n, m; read(n, m);\n vector w(n, 0);\n read(w);\n vector adj(n, vector<pair<int, int>>());\n rep(i, m) {\n int u, v; read(u, v); --u, --v;\n adj[u].emplace_back(v, i);\n adj[v].emplace_back(u, i);\n }\n\n BlockVertexTree bvt(adj);\n int nt = sz(bvt.adj);\n vector wsum(nt, 0ll);\n copy(all(w), begin(wsum));\n auto dfs = [&](int v, int p, auto&& self) -> void {\n trav(v2, bvt.adj[v])\n if (v2 != p)\n self(v2, v, self), wsum[v] += wsum[v2];\n };\n dfs(0, -1, dfs);\n\n rep(i, n) {\n if (bvt.is_cut(i)) {\n println(wsum[0] - w[i]);\n continue;\n }\n\n ll mx = wsum[0] - wsum[i];\n trav(v, bvt.adj[i])\n if (wsum[v] < wsum[i])\n mx = max(mx, wsum[v]);\n println(mx);\n }\n\n // int n, m; read(n, m);\n // vector adj(n, vector<int>());\n // rep(_, m) {\n // int u, v; read(u, v); --u, --v;\n // adj[u].push_back(v);\n // adj[v].push_back(u);\n // }\n}","accuracy":1,"time_ms":40,"memory_kb":24716,"score_of_the_acc":-0.5305,"final_rank":9},{"submission_id":"aoj_3022_6313873","code_snippet":"#pragma GCC optimize(\"fast-math\")\n\n#include <bits/stdc++.h>\n#ifdef LOCAL\n# include <dbg.h>\n#else\n# define dbg(...) do {} while (0)\n#endif\n\n#define cp_lib_4th(_1, _2, _3, x, ...) x\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\n#define all(a) ::begin(a),::end(a)\n#define trav(a, b) for (auto&& a : (b))\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\n\n\n#ifdef CP_LIB_DEBUG\n#define cp_lib_assert(expr) \\\n do { if (!(expr)) { \\\n ::cerr << \"assertion failed: \" << #expr << \" (\" << __FILE__ << ':' << __LINE__ << \")\\n\"; \\\n ::abort(); \\\n } } while (0)\n#else\n#define cp_lib_assert(expr)\n#endif\n\n\n#if __cplusplus < 202002L\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\n#endif\n#if __cpp_lib_remove_cvref < 201711L\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\n#endif\n\nnamespace cp_lib_type_meta {\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\n template <class T, class = void> constexpr bool is_tuple_like = false;\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\n}\n\n\nnamespace cp_lib_modint { struct ModIntTag {}; }\n#include <unistd.h>\n\nnamespace cp_lib_io {\n constexpr int BUF_SIZE = 1 << 20;\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\n array<array<char, 4>, 10'000> digits{};\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\n rep(j, 10'000)\n digits[j][i] = char('0' + j / d % 10);\n return digits;\n }();\n array<char, BUF_SIZE> ibuf, obuf;\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\n\n template <class T> constexpr bool is_std_array = false;\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\n\n void flush() {\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\n optr = begin(obuf);\n }\n int _flush_atexit = []{ atexit(flush); return 0; }();\n\n void refill() {\n memmove(begin(ibuf), iptr, iend - iptr);\n iend -= iptr - begin(ibuf);\n iptr = begin(ibuf);\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\n *iend = '\\0';\n }\n\n template <class T, class T2 = remove_cvref_t<T>>\n void print(T&& val) {\n if (end(obuf) - optr < 64)\n flush();\n\n if constexpr (is_same_v<T2, char>)\n *optr++ = val;\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\n return print(int(val));\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\n if (val < 0)\n *optr++ = '-';\n using U = make_unsigned_t<T2>;\n return print(U(val < 0 ? -U(val) : U(val)));\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\n T2 val2 = val;\n array<char, 64> tmp;\n char* tptr = end(tmp);\n while (val2 >= 10'000)\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\n memcpy(optr, &DIGITS[val2][4 - d], d);\n memcpy(optr + d, tptr, end(tmp) - tptr);\n optr += d + int(end(tmp) - tptr);\n } else if constexpr (is_floating_point_v<T2>)\n optr += sprintf(optr, \"%.30Lf\", (long double)val);\n else if constexpr (is_convertible_v<T, string_view>) {\n string_view sv(val);\n if (sz(sv) + 1 <= end(obuf) - optr)\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\n else {\n flush();\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\n }\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\n return print(decltype(T2::mod())(val));\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\n else {\n trav(item, val)\n print(item);\n return;\n }\n *optr++ = ' ';\n }\n\n template <class T>\n void read(T& val) {\n auto skip_ws = [] {\n do {\n for (; iptr != iend && *iptr <= ' '; ++iptr);\n if (iend - iptr < 64)\n refill();\n } while (*iptr <= ' ');\n };\n auto read_other = [&](auto other) {\n read(other);\n return other;\n };\n\n if constexpr (is_same_v<T, char>)\n skip_ws(), val = *iptr++;\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\n val = bool(read_other(uint8_t()));\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\n val = T(read_other(ll()));\n } else if constexpr (is_integral_v<T>) {\n skip_ws();\n if (is_signed_v<T> && *iptr == '-')\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\n else\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\n } else if constexpr (is_floating_point_v<T>)\n skip_ws(), val = T(strtold(iptr, &iptr));\n else if constexpr (is_same_v<T, string>) {\n skip_ws();\n val.clear();\n do {\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\n val.append(iptr, after);\n if ((iptr = after) != iend)\n break;\n refill();\n } while (iptr != iend);\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\n apply([](auto&... items) { (read(items), ...); }, val);\n else\n trav(item, val)\n read(item);\n }\n}\n\nusing cp_lib_io::flush;\n\ntemplate <class... Args>\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\n\ntemplate <class... Args>\nvoid println(Args&&... args) {\n if (sizeof...(Args))\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\n';\n else\n print('\\n'), --cp_lib_io::optr;\n}\n\ntemplate <class... Args>\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\n\n\ntemplate <class A, class M>\nstruct Graph {\n const A& adj;\n int n;\n M map;\n\n Graph(const A& adj_, int n_, M map_) : adj(adj_), n(n_), map(move(map_)) {}\n Graph(const A& adj_, M map_) : Graph(adj_, sz(adj_), move(map_)) {}\n Graph(const A& adj_, int n_) : Graph(adj_, n_, identity()) {}\n explicit Graph(const A& adj_) : Graph(adj_, identity()) {}\n};\n\ntemplate <class A> Graph(const A&, int) -> Graph<A, identity>;\ntemplate <class A> Graph(const A&) -> Graph<A, identity>;\n\ntemplate <class G, class OnCut, class OnComp>\nvoid biconnected_components(G&& graph, OnCut&& on_cut, OnComp&& on_comp) {\n auto [adj, n, map] = Graph(forward<G>(graph));\n vector idx(n, INF);\n vector<pair<int, decltype(begin(adj[0]))>> stack;\n\n auto make_component = [&](int rem) {\n on_comp(begin(stack) + rem, end(stack));\n stack.resize(rem);\n };\n auto dfs = [&, &adj=adj, &map=map](int v, auto pe, int root, auto&& self) -> int {\n int up = idx[v] = sz(stack);\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\n auto [v2, e] = map(*it);\n if (optional(e) == pe)\n continue;\n up = min(up, idx[v2]);\n if (idx[v2] == INF || idx[v2] < idx[v])\n stack.emplace_back(v, it);\n if (idx[v2] != INF)\n continue;\n\n int up2 = self(v2, optional(e), 0, self);\n up = min(up, up2);\n if (up2 >= idx[v]) {\n if (root == 2)\n --root;\n else if (root == 1)\n --root, on_cut(v), make_component(idx[v2] - 1), make_component(0);\n else\n on_cut(v), make_component(idx[v2] - 1);\n }\n }\n return up;\n };\n\n rep(i, n) {\n if (idx[i] != INF)\n continue;\n dfs(i, nullopt, 2, dfs);\n if (sz(stack))\n make_component(0);\n }\n}\n\nstruct BlockVertexTree {\n vector<vector<int>> adj;\n\n template <class G, class = enable_if_t<!is_same_v<BlockVertexTree, remove_cvref_t<G>>>>\n explicit BlockVertexTree(G&& graph) {\n Graph g(forward<G>(graph));\n auto [_, n, map] = g;\n adj.resize(n);\n\n biconnected_components(\n g, [](auto) {},\n [&, &map = map](auto it, auto it_end) {\n int vc = sz(adj);\n adj.emplace_back();\n for (; it != it_end; ++it) {\n auto [v2, _2] = map(*it->second);\n for (int v : {it->first, v2})\n if (!sz(adj[v]) || adj[v].back() != vc)\n adj[v].push_back(vc), adj[vc].push_back(v);\n }\n });\n }\n\n bool is_cut(int v) { return sz(adj[v]) == 1; }\n};\n\nint main() {\n // int n, m; read(n, m);\n // vector adj(n, vector<pair<int, int>>());\n // rep(i, m) {\n // int u, v; read(u, v);\n // adj[u].emplace_back(v, i);\n // adj[v].emplace_back(u, i);\n // }\n\n // vector<vector<int>> bicomps;\n // biconnected_components(adj, [](auto&&...) {}, [&](auto it, auto it_end) {\n // auto& comp = bicomps.emplace_back();\n // for (; it != it_end; ++it)\n // comp.push_back(it->second->second);\n // });\n\n // println(sz(bicomps));\n // trav(comp, bicomps)\n // println(sz(comp), comp);\n\n // int n, m; read(n, m);\n // vector adj(n, vector<pair<int, int>>());\n // rep(i, m) {\n // int u, v; read(u, v);\n // adj[u].emplace_back(v, i);\n // adj[v].emplace_back(u, i);\n // }\n\n // vector is_cut(n, false);\n // biconnected_components(adj, [&](int v) { is_cut[v] = true; }, [](auto&&...) {});\n\n // rep(i, n)\n // if (is_cut[i])\n // println(i);\n\n int n, m; read(n, m);\n vector w(n, 0);\n read(w);\n vector adj(n, vector<pair<int, int>>());\n rep(i, m) {\n int u, v; read(u, v); --u, --v;\n adj[u].emplace_back(v, i);\n adj[v].emplace_back(u, i);\n }\n\n BlockVertexTree bvt(adj);\n int nt = sz(bvt.adj);\n vector wsum(nt, 0ll);\n copy(all(w), begin(wsum));\n auto dfs = [&](int v, int p, auto&& self) -> void {\n trav(v2, bvt.adj[v])\n if (v2 != p)\n self(v2, v, self), wsum[v] += wsum[v2];\n };\n dfs(0, -1, dfs);\n\n rep(i, n) {\n if (bvt.is_cut(i)) {\n println(wsum[0] - w[i]);\n continue;\n }\n\n ll mx = wsum[0] - wsum[i];\n trav(v, bvt.adj[i])\n if (wsum[v] < wsum[i])\n mx = max(mx, wsum[v]);\n println(mx);\n }\n}","accuracy":1,"time_ms":30,"memory_kb":24644,"score_of_the_acc":-0.4661,"final_rank":7},{"submission_id":"aoj_3022_5994642","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef long long ll;\nusing namespace std;\n#define inf 0x3f3f3f3f\n\nconst int N = 1E5+100;\nint low[N],dfn[N];\nint val[N],tot[N];\nint p = 0;\nint n,m;\nint st[N],nxt[N<<1],to[N<<1],e;\nint pre[N];\nvoid addEdge(int u,int v){\n e++;nxt[e] = st[u];st[u] = e;to[e] = v;\n e++;nxt[e] = st[v];st[v] = e;to[e] = u;\n}\nvoid init(){\n memset(st,-1,sizeof(st));\n memset(nxt,-1,sizeof(nxt));\n}\nvector<int> res[N];\nvoid tarjan(int u,int fa){\n low[u] = dfn[u] = ++p;\n tot[u] = val[u];\n pre[u] = fa;\n for(int i = st[u];i!= -1;i = nxt[i]){\n int v = to[i];\n if(!dfn[v]){\n res[u].push_back(v);\n tarjan(v,u);\n tot[u]+=tot[v];\n low[u] = min(low[u],low[v]);\n }else if(v != fa){\n low[u] = min(low[u],dfn[v]);\n }\n }\n}\n\nsigned main(void){\n init();\n cin>>n>>m;\n for(int i = 1;i<=n;i++){\n scanf(\"%lld\",&val[i]);\n }\n int u,v;\n for(int i = 0;i<m;i++){\n scanf(\"%lld%lld\",&u,&v);\n addEdge(u,v);\n }\n for(int i = 1;i<=n;i++){\n if(!dfn[i]){tarjan(i,0);}\n }\n for(int i= 1;i<=n;i++){\n int ans = 0;\n int cur = tot[1]-tot[i];\n int nm = res[i].size();\n for(int j = 0;j<nm;j++){\n v = res[i][j];\n if(low[v]<dfn[i]){\n cur+=tot[v];\n }else{\n ans = max(ans,tot[v]);\n }\n }\n ans = max(ans,cur);\n printf(\"%lld\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":16000,"score_of_the_acc":-0.2433,"final_rank":2},{"submission_id":"aoj_3022_5701738","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\nvector<int> G[SIZE],children[SIZE];\nint N;\nbool visited[SIZE],is_art[SIZE];\nint visited_order[SIZE],parent[SIZE],lowest[SIZE],number;\nll W[SIZE],dp[SIZE];\n\n\nvoid dfs(int current_node,int pre_node){\n\tvisited_order[current_node] = lowest[current_node] = number; //訪問順を記録\n\tnumber++;\n\n\tvisited[current_node] = true;\n\tdp[current_node] = W[current_node];\n\n\tint next;\n\n\tfor(int i = 0; i < G[current_node].size(); i++){\n\t\tnext = G[current_node][i];\n\t\tif(!visited[next]){\n\t\t\tparent[next] = current_node;\n\t\t\tchildren[current_node].push_back(next);\n\n\t\t\tdfs(next,current_node);\n\t\t\tdp[current_node] += dp[next];\n\n\t\t\tlowest[current_node] = min(lowest[current_node],lowest[next]); //ボトムアップ的に、lowestが求まる\n\t\t}else if(visited[next] == true && next != pre_node){ //dfsTreeを遡る場合\n\t\t\tlowest[current_node] = min(lowest[current_node],visited_order[next]);\n\t\t}\n\t}\n}\n\nvoid art_points(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tvisited[i] = false;\n\t\tis_art[i] = false;\n\t}\n\n\tnumber = 1;\n\tdfs(0,-1);\n\n\tint tmp_parent,root_num = 0;\n\n\tvector<int> V;\n\n\tfor(int i = 1; i < N; i++){\n\t\ttmp_parent = parent[i];\n\t\tif(tmp_parent == 0){\n\t\t\troot_num++;\n\t\t}else if(visited_order[tmp_parent] <= lowest[i]){\n\t\t\tV.push_back(tmp_parent);\n\t\t}\n\t}\n\tif(root_num >= 2){\n\t\tV.push_back(0);\n\t}\n\tsort(V.begin(),V.end());\n\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\tfor(int i = 0; i < V.size(); i++){\n\n\t\tis_art[V[i]] = true;\n\t}\n}\n\n\nint main(){\n\tint E;\n\n\tscanf(\"%d %d\",&N,&E);\n\n\tll SUM = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&W[i]);\n\t\tSUM += W[i];\n\t}\n\n\tint from,to;\n\n\tfor(int i = 0; i < E; i++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tart_points();\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tif(!is_art[i]){\n\n\t\t\tprintf(\"%lld\\n\",SUM-W[i]);\n\t\t\tcontinue;\n\t\t}\n\n\t\tll ans = 0;\n\n\t\tif(i == 0){\n\n\t\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\t\tans = max(ans,dp[G[i][k]]);\n\t\t\t}\n\n\t\t}else{\n\n\t\t\tll sum_P = SUM-dp[i];\n\n\t\t\tfor(int k = 0; k < children[i].size(); k++){\n\n\t\t\t\tint child = children[i][k];\n\n\t\t\t\tif(lowest[child] < visited_order[i]){ //親と連結している子\n\n\t\t\t\t\tsum_P += dp[child];\n\t\t\t\t}else{\n\t\t\t\t\tans = max(ans,dp[child]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tans = max(ans,sum_P);\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":15984,"score_of_the_acc":-0.4304,"final_rank":4},{"submission_id":"aoj_3022_5693162","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100000\n\n\nint N,E;\nbool visited[SIZE],is_art_point[SIZE];\nint visited_order[SIZE],parent[SIZE],lowest[SIZE],number;\nll W[SIZE],dp[SIZE];\nvector<int> G[SIZE],children[SIZE];\n\n\nvoid dfs(int current_node,int pre_node){\n\tvisited_order[current_node] = lowest[current_node] = number; //訪問順を記録\n\tnumber++;\n\n\tvisited[current_node] = true;\n\tdp[current_node] = W[current_node];\n\n\tint next;\n\n\tfor(int i = 0; i < G[current_node].size(); i++){\n\t\tnext = G[current_node][i];\n\t\tif(!visited[next]){\n\t\t\tparent[next] = current_node;\n\t\t\tdfs(next,current_node);\n\n\t\t\tdp[current_node] += dp[next];\n\t\t\tchildren[current_node].push_back(next);\n\n\t\t\tlowest[current_node] = min(lowest[current_node],lowest[next]); //ボトムアップ的に、lowestが求まる\n\t\t}else if(visited[next] == true && next != pre_node){ //dfsTreeを遡る場合\n\t\t\tlowest[current_node] = min(lowest[current_node],visited_order[next]);\n\t\t}\n\t}\n}\n\nvoid art_points(){\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tvisited[i] = false;\n\t\tis_art_point[i] = false;\n\t\tdp[i] = 0;\n\t}\n\n\tnumber = 1;\n\tdfs(0,-1);\n\n\tint tmp_parent,root_num = 0;\n\n\tvector<int> V;\n\n\tfor(int i = 1; i < N; i++){\n\t\ttmp_parent = parent[i];\n\t\tif(tmp_parent == 0){\n\t\t\troot_num++;\n\t\t}else if(visited_order[tmp_parent] <= lowest[i]){\n\t\t\tV.push_back(tmp_parent);\n\t\t}\n\t}\n\tif(root_num >= 2){\n\t\tV.push_back(0);\n\t}\n\tsort(V.begin(),V.end());\n\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\tfor(int i = 0; i < V.size(); i++){\n\t\t//printf(\"%d\\n\",V[i]);\n\t\tis_art_point[V[i]] = true;\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&E);\n\n\tll sum = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld\",&W[i]);\n\t\tsum += W[i];\n\t}\n\n\tint from,to;\n\n\tfor(int i = 0; i < E; i++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tart_points();\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tif(!is_art_point[i]){\n\n\t\t\tprintf(\"%lld\\n\",sum-W[i]);\n\t\t\tcontinue;\n\t\t}\n\n\t\tll ans = 0;\n\n\t\tif(i == 0){\n\n\t\t\tfor(int k = 0; k < children[i].size(); k++){\n\n\t\t\t\tint child = children[i][k];\n\t\t\t\tans = max(ans,dp[child]);\n\t\t\t}\n\n\t\t}else{\n\n\t\t\tll sum_P = sum-dp[i];\n\n\t\t\tfor(int k = 0; k < children[i].size(); k++){\n\n\t\t\t\tint child = children[i][k];\n\t\t\t\tif(lowest[child] < visited_order[i]){ //親の成分と連結している子成分\n\n\t\t\t\t\tsum_P += dp[child];\n\t\t\t\t}else{\n\n\t\t\t\t\tans = max(ans,dp[child]);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tans = max(ans,sum_P);\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":15996,"score_of_the_acc":-0.4307,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_3022_10578791\",\n \"code_snippet\": \"#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/3022\\\"\\n\\n\\n#include <cassert>\\n#include <concepts>\\n#include <vector>\\n#include <optional>\\n\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n\\nnamespace zawa {\\n\\ntemplate <std::integral T>\\nclass BlockCutTree {\\npublic:\\n\\n BlockCutTree() = default;\\n\\n BlockCutTree(const std::vector<std::vector<T>>& g) : inv_(g.size()) {\\n const usize n = g.size();\\n std::vector<usize> low(n), ord(n), vs;\\n usize time = 1;\\n const T INVALID = static_cast<T>(-1);\\n auto dfs = [&](auto dfs, T v, T p) -> void {\\n low[v] = ord[v] = time++;\\n if (g[v].empty()) {\\n blocks_.push_back({T{v}});\\n return;\\n }\\n usize deg = 0;\\n bool cut = false;\\n for (T x : g[v]) {\\n if (ord[x]) {\\n low[v] = std::min(low[v], ord[x]);\\n }\\n else {\\n deg++;\\n dfs(dfs, x, v);\\n low[v] = std::min(low[v], low[x]);\\n if (low[x] >= ord[v]) {\\n std::vector<T> cur{v};\\n cut |= p != INVALID;\\n while (vs.size() and ord[vs.back()] >= ord[x]) {\\n cur.push_back(vs.back());\\n vs.pop_back();\\n }\\n blocks_.push_back(std::move(cur));\\n }\\n }\\n }\\n cut |= p == INVALID and deg >= 2;\\n if (cut) cuts_.push_back(v);\\n vs.push_back(v);\\n };\\n for (T i = 0 ; i < static_cast<T>(n) ; i++) if (!ord[i]) \\n dfs(dfs, i, INVALID);\\n const usize m = blocks_.size(), k = cuts_.size();\\n for (usize i = 0 ; i < k ; i++) inv_[cuts_[i]] = m + i;\\n g_.resize(m + k);\\n for (usize i = 0 ; i < m ; i++) {\\n for (T v : blocks_[i]) if (inv_[v] >= m) {\\n g_[i].push_back(inv_[v]);\\n g_[inv_[v]].push_back(i);\\n }\\n }\\n }\\n\\n inline usize size() const noexcept {\\n return g_.size();\\n }\\n\\n const std::vector<T>& operator[](usize i) const {\\n assert(i < size());\\n return g_[i];\\n }\\n\\n enum class Type {\\n BLOCK,\\n CUT\\n };\\n\\n Type type(usize i) const {\\n assert(i < size());\\n return i < blocks_.size() ? Type::BLOCK : Type::CUT;\\n }\\n\\n const std::vector<std::vector<T>>& blocks() const {\\n return blocks_;\\n }\\n\\n const std::vector<T>& block(usize i) const {\\n assert(i < size() and type(i) == Type::BLOCK);\\n return blocks_[i];\\n }\\n\\n const std::vector<T>& cuts() const {\\n return cuts_;\\n }\\n\\n const T cut(usize i) const {\\n assert(i < size() and type(i) == Type::CUT);\\n return cuts_[i - blocks_.size()];\\n }\\n\\n std::vector<T> vertices(usize i) const {\\n assert(i < size());\\n return i < blocks_.size() ? \\n blocks_[i] : std::vector<T>{cuts_[i - blocks_.size()]};\\n }\\n\\n bool isCut(T v) const {\\n assert(v < static_cast<T>(inv_.size()));\\n return inv_[v] >= blocks_.size();\\n }\\n\\n std::optional<usize> cutId(usize i) const {\\n assert(i < size());\\n return isCut(i) ? std::optional<usize>{inv_[i]} : std::nullopt;\\n }\\n\\nprivate:\\n\\n std::vector<std::vector<T>> blocks_;\\n\\n std::vector<T> cuts_;\\n\\n std::vector<std::vector<T>> g_;\\n\\n std::vector<usize> inv_;\\n};\\n\\n} // namespace zawa\\nusing namespace zawa;\\n\\n#include <iostream>\\n#include <numeric>\\n#include <unordered_set>\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int N, M;\\n std::cin >> N >> M;\\n std::vector<int> W(N);\\n for (auto& w : W) std::cin >> w;\\n std::vector<std::vector<int>> g(N);\\n for (int i = 0 ; i < M ; i++) {\\n int u, v;\\n std::cin >> u >> v;\\n u--; v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n BlockCutTree bct{g};\\n const long long sum = std::accumulate(W.begin(), W.end(), 0LL);\\n std::vector<long long> ans(N);\\n for (int i = 0 ; i < N ; i++) if (!bct.isCut(i)) \\n ans[i] = sum - W[i];\\n std::vector<bool> vis(bct.size());\\n auto rec = [&](auto rec, int v, int p) -> std::pair<std::unordered_set<int>, long long> {\\n vis[v] = true;\\n long long s = 0LL;\\n std::unordered_set<int> set;\\n const int pos = bct.type(v) == decltype(bct)::Type::CUT ? bct.cut(v) : -1;\\n for (int x : bct[v]) if (x != p) {\\n auto [st, k] = rec(rec, x, v);\\n if (pos != -1) ans[pos] = std::max(ans[pos], k - (st.contains(pos) ? W[pos] : 0));\\n if (set.size() < st.size()) {\\n std::swap(set, st);\\n std::swap(s, k);\\n }\\n for (int ch : st) if (!set.contains(ch)) {\\n s += W[ch];\\n set.insert(ch);\\n }\\n }\\n for (int cur : bct.vertices(v)) {\\n if (!set.contains(cur)) {\\n set.insert(cur);\\n s += W[cur];\\n }\\n }\\n if (pos != -1) ans[pos] = std::max(ans[pos], sum - s);\\n return {set, s};\\n };\\n for (int i = 0 ; i < std::ssize(bct) ; i++) if (!vis[i]) rec(rec, i, -1);\\n for (long long i : ans) std::cout << i << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 34320,\n \"score_of_the_acc\": -1.5905,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3022_10459581\",\n \"code_snippet\": \"#line 1 \\\"/home/y_midori/cp/test/test.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022\\\"\\n#line 2 \\\"template.hpp\\\"\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T>\\nconcept Streamable = requires(ostream os, T &x) { os << x; };\\ntemplate <class mint>\\nconcept is_modint = requires(mint &x) {\\n { x.val() } -> std::convertible_to<int>;\\n};\\n#ifdef LOCAL\\n#include <debug.hpp>\\n#else\\n#define debug(...)\\n#endif\\ntemplate <Streamable T> void print_one(const T &value) { cout << value; }\\ntemplate <is_modint T> void print_one(const T &value) { cout << value.val(); }\\nvoid print() { cout << '\\\\n'; }\\ntemplate <class T, class... Ts> void print(const T &a, const Ts &...b) {\\n print_one(a);\\n ((cout << ' ', print_one(b)), ...);\\n cout << '\\\\n';\\n}\\ntemplate <ranges::range Iterable>\\n requires(!Streamable<Iterable>)\\nvoid print(const Iterable &v) {\\n for(auto it = v.begin(); it != v.end(); ++it) {\\n if(it != v.begin())\\n cout << \\\" \\\";\\n print_one(*it);\\n }\\n cout << '\\\\n';\\n}\\nusing vi = vector<int>;\\nusing vii = vector<vector<int>>;\\nusing pii = pair<int, int>;\\nusing ll = long long;\\nusing vl = vector<ll>;\\nusing vll = vector<vl>;\\nusing pll = pair<ll, ll>;\\n#define all(v) begin(v), end(v)\\n#define UNIQUE(v) ranges::sort(v), v.erase(unique(all(v)), end(v))\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n return ((a < b) ? (a = b, true) : (false));\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n return ((a > b) ? (a = b, true) : (false));\\n}\\n// https://trap.jp/post/1224/\\ntemplate <class... T> constexpr auto min(T... a) {\\n return min(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate <class... T> constexpr auto max(T... a) {\\n return max(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate <class... T> void input(T &...a) { (cin >> ... >> a); }\\ntemplate <class T> void input(vector<T> &a) {\\n for(T &x : a)\\n cin >> x;\\n}\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n input(__VA_ARGS__)\\n#define LL(...) \\\\\\n long long __VA_ARGS__; \\\\\\n input(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n input(__VA_ARGS__)\\n#define REP1(a) for(ll i = 0; i < a; i++)\\n#define REP2(i, a) for(ll i = 0; i < a; i++)\\n#define REP3(i, a, b) for(ll i = a; i < b; i++)\\n#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\\n#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)\\nll inf = 3e18;\\nvl dx = {1, -1, 0, 0};\\nvl dy = {0, 0, 1, -1};\\ntemplate <class T> T floor(T x, T y) {\\n return x / y - ((x ^ y) < 0 and x % y);\\n}\\ntemplate <class T> T ceil(T x, T y) {\\n return y < 0 ? floor(-x + -y - 1, -y) : floor(x + y - 1, y);\\n}\\n// yの符号に関わらず非負で定義 \\\\bmod:texコマンド\\ntemplate <class T> T bmod(T x, T y) {\\n T m = x % y;\\n return (m < 0) ? m + (y > 0 ? y : -y) : m;\\n}\\n#line 3 \\\"graph/graph-template.hpp\\\"\\n/**\\n * @brief Graph Template(グラフテンプレート)\\n * @see https://ei1333.github.io/library/graph/graph-template.hpp\\n */\\ntemplate <class T = ll> struct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n Edge() = default;\\n Edge(int from, int to, T cost = 1, int idx = -1)\\n : from(from), to(to), cost(cost), idx(idx) {}\\n Edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <class T = ll> struct Graph {\\n using cost_type = T;\\n vector<vector<Edge<T>>> g;\\n int es; // edge_size\\n Graph() = default;\\n explicit Graph(int n) : g(n), es(0) {};\\n int size() const { return ssize(g); }\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n vector<Edge<T>> &operator[](const int &k) { return g[k]; }\\n const vector<Edge<T>> &operator[](const int &k) const { return g[k]; }\\n void read(int m, int padding = -1, bool weighted = false,\\n bool directed = false) {\\n for(int i = 0; i < m; ++i) {\\n int a, b;\\n T c(1);\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n if(weighted)\\n cin >> c;\\n if(directed)\\n add_directed_edge(a, b, c);\\n else\\n add_edge(a, b, c);\\n }\\n }\\n};\\n#line 4 \\\"graph/block-cut-tree.hpp\\\"\\n/**\\n * @brief ブロックカット木的な\\n * https://maspypy.github.io/library/graph/block_cut.hpp\\n * https://twitter.com/noshi91/status/1529858538650374144\\n * N頂点の無向グラフがC個の二重連結成分を持つとき(N+C)頂点の森を作る\\n * [0,N)のidxは元のグラフの頂点を表し[N,N+C)のidxは二重連結成分を表す\\n * 辺(u,N+v)は頂点uがv番目の二重連結成分に属することを表す\\n * 関節点<->次数2以上\\n */\\ntemplate <class G> Graph<bool> block_cut_tree(const G &g) {\\n int n = g.size();\\n Graph<bool> tree(n);\\n vector<int> low(n, -1), ord(n, -1);\\n int id = 0;\\n vector<int> tmp;\\n tree.g.reserve(2 * n);\\n tmp.reserve(n);\\n auto dfs = [&](auto &dfs, int cur, int p) -> void {\\n ord[cur] = low[cur] = id++;\\n tmp.emplace_back(cur);\\n int cnt = 0;\\n for(auto &to : g[cur]) {\\n if(to == p)\\n continue;\\n if(ord[to] == -1) {\\n int sz = ssize(tmp);\\n ++cnt;\\n dfs(dfs, to, cur);\\n chmin(low[cur], low[to]);\\n if((p == -1 and cnt > 1) or (p != -1 and low[to] >= ord[cur])) {\\n int k = tree.size();\\n tree.g.emplace_back();\\n tree.add_edge(cur, k);\\n while(ssize(tmp) > sz) {\\n tree.add_edge(tmp.back(), k);\\n tmp.pop_back();\\n }\\n }\\n } else {\\n chmin(low[cur], ord[to]);\\n }\\n }\\n if(p == -1) {\\n int k = tree.size();\\n tree.g.emplace_back();\\n for(auto &i : tmp)\\n tree.add_edge(i, k);\\n tmp.clear();\\n }\\n };\\n for(int i = 0; i < n; ++i) {\\n if(ord[i] == -1)\\n dfs(dfs, i, -1);\\n }\\n return tree;\\n}\\n#line 5 \\\"/home/y_midori/cp/test/test.test.cpp\\\"\\nvoid solve() {\\n INT(n, m);\\n vector<ll> v(n);\\n input(v);\\n Graph<bool> g(n);\\n g.read(m);\\n auto bct = block_cut_tree(g);\\n int N = bct.size();\\n vector<ll> sub = v;\\n sub.resize(N, 0);\\n vector<int> par(N, -1);\\n auto dfs = [&](auto &dfs, int cur, int p) -> ll {\\n par[cur] = p;\\n for(auto &to : bct[cur]) {\\n if(to != p) {\\n sub[cur] += dfs(dfs, to, cur);\\n }\\n }\\n return sub[cur];\\n };\\n ll sum = dfs(dfs, 0, -1);\\n for(int i = 0; i < n; ++i) {\\n ll ans = 0;\\n ll tmp = 0;\\n for(auto &to : bct[i]) {\\n if(to != par[i]) {\\n chmax(ans, sub[to]);\\n tmp += sub[to];\\n }\\n }\\n if(par[i] != -1) {\\n chmax(ans, sum - tmp - v[i]);\\n }\\n print(ans);\\n }\\n}\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 28500,\n \"score_of_the_acc\": -0.628,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3022_10340579\",\n \"code_snippet\": \"// AOJ #3022 Cluster Network\\n// 2025.4.1\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0, c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(ll n) {\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tif (n < 0) pc('-'), n = -n;\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n\\tpc('\\\\n');\\n}\\n\\nint n, m, t;\\nvector<int> d, low;\\nvector<ll> dp, ans, w;\\nvector<bool> art;\\nvector<ll> sepSum, sepMax;\\nvector<vector<int>> g;\\n\\nvoid dfs(int u, int par) {\\n d[u] = low[u] = ++t;\\n dp[u] = w[u];\\n int cnt = 0;\\n for (int v : g[u]) {\\n if (v == par) continue;\\n if (!d[v]) {\\n cnt++;\\n dfs(v, u);\\n dp[u] += dp[v];\\n low[u] = min(low[u], low[v]);\\n if (low[v] >= d[u]) {\\n art[u] = true;\\n sepSum[u] += dp[v];\\n sepMax[u] = max(sepMax[u], dp[v]);\\n }\\n } else low[u] = min(low[u], d[v]);\\n }\\n if (par == -1 && cnt < 2) art[u] = false;\\n}\\n\\nint main(){\\n n = Cin(), m = Cin();\\n w.resize(n+1);\\n dp.assign(n+1, 0);\\n ans.assign(n+1, 0);\\n d.assign(n+1, 0);\\n low.assign(n+1, 0);\\n art.assign(n+1, false);\\n sepSum.assign(n+1, 0);\\n sepMax.assign(n+1, 0);\\n g.assign(n+1, vector<int>());\\n\\n for (int i = 1; i <= n; i++) w[i] = Cin();\\n for (int i = 0; i < m; i++){\\n int u = Cin(), v = Cin();\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n\\n dfs(1, -1);\\n\\n ll S = 0;\\n for (int i = 1; i <= n; i++) S += w[i];\\n\\n for (int u = 1; u <= n; u++){\\n if (!art[u]) ans[u] = S - w[u];\\n else if (d[u] == 1) ans[u] = sepMax[u];\\n else ans[u] = max(S - w[u] - sepSum[u], sepMax[u]);\\n }\\n\\n for (int i = 1; i <= n; i++) Cout(ans[i]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 13808,\n \"score_of_the_acc\": -0.0618,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3022_10069875\",\n \"code_snippet\": \"//\\n// Low-Link を用いた橋列挙と、二重辺連結成分分解・二重頂点連結成分分解\\n//\\n// cf.\\n// hos: グラフ探索アルゴリズムとその応用\\n// http://hos.ac/slides/20110504_graph.pdf\\n//\\n// verified:\\n// Yosupo Library Checker - Two-Edge-Connected Components\\n// https://judge.yosupo.jp/problem/two_edge_connected_components\\n//\\n// Yosupo Library Checker - Biconnected Components\\n// https://judge.yosupo.jp/problem/biconnected_components\\n//\\n// ARC 039 D - 旅行会社高橋君（for 二重辺連結成分分解）\\n// https://arc039.contest.atcoder.jp/tasks/arc039_d\\n//\\n// TTPC 2024 DIV1 A - Don't Detect Cycle（for 橋列挙）\\n// https://atcoder.jp/contests/ttpc2024_1/tasks/ttpc2024_1_a\\n//\\n// ARC 045 D - みんな仲良し高橋君（for 二重頂点連結成分分解した Block-Cut 木上の DP）\\n// https://atcoder.jp/contests/arc045/tasks/arc045_d\\n//\\n// AOJ 3022 Problem J: Cluster Network\\n// https://onlinejudge.u-aizu.ac.jp/problems/3022\\n//\\n\\n\\n/*\\n アイディア: DFS をしたとき、DFS 後退辺は橋とはなりえない\\n \\n ・ord[v] := 頂点を訪れた順番\\n ・low[v] := v から「DFS 木の根から葉へ進む」or「後退辺を葉から根へ進む」ことによって辿り着ける頂点の ord の最小値\\n \\n DFS で u -> ... -> v と来て、v から u への後退辺があると、このサイクルの low がすべて ord[u] (以下) になる感じ\\n このことから、\\n \\n DFS-search で、辺 v - ch を v -> ch の順に探索したときに、\\n 辺 v-to が橋 ⇔ ord[v] < low[ch]\\n */\\n\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n// Edge Class\\ntemplate<class T> struct Edge {\\n int from, to;\\n T val;\\n Edge() : from(-1), to(-1), val(-1) { }\\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\\n friend ostream& operator << (ostream& s, const Edge& e) {\\n return s << e.from << \\\"->\\\" << e.to;\\n }\\n};\\n\\n// graph class\\ntemplate<class T> struct Graph {\\n vector<vector<Edge<T>>> list;\\n \\n Graph() { }\\n Graph(int n) : list(n) { }\\n Graph(const Graph<T> &G) : list(G.list) { }\\n void init(int n) {\\n list.assign(n, vector<Edge<T>>());\\n }\\n Graph &operator = (const Graph &g) {\\n list = g.list;\\n return *this;\\n }\\n\\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\\n const size_t size() const { return list.size(); }\\n const void clear() {\\n list.clear();\\n }\\n const void resize(int n) {\\n list.resize(n);\\n }\\n\\n void add_edge(int from, int to, T val = -1) {\\n list[from].push_back(Edge(from, to, val));\\n list[to].push_back(Edge(to, from, val));\\n }\\n\\n friend ostream &operator << (ostream &s, const Graph &G) {\\n s << endl;\\n for (int i = 0; i < G.size(); ++i) {\\n s << i << \\\" -> \\\";\\n for (const auto &e : G[i]) s << e.to << \\\" \\\";\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\n// low-link\\ntemplate<class T> struct LowLink {\\n // results\\n vector<int> ord, low;\\n vector<int> aps; // articulation points\\n vector<Edge<T>> brs; // brideges\\n\\n // constructor\\n LowLink() { }\\n LowLink(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // solver\\n int dfs(const Graph<T> &G, int t, int v, int p) {\\n ord[v] = low[v] = t++;\\n int num_of_children = 0;\\n bool exist_articulation = false, is_multiple_edge = false;\\n for (const auto &e : G[v]) {\\n if (ord[e.to] == -1) {\\n num_of_children++;\\n t = dfs(G, t, e.to, v);\\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\\n if (ord[v] < low[e.to]) brs.push_back(e);\\n } else if (e.to != p || is_multiple_edge) {\\n low[v] = min(low[v], ord[e.to]); // back edge\\n } else {\\n is_multiple_edge = true;\\n }\\n }\\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\\n aps.emplace_back(v);\\n }\\n return t;\\n }\\n\\n void solve(const Graph<T> &G) {\\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\\n if (ord[v] == -1) k = dfs(G, k, v, -1);\\n }\\n }\\n};\\n\\n// Two-Edge-Connected Components decomposition\\ntemplate<class T> struct TwoEdgeConnectedComponentsDecomposition {\\n // results\\n LowLink<T> ll;\\n vector<int> cmp;\\n vector<vector<int>> groups, tree;\\n\\n // constructor\\n TwoEdgeConnectedComponentsDecomposition() { }\\n TwoEdgeConnectedComponentsDecomposition(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // solver\\n int dfs(const Graph<T> &G, int t, int v, int p) {\\n if (p >= 0 && ll.ord[p] >= ll.low[v]) cmp[v] = cmp[p];\\n else cmp[v] = t++;\\n for (const auto &e : G[v]) {\\n if (cmp[e.to] == -1) t = dfs(G, t, e.to, v);\\n }\\n return t;\\n }\\n\\n void solve(const Graph<T> &G) {\\n ll.init(G);\\n cmp.assign(G.size(), -1);\\n int t = 0;\\n for (int v = 0; v < (int)G.size(); v++) {\\n if (cmp[v] == -1) t = dfs(G, t, v, -1);\\n }\\n groups.resize(t);\\n tree.resize(t);\\n for (int v = 0; v < (int)G.size(); v++) {\\n groups[cmp[v]].push_back(v);\\n }\\n for (const auto &e : ll.brs) {\\n int u = cmp[e.from], v = cmp[e.to];\\n tree[u].push_back(v);\\n tree[v].push_back(u);\\n }\\n }\\n};\\n\\n// BiConnected Components decomposition\\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\\n// (A: size of aps, C: num of components)\\ntemplate<class T> struct BiConnectedComponentsDecomposition {\\n // result\\n LowLink<T> ll;\\n vector<int> id_ap; // index of the articulation point (size: V)\\n vector<int> id_cc; // index of the connected component (size: V)\\n vector<vector<int>> groups; // biconnected components (size: C)\\n vector<vector<int>> tree; // block-cut tree (size: A + C)\\n\\n // intermediate results\\n vector<int> seen, finished;\\n vector<vector<pair<int, int>>> grouped_edges;\\n vector<pair<int, int>> tmp_edges;\\n\\n // constructor\\n BiConnectedComponentsDecomposition() { }\\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // getter, original graph to block-cut tree (v: node of orignal graph)\\n int is_ap_original_graph(int v) const {\\n return (id_ap[v] != -1);\\n }\\n int get_id(int v) const {\\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\\n }\\n\\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\\n int is_ap(int v) const {\\n return (v < ll.aps.size());\\n }\\n int get_ap(int v) const {\\n if (v >= (int)ll.aps.size()) return -1; // not ap\\n else return ll.aps[v];\\n }\\n int get_size(int v) const { // including aps\\n if (v < (int)ll.aps.size()) return 1; // ap\\n else return groups[v - ll.aps.size()].size();\\n }\\n vector<int> get_group(int v) const {\\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\\n else return groups[v - ll.aps.size()];\\n }\\n\\n // solver\\n void dfs(const Graph<T> &G, int v, int p) {\\n seen[v] = true;\\n if (G[v].empty()) {\\n groups.emplace_back(vector<int>({v}));\\n }\\n for (const auto &e : G[v]) {\\n if (e.to == p) continue;\\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\\n tmp_edges.emplace_back(minmax(v, e.to));\\n }\\n if (!seen[e.to]) {\\n dfs(G, e.to, v);\\n if (ll.low[e.to] >= ll.ord[v]) {\\n groups.emplace_back(vector<int>({v}));\\n grouped_edges.emplace_back();\\n int ap = v;\\n while (!tmp_edges.empty()) {\\n const auto &e2 = tmp_edges.back();\\n if (!finished[e2.first] && e2.first != ap) {\\n groups.back().emplace_back(e2.first);\\n finished[e2.first] = true;\\n }\\n if (!finished[e2.second] && e2.second != ap) {\\n groups.back().emplace_back(e2.second);\\n finished[e2.second] = true;\\n }\\n grouped_edges.back().emplace_back(e2);\\n tmp_edges.pop_back();\\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\\n }\\n }\\n }\\n }\\n }\\n\\n void solve(const Graph<T> &G) {\\n ll.init(G);\\n seen.assign(G.size(), false), finished.assign(G.size(), false);\\n for (int v = 0; v < (int)G.size(); v++) {\\n if (!seen[v]) dfs(G, v, -1);\\n }\\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\\n for (int i = 0; i < (int)ll.aps.size(); i++) {\\n id_ap[ll.aps[i]] = i;\\n }\\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\\n vector<int> last(G.size(), -1);\\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\\n vector<int> st;\\n for (auto [u, v] : grouped_edges[i]) {\\n st.push_back(u), st.push_back(v);\\n }\\n for (auto v : st) {\\n if (id_ap[v] == -1) {\\n id_cc[v] = i + ll.aps.size();\\n } else if (last[v] != i) {\\n tree[i + ll.aps.size()].push_back(id_ap[v]);\\n tree[id_ap[v]].push_back(i + ll.aps.size());\\n last[v] = i;\\n }\\n }\\n }\\n }\\n};\\n\\n\\n\\n//------------------------------//\\n// Examples\\n//------------------------------//\\n\\n// Yosupo Library Checker - Two-Edge-Connected Components\\nvoid YosupoLibraryCheckerTwoEdgeConnectedComponents() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n int N, M, a, b;\\n cin >> N >> M;\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> a >> b;\\n G.add_edge(a, b, i);\\n }\\n TwoEdgeConnectedComponentsDecomposition<int> tecc(G);\\n\\n cout << tecc.groups.size() << '\\\\n';\\n for (const auto &group : tecc.groups) {\\n cout << group.size();\\n for (auto v : group) cout << \\\" \\\" << v;\\n cout << '\\\\n';\\n }\\n}\\n\\n// Yosupo Library Checker - BiConnected Components\\nvoid YosupoLibraryCheckerBiConnectedComponents() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n int N, M, a, b;\\n cin >> N >> M;\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> a >> b;\\n G.add_edge(a, b, i);\\n }\\n BiConnectedComponentsDecomposition<int> bcc(G);\\n\\n cout << bcc.groups.size() << '\\\\n';\\n for (const auto &group : bcc.groups) {\\n cout << group.size();\\n for (auto v : group) cout << \\\" \\\" << v;\\n cout << '\\\\n';\\n }\\n}\\n\\n// ARC 039 D - 旅行会社高橋君\\nvoid ARC_039_D() {\\n int V, E, s, t;\\n cin >> V >> E;\\n Graph<int> original_graph(V);\\n for (int i = 0; i < E; ++i) {\\n cin >> s >> t, s--, t--;\\n original_graph.add_edge(s, t, 1);\\n }\\n TwoEdgeConnectedComponentsDecomposition<int> tecc(original_graph);\\n\\n // LCA\\n auto tree = tecc.tree;\\n int h = 1;\\n while ((1<<h) < V) ++h;\\n vector<vector<int>> parent(h, vector<int>(V, -1));\\n vector<int> depth(V, -1);\\n\\n auto dfs = [&](auto dfs, int v, int p, int d) -> void {\\n parent[0][v] = p;\\n depth[v] = d;\\n for (auto to : tree[v]) if (to != p) dfs(dfs, to, v, d+1);\\n };\\n\\n dfs(dfs, 0, -1, 0);\\n for (int i = 0; i+1 < (int)parent.size(); ++i)\\n for (int v = 0; v < V; ++v)\\n if (parent[i][v] != -1)\\n parent[i+1][v] = parent[i][parent[i][v]];\\n\\n auto get = [&](int u, int v) -> int {\\n if (depth[u] > depth[v]) swap(u, v);\\n for (int i = 0; i < (int)parent.size(); ++i)\\n if ( (depth[v] - depth[u]) & (1<<i) )\\n v = parent[i][v];\\n if (u == v) return u;\\n for (int i = (int)parent.size()-1; i >= 0; --i) {\\n if (parent[i][u] != parent[i][v]) {\\n u = parent[i][u];\\n v = parent[i][v];\\n }\\n }\\n return parent[0][u];\\n };\\n\\n auto dist = [&](int u, int v) -> int {\\n int lca = get(u, v);\\n return abs(depth[u] - depth[lca]) + abs(depth[v] - depth[lca]);\\n };\\n \\n // queries\\n int Q, a, b, c;\\n cin >> Q;\\n for (int _ = 0; _ < Q; ++_) {\\n cin >> a >> b >> c, a--, b--, c--;\\n a = tecc.cmp[a], b = tecc.cmp[b], c = tecc.cmp[c];\\n int ab = dist(a, b);\\n int bc = dist(b, c);\\n int ac = dist(a, c);\\n if (ab + bc == ac) puts(\\\"OK\\\");\\n else puts(\\\"NG\\\");\\n }\\n}\\n\\n// TTPC 2024 DIV1 A - Don't Detect Cycle\\nvoid TTPC_2024_DIV1_A() {\\n int T;\\n cin >> T;\\n\\n while (T--) {\\n int N, M, u, v;\\n cin >> N >> M;\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> u >> v, u--, v--;\\n G.add_edge(u, v, i);\\n }\\n\\n vector<int> res, former, latter;\\n while (true) {\\n set<pair<int,int>> ers;\\n\\n // erase bridges\\n LowLink<int> ll(G);\\n for (auto e : ll.brs) {\\n former.push_back(e.val);\\n ers.insert(minmax(e.from, e.to));\\n }\\n\\n // erase edges whose endpoints with 2 degree\\n vector<int> deg(N, 0);\\n for (int v = 0; v < N; v++) {\\n for (auto e : G[v]) {\\n if (ers.count(minmax(e.from, e.to))) continue;\\n deg[v]++;\\n }\\n }\\n for (int v = 0; v < N; v++) {\\n for (auto e : G[v]) {\\n if (e.from > e.to) continue;\\n if (ers.count(minmax(e.from, e.to))) continue;\\n if (deg[e.from] == 2 && deg[e.to] == 2) {\\n latter.push_back(e.val);\\n ers.insert(minmax(e.from, e.to));\\n }\\n }\\n }\\n\\n if (ers.empty()) break;\\n\\n // build new graph\\n Graph<int> G2(N);\\n for (int v = 0; v < N; v++) {\\n for (auto e : G[v]) {\\n if (e.from > e.to) continue;\\n if (ers.count(minmax(e.from, e.to))) continue;\\n G2.add_edge(e.from, e.to, e.val);\\n }\\n }\\n G = G2;\\n }\\n\\n reverse(latter.begin(), latter.end());\\n for (auto v : former) res.push_back(v);\\n for (auto v : latter) res.push_back(v);\\n if (res.size() < M) {\\n cout << -1 << endl;\\n } else {\\n for (auto id : res) cout << id+1 << \\\" \\\";\\n cout << endl;\\n }\\n }\\n}\\n\\n\\n// Union-Find\\nstruct UnionFind {\\n // core member\\n vector<int> par, nex;\\n\\n // constructor\\n UnionFind() { }\\n UnionFind(int N) : par(N, -1), nex(N) {\\n init(N);\\n }\\n void init(int N) {\\n par.assign(N, -1);\\n nex.resize(N);\\n for (int i = 0; i < N; ++i) nex[i] = i;\\n }\\n \\n // core methods\\n int root(int x) {\\n if (par[x] < 0) return x;\\n else return par[x] = root(par[x]);\\n }\\n \\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n \\n bool merge(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y); // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n swap(nex[x], nex[y]);\\n return true;\\n }\\n \\n int size(int x) {\\n return -par[root(x)];\\n }\\n \\n // get group\\n vector<int> group(int x) {\\n vector<int> res({x});\\n while (nex[res.back()] != x) res.push_back(nex[res.back()]);\\n return res;\\n }\\n vector<vector<int>> groups() {\\n vector<vector<int>> member(par.size());\\n for (int v = 0; v < (int)par.size(); ++v) {\\n member[root(v)].push_back(v);\\n }\\n vector<vector<int>> res;\\n for (int v = 0; v < (int)par.size(); ++v) {\\n if (!member[v].empty()) res.push_back(member[v]);\\n }\\n return res;\\n }\\n \\n // debug\\n friend ostream& operator << (ostream &s, UnionFind uf) {\\n const vector<vector<int>> &gs = uf.groups();\\n for (const vector<int> &g : gs) {\\n s << \\\"group: \\\";\\n for (int v : g) s << v << \\\" \\\";\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\nvoid ARC_045_D() {\\n // 入力\\n int N;\\n cin >> N;\\n vector<int> X(N*2+1), Y(N*2+1);\\n for (int i = 0; i < N*2+1; i++) cin >> X[i] >> Y[i];\\n\\n // 横方向\\n using pint = pair<int,int>;\\n vector<vector<pint>> xy(N*2+2), yx(N*2+2);\\n for (int i = 0; i < N*2+1; i++) {\\n xy[X[i]].emplace_back(Y[i], i);\\n yx[Y[i]].emplace_back(X[i], i);\\n }\\n for (int v = 0; v <= N*2+1; v++) {\\n sort(xy[v].begin(), xy[v].end());\\n sort(yx[v].begin(), yx[v].end());\\n }\\n\\n // グラフを作る（横・縦に「隣接」「1個飛ばし」のみ辺を張る）\\n Graph<int> G(N*2+1);\\n for (int v = 0; v <= N*2+1; v++) {\\n for (int i = 0; i < xy[v].size(); i++) {\\n if (i+1 < xy[v].size()) G.add_edge(xy[v][i].second, xy[v][i+1].second);\\n if (i+2 < xy[v].size()) G.add_edge(xy[v][i].second, xy[v][i+2].second);\\n }\\n for (int i = 0; i < yx[v].size(); i++) {\\n if (i+1 < yx[v].size()) G.add_edge(yx[v][i].second, yx[v][i+1].second);\\n if (i+2 < yx[v].size()) G.add_edge(yx[v][i].second, yx[v][i+2].second);\\n }\\n }\\n\\n // Block-Cut 木の構築\\n BiConnectedComponentsDecomposition<int> bcc(G);\\n\\n // グラフ G の各連結成分のサイズを求めて、間接点以外の点の答えを求める\\n UnionFind uf(N*2+1);\\n for (int v = 0; v < N*2+1; v++) for (auto e : G[v]) uf.merge(e.from, e.to);\\n int odd_num = 0;\\n for (int v = 0; v < N*2+1; v++) if (uf.root(v) == v && uf.size(v) % 2 == 1) odd_num++;\\n if (odd_num > 1) {\\n // 奇数サイズの連結成分が複数個ある場合はすべて NG（以降、奇数サイズの連結成分は 1 個とする)\\n for (int v = 0; v < N*2+1; v++) cout << \\\"NG\\\" << endl;\\n return;\\n }\\n vector<bool> res(N*2+1, false);\\n for (int v = 0; v < N*2+1; v++) {\\n // 奇数サイズかつ間接点以外は true (間接点の結果はあとで上書きする)\\n if (uf.size(v) % 2 == 1) {\\n res[v] = true;\\n }\\n }\\n\\n // Block-Cut 木上の探索により、間接点の答えを求める\\n auto tree = bcc.tree;\\n vector<bool> seen(tree.size(), false);\\n auto dfs = [&](auto dfs, int v, int p) -> int {\\n seen[v] = true;\\n\\n // 奇数サイズの連結成分を二重頂点連結成分分解してできる Block-Cut 木を\\n // 根付き木として探索したとき、各間接点について、\\n // ある子頂点が存在して、それを根とする部分木のサイズが奇数ならば、\\\"NG\\\"\\n int siz = bcc.get_size(v), odd_num = 0;\\n for (auto ch : tree[v]) {\\n if (ch == p) continue;\\n int tmp = dfs(dfs, ch, v) - 1;\\n if (tmp % 2 == 1) odd_num++;\\n siz += tmp;\\n }\\n if (bcc.is_ap(v)) {\\n int apv = bcc.get_ap(v); // Block-cut 木の頂点 v に対応するもとのグラフの頂点\\n if (uf.size(apv) % 2 == 1 && odd_num > 0) {\\n res[apv] = false;\\n }\\n }\\n return siz;\\n };\\n for (int v = 0; v < tree.size(); v++) {\\n if (seen[v]) continue;\\n dfs(dfs, v, -1);\\n } \\n\\n // 出力\\n for (int v = 0; v < res.size(); v++) {\\n if (res[v]) cout << \\\"OK\\\" << endl;\\n else cout << \\\"NG\\\" << endl;\\n }\\n}\\n\\n// AOJ 3022 - Cluster Network\\nvoid AOJ_3022() {\\n long long N, M, u, v, all = 0;\\n cin >> N >> M;\\n vector<long long> w(N), res(N, 0);\\n for (int i = 0; i < N; i++) cin >> w[i], all += w[i];\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> u >> v, u--, v--;\\n G.add_edge(u, v), G.add_edge(v, u);\\n }\\n\\n // Block-Cut 木上を形成\\n BiConnectedComponentsDecomposition<int> bcc(G);\\n\\n // 関節点以外について求める\\n for (int ov = 0; ov < N; ov++) {\\n if (!bcc.is_ap_original_graph(ov)) res[ov] = all - w[ov];\\n }\\n\\n // 関節点について求める：Block-Cut 木上の DP\\n auto tree = bcc.tree;\\n vector<long long> sum(tree.size(), 0);\\n for (int v = 0; v < tree.size(); v++) {\\n const auto &group = bcc.get_group(v);\\n for (auto ov : group) sum[v] += w[ov];\\n }\\n auto rec = [&](auto rec, int v, int p) -> long long {\\n const auto &group = bcc.get_group(v);\\n long long ma = 0, all_weight = sum[v];\\n for (auto ch : tree[v]) {\\n if (ch == p) continue;\\n long long sub = rec(rec, ch, v);\\n if (bcc.is_ap(v)) sub -= sum[v];\\n else sub -= sum[ch];\\n ma = max(ma, sub), all_weight += sub;\\n }\\n\\n // 関節点について処理する\\n if (bcc.is_ap(v)) {\\n int ov = bcc.get_ap(v);\\n long long rem = all - all_weight;\\n ma = max(ma, rem);\\n res[ov] = ma;\\n }\\n return all_weight;\\n };\\n rec(rec, 0, -1);\\n\\n for (auto val : res) cout << val << endl;\\n}\\n\\nint main() {\\n //YosupoLibraryCheckerTwoEdgeConnectedComponents();\\n //YosupoLibraryCheckerBiConnectedComponents();\\n //ARC_039_D();\\n //TTPC_2024_DIV1_A();\\n //ARC_045_D();\\n AOJ_3022();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 45696,\n \"score_of_the_acc\": -1.5711,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3022_10069868\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// Edge Class\\ntemplate<class T> struct Edge {\\n int from, to;\\n T val;\\n Edge() : from(-1), to(-1), val(-1) { }\\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\\n friend ostream& operator << (ostream& s, const Edge& e) {\\n return s << e.from << \\\"->\\\" << e.to;\\n }\\n};\\n\\n// graph class\\ntemplate<class T> struct Graph {\\n vector<vector<Edge<T>>> list;\\n \\n Graph() { }\\n Graph(int n) : list(n) { }\\n Graph(const Graph<T> &G) : list(G.list) { }\\n void init(int n) {\\n list.assign(n, vector<Edge<T>>());\\n }\\n Graph &operator = (const Graph &g) {\\n list = g.list;\\n return *this;\\n }\\n\\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\\n const size_t size() const { return list.size(); }\\n const void clear() {\\n list.clear();\\n }\\n const void resize(int n) {\\n list.resize(n);\\n }\\n\\n void add_edge(int from, int to, T val = -1) {\\n list[from].push_back(Edge(from, to, val));\\n list[to].push_back(Edge(to, from, val));\\n }\\n\\n friend ostream &operator << (ostream &s, const Graph &G) {\\n s << endl;\\n for (int i = 0; i < G.size(); ++i) {\\n s << i << \\\" -> \\\";\\n for (const auto &e : G[i]) s << e.to << \\\" \\\";\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\n// low-link\\ntemplate<class T> struct LowLink {\\n // results\\n vector<int> ord, low;\\n vector<int> aps; // articulation points\\n vector<Edge<T>> brs; // brideges\\n\\n // constructor\\n LowLink() { }\\n LowLink(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // solver\\n int dfs(const Graph<T> &G, int t, int v, int p) {\\n ord[v] = low[v] = t++;\\n int num_of_children = 0;\\n bool exist_articulation = false, is_multiple_edge = false;\\n for (const auto &e : G[v]) {\\n if (ord[e.to] == -1) {\\n num_of_children++;\\n t = dfs(G, t, e.to, v);\\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\\n if (ord[v] < low[e.to]) brs.push_back(e);\\n } else if (e.to != p || is_multiple_edge) {\\n low[v] = min(low[v], ord[e.to]); // back edge\\n } else {\\n is_multiple_edge = true;\\n }\\n }\\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\\n aps.emplace_back(v);\\n }\\n return t;\\n }\\n\\n void solve(const Graph<T> &G) {\\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\\n if (ord[v] == -1) k = dfs(G, k, v, -1);\\n }\\n }\\n};\\n\\n// BiConnected Components decomposition\\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\\n// (A: size of aps, C: num of components)\\ntemplate<class T> struct BiConnectedComponentsDecomposition {\\n // result\\n LowLink<T> ll;\\n vector<int> id_ap; // index of the articulation point (size: V)\\n vector<int> id_cc; // index of the connected component (size: V)\\n vector<vector<int>> groups; // biconnected components (size: C)\\n vector<vector<int>> tree; // block-cut tree (size: A + C)\\n\\n // intermediate results\\n vector<int> seen, finished;\\n vector<vector<pair<int, int>>> grouped_edges;\\n vector<pair<int, int>> tmp_edges;\\n\\n // constructor\\n BiConnectedComponentsDecomposition() { }\\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // getter, original graph to block-cut tree (v: node of orignal graph)\\n int is_ap_original_graph(int v) const {\\n return (id_ap[v] != -1);\\n }\\n int get_id(int v) const {\\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\\n }\\n\\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\\n int is_ap(int v) const {\\n return (v < ll.aps.size());\\n }\\n int get_ap(int v) const {\\n if (v >= (int)ll.aps.size()) return -1; // not ap\\n else return ll.aps[v];\\n }\\n int get_size(int v) const { // including aps\\n if (v < (int)ll.aps.size()) return 1; // ap\\n else return groups[v - ll.aps.size()].size();\\n }\\n vector<int> get_group(int v) const {\\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\\n else return groups[v - ll.aps.size()];\\n }\\n\\n // solver\\n void dfs(const Graph<T> &G, int v, int p) {\\n seen[v] = true;\\n if (G[v].empty()) {\\n groups.emplace_back(vector<int>({v}));\\n }\\n for (const auto &e : G[v]) {\\n if (e.to == p) continue;\\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\\n tmp_edges.emplace_back(minmax(v, e.to));\\n }\\n if (!seen[e.to]) {\\n dfs(G, e.to, v);\\n if (ll.low[e.to] >= ll.ord[v]) {\\n groups.emplace_back(vector<int>({v}));\\n grouped_edges.emplace_back();\\n int ap = v;\\n while (!tmp_edges.empty()) {\\n const auto &e2 = tmp_edges.back();\\n if (!finished[e2.first] && e2.first != ap) {\\n groups.back().emplace_back(e2.first);\\n finished[e2.first] = true;\\n }\\n if (!finished[e2.second] && e2.second != ap) {\\n groups.back().emplace_back(e2.second);\\n finished[e2.second] = true;\\n }\\n grouped_edges.back().emplace_back(e2);\\n tmp_edges.pop_back();\\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\\n }\\n }\\n }\\n }\\n }\\n\\n void solve(const Graph<T> &G) {\\n ll.init(G);\\n seen.assign(G.size(), false), finished.assign(G.size(), false);\\n for (int v = 0; v < (int)G.size(); v++) {\\n if (!seen[v]) dfs(G, v, -1);\\n }\\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\\n for (int i = 0; i < (int)ll.aps.size(); i++) {\\n id_ap[ll.aps[i]] = i;\\n }\\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\\n vector<int> last(G.size(), -1);\\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\\n vector<int> st;\\n for (auto [u, v] : grouped_edges[i]) {\\n st.push_back(u), st.push_back(v);\\n }\\n for (auto v : st) {\\n if (id_ap[v] == -1) {\\n id_cc[v] = i + ll.aps.size();\\n } else if (last[v] != i) {\\n tree[i + ll.aps.size()].push_back(id_ap[v]);\\n tree[id_ap[v]].push_back(i + ll.aps.size());\\n last[v] = i;\\n }\\n }\\n }\\n }\\n};\\n\\n\\nvoid AOJ_3022() {\\n long long N, M, u, v, all = 0;\\n cin >> N >> M;\\n vector<long long> w(N), res(N, 0);\\n for (int i = 0; i < N; i++) cin >> w[i], all += w[i];\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> u >> v, u--, v--;\\n G.add_edge(u, v), G.add_edge(v, u);\\n }\\n\\n // Block-Cut 木上を形成\\n BiConnectedComponentsDecomposition<int> bcc(G);\\n\\n // 関節点以外について求める\\n for (int ov = 0; ov < N; ov++) {\\n if (!bcc.is_ap_original_graph(ov)) res[ov] = all - w[ov];\\n }\\n\\n // 関節点について求める：Block-Cut 木上の DP\\n auto tree = bcc.tree;\\n vector<long long> sum(tree.size(), 0);\\n for (int v = 0; v < tree.size(); v++) {\\n const auto &group = bcc.get_group(v);\\n for (auto ov : group) sum[v] += w[ov];\\n }\\n auto rec = [&](auto rec, int v, int p) -> long long {\\n const auto &group = bcc.get_group(v);\\n long long ma = 0, all_weight = sum[v];\\n for (auto ch : tree[v]) {\\n if (ch == p) continue;\\n long long sub = rec(rec, ch, v);\\n if (bcc.is_ap(v)) sub -= sum[v];\\n else sub -= sum[ch];\\n ma = max(ma, sub), all_weight += sub;\\n }\\n\\n // 関節点について処理する\\n if (bcc.is_ap(v)) {\\n int ov = bcc.get_ap(v);\\n long long rem = all - all_weight;\\n ma = max(ma, rem);\\n res[ov] = ma;\\n }\\n return all_weight;\\n };\\n rec(rec, 0, -1);\\n\\n for (auto val : res) cout << val << endl;\\n}\\n\\n\\nint main() {\\n AOJ_3022();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 45568,\n \"score_of_the_acc\": -1.5678,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3022_10069864\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n#define DEBUG 1\\n#define COUT(x) if (DEBUG) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, deque<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for (auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, multiset<T> P)\\n{ for (auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for (auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s; }\\n\\n\\n\\n\\n// Union-Find\\nstruct UnionFind {\\n // core member\\n vector<int> par, nex;\\n\\n // constructor\\n UnionFind() { }\\n UnionFind(int N) : par(N, -1), nex(N) {\\n init(N);\\n }\\n void init(int N) {\\n par.assign(N, -1);\\n nex.resize(N);\\n for (int i = 0; i < N; ++i) nex[i] = i;\\n }\\n \\n // core methods\\n int root(int x) {\\n if (par[x] < 0) return x;\\n else return par[x] = root(par[x]);\\n }\\n \\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n \\n bool merge(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y); // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n swap(nex[x], nex[y]);\\n return true;\\n }\\n \\n int size(int x) {\\n return -par[root(x)];\\n }\\n \\n // get group\\n vector<int> group(int x) {\\n vector<int> res({x});\\n while (nex[res.back()] != x) res.push_back(nex[res.back()]);\\n return res;\\n }\\n vector<vector<int>> groups() {\\n vector<vector<int>> member(par.size());\\n for (int v = 0; v < (int)par.size(); ++v) {\\n member[root(v)].push_back(v);\\n }\\n vector<vector<int>> res;\\n for (int v = 0; v < (int)par.size(); ++v) {\\n if (!member[v].empty()) res.push_back(member[v]);\\n }\\n return res;\\n }\\n \\n // debug\\n friend ostream& operator << (ostream &s, UnionFind uf) {\\n const vector<vector<int>> &gs = uf.groups();\\n for (const vector<int> &g : gs) {\\n s << \\\"group: \\\";\\n for (int v : g) s << v << \\\" \\\";\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\n// Edge Class\\ntemplate<class T> struct Edge {\\n int from, to;\\n T val;\\n Edge() : from(-1), to(-1), val(-1) { }\\n Edge(int f, int t, T v = -1) : from(f), to(t), val(v) {}\\n friend ostream& operator << (ostream& s, const Edge& e) {\\n return s << e.from << \\\"->\\\" << e.to;\\n }\\n};\\n\\n// graph class\\ntemplate<class T> struct Graph {\\n vector<vector<Edge<T>>> list;\\n \\n Graph() { }\\n Graph(int n) : list(n) { }\\n Graph(const Graph<T> &G) : list(G.list) { }\\n void init(int n) {\\n list.assign(n, vector<Edge<T>>());\\n }\\n Graph &operator = (const Graph &g) {\\n list = g.list;\\n return *this;\\n }\\n\\n const vector<Edge<T>> &operator [] (int i) const { return list[i]; }\\n const size_t size() const { return list.size(); }\\n const void clear() {\\n list.clear();\\n }\\n const void resize(int n) {\\n list.resize(n);\\n }\\n\\n void add_edge(int from, int to, T val = -1) {\\n list[from].push_back(Edge(from, to, val));\\n list[to].push_back(Edge(to, from, val));\\n }\\n\\n friend ostream &operator << (ostream &s, const Graph &G) {\\n s << endl;\\n for (int i = 0; i < G.size(); ++i) {\\n s << i << \\\" -> \\\";\\n for (const auto &e : G[i]) s << e.to << \\\" \\\";\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\n// low-link\\ntemplate<class T> struct LowLink {\\n // results\\n vector<int> ord, low;\\n vector<int> aps; // articulation points\\n vector<Edge<T>> brs; // brideges\\n\\n // constructor\\n LowLink() { }\\n LowLink(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // solver\\n int dfs(const Graph<T> &G, int t, int v, int p) {\\n ord[v] = low[v] = t++;\\n int num_of_children = 0;\\n bool exist_articulation = false, is_multiple_edge = false;\\n for (const auto &e : G[v]) {\\n if (ord[e.to] == -1) {\\n num_of_children++;\\n t = dfs(G, t, e.to, v);\\n low[v] = min(low[v], low[e.to]); // forward edge of DFS-tree\\n exist_articulation |= (p != -1) && (low[e.to] >= ord[v]);\\n if (ord[v] < low[e.to]) brs.push_back(e);\\n } else if (e.to != p || is_multiple_edge) {\\n low[v] = min(low[v], ord[e.to]); // back edge\\n } else {\\n is_multiple_edge = true;\\n }\\n }\\n if (exist_articulation || (p == -1 && num_of_children > 1)) {\\n aps.emplace_back(v);\\n }\\n return t;\\n }\\n\\n void solve(const Graph<T> &G) {\\n ord.assign(G.size(), -1), low.assign(G.size(), -1);\\n for (int v = 0, k = 0; v < (int)G.size(); v++) {\\n if (ord[v] == -1) k = dfs(G, k, v, -1);\\n }\\n }\\n};\\n\\n// BiConnected Components decomposition\\n// block-cut tree (aps: 0, 1, ..., A-1, components: A, A+1, ..., A+C-1)\\n// (A: size of aps, C: num of components)\\ntemplate<class T> struct BiConnectedComponentsDecomposition {\\n // result\\n LowLink<T> ll;\\n vector<int> id_ap; // index of the articulation point (size: V)\\n vector<int> id_cc; // index of the connected component (size: V)\\n vector<vector<int>> groups; // biconnected components (size: C)\\n vector<vector<int>> tree; // block-cut tree (size: A + C)\\n\\n // intermediate results\\n vector<int> seen, finished;\\n vector<vector<pair<int, int>>> grouped_edges;\\n vector<pair<int, int>> tmp_edges;\\n\\n // constructor\\n BiConnectedComponentsDecomposition() { }\\n BiConnectedComponentsDecomposition(const Graph<T> &G) {\\n solve(G);\\n }\\n void init(const Graph<T> &G) {\\n solve(G);\\n }\\n\\n // getter, original graph to block-cut tree (v: node of orignal graph)\\n int is_ap_original_graph(int v) const {\\n return (id_ap[v] != -1);\\n }\\n int get_id(int v) const {\\n return (id_ap[v] == -1 ? id_cc[v] : id_ap[v]);\\n }\\n\\n // getter, block-cut tree to orignal graph（v: node-id of block-cut tree)\\n int is_ap(int v) const {\\n return (v < ll.aps.size());\\n }\\n int get_ap(int v) const {\\n if (v >= (int)ll.aps.size()) return -1; // not ap\\n else return ll.aps[v];\\n }\\n int get_size(int v) const { // including aps\\n if (v < (int)ll.aps.size()) return 1; // ap\\n else return groups[v - ll.aps.size()].size();\\n }\\n vector<int> get_group(int v) const {\\n if (v < (int)ll.aps.size()) return vector<int>({ll.aps[v]}); // ap\\n else return groups[v - ll.aps.size()];\\n }\\n\\n // solver\\n void dfs(const Graph<T> &G, int v, int p) {\\n seen[v] = true;\\n if (G[v].empty()) {\\n groups.emplace_back(vector<int>({v}));\\n }\\n for (const auto &e : G[v]) {\\n if (e.to == p) continue;\\n if (!seen[e.to] || ll.ord[e.to] < ll.ord[v]) {\\n tmp_edges.emplace_back(minmax(v, e.to));\\n }\\n if (!seen[e.to]) {\\n dfs(G, e.to, v);\\n if (ll.low[e.to] >= ll.ord[v]) {\\n groups.emplace_back(vector<int>({v}));\\n grouped_edges.emplace_back();\\n int ap = v;\\n while (!tmp_edges.empty()) {\\n const auto &e2 = tmp_edges.back();\\n if (!finished[e2.first] && e2.first != ap) {\\n groups.back().emplace_back(e2.first);\\n finished[e2.first] = true;\\n }\\n if (!finished[e2.second] && e2.second != ap) {\\n groups.back().emplace_back(e2.second);\\n finished[e2.second] = true;\\n }\\n grouped_edges.back().emplace_back(e2);\\n tmp_edges.pop_back();\\n if (e2.first == min(v, e.to) && e2.second == max(v, e.to)) break;\\n }\\n }\\n }\\n }\\n }\\n\\n void solve(const Graph<T> &G) {\\n ll.init(G);\\n seen.assign(G.size(), false), finished.assign(G.size(), false);\\n for (int v = 0; v < (int)G.size(); v++) {\\n if (!seen[v]) dfs(G, v, -1);\\n }\\n id_ap.assign(G.size(), -1), id_cc.assign(G.size(), -1);\\n for (int i = 0; i < (int)ll.aps.size(); i++) {\\n id_ap[ll.aps[i]] = i;\\n }\\n tree.assign(ll.aps.size() + grouped_edges.size(), vector<int>());\\n vector<int> last(G.size(), -1);\\n for (int i = 0; i < (int)grouped_edges.size(); i++) {\\n vector<int> st;\\n for (auto [u, v] : grouped_edges[i]) {\\n st.push_back(u), st.push_back(v);\\n }\\n for (auto v : st) {\\n if (id_ap[v] == -1) {\\n id_cc[v] = i + ll.aps.size();\\n } else if (last[v] != i) {\\n tree[i + ll.aps.size()].push_back(id_ap[v]);\\n tree[id_ap[v]].push_back(i + ll.aps.size());\\n last[v] = i;\\n }\\n }\\n }\\n }\\n};\\n\\nint main() {\\n int N, M, u, v;\\n cin >> N >> M;\\n vector<long long> w(N), res(N, 0);\\n for (int i = 0; i < N; i++) cin >> w[i];\\n\\n UnionFind uf(N);\\n Graph<int> G(N);\\n for (int i = 0; i < M; i++) {\\n cin >> u >> v, u--, v--;\\n G.add_edge(u, v);\\n G.add_edge(v, u);\\n uf.merge(u, v);\\n }\\n vector<long long> all_comp_sum(N, 0);\\n for (int v = 0; v < N; v++) {\\n int r = uf.root(v);\\n all_comp_sum[r] += w[v];\\n }\\n\\n // Block-Cut 木上を形成\\n BiConnectedComponentsDecomposition<int> bcc(G);\\n\\n // 関節点以外について求める\\n for (int ov = 0; ov < N; ov++) {\\n if (!bcc.is_ap_original_graph(ov)) {\\n res[ov] = all_comp_sum[uf.root(ov)] - w[ov];\\n }\\n }\\n\\n // 関節点について求める：Block-Cut 木上の DP\\n auto tree = bcc.tree;\\n vector<long long> sum(tree.size(), 0);\\n for (int v = 0; v < tree.size(); v++) {\\n const auto &group = bcc.get_group(v);\\n for (auto ov : group) sum[v] += w[ov];\\n\\n //cout << v << \\\": \\\" << group << \\\": \\\" << sum[v] << endl;\\n }\\n vector<bool> seen(tree.size(), false);\\n auto rec = [&](auto rec, int v, int p) -> long long {\\n seen[v] = true;\\n const auto &group = bcc.get_group(v);\\n long long ma = 0, all_weight = sum[v];\\n for (auto ch : tree[v]) {\\n if (ch == p) continue;\\n long long sub = rec(rec, ch, v);\\n if (bcc.is_ap(v)) sub -= sum[v];\\n else sub -= sum[ch];\\n ma = max(ma, sub), all_weight += sub;\\n }\\n\\n // 関節点について処理する\\n if (bcc.is_ap(v)) {\\n int ov = bcc.get_ap(v);\\n long long rem = all_comp_sum[uf.root(ov)] - all_weight;\\n ma = max(ma, rem);\\n res[ov] = ma;\\n }\\n \\n //cout << v << \\\": \\\" << all_weight << endl;\\n return all_weight;\\n };\\n for (int v = 0; v < tree.size(); v++) {\\n if (seen[v]) continue;\\n rec(rec, v, -1);\\n }\\n\\n for (auto val : res) cout << val << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 47220,\n \"score_of_the_acc\": -1.6104,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3022_9637515\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nvector<vector<int>> adj, adj2;\\nvector<int> low, order;\\nvector<long long> val;\\nint timer = 0;\\n\\nvoid dfs(int u, int p) {\\n low[u] = order[u] = timer++;\\n for (int &v: adj[u]) {\\n if (order[v] == -1) {\\n dfs(v, u);\\n adj2[u].push_back(v);\\n val[u] += val[v];\\n low[u] = min(low[u], low[v]);\\n } else if (v != p)\\n low[u] = min(low[u], order[v]);\\n\\n }\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n adj.assign(n + 1, {});\\n adj2.assign(n + 1, {});\\n low.assign(n + 1, {});\\n order.assign(n + 1, -1);\\n val.assign(n + 1, -1);\\n\\n for (int u = 1; u <= n; ++u)\\n cin >> val[u];\\n\\n for (int i = 0; i < m; ++i) {\\n int u, v;\\n cin >> u >> v;\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n\\n dfs(1, 0);\\n\\n for (int u = 1; u <= n; ++u) {\\n long long res = 0, sum = val[1] - val[u];\\n for (int &v: adj2[u]) {\\n if (order[u] > low[v]) sum += val[v];\\n else res = max(res, val[v]);\\n }\\n cout << max(res, sum) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 14188,\n \"score_of_the_acc\": -0.3841,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3022_9637510\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nvector<vector<int>> adj, adj2;\\nvector<int> low, val, order;\\nint timer = 0;\\n\\nvoid dfs(int u, int p) {\\n low[u] = order[u] = timer++;\\n for (int &v: adj[u]) {\\n if (order[v] == -1) {\\n dfs(v, u);\\n adj2[u].push_back(v);\\n val[u] += val[v];\\n low[u] = min(low[u], low[v]);\\n } else if (v != p)\\n low[u] = min(low[u], order[v]);\\n\\n }\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n adj.assign(n + 1, {});\\n adj2.assign(n + 1, {});\\n low.assign(n + 1, {});\\n order.assign(n + 1, -1);\\n val.assign(n + 1, -1);\\n\\n for (int u = 1; u <= n; ++u)\\n cin >> val[u];\\n\\n for (int i = 0; i < m; ++i) {\\n int u, v;\\n cin >> u >> v;\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n\\n dfs(1, 0);\\n\\n for (int u = 1; u <= n; ++u) {\\n int res = 0, sum = val[1] - val[u];\\n for (int &v: adj2[u]) {\\n if (order[u] > low[v]) sum += val[v];\\n else res = max(res, val[v]);\\n }\\n cout << max(res, sum) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.3055555555555556,\n \"time_ms\": 50,\n \"memory_kb\": 11408,\n \"score_of_the_acc\": -0.25,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3022_8905080\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define CONSTANTS\\n#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr long long INF = 1e18;\\n// constexpr long long INF = LONG_LONG_MAX;\\n// constexpr int MOD = 1000000007;\\nconstexpr int MOD = 998244353;\\nconstexpr long double EPS = 1e-10;\\nconstexpr long double PI = M_PI;\\n\\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\\n#define name4(i, a, b, c, d, e, ...) e\\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define eb emplace_back\\n#define mkp make_pair\\n#define ALL(A) begin(A), end(A)\\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\\n#define elif else if\\n#define tostr to_string\\n#ifndef CONSTANTS\\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\\n#endif\\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \\\"\\\" : \\\" \\\"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \\\" \\\") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \\\" \\\") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\\\n'; } template<typename T> void print(const deque<T> &que, string sep = \\\" \\\") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \\\" \\\") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \\\" \\\") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\\\n'; } template<typename T> void print(T out) { cout << out << '\\\\n'; }\\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \\\":\\\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \\\": \\\" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\\\\\"' or names[i] == '\\\\'') { if (i > 0 and names[i - 1] == '\\\\\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \\\": \\\" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto &[k, v] : mp) res += v; return res; }\\n\\nstruct LowLink { const vvi &g; int N; vector<int> ord, low, articulations, is_arti; vector<pair<int, int>> bridges; LowLink(const vvi &_g) : g(_g), N(g.size()), ord(N, -1), low(N, -1), is_arti(N) { for (int i = 0, k = 0; i < N; i++) { if (ord[i] == -1) { k = dfs(i, k, -1); } } sort(ALL(bridges)); } bool is_articulation(int u) { return is_arti[u]; } bool is_bridge(int u, int v) { if (u > v) swap(u, v); auto itr = lower_bound(ALL(bridges), pii{u, v}); return itr != bridges.end() and (*itr) == pii{u, v}; } bool has_articulation() { return articulations.size(); } bool has_bridge() { return bridges.size(); } vector<int> get_articulations() { return articulations; } vector<pii> get_bridges() { return bridges; } private: int dfs(int idx, int k, int par) { low[idx] = (ord[idx] = k++); int cnt = 0; bool arti = false, second = false; for (auto &to : g[idx]) { if (ord[to] == -1) { cnt++; k = dfs(to, k, idx); low[idx] = min(low[idx], low[to]); arti |= (par != -1) && (low[to] >= ord[idx]); if (ord[idx] < low[to]) { bridges.emplace_back(minmax(idx, (int)to)); } } else if (to != par || second) { low[idx] = min(low[idx], ord[to]); } else { second = true; } } arti |= par == -1 && cnt > 1; if (arti) { articulations.push_back(idx); is_arti[idx] = true; } return k; } };\\nstruct BiConnectedComponents : LowLink { vector<int> used; vector<vector<pair<int, int>>> bc; vector<pair<int, int>> tmp; BiConnectedComponents(const vvi &_g) : LowLink(_g) { build(); } void build() { used.assign(this->g.size(), 0); for (int i = 0; i < (int)used.size(); i++) { if (!used[i]) dfs(i, -1); } } void dfs(int idx, int par) { used[idx] = true; for (auto &to : this->g[idx]) { if (to == par) continue; if (!used[to] || this->ord[to] < this->ord[idx]) { tmp.emplace_back(minmax<int>(idx, to)); } if (!used[to]) { dfs(to, idx); if (this->low[to] >= this->ord[idx]) { bc.emplace_back(); while (true) { auto e = tmp.back(); bc.back().emplace_back(e); tmp.pop_back(); if (e.first == min<int>(idx, to) && e.second == max<int>(idx, to)) { break; } } } } } } };\\nstruct BlockCutTree { const vector<vector<int>> g; BiConnectedComponents bcc; vector<vector<int>> aux, groups; vector<int> idar, idcc, sz, is_arti; BlockCutTree(const vector<vector<int>> &_g) : g(_g), bcc(g) { build(); } void build() { auto ar = bcc.get_articulations(); idar.resize(g.size(), -1); idcc.resize(g.size(), -1); for (int i = 0; i < (int)ar.size(); i++) idar[ar[i]] = i; aux.resize(ar.size() + bcc.bc.size()); vector<int> last(g.size(), -1); for (int i = 0; i < (int)bcc.bc.size(); i++) { vector<int> st; for (auto &[u, v] : bcc.bc[i]) st.push_back(u), st.push_back(v); for (auto &u : st) { if (idar[u] == -1) idcc[u] = i + ar.size(); else if (last[u] != i) { add(i + ar.size(), idar[u]); last[u] = i; } } } sz.resize(aux.size()); is_arti.resize(aux.size()); groups.resize(aux.size()); for (int u = 0; u < g.size(); u++) { groups[this->id(u)].eb(u); sz[this->id(u)]++; if (idar[u] != -1) { is_arti[this->id(u)] = true; } } } vector<int> &operator[](int i) { return aux[i]; } int size() const { return aux.size(); } int size(int k) { return sz[k]; } int id(int i) { return idar[i] == -1 ? idcc[i] : idar[i]; } bool is_articulation(int k) { return is_arti[k]; } vector<vector<int>> get_nodes() { return aux; } vector<vector<int>> get_groups() { return groups; } private: void add(int i, int j) { if (i == -1 or j == -1) return; aux[i].push_back(j); aux[j].push_back(i); }; };\\n\\nvoid solve() {\\n ll N, M;\\n cin >> N >> M;\\n vector<ll> W(N);\\n cin >> W;\\n vvi nodes(N);\\n rep(i, M) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n nodes[u].eb(v);\\n nodes[v].eb(u);\\n }\\n\\n BlockCutTree bct(nodes);\\n ll K = bct.size();\\n vector<ll> W2(K);\\n rep(u, N) {\\n W2[bct.id(u)] += W[u];\\n }\\n ll wsm = sum(W);\\n vector<ll> dp(K), ans(N, wsm);\\n rep(u, N) {\\n ans[u] -= W[u];\\n }\\n auto groups = bct.get_groups();\\n auto dfs = [&](auto &&f, ll u, ll prv) -> void {\\n dp[u] = W2[u];\\n for (auto v : bct[u]) {\\n if (v == prv) continue;\\n f(f, v, u);\\n dp[u] += dp[v];\\n }\\n if (bct.is_articulation(u)) {\\n ll mx = wsm - dp[u];\\n for (auto v : bct[u]) {\\n if (v == prv) continue;\\n chmax(mx, dp[v]);\\n }\\n assert(groups[u].size() == 1);\\n ans[groups[u][0]] = mx;\\n }\\n };\\n dfs(dfs, 0, -1);\\n print(ans, \\\"\\\\n\\\");\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n\\n // single test case\\n solve();\\n\\n // multi test cases\\n // int T;\\n // cin >> T;\\n // while (T--) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 50212,\n \"score_of_the_acc\": -1.4375,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3022_8905043\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define CONSTANTS\\n#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr long long INF = 1e18;\\n// constexpr long long INF = LONG_LONG_MAX;\\n// constexpr int MOD = 1000000007;\\nconstexpr int MOD = 998244353;\\nconstexpr long double EPS = 1e-10;\\nconstexpr long double PI = M_PI;\\n\\nusing ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll, ll>; using pii = pair<int, int>; using pli = pair<ll, int>; using pil = pair<int, ll>; template<typename T> using vv = vector<vector<T>>; using vvl = vv<ll>; using vvi = vv<int>; using vvpll = vv<pll>; using vvpli = vv<pli>; using vvpil = vv<pil>;\\n#define name4(i, a, b, c, d, e, ...) e\\n#define rep(...) name4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rep1(i, a) for (ll i = 0, _aa = a; i < _aa; i++)\\n#define rep2(i, a, b) for (ll i = a, _bb = b; i < _bb; i++)\\n#define rep3(i, a, b, c) for (ll i = a, _bb = b; (c > 0 && a <= i && i < _bb) or (c < 0 && a >= i && i > _bb); i += c)\\n#define rrep(i, a, b) for (ll i=(a); i>(b); i--)\\n#define pb push_back\\n#define eb emplace_back\\n#define mkp make_pair\\n#define ALL(A) begin(A), end(A)\\n#define UNIQUE(A) sort(ALL(A)), A.erase(unique(ALL(A)), A.end())\\n#define elif else if\\n#define tostr to_string\\n#ifndef CONSTANTS\\nconstexpr ll INF = 1e18; constexpr int MOD = 1000000007; constexpr ld EPS = 1e-10; constexpr ld PI = M_PI;\\n#endif\\ntemplate<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template<typename T = ll> vector<T> LIST(int N) { vector<T> A(N); rep(i, N) { cin >> A[i]; } return A; }\\ntemplate<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }\\ntemplate<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; } template<class T, size_t... Is> void print_tuple(ostream &os, const T &arg, index_sequence<Is...>) { static_cast<void>(((os << (Is == 0 ? \\\"\\\" : \\\" \\\"), os << get<Is>(arg)), ...)); } template<class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &arg) { print_tuple(os, arg, make_index_sequence<sizeof...(Ts)>()); return os; } template<typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { rep(i, N) { os << arr[i]; if (i != (int)N - 1) { os << ' '; } } return os; } template<typename T, size_t N> void print(const array<T, N> &arr, string sep = \\\" \\\") { rep(i, N) { cout << arr[i]; if (i != (int)N - 1) cout << sep; } cout << '\\\\n'; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { rep(i, vec.size()) { os << vec[i]; if (i != (int)vec.size() - 1) { os << ' '; } } return os; } template<typename T> void print(const vector<T> &vec, string sep = \\\" \\\") { rep(i, vec.size()) { cout << vec[i]; if (i != (int)vec.size() - 1) cout << sep; } cout << '\\\\n'; } template<typename T> void print(const deque<T> &que, string sep = \\\" \\\") { vector<T> vec(ALL(que)); print(vec, sep); } template<typename T> void print(const set<T> &se, string sep = \\\" \\\") { vector<T> vec(ALL(se)); print(vec, sep); } template<typename T> void print(const initializer_list<T> &li, string sep = \\\" \\\") { vector<T> V(ALL(li)); print(V, sep); } void print() { cout << '\\\\n'; } template<typename T> void print(T out) { cout << out << '\\\\n'; }\\n#define debug(...) multi_debug(#__VA_ARGS__, __VA_ARGS__)\\ntemplate<typename T> void multi_debug(string name, const vv<T> &grid) { cerr << name << \\\":\\\" << endl; int H = grid.size(); int W = grid[0].size(); vector<int> mxlen(W); rep(h, H) { rep(w, W) { chmax(mxlen[w], (int)tostr(grid[h][w]).size()); } } rep(h, H) { rep(w, W) { int pad = mxlen[w] - (int)tostr(grid[h][w]).size(); cerr << string(pad, ' ') << grid[h][w]; if (w == W - 1) { cerr << endl; } else { cerr << ' '; } } } } template<class Tp, class... Ts> void multi_debug(string names, Tp arg, Ts... args) { if constexpr (sizeof...(Ts) == 0) { while (names.back() == ' ') { names.pop_back(); } cerr << names << \\\": \\\" << arg << endl; } else { int n = names.size(), comma_pos = -1, paren_depth = 0, inside_quote = false; rep(i, n) { if (not inside_quote and paren_depth == 0 and names[i] == ',') { comma_pos = i; break; } if (names[i] == '\\\\\\\"' or names[i] == '\\\\'') { if (i > 0 and names[i - 1] == '\\\\\\\\') continue; inside_quote ^= true; } if (not inside_quote and names[i] == '(') { paren_depth++; } if (not inside_quote and names[i] == ')') { paren_depth--; } } assert(comma_pos != -1); string name = names.substr(0, comma_pos); while (name.back() == ' ') { name.pop_back(); } cerr << name << \\\": \\\" << arg << endl; int next_begin_at = comma_pos + 1; while (names[next_begin_at] == ' ') { next_begin_at++; } names = names.substr(next_begin_at); multi_debug(names, args...); } } template<typename T> void print(const vector<T> &V, char sep) { print(V, string{sep}); } template<typename T, size_t N> void print(const array<T, N> &arr, char sep) { print(arr, string{sep}); }\\ntemplate<typename T> T sum(const vector<T> &A) { return accumulate(ALL(A), (T)0); } template<typename key, typename val> val sum(const map<key, val> &mp) { val res = 0; for (auto &[k, v] : mp) res += v; return res; }\\n\\nstruct LowLink { const vvi &g; int N; vector<int> ord, low, articulations, is_arti; vector<pair<int, int>> bridges; LowLink(const vvi &_g) : g(_g), N(g.size()), ord(N, -1), low(N, -1), is_arti(N) { for (int i = 0, k = 0; i < N; i++) { if (ord[i] == -1) { k = dfs(i, k, -1); } } sort(ALL(bridges)); } bool is_articulation(int u) { return is_arti[u]; } bool is_bridge(int u, int v) { if (u > v) swap(u, v); auto itr = lower_bound(ALL(bridges), pii{u, v}); return itr != bridges.end() and (*itr) == pii{u, v}; } bool has_articulation() { return articulations.size(); } bool has_bridge() { return bridges.size(); } vector<int> get_articulations() { return articulations; } vector<pii> get_bridges() { return bridges; } private: int dfs(int idx, int k, int par) { low[idx] = (ord[idx] = k++); int cnt = 0; bool arti = false, second = false; for (auto &to : g[idx]) { if (ord[to] == -1) { cnt++; k = dfs(to, k, idx); low[idx] = min(low[idx], low[to]); arti |= (par != -1) && (low[to] >= ord[idx]); if (ord[idx] < low[to]) { bridges.emplace_back(minmax(idx, (int)to)); } } else if (to != par || second) { low[idx] = min(low[idx], ord[to]); } else { second = true; } } arti |= par == -1 && cnt > 1; if (arti) { articulations.push_back(idx); is_arti[idx] = true; } return k; } };\\n\\n// see: https://nyaannyaan.github.io/library/graph/biconnected-components.hpp\\nstruct BiConnectedComponents : LowLink {\\n vector<int> used;\\n vector<vector<pair<int, int>>> bc;\\n vector<pair<int, int>> tmp;\\n\\n BiConnectedComponents(const vvi &_g) : LowLink(_g) {\\n build();\\n }\\n\\n void build() {\\n used.assign(this->g.size(), 0);\\n for (int i = 0; i < (int)used.size(); i++) {\\n if (!used[i]) dfs(i, -1);\\n }\\n }\\n\\n void dfs(int idx, int par) {\\n used[idx] = true;\\n for (auto &to : this->g[idx]) {\\n if (to == par) continue;\\n if (!used[to] || this->ord[to] < this->ord[idx]) {\\n tmp.emplace_back(minmax<int>(idx, to));\\n }\\n if (!used[to]) {\\n dfs(to, idx);\\n if (this->low[to] >= this->ord[idx]) {\\n bc.emplace_back();\\n while (true) {\\n auto e = tmp.back();\\n bc.back().emplace_back(e);\\n tmp.pop_back();\\n if (e.first == min<int>(idx, to) &&\\n e.second == max<int>(idx, to)) {\\n break;\\n }\\n }\\n }\\n }\\n }\\n }\\n};\\n\\n// see: https://nyaannyaan.github.io/library/tree/block-cut-tree.hpp\\nstruct BlockCutTree {\\n const vvi g;\\n BiConnectedComponents bcc;\\n vector<vector<int>> aux, groups;\\n vector<int> idar, idcc, sz, is_arti;\\n\\n BlockCutTree(const vvi &_g) : g(_g), bcc(g) {\\n build();\\n }\\n\\n void build() {\\n auto ar = bcc.get_articulations();\\n idar.resize(g.size(), -1);\\n idcc.resize(g.size(), -1);\\n for (int i = 0; i < (int)ar.size(); i++) idar[ar[i]] = i;\\n\\n aux.resize(ar.size() + bcc.bc.size());\\n vector<int> last(g.size(), -1);\\n for (int i = 0; i < (int)bcc.bc.size(); i++) {\\n vector<int> st;\\n for (auto &[u, v] : bcc.bc[i]) st.push_back(u), st.push_back(v);\\n for (auto &u : st) {\\n if (idar[u] == -1) idcc[u] = i + ar.size();\\n else if (last[u] != i) {\\n add(i + ar.size(), idar[u]);\\n last[u] = i;\\n }\\n }\\n }\\n\\n sz.resize(aux.size());\\n is_arti.resize(aux.size());\\n groups.resize(aux.size());\\n for (int u = 0; u < g.size(); u++) {\\n groups[this->id(u)].eb(u);\\n sz[this->id(u)]++;\\n if (idar[u] != -1) {\\n is_arti[this->id(u)] = true;\\n }\\n }\\n }\\n\\n vector<int> &operator[](int i) {\\n return aux[i];\\n }\\n\\n // 連結成分数(縮約後グラフの頂点数)\\n int size() const {\\n return aux.size();\\n }\\n\\n // (縮約後グラフの)頂点kの連結成分要素数\\n int size(int k) {\\n return sz[k];\\n }\\n\\n int id(int i) {\\n return idar[i] == -1 ? idcc[i] : idar[i];\\n }\\n\\n // (縮約後グラフの)頂点kが元グラフで関節点かどうか\\n bool is_articulation(int k) {\\n return is_arti[k];\\n }\\n\\n // bool is_arti(int i) {\\n // return idar[i] != -1;\\n // }\\n\\n int arti() {\\n return bcc.get_articulations().size();\\n }\\n\\n // 縮約後グラフの隣接リスト\\n vvi get_nodes() {\\n return aux;\\n }\\n\\n // ACLのSCCが返すみたいな各連結成分を表す隣接リスト\\n vvi get_groups() {\\n return groups;\\n }\\n\\nprivate:\\n void add(int i, int j) {\\n if (i == -1 or j == -1) return;\\n aux[i].push_back(j);\\n aux[j].push_back(i);\\n };\\n};\\n\\nvoid solve() {\\n ll N, M;\\n cin >> N >> M;\\n vector<ll> W(N);\\n cin >> W;\\n vvi nodes(N);\\n rep(i, M) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n nodes[u].eb(v);\\n nodes[v].eb(u);\\n }\\n\\n BlockCutTree bct(nodes);\\n ll K = bct.size();\\n vector<ll> W2(K);\\n rep(u, N) {\\n W2[bct.id(u)] += W[u];\\n }\\n ll wsm = sum(W);\\n vector<ll> dp(K), ans(N, wsm);\\n rep(u, N) {\\n ans[u] -= W[u];\\n }\\n auto groups = bct.get_groups();\\n auto dfs = [&](auto &&f, ll u, ll prv) -> void {\\n dp[u] += W2[u];\\n for (auto v : bct[u]) {\\n if (v == prv) continue;\\n f(f, v, u);\\n dp[u] += dp[v];\\n }\\n if (bct.is_articulation(u)) {\\n ll mx = wsm - dp[u];\\n for (auto v : bct[u]) {\\n if (v == prv) continue;\\n chmax(mx, dp[v]);\\n }\\n assert(groups[u].size() == 1);\\n ans[groups[u][0]] = mx;\\n }\\n };\\n dfs(dfs, 0, -1);\\n print(ans, \\\"\\\\n\\\");\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n\\n // single test case\\n solve();\\n\\n // multi test cases\\n // int T;\\n // cin >> T;\\n // while (T--) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 50004,\n \"score_of_the_acc\": -1.4321,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3022_8696271\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) {\\n os << '-';\\n y *= -1;\\n }\\n std::vector<int> ny;\\n while(y > 0) {\\n ny.push_back(y % 10);\\n y /= 10;\\n }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ok - ng) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 2 \\\"A.cpp\\\"\\n\\nstruct lowlink {\\n using size_t = std::size_t;\\n std::vector<std::vector<std::pair<size_t, size_t>>> graph;\\n std::vector<size_t> ord, low, articulation;\\n std::vector<std::pair<size_t, size_t>> bridge;\\n\\n explicit lowlink(const size_t n) : graph(n), ord(n, 0), low(n, 0) {}\\n\\n void add_edge(const size_t u, const size_t v, const size_t i) {\\n assert(u < graph.size());\\n assert(v < graph.size());\\n graph[u].push_back({v, i});\\n graph[v].push_back({u, i});\\n }\\n\\n virtual void build() {\\n size_t t = 0;\\n std::vector<bool> used(graph.size(), false);\\n std::function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\\n used[v] = true;\\n ord[v] = low[v] = t++;\\n\\n bool is_articulation = false, parent_checked = false;\\n size_t child_cnt = 0;\\n for(auto [to, _] : graph[v]) {\\n if(to == p and not std::exchange(parent_checked, true)) continue;\\n if(not used[to]) {\\n child_cnt++;\\n dfs(to, v);\\n low[v] = std::min(low[v], low[to]);\\n is_articulation |= p != -1 and ord[v] <= low[to];\\n if(ord[v] < low[to]) bridge.push_back(std::minmax({v, to}));\\n } else {\\n low[v] = std::min(low[v], ord[to]);\\n }\\n }\\n\\n is_articulation |= p == -1 and child_cnt >= 2;\\n if(is_articulation) articulation.push_back(v);\\n };\\n for(size_t v = 0; v < graph.size(); v++) if(not used[v]) dfs(v, -1);\\n }\\n};\\n\\nstruct two_edge_connected_components : lowlink {\\n using lowlink::lowlink;\\n using lowlink::graph;\\n using lowlink::ord;\\n using lowlink::low;\\n using lowlink::bridge;\\n\\n using size_t = std::size_t;\\n std::vector<size_t> id;\\n std::vector<std::vector<size_t>> group, tree;\\n\\n explicit two_edge_connected_components(const size_t n) : lowlink(n), id(n, -1) {}\\n\\n void build() override {\\n lowlink::build();\\n\\n size_t c = 0;\\n function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\\n id[v] = (p != -1 and low[v] <= ord[p] ? id[p] : c++);\\n for(auto [to, _] : graph[v]) if(id[to] == -1) dfs(to, v);\\n };\\n for(size_t i = 0; i < graph.size(); i++) if(id[i] == -1) dfs(i, -1);\\n\\n group.resize(c);\\n for(size_t i = 0; i < graph.size(); i++) group[id[i]].push_back(i);\\n\\n tree.resize(c);\\n for(auto [u, v] : bridge) {\\n u = id[u], v = id[v];\\n tree[u].push_back(v);\\n tree[v].push_back(u);\\n }\\n }\\n};\\n\\nstruct biconnected_components : lowlink {\\n using lowlink::lowlink;\\n using lowlink::graph;\\n using lowlink::ord;\\n using lowlink::low;\\n using size_t = std::size_t;\\n std::vector<std::vector<std::tuple<size_t, size_t, size_t>>> bc;\\n\\n void build() override {\\n lowlink::build();\\n std::vector<bool> used(graph.size(), false);\\n std::vector<std::tuple<size_t, size_t, size_t>> tmp;\\n\\n function<void(size_t,size_t)> dfs = [&](size_t v, size_t p) -> void {\\n used[v] = true;\\n bool parent_checked = false;\\n for(auto [to, i] : graph[v]) {\\n if(to == p and not exchange(parent_checked, true)) continue;\\n if(not used[to] or ord[to] < ord[v]) tmp.emplace_back(v, to, i);\\n if(not used[to]) {\\n dfs(to, v);\\n if(ord[v] <= low[to]) {\\n std::vector<std::tuple<size_t, size_t, size_t>> c;\\n while(true) {\\n auto e = tmp.back(); tmp.pop_back();\\n c.emplace_back(e);\\n if(get<2>(e) == i) break;\\n }\\n bc.emplace_back(std::move(c));\\n }\\n }\\n }\\n };\\n\\n for(size_t i = 0; i < graph.size(); i++) if(not used[i]) dfs(i, -1);\\n }\\n};\\n\\nstruct block_cut_tree : biconnected_components {\\n using biconnected_components::biconnected_components;\\n using biconnected_components::graph;\\n using biconnected_components::articulation;\\n using biconnected_components::bc;\\n\\n using size_t = std::size_t;\\n std::vector<int> rev;\\n std::vector<std::vector<size_t>> group, tree;\\n\\n explicit block_cut_tree(const size_t n) : biconnected_components(n), rev(n, -1) {}\\n\\n void build() override {\\n biconnected_components::build();\\n\\n size_t c = bc.size();\\n for(size_t v : articulation) rev[v] = c++;\\n std::vector<size_t> last(c, -1);\\n tree.resize(c);\\n for(size_t i = 0; i < bc.size(); i++) {\\n for(auto [u, v, _] : bc[i]) {\\n for(size_t x : {u, v}) {\\n if(rev[x] != -1 and bc.size() <= rev[x]) {\\n if(std::exchange(last[rev[x]], i) != i) {\\n tree[rev[x]].push_back(i);\\n tree[i].push_back(rev[x]);\\n }\\n } else {\\n rev[x] = i;\\n }\\n }\\n }\\n }\\n group.resize(c);\\n for(size_t i = 0; i < graph.size(); i++) group[rev[i]].push_back(i);\\n }\\n};\\n\\nint main() {\\n int N = in(), M = in();\\n vector<int> A = in(N);\\n block_cut_tree bct(N);\\n for(int i : rep(M)) {\\n int u = in(), v = in(); u--, v--;\\n bct.add_edge(u, v, i);\\n }\\n bct.build();\\n vector<i64> w(bct.tree.size());\\n for(int i : rep(N)) w[bct.rev[i]] += A[i];\\n i64 SUM = sum_of<i64>(A);\\n vector<i64> ans(N, SUM);\\n for(int i : rep(N)) ans[i] -= A[i];\\n\\n function<i64(int,int)> dfs = [&](int v, int p) -> i64 {\\n i64 max_ = 0, sum = 0;\\n for(size_t to : bct.tree[v]) {\\n if(to != p) {\\n i64 x = dfs(to, v);\\n sum += x;\\n chmax(max_, x);\\n }\\n }\\n if(bct.bc.size() <= v) ans[bct.group[v][0]] = max(SUM - sum - w[v], max_);\\n return sum + w[v];\\n };\\n\\n dfs(0, -1);\\n print_n(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 39092,\n \"score_of_the_acc\": -1.0884,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3022_8122870\",\n \"code_snippet\": \"#line 1 \\\".lib/template.hpp\\\"\\n\\n\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <array>\\n#include <tuple>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <bitset>\\n#include <cmath>\\n#include <functional>\\n#include <cassert>\\n#include <climits>\\n#include <iomanip>\\n#include <numeric>\\n#include <memory>\\n#include <random>\\n#define allof(obj) (obj).begin(), (obj).end()\\n#define range(i, l, r) for(int i=l;i<r;i++)\\n#define bit_subset(i, S) for(int i=S, zero_cnt=0;(zero_cnt+=i==S)<2;i=(i-1)&S)\\n#define bit_kpop(i, n, k) for(int i=(1<<k)-1,x_bit,y_bit;i<(1<<n);x_bit=(i&-i),y_bit=i+x_bit,i=(!i?(1<<n):((i&~y_bit)/x_bit>>1)|y_bit))\\n#define bit_kth(i, k) ((i >> k)&1)\\n#define bit_highest(i) (i?63-__builtin_clzll(i):-1)\\n#define bit_lowest(i) (i?__builtin_ctzll(i):-1)\\nusing ll = long long;\\nusing ld = long double;\\nusing ul = uint64_t;\\nusing pi = std::pair<int, int>;\\nusing pl = std::pair<ll, ll>;\\nusing namespace std;\\n\\ntemplate<typename F, typename S>\\nstd::ostream &operator<<(std::ostream &dest, const std::pair<F, S> &p){\\n dest << p.first << ' ' << p.second;\\n return dest;\\n}\\ntemplate<typename T>\\nstd::ostream &operator<<(std::ostream &dest, const std::vector<std::vector<T>> &v){\\n int sz = v.size();\\n if(sz==0) return dest;\\n for(int i=0;i<sz;i++){\\n int m = v[i].size();\\n for(int j=0;j<m;j++) dest << v[i][j] << (i!=sz-1&&j==m-1?'\\\\n':' ');\\n }\\n return dest;\\n}\\ntemplate<typename T>\\nstd::ostream &operator<<(std::ostream &dest, const std::vector<T> &v){\\n int sz = v.size();\\n if(sz==0) return dest;\\n for(int i=0;i<sz-1;i++) dest << v[i] << ' ';\\n dest << v[sz-1];\\n return dest;\\n}\\ntemplate<typename T, size_t sz>\\nstd::ostream &operator<<(std::ostream &dest, const std::array<T, sz> &v){\\n if(sz==0) return dest;\\n for(int i=0;i<sz-1;i++) dest << v[i] << ' ';\\n dest << v[sz-1];\\n return dest;\\n}\\ntemplate<typename T>\\nstd::ostream &operator<<(std::ostream &dest, const std::set<T> &v){\\n for(auto itr=v.begin();itr!=v.end();){\\n dest << *itr;\\n itr++;\\n if(itr!=v.end()) dest << ' ';\\n }\\n return dest;\\n}\\ntemplate<typename T, typename E>\\nstd::ostream &operator<<(std::ostream &dest, const std::map<T, E> &v){\\n for(auto itr=v.begin();itr!=v.end();){\\n dest << '(' << itr->first << \\\", \\\" << itr->second << ')';\\n itr++;\\n if(itr!=v.end()) dest << '\\\\n';\\n }\\n return dest;\\n}\\ntemplate<typename T>\\nvector<T> make_vec(size_t sz, T val){return std::vector<T>(sz, val);}\\ntemplate<typename T, typename... Tail>\\nauto make_vec(size_t sz, Tail ...tail){\\n return std::vector<decltype(make_vec<T>(tail...))>(sz, make_vec<T>(tail...));\\n}\\ntemplate<typename T>\\nvector<T> read_vec(size_t sz){\\n std::vector<T> v(sz);\\n for(int i=0;i<(int)sz;i++) std::cin >> v[i];\\n return v;\\n}\\ntemplate<typename T, typename... Tail>\\nauto read_vec(size_t sz, Tail ...tail){\\n auto v = std::vector<decltype(read_vec<T>(tail...))>(sz);\\n for(int i=0;i<(int)sz;i++) v[i] = read_vec<T>(tail...);\\n return v;\\n}\\nvoid io_init(){\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n}\\n\\n#line 1 \\\".lib/graph/graph_algorithm.hpp\\\"\\n\\n\\n#line 1 \\\".lib/graph/edge.hpp\\\"\\n\\n\\n/*\\ntemplate<typename edge_weight>\\nstruct edge_base{\\n using weight = edge_weight;\\n int to();\\n int from();\\n int id();\\n weight wei();\\n static weight z();\\n edge_base<weight> reverse();\\n};\\n*/\\n\\ntemplate<typename edge_weight>\\nstruct simple_edge{\\n using weight = edge_weight;\\n int s, t;\\n simple_edge(): s(-1), t(-1){}\\n simple_edge(int a, int b): s(a), t(b){}\\n int to(){return t;}\\n int from(){return s;}\\n int id(){return -1;}\\n weight wei(){return 1;}\\n static weight z(){return 0;}\\n simple_edge<weight> reverse(){return simple_edge<weight>{t, s};}\\n};\\n\\ntemplate<typename edge_weight>\\nstruct weighted_edge{\\n using weight = edge_weight;\\n int s, t;\\n weight w;\\n weighted_edge(): s(-1), t(-1), w(0){}\\n weighted_edge(int a, int b, weight c): s(a), t(b), w(c){}\\n int to(){return t;}\\n int from(){return s;}\\n int id(){return -1;}\\n weight wei(){return w;}\\n static weight z(){return 0;}\\n weighted_edge<weight> reverse(){return weighted_edge<weight>{t, s, w};}\\n};\\n\\ntemplate<typename edge_weight>\\nstruct labeled_edge{\\n using weight = edge_weight;\\n int s, t, i;\\n labeled_edge(): s(-1), t(-1), i(-1){}\\n labeled_edge(int a, int b, int i): s(a), t(b), i(i){}\\n int to(){return t;}\\n int from(){return s;}\\n int id(){return i;}\\n weight wei(){return 1;}\\n static weight z(){return 0;}\\n labeled_edge<weight> reverse(){return labeled_edge<weight>{t, s, i};}\\n};\\n\\ntemplate<typename edge_weight>\\nstruct weighted_labeled_edge{\\n using weight = edge_weight;\\n int s, t;\\n weight w;\\n int i;\\n weighted_labeled_edge(): s(-1), t(-1), i(-1), w(0){}\\n weighted_labeled_edge(int a, int b, weight w, int i): s(a), t(b), w(w), i(i){}\\n int to(){return t;}\\n int from(){return s;}\\n int id(){return i;}\\n weight wei(){return w;}\\n static weight z(){return 0;}\\n weighted_labeled_edge<weight> reverse(){return weighted_labeled_edge<weight>{t, s, w, i};}\\n};\\n\\n#line 8 \\\".lib/graph/graph_algorithm.hpp\\\"\\n\\nnamespace graph_algorithm{\\n template<typename T>\\n using vec = std::vector<T>;\\n // O(V + E)\\n // 辺の重みが1\\n template<typename edge>\\n struct bfs_shortest_path{\\n private:\\n using weight = typename edge::weight;\\n using dist_p = std::pair<weight, int>;\\n vec<vec<edge>> &g;\\n public:\\n bfs_shortest_path(vec<vec<edge>> &g): g(g){}\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\\n vec<weight> dist;\\n vec<edge> par;\\n void build(int s){\\n int n = g.size();\\n if(dist.empty()){\\n dist.resize(n, inf);\\n par.resize(n, edge{});\\n }else{\\n std::fill(dist.begin(), dist.end(), inf);\\n std::fill(par.begin(), par.end(), edge{});\\n }\\n std::queue<dist_p> que;\\n dist[s] = edge::z();\\n que.push(dist_p(edge::z(), s));\\n while(!que.empty()){\\n auto [w, v] = que.top();\\n que.pop();\\n if(dist[v] < w) continue;\\n for(edge &e: g[v]){\\n assert(e.wei() == 1);\\n weight d = dist[v] + e.wei();\\n int to = e.to();\\n if(dist[to] > d){\\n dist[to] = d;\\n par[to] = e;\\n que.push(dist_p(d, to));\\n }\\n }\\n }\\n }\\n vec<edge> get_path(int v){\\n assert(!dist.empty());\\n vec<edge> ret;\\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n weight operator [](int v){return dist[v];}\\n };\\n\\n // O(V + E)\\n // 辺の重みが0か1\\n template<typename edge>\\n struct zero_one_bfs_shortest_path{\\n private:\\n using weight = typename edge::weight;\\n using dist_p = std::pair<weight, int>;\\n vec<vec<edge>> &g;\\n public:\\n zero_one_bfs_shortest_path(vec<vec<edge>> &g): g(g){}\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\\n vec<weight> dist;\\n vec<edge> par;\\n void build(int s){\\n int n = g.size();\\n if(dist.empty()){\\n dist.resize(n, inf);\\n par.resize(n, edge{});\\n }else{\\n std::fill(dist.begin(), dist.end(), inf);\\n std::fill(par.begin(), par.end(), edge{});\\n }\\n std::queue<dist_p> que0, que1;\\n dist[s] = edge::z();\\n que0.push(dist_p(edge::z(), s));\\n while(!que0.empty() && !que1.empty()){\\n if(que0.empty()){\\n que0 = que1;\\n que1.clear();\\n }\\n auto [w, v] = que0.top();\\n que0.pop();\\n if(dist[v] < w) continue;\\n for(edge &e: g[v]){\\n weight w = e.wei();\\n assert(w == 0 || w == 1);\\n weight d = dist[v] + w;\\n int to = e.to();\\n if(dist[to] > d){\\n dist[to] = d;\\n par[to] = e;\\n if(w == 0) que0.push(dist_p(d, to));\\n else que1.push(dist_p(d, to));\\n }\\n }\\n }\\n }\\n vec<edge> get_path(int v){\\n assert(!dist.empty());\\n vec<edge> ret;\\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n weight operator [](int v){return dist[v];}\\n };\\n\\n // O((V + E)logV)\\n // 辺の重みが非負(負の閉路がなければ一応動く)\\n template<typename edge>\\n struct dijkstra{\\n private:\\n using weight = typename edge::weight;\\n using dist_p = std::pair<weight, int>;\\n vec<vec<edge>> &g;\\n public:\\n dijkstra(vec<vec<edge>> &g): g(g){}\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\\n vec<weight> dist;\\n vec<edge> par;\\n void build(int s){\\n int n = g.size();\\n if(dist.empty()){\\n dist.resize(n, inf);\\n par.resize(n, edge{});\\n }else{\\n std::fill(dist.begin(), dist.end(), inf);\\n std::fill(par.begin(), par.end(), edge{});\\n }\\n std::priority_queue<dist_p, vec<dist_p>, std::greater<dist_p>> que;\\n dist[s] = edge::z();\\n que.push(dist_p(edge::z(), s));\\n while(!que.empty()){\\n auto [w, v] = que.top();\\n que.pop();\\n if(dist[v] < w) continue;\\n for(edge &e: g[v]){\\n weight d = dist[v] + e.wei();\\n int to = e.to();\\n if(dist[to] > d){\\n dist[to] = d;\\n par[to] = e;\\n que.push(dist_p(d, to));\\n }\\n }\\n }\\n }\\n vec<edge> get_path(int v){\\n assert(!dist.empty());\\n vec<edge> ret;\\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n weight operator [](int v){return dist[v];}\\n };\\n\\n // O(VE)\\n // inf: 到達不可, minf: 負の閉路\\n template<typename edge>\\n struct bellman_ford{\\n private:\\n using weight = typename edge::weight;\\n using dist_p = std::pair<weight, int>;\\n vec<vec<edge>> &g;\\n public:\\n bellman_ford(vec<vec<edge>> &g): g(g){}\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\\n vec<weight> dist;\\n vec<edge> par;\\n\\n void build(int s){\\n int n = g.size();\\n if(dist.empty()){\\n dist.resize(n, inf);\\n par.resize(n);\\n }else{\\n std::fill(dist.begin(), dist.end(), inf);\\n std::fill(par.begin(), par.end(), edge{});\\n }\\n dist[s] = edge::z();\\n for(int lp = 0; ; lp++){\\n bool update = false;\\n for(int i = 0; i < n; i++){\\n if(dist[i] == inf) continue;\\n for(edge e : g[i]){\\n weight &dto = dist[e.to()];\\n if(dto == minf){\\n if(dto != minf) update = true;\\n dto = minf;\\n }else if(dto == inf || dto > dist[i] + e.wei()){\\n dto = (lp > n ? minf : dist[i] + e.wei());\\n par[e.to()] = e;\\n update = true;\\n }\\n }\\n }\\n if(!update) break;\\n }\\n }\\n vec<edge> get_path(int v){\\n assert(!dist.empty());\\n vec<edge> ret;\\n while(par[v].from() != -1) ret.push_back(par[v]), v = par[v].from();\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n weight operator [](int v){return dist[v];}\\n };\\n\\n // O(V^3)\\n template<typename edge>\\n struct warshall_floyd{\\n private:\\n using weight = typename edge::weight;\\n vec<vec<edge>> &g;\\n public:\\n warshall_floyd(vec<vec<edge>> &g): g(g){}\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n static constexpr weight minf = std::numeric_limits<weight>::min() / 2;\\n vec<vec<weight>> dist;\\n void build(){\\n int n = g.size();\\n dist.resize(n, vec<weight>(n, inf));\\n for(int i = 0; i < n; i++){\\n dist[i][i] = 0;\\n for(edge &e : g[i]){\\n dist[i][e.to()] = std::min(dist[i][e.to()], e.wei());\\n }\\n }\\n for(int k = 0; k < n; k++){\\n for(int s = 0; s < n; s++){\\n for(int t = 0; t < n; t++){\\n dist[s][t] = std::min(dist[s][t], dist[s][k] + dist[k][t]);\\n }\\n }\\n }\\n }\\n vec<weight>& operator [](int v){return dist[v];}\\n };\\n};\\n\\nnamespace graph_algorithm{\\n // {連結成分, DAG}\\n template<typename edge>\\n std::pair<vec<int>, vec<vec<int>>> scc(vec<vec<edge>> &g){\\n int n = g.size();\\n vec<int> v(n), cmp(n, 0);\\n vec<vec<int>> rg(n), V;\\n auto scc_dfs = [&](auto &&scc_dfs, int cur, int &sz)->void{\\n cmp[cur] = -1;\\n for(edge &e : g[cur]){\\n int to = e.to();\\n rg[to].push_back(cur);\\n if(cmp[to] == 0) scc_dfs(scc_dfs, to, sz);\\n }\\n v[sz++] = cur;\\n };\\n auto scc_rdfs = [&](auto &&scc_rdfs, int cur, const int k)->void{\\n cmp[cur] = k;\\n V[k].push_back(cur);\\n for(int to : rg[cur]) if(cmp[to] == -1) scc_rdfs(scc_rdfs, to, k);\\n };\\n for(int i = 0, j = 0; i < n; i++) if(!cmp[i]) scc_dfs(scc_dfs, i, j);\\n for(int i = (int)v.size() - 1, j = 0; i >= 0; i--){\\n if(cmp[v[i]] == -1){\\n V.push_back(vec<int>());\\n scc_rdfs(scc_rdfs, v[i], j++);\\n }\\n }\\n return {cmp, V};\\n }\\n // {連結成分, 森}\\n template<typename edge>\\n std::pair<vec<int>, vec<vec<int>>> two_edge_connected(vec<vec<edge>> &g){\\n int n = g.size();\\n vec<int> v(n), cmp(n, 0);\\n vec<vec<int>> V;\\n vec<vec<bool>> edge_used(n);\\n auto tec_dfs = [&](auto &&tec_dfs, int cur, int &sz)->void{\\n cmp[cur] = -1;\\n for(int i = 0; i < g[cur].size(); i++){\\n int to = g[cur][i].to();\\n if(cmp[to] == 0) edge_used[cur][i] = true, tec_dfs(tec_dfs, to, sz);\\n }\\n v[sz++] = cur;\\n };\\n auto tec_rdfs = [&](auto &&tec_rdfs, int cur, const int k)->void{\\n cmp[cur] = k;\\n V[k].push_back(cur);\\n for(int i = 0; i < g[cur].size(); i++){\\n int to = g[cur][i].to();\\n if(cmp[to] == -1 && !edge_used[cur][i]) tec_rdfs(tec_rdfs, to, k);\\n }\\n };\\n for(int i = 0; i < n; i++) edge_used[i].resize(g[i].size(), 0);\\n for(int i = 0, j = 0; i < n; i++) if(!cmp[i]) tec_dfs(tec_dfs, i, j);\\n for(int i = (int)v.size() - 1, j = 0; i >= 0; i--){\\n if(cmp[v[i]] == -1){\\n V.push_back(vec<int>());\\n tec_rdfs(tec_rdfs, v[i], j++);\\n }\\n }\\n return {cmp, V};\\n }\\n // 二重頂点連結成分分解\\n // {間接点フラグ, 各連結成分が含む頂点}\\n template<typename edge>\\n std::pair<vec<bool>, vec<vec<int>>> bcc(vec<vec<edge>> &g){\\n int n = g.size();\\n vec<vec<int>> V;\\n vec<int> child(n, 0), dep(n, -1), low(n);\\n vec<bool> used(n, false), is_articulation(n, false);\\n vec<edge> tmp_edge;\\n auto bcc_dfs = [&](auto &&bcc_dfs, int cur, int par, int d)->void{\\n if(par != -1) child[par]++;\\n dep[cur] = low[cur] = d;\\n for(edge &e : g[cur]){\\n int to = e.to();\\n if(to == par) continue;\\n if(dep[to] < dep[cur]) tmp_edge.push_back(e);\\n if(dep[e.to()] == -1){\\n bcc_dfs(bcc_dfs, to, cur, d + 1);\\n if(low[to] >= dep[cur]){\\n is_articulation[cur] = true;\\n V.push_back(vec<int>());\\n bool is_ok = false;\\n while(!tmp_edge.empty() && !is_ok){\\n edge e = tmp_edge.back();\\n tmp_edge.pop_back();\\n if(e.from() == cur && e.to() == to) is_ok = true;\\n if(!used[e.to()]) V.back().push_back(e.to()), used[e.to()] = true;\\n if(!used[e.from()]) V.back().push_back(e.from()), used[e.from()] = true;\\n }\\n for(int v : V.back()) used[v] = false;\\n }\\n low[cur] = std::min(low[cur], low[to]);\\n }else low[cur] = std::min(low[cur], dep[to]);\\n }\\n };\\n for(int i = 0; i < n; i++){\\n if(dep[i] != -1) continue;\\n int vsz_pre = V.size();\\n bcc_dfs(bcc_dfs, i, -1, 0);\\n is_articulation[i] = (child[i] > 1);\\n if(V.size() == vsz_pre) V.push_back(vec<int>{i});// 孤立点\\n }\\n return {is_articulation, V};\\n }\\n template<typename edge>\\n std::tuple<vec<bool>, vec<int>, vec<vec<simple_edge<int>>>> block_cut_tree(vec<vec<edge>> &g){\\n auto [is_articulation, V] = bcc<edge>(g);\\n int n = g.size();\\n vec<int> cmp(n, -1);\\n int m = V.size(), a = m;\\n for(int i = 0; i < m; i++){\\n for(int v : V[i]){\\n if(is_articulation[v]) cmp[v] = a++;\\n else cmp[v] = i;\\n }\\n }\\n vec<vec<simple_edge<int>>> G(a);\\n for(int i = 0; i < m; i++){\\n for(int v : V[i]){\\n if(is_articulation[v]){\\n G[i].push_back({i, cmp[v]});\\n G[cmp[v]].push_back({cmp[v], i});\\n }\\n }\\n }\\n return {is_articulation, cmp, G};\\n }\\n};\\nnamespace graph_algorithm{\\n // 終了時にinが0でない要素がある -> 閉路が存在する\\n // 閉路があるなら空のvectorを返す\\n template<typename edge>\\n vec<int> topological_sort(vec<vec<edge>> &g){\\n int n = g.size();\\n std::queue<int> que;\\n vec<int> in(n, 0), ret;\\n for(int i = 0; i < n; i++) for(edge e : g[i]) in[e.to()]++;\\n for(int i = 0; i < n; i++) if(!in[i]) que.push(i);\\n while(!que.empty()){\\n int p = que.front();\\n que.pop();\\n ret.push_back(p);\\n for(edge &e : g[p]){\\n int to = e.to();\\n if(!(--in[to])) que.push(to);\\n }\\n }\\n for(int i = 0; i < n; i++) if(in[i] != 0) return {};\\n return ret;\\n }\\n\\n // プリム法, 連結なら始点sは関係ない\\n template<typename edge>\\n vec<edge> undirected_mst(vec<vec<edge>> &g, int s = 0){\\n int n = g.size();\\n assert(s < n);\\n static vec<bool> V(n, 0);\\n vec<edge> ret;\\n using pde = std::pair<typename edge::weight, edge>;\\n std::priority_queue<pde, vec<pde>, std::function<bool(pde, pde)>> que([](pde a, pde b){\\n return a.first > b.first;\\n });\\n V[s] = true;\\n for(edge &e : g[s]) que.push(pde{e.wei(), e});\\n while(!que.empty()){\\n auto [d, e] = que.top();\\n que.pop();\\n if(V[e.to()]) continue;\\n V[e.to()] = true;\\n ret.push_back(e);\\n for(edge &ec : g[e.to()]) if(!V[ec.to()]) que.push({ec.wei(), ec});\\n }\\n for(edge &e : ret) V[e.to()] = V[e.from()] = false;\\n return ret;\\n }\\n // rを根とするbfs木O(V + E)\\n template<typename edge>\\n vec<vec<edge>> bfs_tree(vec<vec<edge>> &g, int r){\\n int n = g.size();\\n std::queue<int> que;\\n vec<bool> used(n, false);\\n que.push(r);\\n vec<vec<edge>> ret(n);\\n used[r] = true;\\n while(!que.empty()){\\n int v = que.front();\\n que.pop();\\n for(edge &e : g[v]){\\n int to = e.to();\\n if(used[to]) continue;\\n used[to] = true;\\n ret[v].push_back(e);\\n que.push(to);\\n }\\n }\\n return ret;\\n }\\n // rを根とするbfs木, 最短経路的 O((V + E)logV)\\n// {木, 重みのテーブル}\\n template<typename edge>\\n std::pair<vec<vec<edge>>, vec<typename edge::weight>> bfs_tree_shortest(vec<vec<edge>> &g, int r){\\n int n = g.size();\\n using weight = typename edge::weight;\\n using pdv = std::pair<weight, int>;\\n static constexpr weight inf = std::numeric_limits<weight>::max() / 2;\\n std::priority_queue<pdv, vec<pdv>, std::greater<pdv>> que;\\n vec<weight> dist(n, inf);\\n dist[r] = edge::z();\\n que.push({edge::z(), r});\\n vec<vec<edge>> ret(n);\\n while(!que.empty()){\\n auto [d, v] = que.top();\\n que.pop();\\n if(dist[v] < d) continue;\\n for(edge &e : g[v]){\\n int to = e.to();\\n weight nxtd = d + e.wei();\\n if(dist[to] > nxtd){\\n dist[to] = nxtd;\\n ret[v].push_back(e);\\n que.push({nxtd, to});\\n }\\n }\\n }\\n return {ret, dist};\\n }\\n // g[i]の辺を{同じcmpへの辺, 異なるcmpへの辺}に並び替える, O(V + E)\\n template<typename edge>\\n void cmp_edge_arrange(const vec<int> &cmp, vec<vec<edge>> &g){\\n int n = g.size();\\n for(int i = 0; i < n; i++){\\n int m = g[i].size();\\n int l = 0, r = m - 1;\\n while(l < r){\\n while(l < m && cmp[i] == cmp[g[i][l].to()]) l++;\\n while(0 < r && cmp[i] == cmp[g[i][r].to()]) r--;\\n if(l < r) std::swap(g[i][l], g[i][r]);\\n }\\n }\\n }\\n};\\n\\n#line 3 \\\"a.cpp\\\"\\n\\nint main(){\\n io_init();\\n int n, m;\\n std::cin >> n >> m;\\n //simple_graph g(n);\\n vector<vector<simple_edge<int>>> g(n);\\n\\n ll S = 0;\\n auto a = read_vec<int>(n);\\n range(i, 0, n) S += a[i];\\n range(i, 0, m){\\n int x, y;\\n std::cin >> x >> y;\\n x--, y--;\\n g[x].push_back({x, y});\\n g[y].push_back({y, x});\\n }\\n vector<vector<simple_edge<int>>> F(0);\\n vector<bool> is_articulation;\\n vector<int> cmp;\\n \\n std::tie(is_articulation, cmp, F) = graph_algorithm::block_cut_tree(g);\\n\\n int N = F.size();\\n vector<ll> cmp_sum(N, 0), cmp_sum_sub(N, -1), cmp_max(N, 0), root(N, -1), parent(N, -1);\\n range(i, 0, n) cmp_sum[cmp[i]] += a[i];\\n \\n auto f = [&](auto &&f, int cur, int par, int r)->void{\\n parent[cur] = par;\\n root[cur] = r;\\n cmp_sum_sub[cur] = cmp_sum[cur];\\n for(auto &e : F[cur]){\\n if(e.t == par) continue;\\n f(f, e.t, cur, r);\\n cmp_sum_sub[cur] += cmp_sum_sub[e.t];\\n }\\n };\\n for(int i = 0; i < N; i++){\\n if(cmp_sum_sub[i] == -1){\\n f(f, i, -1, i);\\n }\\n }\\n for(int i = 0; i < N; i++){\\n cmp_max[i] = cmp_sum_sub[root[i]] - cmp_sum_sub[i];\\n for(auto &e : F[i]){\\n if(e.t == parent[i]) continue;\\n cmp_max[i] = max(cmp_max[i], cmp_sum_sub[e.t]);\\n }\\n }\\n\\n vector<ll> ans(n);\\n range(i, 0, n){\\n if(!is_articulation[i]){\\n ans[i] = S - a[i];\\n }else{\\n ans[i] = cmp_max[cmp[i]];\\n }\\n }\\n //std::cout << cmp_max << '\\\\n';\\n range(i, 0, n) std::cout << ans[i] << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 37956,\n \"score_of_the_acc\": -1.0592,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3022_7164702\",\n \"code_snippet\": \"#line 1 \\\"test/graph/bcc/AOJ3022.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022\\\"\\n\\n#line 2 \\\"src/Template.hpp\\\"\\n\\n#define CUT\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, l, r) for (int i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for (int i = (r); i --> (l);)\\n#define all(c) begin(c), end(c)\\n\\n#ifdef LOCAL\\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\\ntemplate <class H, class... Ts> void debug_impl(string s, H&& h, Ts&&... ts) {\\n cerr << '(' << s << \\\"): (\\\" << forward<H>(h);\\n ((cerr << \\\", \\\" << forward<Ts>(ts)), ..., (cerr << \\\")\\\\n\\\"));\\n}\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\\n\\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\\n for (auto& e : v) in >> e;\\n return in;\\n}\\ntemplate <class ...Args> void read(Args&... args) {\\n (cin >> ... >> args);\\n}\\ntemplate <class T> ostream& operator<<(ostream& out, const vector<T>& v) {\\n int n = v.size();\\n rep(i, 0, n) {\\n out << v[i];\\n if (i + 1 != n) out << ' ';\\n }\\n return out;\\n}\\ntemplate <class H, class ...Ts> void print(H&& h, Ts &&... ts) {\\n cout << h, ((cout << ' ' << forward<Ts>(ts)), ..., (cout << '\\\\n'));\\n}\\n\\nstruct io_setup_ {\\n io_setup_() {\\n ios::sync_with_stdio(false), cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n }\\n} io_setup{};\\n#undef CUT\\n\\n#define NOTE compile command: \\\\texttt{g++ -std=gnu++17 -Wall -Wextra -g -fsanitize=address -fsanitize=undefined \\\\$\\\\{file\\\\} -o \\\\$\\\\{fileDirname\\\\}/\\\\$\\\\{fileBasenameNoExtension\\\\}}\\n#undef NOTE\\n#define NOTE \\\\texttt{-DLOCAL} を加えると \\\\texttt{debug(...)} による出力が有効となる\\n#undef NOTE\\n#line 3 \\\"src/graph/BCC.hpp\\\"\\n#define CUT\\n#line 2 \\\"src/graph/LowLink.hpp\\\"\\n\\n#line 4 \\\"src/graph/LowLink.hpp\\\"\\n\\n#define CUT\\nstruct LowLink {\\n int n, m;\\n vector<pair<int, int>> edges;\\n vector<vector<pair<int, int>>> g;\\n vector<int> ord, low, a_ids, b_ids;\\n\\n bool built = false;\\n\\n LowLink(const int n = 0): n(n), m(0), g(n), ord(n, -1), low(n) {}\\n\\n // Returns the id of the added edge\\n int add_edge(int u, int v) {\\n built = false;\\n edges.emplace_back(u, v);\\n g[u].emplace_back(v, m);\\n g[v].emplace_back(u, m);\\n return m++;\\n }\\n\\n void build() {\\n if (exchange(built, true)) return;\\n int t = 0;\\n auto dfs = [&](auto dfs, int u, int id) -> void {\\n bool is_root = id < 0, is_art = false;\\n int cnt = 0;\\n ord[u] = low[u] = t++;\\n for (auto [v, id2] : g[u]) if (id != id2) {\\n if (ord[v] < 0) {\\n ++cnt;\\n dfs(dfs, v, id2);\\n chmin(low[u], low[v]);\\n if (ord[u] <= low[v]) {\\n is_art = not is_root;\\n if (ord[u] != low[v]) b_ids.push_back(id2);\\n }\\n } else {\\n chmin(low[u], ord[v]);\\n }\\n }\\n if (is_art or (is_root and cnt > 1)) {\\n a_ids.push_back(u);\\n }\\n };\\n rep(i, 0, n) if (ord[i] < 0) dfs(dfs, i, -1);\\n }\\n\\n // Returns `\\\\{i \\\\mid \\\\text{$e_i$ is a bridge} \\\\}`\\n const vector<int>& bridge_ids() {\\n return build(), b_ids;\\n }\\n // Returns `\\\\{i \\\\mid \\\\text{$v_i$ is an articulation point} \\\\}`\\n const vector<int>& articulation_points() {\\n return build(), a_ids;\\n }\\n\\n bool is_bridge(int u, int v) {\\n build();\\n if (ord[u] > ord[v]) swap(u, v);\\n return ord[u] < low[v];\\n }\\n};\\n#undef CUT\\n#line 5 \\\"src/graph/BCC.hpp\\\"\\n\\nstruct BCC {\\n // isolated vertex <-> eid is empty\\n vector<int> vids, eids;\\n};\\n\\nstruct BCCDecomp: LowLink {\\n // cid[i]: the id of BCC to which `e_i` belongs\\n vector<int> cid;\\n // isolated vertices\\n vector<int> iso;\\n\\n BCCDecomp(int n = 0): LowLink(n) {}\\n\\n int build() {\\n if (built) return iso.size() + (m ? *max_element(all(cid)) + 1 : 0);\\n LowLink::build();\\n\\n vector<int8_t> used(n);\\n\\n int num = 0;\\n cid.assign(m, -1);\\n\\n auto dfs = [&](auto dfs, int u, int peid) -> void {\\n used[u] = true;\\n static vector<int> edges;\\n for (const auto& [v, eid] : g[u]) if (eid != peid) {\\n if (not used[v] or ord[v] < ord[u]) edges.push_back(eid);\\n if (used[v]) continue;\\n dfs(dfs, v, eid);\\n if (low[v] < ord[u]) continue;\\n int e;\\n do cid[e = edges.back()] = num, edges.pop_back(); while (e != eid);\\n num++;\\n }\\n };\\n\\n for (int i = 0; i < n; ++i) if (not used[i]) {\\n dfs(dfs, i, -1);\\n if (g[i].empty()) iso.push_back(i);\\n }\\n return num + iso.size();\\n }\\n\\n vector<BCC> bcc() {\\n const int num = build(), vcmp = iso.size(), ecmp = num - vcmp;\\n\\n vector<BCC> res(num);\\n rep(i, 0, m) {\\n res[cid[i]].eids.push_back(i);\\n }\\n vector<int8_t> seen(n, false);\\n rep(id, 0, ecmp) {\\n for (int eid : res[id].eids) {\\n const auto& [u, v] = edges[eid];\\n if (not exchange(seen[u], true)) res[id].vids.push_back(u);\\n if (not exchange(seen[v], true)) res[id].vids.push_back(v);\\n }\\n for (int v : res[id].vids) seen[v] = false;\\n }\\n rep(id, 0, vcmp) {\\n res[ecmp + id].vids = { iso[id] };\\n }\\n return res;\\n }\\n\\n // Let `C := \\\\text{set of BCC}` and `A := \\\\text{set of articulation points}`\\n // Vertex set of BCT `V := C\\\\sqcup A` (`0 \\\\leq i < |C|` corresponds to the `i`-th BCC and `|C| \\\\leq i < |C| + |A|` corresponds to the `(i-|C|)`-th articulation point)\\n // Edge set of BCT `E := \\\\{(c, a) \\\\in C\\\\times A \\\\mid a \\\\in V(C) \\\\}`\\n vector<vector<int>> block_cut_tree(const vector<BCC> &bccs) {\\n const int cnum = bccs.size(), anum = a_ids.size();\\n\\n vector<int> ids(n, -1);\\n rep(i, 0, anum) {\\n ids[a_ids[i]] = cnum + i;\\n }\\n\\n vector<vector<int>> res(cnum + anum);\\n rep(i, 0, cnum) {\\n for (int v : bccs[i].vids) {\\n if (int j = ids[v]; j >= 0) {\\n res[i].push_back(j);\\n res[j].push_back(i);\\n }\\n }\\n }\\n return res;\\n }\\n\\n // Let `C := \\\\text{set of BCC}` and `A := \\\\text{the vertex set of original graph}`\\n // Vertex set of BCT `V := C\\\\sqcup A` (`0 \\\\leq i < |C|` corresponds to the `i`-th BCC and `|C| \\\\leq i < |C| + |A|` corresponds to the `(i-|C|)`-th vertex)\\n // Edge set of BCT `E := \\\\{(c, a) \\\\in C\\\\times A \\\\mid a \\\\in V(C) \\\\}`\\n vector<vector<int>> ext_block_cut_tree(const vector<BCC> &bccs) {\\n const int cnum = bccs.size();\\n vector<vector<int>> res(cnum + n);\\n rep(i, 0, cnum) {\\n for (int v : bccs[i].vids) {\\n res[i].push_back(cnum + v);\\n res[cnum + v].push_back(i);\\n }\\n }\\n return res;\\n }\\n};\\n#undef CUT\\n\\n#define NOTE 多重辺・自己ループがあってもよい\\n#undef NOTE\\n#line 4 \\\"test/graph/bcc/AOJ3022.test.cpp\\\"\\n\\nint main() {\\n int n, m;\\n read(n, m);\\n vector<long long> w(n);\\n read(w);\\n\\n const long long sum = accumulate(all(w), 0LL);\\n\\n BCCDecomp bccd(n);\\n rep(i, 0, m) {\\n int u, v;\\n read(u, v);\\n --u, --v;\\n bccd.add_edge(u, v);\\n }\\n bccd.build();\\n\\n vector<int8_t> is_art(n);\\n for (int v : bccd.articulation_points()) {\\n is_art[v] = true;\\n }\\n\\n vector<long long> ans(n);\\n rep(i, 0, n) {\\n ans[i] = sum - w[i];\\n }\\n\\n auto bcc = bccd.bcc();\\n auto bct = bccd.block_cut_tree(bcc);\\n const int k = bcc.size(), l = (int) bct.size() - k;\\n\\n vector<long long> s(k + l);\\n rep(i, 0, k) {\\n for (int v : bcc[i].vids) if (not is_art[v]) {\\n s[i] += w[v];\\n }\\n }\\n rep(i, 0, l) {\\n s[k + i] = w[bccd.a_ids[i]];\\n }\\n\\n auto dfs = [&](auto dfs, int u, int p) -> long long {\\n long long max_child = 0;\\n long long res = s[u];\\n for (int v : bct[u]) if (v != p) {\\n long long resv = dfs(dfs, v, u);\\n chmax(max_child, resv);\\n res += resv;\\n }\\n if (u >= k) {\\n chmax(max_child, sum - res);\\n ans[bccd.a_ids[u - k]] = max_child;\\n }\\n return res;\\n };\\n dfs(dfs, 0, -1);\\n\\n rep(i, 0, n) {\\n print(ans[i]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 34288,\n \"score_of_the_acc\": -0.9021,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3022_6330819\",\n \"code_snippet\": \"// https://onlinejudge.u-aizu.ac.jp/problems/3022\\n#pragma GCC optimize(\\\"fast-math\\\")\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n# include <dbg.h>\\n#else\\n# define dbg(...) do {} while (0)\\n#endif\\n\\n#define cp_lib_4th(_1, _2, _3, x, ...) x\\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\\n#define all(a) ::begin(a),::end(a)\\n#define trav(a, b) for (auto&& a : (b))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\\n\\n\\n#ifdef CP_LIB_DEBUG\\n#define cp_lib_assert(expr) \\\\\\n do { if (!(expr)) { \\\\\\n ::cerr << \\\"assertion failed: \\\" << #expr << \\\" (\\\" << __FILE__ << ':' << __LINE__ << \\\")\\\\n\\\"; \\\\\\n ::abort(); \\\\\\n } } while (0)\\n#else\\n#define cp_lib_assert(expr)\\n#endif\\n\\n\\n#if __cplusplus < 202002L\\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\\n#endif\\n#if __cpp_lib_remove_cvref < 201711L\\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\\n#endif\\n\\nnamespace cp_lib_type_meta {\\n template <class T, class = void> constexpr bool is_tuple_like = false;\\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\\n}\\n\\n\\nnamespace cp_lib_modint { struct ModIntTag {}; }\\n#include <unistd.h>\\n\\nnamespace cp_lib_io {\\n constexpr int BUF_SIZE = 1 << 20;\\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\\n array<array<char, 4>, 10'000> digits{};\\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\\n rep(j, 10'000)\\n digits[j][i] = char('0' + j / d % 10);\\n return digits;\\n }();\\n array<char, BUF_SIZE> ibuf, obuf;\\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\\n\\n template <class T> constexpr bool is_std_array = false;\\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\\n\\n void flush() {\\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\\n optr = begin(obuf);\\n }\\n int _flush_atexit = []{ atexit(flush); return 0; }();\\n\\n void refill() {\\n memmove(begin(ibuf), iptr, iend - iptr);\\n iend -= iptr - begin(ibuf);\\n iptr = begin(ibuf);\\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\\n *iend = '\\\\0';\\n }\\n\\n template <class T, class T2 = remove_cvref_t<T>>\\n void print(T&& val) {\\n if (end(obuf) - optr < 64)\\n flush();\\n\\n if constexpr (is_same_v<T2, char>)\\n *optr++ = val;\\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\\n return print(int(val));\\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\\n if (val < 0)\\n *optr++ = '-';\\n using U = make_unsigned_t<T2>;\\n return print(U(val < 0 ? -U(val) : U(val)));\\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\\n T2 val2 = val;\\n array<char, 64> tmp;\\n char* tptr = end(tmp);\\n while (val2 >= 10'000)\\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\\n memcpy(optr, &DIGITS[val2][4 - d], d);\\n memcpy(optr + d, tptr, end(tmp) - tptr);\\n optr += d + int(end(tmp) - tptr);\\n } else if constexpr (is_floating_point_v<T2>)\\n optr += sprintf(optr, \\\"%.30Lf\\\", (long double)val);\\n else if constexpr (is_convertible_v<T, string_view>) {\\n string_view sv(val);\\n if (sz(sv) + 1 <= end(obuf) - optr)\\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\\n else {\\n flush();\\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\\n }\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\\n return print(decltype(T2::mod())(val));\\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\\n else {\\n trav(item, val)\\n print(item);\\n return;\\n }\\n *optr++ = ' ';\\n }\\n\\n template <class T>\\n void read(T& val) {\\n auto skip_ws = [] {\\n do {\\n for (; iptr != iend && *iptr <= ' '; ++iptr);\\n if (iend - iptr < 64)\\n refill();\\n } while (*iptr <= ' ');\\n };\\n auto read_other = [&](auto other) {\\n read(other);\\n return other;\\n };\\n\\n if constexpr (is_same_v<T, char>)\\n skip_ws(), val = *iptr++;\\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\\n val = bool(read_other(uint8_t()));\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\\n val = T(read_other(ll()));\\n } else if constexpr (is_integral_v<T>) {\\n skip_ws();\\n if (is_signed_v<T> && *iptr == '-')\\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\\n else\\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\\n } else if constexpr (is_floating_point_v<T>)\\n skip_ws(), val = T(strtold(iptr, &iptr));\\n else if constexpr (is_same_v<T, string>) {\\n skip_ws();\\n val.clear();\\n do {\\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\\n val.append(iptr, after);\\n if ((iptr = after) != iend)\\n break;\\n refill();\\n } while (iptr != iend);\\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\\n apply([](auto&... items) { (read(items), ...); }, val);\\n else\\n trav(item, val)\\n read(item);\\n }\\n}\\n\\nusing cp_lib_io::flush;\\n\\ntemplate <class... Args>\\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\\n\\ntemplate <class... Args>\\nvoid println(Args&&... args) {\\n if (sizeof...(Args))\\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\\\n';\\n else\\n print('\\\\n'), --cp_lib_io::optr;\\n}\\n\\ntemplate <class... Args>\\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\\n\\n\\n\\ntemplate <class A, class M = identity,\\n class = enable_if_t<!cp_lib_type_meta::is_tuple_like<remove_cvref_t<A>>>>\\nauto graph(A&& adj, M&& m = M()) { return make_tuple(ref(adj), sz(adj), m); }\\ntemplate <class G, class = enable_if_t<cp_lib_type_meta::is_tuple_like<remove_cvref_t<G>>>>\\nauto graph(G g) { return g; }\\nnamespace cp_lib_graph {\\n template <class G> using AdjListIter = decltype(begin(get<0>(graph(declval<G>()))[0]));\\n}\\n\\n\\n\\nnamespace cp_lib_graph {\\n template <class T, enable_if_t<is_convertible_v<int, remove_cvref_t<T>>, int> = 0>\\n auto maybe_edge_idx(T v) { return pair(int(v), 0); }\\n template <class T, enable_if_t<!is_convertible_v<int, remove_cvref_t<T>>, int> = 0>\\n auto maybe_edge_idx(T p) { auto [v, e] = p; return pair(int(v), int(e)); }\\n}\\n\\ntemplate <class G, class OnComp>\\nvoid find_biconnected_components(G&& g, OnComp&& on_comp) {\\n auto [adj, n, map] = graph(forward<G>(g));\\n vector idx(n, INF);\\n vector<pair<int, cp_lib_graph::AdjListIter<G>>> stack;\\n\\n auto dfs = [&, &adj = adj, &map = map](int v, pair<int, int> pe, auto&& self) -> int {\\n int up = idx[v] = sz(stack), cnt = 0;\\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\\n auto [v2, e] = cp_lib_graph::maybe_edge_idx(map(*it));\\n if (pair(v2, e) == pe)\\n continue;\\n up = min(up, idx[v2]);\\n if (idx[v2] == INF || idx[v2] < idx[v])\\n stack.emplace_back(v, it);\\n if (idx[v2] != INF)\\n continue;\\n\\n int up2 = self(v2, pair(v, e), self);\\n up = min(up, up2);\\n if (up2 >= idx[v]) {\\n auto cut_v = (pe.first == -1 && !cnt++ ? nullopt : optional(v));\\n on_comp(cut_v, begin(stack) + idx[v2] - 1, end(stack));\\n stack.resize(idx[v2] - 1);\\n }\\n }\\n return up;\\n };\\n\\n rep(i, n)\\n if (idx[i] == INF)\\n dfs(i, pair(-1, 0), dfs);\\n}\\n\\ntemplate <class G>\\nauto block_vertex_tree(G&& g) {\\n auto [adj, n, to] = graph(forward<G>(g));\\n vector tree(n, vector<int>());\\n find_biconnected_components(adj, [&, &to = to](auto, auto it, auto it_end) {\\n int vc = sz(tree);\\n tree.emplace_back();\\n for (; it != it_end; ++it)\\n for (int v : {it->first, to(*it->second)})\\n if (!sz(tree[v]) || tree[v].back() != vc)\\n tree[v].push_back(vc), tree[vc].push_back(v);\\n });\\n return tree;\\n}\\n\\nint main() {\\n int n, m; read(n, m);\\n vector w(n, 0ll);\\n read(w);\\n vector adj(n, vector<int>());\\n rep(_, m) {\\n int u, v; read(u, v); --u, --v;\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n\\n auto bvt = block_vertex_tree(adj);\\n w.resize(sz(bvt));\\n auto dfs = [&](int v, int p, auto&& self) -> void {\\n trav(v2, bvt[v])\\n if (v2 != p)\\n self(v2, v, self), w[v] += w[v2];\\n };\\n dfs(0, -1, dfs);\\n\\n rep(i, n) {\\n ll ans = w[0] - w[i];\\n trav(v, bvt[i])\\n if (w[v] < w[i])\\n ans = max(ans, w[v]);\\n println(ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 23884,\n \"score_of_the_acc\": -0.509,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3022_6317969\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"fast-math\\\")\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n# include <dbg.h>\\n#else\\n# define dbg(...) do {} while (0)\\n#endif\\n\\n#define cp_lib_4th(_1, _2, _3, x, ...) x\\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\\n#define all(a) ::begin(a),::end(a)\\n#define trav(a, b) for (auto&& a : (b))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\\n\\n\\n#ifdef CP_LIB_DEBUG\\n#define cp_lib_assert(expr) \\\\\\n do { if (!(expr)) { \\\\\\n ::cerr << \\\"assertion failed: \\\" << #expr << \\\" (\\\" << __FILE__ << ':' << __LINE__ << \\\")\\\\n\\\"; \\\\\\n ::abort(); \\\\\\n } } while (0)\\n#else\\n#define cp_lib_assert(expr)\\n#endif\\n\\n\\n#if __cplusplus < 202002L\\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\\n#endif\\n#if __cpp_lib_remove_cvref < 201711L\\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\\n#endif\\n\\nnamespace cp_lib_type_meta {\\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\\n template <class T, class = void> constexpr bool is_tuple_like = false;\\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\\n}\\n\\n\\nnamespace cp_lib_modint { struct ModIntTag {}; }\\n#include <unistd.h>\\n\\nnamespace cp_lib_io {\\n constexpr int BUF_SIZE = 1 << 20;\\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\\n array<array<char, 4>, 10'000> digits{};\\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\\n rep(j, 10'000)\\n digits[j][i] = char('0' + j / d % 10);\\n return digits;\\n }();\\n array<char, BUF_SIZE> ibuf, obuf;\\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\\n\\n template <class T> constexpr bool is_std_array = false;\\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\\n\\n void flush() {\\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\\n optr = begin(obuf);\\n }\\n int _flush_atexit = []{ atexit(flush); return 0; }();\\n\\n void refill() {\\n memmove(begin(ibuf), iptr, iend - iptr);\\n iend -= iptr - begin(ibuf);\\n iptr = begin(ibuf);\\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\\n *iend = '\\\\0';\\n }\\n\\n template <class T, class T2 = remove_cvref_t<T>>\\n void print(T&& val) {\\n if (end(obuf) - optr < 64)\\n flush();\\n\\n if constexpr (is_same_v<T2, char>)\\n *optr++ = val;\\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\\n return print(int(val));\\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\\n if (val < 0)\\n *optr++ = '-';\\n using U = make_unsigned_t<T2>;\\n return print(U(val < 0 ? -U(val) : U(val)));\\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\\n T2 val2 = val;\\n array<char, 64> tmp;\\n char* tptr = end(tmp);\\n while (val2 >= 10'000)\\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\\n memcpy(optr, &DIGITS[val2][4 - d], d);\\n memcpy(optr + d, tptr, end(tmp) - tptr);\\n optr += d + int(end(tmp) - tptr);\\n } else if constexpr (is_floating_point_v<T2>)\\n optr += sprintf(optr, \\\"%.30Lf\\\", (long double)val);\\n else if constexpr (is_convertible_v<T, string_view>) {\\n string_view sv(val);\\n if (sz(sv) + 1 <= end(obuf) - optr)\\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\\n else {\\n flush();\\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\\n }\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\\n return print(decltype(T2::mod())(val));\\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\\n else {\\n trav(item, val)\\n print(item);\\n return;\\n }\\n *optr++ = ' ';\\n }\\n\\n template <class T>\\n void read(T& val) {\\n auto skip_ws = [] {\\n do {\\n for (; iptr != iend && *iptr <= ' '; ++iptr);\\n if (iend - iptr < 64)\\n refill();\\n } while (*iptr <= ' ');\\n };\\n auto read_other = [&](auto other) {\\n read(other);\\n return other;\\n };\\n\\n if constexpr (is_same_v<T, char>)\\n skip_ws(), val = *iptr++;\\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\\n val = bool(read_other(uint8_t()));\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\\n val = T(read_other(ll()));\\n } else if constexpr (is_integral_v<T>) {\\n skip_ws();\\n if (is_signed_v<T> && *iptr == '-')\\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\\n else\\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\\n } else if constexpr (is_floating_point_v<T>)\\n skip_ws(), val = T(strtold(iptr, &iptr));\\n else if constexpr (is_same_v<T, string>) {\\n skip_ws();\\n val.clear();\\n do {\\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\\n val.append(iptr, after);\\n if ((iptr = after) != iend)\\n break;\\n refill();\\n } while (iptr != iend);\\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\\n apply([](auto&... items) { (read(items), ...); }, val);\\n else\\n trav(item, val)\\n read(item);\\n }\\n}\\n\\nusing cp_lib_io::flush;\\n\\ntemplate <class... Args>\\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\\n\\ntemplate <class... Args>\\nvoid println(Args&&... args) {\\n if (sizeof...(Args))\\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\\\n';\\n else\\n print('\\\\n'), --cp_lib_io::optr;\\n}\\n\\ntemplate <class... Args>\\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\\n// #include \\\"cp-lib/graph/lca.hpp\\\"\\n\\ntemplate <class A, class M>\\nstruct NewGraph {\\n A& adj;\\n int n;\\n M map;\\n\\n using Mapped = decltype(declval<M>()(*begin(declval<A>()[0])));\\n\\n NewGraph(A& adj_, M map_) : adj(adj_), n(sz(adj)), map(move(map_)) {}\\n explicit NewGraph(A& adj_) : NewGraph(adj_, identity()) {}\\n};\\n\\ntemplate <class A> NewGraph(A&) -> NewGraph<A, identity>;\\n\\ntemplate <class G, class OnComp>\\nvoid biconnected_components(G&& graph, OnComp&& on_comp) {\\n auto [adj, n, map] = NewGraph(forward<G>(graph));\\n auto normalize = [&](auto mapped) {\\n if constexpr(is_convertible_v<int, decltype(mapped)>)\\n return pair(int(mapped), 0);\\n else\\n return mapped;\\n };\\n vector idx(n, INF);\\n vector<pair<int, decltype(begin(adj[0]))>> stack;\\n\\n auto dfs = [&, &adj = adj, &map = map](int v, pair<int, int> pe, auto&& self) -> int {\\n int up = idx[v] = sz(stack), cnt = 0;\\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\\n auto [v2, e] = normalize(map(*it));\\n if (pair(v2, e) == pe)\\n continue;\\n up = min(up, idx[v2]);\\n if (idx[v2] == INF || idx[v2] < idx[v])\\n stack.emplace_back(v, it);\\n if (idx[v2] != INF)\\n continue;\\n\\n int up2 = self(v2, pair(v, e), self);\\n up = min(up, up2);\\n if (up2 >= idx[v]) {\\n auto cut_v = (pe.first == -1 && !cnt++ ? nullopt : optional(v));\\n on_comp(cut_v, begin(stack) + idx[v2] - 1, end(stack));\\n stack.resize(idx[v2] - 1);\\n }\\n }\\n return up;\\n };\\n\\n rep(i, n)\\n if (idx[i] == INF)\\n dfs(i, pair(-1, 0), dfs);\\n}\\n\\ntemplate <class G>\\nvector<vector<int>> block_vertex_tree(G&& graph) {\\n NewGraph g(forward<G>(graph));\\n vector adj(g.n, vector<int>());\\n biconnected_components(g, [&](auto, auto it, auto it_end) {\\n int vc = sz(adj);\\n adj.emplace_back();\\n for (; it != it_end; ++it)\\n for (int v : {it->first, g.map(*it->second)})\\n if (!sz(adj[v]) || adj[v].back() != vc)\\n adj[v].push_back(vc), adj[vc].push_back(v);\\n });\\n return adj;\\n}\\n\\nint main() {\\n // int n, m; read(n, m);\\n // vector adj(n, vector<pair<int, int>>());\\n // rep(i, m) {\\n // int u, v; read(u, v);\\n // adj[u].emplace_back(v, i);\\n // adj[v].emplace_back(u, i);\\n // }\\n\\n // vector<vector<int>> bicomps;\\n // biconnected_components(adj, [&](auto, auto it, auto it_end) {\\n // auto& comp = bicomps.emplace_back();\\n // for (; it != it_end; ++it)\\n // comp.push_back(it->second->second);\\n // });\\n\\n // println(sz(bicomps));\\n // trav(comp, bicomps)\\n // println(sz(comp), comp);\\n\\n\\n // int n, m; read(n, m);\\n // vector adj(n, vector<int>());\\n // rep(_, m) {\\n // int u, v; read(u, v);\\n // adj[u].push_back(v);\\n // adj[v].push_back(u);\\n // }\\n\\n // set<int> cut_vertices;\\n // biconnected_components(adj, [&](auto cut_v, auto, auto) {\\n // if (cut_v)\\n // cut_vertices.emplace(*cut_v);\\n // });\\n\\n // trav(v, cut_vertices)\\n // println(v);\\n\\n\\n int n, m; read(n, m);\\n vector w(n, 0);\\n read(w);\\n vector adj(n, vector<int>());\\n rep(_, m) {\\n int u, v; read(u, v); --u, --v;\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n\\n auto bvt = block_vertex_tree(adj);\\n int nt = sz(bvt);\\n vector wsum(nt, 0ll);\\n copy(all(w), begin(wsum));\\n auto dfs = [&](int v, int p, auto&& self) -> void {\\n trav(v2, bvt[v])\\n if (v2 != p)\\n self(v2, v, self), wsum[v] += wsum[v2];\\n };\\n dfs(0, -1, dfs);\\n\\n rep(i, n) {\\n if (sz(bvt[i]) == 1) {\\n println(wsum[0] - w[i]);\\n continue;\\n }\\n\\n ll mx = wsum[0] - wsum[i];\\n trav(v, bvt[i])\\n if (wsum[v] < wsum[i])\\n mx = max(mx, wsum[v]);\\n println(mx);\\n }\\n\\n\\n // int n, m; read(n, m);\\n // vector adj(n, vector<int>());\\n // rep(_, m) {\\n // int u, v; read(u, v); --u, --v;\\n // adj[u].push_back(v);\\n // adj[v].push_back(u);\\n // }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 24228,\n \"score_of_the_acc\": -0.4554,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3022_6317771\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"fast-math\\\")\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n# include <dbg.h>\\n#else\\n# define dbg(...) do {} while (0)\\n#endif\\n\\n#define cp_lib_4th(_1, _2, _3, x, ...) x\\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\\n#define all(a) ::begin(a),::end(a)\\n#define trav(a, b) for (auto&& a : (b))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\\n\\n\\n#ifdef CP_LIB_DEBUG\\n#define cp_lib_assert(expr) \\\\\\n do { if (!(expr)) { \\\\\\n ::cerr << \\\"assertion failed: \\\" << #expr << \\\" (\\\" << __FILE__ << ':' << __LINE__ << \\\")\\\\n\\\"; \\\\\\n ::abort(); \\\\\\n } } while (0)\\n#else\\n#define cp_lib_assert(expr)\\n#endif\\n\\n\\n#if __cplusplus < 202002L\\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\\n#endif\\n#if __cpp_lib_remove_cvref < 201711L\\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\\n#endif\\n\\nnamespace cp_lib_type_meta {\\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\\n template <class T, class = void> constexpr bool is_tuple_like = false;\\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\\n}\\n\\n\\nnamespace cp_lib_modint { struct ModIntTag {}; }\\n#include <unistd.h>\\n\\nnamespace cp_lib_io {\\n constexpr int BUF_SIZE = 1 << 20;\\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\\n array<array<char, 4>, 10'000> digits{};\\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\\n rep(j, 10'000)\\n digits[j][i] = char('0' + j / d % 10);\\n return digits;\\n }();\\n array<char, BUF_SIZE> ibuf, obuf;\\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\\n\\n template <class T> constexpr bool is_std_array = false;\\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\\n\\n void flush() {\\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\\n optr = begin(obuf);\\n }\\n int _flush_atexit = []{ atexit(flush); return 0; }();\\n\\n void refill() {\\n memmove(begin(ibuf), iptr, iend - iptr);\\n iend -= iptr - begin(ibuf);\\n iptr = begin(ibuf);\\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\\n *iend = '\\\\0';\\n }\\n\\n template <class T, class T2 = remove_cvref_t<T>>\\n void print(T&& val) {\\n if (end(obuf) - optr < 64)\\n flush();\\n\\n if constexpr (is_same_v<T2, char>)\\n *optr++ = val;\\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\\n return print(int(val));\\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\\n if (val < 0)\\n *optr++ = '-';\\n using U = make_unsigned_t<T2>;\\n return print(U(val < 0 ? -U(val) : U(val)));\\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\\n T2 val2 = val;\\n array<char, 64> tmp;\\n char* tptr = end(tmp);\\n while (val2 >= 10'000)\\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\\n memcpy(optr, &DIGITS[val2][4 - d], d);\\n memcpy(optr + d, tptr, end(tmp) - tptr);\\n optr += d + int(end(tmp) - tptr);\\n } else if constexpr (is_floating_point_v<T2>)\\n optr += sprintf(optr, \\\"%.30Lf\\\", (long double)val);\\n else if constexpr (is_convertible_v<T, string_view>) {\\n string_view sv(val);\\n if (sz(sv) + 1 <= end(obuf) - optr)\\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\\n else {\\n flush();\\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\\n }\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\\n return print(decltype(T2::mod())(val));\\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\\n else {\\n trav(item, val)\\n print(item);\\n return;\\n }\\n *optr++ = ' ';\\n }\\n\\n template <class T>\\n void read(T& val) {\\n auto skip_ws = [] {\\n do {\\n for (; iptr != iend && *iptr <= ' '; ++iptr);\\n if (iend - iptr < 64)\\n refill();\\n } while (*iptr <= ' ');\\n };\\n auto read_other = [&](auto other) {\\n read(other);\\n return other;\\n };\\n\\n if constexpr (is_same_v<T, char>)\\n skip_ws(), val = *iptr++;\\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\\n val = bool(read_other(uint8_t()));\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\\n val = T(read_other(ll()));\\n } else if constexpr (is_integral_v<T>) {\\n skip_ws();\\n if (is_signed_v<T> && *iptr == '-')\\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\\n else\\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\\n } else if constexpr (is_floating_point_v<T>)\\n skip_ws(), val = T(strtold(iptr, &iptr));\\n else if constexpr (is_same_v<T, string>) {\\n skip_ws();\\n val.clear();\\n do {\\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\\n val.append(iptr, after);\\n if ((iptr = after) != iend)\\n break;\\n refill();\\n } while (iptr != iend);\\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\\n apply([](auto&... items) { (read(items), ...); }, val);\\n else\\n trav(item, val)\\n read(item);\\n }\\n}\\n\\nusing cp_lib_io::flush;\\n\\ntemplate <class... Args>\\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\\n\\ntemplate <class... Args>\\nvoid println(Args&&... args) {\\n if (sizeof...(Args))\\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\\\n';\\n else\\n print('\\\\n'), --cp_lib_io::optr;\\n}\\n\\ntemplate <class... Args>\\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\\n\\n\\ntemplate <class A, class M>\\nstruct Graph {\\n const A& adj;\\n int n;\\n M map;\\n\\n Graph(const A& adj_, int n_, M map_) : adj(adj_), n(n_), map(move(map_)) {}\\n Graph(const A& adj_, M map_) : Graph(adj_, sz(adj_), move(map_)) {}\\n Graph(const A& adj_, int n_) : Graph(adj_, n_, identity()) {}\\n explicit Graph(const A& adj_) : Graph(adj_, identity()) {}\\n};\\n\\ntemplate <class A> Graph(const A&, int) -> Graph<A, identity>;\\ntemplate <class A> Graph(const A&) -> Graph<A, identity>;\\n\\n\\n\\ntemplate <class T> constexpr inline bool is_pow2(T n) { return n && !(n & (n - 1)); }\\ntemplate <class T> constexpr inline int floor_log2(T n) { return n ? 63 - __builtin_clzll(n) : 0; }\\ntemplate <class T> constexpr inline int ceil_log2(T n) { return n ? floor_log2(n) + !is_pow2(n) : 0; }\\n\\nnamespace cp_lib_rmq {\\n template <class T, bool Max> T minmax(T a, T b) { return (a < b) ^ Max ? a : b; }\\n}\\n\\ntemplate <class T, T (*Combine)(T, T)>\\nstruct SparseTable {\\n vector<vector<T>> d = {};\\n\\n SparseTable() = default;\\n explicit SparseTable(const vector<T>& v) {\\n int n = sz(v), k = floor_log2(n);\\n d.assign(k + 1, v);\\n rep(i, k) rep(j, n)\\n d[i + 1][j] = Combine(d[i][j], d[i][min(j + (1 << i), n - 1)]);\\n }\\n\\n // Aggregate for [l, r)\\n T query(int l, int r) const {\\n int k = floor_log2(r - l);\\n return Combine(d[k][l], d[k][r - (1 << k)]);\\n }\\n};\\n\\ntemplate <class T>\\nusing Rmq = SparseTable<T, cp_lib_rmq::minmax<T, false>>;\\ntemplate <class T>\\nusing Rmaxq = SparseTable<T, cp_lib_rmq::minmax<T, true>>;\\n\\nstruct LowestCommonAncestor {\\n vector<int> time, euler;\\n Rmq<int> rmq;\\n\\n template <class G, class = enable_if_t<!is_same_v<LowestCommonAncestor, remove_cvref_t<G>>>>\\n LowestCommonAncestor(G&& graph, int root = 0) {\\n auto [adj, n, to] = Graph(forward<G>(graph));\\n if (!n) return;\\n time = vector(n, -1);\\n vector<int> d;\\n auto dfs = [&, t=1, &adj=adj, &to=to](int v, int p, int tp, auto&& self) mutable -> void {\\n euler.push_back(p);\\n d.push_back(tp);\\n time[v] = t++;\\n trav(e, adj[v])\\n if (to(e) != p)\\n self(to(e), v, time[v], self);\\n };\\n dfs(root, -1, 0, dfs);\\n rep(i, n)\\n if (time[i] == -1)\\n dfs(i, -1, 0, dfs);\\n rmq = Rmq<int>(d);\\n }\\n\\n int lca(int u, int v) const {\\n if (u == v) return u;\\n auto [l, r] = minmax(time[u], time[v]);\\n return euler[rmq.query(l, r)];\\n }\\n\\n bool on_path(int v, pair<int, int> path) const {\\n auto [a, b] = path;\\n auto av = lca(a, v), bv = lca(b, v), ab = lca(a, b);\\n return av != -1 && bv != -1 && ab != -1 && minmax(av, bv) == minmax(v, ab);\\n }\\n\\n bool is_ancestor(int u, int v) const { return lca(u, v) == u; }\\n};\\n\\ntemplate <class G, class OnCut, class OnComp>\\nvoid biconnected_components(G&& graph, OnCut&& on_cut, OnComp&& on_comp) {\\n auto [adj, n, map] = Graph(forward<G>(graph));\\n vector idx(n, INF);\\n vector<pair<int, decltype(begin(adj[0]))>> stack;\\n\\n auto make_component = [&](int rem) {\\n on_comp(begin(stack) + rem, end(stack));\\n stack.resize(rem);\\n };\\n auto dfs = [&, &adj=adj, &map=map](int v, auto pe, int root, auto&& self) -> int {\\n int up = idx[v] = sz(stack);\\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\\n auto [v2, e] = map(*it);\\n if (optional(e) == pe)\\n continue;\\n up = min(up, idx[v2]);\\n if (idx[v2] == INF || idx[v2] < idx[v])\\n stack.emplace_back(v, it);\\n if (idx[v2] != INF)\\n continue;\\n\\n int up2 = self(v2, optional(e), 0, self);\\n up = min(up, up2);\\n if (up2 >= idx[v]) {\\n make_component(idx[v2] - 1);\\n if (--root < 1)\\n on_cut(v);\\n }\\n }\\n return up;\\n };\\n\\n rep(i, n)\\n if (idx[i] == INF)\\n dfs(i, nullopt, 2, dfs);\\n}\\n\\nstruct BlockVertexTree {\\n vector<vector<int>> adj;\\n\\n template <class G, class = enable_if_t<!is_same_v<BlockVertexTree, remove_cvref_t<G>>>>\\n explicit BlockVertexTree(G&& graph) {\\n Graph g(forward<G>(graph));\\n auto [_, n, map] = g;\\n adj.resize(n);\\n\\n biconnected_components(\\n g, [](auto) {},\\n [&, &map=map](auto it, auto it_end) {\\n int vc = sz(adj);\\n adj.emplace_back();\\n for (; it != it_end; ++it) {\\n auto [v2, _2] = map(*it->second);\\n for (int v : {it->first, v2})\\n if (!sz(adj[v]) || adj[v].back() != vc)\\n adj[v].push_back(vc), adj[vc].push_back(v);\\n }\\n });\\n }\\n\\n bool is_cut(int v) { return sz(adj[v]) == 1; }\\n};\\n\\nint main() {\\n // int n, m; read(n, m);\\n // vector adj(n, vector<pair<int, int>>());\\n // rep(i, m) {\\n // int u, v; read(u, v);\\n // adj[u].emplace_back(v, i);\\n // adj[v].emplace_back(u, i);\\n // }\\n\\n // vector<vector<int>> bicomps;\\n // biconnected_components(adj, [](auto&&...) {}, [&](auto it, auto it_end) {\\n // auto& comp = bicomps.emplace_back();\\n // for (; it != it_end; ++it)\\n // comp.push_back(it->second->second);\\n // });\\n\\n // println(sz(bicomps));\\n // trav(comp, bicomps)\\n // println(sz(comp), comp);\\n\\n // int n, m; read(n, m);\\n // vector adj(n, vector<pair<int, int>>());\\n // rep(i, m) {\\n // int u, v; read(u, v);\\n // adj[u].emplace_back(v, i);\\n // adj[v].emplace_back(u, i);\\n // }\\n\\n // vector is_cut(n, false);\\n // biconnected_components(adj, [&](int v) { is_cut[v] = true; }, [](auto&&...) {});\\n\\n // rep(i, n)\\n // if (is_cut[i])\\n // println(i);\\n\\n int n, m; read(n, m);\\n vector w(n, 0);\\n read(w);\\n vector adj(n, vector<pair<int, int>>());\\n rep(i, m) {\\n int u, v; read(u, v); --u, --v;\\n adj[u].emplace_back(v, i);\\n adj[v].emplace_back(u, i);\\n }\\n\\n BlockVertexTree bvt(adj);\\n int nt = sz(bvt.adj);\\n vector wsum(nt, 0ll);\\n copy(all(w), begin(wsum));\\n auto dfs = [&](int v, int p, auto&& self) -> void {\\n trav(v2, bvt.adj[v])\\n if (v2 != p)\\n self(v2, v, self), wsum[v] += wsum[v2];\\n };\\n dfs(0, -1, dfs);\\n\\n rep(i, n) {\\n if (bvt.is_cut(i)) {\\n println(wsum[0] - w[i]);\\n continue;\\n }\\n\\n ll mx = wsum[0] - wsum[i];\\n trav(v, bvt.adj[i])\\n if (wsum[v] < wsum[i])\\n mx = max(mx, wsum[v]);\\n println(mx);\\n }\\n\\n // int n, m; read(n, m);\\n // vector adj(n, vector<int>());\\n // rep(_, m) {\\n // int u, v; read(u, v); --u, --v;\\n // adj[u].push_back(v);\\n // adj[v].push_back(u);\\n // }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 24716,\n \"score_of_the_acc\": -0.5305,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3022_6313873\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"fast-math\\\")\\n\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n# include <dbg.h>\\n#else\\n# define dbg(...) do {} while (0)\\n#endif\\n\\n#define cp_lib_4th(_1, _2, _3, x, ...) x\\n#define cp_lib_rep(i, l, r) for (int i = (l); (i) < (r); ++(i))\\n#define cp_lib_rep0(i, r) cp_lib_rep(i, 0, r)\\n#define rep(...) cp_lib_4th(__VA_ARGS__, cp_lib_rep, cp_lib_rep0, _)(__VA_ARGS__)\\n#define cp_lib_repr(i, r, l, ...) for (int i = (r); (i) >= (l); --(i))\\n#define repr(...) cp_lib_repr(__VA_ARGS__, 0)\\n#define all(a) ::begin(a),::end(a)\\n#define trav(a, b) for (auto&& a : (b))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n[[maybe_unused]] static constexpr int INF = int(1e9 + 5);\\n[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;\\ntemplate <class C> int sz(const C& c) { return int(::size(c)); }\\n\\n\\n#ifdef CP_LIB_DEBUG\\n#define cp_lib_assert(expr) \\\\\\n do { if (!(expr)) { \\\\\\n ::cerr << \\\"assertion failed: \\\" << #expr << \\\" (\\\" << __FILE__ << ':' << __LINE__ << \\\")\\\\n\\\"; \\\\\\n ::abort(); \\\\\\n } } while (0)\\n#else\\n#define cp_lib_assert(expr)\\n#endif\\n\\n\\n#if __cplusplus < 202002L\\nstruct identity { template <class T> constexpr T&& operator()(T&& t) const noexcept { return forward<T>(t); }; };\\n#endif\\n#if __cpp_lib_remove_cvref < 201711L\\ntemplate <class T> using remove_cvref_t = remove_cv_t<remove_reference_t<T>>;\\n#endif\\n\\nnamespace cp_lib_type_meta {\\n struct NoOp { template <class... Args> constexpr void operator()(Args&&...) const noexcept {} };\\n template <class T, class = void> constexpr bool is_tuple_like = false;\\n template <class T> constexpr bool is_tuple_like<T, void_t<tuple_element_t<0, T>>> = true;\\n}\\n\\n\\nnamespace cp_lib_modint { struct ModIntTag {}; }\\n#include <unistd.h>\\n\\nnamespace cp_lib_io {\\n constexpr int BUF_SIZE = 1 << 20;\\n constexpr array<array<char, 4>, 10'000> DIGITS = []{\\n array<array<char, 4>, 10'000> digits{};\\n for (int i = 3, d = 1; i >= 0; --i, d *= 10)\\n rep(j, 10'000)\\n digits[j][i] = char('0' + j / d % 10);\\n return digits;\\n }();\\n array<char, BUF_SIZE> ibuf, obuf;\\n char *iptr = data(ibuf), *iend = iptr, *optr = data(obuf);\\n\\n template <class T> constexpr bool is_std_array = false;\\n template <class T, size_t I> constexpr bool is_std_array<array<T, I>> = true;\\n\\n void flush() {\\n for (auto* p = begin(obuf); p != optr; p += write(STDOUT_FILENO, p, optr - p));\\n optr = begin(obuf);\\n }\\n int _flush_atexit = []{ atexit(flush); return 0; }();\\n\\n void refill() {\\n memmove(begin(ibuf), iptr, iend - iptr);\\n iend -= iptr - begin(ibuf);\\n iptr = begin(ibuf);\\n iend += read(STDIN_FILENO, iend, end(ibuf) - 1 - iend);\\n *iend = '\\\\0';\\n }\\n\\n template <class T, class T2 = remove_cvref_t<T>>\\n void print(T&& val) {\\n if (end(obuf) - optr < 64)\\n flush();\\n\\n if constexpr (is_same_v<T2, char>)\\n *optr++ = val;\\n else if constexpr (is_same_v<T2, bool> || is_same_v<T2, vector<bool>::reference>)\\n return print(int(val));\\n else if constexpr (is_integral_v<T2> && is_signed_v<T2>) {\\n if (val < 0)\\n *optr++ = '-';\\n using U = make_unsigned_t<T2>;\\n return print(U(val < 0 ? -U(val) : U(val)));\\n } else if constexpr (is_integral_v<T2> && is_unsigned_v<T2>) {\\n T2 val2 = val;\\n array<char, 64> tmp;\\n char* tptr = end(tmp);\\n while (val2 >= 10'000)\\n tptr -= 4, memcpy(tptr, &DIGITS[val2 % 10'000][0], 4), val2 /= T2(10'000);\\n int d = (val2 >= 100 ? (val2 >= 1000 ? 4 : 3) : (val2 >= 10 ? 2 : 1));\\n memcpy(optr, &DIGITS[val2][4 - d], d);\\n memcpy(optr + d, tptr, end(tmp) - tptr);\\n optr += d + int(end(tmp) - tptr);\\n } else if constexpr (is_floating_point_v<T2>)\\n optr += sprintf(optr, \\\"%.30Lf\\\", (long double)val);\\n else if constexpr (is_convertible_v<T, string_view>) {\\n string_view sv(val);\\n if (sz(sv) + 1 <= end(obuf) - optr)\\n memcpy(optr, data(sv), sz(sv)), optr += sz(sv);\\n else {\\n flush();\\n for (auto *p = data(sv), *pe = p + sz(sv); p != pe; p += write(STDOUT_FILENO, p, pe - p));\\n }\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T2>)\\n return print(decltype(T2::mod())(val));\\n else if constexpr (cp_lib_type_meta::is_tuple_like<T2> && !is_std_array<T2>)\\n return apply([](auto&&... items) { (print(items), ...); }, forward<T>(val));\\n else {\\n trav(item, val)\\n print(item);\\n return;\\n }\\n *optr++ = ' ';\\n }\\n\\n template <class T>\\n void read(T& val) {\\n auto skip_ws = [] {\\n do {\\n for (; iptr != iend && *iptr <= ' '; ++iptr);\\n if (iend - iptr < 64)\\n refill();\\n } while (*iptr <= ' ');\\n };\\n auto read_other = [&](auto other) {\\n read(other);\\n return other;\\n };\\n\\n if constexpr (is_same_v<T, char>)\\n skip_ws(), val = *iptr++;\\n else if constexpr (is_same_v<T, bool> || is_same_v<T, vector<bool>::reference>) {\\n val = bool(read_other(uint8_t()));\\n } else if constexpr (is_base_of_v<cp_lib_modint::ModIntTag, T>) {\\n val = T(read_other(ll()));\\n } else if constexpr (is_integral_v<T>) {\\n skip_ws();\\n if (is_signed_v<T> && *iptr == '-')\\n ++iptr, val = T(-read_other(make_unsigned_t<T>()));\\n else\\n for (val = 0; iptr != iend && *iptr > ' '; val = T(10 * val + (*iptr++ & 15)));\\n } else if constexpr (is_floating_point_v<T>)\\n skip_ws(), val = T(strtold(iptr, &iptr));\\n else if constexpr (is_same_v<T, string>) {\\n skip_ws();\\n val.clear();\\n do {\\n auto* after = find_if(iptr, iend, [](char c) { return c <= ' '; });\\n val.append(iptr, after);\\n if ((iptr = after) != iend)\\n break;\\n refill();\\n } while (iptr != iend);\\n } else if constexpr (cp_lib_type_meta::is_tuple_like<T> && !is_std_array<T>)\\n apply([](auto&... items) { (read(items), ...); }, val);\\n else\\n trav(item, val)\\n read(item);\\n }\\n}\\n\\nusing cp_lib_io::flush;\\n\\ntemplate <class... Args>\\nvoid print(Args&&... args) { (cp_lib_io::print(forward<Args>(args)), ...); }\\n\\ntemplate <class... Args>\\nvoid println(Args&&... args) {\\n if (sizeof...(Args))\\n (cp_lib_io::print(forward<Args>(args)), ...), *(cp_lib_io::optr - 1) = '\\\\n';\\n else\\n print('\\\\n'), --cp_lib_io::optr;\\n}\\n\\ntemplate <class... Args>\\nvoid read(Args&... args) { (cp_lib_io::read(args), ...); }\\n\\n\\ntemplate <class A, class M>\\nstruct Graph {\\n const A& adj;\\n int n;\\n M map;\\n\\n Graph(const A& adj_, int n_, M map_) : adj(adj_), n(n_), map(move(map_)) {}\\n Graph(const A& adj_, M map_) : Graph(adj_, sz(adj_), move(map_)) {}\\n Graph(const A& adj_, int n_) : Graph(adj_, n_, identity()) {}\\n explicit Graph(const A& adj_) : Graph(adj_, identity()) {}\\n};\\n\\ntemplate <class A> Graph(const A&, int) -> Graph<A, identity>;\\ntemplate <class A> Graph(const A&) -> Graph<A, identity>;\\n\\ntemplate <class G, class OnCut, class OnComp>\\nvoid biconnected_components(G&& graph, OnCut&& on_cut, OnComp&& on_comp) {\\n auto [adj, n, map] = Graph(forward<G>(graph));\\n vector idx(n, INF);\\n vector<pair<int, decltype(begin(adj[0]))>> stack;\\n\\n auto make_component = [&](int rem) {\\n on_comp(begin(stack) + rem, end(stack));\\n stack.resize(rem);\\n };\\n auto dfs = [&, &adj=adj, &map=map](int v, auto pe, int root, auto&& self) -> int {\\n int up = idx[v] = sz(stack);\\n for (auto it = begin(adj[v]); it != end(adj[v]); ++it) {\\n auto [v2, e] = map(*it);\\n if (optional(e) == pe)\\n continue;\\n up = min(up, idx[v2]);\\n if (idx[v2] == INF || idx[v2] < idx[v])\\n stack.emplace_back(v, it);\\n if (idx[v2] != INF)\\n continue;\\n\\n int up2 = self(v2, optional(e), 0, self);\\n up = min(up, up2);\\n if (up2 >= idx[v]) {\\n if (root == 2)\\n --root;\\n else if (root == 1)\\n --root, on_cut(v), make_component(idx[v2] - 1), make_component(0);\\n else\\n on_cut(v), make_component(idx[v2] - 1);\\n }\\n }\\n return up;\\n };\\n\\n rep(i, n) {\\n if (idx[i] != INF)\\n continue;\\n dfs(i, nullopt, 2, dfs);\\n if (sz(stack))\\n make_component(0);\\n }\\n}\\n\\nstruct BlockVertexTree {\\n vector<vector<int>> adj;\\n\\n template <class G, class = enable_if_t<!is_same_v<BlockVertexTree, remove_cvref_t<G>>>>\\n explicit BlockVertexTree(G&& graph) {\\n Graph g(forward<G>(graph));\\n auto [_, n, map] = g;\\n adj.resize(n);\\n\\n biconnected_components(\\n g, [](auto) {},\\n [&, &map = map](auto it, auto it_end) {\\n int vc = sz(adj);\\n adj.emplace_back();\\n for (; it != it_end; ++it) {\\n auto [v2, _2] = map(*it->second);\\n for (int v : {it->first, v2})\\n if (!sz(adj[v]) || adj[v].back() != vc)\\n adj[v].push_back(vc), adj[vc].push_back(v);\\n }\\n });\\n }\\n\\n bool is_cut(int v) { return sz(adj[v]) == 1; }\\n};\\n\\nint main() {\\n // int n, m; read(n, m);\\n // vector adj(n, vector<pair<int, int>>());\\n // rep(i, m) {\\n // int u, v; read(u, v);\\n // adj[u].emplace_back(v, i);\\n // adj[v].emplace_back(u, i);\\n // }\\n\\n // vector<vector<int>> bicomps;\\n // biconnected_components(adj, [](auto&&...) {}, [&](auto it, auto it_end) {\\n // auto& comp = bicomps.emplace_back();\\n // for (; it != it_end; ++it)\\n // comp.push_back(it->second->second);\\n // });\\n\\n // println(sz(bicomps));\\n // trav(comp, bicomps)\\n // println(sz(comp), comp);\\n\\n // int n, m; read(n, m);\\n // vector adj(n, vector<pair<int, int>>());\\n // rep(i, m) {\\n // int u, v; read(u, v);\\n // adj[u].emplace_back(v, i);\\n // adj[v].emplace_back(u, i);\\n // }\\n\\n // vector is_cut(n, false);\\n // biconnected_components(adj, [&](int v) { is_cut[v] = true; }, [](auto&&...) {});\\n\\n // rep(i, n)\\n // if (is_cut[i])\\n // println(i);\\n\\n int n, m; read(n, m);\\n vector w(n, 0);\\n read(w);\\n vector adj(n, vector<pair<int, int>>());\\n rep(i, m) {\\n int u, v; read(u, v); --u, --v;\\n adj[u].emplace_back(v, i);\\n adj[v].emplace_back(u, i);\\n }\\n\\n BlockVertexTree bvt(adj);\\n int nt = sz(bvt.adj);\\n vector wsum(nt, 0ll);\\n copy(all(w), begin(wsum));\\n auto dfs = [&](int v, int p, auto&& self) -> void {\\n trav(v2, bvt.adj[v])\\n if (v2 != p)\\n self(v2, v, self), wsum[v] += wsum[v2];\\n };\\n dfs(0, -1, dfs);\\n\\n rep(i, n) {\\n if (bvt.is_cut(i)) {\\n println(wsum[0] - w[i]);\\n continue;\\n }\\n\\n ll mx = wsum[0] - wsum[i];\\n trav(v, bvt.adj[i])\\n if (wsum[v] < wsum[i])\\n mx = max(mx, wsum[v]);\\n println(mx);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 24644,\n \"score_of_the_acc\": -0.4661,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3022_5994642\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef long long ll;\\nusing namespace std;\\n#define inf 0x3f3f3f3f\\n\\nconst int N = 1E5+100;\\nint low[N],dfn[N];\\nint val[N],tot[N];\\nint p = 0;\\nint n,m;\\nint st[N],nxt[N<<1],to[N<<1],e;\\nint pre[N];\\nvoid addEdge(int u,int v){\\n e++;nxt[e] = st[u];st[u] = e;to[e] = v;\\n e++;nxt[e] = st[v];st[v] = e;to[e] = u;\\n}\\nvoid init(){\\n memset(st,-1,sizeof(st));\\n memset(nxt,-1,sizeof(nxt));\\n}\\nvector<int> res[N];\\nvoid tarjan(int u,int fa){\\n low[u] = dfn[u] = ++p;\\n tot[u] = val[u];\\n pre[u] = fa;\\n for(int i = st[u];i!= -1;i = nxt[i]){\\n int v = to[i];\\n if(!dfn[v]){\\n res[u].push_back(v);\\n tarjan(v,u);\\n tot[u]+=tot[v];\\n low[u] = min(low[u],low[v]);\\n }else if(v != fa){\\n low[u] = min(low[u],dfn[v]);\\n }\\n }\\n}\\n\\nsigned main(void){\\n init();\\n cin>>n>>m;\\n for(int i = 1;i<=n;i++){\\n scanf(\\\"%lld\\\",&val[i]);\\n }\\n int u,v;\\n for(int i = 0;i<m;i++){\\n scanf(\\\"%lld%lld\\\",&u,&v);\\n addEdge(u,v);\\n }\\n for(int i = 1;i<=n;i++){\\n if(!dfn[i]){tarjan(i,0);}\\n }\\n for(int i= 1;i<=n;i++){\\n int ans = 0;\\n int cur = tot[1]-tot[i];\\n int nm = res[i].size();\\n for(int j = 0;j<nm;j++){\\n v = res[i][j];\\n if(low[v]<dfn[i]){\\n cur+=tot[v];\\n }else{\\n ans = max(ans,tot[v]);\\n }\\n }\\n ans = max(ans,cur);\\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 16000,\n \"score_of_the_acc\": -0.2433,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3022_5701738\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\nvector<int> G[SIZE],children[SIZE];\\nint N;\\nbool visited[SIZE],is_art[SIZE];\\nint visited_order[SIZE],parent[SIZE],lowest[SIZE],number;\\nll W[SIZE],dp[SIZE];\\n\\n\\nvoid dfs(int current_node,int pre_node){\\n\\tvisited_order[current_node] = lowest[current_node] = number; //訪問順を記録\\n\\tnumber++;\\n\\n\\tvisited[current_node] = true;\\n\\tdp[current_node] = W[current_node];\\n\\n\\tint next;\\n\\n\\tfor(int i = 0; i < G[current_node].size(); i++){\\n\\t\\tnext = G[current_node][i];\\n\\t\\tif(!visited[next]){\\n\\t\\t\\tparent[next] = current_node;\\n\\t\\t\\tchildren[current_node].push_back(next);\\n\\n\\t\\t\\tdfs(next,current_node);\\n\\t\\t\\tdp[current_node] += dp[next];\\n\\n\\t\\t\\tlowest[current_node] = min(lowest[current_node],lowest[next]); //ボトムアップ的に、lowestが求まる\\n\\t\\t}else if(visited[next] == true && next != pre_node){ //dfsTreeを遡る場合\\n\\t\\t\\tlowest[current_node] = min(lowest[current_node],visited_order[next]);\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid art_points(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t\\tis_art[i] = false;\\n\\t}\\n\\n\\tnumber = 1;\\n\\tdfs(0,-1);\\n\\n\\tint tmp_parent,root_num = 0;\\n\\n\\tvector<int> V;\\n\\n\\tfor(int i = 1; i < N; i++){\\n\\t\\ttmp_parent = parent[i];\\n\\t\\tif(tmp_parent == 0){\\n\\t\\t\\troot_num++;\\n\\t\\t}else if(visited_order[tmp_parent] <= lowest[i]){\\n\\t\\t\\tV.push_back(tmp_parent);\\n\\t\\t}\\n\\t}\\n\\tif(root_num >= 2){\\n\\t\\tV.push_back(0);\\n\\t}\\n\\tsort(V.begin(),V.end());\\n\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\n\\t\\tis_art[V[i]] = true;\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tint E;\\n\\n\\tscanf(\\\"%d %d\\\",&N,&E);\\n\\n\\tll SUM = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&W[i]);\\n\\t\\tSUM += W[i];\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int i = 0; i < E; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tart_points();\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tif(!is_art[i]){\\n\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\",SUM-W[i]);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tll ans = 0;\\n\\n\\t\\tif(i == 0){\\n\\n\\t\\t\\tfor(int k = 0; k < G[i].size(); k++){\\n\\n\\t\\t\\t\\tans = max(ans,dp[G[i][k]]);\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tll sum_P = SUM-dp[i];\\n\\n\\t\\t\\tfor(int k = 0; k < children[i].size(); k++){\\n\\n\\t\\t\\t\\tint child = children[i][k];\\n\\n\\t\\t\\t\\tif(lowest[child] < visited_order[i]){ //親と連結している子\\n\\n\\t\\t\\t\\t\\tsum_P += dp[child];\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tans = max(ans,dp[child]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tans = max(ans,sum_P);\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 15984,\n \"score_of_the_acc\": -0.4304,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3022_5693162\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100000\\n\\n\\nint N,E;\\nbool visited[SIZE],is_art_point[SIZE];\\nint visited_order[SIZE],parent[SIZE],lowest[SIZE],number;\\nll W[SIZE],dp[SIZE];\\nvector<int> G[SIZE],children[SIZE];\\n\\n\\nvoid dfs(int current_node,int pre_node){\\n\\tvisited_order[current_node] = lowest[current_node] = number; //訪問順を記録\\n\\tnumber++;\\n\\n\\tvisited[current_node] = true;\\n\\tdp[current_node] = W[current_node];\\n\\n\\tint next;\\n\\n\\tfor(int i = 0; i < G[current_node].size(); i++){\\n\\t\\tnext = G[current_node][i];\\n\\t\\tif(!visited[next]){\\n\\t\\t\\tparent[next] = current_node;\\n\\t\\t\\tdfs(next,current_node);\\n\\n\\t\\t\\tdp[current_node] += dp[next];\\n\\t\\t\\tchildren[current_node].push_back(next);\\n\\n\\t\\t\\tlowest[current_node] = min(lowest[current_node],lowest[next]); //ボトムアップ的に、lowestが求まる\\n\\t\\t}else if(visited[next] == true && next != pre_node){ //dfsTreeを遡る場合\\n\\t\\t\\tlowest[current_node] = min(lowest[current_node],visited_order[next]);\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid art_points(){\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t\\tis_art_point[i] = false;\\n\\t\\tdp[i] = 0;\\n\\t}\\n\\n\\tnumber = 1;\\n\\tdfs(0,-1);\\n\\n\\tint tmp_parent,root_num = 0;\\n\\n\\tvector<int> V;\\n\\n\\tfor(int i = 1; i < N; i++){\\n\\t\\ttmp_parent = parent[i];\\n\\t\\tif(tmp_parent == 0){\\n\\t\\t\\troot_num++;\\n\\t\\t}else if(visited_order[tmp_parent] <= lowest[i]){\\n\\t\\t\\tV.push_back(tmp_parent);\\n\\t\\t}\\n\\t}\\n\\tif(root_num >= 2){\\n\\t\\tV.push_back(0);\\n\\t}\\n\\tsort(V.begin(),V.end());\\n\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\t//printf(\\\"%d\\\\n\\\",V[i]);\\n\\t\\tis_art_point[V[i]] = true;\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&E);\\n\\n\\tll sum = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&W[i]);\\n\\t\\tsum += W[i];\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int i = 0; i < E; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tart_points();\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tif(!is_art_point[i]){\\n\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\",sum-W[i]);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tll ans = 0;\\n\\n\\t\\tif(i == 0){\\n\\n\\t\\t\\tfor(int k = 0; k < children[i].size(); k++){\\n\\n\\t\\t\\t\\tint child = children[i][k];\\n\\t\\t\\t\\tans = max(ans,dp[child]);\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tll sum_P = sum-dp[i];\\n\\n\\t\\t\\tfor(int k = 0; k < children[i].size(); k++){\\n\\n\\t\\t\\t\\tint child = children[i][k];\\n\\t\\t\\t\\tif(lowest[child] < visited_order[i]){ //親の成分と連結している子成分\\n\\n\\t\\t\\t\\t\\tsum_P += dp[child];\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tans = max(ans,dp[child]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tans = max(ans,sum_P);\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 15996,\n \"score_of_the_acc\": -0.4307,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1872,"cells":{"group_id":{"kind":"string","value":"aoj_3031_cpp"},"problem_description":{"kind":"string","value":"Problem F: Ghost Legs\nProblem\n縦線が３本のあみだくじが$N$個ある。\nどの線からスタートしてもスタートした線で終わるあみだくじを良いあみだくじとする。\nあみだくじを１つ以上選んで縦に自由な順序でつなぐことができる。\n良いあみだくじを作ることができるのであれば\"yes\"、そうでなければ\"no\"を出力せよ。\n$i$番目のあみだくじには横線が$w_i$本ある。\n$a_{i,j}$はあみだくじ$i$の上から$j$番目の横棒が中央の縦線から左右どちらに伸びているかを表し、\n$a_{i,j}$が0ならば左に、1ならば右に伸びていることを表す。\nInput\n入力は以下の形式で与えられる。\n$N$\n$w_1$ $a_{1,1}$ $a_{1,2}$ ... $a_{1,w_1}$\n$w_2$ $a_{2,1}$ $a_{2,2}$ ... $a_{2,w_2}$\n...\n$w_N$ $a_{N,1}$ $a_{N,2}$ ... $a_{N,w_N}$\n入力はすべて整数で与えられる。\n1行目に$N$が与えられる。\n続く$N$行に$w_i$と$w_i$個の$a_{i,j}$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N \\le 50$\n$0 \\le w_i \\le 100$\n$a_{i,j}$は0または1\nOutput\n良いあみだくじを作ることができるのであれば\"yes\"、そうでなければ\"no\"を出力する。\nSample Input 1\n3\n2 0 0\n1 1\n5 1 0 0 1 0\nSample Output 1\nyes\nSample Input 2\n2\n1 1\n1 0\nSample Output 2\nno"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3031_2848065","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\nbool operator<(const vector<int>&l, const vector<int>&r) {\n\tfor (int i = 0; i < l.size(); ++i) {\n\t\tif(l[i]<r[i])return true;\n\t\telse if(l[i]==r[i])continue;\n\t\telse return false;\n\t}\n\treturn false;\n}\n\nint main() {\n\tint N;cin>>N;\n\n\tmap<vector<int>,int>mp;\n\tmap<int,vector<int>>rev_mp;\n\tvector<int>v(3);\n\tiota(v.begin(),v.end(),0);\n\t{\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\trotate(v.begin(),v.begin()+1,v.end());\n\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\tmp[v]=i*2+j;\n\t\t\t\trev_mp[i*2+j]=v;\n\t\t\t\tswap(v[0],v[1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int>nums(6);\n\tfor (int i = 0; i < N; ++i) {\n\t\tvector<int>perms(3);\n\t\tiota(perms.begin(),perms.end(),0);\n\n\t\tint w;cin>>w;\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint k;cin>>k;\n\t\t\tswap(perms[k],perms[k+1]);\n\t\t}\n\t\tnums[mp[perms]]++;\n\t}\n\n\tfor (int i = 0; i < 6; ++i) {\n\t\tnums[i]=min(3,nums[i]);\n\t}\n\n\tset<pair<int,vector<int>>>memo;\n\tmemo.emplace(mp[vector<int>{0, 1, 2}],nums);\n\n\tqueue<pair<int,vector<int>>>que;\n\tque.emplace(mp[vector<int>{0, 1, 2}],nums);\n\n\tbool aok=false;\n\twhile (!que.empty()) {\n\t\tauto p(que.front());\n\t\tque.pop();\n\t\tint status_id=p.first;\n\t\tvector<int> rest=p.second;\n\n\t\tfor (int use_id = 0; use_id < 6; ++use_id) {\n\t\t\tif (rest[use_id]) {\n\t\t\t\trest[use_id]--;\n\n\t\t\t\tvector<int>now_status(rev_mp[status_id]);\n\t\t\t\tvector<int>next_status(now_status);\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tauto next_change(rev_mp[use_id]);\n\n\t\t\t\t\tnext_status[next_change[i]]= now_status[i];\n\n\t\t\t\t}\n\t\t\t\tint next_status_id = mp[next_status];\n\t\t\t\tif(next_status_id==4)aok=true;\n\t\t\t\tif (memo.find(make_pair(next_status_id, rest)) == memo.end()) {\n\t\t\t\t\tmemo.emplace(next_status_id, rest);\n\t\t\t\t\tque.emplace(next_status_id, rest);\n\t\t\t\t}\n\n\t\t\t\trest[use_id]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool ok=memo.find(make_pair(4,vector<int>(6,0)))!=memo.end();\n\tif(aok)cout<<\"yes\"<<endl;\n\telse cout<<\"no\"<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4480,"score_of_the_acc":-0.0867,"final_rank":1},{"submission_id":"aoj_3031_2848064","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\nbool operator<(const vector<int>&l, const vector<int>&r) {\n\tfor (int i = 0; i < l.size(); ++i) {\n\t\tif(l[i]<r[i])return true;\n\t\telse if(l[i]==r[i])continue;\n\t\telse return false;\n\t}\n\treturn false;\n}\n\nint main() {\n\tint N;cin>>N;\n\n\tmap<vector<int>,int>mp;\n\tmap<int,vector<int>>rev_mp;\n\tvector<int>v(3);\n\tiota(v.begin(),v.end(),0);\n\t{\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\trotate(v.begin(),v.begin()+1,v.end());\n\t\t\tfor (int j = 0; j < 2; ++j) {\n\t\t\t\tmp[v]=i*2+j;\n\t\t\t\trev_mp[i*2+j]=v;\n\t\t\t\tswap(v[0],v[1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int>nums(6);\n\tfor (int i = 0; i < N; ++i) {\n\t\tvector<int>perms(3);\n\t\tiota(perms.begin(),perms.end(),0);\n\n\t\tint w;cin>>w;\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tint k;cin>>k;\n\t\t\tswap(perms[k],perms[k+1]);\n\t\t}\n\t\tnums[mp[perms]]++;\n\t}\n\n\tfor (int i = 0; i < 6; ++i) {\n\t\tnums[i]=min(3,nums[i]);\n\t}\n\n\tset<pair<int,vector<int>>>memo;\n\tmemo.emplace(mp[vector<int>{0, 1, 2}],nums);\n\n\tqueue<pair<int,vector<int>>>que;\n\tque.emplace(mp[vector<int>{0, 1, 2}],nums);\n\n\tbool aok=false;\n\twhile (!que.empty()) {\n\t\tauto p(que.front());\n\t\tque.pop();\n\t\tint status_id=p.first;\n\t\tvector<int> rest=p.second;\n\n\t\tfor (int use_id = 0; use_id < 6; ++use_id) {\n\t\t\tif (rest[use_id]) {\n\t\t\t\trest[use_id]--;\n\n\t\t\t\tvector<int>now_status(rev_mp[status_id]);\n\t\t\t\tvector<int>next_status(now_status);\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tauto next_change(rev_mp[use_id]);\n\n\t\t\t\t\tnext_status[next_change[i]]= now_status[i];\n\n\t\t\t\t}\n\t\t\t\tint next_status_id = mp[next_status];\n\t\t\t\tif(next_status_id==0)aok=true;\n\t\t\t\tif (memo.find(make_pair(next_status_id, rest)) == memo.end()) {\n\t\t\t\t\tmemo.emplace(next_status_id, rest);\n\t\t\t\t\tque.emplace(next_status_id, rest);\n\t\t\t\t}\n\n\t\t\t\trest[use_id]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool ok=memo.find(make_pair(4,vector<int>(6,0)))!=memo.end();\n\tif(aok)cout<<\"yes\"<<endl;\n\telse cout<<\"no\"<<endl;\n\treturn 0;\n}","accuracy":0.3333333333333333,"time_ms":20,"memory_kb":4476,"score_of_the_acc":-0.0867,"final_rank":6},{"submission_id":"aoj_3031_2751542","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF 1.1e9\n#define LINF 1.1e18\n#define FOR(i,a,b) for (int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define pb push_back\n#define pf push_front\n#define fi first\n#define se second\n#define BIT(x,n) bitset<n>(x)\n#define PI 3.14159265358979323846\n\ntypedef long long ll;\ntypedef pair<ll,int> P;\ntypedef pair<ll,P> PP;\n\n//-----------------------------------------------------------------------------\n\nstruct S {\n\tint a,b,c;\n\tS() {}\n\tS(int a,int b,int c):a(a),b(b),c(c) {}\n\tbool operator<(const S s) const {\n\t\treturn a<s.a;\n\t}\n};\n\nint n;\nint to[50][3];\nset<S> st[2];\n\nvoid dfs(int idx,int a,int b,int c,int limit,bool used) {\n\tif(idx==limit) {\n\t\t//cout<<\"idx=\"<<idx<<\"(\"<<a<<','<<b<<','<<c<<')'<<endl;\n\t\tif(used) {\n\t\t\tif(limit==n) st[1].insert(S(a,b,c));\n\t\t\telse st[0].insert(S(a,b,c));\n\t\t}\n\t\treturn;\n\t}\n\tdfs(idx+1,a,b,c,limit,used);\n\tdfs(idx+1,to[idx][a],to[idx][b],to[idx][c],limit,true);\n}\n\nint f(S s,int i) {\n\tif(i==0) return s.a;\n\telse if(i==1) return s.b;\n\telse return s.c;\n}\n\nS conv(S s,S t) {\n\tS res;\n\tres.a=f(s,t.a),res.b=f(s,t.b),res.c=f(s,t.c);\n\treturn res;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tREP(i,50) REP(j,3) to[i][j]=j;\n\n\tcin>>n;\n\tREP(i,n) {\n\t\tint w,a;cin>>w;\n\t\tREP(j,w) {\n\t\t\tcin>>a;\n\t\t\tif(a==0) swap(to[i][0],to[i][1]);\n\t\t\telse swap(to[i][1],to[i][2]);\n\t\t}\n\t}\n\tdfs(0,0,1,2,n/2,false);dfs(n/2,0,1,2,n,false);\n\tfor(auto s:st[0]) {\n\t\t//cout<<s.a<<' '<<s.b<<' '<<s.c<<endl;\n\t\tif(s.a==0&&s.b==1&&s.c==2) {\n\t\t\tcout<<\"yes\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\t//cout<<\"after st1\"<<endl;\n\tfor(auto t:st[1]) {\n\t\t//cout<<t.a<<' '<<t.b<<' '<<t.c<<endl;\n\t\tif(t.a==0&&t.b==1&&t.c==2) {\n\t\t\tcout<<\"yes\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\t//cout<<\"after st2\"<<endl;\n\tfor(auto s:st[0]) {\n\t\tfor(auto t:st[1]) {\n\t\t\tS tmp=conv(s,t);\n\t\t\tif(tmp.a==0&&tmp.b==1&&tmp.c==2) {\n\t\t\t\tcout<<\"yes\"<<endl;\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<\"no\"<<endl;\n\n\treturn 0;\n}","accuracy":0.45454545454545453,"time_ms":50,"memory_kb":3156,"score_of_the_acc":-0.3333,"final_rank":3},{"submission_id":"aoj_3031_2751520","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define mod 1000000007\nusing ll = long long;\nint dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑\n\nvoid solve()\n{\n\tint N;\n\tcin >> N;\n\tvector<int>W(N);\n\t//using T = tuple<int, int, int>;\n\tvector<vector<int>> V(N);\n\n\tfor (int i = 0; i < N; i++)\n\t{\n\t\tcin >> W[i];\n\t\tvector<int> A(W[i]);\n\t\tfor (int j = 0; j < W[i]; j++)\n\t\t{\n\t\t\tcin >> A[j];\n\t\t}\n\t\tV[i].push_back(0);\n\t\tV[i].push_back(1);\n\t\tV[i].push_back(2);\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < W[i]; k++)\n\t\t\t{\n\t\t\t\tif (A[k] == 0)\n\t\t\t\t{\n\t\t\t\t\tif (V[i][j] == 1)V[i][j] = 0;\n\t\t\t\t\telse if (V[i][j] == 0)V[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (V[i][j] == 1)V[i][j] = 2;\n\t\t\t\t\telse if (V[i][j] == 2) V[i][j] = 1;\n\t\t\t\t}\n\t\t\t\t//cout << A[k] << \" \" << V[i][j] << endl;\n\t\t\t}\n\t\t}\n\t\t//cout << V[i][0] << \" \" << V[i][1] << \" \" << V[i][2] << endl;\n\t}\n\n\tint n2 = N / 2;\n\tvector<int> tmp(3);\n\tvector<vector<int>> P(1 << n2);\n\tbool B[3][3][3];\n\tfor (int i = 0; i < 3; i++)\n\t{\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tB[i][j][k] = false;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 1; i < 1 << n2; i++)\n\t{\n\t\tP[i].push_back(0);\n\t\tP[i].push_back(1);\n\t\tP[i].push_back(2);\n\t\tfor (int j = 0; j < n2; j++)\n\t\t{\n\t\t\tif (i >> j & 1) //jを使う\n\t\t\t{\n\t\t\t\ttmp[0] = P[i][0];\n\t\t\t\ttmp[1] = P[i][1];\n\t\t\t\ttmp[2] = P[i][2];\n\t\t\t\tP[i][0] = tmp[V[j][0]];\n\t\t\t\tP[i][1] = tmp[V[j][1]];\n\t\t\t\tP[i][2] = tmp[V[j][2]];\n\t\t\t}\n\t\t}\n\t\tif (P[i][0] == 0 && P[i][1] == 1 && P[i][2] == 2)\n\t\t{\n\t\t\tcout << \"yes\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tB[P[i][0]][P[i][1]][P[i][2]] = true;\n\t}\n\n\n\tfor (int i = 1; i < 1 << (N - n2); i++)\n\t{\n\t\tvector<int> Q;\n\t\tQ.push_back(0);\n\t\tQ.push_back(1);\n\t\tQ.push_back(2);\n\n\t\tfor (int j = 0; j < N - n2; j++)\n\t\t{\n\t\t\tif (i >> j & 1)\n\t\t\t{\n\t\t\t\ttmp[0] = Q[0];\n\t\t\t\ttmp[1] = Q[1];\n\t\t\t\ttmp[2] = Q[2];\n\t\t\t\t//cout << Q[0] << \" \" << Q[1] << \" \" << Q[2] << endl;\n\t\t\t\tQ[0] = tmp[V[j + n2][0]];\n\t\t\t\tQ[1] = tmp[V[j + n2][1]];\n\t\t\t\tQ[2] = tmp[V[j + n2][2]];\n\t\t\t\t//cout << Q[0] << \" \" << Q[1] << \" \" << Q[2] << endl;\n\t\t\t}\n\t\t}\n\n\t\tif (Q[0] == 0 && Q[1] == 1 && Q[2] == 2)\n\t\t{\n\t\t\tcout << \"yes\" << endl;\n\t\t\treturn;\n\t\t}\n\t\t//cout << Q[0] << \" \" << Q[1] << \" \" << Q[2] << endl;\n\t\tint zero, one, two;\n\t\tfor (int k = 0; k < 3; k++)\n\t\t{\n\t\t\tif (Q[k] == 0)\n\t\t\t{\n\t\t\t\tzero = k;\n\t\t\t}\n\t\t\tif (Q[k] == 1)\n\t\t\t{\n\t\t\t\tone = k;\n\t\t\t}\n\t\t\tif (Q[k] == 2)\n\t\t\t{\n\t\t\t\ttwo = k;\n\t\t\t}\n\t\t}\n\t\tif (B[zero][one][two])\n\t\t{\n\t\t\tcout << \"yes\" << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\n\tcout << \"no\" << endl;\n\n\n\n}\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":395992,"score_of_the_acc":-2,"final_rank":2},{"submission_id":"aoj_3031_2751500","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define mod 1000000007\nusing ll = long long;\nint dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑\n\nvoid solve()\n{\n\tint N;\n\tcin >> N;\n\tvector<int>W(N);\n\t//using T = tuple<int, int, int>;\n\tvector<vector<int>> V(N);\n\n\tfor (int i = 0; i < N; i++)\n\t{\n\t\tcin >> W[i];\n\t\tvector<int> A(W[i]);\n\t\tfor (int j = 0; j < W[i]; j++)\n\t\t{\n\t\t\tcin >> A[j];\n\t\t}\n\t\tV[i].push_back(0);\n\t\tV[i].push_back(1);\n\t\tV[i].push_back(2);\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < W[i]; k++)\n\t\t\t{\n\t\t\t\tif (A[k] == 0)\n\t\t\t\t{\n\t\t\t\t\tif (V[i][j] == 1)V[i][j] = 0;\n\t\t\t\t\telse if (V[i][j] == 0)V[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (V[i][j] == 1)V[i][j] = 2;\n\t\t\t\t\telse if (V[i][j] == 2) V[i][j] = 1;\n\t\t\t\t}\n\t\t\t\t//cout << A[k] << \" \" << V[i][j] << endl;\n\t\t\t}\n\t\t}\n\t\t//cout << V[i][0] << \" \" << V[i][1] << \" \" << V[i][2] << endl;\n\t}\n\n\tint n2 = N / 2;\n\tvector<int> tmp(3);\n\tvector<vector<int>> P(1 << n2);\n\tbool B[3][3][3];\n\tfor (int i = 0; i < 3; i++)\n\t{\n\t\tfor (int j = 0; j < 3; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tB[i][j][k] = false;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 1; i < 1 << n2; i++)\n\t{\n\t\tP[i].push_back(0);\n\t\tP[i].push_back(1);\n\t\tP[i].push_back(2);\n\t\tfor (int j = 0; j < n2; j++)\n\t\t{\n\t\t\tif (i >> j & 1) //jを使う\n\t\t\t{\n\t\t\t\ttmp[0] = P[i][0];\n\t\t\t\ttmp[1] = P[i][1];\n\t\t\t\ttmp[2] = P[i][2];\n\t\t\t\tP[i][0] = tmp[V[j][0]];\n\t\t\t\tP[i][1] = tmp[V[j][1]];\n\t\t\t\tP[i][2] = tmp[V[j][2]];\n\t\t\t}\n\t\t}\n\t\tif (P[i][0] == 0 && P[i][1] == 1 && P[i][2] == 2)\n\t\t{\n\t\t\tcout << \"yes\" << endl;\n\t\t\treturn;\n\t\t}\n\t\tB[P[i][0]][P[i][1]][P[i][2]] = true;\n\t}\n\n\n\tfor (int i = 0; i < 1 << (N - n2); i++)\n\t{\n\t\tvector<int> Q(3);\n\t\tQ.push_back(0);\n\t\tQ.push_back(1);\n\t\tQ.push_back(2);\n\t\tfor (int j = 1; j < N - n2; j++)\n\t\t{\n\t\t\tif (i >> j & 1)\n\t\t\t{\n\t\t\t\tif (i >> j & 1) //j+n2を使う\n\t\t\t\t{\n\t\t\t\t\ttmp[0] = Q[0];\n\t\t\t\t\ttmp[1] = Q[1];\n\t\t\t\t\ttmp[2] = Q[2];\n\t\t\t\t\tQ[0] = tmp[V[j + n2][0]];\n\t\t\t\t\tQ[1] = tmp[V[j + n2][1]];\n\t\t\t\t\tQ[2] = tmp[V[j + n2][2]];\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif (Q[0] == 0 && Q[1] == 1 && Q[2] == 2)\n\t\t\t{\n\t\t\t\tcout << \"yes\" << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t//cout << Q[0] << \" \" << Q[1] << \" \" << Q[2] << endl;\n\t\t\tint zero, one, two;\n\t\t\tfor (int k = 0; k < 3; k++)\n\t\t\t{\n\t\t\t\tif (Q[k] == 0)\n\t\t\t\t{\n\t\t\t\t\tzero = k;\n\t\t\t\t}\n\t\t\t\tif (Q[k] == 1)\n\t\t\t\t{\n\t\t\t\t\tone = k;\n\t\t\t\t}\n\t\t\t\tif (Q[k] == 2)\n\t\t\t\t{\n\t\t\t\t\ttwo = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (B[zero][one][two])\n\t\t\t{\n\t\t\t\tcout << \"yes\" << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << \"no\" << endl;\n\n\n\n}\n\nint main()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tsolve();\n\treturn 0;\n}","accuracy":0.42424242424242425,"time_ms":10,"memory_kb":51748,"score_of_the_acc":-0.1237,"final_rank":4},{"submission_id":"aoj_3031_2751422","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long i64;\ntypedef long double ld;\ntypedef pair<i64, i64> P;\n#define rep(i, s, e) for (int i = (s); i <= (e); i++)\n\nint n;\n\nint numbers[3] = {0b001, 0b010, 0b100};\n\nvector<vector<int>> s;\nvector<vector<int>> t;\n\nset<int> st;\n\nint main() {\n cin >> n;\n vector<int> base = {0, 1, 2};\n int sz = n / 2;\n s.assign(sz, base);\n t.assign(n - (sz) + 1, base);\n rep(i, 0, sz - 1) {\n int w;\n cin >> w;\n rep(j, 0, w - 1) {\n int a;\n cin >> a;\n if (a == 0) {\n swap(s[i][0], s[i][1]);\n } else {\n swap(s[i][1], s[i][2]);\n }\n }\n }\n rep(i, 0, n - (sz)-1) {\n int w;\n cin >> w;\n rep(j, 0, w - 1) {\n int a;\n cin >> a;\n if (a == 0) {\n swap(t[i][0], t[i][1]);\n } else {\n swap(t[i][1], t[i][2]);\n }\n }\n }\n {\n sz = s.size();\n vector<int> dp((1 << sz), 0);\n for (int i = 0; i < 3; i++) {\n dp[0] |= (numbers[i] << (i * 3));\n }\n for (int i = 1; i < (1 << sz); i++) {\n int j;\n for (j = 0; j < sz; j++) {\n if (i & (1 << j)) break;\n }\n int next = 0;\n int before = i & ~(1 << j);\n for (int from = 0; from < 3; from++) {\n int to = s[j][from];\n for (int k = 0; k < 3; k++) {\n int bit = 0;\n if (dp[before] & (1 << (from * 3 + k))) {\n bit = 1;\n }\n next |= (bit << (to * 3 + k));\n }\n }\n dp[i] = next;\n st.insert(next);\n }\n }\n {\n sz = t.size();\n vector<int> dp((1 << sz), 0);\n for (int i = 0; i < 3; i++) {\n dp[0] |= (numbers[i] << (i * 3));\n }\n for (int i = 1; i < (1 << sz); i++) {\n int j;\n for (j = 0; j < sz; j++) {\n if (i & (1 << j)) break;\n }\n int next = 0;\n int before = i & ~(1 << j);\n for (int from = 0; from < 3; from++) {\n int to = t[j][from];\n for (int k = 0; k < 3; k++) {\n int bit = 0;\n if (dp[before] & (1 << (from * 3 + k))) {\n bit = 1;\n }\n next |= (bit << (to * 3 + k));\n }\n }\n dp[i] = next;\n if ((i != (1 << (sz - 1)) && dp[0] == next) || st.count(next)) {\n cout << \"yes\" << endl;\n return 0;\n }\n }\n }\n cout << \"no\" << endl;\n}","accuracy":0.42424242424242425,"time_ms":30,"memory_kb":35652,"score_of_the_acc":-0.2494,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_3031_2848065\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\nbool operator<(const vector<int>&l, const vector<int>&r) {\\n\\tfor (int i = 0; i < l.size(); ++i) {\\n\\t\\tif(l[i]<r[i])return true;\\n\\t\\telse if(l[i]==r[i])continue;\\n\\t\\telse return false;\\n\\t}\\n\\treturn false;\\n}\\n\\nint main() {\\n\\tint N;cin>>N;\\n\\n\\tmap<vector<int>,int>mp;\\n\\tmap<int,vector<int>>rev_mp;\\n\\tvector<int>v(3);\\n\\tiota(v.begin(),v.end(),0);\\n\\t{\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\trotate(v.begin(),v.begin()+1,v.end());\\n\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tmp[v]=i*2+j;\\n\\t\\t\\t\\trev_mp[i*2+j]=v;\\n\\t\\t\\t\\tswap(v[0],v[1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int>nums(6);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tvector<int>perms(3);\\n\\t\\tiota(perms.begin(),perms.end(),0);\\n\\n\\t\\tint w;cin>>w;\\n\\t\\tfor (int j = 0; j < w; ++j) {\\n\\t\\t\\tint k;cin>>k;\\n\\t\\t\\tswap(perms[k],perms[k+1]);\\n\\t\\t}\\n\\t\\tnums[mp[perms]]++;\\n\\t}\\n\\n\\tfor (int i = 0; i < 6; ++i) {\\n\\t\\tnums[i]=min(3,nums[i]);\\n\\t}\\n\\n\\tset<pair<int,vector<int>>>memo;\\n\\tmemo.emplace(mp[vector<int>{0, 1, 2}],nums);\\n\\n\\tqueue<pair<int,vector<int>>>que;\\n\\tque.emplace(mp[vector<int>{0, 1, 2}],nums);\\n\\n\\tbool aok=false;\\n\\twhile (!que.empty()) {\\n\\t\\tauto p(que.front());\\n\\t\\tque.pop();\\n\\t\\tint status_id=p.first;\\n\\t\\tvector<int> rest=p.second;\\n\\n\\t\\tfor (int use_id = 0; use_id < 6; ++use_id) {\\n\\t\\t\\tif (rest[use_id]) {\\n\\t\\t\\t\\trest[use_id]--;\\n\\n\\t\\t\\t\\tvector<int>now_status(rev_mp[status_id]);\\n\\t\\t\\t\\tvector<int>next_status(now_status);\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tauto next_change(rev_mp[use_id]);\\n\\n\\t\\t\\t\\t\\tnext_status[next_change[i]]= now_status[i];\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint next_status_id = mp[next_status];\\n\\t\\t\\t\\tif(next_status_id==4)aok=true;\\n\\t\\t\\t\\tif (memo.find(make_pair(next_status_id, rest)) == memo.end()) {\\n\\t\\t\\t\\t\\tmemo.emplace(next_status_id, rest);\\n\\t\\t\\t\\t\\tque.emplace(next_status_id, rest);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\trest[use_id]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tbool ok=memo.find(make_pair(4,vector<int>(6,0)))!=memo.end();\\n\\tif(aok)cout<<\\\"yes\\\"<<endl;\\n\\telse cout<<\\\"no\\\"<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4480,\n \"score_of_the_acc\": -0.0867,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3031_2848064\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\nbool operator<(const vector<int>&l, const vector<int>&r) {\\n\\tfor (int i = 0; i < l.size(); ++i) {\\n\\t\\tif(l[i]<r[i])return true;\\n\\t\\telse if(l[i]==r[i])continue;\\n\\t\\telse return false;\\n\\t}\\n\\treturn false;\\n}\\n\\nint main() {\\n\\tint N;cin>>N;\\n\\n\\tmap<vector<int>,int>mp;\\n\\tmap<int,vector<int>>rev_mp;\\n\\tvector<int>v(3);\\n\\tiota(v.begin(),v.end(),0);\\n\\t{\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\trotate(v.begin(),v.begin()+1,v.end());\\n\\t\\t\\tfor (int j = 0; j < 2; ++j) {\\n\\t\\t\\t\\tmp[v]=i*2+j;\\n\\t\\t\\t\\trev_mp[i*2+j]=v;\\n\\t\\t\\t\\tswap(v[0],v[1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int>nums(6);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tvector<int>perms(3);\\n\\t\\tiota(perms.begin(),perms.end(),0);\\n\\n\\t\\tint w;cin>>w;\\n\\t\\tfor (int j = 0; j < w; ++j) {\\n\\t\\t\\tint k;cin>>k;\\n\\t\\t\\tswap(perms[k],perms[k+1]);\\n\\t\\t}\\n\\t\\tnums[mp[perms]]++;\\n\\t}\\n\\n\\tfor (int i = 0; i < 6; ++i) {\\n\\t\\tnums[i]=min(3,nums[i]);\\n\\t}\\n\\n\\tset<pair<int,vector<int>>>memo;\\n\\tmemo.emplace(mp[vector<int>{0, 1, 2}],nums);\\n\\n\\tqueue<pair<int,vector<int>>>que;\\n\\tque.emplace(mp[vector<int>{0, 1, 2}],nums);\\n\\n\\tbool aok=false;\\n\\twhile (!que.empty()) {\\n\\t\\tauto p(que.front());\\n\\t\\tque.pop();\\n\\t\\tint status_id=p.first;\\n\\t\\tvector<int> rest=p.second;\\n\\n\\t\\tfor (int use_id = 0; use_id < 6; ++use_id) {\\n\\t\\t\\tif (rest[use_id]) {\\n\\t\\t\\t\\trest[use_id]--;\\n\\n\\t\\t\\t\\tvector<int>now_status(rev_mp[status_id]);\\n\\t\\t\\t\\tvector<int>next_status(now_status);\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tauto next_change(rev_mp[use_id]);\\n\\n\\t\\t\\t\\t\\tnext_status[next_change[i]]= now_status[i];\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint next_status_id = mp[next_status];\\n\\t\\t\\t\\tif(next_status_id==0)aok=true;\\n\\t\\t\\t\\tif (memo.find(make_pair(next_status_id, rest)) == memo.end()) {\\n\\t\\t\\t\\t\\tmemo.emplace(next_status_id, rest);\\n\\t\\t\\t\\t\\tque.emplace(next_status_id, rest);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\trest[use_id]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tbool ok=memo.find(make_pair(4,vector<int>(6,0)))!=memo.end();\\n\\tif(aok)cout<<\\\"yes\\\"<<endl;\\n\\telse cout<<\\\"no\\\"<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3333333333333333,\n \"time_ms\": 20,\n \"memory_kb\": 4476,\n \"score_of_the_acc\": -0.0867,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3031_2751542\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define INF 1.1e9\\n#define LINF 1.1e18\\n#define FOR(i,a,b) for (int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n#define pb push_back\\n#define pf push_front\\n#define fi first\\n#define se second\\n#define BIT(x,n) bitset<n>(x)\\n#define PI 3.14159265358979323846\\n\\ntypedef long long ll;\\ntypedef pair<ll,int> P;\\ntypedef pair<ll,P> PP;\\n\\n//-----------------------------------------------------------------------------\\n\\nstruct S {\\n\\tint a,b,c;\\n\\tS() {}\\n\\tS(int a,int b,int c):a(a),b(b),c(c) {}\\n\\tbool operator<(const S s) const {\\n\\t\\treturn a<s.a;\\n\\t}\\n};\\n\\nint n;\\nint to[50][3];\\nset<S> st[2];\\n\\nvoid dfs(int idx,int a,int b,int c,int limit,bool used) {\\n\\tif(idx==limit) {\\n\\t\\t//cout<<\\\"idx=\\\"<<idx<<\\\"(\\\"<<a<<','<<b<<','<<c<<')'<<endl;\\n\\t\\tif(used) {\\n\\t\\t\\tif(limit==n) st[1].insert(S(a,b,c));\\n\\t\\t\\telse st[0].insert(S(a,b,c));\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tdfs(idx+1,a,b,c,limit,used);\\n\\tdfs(idx+1,to[idx][a],to[idx][b],to[idx][c],limit,true);\\n}\\n\\nint f(S s,int i) {\\n\\tif(i==0) return s.a;\\n\\telse if(i==1) return s.b;\\n\\telse return s.c;\\n}\\n\\nS conv(S s,S t) {\\n\\tS res;\\n\\tres.a=f(s,t.a),res.b=f(s,t.b),res.c=f(s,t.c);\\n\\treturn res;\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tREP(i,50) REP(j,3) to[i][j]=j;\\n\\n\\tcin>>n;\\n\\tREP(i,n) {\\n\\t\\tint w,a;cin>>w;\\n\\t\\tREP(j,w) {\\n\\t\\t\\tcin>>a;\\n\\t\\t\\tif(a==0) swap(to[i][0],to[i][1]);\\n\\t\\t\\telse swap(to[i][1],to[i][2]);\\n\\t\\t}\\n\\t}\\n\\tdfs(0,0,1,2,n/2,false);dfs(n/2,0,1,2,n,false);\\n\\tfor(auto s:st[0]) {\\n\\t\\t//cout<<s.a<<' '<<s.b<<' '<<s.c<<endl;\\n\\t\\tif(s.a==0&&s.b==1&&s.c==2) {\\n\\t\\t\\tcout<<\\\"yes\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\t//cout<<\\\"after st1\\\"<<endl;\\n\\tfor(auto t:st[1]) {\\n\\t\\t//cout<<t.a<<' '<<t.b<<' '<<t.c<<endl;\\n\\t\\tif(t.a==0&&t.b==1&&t.c==2) {\\n\\t\\t\\tcout<<\\\"yes\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\t//cout<<\\\"after st2\\\"<<endl;\\n\\tfor(auto s:st[0]) {\\n\\t\\tfor(auto t:st[1]) {\\n\\t\\t\\tS tmp=conv(s,t);\\n\\t\\t\\tif(tmp.a==0&&tmp.b==1&&tmp.c==2) {\\n\\t\\t\\t\\tcout<<\\\"yes\\\"<<endl;\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<\\\"no\\\"<<endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.45454545454545453,\n \"time_ms\": 50,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.3333,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3031_2751520\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define mod 1000000007\\nusing ll = long long;\\nint dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑\\n\\nvoid solve()\\n{\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<int>W(N);\\n\\t//using T = tuple<int, int, int>;\\n\\tvector<vector<int>> V(N);\\n\\n\\tfor (int i = 0; i < N; i++)\\n\\t{\\n\\t\\tcin >> W[i];\\n\\t\\tvector<int> A(W[i]);\\n\\t\\tfor (int j = 0; j < W[i]; j++)\\n\\t\\t{\\n\\t\\t\\tcin >> A[j];\\n\\t\\t}\\n\\t\\tV[i].push_back(0);\\n\\t\\tV[i].push_back(1);\\n\\t\\tV[i].push_back(2);\\n\\t\\tfor (int j = 0; j < 3; j++)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 0; k < W[i]; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (A[k] == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (V[i][j] == 1)V[i][j] = 0;\\n\\t\\t\\t\\t\\telse if (V[i][j] == 0)V[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (V[i][j] == 1)V[i][j] = 2;\\n\\t\\t\\t\\t\\telse if (V[i][j] == 2) V[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//cout << A[k] << \\\" \\\" << V[i][j] << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << V[i][0] << \\\" \\\" << V[i][1] << \\\" \\\" << V[i][2] << endl;\\n\\t}\\n\\n\\tint n2 = N / 2;\\n\\tvector<int> tmp(3);\\n\\tvector<vector<int>> P(1 << n2);\\n\\tbool B[3][3][3];\\n\\tfor (int i = 0; i < 3; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < 3; j++)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 0; k < 3; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tB[i][j][k] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1; i < 1 << n2; i++)\\n\\t{\\n\\t\\tP[i].push_back(0);\\n\\t\\tP[i].push_back(1);\\n\\t\\tP[i].push_back(2);\\n\\t\\tfor (int j = 0; j < n2; j++)\\n\\t\\t{\\n\\t\\t\\tif (i >> j & 1) //jを使う\\n\\t\\t\\t{\\n\\t\\t\\t\\ttmp[0] = P[i][0];\\n\\t\\t\\t\\ttmp[1] = P[i][1];\\n\\t\\t\\t\\ttmp[2] = P[i][2];\\n\\t\\t\\t\\tP[i][0] = tmp[V[j][0]];\\n\\t\\t\\t\\tP[i][1] = tmp[V[j][1]];\\n\\t\\t\\t\\tP[i][2] = tmp[V[j][2]];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (P[i][0] == 0 && P[i][1] == 1 && P[i][2] == 2)\\n\\t\\t{\\n\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tB[P[i][0]][P[i][1]][P[i][2]] = true;\\n\\t}\\n\\n\\n\\tfor (int i = 1; i < 1 << (N - n2); i++)\\n\\t{\\n\\t\\tvector<int> Q;\\n\\t\\tQ.push_back(0);\\n\\t\\tQ.push_back(1);\\n\\t\\tQ.push_back(2);\\n\\n\\t\\tfor (int j = 0; j < N - n2; j++)\\n\\t\\t{\\n\\t\\t\\tif (i >> j & 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\ttmp[0] = Q[0];\\n\\t\\t\\t\\ttmp[1] = Q[1];\\n\\t\\t\\t\\ttmp[2] = Q[2];\\n\\t\\t\\t\\t//cout << Q[0] << \\\" \\\" << Q[1] << \\\" \\\" << Q[2] << endl;\\n\\t\\t\\t\\tQ[0] = tmp[V[j + n2][0]];\\n\\t\\t\\t\\tQ[1] = tmp[V[j + n2][1]];\\n\\t\\t\\t\\tQ[2] = tmp[V[j + n2][2]];\\n\\t\\t\\t\\t//cout << Q[0] << \\\" \\\" << Q[1] << \\\" \\\" << Q[2] << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (Q[0] == 0 && Q[1] == 1 && Q[2] == 2)\\n\\t\\t{\\n\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t//cout << Q[0] << \\\" \\\" << Q[1] << \\\" \\\" << Q[2] << endl;\\n\\t\\tint zero, one, two;\\n\\t\\tfor (int k = 0; k < 3; k++)\\n\\t\\t{\\n\\t\\t\\tif (Q[k] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tzero = k;\\n\\t\\t\\t}\\n\\t\\t\\tif (Q[k] == 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tone = k;\\n\\t\\t\\t}\\n\\t\\t\\tif (Q[k] == 2)\\n\\t\\t\\t{\\n\\t\\t\\t\\ttwo = k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (B[zero][one][two])\\n\\t\\t{\\n\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n\\tcout << \\\"no\\\" << endl;\\n\\n\\n\\n}\\n\\nint main()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 395992,\n \"score_of_the_acc\": -2,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3031_2751500\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define mod 1000000007\\nusing ll = long long;\\nint dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑\\n\\nvoid solve()\\n{\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<int>W(N);\\n\\t//using T = tuple<int, int, int>;\\n\\tvector<vector<int>> V(N);\\n\\n\\tfor (int i = 0; i < N; i++)\\n\\t{\\n\\t\\tcin >> W[i];\\n\\t\\tvector<int> A(W[i]);\\n\\t\\tfor (int j = 0; j < W[i]; j++)\\n\\t\\t{\\n\\t\\t\\tcin >> A[j];\\n\\t\\t}\\n\\t\\tV[i].push_back(0);\\n\\t\\tV[i].push_back(1);\\n\\t\\tV[i].push_back(2);\\n\\t\\tfor (int j = 0; j < 3; j++)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 0; k < W[i]; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (A[k] == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (V[i][j] == 1)V[i][j] = 0;\\n\\t\\t\\t\\t\\telse if (V[i][j] == 0)V[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (V[i][j] == 1)V[i][j] = 2;\\n\\t\\t\\t\\t\\telse if (V[i][j] == 2) V[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//cout << A[k] << \\\" \\\" << V[i][j] << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << V[i][0] << \\\" \\\" << V[i][1] << \\\" \\\" << V[i][2] << endl;\\n\\t}\\n\\n\\tint n2 = N / 2;\\n\\tvector<int> tmp(3);\\n\\tvector<vector<int>> P(1 << n2);\\n\\tbool B[3][3][3];\\n\\tfor (int i = 0; i < 3; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < 3; j++)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 0; k < 3; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tB[i][j][k] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1; i < 1 << n2; i++)\\n\\t{\\n\\t\\tP[i].push_back(0);\\n\\t\\tP[i].push_back(1);\\n\\t\\tP[i].push_back(2);\\n\\t\\tfor (int j = 0; j < n2; j++)\\n\\t\\t{\\n\\t\\t\\tif (i >> j & 1) //jを使う\\n\\t\\t\\t{\\n\\t\\t\\t\\ttmp[0] = P[i][0];\\n\\t\\t\\t\\ttmp[1] = P[i][1];\\n\\t\\t\\t\\ttmp[2] = P[i][2];\\n\\t\\t\\t\\tP[i][0] = tmp[V[j][0]];\\n\\t\\t\\t\\tP[i][1] = tmp[V[j][1]];\\n\\t\\t\\t\\tP[i][2] = tmp[V[j][2]];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (P[i][0] == 0 && P[i][1] == 1 && P[i][2] == 2)\\n\\t\\t{\\n\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tB[P[i][0]][P[i][1]][P[i][2]] = true;\\n\\t}\\n\\n\\n\\tfor (int i = 0; i < 1 << (N - n2); i++)\\n\\t{\\n\\t\\tvector<int> Q(3);\\n\\t\\tQ.push_back(0);\\n\\t\\tQ.push_back(1);\\n\\t\\tQ.push_back(2);\\n\\t\\tfor (int j = 1; j < N - n2; j++)\\n\\t\\t{\\n\\t\\t\\tif (i >> j & 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (i >> j & 1) //j+n2を使う\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp[0] = Q[0];\\n\\t\\t\\t\\t\\ttmp[1] = Q[1];\\n\\t\\t\\t\\t\\ttmp[2] = Q[2];\\n\\t\\t\\t\\t\\tQ[0] = tmp[V[j + n2][0]];\\n\\t\\t\\t\\t\\tQ[1] = tmp[V[j + n2][1]];\\n\\t\\t\\t\\t\\tQ[2] = tmp[V[j + n2][2]];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tif (Q[0] == 0 && Q[1] == 1 && Q[2] == 2)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t//cout << Q[0] << \\\" \\\" << Q[1] << \\\" \\\" << Q[2] << endl;\\n\\t\\t\\tint zero, one, two;\\n\\t\\t\\tfor (int k = 0; k < 3; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (Q[k] == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tzero = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (Q[k] == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tone = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (Q[k] == 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttwo = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (B[zero][one][two])\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << \\\"yes\\\" << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tcout << \\\"no\\\" << endl;\\n\\n\\n\\n}\\n\\nint main()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.42424242424242425,\n \"time_ms\": 10,\n \"memory_kb\": 51748,\n \"score_of_the_acc\": -0.1237,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3031_2751422\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cmath>\\n#include <iostream>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\ntypedef long long i64;\\ntypedef long double ld;\\ntypedef pair<i64, i64> P;\\n#define rep(i, s, e) for (int i = (s); i <= (e); i++)\\n\\nint n;\\n\\nint numbers[3] = {0b001, 0b010, 0b100};\\n\\nvector<vector<int>> s;\\nvector<vector<int>> t;\\n\\nset<int> st;\\n\\nint main() {\\n cin >> n;\\n vector<int> base = {0, 1, 2};\\n int sz = n / 2;\\n s.assign(sz, base);\\n t.assign(n - (sz) + 1, base);\\n rep(i, 0, sz - 1) {\\n int w;\\n cin >> w;\\n rep(j, 0, w - 1) {\\n int a;\\n cin >> a;\\n if (a == 0) {\\n swap(s[i][0], s[i][1]);\\n } else {\\n swap(s[i][1], s[i][2]);\\n }\\n }\\n }\\n rep(i, 0, n - (sz)-1) {\\n int w;\\n cin >> w;\\n rep(j, 0, w - 1) {\\n int a;\\n cin >> a;\\n if (a == 0) {\\n swap(t[i][0], t[i][1]);\\n } else {\\n swap(t[i][1], t[i][2]);\\n }\\n }\\n }\\n {\\n sz = s.size();\\n vector<int> dp((1 << sz), 0);\\n for (int i = 0; i < 3; i++) {\\n dp[0] |= (numbers[i] << (i * 3));\\n }\\n for (int i = 1; i < (1 << sz); i++) {\\n int j;\\n for (j = 0; j < sz; j++) {\\n if (i & (1 << j)) break;\\n }\\n int next = 0;\\n int before = i & ~(1 << j);\\n for (int from = 0; from < 3; from++) {\\n int to = s[j][from];\\n for (int k = 0; k < 3; k++) {\\n int bit = 0;\\n if (dp[before] & (1 << (from * 3 + k))) {\\n bit = 1;\\n }\\n next |= (bit << (to * 3 + k));\\n }\\n }\\n dp[i] = next;\\n st.insert(next);\\n }\\n }\\n {\\n sz = t.size();\\n vector<int> dp((1 << sz), 0);\\n for (int i = 0; i < 3; i++) {\\n dp[0] |= (numbers[i] << (i * 3));\\n }\\n for (int i = 1; i < (1 << sz); i++) {\\n int j;\\n for (j = 0; j < sz; j++) {\\n if (i & (1 << j)) break;\\n }\\n int next = 0;\\n int before = i & ~(1 << j);\\n for (int from = 0; from < 3; from++) {\\n int to = t[j][from];\\n for (int k = 0; k < 3; k++) {\\n int bit = 0;\\n if (dp[before] & (1 << (from * 3 + k))) {\\n bit = 1;\\n }\\n next |= (bit << (to * 3 + k));\\n }\\n }\\n dp[i] = next;\\n if ((i != (1 << (sz - 1)) && dp[0] == next) || st.count(next)) {\\n cout << \\\"yes\\\" << endl;\\n return 0;\\n }\\n }\\n }\\n cout << \\\"no\\\" << endl;\\n}\",\n \"accuracy\": 0.42424242424242425,\n \"time_ms\": 30,\n \"memory_kb\": 35652,\n \"score_of_the_acc\": -0.2494,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1873,"cells":{"group_id":{"kind":"string","value":"aoj_3025_cpp"},"problem_description":{"kind":"string","value":"Problem M: Fissure Puzzle Hard\nProblem\n$N \\times N$個のマスから成るグリッドがある。最初すべてのマスは白色である。以下の手順に従って黒色のマスを増やしていく。\n上から偶数番目かつ、左から偶数番目であるマスの中で、白色のマスを1つ選ぶ。選んだマスは黒色に変化する。さらに、そのマスの上下左右それぞれの方向について、隣接している白色のマスも連鎖的に黒色に変化する。この連鎖はその方向に白色のマスが存在しなくなるまで続く。(以下に例を示す)\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n□□□□□□□□□\n↓上から4番目、左から6番目を選ぶ\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n■■■■■■■■■\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n↓上から2番目、左から2番目を選ぶ\n□■□□□■□□□\n■■■■■■□□□\n□■□□□■□□□\n■■■■■■■■■\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n□□□□□■□□□\n↓上から6番目、左から8番目を選ぶ\n□■□□□■□□□\n■■■■■■□□□\n□■□□□■□□□\n■■■■■■■■■\n□□□□□■□■□\n□□□□□■■■■\n□□□□□■□■□\n□□□□□■□■□\n□□□□□■□■□\nあなたは上から$i$番目で左から$j$番目のマスの色が$A_{i,j}$であるグリッドを作りたい。\n作ることが可能かどうかを判定せよ。可能な場合は、選ぶべきマスの場所と順番を求めよ。\nInput\n入力は以下の形式で与えられる。\n$N$\n$A_{1,1}$ $A_{1,2}$ ... $A_{1,N}$\n$A_{2,1}$ $A_{2,2}$ ... $A_{2,N}$\n...\n$A_{N,1}$ $A_{N,2}$ ... $A_{N,N}$\n$A_{i,j}$が'o'であるときは上から$i$番目、左から$j$番目のマスが白色であることを表し、'x'のときは黒色のマスであることを表す。\nConstraints\n入力は以下の条件を満たす。\n$3 \\le N \\le 2047$\n$N$は奇数である\n$A_{i,j}$は'o'か'x'である\nOutput\n不可能な場合は-1と1行に出力せよ。\n 可能な場合は1行目に選ぶマスの個数を出力し、\n $i \\times 2$行目には$i$番目に選択するマスが上から何番目なのかを、\n $i \\times 2 + 1$行目には$i$番目に選択するマスが左から何番目なのかを出力せよ。\n 一意に定まらない場合は辞書順で最小になるようにせよ。\nSample Input 1\n5\noxooo\noxooo\noxooo\nxxxxx\noxooo\nSample Output 1\n1\n4\n2\nSample Input 2\n9\noxoooooxo\noxxxxxxxx\noxoooooxo\nxxxxxxxxx\noxoxooooo\noxxxxxxxx\noxoxoxooo\noxoxxxxxx\noxoxoxooo\nSample Output 2\n4\n4\n2\n2\n8\n6\n4\n8\n6\nSample Input 3\n3\noxx\noxx\nooo\nSample Output 3\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3025_3650106","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <tuple>\n\nusing namespace std;\n\nstruct Rect {\n int x;\n int y;\n int width;\n int height;\n int cross_x;\n int cross_y;\n};\n\ntemplate<typename T>\nstruct RPN {\n deque<T> data;\n T& operator[](int i) {\n return data[data.size() - i - 1];\n }\n void push(T x) {\n data.push_back(x);\n }\n void pop(int n) {\n for (int i = 0; i < n; ++i) {\n data.pop_back();\n }\n }\n int size() {\n return data.size();\n }\n};\n\nbool get_tile(vector<char>& A, int N, int x, int y, int& width, int& height) {\n if (x % 2 != 0 || y % 2 != 0) {\n return false;\n }\n int w = N - x;\n int h = N - y;\n for (int i = x; i < N; ++i) {\n if (A[i + N * y] == 'x') {\n w = i - x;\n break;\n }\n }\n for (int i = y; i < N; ++i) {\n if (A[x + N * i] == 'x') {\n h = i - y;\n break;\n }\n }\n if (y + h < N) {\n for (int i = x; i < x + w; ++i) {\n if (A[i + N * (y + h)] == 'o') {\n return false;\n }\n }\n }\n if (x + w < N) {\n for (int i = y; i < y + h; ++i) {\n if (A[x + w + N * i] == 'o') {\n return false;\n }\n }\n }\n if (y + h < N && x + w < N) {\n if (A[x + w + N * (y + h)] == 'o') {\n return false;\n }\n }\n for (int i = x + 1; i < x + w; ++i) {\n for (int j = y + 1; j < y + h; ++j) {\n if (A[i + N * j] == 'x') {\n return false;\n }\n }\n }\n width = w;\n height = h;\n return true;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<char> A(N * N);\n unordered_map<int, pair<int, int>> rects;\n queue<tuple<int, int, int, int>> q;\n for (int j = 0; j < N; ++j) {\n for (int i = 0; i < N; ++i) {\n cin >> A[i + N * j];\n }\n }\n int width;\n int height;\n if (!get_tile(A, N, 0, 0, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(0, 0, width, height);\n rects.emplace(0, make_pair(width, height));\n while (!q.empty()) {\n tuple<int, int, int, int> rect = q.front();\n int x = get<0>(rect);\n int y = get<1>(rect);\n int w = get<2>(rect);\n int h = get<3>(rect);\n q.pop();\n if (w != 0 && h != 0) {\n// cout << x << \", \" << y << \", \" << w << \", \" << h << endl;\n }\n rects.emplace(x + 10000 * y, make_pair(w, h));\n if (x + w < N && rects.find((x + w + 1) + 10000 * y) == rects.end()) {\n if (!get_tile(A, N, x + w + 1, y, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(x + w + 1, y, width, height);\n rects.emplace((x + w + 1) + 10000 * y, make_pair(width, height));\n }\n if (y + h < N && rects.find(x + 10000 * (y + h + 1)) == rects.end()) {\n if (!get_tile(A, N, x, y + h + 1, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(x, y + h + 1, width, height);\n rects.emplace(x + 10000 * (y + h + 1), make_pair(width, height));\n }\n }\n unordered_map<int, vector<int>> tree;\n RPN<pair<Rect, int>> rpn;\n if (rects[0].first == N && rects[0].second == N) {\n cout << 0 << endl;\n return 0;\n }\n rpn.push(make_pair(Rect {0, 0, rects[0].first, rects[0].second, -1, -1}, 0));\n int merge_count = 0;\n while (true) {\n int type = rpn[0].second;\n if (type == 3) {\n if (rpn[0].first.width != rpn[3].first.width ||\n rpn[1].first.width != rpn[2].first.width ||\n rpn[2].first.height != rpn[3].first.height ||\n rpn[0].first.height != rpn[1].first.height) {\n cout << -1 << endl;\n return 0;\n }\n int new_x = rpn[3].first.x;\n int new_y = rpn[3].first.y;\n int new_w = rpn[3].first.width + rpn[2].first.width + 1;\n int new_h = rpn[3].first.height + rpn[0].first.height + 1;\n int cross_x = rpn[1].first.x - 1;\n int cross_y = rpn[1].first.y - 1;\n vector<int> children;\n if (rpn[0].first.cross_x != -1) {\n children.emplace_back(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\n }\n if (rpn[1].first.cross_x != -1) {\n children.emplace_back(rpn[1].first.cross_x + 10000 * rpn[1].first.cross_y);\n }\n if (rpn[2].first.cross_x != -1) {\n children.emplace_back(rpn[2].first.cross_x + 10000 * rpn[2].first.cross_y);\n }\n if (rpn[3].first.cross_x != -1) {\n children.emplace_back(rpn[3].first.cross_x + 10000 * rpn[3].first.cross_y);\n }\n tree.emplace((rpn[1].first.x - 1) + 10000 * (rpn[1].first.y - 1), children);\n rpn.pop(4);\n rpn.push(make_pair(Rect {new_x, new_y, new_w, new_h, cross_x, cross_y}, -1));\n ++merge_count;\n// cout << \"merge: (\" << new_x << \", \" << new_y << \", \" << new_w << \", \" << new_h << \")\" << endl;\n } else if (type == 2) {\n int x = rpn[2].first.x;\n int y = rpn[2].first.y + rpn[2].first.height + 1;\n if (y >= N) {\n cout << -1 << endl;\n return 0;\n }\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else if (type == 1) {\n int x = rpn[0].first.x;\n int y = rpn[0].first.y + rpn[0].first.height + 1;\n if (y >= N) {\n cout << -1 << endl;\n return 0;\n }\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else if (type == 0) {\n int x = rpn[0].first.x + rpn[0].first.width + 1;\n if (x >= N) {\n cout << -1 << endl;\n return 0;\n }\n int y = rpn[0].first.y;\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else {\n if (rpn.size() == 1) {\n if (rpn[0].first.width == N && rpn[0].first.height == N) {\n break;\n } else {\n rpn[0].second = 0;\n }\n } else {\n int prevtype = rpn[1].second;\n if (prevtype == 2) {\n if (rpn[0].first.height < rpn[1].first.height) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 3;\n }\n } else if (prevtype == 1) {\n if (rpn[0].first.width < rpn[1].first.width) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 2;\n }\n } else if (prevtype == 0) {\n if (rpn[0].first.height < rpn[1].first.height) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 1;\n }\n }\n }\n }\n }\n priority_queue<int, vector<int>, std::greater<int>> pq;\n pq.push(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\n cout << merge_count << endl;\n while (!pq.empty()) {\n int cross = pq.top();\n pq.pop();\n for (int child_cross : tree[cross]) {\n pq.push(child_cross);\n }\n cout << (cross / 10000 + 1) << endl;\n cout << (cross % 10000 + 1) << endl;\n }\n}","accuracy":1,"time_ms":1180,"memory_kb":71652,"score_of_the_acc":-1.262,"final_rank":2},{"submission_id":"aoj_3025_3650093","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <tuple>\n\nusing namespace std;\n\nstruct Rect {\n int x;\n int y;\n int width;\n int height;\n int cross_x;\n int cross_y;\n};\n\ntemplate<typename T>\nstruct RPN {\n deque<T> data;\n T& operator[](int i) {\n return data[data.size() - i - 1];\n }\n void push(T x) {\n data.push_back(x);\n }\n void pop(int n) {\n for (int i = 0; i < n; ++i) {\n data.pop_back();\n }\n }\n int size() {\n return data.size();\n }\n};\n\nbool get_tile(vector<char>& A, int N, int x, int y, int& width, int& height) {\n if (x % 2 != 0 || y % 2 != 0) {\n return false;\n }\n int w = N - x;\n int h = N - y;\n for (int i = x; i < N; ++i) {\n if (A[i + N * y] == 'x') {\n w = i - x;\n break;\n }\n }\n for (int i = y; i < N; ++i) {\n if (A[x + N * i] == 'x') {\n h = i - y;\n break;\n }\n }\n if (y + h < N) {\n for (int i = x; i < x + w; ++i) {\n if (A[i + N * (y + h)] == 'o') {\n return false;\n }\n }\n }\n if (x + w < N) {\n for (int i = y; i < y + h; ++i) {\n if (A[x + w + N * i] == 'o') {\n return false;\n }\n }\n }\n if (y + h < N && x + w < N) {\n if (A[x + w + N * (y + h)] == 'o') {\n return false;\n }\n }\n for (int i = x + 1; i < x + w; ++i) {\n for (int j = y + 1; j < y + h; ++j) {\n if (A[i + N * y] == 'x') {\n return false;\n }\n }\n }\n width = w;\n height = h;\n return true;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<char> A(N * N);\n unordered_map<int, pair<int, int>> rects;\n queue<tuple<int, int, int, int>> q;\n for (int j = 0; j < N; ++j) {\n for (int i = 0; i < N; ++i) {\n cin >> A[i + N * j];\n }\n }\n int width;\n int height;\n if (!get_tile(A, N, 0, 0, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(0, 0, width, height);\n rects.emplace(0, make_pair(width, height));\n while (!q.empty()) {\n tuple<int, int, int, int> rect = q.front();\n int x = get<0>(rect);\n int y = get<1>(rect);\n int w = get<2>(rect);\n int h = get<3>(rect);\n q.pop();\n if (w != 0 && h != 0) {\n// cout << x << \", \" << y << \", \" << w << \", \" << h << endl;\n }\n rects.emplace(x + 10000 * y, make_pair(w, h));\n if (x + w < N && rects.find((x + w + 1) + 10000 * y) == rects.end()) {\n if (!get_tile(A, N, x + w + 1, y, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(x + w + 1, y, width, height);\n rects.emplace((x + w + 1) + 10000 * y, make_pair(width, height));\n }\n if (y + h < N && rects.find(x + 10000 * (y + h + 1)) == rects.end()) {\n if (!get_tile(A, N, x, y + h + 1, width, height)) {\n cout << -1 << endl;\n return 0;\n }\n q.emplace(x, y + h + 1, width, height);\n rects.emplace(x + 10000 * (y + h + 1), make_pair(width, height));\n }\n }\n unordered_map<int, vector<int>> tree;\n RPN<pair<Rect, int>> rpn;\n if (rects[0].first == N && rects[0].second == N) {\n cout << 0 << endl;\n return 0;\n }\n rpn.push(make_pair(Rect {0, 0, rects[0].first, rects[0].second, -1, -1}, 0));\n int merge_count = 0;\n while (true) {\n int type = rpn[0].second;\n if (type == 3) {\n if (rpn[0].first.width != rpn[3].first.width ||\n rpn[1].first.width != rpn[2].first.width ||\n rpn[2].first.height != rpn[3].first.height ||\n rpn[0].first.height != rpn[1].first.height) {\n cout << -1 << endl;\n return 0;\n }\n int new_x = rpn[3].first.x;\n int new_y = rpn[3].first.y;\n int new_w = rpn[3].first.width + rpn[2].first.width + 1;\n int new_h = rpn[3].first.height + rpn[0].first.height + 1;\n int cross_x = rpn[1].first.x - 1;\n int cross_y = rpn[1].first.y - 1;\n vector<int> children;\n if (rpn[0].first.cross_x != -1) {\n children.emplace_back(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\n }\n if (rpn[1].first.cross_x != -1) {\n children.emplace_back(rpn[1].first.cross_x + 10000 * rpn[1].first.cross_y);\n }\n if (rpn[2].first.cross_x != -1) {\n children.emplace_back(rpn[2].first.cross_x + 10000 * rpn[2].first.cross_y);\n }\n if (rpn[3].first.cross_x != -1) {\n children.emplace_back(rpn[3].first.cross_x + 10000 * rpn[3].first.cross_y);\n }\n tree.emplace((rpn[1].first.x - 1) + 10000 * (rpn[1].first.y - 1), children);\n rpn.pop(4);\n rpn.push(make_pair(Rect {new_x, new_y, new_w, new_h, cross_x, cross_y}, -1));\n ++merge_count;\n// cout << \"merge: (\" << new_x << \", \" << new_y << \", \" << new_w << \", \" << new_h << \")\" << endl;\n } else if (type == 2) {\n int x = rpn[2].first.x;\n int y = rpn[2].first.y + rpn[2].first.height + 1;\n if (y >= N) {\n cout << -1 << endl;\n return 0;\n }\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else if (type == 1) {\n int x = rpn[0].first.x;\n int y = rpn[0].first.y + rpn[0].first.height + 1;\n if (y >= N) {\n cout << -1 << endl;\n return 0;\n }\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else if (type == 0) {\n int x = rpn[0].first.x + rpn[0].first.width + 1;\n if (x >= N) {\n cout << -1 << endl;\n return 0;\n }\n int y = rpn[0].first.y;\n int w = rects[x + 10000 * y].first;\n int h = rects[x + 10000 * y].second;\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\n// cout << \"add: (\" << x << \", \" << y << \", \" << w << \", \" << h << \")\" << endl;\n } else {\n if (rpn.size() == 1) {\n if (rpn[0].first.width == N && rpn[0].first.height == N) {\n break;\n } else {\n rpn[0].second = 0;\n }\n } else {\n int prevtype = rpn[1].second;\n if (prevtype == 2) {\n if (rpn[0].first.height < rpn[1].first.height) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 3;\n }\n } else if (prevtype == 1) {\n if (rpn[0].first.width < rpn[1].first.width) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 2;\n }\n } else if (prevtype == 0) {\n if (rpn[0].first.height < rpn[1].first.height) {\n rpn[0].second = 0;\n } else {\n rpn[0].second = 1;\n }\n }\n }\n }\n }\n priority_queue<int, vector<int>, std::greater<int>> pq;\n pq.push(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\n cout << merge_count << endl;\n while (!pq.empty()) {\n int cross = pq.top();\n pq.pop();\n for (int child_cross : tree[cross]) {\n pq.push(child_cross);\n }\n cout << (cross / 10000 + 1) << endl;\n cout << (cross % 10000 + 1) << endl;\n }\n}","accuracy":0.08064516129032258,"time_ms":160,"memory_kb":7040,"score_of_the_acc":-0.1074,"final_rank":7},{"submission_id":"aoj_3025_3633791","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <unordered_map>\n#include <tuple>\n\nusing namespace std;\n\nbool select(const vector<tuple<int, int, int>> &line_ns, int line_ns_st,\n const vector<tuple<int, int, int>> &line_ew, int line_ew_st,\n int x, int y, int width, int height, int N,\n int px, int py, vector<tuple<int, int, int, int>> &results) {\n int result_x = -1;\n int result_y = -1;\n int line_ns_st_next = line_ns_st;\n int line_ew_st_next = line_ew_st;\n if (width == 0 || height == 0) {\n return true;\n }\n bool white = true;\n for (int i = line_ns_st; i < line_ns.size(); ++i) {\n if (get<2>(line_ns[i]) >= x + width) {\n break;\n }\n if (!(y + height <= get<0>(line_ns[i]) || get<1>(line_ns[i]) <= y)) {\n white = false;\n }\n if (get<0>(line_ns[i]) <= y && y + height <= get<1>(line_ns[i])) {\n result_x = get<2>(line_ns[i]);\n line_ns_st_next = i + 1;\n for (int i = line_ew_st; i < line_ew.size(); ++i) {\n if (get<2>(line_ew[i]) >= y + height) {\n break;\n }\n if (get<0>(line_ew[i]) <= x && x + width <= get<1>(line_ew[i])) {\n result_y = get<2>(line_ew[i]);\n line_ew_st_next = i + 1;\n vector<tuple<int, int, int, int>> child_results;\n bool ok = select(line_ns, line_ns_st, line_ew, line_ew_st, x, y, result_x - x, result_y - y, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st, line_ew, line_ew_st_next, x, result_y + 1, result_x - x, height - (result_y - y) - 1, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st_next, line_ew, line_ew_st, result_x + 1, y, width - (result_x - x) - 1, result_y - y, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st_next, line_ew, line_ew_st_next, result_x + 1, result_y + 1, width - (result_x - x) - 1, height - (result_y - y) - 1, N, result_x, result_y, child_results);\n if (ok) {\n results.emplace_back(result_x, result_y, px, py);\n for (auto child_result : child_results) {\n results.emplace_back(child_result);\n }\n return true;\n }\n }\n }\n }\n }\n if (white) {\n return true;\n }\n return false;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<char> A(N * N);\n for (int j = 0; j < N; ++j) {\n for (int i = 0; i < N; ++i) {\n cin >> A[i + N * j];\n }\n }\n vector<tuple<int, int, int>> line_ns;\n vector<tuple<int, int, int>> line_ew;\n for (int j = 0; j < N; ++j) {\n int st = -1;\n for (int i = 0; i < N; ++i) {\n if (A[i + N * j] == 'x') {\n if (st == -1) {\n st = i;\n }\n } else if (st != -1) {\n line_ew.emplace_back(st, i, j);\n st = -1;\n }\n }\n if (st != -1) {\n line_ew.emplace_back(st, N, j);\n }\n }\n for (int i = 0; i < N; ++i) {\n int st = -1;\n for (int j = 0; j < N; ++j) {\n if (A[i + N * j] == 'x') {\n if (st == -1) {\n st = j;\n }\n } else if (st != -1) {\n line_ns.emplace_back(st, j, i);\n st = -1;\n }\n }\n if (st != -1) {\n line_ns.emplace_back(st, N, i);\n }\n }\n vector<tuple<int, int, int, int>> results;\n if (!select(line_ns, 0,\n line_ew, 0,\n 0, 0, N, N, N, -1, -1, results)) {\n cout << -1 << endl;\n return 0;\n };\n unordered_map<int, vector<pair<int, int>>> result_map;\n for (auto result : results) {\n int k = get<2>(result) + 10000 * get<3>(result);\n if (result_map.find(k) == result_map.end()) {\n result_map.emplace(k, vector<pair<int, int>> {});\n }\n result_map[k].emplace_back(make_pair(get<0>(result), get<1>(result)));\n }\n auto comp = [](const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } };\n priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(comp)> pq(comp);\n if (result_map.find(-1 + 10000 * (-1)) == result_map.end()) {\n cout << 0 << endl;\n return 0;\n }\n pq.push(result_map[-1 + 10000 * (-1)][0]);\n cout << results.size() << endl;\n while (!pq.empty()) {\n auto data = pq.top();\n pq.pop();\n cout << (data.second + 1) << endl;\n cout << (data.first + 1) << endl;\n int k = data.first + 10000 * data.second;\n if (result_map.find(k) != result_map.end()) {\n for (auto result : result_map[k]) {\n pq.push(result);\n }\n }\n }\n return 0;\n}","accuracy":0.6612903225806451,"time_ms":190,"memory_kb":37520,"score_of_the_acc":-0.2792,"final_rank":4},{"submission_id":"aoj_3025_3633775","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <unordered_map>\n#include <tuple>\n\nusing namespace std;\n\nbool select(const vector<tuple<int, int, int>> &line_ns, int line_ns_st,\n const vector<tuple<int, int, int>> &line_ew, int line_ew_st,\n int x, int y, int width, int height, int N,\n int px, int py, vector<tuple<int, int, int, int>> &results) {\n int result_x = -1;\n int result_y = -1;\n int line_ns_st_next = line_ns_st;\n int line_ew_st_next = line_ew_st;\n if (width == 0 || height == 0) {\n return true;\n }\n bool white = true;\n for (int i = line_ns_st; i < line_ns.size(); ++i) {\n if (get<2>(line_ns[i]) >= x + width) {\n break;\n }\n if (!(y + height <= get<0>(line_ns[i]) || get<1>(line_ns[i]) <= y)) {\n white = false;\n }\n if (get<0>(line_ns[i]) <= y && y + height <= get<1>(line_ns[i])) {\n result_x = get<2>(line_ns[i]);\n line_ns_st_next = i + 1;\n for (int i = line_ew_st; i < line_ew.size(); ++i) {\n if (get<2>(line_ew[i]) >= y + height) {\n break;\n }\n if (get<0>(line_ew[i]) <= x && x + width <= get<1>(line_ew[i])) {\n result_y = get<2>(line_ew[i]);\n line_ew_st_next = i + 1;\n vector<tuple<int, int, int, int>> child_results;\n bool ok = select(line_ns, line_ns_st, line_ew, line_ew_st, x, y, result_x - x, result_y - y, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st, line_ew, line_ew_st_next, x, result_y + 1, result_x - x, height - (result_y - y) - 1, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st_next, line_ew, line_ew_st, result_x + 1, y, width - (result_x - x) - 1, result_y - y, N, result_x, result_y, child_results) &&\n select(line_ns, line_ns_st_next, line_ew, line_ew_st_next, result_x + 1, result_y + 1, width - (result_x - x) - 1, height - (result_y - y) - 1, N, result_x, result_y, child_results);\n if (ok) {\n results.emplace_back(result_x, result_y, px, py);\n for (auto child_result : child_results) {\n results.emplace_back(child_result);\n }\n return true;\n }\n }\n }\n }\n }\n if (white) {\n return true;\n }\n return false;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<char> A(N * N);\n for (int j = 0; j < N; ++j) {\n for (int i = 0; i < N; ++i) {\n cin >> A[i + N * j];\n }\n }\n vector<tuple<int, int, int>> line_ns;\n vector<tuple<int, int, int>> line_ew;\n for (int j = 0; j < N; ++j) {\n int st = -1;\n for (int i = 0; i < N; ++i) {\n if (A[i + N * j] == 'x') {\n if (st == -1) {\n st = i;\n }\n } else if (st != -1) {\n line_ew.emplace_back(st, i, j);\n st = -1;\n }\n }\n if (st != -1) {\n line_ew.emplace_back(st, N, j);\n }\n }\n for (int i = 0; i < N; ++i) {\n int st = -1;\n for (int j = 0; j < N; ++j) {\n if (A[i + N * j] == 'x') {\n if (st == -1) {\n st = j;\n }\n } else if (st != -1) {\n line_ns.emplace_back(st, j, i);\n st = -1;\n }\n }\n if (st != -1) {\n line_ns.emplace_back(st, N, i);\n }\n }\n vector<tuple<int, int, int, int>> results;\n if (!select(line_ns, 0,\n line_ew, 0,\n 0, 0, N, N, N, -1, -1, results)) {\n cout << -1 << endl;\n return 0;\n };\n unordered_map<int, vector<pair<int, int>>> result_map;\n for (auto result : results) {\n int k = get<2>(result) + 10000 * get<3>(result);\n if (result_map.find(k) == result_map.end()) {\n result_map.emplace(k, vector<pair<int, int>> {});\n }\n result_map[k].emplace_back(make_pair(get<0>(result), get<1>(result)));\n }\n auto comp = [](const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } };\n priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(comp)> pq(comp);\n pq.push(result_map[-1 + 10000 * (-1)][0]);\n cout << results.size() << endl;\n while (!pq.empty()) {\n auto data = pq.top();\n pq.pop();\n cout << (data.second + 1) << endl;\n cout << (data.first + 1) << endl;\n int k = data.first + 10000 * data.second;\n if (result_map.find(k) != result_map.end()) {\n for (auto result : result_map[k]) {\n pq.push(result);\n }\n }\n }\n return 0;\n}","accuracy":0.5967741935483871,"time_ms":180,"memory_kb":37516,"score_of_the_acc":-0.2709,"final_rank":6},{"submission_id":"aoj_3025_2555263","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\n#define MAX 2050\n\nint N;\nchar t[MAX][MAX];\nbool T[MAX][MAX];\nint a[MAX][MAX];\nint b[MAX][MAX];\n\nmap < P , vector<P> > G;\n\nbool inField(int y,int x){\n return (0<=y&&y<N&&0<=x&&x<N);\n}\n\nbool inField(P p){\n return inField(p.first,p.second);\n}\n\nbool inField(int ay,int ax,int by,int bx,P p){\n int y=p.first;\n int x=p.second;\n return (ay<y&&y<by&&ax<x&&x<bx);\n}\n\nmap< P , P > mem[4];\n\nP search(P p,int dir){\n if(mem[dir].count(p))return mem[dir][p];\n int Dy[]={-1,-1,1,1};\n int Dx[]={-1,1,1,-1};\n int dy=Dy[dir];\n int dx=Dx[dir];\n int y=p.first+dy;\n int x=p.second+dx;\n while(inField(y+dy,x)&&t[y+dy][x]=='o')y+=dy;\n while(inField(y,x+dx)&&t[y][x+dx]=='o')x+=dx;\n return mem[dir][p]=P(y+dy,x+dx);\n}\n\nvoid put(P p,int dir){\n int y=p.first;\n int x=p.second;\n int dy[]={-1,0,1,0};\n int dx[]={0,1,0,-1};\n T[y][x]=false;\n while(inField(y,x)&&!T[y][x]){\n T[y][x]=true;\n y+=dy[dir];\n x+=dx[dir];\n }\n}\n\n\nset< P > st;\n\nP solve(int ay,int ax,int by,int bx){\n P sp=P(-1,-1);\n P tmp=P(ay,ax);\n while(1){\n if(mem[2].count(tmp))break;\n tmp=search(tmp,2);\n if(!inField(ay,ax,by,bx,tmp))break;\n if(st.count(tmp)){\n sp=tmp;\n }\n st.insert(tmp);\n }\n tmp=P(by,ax);\n while(1){\n if(mem[1].count(tmp))break;\n tmp=search(tmp,1);\n if(!inField(ay,ax,by,bx,tmp))break;\n if(st.count(tmp)){\n sp=tmp;\n }\n st.insert(tmp);\n }\n if(sp.first==-1)return P(-1,-1);\n if(sp.first<=ay || sp.second<=ax)return P(-1,-1);\n if(sp.first>=by || sp.second>=bx)return P(-1,-1);\n P LU=solve(ay,ax,sp.first,sp.second);\n P LD=solve(sp.first,ax,by,sp.second);\n P RU=solve(ay,sp.second,sp.first,bx);\n P RD=solve(sp.first,sp.second,by,bx);\n if(LU.first!=-1)G[ sp ].push_back(LU);\n if(LD.first!=-1)G[ sp ].push_back(LD);\n if(RU.first!=-1)G[ sp ].push_back(RU);\n if(RD.first!=-1)G[ sp ].push_back(RD);\n return sp;\n}\n\nint main(){\n \n\n scanf(\"%d\",&N);\n bool flag=false;\n for(int i=0;i<N;i++){\n scanf(\"%s\",t[i]);\n for(int j=0;j<N;j++)\n if(t[i][j]=='x')flag=true;\n }\n if(!flag){\n cout<<0<<endl;\n return 0;\n }\n \n P sp=solve(-1,-1,N,N);\n\n map<P,bool> flg;\n priority_queue< P , vector<P> , greater<P> > Q;\n flg[ sp ]=true;\n Q.push( sp );\n \n vector<P> ans;\n while(!Q.empty()){\n P p=Q.top();\n\n Q.pop();\n ans.push_back(p);\n\n if(T[p.first][p.second]){\n printf(\"-1\\n\");\n return 0;\n }\n \n for(int i=0;i<4;i++){\n put(p,i);\n }\n \n for(int i=0;i<(int)G[p].size();i++){\n P to=G[p][i];\n if(to==P(-1,-1))continue;\n if(flg[to])continue;\n if(!inField(to))continue;\n flg[to]=true;\n Q.push(to);\n }\n }\n\n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n if( (t[i][j]=='x') != T[i][j] ){\n printf(\"-1\\n\");\n return 0;\n }\n }\n }\n\n printf(\"%d\\n\",(int)ans.size());\n for(int i=0;i<(int)ans.size();i++){\n printf(\"%d\\n\",ans[i].first+1);\n printf(\"%d\\n\",ans[i].second+1);\n }\n return 0;\n}","accuracy":1,"time_ms":1240,"memory_kb":214416,"score_of_the_acc":-2,"final_rank":3},{"submission_id":"aoj_3025_2542739","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int,int> P;\n\n#define fi first\n#define se second\n\n#define MAX 2055\n\nchar s[MAX][MAX];\n\nint n;\n\nint dx1[]={0,0,1,-1};\nint dy1[]={1,-1,0,0};\nint dx2[]={1,-1};\nint dy2[]={1,1};\n\nint color[MAX][MAX];\nint table[MAX][MAX];\nint cnt[MAX][MAX];\n\nbool used[2][MAX][MAX];\n\nmap<P,vector<P> >Tree;\n\nvector<P>ans;\n\nvoid BAD_END(){\n\tcout<<-1<<endl;\n\texit(0);\n}\n\nvoid Input(){\n\tcin>>n;\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\"%s\",s[i]);\n\t}\n}\n\nbool in(int a,int b){\n\treturn !(a<0||a>=n||b<0||b>=n);\n}\n\nbool in2(int a,int b,pair<P,P> c){\n\treturn !(c.fi.se>a||c.se.se<a||c.fi.fi>b||c.se.fi<b);\n}\n\nvoid area_paint(int x,int y,int k){\n\tqueue<P>q;\n\tq.push(P(x,y));\n\tcolor[y][x]=k;\n\twhile(!q.empty()){\n\t\tP p=q.front();q.pop();\n\t\ty=p.se;\n\t\tx=p.fi;\n\t for(int i=0;i<4;i++){\n\t\t int x1=x+dx1[i];\n\t\t int y1=y+dy1[i];\n\t\t if(in(x1,y1)&&s[y1][x1]=='o'&&!color[y1][x1]){\n\t\t\t q.push(P(x1,y1));\n\t\t\t color[y1][x1]=k;\n\t\t }\n\t }\n\t}\n}\n\nvoid pre_fill(){\n\tint k=1;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif(s[i][j]=='o'&&!color[i][j]){\n\t\t\t\tarea_paint(j,i,k++);\n\t\t\t}\n\t\t}\n\t}\n}\n\nP get_center(P p,int k,pair<P,P> v){\n\tP cent=P(-1,-1);\n\tint y=p.se,Y=p.se,p1;\n\tint x=p.fi,X=p.fi,p2;\n\n\twhile(1){\n\n\t while(used[k][y][x]){\n\t \treturn P(-1,-1);\n\t }\n\n\t while(1){\n\t\t if(in(y,x)&&s[y][x]=='o'){\n\t\t\t y+=dy2[k];\n\t\t }\n\t\t else break;\n\t }\n\t y-=dy2[k];\n\n\t while(1){\n\t\t if(in(y,x)&&s[y][x]=='o'){\n\t\t\t x+=dx2[k];\n\t\t }\n\t\t else break;\n\t }\n\t y+=dy2[k];\n\n\t if(!in2(y,x,v)) break;\n\n\t used[k][Y][X]=1;\n\t cnt[y][x]++;\n\t Y=y+dy2[k],X=x+dx2[k];\n\n\t if(cnt[y][x]==2) cent=P(x,y);\n\n\t y+=dy2[k];\n\t x+=dx2[k];\n\n\t //if(!in2(y,x,v)) break;\n\t}\n\n\treturn cent;\n}\nP make_tree(int x1,int y1,int x2,int y2){\n\n\tif(color[y1][x1]==color[y2][x2])return P(-1,-1);\n\n\tP center;\n\tP tmp[4];\n\tpair<P,P>p;\n\n\tp=make_pair(P(x1,y1),P(x2,y2));\n\n\ttmp[0]=P(x1,y1);\n\ttmp[1]=P(x2,y1);\n\ttmp[2]=P(-1,-1);\n\ttmp[3]=P(-1,-1);\n\n\tfor(int i=0;i<2;i++){\n\t\tcenter=get_center(tmp[i],i,p);\n\t\tif(center.fi!=-1){\n\t\t\tbreak;\n\t\t}\n\t\ttmp[i]=P(-1,-1);\n\t}\n\n\tif(center.fi!=-1)tmp[0]=make_tree(x1,y1,center.fi-1,center.se-1);\n\tif(center.fi!=-1)tmp[1]=make_tree(center.fi+1,y1,x2,center.se-1);\n\tif(center.fi!=-1)tmp[2]=make_tree(x1,center.se+1,center.fi-1,y2);\n\tif(center.fi!=-1)tmp[3]=make_tree(center.fi+1,center.se+1,x2,y2);\n\n\tfor(int i=0;i<4;i++){\n\t\tTree[center].push_back(tmp[i]);\n\t}\n\n\treturn center;\n}\n\nvoid priority_sort(P center){\n\n\tpriority_queue<P,vector<P>,greater<P> >q;\n\tq.push(P(center.se,center.fi));\n\n\twhile(!q.empty()){\n\n\t\tcenter=q.top();q.pop();\n\t\tif(center.fi==-1)continue;\n\n\t\tans.push_back(center);\n\n\t\tfor(int i=0;i<Tree[P(center.se,center.fi)].size();i++){\n\t\t\tq.push(P(Tree[P(center.se,center.fi)][i].se,Tree[P(center.se,center.fi)][i].fi));\n\t\t}\n\t}\n}\n\nvoid cross_fill(P p){\n\tfor(int i=0;i<4;i++){\n\t\tint y=p.fi;\n\t\tint x=p.se;\n\t\twhile(1){\n\t\t\ty+=dy1[i];\n\t\t\tx+=dx1[i];\n\t\t\tif(in(y,x)&&s[y][x]=='x'&&!table[y][x]){\n\t\t\t\ttable[y][x]=1;\n\t\t\t}\n\t\t\telse if(table[y][x]&&in(y,x)) break;\n\t\t\telse if(s[y][x]=='o'&&in(y,x)){\n\t\t\t\tBAD_END();\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t}\n\ttable[p.fi][p.se]=1;\n}\n\nvoid fill_table(){\n\tfor(int i=0;i<ans.size();i++){\n\t\tcross_fill(ans[i]);\n\t}\n}\n\nvoid error_check(){\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif(s[i][j]=='x'&&!table[i][j]){\n\t\t\t\tBAD_END();\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Output(){\n\n\tcout<<ans.size()<<endl;\n\n\tfor(int i=0;i<ans.size();i++){\n\t\tprintf(\"%d\\n%d\\n\",ans[i].fi+1,ans[i].se+1);\n\t}\n}\n\nmain(){\n\tP center;\n\tInput();\n\tpre_fill();\n\tcenter=make_tree(0,0,n-1,n-1);\n\tpriority_sort(center);\n\tfill_table();\n\terror_check();\n\tOutput();\n}","accuracy":1,"time_ms":710,"memory_kb":102760,"score_of_the_acc":-1.0236,"final_rank":1},{"submission_id":"aoj_3025_2538592","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n\n// data structure\n#include <bitset>\n//#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <array>\n//#include <tuple>\n//#include <unordered_map>\n#include <unordered_set>\n#include <complex>\n//#include <deque>\n#include<valarray>\n\n// stream\n//#include <istream>\n//#include <sstream>\n//#include <ostream>\n//#include <fstream>\n\n// etc\n#include <cmath>\n#include <cassert>\n#include <functional>\n#include <iomanip>\n//#include <typeinfo>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\n\n// output\n#define OUT(d) std::cout<<d;\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;\n#define SP std::cout<<\" \";\n#define TAB std::cout<<\"\\t\";\n#define BR std::cout<<\"\\n\";\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\n' : ' ');\n#define ENDL std::cout<<std::endl;\n#define FLUSH std::cout<<std::flush;\n#define SHOW(d) {std::cerr << #d << \"\\t:\" << d << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\n\";}\n\n// utility\n#define ALL(a) (a).begin(),(a).end()\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\n#define IN(a, x, b) (a<=x && x<b)\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \"[Time:\" << res << \"ns (\" << res / (1.0e9) << \"s)]\\n\"; }\n\n// test\ntemplate<class T> std::vector<std::vector<T>> VV(int n) {\n\treturn std::vector<std::vector<T>>(n);\n}\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\n\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\n}\ntemplate<typename S, typename T>\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\n\tos << \"(\" << p.first << \", \" << p.second << \")\"; return os;\n}\n\n// type/const\n\n//#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\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-7;\nconstexpr int MOD = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\n\nint n;\nint ans;\nchar a[2100][2100];\nstd::map<PAIR, std::vector<PAIR>> g;\n\nvoid erase(PAIR p) {\n\tfor (auto v : g[p]) erase(v);\n\tg.erase(p);\n}\n\nPAIR OK(-1, -1);\nPAIR NG(-2, -2);\n\nPAIR dfs(int y1, int x1, int y2, int x2) {\n\tint cnt = 0;\n\tFOR(i, y1, y2) FOR(j, x1, x2) {\n\t\tcnt += a[i][j] == 'x';\n\t}\n\tif (cnt == 0) return OK;\n\n\tbool res = true;\n\n\tstd::vector<int> Y, X;\n\tFOR(i, y1, y2) {\n\t\tif (i % 2 == 0) continue;\n\t\tbool f = true;\n\t\tFOR(j, x1, x2) {\n\t\t\tif (a[i][j] == 'o') {\n\t\t\t\tf = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f) Y.emplace_back(i);\n\t}\n\tFOR(j, x1, x2) {\n\t\tif (j % 2 == 0) continue;\n\t\tbool f = true;\n\t\tFOR(i, y1, y2) {\n\t\t\tif (a[i][j] == 'o') {\n\t\t\t\tf = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (f) X.emplace_back(j);\n\t}\n\tif (Y.empty() && X.empty()) {\n\t\tif (cnt > 0) return NG;\n\t\treturn OK;\n\t}\n\tif (Y.empty() || X.empty()) return NG;\n\n\tfor (auto yi : Y) for (auto xi : X) {\n\t\t{\n\t\t\tPAIR p = dfs(y1, x1, yi, xi);\n\t\t\tif (p == NG) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if(p != OK) g[PAIR(yi, xi)].emplace_back(p);\n\t\t}\n\t\t{\n\t\t\tPAIR p = dfs(y1, xi + 1, yi, x2);\n\t\t\tif (p == NG) {\n\t\t\t\terase(PAIR(yi, xi));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\n\t\t}\n\t\t{\n\t\t\tPAIR p = dfs(yi + 1, x1, y2, xi);\n\t\t\tif (p == NG) {\n\t\t\t\terase(PAIR(yi, xi));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\n\t\t}\n\t\t{\n\t\t\tPAIR p = dfs(yi + 1, xi + 1, y2, x2);\n\t\t\tif (p == NG) {\n\t\t\t\terase(PAIR(yi, xi));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\n\t\t}\n\t\treturn PAIR(yi, xi);\n\t}\n\treturn NG;\n}\n\nsigned main() {\n\tINIT;\n\tVAR(int, n);\n\tREP(i, n) REP(j, n) {\n\t\tstd::cin >> a[i][j];\n\t}\n\tPAIR root = dfs(0, 0, n, n);\n\tif (root == NG) {\n\t\tOUT(-1)BR;\n\t\treturn 0;\n\t}\n\tstd::vector<PAIR> ans;\n\tstd::set<PAIR> set;\n\tset.insert(root);\n\twhile (!set.empty()) {\n\t\tPAIR top = *(set.begin());\n\t\tset.erase(top);\n\t\tfor (auto x : g[top]) set.insert(x);\n\t\tans.emplace_back(top);\n\t}\n\tOUT(ans.size())BR;\n\tREP(i, ans.size()) {\n\t\tOUT(ans[i].first + 1)BR;\n\t\tOUT(ans[i].second + 1)BR;\n\t}\n\treturn 0;\n}","accuracy":0.5967741935483871,"time_ms":30,"memory_kb":7312,"score_of_the_acc":-0.0013,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_3025_3650106\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <tuple>\\n\\nusing namespace std;\\n\\nstruct Rect {\\n int x;\\n int y;\\n int width;\\n int height;\\n int cross_x;\\n int cross_y;\\n};\\n\\ntemplate<typename T>\\nstruct RPN {\\n deque<T> data;\\n T& operator[](int i) {\\n return data[data.size() - i - 1];\\n }\\n void push(T x) {\\n data.push_back(x);\\n }\\n void pop(int n) {\\n for (int i = 0; i < n; ++i) {\\n data.pop_back();\\n }\\n }\\n int size() {\\n return data.size();\\n }\\n};\\n\\nbool get_tile(vector<char>& A, int N, int x, int y, int& width, int& height) {\\n if (x % 2 != 0 || y % 2 != 0) {\\n return false;\\n }\\n int w = N - x;\\n int h = N - y;\\n for (int i = x; i < N; ++i) {\\n if (A[i + N * y] == 'x') {\\n w = i - x;\\n break;\\n }\\n }\\n for (int i = y; i < N; ++i) {\\n if (A[x + N * i] == 'x') {\\n h = i - y;\\n break;\\n }\\n }\\n if (y + h < N) {\\n for (int i = x; i < x + w; ++i) {\\n if (A[i + N * (y + h)] == 'o') {\\n return false;\\n }\\n }\\n }\\n if (x + w < N) {\\n for (int i = y; i < y + h; ++i) {\\n if (A[x + w + N * i] == 'o') {\\n return false;\\n }\\n }\\n }\\n if (y + h < N && x + w < N) {\\n if (A[x + w + N * (y + h)] == 'o') {\\n return false;\\n }\\n }\\n for (int i = x + 1; i < x + w; ++i) {\\n for (int j = y + 1; j < y + h; ++j) {\\n if (A[i + N * j] == 'x') {\\n return false;\\n }\\n }\\n }\\n width = w;\\n height = h;\\n return true;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<char> A(N * N);\\n unordered_map<int, pair<int, int>> rects;\\n queue<tuple<int, int, int, int>> q;\\n for (int j = 0; j < N; ++j) {\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i + N * j];\\n }\\n }\\n int width;\\n int height;\\n if (!get_tile(A, N, 0, 0, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(0, 0, width, height);\\n rects.emplace(0, make_pair(width, height));\\n while (!q.empty()) {\\n tuple<int, int, int, int> rect = q.front();\\n int x = get<0>(rect);\\n int y = get<1>(rect);\\n int w = get<2>(rect);\\n int h = get<3>(rect);\\n q.pop();\\n if (w != 0 && h != 0) {\\n// cout << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << endl;\\n }\\n rects.emplace(x + 10000 * y, make_pair(w, h));\\n if (x + w < N && rects.find((x + w + 1) + 10000 * y) == rects.end()) {\\n if (!get_tile(A, N, x + w + 1, y, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(x + w + 1, y, width, height);\\n rects.emplace((x + w + 1) + 10000 * y, make_pair(width, height));\\n }\\n if (y + h < N && rects.find(x + 10000 * (y + h + 1)) == rects.end()) {\\n if (!get_tile(A, N, x, y + h + 1, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(x, y + h + 1, width, height);\\n rects.emplace(x + 10000 * (y + h + 1), make_pair(width, height));\\n }\\n }\\n unordered_map<int, vector<int>> tree;\\n RPN<pair<Rect, int>> rpn;\\n if (rects[0].first == N && rects[0].second == N) {\\n cout << 0 << endl;\\n return 0;\\n }\\n rpn.push(make_pair(Rect {0, 0, rects[0].first, rects[0].second, -1, -1}, 0));\\n int merge_count = 0;\\n while (true) {\\n int type = rpn[0].second;\\n if (type == 3) {\\n if (rpn[0].first.width != rpn[3].first.width ||\\n rpn[1].first.width != rpn[2].first.width ||\\n rpn[2].first.height != rpn[3].first.height ||\\n rpn[0].first.height != rpn[1].first.height) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int new_x = rpn[3].first.x;\\n int new_y = rpn[3].first.y;\\n int new_w = rpn[3].first.width + rpn[2].first.width + 1;\\n int new_h = rpn[3].first.height + rpn[0].first.height + 1;\\n int cross_x = rpn[1].first.x - 1;\\n int cross_y = rpn[1].first.y - 1;\\n vector<int> children;\\n if (rpn[0].first.cross_x != -1) {\\n children.emplace_back(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\\n }\\n if (rpn[1].first.cross_x != -1) {\\n children.emplace_back(rpn[1].first.cross_x + 10000 * rpn[1].first.cross_y);\\n }\\n if (rpn[2].first.cross_x != -1) {\\n children.emplace_back(rpn[2].first.cross_x + 10000 * rpn[2].first.cross_y);\\n }\\n if (rpn[3].first.cross_x != -1) {\\n children.emplace_back(rpn[3].first.cross_x + 10000 * rpn[3].first.cross_y);\\n }\\n tree.emplace((rpn[1].first.x - 1) + 10000 * (rpn[1].first.y - 1), children);\\n rpn.pop(4);\\n rpn.push(make_pair(Rect {new_x, new_y, new_w, new_h, cross_x, cross_y}, -1));\\n ++merge_count;\\n// cout << \\\"merge: (\\\" << new_x << \\\", \\\" << new_y << \\\", \\\" << new_w << \\\", \\\" << new_h << \\\")\\\" << endl;\\n } else if (type == 2) {\\n int x = rpn[2].first.x;\\n int y = rpn[2].first.y + rpn[2].first.height + 1;\\n if (y >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else if (type == 1) {\\n int x = rpn[0].first.x;\\n int y = rpn[0].first.y + rpn[0].first.height + 1;\\n if (y >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else if (type == 0) {\\n int x = rpn[0].first.x + rpn[0].first.width + 1;\\n if (x >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int y = rpn[0].first.y;\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else {\\n if (rpn.size() == 1) {\\n if (rpn[0].first.width == N && rpn[0].first.height == N) {\\n break;\\n } else {\\n rpn[0].second = 0;\\n }\\n } else {\\n int prevtype = rpn[1].second;\\n if (prevtype == 2) {\\n if (rpn[0].first.height < rpn[1].first.height) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 3;\\n }\\n } else if (prevtype == 1) {\\n if (rpn[0].first.width < rpn[1].first.width) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 2;\\n }\\n } else if (prevtype == 0) {\\n if (rpn[0].first.height < rpn[1].first.height) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 1;\\n }\\n }\\n }\\n }\\n }\\n priority_queue<int, vector<int>, std::greater<int>> pq;\\n pq.push(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\\n cout << merge_count << endl;\\n while (!pq.empty()) {\\n int cross = pq.top();\\n pq.pop();\\n for (int child_cross : tree[cross]) {\\n pq.push(child_cross);\\n }\\n cout << (cross / 10000 + 1) << endl;\\n cout << (cross % 10000 + 1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1180,\n \"memory_kb\": 71652,\n \"score_of_the_acc\": -1.262,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3025_3650093\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <tuple>\\n\\nusing namespace std;\\n\\nstruct Rect {\\n int x;\\n int y;\\n int width;\\n int height;\\n int cross_x;\\n int cross_y;\\n};\\n\\ntemplate<typename T>\\nstruct RPN {\\n deque<T> data;\\n T& operator[](int i) {\\n return data[data.size() - i - 1];\\n }\\n void push(T x) {\\n data.push_back(x);\\n }\\n void pop(int n) {\\n for (int i = 0; i < n; ++i) {\\n data.pop_back();\\n }\\n }\\n int size() {\\n return data.size();\\n }\\n};\\n\\nbool get_tile(vector<char>& A, int N, int x, int y, int& width, int& height) {\\n if (x % 2 != 0 || y % 2 != 0) {\\n return false;\\n }\\n int w = N - x;\\n int h = N - y;\\n for (int i = x; i < N; ++i) {\\n if (A[i + N * y] == 'x') {\\n w = i - x;\\n break;\\n }\\n }\\n for (int i = y; i < N; ++i) {\\n if (A[x + N * i] == 'x') {\\n h = i - y;\\n break;\\n }\\n }\\n if (y + h < N) {\\n for (int i = x; i < x + w; ++i) {\\n if (A[i + N * (y + h)] == 'o') {\\n return false;\\n }\\n }\\n }\\n if (x + w < N) {\\n for (int i = y; i < y + h; ++i) {\\n if (A[x + w + N * i] == 'o') {\\n return false;\\n }\\n }\\n }\\n if (y + h < N && x + w < N) {\\n if (A[x + w + N * (y + h)] == 'o') {\\n return false;\\n }\\n }\\n for (int i = x + 1; i < x + w; ++i) {\\n for (int j = y + 1; j < y + h; ++j) {\\n if (A[i + N * y] == 'x') {\\n return false;\\n }\\n }\\n }\\n width = w;\\n height = h;\\n return true;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<char> A(N * N);\\n unordered_map<int, pair<int, int>> rects;\\n queue<tuple<int, int, int, int>> q;\\n for (int j = 0; j < N; ++j) {\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i + N * j];\\n }\\n }\\n int width;\\n int height;\\n if (!get_tile(A, N, 0, 0, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(0, 0, width, height);\\n rects.emplace(0, make_pair(width, height));\\n while (!q.empty()) {\\n tuple<int, int, int, int> rect = q.front();\\n int x = get<0>(rect);\\n int y = get<1>(rect);\\n int w = get<2>(rect);\\n int h = get<3>(rect);\\n q.pop();\\n if (w != 0 && h != 0) {\\n// cout << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << endl;\\n }\\n rects.emplace(x + 10000 * y, make_pair(w, h));\\n if (x + w < N && rects.find((x + w + 1) + 10000 * y) == rects.end()) {\\n if (!get_tile(A, N, x + w + 1, y, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(x + w + 1, y, width, height);\\n rects.emplace((x + w + 1) + 10000 * y, make_pair(width, height));\\n }\\n if (y + h < N && rects.find(x + 10000 * (y + h + 1)) == rects.end()) {\\n if (!get_tile(A, N, x, y + h + 1, width, height)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n q.emplace(x, y + h + 1, width, height);\\n rects.emplace(x + 10000 * (y + h + 1), make_pair(width, height));\\n }\\n }\\n unordered_map<int, vector<int>> tree;\\n RPN<pair<Rect, int>> rpn;\\n if (rects[0].first == N && rects[0].second == N) {\\n cout << 0 << endl;\\n return 0;\\n }\\n rpn.push(make_pair(Rect {0, 0, rects[0].first, rects[0].second, -1, -1}, 0));\\n int merge_count = 0;\\n while (true) {\\n int type = rpn[0].second;\\n if (type == 3) {\\n if (rpn[0].first.width != rpn[3].first.width ||\\n rpn[1].first.width != rpn[2].first.width ||\\n rpn[2].first.height != rpn[3].first.height ||\\n rpn[0].first.height != rpn[1].first.height) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int new_x = rpn[3].first.x;\\n int new_y = rpn[3].first.y;\\n int new_w = rpn[3].first.width + rpn[2].first.width + 1;\\n int new_h = rpn[3].first.height + rpn[0].first.height + 1;\\n int cross_x = rpn[1].first.x - 1;\\n int cross_y = rpn[1].first.y - 1;\\n vector<int> children;\\n if (rpn[0].first.cross_x != -1) {\\n children.emplace_back(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\\n }\\n if (rpn[1].first.cross_x != -1) {\\n children.emplace_back(rpn[1].first.cross_x + 10000 * rpn[1].first.cross_y);\\n }\\n if (rpn[2].first.cross_x != -1) {\\n children.emplace_back(rpn[2].first.cross_x + 10000 * rpn[2].first.cross_y);\\n }\\n if (rpn[3].first.cross_x != -1) {\\n children.emplace_back(rpn[3].first.cross_x + 10000 * rpn[3].first.cross_y);\\n }\\n tree.emplace((rpn[1].first.x - 1) + 10000 * (rpn[1].first.y - 1), children);\\n rpn.pop(4);\\n rpn.push(make_pair(Rect {new_x, new_y, new_w, new_h, cross_x, cross_y}, -1));\\n ++merge_count;\\n// cout << \\\"merge: (\\\" << new_x << \\\", \\\" << new_y << \\\", \\\" << new_w << \\\", \\\" << new_h << \\\")\\\" << endl;\\n } else if (type == 2) {\\n int x = rpn[2].first.x;\\n int y = rpn[2].first.y + rpn[2].first.height + 1;\\n if (y >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else if (type == 1) {\\n int x = rpn[0].first.x;\\n int y = rpn[0].first.y + rpn[0].first.height + 1;\\n if (y >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else if (type == 0) {\\n int x = rpn[0].first.x + rpn[0].first.width + 1;\\n if (x >= N) {\\n cout << -1 << endl;\\n return 0;\\n }\\n int y = rpn[0].first.y;\\n int w = rects[x + 10000 * y].first;\\n int h = rects[x + 10000 * y].second;\\n rpn.push(make_pair(Rect {x, y, w, h, -1, -1}, -1));\\n// cout << \\\"add: (\\\" << x << \\\", \\\" << y << \\\", \\\" << w << \\\", \\\" << h << \\\")\\\" << endl;\\n } else {\\n if (rpn.size() == 1) {\\n if (rpn[0].first.width == N && rpn[0].first.height == N) {\\n break;\\n } else {\\n rpn[0].second = 0;\\n }\\n } else {\\n int prevtype = rpn[1].second;\\n if (prevtype == 2) {\\n if (rpn[0].first.height < rpn[1].first.height) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 3;\\n }\\n } else if (prevtype == 1) {\\n if (rpn[0].first.width < rpn[1].first.width) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 2;\\n }\\n } else if (prevtype == 0) {\\n if (rpn[0].first.height < rpn[1].first.height) {\\n rpn[0].second = 0;\\n } else {\\n rpn[0].second = 1;\\n }\\n }\\n }\\n }\\n }\\n priority_queue<int, vector<int>, std::greater<int>> pq;\\n pq.push(rpn[0].first.cross_x + 10000 * rpn[0].first.cross_y);\\n cout << merge_count << endl;\\n while (!pq.empty()) {\\n int cross = pq.top();\\n pq.pop();\\n for (int child_cross : tree[cross]) {\\n pq.push(child_cross);\\n }\\n cout << (cross / 10000 + 1) << endl;\\n cout << (cross % 10000 + 1) << endl;\\n }\\n}\",\n \"accuracy\": 0.08064516129032258,\n \"time_ms\": 160,\n \"memory_kb\": 7040,\n \"score_of_the_acc\": -0.1074,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3025_3633791\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\n#include <unordered_map>\\n#include <tuple>\\n\\nusing namespace std;\\n\\nbool select(const vector<tuple<int, int, int>> &line_ns, int line_ns_st,\\n const vector<tuple<int, int, int>> &line_ew, int line_ew_st,\\n int x, int y, int width, int height, int N,\\n int px, int py, vector<tuple<int, int, int, int>> &results) {\\n int result_x = -1;\\n int result_y = -1;\\n int line_ns_st_next = line_ns_st;\\n int line_ew_st_next = line_ew_st;\\n if (width == 0 || height == 0) {\\n return true;\\n }\\n bool white = true;\\n for (int i = line_ns_st; i < line_ns.size(); ++i) {\\n if (get<2>(line_ns[i]) >= x + width) {\\n break;\\n }\\n if (!(y + height <= get<0>(line_ns[i]) || get<1>(line_ns[i]) <= y)) {\\n white = false;\\n }\\n if (get<0>(line_ns[i]) <= y && y + height <= get<1>(line_ns[i])) {\\n result_x = get<2>(line_ns[i]);\\n line_ns_st_next = i + 1;\\n for (int i = line_ew_st; i < line_ew.size(); ++i) {\\n if (get<2>(line_ew[i]) >= y + height) {\\n break;\\n }\\n if (get<0>(line_ew[i]) <= x && x + width <= get<1>(line_ew[i])) {\\n result_y = get<2>(line_ew[i]);\\n line_ew_st_next = i + 1;\\n vector<tuple<int, int, int, int>> child_results;\\n bool ok = select(line_ns, line_ns_st, line_ew, line_ew_st, x, y, result_x - x, result_y - y, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st, line_ew, line_ew_st_next, x, result_y + 1, result_x - x, height - (result_y - y) - 1, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st_next, line_ew, line_ew_st, result_x + 1, y, width - (result_x - x) - 1, result_y - y, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st_next, line_ew, line_ew_st_next, result_x + 1, result_y + 1, width - (result_x - x) - 1, height - (result_y - y) - 1, N, result_x, result_y, child_results);\\n if (ok) {\\n results.emplace_back(result_x, result_y, px, py);\\n for (auto child_result : child_results) {\\n results.emplace_back(child_result);\\n }\\n return true;\\n }\\n }\\n }\\n }\\n }\\n if (white) {\\n return true;\\n }\\n return false;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<char> A(N * N);\\n for (int j = 0; j < N; ++j) {\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i + N * j];\\n }\\n }\\n vector<tuple<int, int, int>> line_ns;\\n vector<tuple<int, int, int>> line_ew;\\n for (int j = 0; j < N; ++j) {\\n int st = -1;\\n for (int i = 0; i < N; ++i) {\\n if (A[i + N * j] == 'x') {\\n if (st == -1) {\\n st = i;\\n }\\n } else if (st != -1) {\\n line_ew.emplace_back(st, i, j);\\n st = -1;\\n }\\n }\\n if (st != -1) {\\n line_ew.emplace_back(st, N, j);\\n }\\n }\\n for (int i = 0; i < N; ++i) {\\n int st = -1;\\n for (int j = 0; j < N; ++j) {\\n if (A[i + N * j] == 'x') {\\n if (st == -1) {\\n st = j;\\n }\\n } else if (st != -1) {\\n line_ns.emplace_back(st, j, i);\\n st = -1;\\n }\\n }\\n if (st != -1) {\\n line_ns.emplace_back(st, N, i);\\n }\\n }\\n vector<tuple<int, int, int, int>> results;\\n if (!select(line_ns, 0,\\n line_ew, 0,\\n 0, 0, N, N, N, -1, -1, results)) {\\n cout << -1 << endl;\\n return 0;\\n };\\n unordered_map<int, vector<pair<int, int>>> result_map;\\n for (auto result : results) {\\n int k = get<2>(result) + 10000 * get<3>(result);\\n if (result_map.find(k) == result_map.end()) {\\n result_map.emplace(k, vector<pair<int, int>> {});\\n }\\n result_map[k].emplace_back(make_pair(get<0>(result), get<1>(result)));\\n }\\n auto comp = [](const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } };\\n priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(comp)> pq(comp);\\n if (result_map.find(-1 + 10000 * (-1)) == result_map.end()) {\\n cout << 0 << endl;\\n return 0;\\n }\\n pq.push(result_map[-1 + 10000 * (-1)][0]);\\n cout << results.size() << endl;\\n while (!pq.empty()) {\\n auto data = pq.top();\\n pq.pop();\\n cout << (data.second + 1) << endl;\\n cout << (data.first + 1) << endl;\\n int k = data.first + 10000 * data.second;\\n if (result_map.find(k) != result_map.end()) {\\n for (auto result : result_map[k]) {\\n pq.push(result);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.6612903225806451,\n \"time_ms\": 190,\n \"memory_kb\": 37520,\n \"score_of_the_acc\": -0.2792,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3025_3633775\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\n#include <unordered_map>\\n#include <tuple>\\n\\nusing namespace std;\\n\\nbool select(const vector<tuple<int, int, int>> &line_ns, int line_ns_st,\\n const vector<tuple<int, int, int>> &line_ew, int line_ew_st,\\n int x, int y, int width, int height, int N,\\n int px, int py, vector<tuple<int, int, int, int>> &results) {\\n int result_x = -1;\\n int result_y = -1;\\n int line_ns_st_next = line_ns_st;\\n int line_ew_st_next = line_ew_st;\\n if (width == 0 || height == 0) {\\n return true;\\n }\\n bool white = true;\\n for (int i = line_ns_st; i < line_ns.size(); ++i) {\\n if (get<2>(line_ns[i]) >= x + width) {\\n break;\\n }\\n if (!(y + height <= get<0>(line_ns[i]) || get<1>(line_ns[i]) <= y)) {\\n white = false;\\n }\\n if (get<0>(line_ns[i]) <= y && y + height <= get<1>(line_ns[i])) {\\n result_x = get<2>(line_ns[i]);\\n line_ns_st_next = i + 1;\\n for (int i = line_ew_st; i < line_ew.size(); ++i) {\\n if (get<2>(line_ew[i]) >= y + height) {\\n break;\\n }\\n if (get<0>(line_ew[i]) <= x && x + width <= get<1>(line_ew[i])) {\\n result_y = get<2>(line_ew[i]);\\n line_ew_st_next = i + 1;\\n vector<tuple<int, int, int, int>> child_results;\\n bool ok = select(line_ns, line_ns_st, line_ew, line_ew_st, x, y, result_x - x, result_y - y, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st, line_ew, line_ew_st_next, x, result_y + 1, result_x - x, height - (result_y - y) - 1, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st_next, line_ew, line_ew_st, result_x + 1, y, width - (result_x - x) - 1, result_y - y, N, result_x, result_y, child_results) &&\\n select(line_ns, line_ns_st_next, line_ew, line_ew_st_next, result_x + 1, result_y + 1, width - (result_x - x) - 1, height - (result_y - y) - 1, N, result_x, result_y, child_results);\\n if (ok) {\\n results.emplace_back(result_x, result_y, px, py);\\n for (auto child_result : child_results) {\\n results.emplace_back(child_result);\\n }\\n return true;\\n }\\n }\\n }\\n }\\n }\\n if (white) {\\n return true;\\n }\\n return false;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<char> A(N * N);\\n for (int j = 0; j < N; ++j) {\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i + N * j];\\n }\\n }\\n vector<tuple<int, int, int>> line_ns;\\n vector<tuple<int, int, int>> line_ew;\\n for (int j = 0; j < N; ++j) {\\n int st = -1;\\n for (int i = 0; i < N; ++i) {\\n if (A[i + N * j] == 'x') {\\n if (st == -1) {\\n st = i;\\n }\\n } else if (st != -1) {\\n line_ew.emplace_back(st, i, j);\\n st = -1;\\n }\\n }\\n if (st != -1) {\\n line_ew.emplace_back(st, N, j);\\n }\\n }\\n for (int i = 0; i < N; ++i) {\\n int st = -1;\\n for (int j = 0; j < N; ++j) {\\n if (A[i + N * j] == 'x') {\\n if (st == -1) {\\n st = j;\\n }\\n } else if (st != -1) {\\n line_ns.emplace_back(st, j, i);\\n st = -1;\\n }\\n }\\n if (st != -1) {\\n line_ns.emplace_back(st, N, i);\\n }\\n }\\n vector<tuple<int, int, int, int>> results;\\n if (!select(line_ns, 0,\\n line_ew, 0,\\n 0, 0, N, N, N, -1, -1, results)) {\\n cout << -1 << endl;\\n return 0;\\n };\\n unordered_map<int, vector<pair<int, int>>> result_map;\\n for (auto result : results) {\\n int k = get<2>(result) + 10000 * get<3>(result);\\n if (result_map.find(k) == result_map.end()) {\\n result_map.emplace(k, vector<pair<int, int>> {});\\n }\\n result_map[k].emplace_back(make_pair(get<0>(result), get<1>(result)));\\n }\\n auto comp = [](const pair<int, int> &a, const pair<int, int> &b) { if (a.second == b.second) { return a.first > b.first; } else { return a.second > b.second; } };\\n priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(comp)> pq(comp);\\n pq.push(result_map[-1 + 10000 * (-1)][0]);\\n cout << results.size() << endl;\\n while (!pq.empty()) {\\n auto data = pq.top();\\n pq.pop();\\n cout << (data.second + 1) << endl;\\n cout << (data.first + 1) << endl;\\n int k = data.first + 10000 * data.second;\\n if (result_map.find(k) != result_map.end()) {\\n for (auto result : result_map[k]) {\\n pq.push(result);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.5967741935483871,\n \"time_ms\": 180,\n \"memory_kb\": 37516,\n \"score_of_the_acc\": -0.2709,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3025_2555263\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\n#define MAX 2050\\n\\nint N;\\nchar t[MAX][MAX];\\nbool T[MAX][MAX];\\nint a[MAX][MAX];\\nint b[MAX][MAX];\\n\\nmap < P , vector<P> > G;\\n\\nbool inField(int y,int x){\\n return (0<=y&&y<N&&0<=x&&x<N);\\n}\\n\\nbool inField(P p){\\n return inField(p.first,p.second);\\n}\\n\\nbool inField(int ay,int ax,int by,int bx,P p){\\n int y=p.first;\\n int x=p.second;\\n return (ay<y&&y<by&&ax<x&&x<bx);\\n}\\n\\nmap< P , P > mem[4];\\n\\nP search(P p,int dir){\\n if(mem[dir].count(p))return mem[dir][p];\\n int Dy[]={-1,-1,1,1};\\n int Dx[]={-1,1,1,-1};\\n int dy=Dy[dir];\\n int dx=Dx[dir];\\n int y=p.first+dy;\\n int x=p.second+dx;\\n while(inField(y+dy,x)&&t[y+dy][x]=='o')y+=dy;\\n while(inField(y,x+dx)&&t[y][x+dx]=='o')x+=dx;\\n return mem[dir][p]=P(y+dy,x+dx);\\n}\\n\\nvoid put(P p,int dir){\\n int y=p.first;\\n int x=p.second;\\n int dy[]={-1,0,1,0};\\n int dx[]={0,1,0,-1};\\n T[y][x]=false;\\n while(inField(y,x)&&!T[y][x]){\\n T[y][x]=true;\\n y+=dy[dir];\\n x+=dx[dir];\\n }\\n}\\n\\n\\nset< P > st;\\n\\nP solve(int ay,int ax,int by,int bx){\\n P sp=P(-1,-1);\\n P tmp=P(ay,ax);\\n while(1){\\n if(mem[2].count(tmp))break;\\n tmp=search(tmp,2);\\n if(!inField(ay,ax,by,bx,tmp))break;\\n if(st.count(tmp)){\\n sp=tmp;\\n }\\n st.insert(tmp);\\n }\\n tmp=P(by,ax);\\n while(1){\\n if(mem[1].count(tmp))break;\\n tmp=search(tmp,1);\\n if(!inField(ay,ax,by,bx,tmp))break;\\n if(st.count(tmp)){\\n sp=tmp;\\n }\\n st.insert(tmp);\\n }\\n if(sp.first==-1)return P(-1,-1);\\n if(sp.first<=ay || sp.second<=ax)return P(-1,-1);\\n if(sp.first>=by || sp.second>=bx)return P(-1,-1);\\n P LU=solve(ay,ax,sp.first,sp.second);\\n P LD=solve(sp.first,ax,by,sp.second);\\n P RU=solve(ay,sp.second,sp.first,bx);\\n P RD=solve(sp.first,sp.second,by,bx);\\n if(LU.first!=-1)G[ sp ].push_back(LU);\\n if(LD.first!=-1)G[ sp ].push_back(LD);\\n if(RU.first!=-1)G[ sp ].push_back(RU);\\n if(RD.first!=-1)G[ sp ].push_back(RD);\\n return sp;\\n}\\n\\nint main(){\\n \\n\\n scanf(\\\"%d\\\",&N);\\n bool flag=false;\\n for(int i=0;i<N;i++){\\n scanf(\\\"%s\\\",t[i]);\\n for(int j=0;j<N;j++)\\n if(t[i][j]=='x')flag=true;\\n }\\n if(!flag){\\n cout<<0<<endl;\\n return 0;\\n }\\n \\n P sp=solve(-1,-1,N,N);\\n\\n map<P,bool> flg;\\n priority_queue< P , vector<P> , greater<P> > Q;\\n flg[ sp ]=true;\\n Q.push( sp );\\n \\n vector<P> ans;\\n while(!Q.empty()){\\n P p=Q.top();\\n\\n Q.pop();\\n ans.push_back(p);\\n\\n if(T[p.first][p.second]){\\n printf(\\\"-1\\\\n\\\");\\n return 0;\\n }\\n \\n for(int i=0;i<4;i++){\\n put(p,i);\\n }\\n \\n for(int i=0;i<(int)G[p].size();i++){\\n P to=G[p][i];\\n if(to==P(-1,-1))continue;\\n if(flg[to])continue;\\n if(!inField(to))continue;\\n flg[to]=true;\\n Q.push(to);\\n }\\n }\\n\\n for(int i=0;i<N;i++){\\n for(int j=0;j<N;j++){\\n if( (t[i][j]=='x') != T[i][j] ){\\n printf(\\\"-1\\\\n\\\");\\n return 0;\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\",(int)ans.size());\\n for(int i=0;i<(int)ans.size();i++){\\n printf(\\\"%d\\\\n\\\",ans[i].first+1);\\n printf(\\\"%d\\\\n\\\",ans[i].second+1);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1240,\n \"memory_kb\": 214416,\n \"score_of_the_acc\": -2,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3025_2542739\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef pair<int,int> P;\\n\\n#define fi first\\n#define se second\\n\\n#define MAX 2055\\n\\nchar s[MAX][MAX];\\n\\nint n;\\n\\nint dx1[]={0,0,1,-1};\\nint dy1[]={1,-1,0,0};\\nint dx2[]={1,-1};\\nint dy2[]={1,1};\\n\\nint color[MAX][MAX];\\nint table[MAX][MAX];\\nint cnt[MAX][MAX];\\n\\nbool used[2][MAX][MAX];\\n\\nmap<P,vector<P> >Tree;\\n\\nvector<P>ans;\\n\\nvoid BAD_END(){\\n\\tcout<<-1<<endl;\\n\\texit(0);\\n}\\n\\nvoid Input(){\\n\\tcin>>n;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tscanf(\\\"%s\\\",s[i]);\\n\\t}\\n}\\n\\nbool in(int a,int b){\\n\\treturn !(a<0||a>=n||b<0||b>=n);\\n}\\n\\nbool in2(int a,int b,pair<P,P> c){\\n\\treturn !(c.fi.se>a||c.se.se<a||c.fi.fi>b||c.se.fi<b);\\n}\\n\\nvoid area_paint(int x,int y,int k){\\n\\tqueue<P>q;\\n\\tq.push(P(x,y));\\n\\tcolor[y][x]=k;\\n\\twhile(!q.empty()){\\n\\t\\tP p=q.front();q.pop();\\n\\t\\ty=p.se;\\n\\t\\tx=p.fi;\\n\\t for(int i=0;i<4;i++){\\n\\t\\t int x1=x+dx1[i];\\n\\t\\t int y1=y+dy1[i];\\n\\t\\t if(in(x1,y1)&&s[y1][x1]=='o'&&!color[y1][x1]){\\n\\t\\t\\t q.push(P(x1,y1));\\n\\t\\t\\t color[y1][x1]=k;\\n\\t\\t }\\n\\t }\\n\\t}\\n}\\n\\nvoid pre_fill(){\\n\\tint k=1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tif(s[i][j]=='o'&&!color[i][j]){\\n\\t\\t\\t\\tarea_paint(j,i,k++);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nP get_center(P p,int k,pair<P,P> v){\\n\\tP cent=P(-1,-1);\\n\\tint y=p.se,Y=p.se,p1;\\n\\tint x=p.fi,X=p.fi,p2;\\n\\n\\twhile(1){\\n\\n\\t while(used[k][y][x]){\\n\\t \\treturn P(-1,-1);\\n\\t }\\n\\n\\t while(1){\\n\\t\\t if(in(y,x)&&s[y][x]=='o'){\\n\\t\\t\\t y+=dy2[k];\\n\\t\\t }\\n\\t\\t else break;\\n\\t }\\n\\t y-=dy2[k];\\n\\n\\t while(1){\\n\\t\\t if(in(y,x)&&s[y][x]=='o'){\\n\\t\\t\\t x+=dx2[k];\\n\\t\\t }\\n\\t\\t else break;\\n\\t }\\n\\t y+=dy2[k];\\n\\n\\t if(!in2(y,x,v)) break;\\n\\n\\t used[k][Y][X]=1;\\n\\t cnt[y][x]++;\\n\\t Y=y+dy2[k],X=x+dx2[k];\\n\\n\\t if(cnt[y][x]==2) cent=P(x,y);\\n\\n\\t y+=dy2[k];\\n\\t x+=dx2[k];\\n\\n\\t //if(!in2(y,x,v)) break;\\n\\t}\\n\\n\\treturn cent;\\n}\\nP make_tree(int x1,int y1,int x2,int y2){\\n\\n\\tif(color[y1][x1]==color[y2][x2])return P(-1,-1);\\n\\n\\tP center;\\n\\tP tmp[4];\\n\\tpair<P,P>p;\\n\\n\\tp=make_pair(P(x1,y1),P(x2,y2));\\n\\n\\ttmp[0]=P(x1,y1);\\n\\ttmp[1]=P(x2,y1);\\n\\ttmp[2]=P(-1,-1);\\n\\ttmp[3]=P(-1,-1);\\n\\n\\tfor(int i=0;i<2;i++){\\n\\t\\tcenter=get_center(tmp[i],i,p);\\n\\t\\tif(center.fi!=-1){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\ttmp[i]=P(-1,-1);\\n\\t}\\n\\n\\tif(center.fi!=-1)tmp[0]=make_tree(x1,y1,center.fi-1,center.se-1);\\n\\tif(center.fi!=-1)tmp[1]=make_tree(center.fi+1,y1,x2,center.se-1);\\n\\tif(center.fi!=-1)tmp[2]=make_tree(x1,center.se+1,center.fi-1,y2);\\n\\tif(center.fi!=-1)tmp[3]=make_tree(center.fi+1,center.se+1,x2,y2);\\n\\n\\tfor(int i=0;i<4;i++){\\n\\t\\tTree[center].push_back(tmp[i]);\\n\\t}\\n\\n\\treturn center;\\n}\\n\\nvoid priority_sort(P center){\\n\\n\\tpriority_queue<P,vector<P>,greater<P> >q;\\n\\tq.push(P(center.se,center.fi));\\n\\n\\twhile(!q.empty()){\\n\\n\\t\\tcenter=q.top();q.pop();\\n\\t\\tif(center.fi==-1)continue;\\n\\n\\t\\tans.push_back(center);\\n\\n\\t\\tfor(int i=0;i<Tree[P(center.se,center.fi)].size();i++){\\n\\t\\t\\tq.push(P(Tree[P(center.se,center.fi)][i].se,Tree[P(center.se,center.fi)][i].fi));\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid cross_fill(P p){\\n\\tfor(int i=0;i<4;i++){\\n\\t\\tint y=p.fi;\\n\\t\\tint x=p.se;\\n\\t\\twhile(1){\\n\\t\\t\\ty+=dy1[i];\\n\\t\\t\\tx+=dx1[i];\\n\\t\\t\\tif(in(y,x)&&s[y][x]=='x'&&!table[y][x]){\\n\\t\\t\\t\\ttable[y][x]=1;\\n\\t\\t\\t}\\n\\t\\t\\telse if(table[y][x]&&in(y,x)) break;\\n\\t\\t\\telse if(s[y][x]=='o'&&in(y,x)){\\n\\t\\t\\t\\tBAD_END();\\n\\t\\t\\t}\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t}\\n\\ttable[p.fi][p.se]=1;\\n}\\n\\nvoid fill_table(){\\n\\tfor(int i=0;i<ans.size();i++){\\n\\t\\tcross_fill(ans[i]);\\n\\t}\\n}\\n\\nvoid error_check(){\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tif(s[i][j]=='x'&&!table[i][j]){\\n\\t\\t\\t\\tBAD_END();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid Output(){\\n\\n\\tcout<<ans.size()<<endl;\\n\\n\\tfor(int i=0;i<ans.size();i++){\\n\\t\\tprintf(\\\"%d\\\\n%d\\\\n\\\",ans[i].fi+1,ans[i].se+1);\\n\\t}\\n}\\n\\nmain(){\\n\\tP center;\\n\\tInput();\\n\\tpre_fill();\\n\\tcenter=make_tree(0,0,n-1,n-1);\\n\\tpriority_sort(center);\\n\\tfill_table();\\n\\terror_check();\\n\\tOutput();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 102760,\n \"score_of_the_acc\": -1.0236,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3025_2538592\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n\\n// data structure\\n#include <bitset>\\n//#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <array>\\n//#include <tuple>\\n//#include <unordered_map>\\n#include <unordered_set>\\n#include <complex>\\n//#include <deque>\\n#include<valarray>\\n\\n// stream\\n//#include <istream>\\n//#include <sstream>\\n//#include <ostream>\\n//#include <fstream>\\n\\n// etc\\n#include <cmath>\\n#include <cassert>\\n#include <functional>\\n#include <iomanip>\\n//#include <typeinfo>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;\\n\\n// output\\n#define OUT(d) std::cout<<d;\\n#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;\\n#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;\\n#define SP std::cout<<\\\" \\\";\\n#define TAB std::cout<<\\\"\\\\t\\\";\\n#define BR std::cout<<\\\"\\\\n\\\";\\n#define SPBR(i, n) std::cout<<(i + 1 == n ? '\\\\n' : ' ');\\n#define ENDL std::cout<<std::endl;\\n#define FLUSH std::cout<<std::flush;\\n#define SHOW(d) {std::cerr << #d << \\\"\\\\t:\\\" << d << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\n\\\";}\\n\\n// utility\\n#define ALL(a) (a).begin(),(a).end()\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)\\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 FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)\\n#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)\\n#define REPLL(i, n) for(ll i=0;i<ll(n);++i)\\n#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)\\n#define IN(a, x, b) (a<=x && x<b)\\ntemplate<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }\\ntemplate<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\nvoid CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << \\\"[Time:\\\" << res << \\\"ns (\\\" << res / (1.0e9) << \\\"s)]\\\\n\\\"; }\\n\\n// test\\ntemplate<class T> std::vector<std::vector<T>> VV(int n) {\\n\\treturn std::vector<std::vector<T>>(n);\\n}\\ntemplate<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {\\n\\treturn std::vector<std::vector<T>>(n, std::vector<T>(m, init));\\n}\\ntemplate<typename S, typename T>\\nstd::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {\\n\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os;\\n}\\n\\n// type/const\\n\\n//#define int ll\\nusing ll = long long;\\nusing ull = unsigned long long;\\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-7;\\nconstexpr int MOD = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\n\\nint n;\\nint ans;\\nchar a[2100][2100];\\nstd::map<PAIR, std::vector<PAIR>> g;\\n\\nvoid erase(PAIR p) {\\n\\tfor (auto v : g[p]) erase(v);\\n\\tg.erase(p);\\n}\\n\\nPAIR OK(-1, -1);\\nPAIR NG(-2, -2);\\n\\nPAIR dfs(int y1, int x1, int y2, int x2) {\\n\\tint cnt = 0;\\n\\tFOR(i, y1, y2) FOR(j, x1, x2) {\\n\\t\\tcnt += a[i][j] == 'x';\\n\\t}\\n\\tif (cnt == 0) return OK;\\n\\n\\tbool res = true;\\n\\n\\tstd::vector<int> Y, X;\\n\\tFOR(i, y1, y2) {\\n\\t\\tif (i % 2 == 0) continue;\\n\\t\\tbool f = true;\\n\\t\\tFOR(j, x1, x2) {\\n\\t\\t\\tif (a[i][j] == 'o') {\\n\\t\\t\\t\\tf = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (f) Y.emplace_back(i);\\n\\t}\\n\\tFOR(j, x1, x2) {\\n\\t\\tif (j % 2 == 0) continue;\\n\\t\\tbool f = true;\\n\\t\\tFOR(i, y1, y2) {\\n\\t\\t\\tif (a[i][j] == 'o') {\\n\\t\\t\\t\\tf = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (f) X.emplace_back(j);\\n\\t}\\n\\tif (Y.empty() && X.empty()) {\\n\\t\\tif (cnt > 0) return NG;\\n\\t\\treturn OK;\\n\\t}\\n\\tif (Y.empty() || X.empty()) return NG;\\n\\n\\tfor (auto yi : Y) for (auto xi : X) {\\n\\t\\t{\\n\\t\\t\\tPAIR p = dfs(y1, x1, yi, xi);\\n\\t\\t\\tif (p == NG) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\telse if(p != OK) g[PAIR(yi, xi)].emplace_back(p);\\n\\t\\t}\\n\\t\\t{\\n\\t\\t\\tPAIR p = dfs(y1, xi + 1, yi, x2);\\n\\t\\t\\tif (p == NG) {\\n\\t\\t\\t\\terase(PAIR(yi, xi));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\\n\\t\\t}\\n\\t\\t{\\n\\t\\t\\tPAIR p = dfs(yi + 1, x1, y2, xi);\\n\\t\\t\\tif (p == NG) {\\n\\t\\t\\t\\terase(PAIR(yi, xi));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\\n\\t\\t}\\n\\t\\t{\\n\\t\\t\\tPAIR p = dfs(yi + 1, xi + 1, y2, x2);\\n\\t\\t\\tif (p == NG) {\\n\\t\\t\\t\\terase(PAIR(yi, xi));\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\telse if (p != OK) g[PAIR(yi, xi)].emplace_back(p);\\n\\t\\t}\\n\\t\\treturn PAIR(yi, xi);\\n\\t}\\n\\treturn NG;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\tVAR(int, n);\\n\\tREP(i, n) REP(j, n) {\\n\\t\\tstd::cin >> a[i][j];\\n\\t}\\n\\tPAIR root = dfs(0, 0, n, n);\\n\\tif (root == NG) {\\n\\t\\tOUT(-1)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\tstd::vector<PAIR> ans;\\n\\tstd::set<PAIR> set;\\n\\tset.insert(root);\\n\\twhile (!set.empty()) {\\n\\t\\tPAIR top = *(set.begin());\\n\\t\\tset.erase(top);\\n\\t\\tfor (auto x : g[top]) set.insert(x);\\n\\t\\tans.emplace_back(top);\\n\\t}\\n\\tOUT(ans.size())BR;\\n\\tREP(i, ans.size()) {\\n\\t\\tOUT(ans[i].first + 1)BR;\\n\\t\\tOUT(ans[i].second + 1)BR;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5967741935483871,\n \"time_ms\": 30,\n \"memory_kb\": 7312,\n \"score_of_the_acc\": -0.0013,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1874,"cells":{"group_id":{"kind":"string","value":"aoj_3024_cpp"},"problem_description":{"kind":"string","value":"Problem L: RMQ 2\nProblem\n長さ$N$の2つの数列$A$と$B$が与えられる。はじめ、数列$A$の$i$項目は$a_i$であり、数列$B$の$i$項目は$b_i$である。\n以下のような形式の命令文が合計$Q$個与えられるので、与えられた順に処理を行うプログラムを作成せよ。\n各命令文は3つの整数$x,y,z$で表される。\n数列$A$の$y$項目の値を$z$にする。 ($x=1$のとき)\n数列$B$の$y$項目の値を$z$にする。 ($x=2$のとき)\n数列$A$の$y$項目から$z$項目の中で最小の値を見つけて報告する。 ($x=3$のとき)\n数列$B$の$y$項目から$z$項目の中で最小の値を見つけて報告する。 ($x=4$のとき)\n数列$A$を、数列$B$と全く同じになるように変更する。 ($x=5$のとき)\n数列$B$を、数列$A$と全く同じになるように変更する。 ($x=6$のとき)\nInput\n入力は以下の形式で与えられる。\n$N$\n$a_{1}$ $a_{2}$ ... $a_{N}$\n$b_{1}$ $b_{2}$ ... $b_{N}$\n$Q$\n$x_1$ $y_1$ $z_1$\n$x_2$ $y_2$ $z_2$\n...\n$x_Q$ $y_Q$ $z_Q$\nConstraints\n入力は以下の条件を満たす。\n$2 \\le N \\le 2 \\times 10^5$\n$2 \\le Q \\le 2 \\times 10^5$\n$1 \\le a_i \\le 10^9$\n$1 \\le b_i \\le 10^9$\n$1 \\le x_i \\le 6$\n$1 \\le y_i \\le N $ ($1 \\le x_i \\le 4$のとき)\n$y_i = -1$ ($x_i=5, 6$のとき)\n$1 \\le z_i \\le 10^9$ ($x_i=1, 2$のとき)\n$y_i \\le z_i \\le N$ ($x_i=3, 4$のとき)\n$z_i = -1$ ($x_i=5, 6$のとき)\n入力はすべて整数\nOutput\n$x=3$または$x=4$の命令文が入力で与えられる度に、見つけた値を1行に出力する。\nSample Input 1\n5\n1 3 5 7 9\n6 2 3 2 6\n10\n1 3 4\n3 4 5\n4 2 3\n5 -1 -1\n2 3 8\n3 2 5\n4 3 3\n1 1 1\n6 -1 -1\n3 1 5\nSample Output 1\n7\n2\n2\n8\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3024_7108764","code_snippet":"#line 1 \"/home/maspy/compro/library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT pick(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\n\ntemplate <typename T>\nT pick(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(pqg<T> &que) {\n assert(que.size());\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(vc<T> &que) {\n assert(que.size());\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\n// stable\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"/home/maspy/compro/library/other/io.hpp\"\n// based on yosupo's fastio\n#include <unistd.h>\n\nnamespace detail {\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\nstd::true_type check_value(int);\ntemplate <typename T>\nstd::false_type check_value(long);\n} // namespace detail\n\ntemplate <typename T>\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\ntemplate <typename T>\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\ntemplate <typename T>\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\n\nstruct Scanner {\n FILE *fp;\n char line[(1 << 15) + 1];\n size_t st = 0, ed = 0;\n void reread() {\n memmove(line, line + st, ed - st);\n ed -= st;\n st = 0;\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\n line[ed] = '\\0';\n }\n bool succ() {\n while (true) {\n if (st == ed) {\n reread();\n if (st == ed) return false;\n }\n while (st != ed && isspace(line[st])) st++;\n if (st != ed) break;\n }\n if (ed - st <= 50) {\n bool sep = false;\n for (size_t i = st; i < ed; i++) {\n if (isspace(line[i])) {\n sep = true;\n break;\n }\n }\n if (!sep) reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n while (true) {\n size_t sz = 0;\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\n ref.append(line + st, sz);\n st += sz;\n if (!sz || st != ed) break;\n reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n bool neg = false;\n if (line[st] == '-') {\n neg = true;\n st++;\n }\n ref = T(0);\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\n if (neg) ref = -ref;\n return true;\n }\n template <class T, is_modint_t<T> * = nullptr>\n bool read_single(T &ref) {\n long long val = 0;\n bool f = read_single(val);\n ref = T(val);\n return f;\n }\n bool read_single(double &ref) {\n string s;\n if (!read_single(s)) return false;\n ref = std::stod(s);\n return true;\n }\n bool read_single(char &ref) {\n string s;\n if (!read_single(s) || s.size() != 1) return false;\n ref = s[0];\n return true;\n }\n template <class T>\n bool read_single(vector<T> &ref) {\n for (auto &d: ref) {\n if (!read_single(d)) return false;\n }\n return true;\n }\n template <class T, class U>\n bool read_single(pair<T, U> &p) {\n return (read_single(p.first) && read_single(p.second));\n }\n template <class A, class B, class C>\n bool read_single(tuple<A, B, C> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)));\n }\n template <class A, class B, class C, class D>\n bool read_single(tuple<A, B, C, D> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)) && read_single(get<3>(p)));\n }\n void read() {}\n template <class H, class... T>\n void read(H &h, T &... t) {\n bool f = read_single(h);\n assert(f);\n read(t...);\n }\n Scanner(FILE *fp) : fp(fp) {}\n};\n\nstruct Printer {\n Printer(FILE *_fp) : fp(_fp) {}\n ~Printer() { flush(); }\n\n static constexpr size_t SIZE = 1 << 15;\n FILE *fp;\n char line[SIZE], small[50];\n size_t pos = 0;\n void flush() {\n fwrite(line, 1, pos, fp);\n pos = 0;\n }\n void write(const char &val) {\n if (pos == SIZE) flush();\n line[pos++] = val;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n void write(T val) {\n if (pos > (1 << 15) - 50) flush();\n if (val == 0) {\n write('0');\n return;\n }\n if (val < 0) {\n write('-');\n val = -val; // todo min\n }\n size_t len = 0;\n while (val) {\n small[len++] = char(0x30 | (val % 10));\n val /= 10;\n }\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\n pos += len;\n }\n void write(const string &s) {\n for (char c: s) write(c);\n }\n void write(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++) write(s[i]);\n }\n void write(const double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n void write(const long double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n template <class T, is_modint_t<T> * = nullptr>\n void write(T &ref) {\n write(ref.val);\n }\n template <class T>\n void write(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n template <class T, class U>\n void write(const pair<T, U> &val) {\n write(val.first);\n write(' ');\n write(val.second);\n }\n template <class A, class B, class C>\n void write(const tuple<A, B, C> &val) {\n auto &[a, b, c] = val;\n write(a), write(' '), write(b), write(' '), write(c);\n }\n template <class A, class B, class C, class D>\n void write(const tuple<A, B, C, D> &val) {\n auto &[a, b, c, d] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\n }\n template <class A, class B, class C, class D, class E>\n void write(const tuple<A, B, C, D, E> &val) {\n auto &[a, b, c, d, e] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\n }\n template <class A, class B, class C, class D, class E, class F>\n void write(const tuple<A, B, C, D, E, F> &val) {\n auto &[a, b, c, d, e, f] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\n }\n template <class T, size_t S>\n void write(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n void write(i128 val) {\n string s;\n bool negative = 0;\n if(val < 0){\n negative = 1;\n val = -val;\n }\n while (val) {\n s += '0' + int(val % 10);\n val /= 10;\n }\n if(negative) s += \"-\";\n reverse(all(s));\n if (len(s) == 0) s = \"0\";\n write(s);\n }\n};\n\nScanner scanner = Scanner(stdin);\nPrinter printer = Printer(stdout);\n\nvoid flush() { printer.flush(); }\nvoid print() { printer.write('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n printer.write(head);\n if (sizeof...(Tail)) printer.write(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid read() {}\ntemplate <class Head, class... Tail>\nvoid read(Head &head, Tail &... tail) {\n scanner.read(head);\n read(tail...);\n}\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define CHAR(...) \\\n char __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n read(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 2 \"/home/maspy/compro/library/ds/lazysegtree.hpp\"\n\ntemplate <typename Lazy>\nstruct LazySegTree {\n using Monoid_X = typename Lazy::X_structure;\n using Monoid_A = typename Lazy::A_structure;\n using X = typename Monoid_X::value_type;\n using A = typename Monoid_A::value_type;\n int n, log, size;\n vc<X> dat;\n vc<A> laz;\n\n LazySegTree() : LazySegTree(0) {}\n LazySegTree(int n) : LazySegTree(vc<X>(n, Monoid_X::unit())) {}\n LazySegTree(vc<X> v) : n(len(v)) {\n log = 1;\n while ((1 << log) < n) ++log;\n size = 1 << log;\n dat.assign(size << 1, Monoid_X::unit());\n laz.assign(size, Monoid_A::unit());\n FOR(i, n) dat[size + i] = v[i];\n FOR3_R(i, 1, size) update(i);\n }\n\n template <typename F>\n LazySegTree(int n, F f) : n(n) {\n log = 1;\n while ((1 << log) < n) ++log;\n size = 1 << log;\n dat.assign(size << 1, Monoid_X::unit());\n laz.assign(size, Monoid_A::unit());\n FOR(i, n) dat[size + i] = f(i);\n FOR3_R(i, 1, size) update(i);\n }\n\n void reset() {\n fill(all(dat), Monoid_X::unit());\n fill(all(laz), Monoid_A::unit());\n }\n\n void reset(const vc<X>& v) {\n assert(len(v) == n);\n reset();\n FOR(i, n) dat[size + i] = v[i];\n FOR3_R(i, 1, size) update(i);\n }\n\n void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }\n\n void all_apply(int k, A a) {\n dat[k] = Lazy::act(dat[k], a);\n if (k < size) laz[k] = Monoid_A::op(laz[k], a);\n }\n\n void push(int k) {\n all_apply(2 * k, laz[k]);\n all_apply(2 * k + 1, laz[k]);\n laz[k] = Monoid_A::unit();\n }\n\n void set(int p, X x) {\n assert(0 <= p && p < n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n dat[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n X get(int p) {\n assert(0 <= p && p < n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return dat[p];\n }\n\n vc<X> get_all() {\n FOR(i, size) push(i);\n return {dat.begin() + size, dat.begin() + size + n};\n }\n\n X prod(int l, int r) {\n assert(0 <= l && l <= r && r <= n);\n if (l == r) return Monoid_X::unit();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n X xl = Monoid_X::unit(), xr = Monoid_X::unit();\n while (l < r) {\n if (l & 1) xl = Monoid_X::op(xl, dat[l++]);\n if (r & 1) xr = Monoid_X::op(dat[--r], xr);\n l >>= 1;\n r >>= 1;\n }\n\n return Monoid_X::op(xl, xr);\n }\n\n X prod_all() { return dat[1]; }\n\n void apply(int p, A a) {\n assert(0 <= p && p < n);\n p += size;\n dat[p] = Lazy::act(dat[p], a);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n void apply(int l, int r, A a) {\n assert(0 <= l && l <= r && r <= n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, a);\n if (r & 1) all_apply(--r, a);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <typename C>\n int max_right(C& check, int l) {\n assert(0 <= l && l <= n);\n assert(check(Monoid_X::unit()));\n if (l == n) return n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n X sm = Monoid_X::unit();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(Monoid_X::op(sm, dat[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (check(Monoid_X::op(sm, dat[l]))) {\n sm = Monoid_X::op(sm, dat[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = Monoid_X::op(sm, dat[l]);\n l++;\n } while ((l & -l) != l);\n return n;\n }\n\n template <typename C>\n int min_left(C& check, int r) {\n assert(0 <= r && r <= n);\n assert(check(Monoid_X::unit()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n X sm = Monoid_X::unit();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!check(Monoid_X::op(dat[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (check(Monoid_X::op(dat[r], sm))) {\n sm = Monoid_X::op(dat[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = Monoid_X::op(dat[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n void debug() { print(\"lazysegtree getall:\", get_all()); }\n};\n#line 4 \"main.cpp\"\n\nstruct MonoX {\n using value_type = pair<int, int>;\n using X = value_type;\n static X op(X x, X y) { return {min(x.fi, y.fi), min(x.se, y.se)}; }\n static constexpr X unit() {\n constexpr int mx = numeric_limits<int>::max();\n return {mx, mx};\n }\n static constexpr bool commute = 1;\n};\n\nstruct MonoA {\n using value_type = int;\n using X = value_type;\n static X op(X x, X y) {\n if (x == 0) return y;\n return x;\n }\n static constexpr X unit() { return 0; }\n static constexpr bool commute = 0;\n};\n\nstruct Lazy {\n using MX = MonoX;\n using MA = MonoA;\n using X_structure = MX;\n using A_structure = MA;\n using X = typename MX::value_type;\n using A = typename MA::value_type;\n static constexpr X act(const X &x, const A &a) {\n if (a == 0) return x;\n if (a == 1) return {x.fi, x.fi};\n return {x.se, x.se};\n }\n};\n\nvoid solve() {\n LL(N);\n VEC(int, A, N);\n VEC(int, B, N);\n LazySegTree<Lazy> seg(N, [&](int i) -> pair<int, int> {\n return {A[i], B[i]};\n });\n LL(Q);\n FOR(Q) {\n LL(x, y, z);\n --y;\n if (x == 1) {\n auto [a, b] = seg.prod(y, y + 1);\n seg.set(y, {z, b});\n }\n if (x == 2) {\n auto [a, b] = seg.prod(y, y + 1);\n seg.set(y, {a, z});\n }\n if (x == 3) { print(seg.prod(y, z).fi); }\n if (x == 4) { print(seg.prod(y, z).se); }\n if (x == 5) seg.apply(0, N, 2);\n if (x == 6) seg.apply(0, N, 1);\n }\n}\n\nsigned main() {\n cout << fixed << setprecision(15);\n\n ll T = 1;\n // LL(T);\n FOR(T) solve();\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":9848,"score_of_the_acc":-0.0343,"final_rank":1},{"submission_id":"aoj_3024_7108757","code_snippet":"#line 1 \"/home/maspy/compro/library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\n\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// https://trap.jp/post/1224/\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) \\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\n#define all(x) x.begin(), x.end()\n#define len(x) ll(x.size())\n#define elif else if\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sum = 0;\n for (auto &&a: A) sum += a;\n return sum;\n}\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT pick(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\n\ntemplate <typename T>\nT pick(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(pqg<T> &que) {\n assert(que.size());\n T a = que.top();\n que.pop();\n return a;\n}\n\ntemplate <typename T>\nT pick(vc<T> &que) {\n assert(que.size());\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename T, typename U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <typename T, typename U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <typename T, typename U>\npair<T, T> divmod(T x, U y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng) {\n assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return ok;\n}\n\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\n FOR(iter) {\n double x = (ok + ng) / 2;\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\n }\n return (ok + ng) / 2;\n}\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename CNT, typename T>\nvc<CNT> bincount(const vc<T> &A, int size) {\n vc<CNT> C(size);\n for (auto &&x: A) { ++C[x]; }\n return C;\n}\n\n// stable\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n int n = len(I);\n vc<T> B(n);\n FOR(i, n) B[i] = A[I[i]];\n return B;\n}\n#line 1 \"/home/maspy/compro/library/other/io.hpp\"\n// based on yosupo's fastio\n#include <unistd.h>\n\nnamespace detail {\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\nstd::true_type check_value(int);\ntemplate <typename T>\nstd::false_type check_value(long);\n} // namespace detail\n\ntemplate <typename T>\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\ntemplate <typename T>\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\ntemplate <typename T>\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\n\nstruct Scanner {\n FILE *fp;\n char line[(1 << 15) + 1];\n size_t st = 0, ed = 0;\n void reread() {\n memmove(line, line + st, ed - st);\n ed -= st;\n st = 0;\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\n line[ed] = '\\0';\n }\n bool succ() {\n while (true) {\n if (st == ed) {\n reread();\n if (st == ed) return false;\n }\n while (st != ed && isspace(line[st])) st++;\n if (st != ed) break;\n }\n if (ed - st <= 50) {\n bool sep = false;\n for (size_t i = st; i < ed; i++) {\n if (isspace(line[i])) {\n sep = true;\n break;\n }\n }\n if (!sep) reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n while (true) {\n size_t sz = 0;\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\n ref.append(line + st, sz);\n st += sz;\n if (!sz || st != ed) break;\n reread();\n }\n return true;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n bool read_single(T &ref) {\n if (!succ()) return false;\n bool neg = false;\n if (line[st] == '-') {\n neg = true;\n st++;\n }\n ref = T(0);\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\n if (neg) ref = -ref;\n return true;\n }\n template <class T, is_modint_t<T> * = nullptr>\n bool read_single(T &ref) {\n long long val = 0;\n bool f = read_single(val);\n ref = T(val);\n return f;\n }\n bool read_single(double &ref) {\n string s;\n if (!read_single(s)) return false;\n ref = std::stod(s);\n return true;\n }\n bool read_single(char &ref) {\n string s;\n if (!read_single(s) || s.size() != 1) return false;\n ref = s[0];\n return true;\n }\n template <class T>\n bool read_single(vector<T> &ref) {\n for (auto &d: ref) {\n if (!read_single(d)) return false;\n }\n return true;\n }\n template <class T, class U>\n bool read_single(pair<T, U> &p) {\n return (read_single(p.first) && read_single(p.second));\n }\n template <class A, class B, class C>\n bool read_single(tuple<A, B, C> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)));\n }\n template <class A, class B, class C, class D>\n bool read_single(tuple<A, B, C, D> &p) {\n return (read_single(get<0>(p)) && read_single(get<1>(p))\n && read_single(get<2>(p)) && read_single(get<3>(p)));\n }\n void read() {}\n template <class H, class... T>\n void read(H &h, T &... t) {\n bool f = read_single(h);\n assert(f);\n read(t...);\n }\n Scanner(FILE *fp) : fp(fp) {}\n};\n\nstruct Printer {\n Printer(FILE *_fp) : fp(_fp) {}\n ~Printer() { flush(); }\n\n static constexpr size_t SIZE = 1 << 15;\n FILE *fp;\n char line[SIZE], small[50];\n size_t pos = 0;\n void flush() {\n fwrite(line, 1, pos, fp);\n pos = 0;\n }\n void write(const char &val) {\n if (pos == SIZE) flush();\n line[pos++] = val;\n }\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\n void write(T val) {\n if (pos > (1 << 15) - 50) flush();\n if (val == 0) {\n write('0');\n return;\n }\n if (val < 0) {\n write('-');\n val = -val; // todo min\n }\n size_t len = 0;\n while (val) {\n small[len++] = char(0x30 | (val % 10));\n val /= 10;\n }\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\n pos += len;\n }\n void write(const string &s) {\n for (char c: s) write(c);\n }\n void write(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++) write(s[i]);\n }\n void write(const double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n void write(const long double &x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << x;\n string s = oss.str();\n write(s);\n }\n template <class T, is_modint_t<T> * = nullptr>\n void write(T &ref) {\n write(ref.val);\n }\n template <class T>\n void write(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n template <class T, class U>\n void write(const pair<T, U> &val) {\n write(val.first);\n write(' ');\n write(val.second);\n }\n template <class A, class B, class C>\n void write(const tuple<A, B, C> &val) {\n auto &[a, b, c] = val;\n write(a), write(' '), write(b), write(' '), write(c);\n }\n template <class A, class B, class C, class D>\n void write(const tuple<A, B, C, D> &val) {\n auto &[a, b, c, d] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\n }\n template <class A, class B, class C, class D, class E>\n void write(const tuple<A, B, C, D, E> &val) {\n auto &[a, b, c, d, e] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\n }\n template <class A, class B, class C, class D, class E, class F>\n void write(const tuple<A, B, C, D, E, F> &val) {\n auto &[a, b, c, d, e, f] = val;\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\n }\n template <class T, size_t S>\n void write(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) write(' ');\n write(val[i]);\n }\n }\n void write(i128 val) {\n string s;\n bool negative = 0;\n if(val < 0){\n negative = 1;\n val = -val;\n }\n while (val) {\n s += '0' + int(val % 10);\n val /= 10;\n }\n if(negative) s += \"-\";\n reverse(all(s));\n if (len(s) == 0) s = \"0\";\n write(s);\n }\n};\n\nScanner scanner = Scanner(stdin);\nPrinter printer = Printer(stdout);\n\nvoid flush() { printer.flush(); }\nvoid print() { printer.write('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n printer.write(head);\n if (sizeof...(Tail)) printer.write(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid read() {}\ntemplate <class Head, class... Tail>\nvoid read(Head &head, Tail &... tail) {\n scanner.read(head);\n read(tail...);\n}\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define CHAR(...) \\\n char __VA_ARGS__; \\\n read(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n read(__VA_ARGS__)\n\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n read(name)\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n read(name)\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 2 \"/home/maspy/compro/library/ds/lazysegtree.hpp\"\n\ntemplate <typename Lazy>\nstruct LazySegTree {\n using Monoid_X = typename Lazy::X_structure;\n using Monoid_A = typename Lazy::A_structure;\n using X = typename Monoid_X::value_type;\n using A = typename Monoid_A::value_type;\n int n, log, size;\n vc<X> dat;\n vc<A> laz;\n\n LazySegTree() : LazySegTree(0) {}\n LazySegTree(int n) : LazySegTree(vc<X>(n, Monoid_X::unit())) {}\n LazySegTree(vc<X> v) : n(len(v)) {\n log = 1;\n while ((1 << log) < n) ++log;\n size = 1 << log;\n dat.assign(size << 1, Monoid_X::unit());\n laz.assign(size, Monoid_A::unit());\n FOR(i, n) dat[size + i] = v[i];\n FOR3_R(i, 1, size) update(i);\n }\n\n template <typename F>\n LazySegTree(int n, F f) : n(n) {\n log = 1;\n while ((1 << log) < n) ++log;\n size = 1 << log;\n dat.assign(size << 1, Monoid_X::unit());\n laz.assign(size, Monoid_A::unit());\n FOR(i, n) dat[size + i] = f(i);\n FOR3_R(i, 1, size) update(i);\n }\n\n void reset() {\n fill(all(dat), Monoid_X::unit());\n fill(all(laz), Monoid_A::unit());\n }\n\n void reset(const vc<X>& v) {\n assert(len(v) == n);\n reset();\n FOR(i, n) dat[size + i] = v[i];\n FOR3_R(i, 1, size) update(i);\n }\n\n void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }\n\n void all_apply(int k, A a) {\n dat[k] = Lazy::act(dat[k], a);\n if (k < size) laz[k] = Monoid_A::op(laz[k], a);\n }\n\n void push(int k) {\n all_apply(2 * k, laz[k]);\n all_apply(2 * k + 1, laz[k]);\n laz[k] = Monoid_A::unit();\n }\n\n void set(int p, X x) {\n assert(0 <= p && p < n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n dat[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n X get(int p) {\n assert(0 <= p && p < n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return dat[p];\n }\n\n vc<X> get_all() {\n FOR(i, size) push(i);\n return {dat.begin() + size, dat.begin() + size + n};\n }\n\n X prod(int l, int r) {\n assert(0 <= l && l <= r && r <= n);\n if (l == r) return Monoid_X::unit();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n X xl = Monoid_X::unit(), xr = Monoid_X::unit();\n while (l < r) {\n if (l & 1) xl = Monoid_X::op(xl, dat[l++]);\n if (r & 1) xr = Monoid_X::op(dat[--r], xr);\n l >>= 1;\n r >>= 1;\n }\n\n return Monoid_X::op(xl, xr);\n }\n\n X prod_all() { return dat[1]; }\n\n void apply(int p, A a) {\n assert(0 <= p && p < n);\n p += size;\n dat[p] = Lazy::act(dat[p], a);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n void apply(int l, int r, A a) {\n assert(0 <= l && l <= r && r <= n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, a);\n if (r & 1) all_apply(--r, a);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <typename C>\n int max_right(C& check, int l) {\n assert(0 <= l && l <= n);\n assert(check(Monoid_X::unit()));\n if (l == n) return n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n X sm = Monoid_X::unit();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(Monoid_X::op(sm, dat[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (check(Monoid_X::op(sm, dat[l]))) {\n sm = Monoid_X::op(sm, dat[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = Monoid_X::op(sm, dat[l]);\n l++;\n } while ((l & -l) != l);\n return n;\n }\n\n template <typename C>\n int min_left(C& check, int r) {\n assert(0 <= r && r <= n);\n assert(check(Monoid_X::unit()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n X sm = Monoid_X::unit();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!check(Monoid_X::op(dat[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (check(Monoid_X::op(dat[r], sm))) {\n sm = Monoid_X::op(dat[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = Monoid_X::op(dat[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n void debug() { print(\"lazysegtree getall:\", get_all()); }\n};\n#line 4 \"main.cpp\"\n\nstruct MonoX {\n using value_type = pair<int, int>;\n using X = value_type;\n static X op(X x, X y) { return {min(x.fi, y.fi), min(x.se, y.se)}; }\n static constexpr X unit() {\n constexpr int mx = numeric_limits<int>::max();\n return {mx, mx};\n }\n static constexpr bool commute = 1;\n};\n\nstruct MonoA {\n using value_type = int;\n using X = value_type;\n static X op(X x, X y) {\n if (x == 0) return y;\n return x;\n }\n static constexpr X unit() { return 0; }\n static constexpr bool commute = 0;\n};\n\nstruct Lazy {\n using MX = MonoX;\n using MA = MonoA;\n using X_structure = MX;\n using A_structure = MA;\n using X = typename MX::value_type;\n using A = typename MA::value_type;\n static constexpr X act(const X &x, const A &a) {\n if (a == 0) return x;\n if (a == 1) return {x.fi, x.fi};\n return {x.se, x.se};\n }\n};\n\nvoid solve() {\n LL(N);\n VEC(int, A, N);\n VEC(int, B, N);\n LazySegTree<Lazy> seg(N, [&](int i) -> pair<int, int> {\n return {A[i], B[i]};\n });\n LL(Q);\n FOR(Q) {\n LL(x, y, z);\n --y;\n if (x == 1) {\n A[y] = z;\n seg.set(y, {A[y], B[y]});\n }\n if (x == 2) {\n B[y] = z;\n seg.set(y, {A[y], B[y]});\n }\n if (x == 3) { print(seg.prod(y, z).fi); }\n if (x == 4) { print(seg.prod(y, z).se); }\n if (x == 5) seg.apply(0, N, 2);\n if (x == 6) seg.apply(0, N, 1);\n }\n}\n\nsigned main() {\n cout << fixed << setprecision(15);\n\n ll T = 1;\n // LL(T);\n FOR(T) solve();\n\n return 0;\n}","accuracy":0.125,"time_ms":40,"memory_kb":9740,"score_of_the_acc":-0.0231,"final_rank":14},{"submission_id":"aoj_3024_4952396","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class T>\nstruct SegmentTree {\n typedef function<T(T, T)> F;\n int n;\n F f;\n T unit;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\n int _n = v.size();\n init(v.size());\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\n }\n void init(int _n) {\n n = 1;\n while (n < _n) n <<= 1;\n dat.assign(n << 1, unit);\n }\n void update(int k, T newdata) {\n dat[k += n] = newdata;\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\n }\n T query(int a, int b) {\n T vl = unit, vr = unit;\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = f(vl, dat[l++]);\n if (r & 1) vr = f(dat[--r], vr);\n }\n return f(vl, vr);\n }\n};\n\nstruct query {\n int x, y, z;\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\n};\n\nusing P = pair<int, int>;\nint n, q;\nvector<int> a, b;\nvector<query> qu, memo[2];\nSegmentTree<int> seg[2];\n\nint main() {\n cin >> n;\n a.resize(n);\n for (auto &p : a) cin >> p;\n b.resize(n);\n for (auto &p : b) cin >> p;\n cin >> q;\n qu.resize(q);\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\n auto f = [](int l, int r) { return min(l, r); };\n seg[1] = SegmentTree<int>(a, f, 2e9);\n seg[0] = SegmentTree<int>(b, f, 2e9);\n bool copied = 0;\n for (auto [x, y, z] : qu) {\n if (x <= 2) {\n --y;\n int now = seg[x & 1].query(y, y + 1);\n memo[x & 1].emplace_back(y, now, z);\n seg[x & 1].update(y, z);\n } else if (x <= 4)\n cout << seg[x & 1].query(--y, z) << endl;\n else {\n if (!copied)\n seg[x & 1] = seg[(x & 1) ^ 1];\n else {\n while (memo[x & 1].size()) {\n auto [id, bf, af] = memo[x & 1].back();\n seg[x & 1].update(id, bf);\n memo[x & 1].pop_back();\n }\n int len = memo[(x & 1) ^ 1].size();\n for (int j = 0; j < len; ++j) {\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\n seg[x & 1].update(id, af);\n }\n }\n copied = 1;\n memo[0].clear();\n memo[1].clear();\n }\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":11232,"score_of_the_acc":-0.1369,"final_rank":6},{"submission_id":"aoj_3024_4951667","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class T>\nstruct SegmentTree {\n typedef function<T(T, T)> F;\n int n;\n F f;\n T unit;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\n int _n = v.size();\n init(v.size());\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\n }\n void init(int _n) {\n n = 1;\n while (n < _n) n <<= 1;\n dat.assign(n << 1, unit);\n }\n void update(int k, T newdata) {\n dat[k += n] = newdata;\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\n }\n T query(int a, int b) {\n T vl = unit, vr = unit;\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = f(vl, dat[l++]);\n if (r & 1) vr = f(dat[--r], vr);\n }\n return f(vl, vr);\n }\n};\n\nstruct query {\n int x, y, z;\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\n};\n\nusing P = pair<int, int>;\nint n, q;\nvector<int> a, b;\nvector<query> qu, memo[2];\nSegmentTree<int> seg[2];\n\nint main() {\n cin >> n;\n a.resize(n);\n for (auto &p : a) cin >> p;\n b.resize(n);\n for (auto &p : b) cin >> p;\n cin >> q;\n qu.resize(q);\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\n auto f = [](int l, int r) { return min(l, r); };\n seg[1] = SegmentTree<int>(a, f, 2e9);\n seg[0] = SegmentTree<int>(b, f, 2e9);\n bool copied = 0;\n for (auto [x, y, z] : qu) {\n if (x <= 2) {\n --y;\n int now = seg[x & 1].query(y, y + 1);\n memo[x & 1].emplace_back(y, now, z);\n seg[x & 1].update(y, z);\n } else if (x <= 4)\n cout << seg[x & 1].query(--y, z) << endl;\n else {\n if (!copied)\n seg[x & 1] = seg[(x & 1) ^ 1];\n else {\n while (memo[x & 1].size()) {\n auto [id, bf, af] = memo[x & 1].back();\n seg[x & 1].update(id, bf);\n memo[x & 1].pop_back();\n }\n int len = memo[(x & 1) ^ 1].size();\n for (int j = 0; j < len; ++j) {\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\n seg[(x & 1) ^ 1].update(id, af);\n }\n }\n copied = 1;\n memo[0].clear();\n memo[1].clear();\n }\n }\n return 0;\n}","accuracy":0.125,"time_ms":190,"memory_kb":10900,"score_of_the_acc":-0.1086,"final_rank":17},{"submission_id":"aoj_3024_4951640","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class T>\nstruct SegmentTree {\n typedef function<T(T, T)> F;\n int n;\n F f;\n T unit;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\n int _n = v.size();\n init(v.size());\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\n }\n void init(int _n) {\n n = 1;\n while (n < _n) n <<= 1;\n dat.assign(n << 1, unit);\n }\n void update(int k, T newdata) {\n dat[k += n] = newdata;\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\n }\n T query(int a, int b) {\n T vl = unit, vr = unit;\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\n if (l & 1) vl = f(vl, dat[l++]);\n if (r & 1) vr = f(dat[--r], vr);\n }\n return f(vl, vr);\n }\n};\n\nstruct query {\n int x, y, z;\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\n};\n\nusing P = pair<int, int>;\nint n, q;\nvector<int> a, b;\nvector<query> qu, memo[2];\nSegmentTree<int> seg[2];\n\nint main() {\n cin >> n;\n a.resize(n);\n for (auto &p : a) cin >> p;\n b.resize(n);\n for (auto &p : b) cin >> p;\n cin >> q;\n qu.resize(q);\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\n auto f = [](int l, int r) { return min(l, r); };\n seg[1] = SegmentTree<int>(a, f, 2e9);\n seg[0] = SegmentTree<int>(b, f, 2e9);\n bool copied = 0;\n for (auto [x, y, z] : qu) {\n if (x <= 2) {\n int now = seg[x & 1].query(--y, z);\n memo[x & 1].emplace_back(y, now, z);\n seg[x & 1].update(y, z);\n } else if (x <= 4)\n cout << seg[x & 1].query(--y, z) << endl;\n else {\n if (!copied)\n seg[x & 1] = seg[(x & 1) ^ 1];\n else {\n while (memo[x & 1].size()) {\n auto [id, bf, af] = memo[x & 1].back();\n seg[x & 1].update(id, bf);\n memo[x & 1].pop_back();\n }\n int len = memo[(x & 1) ^ 1].size();\n for (int j = 0; j < len; ++j) {\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\n seg[(x & 1) ^ 1].update(id, af);\n }\n }\n copied = 1;\n memo[0].clear();\n memo[1].clear();\n }\n }\n return 0;\n}","accuracy":0.125,"time_ms":130,"memory_kb":10900,"score_of_the_acc":-0.0764,"final_rank":16},{"submission_id":"aoj_3024_4551727","code_snippet":"//四則演算 #pragma GCC target(\"avx\")\n//並列計算 #pragma GCC optimize(\"O3\")\n//条件分岐を減らす #pragma GCC optimize(\"unroll-loops\")\n//浮動小数点演算 #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(i) sort(i.begin(),i.end())\n#define rSORT(i) sort(i.rbegin(),i.rend())\n#define fSORT(i,a) sort(i.begin(),i.end(),a)\n#define all(i) i.begin(),i.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nint main() {\n init();\n\n int n; cin >> n;\n int sq = sqrt(n);\n VI a(n), c(n); cin >> a >> c;\n VI b((n + sq - 1) / sq), d((n + sq - 1) / sq), e((n + sq - 1) / sq);\n //e 0:どちらもコピーされていない 1:Aがコピー元 2:Bがコピー元\n\n {\n int s = INF, t = INF;\n FOR(i, 0, n) {\n chmin(s, a[i]), chmin(t, c[i]);\n if (i == n - 1 || (i + 1) % sq == 0) {\n b[i / sq] = s, d[i / sq] = t;\n s = t = INF;\n }\n }\n }\n\n //type 1:Aをコピーする 2:Bをコピーする\n function<void(int, int)> Trans = [&](int type, int num)->void {\n VI *w = &a, *x = &b, *y = &c, *z = &d;\n if (type == 1)swap(w, y), swap(x, z);\n x->at(num) = z->at(num);\n for (int i = sq * num, m = min(n, sq * (num + 1)); i < m; ++i) {\n w->at(i) = y->at(i);\n }\n };\n function<void(int, int, int, int)> Assign = [&](int type, int idx, int num, int val)->void {\n VI *w = (type == 1 ? &a : &c), *x = (type == 1 ? &b : &d);\n w->at(idx) = val;\n int res = INF;\n for (int i = num * sq, m = min((num + 1) * sq, n); i < m; ++i) {\n chmin(res, w->at(i));\n }\n x->at(num) = res;\n };\n\n int q; cin >> q;\n while (q--) {\n int x, y, z; cin >> x >> y >> z;\n if (x <= 2) {\n --y;\n int num = y / sq;\n if (e[num] != 0) {\n Trans(e[num], num);\n e[num] = 0;\n }\n Assign(x, y, num, z);\n }\n else if (5 <= x) {\n each(i, e)if (i == 0)i = 7 - x;\n }\n else {\n --y;\n int res = INF;\n for (int i = y; i < z;) {\n int num = i / sq, k;\n if (x == 3) {\n if (e[num] == 2)k = 2;\n else k = 1;\n }\n else {\n if (e[num] == 1)k = 1;\n else k = 2;\n }\n\n if (i % sq || z < min(i + sq, n)) {\n chmin(res, (k == 1 ? a[i] : c[i]));\n ++i;\n }\n else {\n chmin(res, (k == 1 ? b[num] : d[num]));\n i += sq;\n }\n }\n print(res);\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":420,"memory_kb":4272,"score_of_the_acc":-0.2045,"final_rank":8},{"submission_id":"aoj_3024_4551725","code_snippet":"//四則演算 #pragma GCC target(\"avx\")\n//並列計算 #pragma GCC optimize(\"O3\")\n//条件分岐を減らす #pragma GCC optimize(\"unroll-loops\")\n//浮動小数点演算 #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define each(i, a) for(auto &i : a)\n#define SORT(i) sort(i.begin(),i.end())\n#define rSORT(i) sort(i.rbegin(),i.rend())\n#define fSORT(i,a) sort(i.begin(),i.end(),a)\n#define all(i) i.begin(),i.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define line cout << \"-----------------------------\\n\" \n#define ENDL(i,n) ((i) == (n) - 1 ? \"\\n\" : \" \")\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\n\nint main() {\n init();\n\n int n; cin >> n;\n int sq = sqrt(n);\n VI a(n), c(n); cin >> a >> c;\n VI b((n + sq - 1) / sq), d((n + sq - 1) / sq), e((n + sq - 1) / sq);\n //e 0:どちらもコピーされていない 1:Aがコピー元 2:Bがコピー元\n\n {\n int s = INF, t = INF;\n FOR(i, 0, n) {\n chmin(s, a[i]), chmin(t, c[i]);\n if (i == n - 1 || (i + 1) % sq == 0) {\n b[i / sq] = s, d[i / sq] = t;\n s = t = INF;\n }\n }\n }\n\n //type 1:Aをコピーする 2:Bをコピーする\n function<void(int, int)> Trans = [&](int type, int num)->void {\n VI *w = &a, *x = &b, *y = &c, *z = &d;\n if (type == 1)swap(w, y), swap(x, z);\n x->at(num) = z->at(num);\n for (int i = sq * num, m = min(n, sq * (num + 1)); i < m; ++i) {\n w->at(i) = y->at(i);\n }\n };\n function<void(int, int, int, int)> Assign = [&](int type, int idx, int num, int val)->void {\n VI *w = (type == 1 ? &a : &c), *x = (type == 1 ? &b : &d);\n w->at(idx) = val;\n int res = INF;\n for (int i = num * sq, m = (num + 1) * sq; i < m; ++i) {\n chmin(res, w->at(i));\n }\n x->at(num) = res;\n };\n\n int q; cin >> q;\n while (q--) {\n int x, y, z; cin >> x >> y >> z;\n if (x <= 2) {\n --y;\n int num = y / sq;\n if (e[num] != 0) {\n Trans(e[num], num);\n e[num] = 0;\n }\n Assign(x, y, num, z);\n }\n else if (5 <= x) {\n each(i, e)if (i == 0)i = 7 - x;\n }\n else {\n --y;\n int res = INF;\n for (int i = y; i < z;) {\n int num = i / sq, k;\n if (x == 3) {\n if (e[num] == 2)k = 2;\n else k = 1;\n }\n else {\n if (e[num] == 1)k = 1;\n else k = 2;\n }\n\n if (i % sq || z < min(i + sq, n)) {\n chmin(res, (k == 1 ? a[i] : c[i]));\n ++i;\n }\n else {\n chmin(res, (k == 1 ? b[num] : d[num]));\n i += sq;\n }\n }\n print(res);\n }\n }\n\n return 0;\n}","accuracy":0.125,"time_ms":90,"memory_kb":4224,"score_of_the_acc":-0.0269,"final_rank":15},{"submission_id":"aoj_3024_3931689","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//BEGIN CUT HERE\ntemplate <typename T>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n F f;\n T ti;\n SegmentTree(F f,T ti):f(f),ti(ti){}\n\n struct Node{\n Node *l,*r;\n T dat;\n Node(T dat):dat(dat){l=r=nullptr;}\n };\n\n Node* clone(Node *a){\n return new Node(*a);\n }\n\n Node* reflect(Node *a){\n a->dat=f(a->l->dat,a->r->dat);\n return a;\n }\n\n int n,height;\n Node* build(const vector<T> &v){\n int n_=v.size();\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n vector<Node*> vs(n<<1);\n for(int i=0;i<n_;i++) vs[n+i]=new Node(v[i]);\n for(int i=n_;i<n;i++) vs[n+i]=new Node(ti);\n for(int i=n-1;i;i--){\n vs[i]=new Node(ti);\n vs[i]->l=vs[(i<<1)|0];\n vs[i]->r=vs[(i<<1)|1];\n reflect(vs[i]);\n }\n return vs[1];\n }\n\n Node* set_val(Node* t,int k,T x,int h){\n t=clone(t);\n if(h<0){\n t->dat=x;\n return t;\n }\n if((k>>h)&1) t->r=set_val(t->r,k,x,h-1);\n else t->l=set_val(t->l,k,x,h-1);\n return reflect(t);\n }\n\n T query(Node* t,int l,int r,int lb,int ub){\n if(r<=lb||ub<=l) return ti;\n if(l<=lb&&ub<=r) return t->dat;\n int m=(lb+ub)>>1;\n return f(query(t->l,l,r,lb,m),query(t->r,l,r,m,ub));\n }\n\n Node* set_val(Node* t,int k,T x){\n return set_val(t,k,x,height-1);\n }\n\n T query(Node* t,int l,int r){\n return query(t,l,r,0,n);\n }\n};\n//END CUT HERE\n//INSERT ABOVE HERE\nsigned HAPPYQUERY_B(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n;\n cin>>n;\n vector<int> as(n);\n for(int i=0;i<n;i++) cin>>as[i];\n\n auto f=[](int a,int b){return min(a,b);};\n int ti=INT_MAX;\n SegmentTree<int> seg(f,ti);\n auto rt=seg.build(as);\n\n vector<decltype(rt)> rts;\n rts.emplace_back(rt);\n\n int q1;\n cin>>q1;\n rts.reserve(q1+1);\n\n for(int i=0;i<q1;i++){\n int p,x;\n cin>>p>>x;\n p--;\n rt=seg.set_val(rt,p,x);\n rts.emplace_back(rt);\n }\n\n int q2;\n cin>>q2;\n int x=0;\n for(int i=0;i<q2;i++){\n int a,b,c;\n cin>>a>>b>>c;\n int k=a^x;\n int l=(b^x)-1;\n int r=(c^x);\n assert(l<r);\n x=seg.query(rts[k],l,r);\n cout<<x<<\"\\n\";\n }\n cout<<flush;\n return 0;\n}\n/*\n verified on 2019/06/22\n https://www.hackerrank.com/contests/happy-query-contest/challenges/minimum-history-query\n*/\n\nsigned AOJ_3024(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n;\n cin>>n;\n vector<int> as(n),bs(n);\n for(int i=0;i<n;i++) cin>>as[i];\n for(int i=0;i<n;i++) cin>>bs[i];\n\n auto f=[](int a,int b){return min(a,b);};\n int ti=INT_MAX;\n SegmentTree<int> seg(f,ti);\n auto ra=seg.build(as);\n auto rb=seg.build(bs);\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int x,y,z;\n cin>>x>>y>>z;\n y--;\n if(x==1) ra=seg.set_val(ra,y,z);\n if(x==2) rb=seg.set_val(rb,y,z);\n if(x==3) cout<<seg.query(ra,y,z)<<\"\\n\";\n if(x==4) cout<<seg.query(rb,y,z)<<\"\\n\";\n if(x==5) ra=seg.clone(rb);\n if(x==6) rb=seg.clone(ra);\n }\n cout<<flush;\n return 0;\n}\n\nsigned main(){\n //HAPPYQUERY_B();\n AOJ_3024();\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":91532,"score_of_the_acc":-0.4573,"final_rank":10},{"submission_id":"aoj_3024_3931623","code_snippet":"#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\n#define MAX_NODE 8000000\nstruct AVL {\n\tstruct Node {\n\t\tNode *l;\n\t\tNode *r;\n\t\tint val;\n\t\tint min;\n\t\tint height;\n\t\tint size;\n\t\tNode *fetch() {\n\t\t\tmin = std::min({val, l->min, r->min});\n\t\t\theight = 1 + std::max(l->height, r->height);\n\t\t\tsize = 1 + l->size + r->size;\n\t\t\treturn this;\n\t\t}\n\t\tNode *rotate_l() {\n\t\t\tNode *new_root = AVL::new_node(r);\n\t\t\tr = new_root->l;\n\t\t\tnew_root->l = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tNode *rotate_r() {\n\t\t\tNode *new_root = AVL::new_node(l);\n\t\t\tl = new_root->r;\n\t\t\tnew_root->r = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tint height_diff() {\n\t\t\treturn l->height - r->height;\n\t\t}\n\t\tNode *balance() {\n\t\t\tint dif = height_diff();\n\t\t\tif (dif == 2) {\n\t\t\t\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\n\t\t\t\treturn rotate_r();\n\t\t\t} else if (dif == -2) {\n\t\t\t\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\n\t\t\t\treturn rotate_l();\n\t\t\t} else return fetch();\n\t\t}\n\t};\n\tstatic Node buf[MAX_NODE];\n\tstatic int head;\n\tstatic Node *NONE;\n\tNode *root = NONE;\n\tAVL() {\n\t\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\n\t}\n\tstatic Node *new_node(Node *node) {\n\t\tif (node == NONE) return node;\n\t\tbuf[head] = *node;\n\t\treturn &buf[head++];\n\t}\n\tNode *push_back(Node *node, int val) {\n\t\tif (node == NONE) {\n\t\t\tbuf[head] = {NONE, NONE, val, val, 1, 1};\n\t\t\treturn &buf[head++];\n\t\t}\n\t\tnode = new_node(node);\n\t\tnode->r = push_back(node->r, val);\n\t\treturn node->balance();\n\t}\n\tNode *assign(Node *node, int index, int val) {\n\t\tnode = new_node(node);\n\t\tint lsize = node->l->size;\n\t\tif (index < lsize) node->l = assign(node->l, index, val);\n\t\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\n\t\telse node->val = val;\n\t\treturn node->balance();\n\t}\n\tint min(Node *node, int l, int r) {\n\t\tif (l <= 0 && r >= node->size) return node->min;\n\t\tint lsize = node->l->size;\n\t\tint res = 1000000000;\n\t\tif (l <= lsize && r > lsize) res = node->val;\n\t\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\n\t\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\n\t\treturn res;\n\t}\n\tvoid dump(Node *node, std::vector<int> &res) {\n\t\tif (node->l != NONE) dump(node->l, res);\n\t\tres.push_back(node->val);\n\t\tif (node->r != NONE) dump(node->r, res);\n\t}\n\tstd::vector<int> dump() {\n\t\tstd::vector<int> res;\n\t\tdump(root, res);\n\t\treturn res;\n\t}\n\tvoid push_back(int val) {\n\t\troot = push_back(root, val);\n\t}\n\tvoid assign(int index, int val) {\n\t\troot = assign(root, index, val);\n\t}\n\tint min(int l, int r) {\n\t\treturn min(root, l, r);\n\t}\n};\nAVL::Node AVL::buf[MAX_NODE];\nint AVL::head = 0;\nAVL::Node *AVL::NONE = AVL::buf;\n\nint main() {\n\tint n = ri();\n\tAVL a, b;\n\tfor (int i = 0; i < n; i++) a.push_back(ri());\n\tfor (int i = 0; i < n; i++) b.push_back(ri());\n\tint q = ri();\n\tfor (int i = 0; i < q; i++) {\n\t\tint t = ri();\n\t\tint y = ri();\n\t\tint z = ri();\n\t\tif (t == 1) a.assign(y - 1, z);\n\t\telse if (t == 2) b.assign(y - 1, z);\n\t\telse if (t == 3) printf(\"%d\\n\", a.min(y - 1, z));\n\t\telse if (t == 4) printf(\"%d\\n\", b.min(y - 1, z));\n\t\telse if (t == 5) a.root = b.root;\n\t\telse if (t == 6) b.root = a.root;\n\t\tif (i % 15000 == 0) {\n\t\t\tstd::vector<int> a_ = a.dump(), b_ = b.dump();\n\t\t\tAVL::head = 1;\n\t\t\ta.root = AVL::NONE;\n\t\t\tb.root = AVL::NONE;\n\t\t\tfor (auto i : a_) a.push_back(i);\n\t\t\tfor (auto i : b_) b.push_back(i);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1180,"memory_kb":242840,"score_of_the_acc":-1.6129,"final_rank":12},{"submission_id":"aoj_3024_3931620","code_snippet":"#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\n#define MAX_NODE 8000000\nstruct AVL {\n\tstruct Node {\n\t\tNode *l;\n\t\tNode *r;\n\t\tint val;\n\t\tint min;\n\t\tint height;\n\t\tint size;\n\t\tNode *fetch() {\n\t\t\tmin = std::min({val, l->min, r->min});\n\t\t\theight = 1 + std::max(l->height, r->height);\n\t\t\tsize = 1 + l->size + r->size;\n\t\t\treturn this;\n\t\t}\n\t\tNode *rotate_l() {\n\t\t\tNode *new_root = AVL::new_node(r);\n\t\t\tr = new_root->l;\n\t\t\tnew_root->l = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tNode *rotate_r() {\n\t\t\tNode *new_root = AVL::new_node(l);\n\t\t\tl = new_root->r;\n\t\t\tnew_root->r = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tint height_diff() {\n\t\t\treturn l->height - r->height;\n\t\t}\n\t\tNode *balance() {\n\t\t\tint dif = height_diff();\n\t\t\tif (dif == 2) {\n\t\t\t\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\n\t\t\t\treturn rotate_r();\n\t\t\t} else if (dif == -2) {\n\t\t\t\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\n\t\t\t\treturn rotate_l();\n\t\t\t} else return fetch();\n\t\t}\n\t};\n\tstatic Node buf[MAX_NODE];\n\tstatic int head;\n\tstatic Node *NONE;\n\tNode *root = NONE;\n\tAVL() {\n\t\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\n\t}\n\tstatic Node *new_node(Node *node) {\n\t\tif (node == NONE) return node;\n\t\tbuf[head] = *node;\n\t\treturn &buf[head++];\n\t}\n\tNode *push_back(Node *node, int val) {\n\t\tif (node == NONE) {\n\t\t\tbuf[head] = {NONE, NONE, val, val, 1, 1};\n\t\t\treturn &buf[head++];\n\t\t}\n\t\tnode = new_node(node);\n\t\tnode->r = push_back(node->r, val);\n\t\treturn node->balance();\n\t}\n\tNode *assign(Node *node, int index, int val) {\n\t\tnode = new_node(node);\n\t\tint lsize = node->l->size;\n\t\tif (index < lsize) node->l = assign(node->l, index, val);\n\t\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\n\t\telse node->val = val;\n\t\treturn node->balance();\n\t}\n\tint min(Node *node, int l, int r) {\n\t\tif (l <= 0 && r >= node->size) return node->min;\n\t\tint lsize = node->l->size;\n\t\tint res = 1000000000;\n\t\tif (l <= lsize && r > lsize) res = node->val;\n\t\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\n\t\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\n\t\treturn res;\n\t}\n\tvoid dump(Node *node, std::vector<int> &res) {\n\t\tif (node->l != NONE) dump(node->l, res);\n\t\tres.push_back(node->val);\n\t\tif (node->r != NONE) dump(node->r, res);\n\t}\n\tstd::vector<int> dump() {\n\t\tstd::vector<int> res;\n\t\tdump(root, res);\n\t\treturn res;\n\t}\n\tvoid push_back(int val) {\n\t\troot = push_back(root, val);\n\t}\n\tvoid assign(int index, int val) {\n\t\troot = assign(root, index, val);\n\t}\n\tint min(int l, int r) {\n\t\treturn min(root, l, r);\n\t}\n};\nAVL::Node AVL::buf[MAX_NODE];\nint AVL::head = 0;\nAVL::Node *AVL::NONE = AVL::buf;\n\nint main() {\n\tint n = ri();\n\tAVL a, b;\n\tfor (int i = 0; i < n; i++) a.push_back(ri());\n\tfor (int i = 0; i < n; i++) b.push_back(ri());\n\tint q = ri();\n\tfor (int i = 0; i < q; i++) {\n\t\tint t = ri();\n\t\tint y = ri();\n\t\tint z = ri();\n\t\tif (t == 1) a.assign(y - 1, z);\n\t\telse if (t == 2) b.assign(y - 1, z);\n\t\telse if (t == 3) printf(\"%d\\n\", a.min(y - 1, z));\n\t\telse if (t == 4) printf(\"%d\\n\", b.min(y - 1, z));\n\t\telse if (t == 5) a.root = b.root;\n\t\telse if (t == 6) b.root = a.root;\n\t\tif (i % 8000 == 0) {\n\t\t\tstd::vector<int> a_ = a.dump(), b_ = b.dump();\n\t\t\tAVL::head = 1;\n\t\t\ta.root = AVL::NONE;\n\t\t\tb.root = AVL::NONE;\n\t\t\tfor (auto i : a_) a.push_back(i);\n\t\t\tfor (auto i : b_) b.push_back(i);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1900,"memory_kb":241076,"score_of_the_acc":-1.9926,"final_rank":13},{"submission_id":"aoj_3024_3931599","code_snippet":"#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\n#define MAX_NODE 8000000\nstruct AVL {\n\tstruct Node {\n\t\tNode *l;\n\t\tNode *r;\n\t\tint val;\n\t\tint min;\n\t\tint height;\n\t\tint size;\n\t\tNode *fetch() {\n\t\t\tmin = std::min({val, l->min, r->min});\n\t\t\theight = 1 + std::max(l->height, r->height);\n\t\t\tsize = 1 + l->size + r->size;\n\t\t\treturn this;\n\t\t}\n\t\tNode *rotate_l() {\n\t\t\tNode *new_root = AVL::new_node(r);\n\t\t\tr = new_root->l;\n\t\t\tnew_root->l = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tNode *rotate_r() {\n\t\t\tNode *new_root = AVL::new_node(l);\n\t\t\tl = new_root->r;\n\t\t\tnew_root->r = this;\n\t\t\tfetch();\n\t\t\tnew_root->fetch();\n\t\t\treturn new_root;\n\t\t}\n\t\tint height_diff() {\n\t\t\treturn l->height - r->height;\n\t\t}\n\t\tNode *balance() {\n\t\t\tint dif = height_diff();\n\t\t\tif (dif == 2) {\n\t\t\t\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\n\t\t\t\treturn rotate_r();\n\t\t\t} else if (dif == -2) {\n\t\t\t\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\n\t\t\t\treturn rotate_l();\n\t\t\t} else return fetch();\n\t\t}\n\t};\n\tstatic Node buf[MAX_NODE];\n\tstatic int head;\n\tstatic Node *NONE;\n\tNode *root = NONE;\n\tAVL() {\n\t\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\n\t}\n\tstatic Node *new_node(Node *node) {\n\t\tif (node == NONE) return node;\n\t\tbuf[head] = *node;\n\t\treturn &buf[head++];\n\t}\n\tNode *push_back(Node *node, int val) {\n\t\tif (node == NONE) {\n\t\t\tbuf[head] = {NONE, NONE, val, val, 1, 1};\n\t\t\treturn &buf[head++];\n\t\t}\n\t\tnode = new_node(node);\n\t\tnode->r = push_back(node->r, val);\n\t\treturn node->balance();\n\t}\n\tNode *assign(Node *node, int index, int val) {\n\t\tnode = new_node(node);\n\t\tint lsize = node->l->size;\n\t\tif (index < lsize) node->l = assign(node->l, index, val);\n\t\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\n\t\telse node->val = val;\n\t\treturn node->balance();\n\t}\n\tint min(Node *node, int l, int r) {\n\t\tif (l <= 0 && r >= node->size) return node->min;\n\t\tint lsize = node->l->size;\n\t\tint res = 1000000000;\n\t\tif (l <= lsize && r > lsize) res = node->val;\n\t\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\n\t\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\n\t\treturn res;\n\t}\n\tvoid push_back(int val) {\n\t\troot = push_back(root, val);\n\t}\n\tvoid assign(int index, int val) {\n\t\troot = assign(root, index, val);\n\t}\n\tint min(int l, int r) {\n\t\treturn min(root, l, r);\n\t}\n};\nAVL::Node AVL::buf[MAX_NODE];\nint AVL::head = 0;\nAVL::Node *AVL::NONE = AVL::buf;\n\nint main() {\n\tint n = ri();\n\tAVL a, b;\n\tfor (int i = 0; i < n; i++) a.push_back(ri());\n\tfor (int i = 0; i < n; i++) b.push_back(ri());\n\tint q = ri();\n\tfor (int i = 0; i < q; i++) {\n\t\tint t = ri();\n\t\tint y = ri();\n\t\tint z = ri();\n\t\tif (t == 1) a.assign(y - 1, z);\n\t\telse if (t == 2) b.assign(y - 1, z);\n\t\telse if (t == 3) printf(\"%d\\n\", a.min(y - 1, z));\n\t\telse if (t == 4) printf(\"%d\\n\", b.min(y - 1, z));\n\t\telse if (t == 5) a.root = b.root;\n\t\telse if (t == 6) b.root = a.root;\n\t}\n\treturn 0;\n}","accuracy":0.125,"time_ms":140,"memory_kb":236752,"score_of_the_acc":-1.0282,"final_rank":20},{"submission_id":"aoj_3024_3924208","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nclass PersistentMinSegTree;\nclass MinSegBranch;\nusing seg = std::shared_ptr<PersistentMinSegTree>;\n\nclass PersistentMinSegTree {\npublic:\n\tvirtual bool is_defined_at(const int position) const = 0;\n\tvirtual int min_of_all() const = 0;\n\tvirtual int min_of(const int from, const int to) const = 0;\n\tvirtual seg updated(const int position, const int new_value) = 0;\n};\nclass MinSegBranch : public PersistentMinSegTree {\n\tseg left, right;\n\tint from, to, min_cache;\npublic:\n\tMinSegBranch(int _from, int _to, const seg& _left, const seg& _right) : left{ _left }, right{ _right }, from{ _from }, to{ _to }, min_cache{ std::min(_left->min_of_all(), _right->min_of_all()) }{};\n\tbool is_defined_at(const int position) const override { return from <= position && position <= to; }\n\tint min_of_all() const override { return min_cache; }\n\tint min_of(const int from, const int to) const override {\n\t\tif (from <= this->from && this->to <= to) {\n\t\t\treturn min_cache;\n\t\t}\n\t\telse if (this->from <= to && from <= this->to) {\n\t\t\treturn std::min(left->min_of(from, to), right->min_of(from, to));\n\t\t}\n\t\telse {\n\t\t\treturn INT_MAX;\n\t\t}\n\t}\n\tseg updated(const int position, const int new_value) override {\n\t\tif (left->is_defined_at(position)) return std::make_shared<MinSegBranch>(from, to, left->updated(position, new_value), right);\n\t\tif (right->is_defined_at(position)) return std::make_shared<MinSegBranch>(from, to, left, right->updated(position, new_value));\n\t\tthrow 0;\n\t}\n};\nclass MinSegLeaf : public PersistentMinSegTree {\n\tint position, value;\npublic:\n\tMinSegLeaf(const int _position, const int _value) : position{ _position }, value{ _value }{};\n\tbool is_defined_at(const int position) const override { return position == this->position; }\n\tint min_of_all() const override { return value; }\n\tint min_of(const int from, const int to) const override { return (from <= position && position <= to) ? value : INT_MAX; }\n\tseg updated(const int position, const int new_value) override {\n\t\treturn (position == this->position) ? std::make_shared<MinSegLeaf>(position, new_value) : throw 0;\n\t}\n};\n\n\nclass MinSegmentTree {\n\tseg root;\n\tstatic seg make(const std::vector<int>& array, const int from, const int until) {\n\t\treturn (until - from == 1) ? std::shared_ptr<PersistentMinSegTree>(new MinSegLeaf(from, array[from])) : std::make_shared<MinSegBranch>(from, until - 1, make(array, from, (from + until) / 2), make(array, (from + until) / 2, until));\n\t}\n\tMinSegmentTree(seg _root) :root{ _root } {};\npublic:\n\tvoid copy_from(const MinSegmentTree& tree) {\n\t\troot = tree.root;\n\t}\n\tstatic MinSegmentTree make(const std::vector<int>& array) {\n\t\treturn MinSegmentTree(make(array, 0, array.size()));\n\t}\n\tvoid update(int position, int new_value) {\n\t\troot = root->updated(position, new_value);\n\t}\n\tint min_of(int from, int to) const {\n\t\treturn root->min_of(from, to);\n\t}\n};\nint main() {\n\tstd::cin.tie(0); std::cin.sync_with_stdio(false);\n\tint n; std::cin >> n;\n\tstd::vector<int> a(n), b(n); for (auto& i : a) std::cin >> i; for (auto& i : b) std::cin >> i;\n\tauto seg_a = MinSegmentTree::make(a);\n\tauto seg_b = MinSegmentTree::make(b);\n\tint q; std::cin >> q;\n\tfor (auto _i = 0; _i < q; ++_i) {\n\t\tint x, y, z; std::cin >> x >> y >> z;\n\t\tswitch (x) {\n\t\tcase 1: seg_a.update(y - 1, z); break;\n\t\tcase 2: seg_b.update(y - 1, z); break;\n\t\tcase 3: std::cout << seg_a.min_of(y - 1, z - 1) << '\\n'; break;\n\t\tcase 4: std::cout << seg_b.min_of(y - 1, z - 1) << '\\n'; break;\n\t\tcase 5: seg_a.copy_from(seg_b); break;\n\t\tcase 6: seg_b.copy_from(seg_a); break;\n\t\tdefault: throw 0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":360,"memory_kb":60952,"score_of_the_acc":-0.4098,"final_rank":9},{"submission_id":"aoj_3024_3880639","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <functional>\nusing namespace std;\n\ntemplate<typename Monoid>\nstruct SegmentTree {\n using F = function<Monoid(Monoid, Monoid)>;\n const F f;\n const Monoid M1;\n int sz;\n vector<Monoid> dat;\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\n while (sz < n) sz <<= 1;\n dat.assign(sz * 2, M1);\n }\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\n void build() {\n for (int k = sz - 1; k > 0; k--) {\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n }\n void update(int k, const Monoid &x) {\n dat[k += sz] = x;\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n Monoid get(int a, int b) { // [a, b)\n Monoid L = M1, R = M1;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) L = f(L, dat[a++]);\n if (b & 1) R = f(dat[--b], R);\n }\n return f(L, R);\n }\n Monoid operator[](const int &k) const { return dat[k + sz]; }\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \" \";\n return os;\n }\n};\n\nconst int INF = numeric_limits<int>::max();\nint main() {\n int n; cin >> n;\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\n seg1.build();\n seg2.build();\n int q; cin >> q;\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\n bool init = true;\n #define eb emplace_back\n while (q--) {\n int x, y, z; cin >> x >> y >> z; y--;\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\n if (x == 3) cout << seg1.get(y, z) << endl;\n if (x == 4) cout << seg2.get(y, z) << endl;\n if (x == 5) {\n if (init) {\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\n init = false;\n } else {\n reverse(a_his.begin(), a_his.end());\n for (auto &p: a_his) seg1.update(p.first, p.second);\n for (auto &p: b_upd) seg1.update(p.first, p.second);\n }\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n if (x == 6) {\n if (init) {\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\n init = false;\n } else {\n reverse(b_his.begin(), b_his.end());\n for (auto &p: b_his) seg2.update(p.first, p.second);\n for (auto &p: a_upd) seg2.update(p.first, p.second);\n }\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n }\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":7060,"score_of_the_acc":-0.1624,"final_rank":7},{"submission_id":"aoj_3024_3880631","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <functional>\nusing namespace std;\n\ntemplate<typename Monoid>\nstruct SegmentTree {\n using F = function<Monoid(Monoid, Monoid)>;\n const F f;\n const Monoid M1;\n int sz;\n vector<Monoid> dat;\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\n while (sz < n) sz <<= 1;\n dat.assign(sz * 2, M1);\n }\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\n void build() {\n for (int k = sz - 1; k > 0; k--) {\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n }\n void update(int k, const Monoid &x) {\n dat[k += sz] = x;\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n Monoid get(int a, int b) { // [a, b)\n Monoid L = M1, R = M1;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) L = f(L, dat[a++]);\n if (b & 1) R = f(dat[--b], R);\n }\n return f(L, R);\n }\n Monoid operator[](const int &k) const { return dat[k + sz]; }\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \" \";\n return os;\n }\n};\n\nconst int INF = numeric_limits<int>::max();\nint main() {\n int n; cin >> n;\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\n int q; cin >> q;\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\n bool init = true;\n #define eb emplace_back\n while (q--) {\n int x, y, z; cin >> x >> y >> z; y--;\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\n if (x == 3) cout << seg1.get(y, z) << endl;\n if (x == 4) cout << seg2.get(y, z) << endl;\n if (x == 5) {\n if (init) {\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\n init = false;\n } else {\n reverse(a_his.begin(), a_his.end());\n for (auto &p: a_his) seg1.update(p.first, p.second);\n for (auto &p: b_upd) seg1.update(p.first, p.second);\n }\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n if (x == 6) {\n if (init) {\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\n init = false;\n } else {\n reverse(b_his.begin(), b_his.end());\n for (auto &p: b_his) seg2.update(p.first, p.second);\n for (auto &p: a_upd) seg2.update(p.first, p.second);\n }\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n }\n return 0;\n}","accuracy":0.125,"time_ms":260,"memory_kb":7060,"score_of_the_acc":-0.1302,"final_rank":19},{"submission_id":"aoj_3024_3880630","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <functional>\nusing namespace std;\n\ntemplate<typename Monoid>\nstruct SegmentTree {\n using F = function<Monoid(Monoid, Monoid)>;\n const F f;\n const Monoid M1;\n int sz;\n vector<Monoid> dat;\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\n while (sz < n) sz <<= 1;\n dat.assign(sz * 2, M1);\n }\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\n void build() {\n for (int k = sz - 1; k > 0; k--) {\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n }\n void update(int k, const Monoid &x) {\n dat[k += sz] = x;\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\n }\n Monoid get(int a, int b) { // [a, b)\n Monoid L = M1, R = M1;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) L = f(L, dat[a++]);\n if (b & 1) R = f(dat[--b], R);\n }\n return f(L, R);\n }\n Monoid operator[](const int &k) const { return dat[k + sz]; }\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \" \";\n return os;\n }\n};\n\nconst int INF = numeric_limits<int>::max();\nint main() {\n int n; cin >> n;\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\n int q; cin >> q;\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\n bool init = true;\n #define eb emplace_back\n while (q--) {\n int x, y, z; cin >> x >> y >> z; y--;\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\n if (x == 3) cout << seg1.get(y, z) << endl;\n if (x == 4) cout << seg2.get(y, z) << endl;\n if (x == 5) {\n if (init) {\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\n init = false;\n continue;\n }\n reverse(a_his.begin(), a_his.end());\n for (auto &p: a_his) seg1.update(p.first, p.second);\n for (auto &p: b_upd) seg1.update(p.first, p.second);\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n if (x == 6) {\n if (init) {\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\n init = false;\n continue;\n }\n reverse(b_his.begin(), b_his.end());\n for (auto &p: b_his) seg2.update(p.first, p.second);\n for (auto &p: a_upd) seg2.update(p.first, p.second);\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\n }\n }\n return 0;\n}","accuracy":0.125,"time_ms":260,"memory_kb":7000,"score_of_the_acc":-0.1299,"final_rank":18},{"submission_id":"aoj_3024_3629207","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\n\nstruct Node{\n int val;\n Node* lhs, *rhs;\n Node(int val):val(val),lhs(nullptr),rhs(nullptr){}\n};\n\nNode* update(Node* t,int l, int r,int k,int x){\n if(k<l||r<=k)return t;\n if(l+1==r){\n Node* ret = new Node(x);\n return ret;\n }\n int mid=(l+r)/2;\n Node* ret = new Node(inf);\n ret->lhs = update(t->lhs,l,mid,k,x);\n ret->rhs = update(t->rhs,mid,r,k,x);\n ret->val = min(ret->lhs->val, ret->rhs->val);\n return ret;\n}\n\nint query(Node* t,int a,int b, int l, int r){\n if(b<=l||r<=a)return inf;\n if(a<=l&&r<=b)return t->val;\n int vl = query(t->lhs, a,b,l,(l+r)/2);\n int vr = query(t->rhs, a,b,(l+r)/2, r);\n return min(vl,vr);\n}\n\nNode* build(vector<int>& v, int l, int r){\n Node* ret = new Node(inf);\n if(l+1==r){\n ret->val=v[l];\n return ret;\n }\n ret->lhs = build(v,l,(l+r)/2);\n ret->rhs = build(v,(l+r)/2,r);\n ret->val = min(ret->lhs->val, ret->rhs->val);\n return ret;\n}\nint main(){\n int n;\n cin>>n;\n int m=1;\n while(m<n)m*=2;\n vector<int> a(m,inf), b(m,inf);\n rep(i,n)cin>>a[i];\n rep(i,n)cin>>b[i];\n Node* A = build(a,0,m);\n Node* B = build(b,0,m);\n int q;\n cin>>q;\n while(q--){\n int x,y,z;\n scanf(\"%d%d%d\",&x,&y,&z);\n --y;\n if(x==1){\n A = update(A, 0, m, y, z);\n }\n if(x==2){\n B = update(B, 0, m, y, z);\n }\n if(x==5){\n A = B;\n }\n if(x==6){\n B = A;\n }\n if(x==3){\n printf(\"%d\\n\",query(A,y,z,0,m));\n }\n if(x==4){\n printf(\"%d\\n\",query(B,y,z,0,m));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":91380,"score_of_the_acc":-0.4997,"final_rank":11},{"submission_id":"aoj_3024_3128421","code_snippet":"#define NDEBUG 1\n#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E,typename F,typename G,typename H>\nstruct SegmentTree{\n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n T query(int k){\n k+=n;\n for(int i=height;i;i--) eval(k>>i);\n return reflect(k);\n }\n void update(int k,T x){\n k+=n;\n //for(int i=height;i;i--) eval(k>>i);\n dat[k]=x;\n laz[k]=ei;\n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n scanf(\"%d\",&n);\n using P = pair<int,int>;\n vector<P> v(n);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].first);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].second);\n auto f=[](P a,P b){\n\t return P(min(a.first,b.first),\n\t\t min(a.second,b.second));\n\t };\n auto g=[](P a,P b){\n\t if(b.first<0){\n\t if(b.second<0) return a;\n\t return P(a.second,a.second);\n\t }\n\t if(b.second<0)\n\t return P(a.first,a.first);\n\t if(b.second<b.first)\n\t return P(a.second,a.second);\n\t return P(a.first,a.first);\n\t };\n auto h=[](P a,P b){\n\t int x=a.first,y=a.second;\n\t if(x<0) x=b.first;\n\t if(y<0) y=b.second;\n\t return P(x,y);\n\t };\n \n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\n rmq.build(n,v);\n \n int q;\n scanf(\"%d\",&q);\n for(int i=0;i<q;i++){\n int x,y,z;\n scanf(\"%d %d %d\",&x,&y,&z);\n y--;\n if(x==1){\n assert(0<=y&&y<n);\n P c=rmq.query(y);\n c.first=z;\n rmq.update(y,c);\n }\n if(x==2){\n assert(0<=y&&y<n);\n P c=rmq.query(y);\n c.second=z;\n rmq.update(y,c);\n }\n if(x==3){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.first);\n }\n if(x==4){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.second);\n }\n if(x==5){\n rmq.query(0,n);\n rmq.update(0,n,P(-1,i));\n }\n if(x==6){\n rmq.query(0,n);\n rmq.update(0,n,P(i,-1));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":14184,"score_of_the_acc":-0.1009,"final_rank":4},{"submission_id":"aoj_3024_3128420","code_snippet":"#define NDEBUG 1\n#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E,typename F,typename G,typename H>\nstruct SegmentTree{\n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n T query(int k){\n k+=n;\n for(int i=height;i;i--) eval(k>>i);\n return reflect(k);\n }\n void update(int k,T x){\n k+=n;\n for(int i=height;i;i--) eval(k>>i);\n dat[k]=x;\n laz[k]=ei;\n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n scanf(\"%d\",&n);\n using P = pair<int,int>;\n vector<P> v(n);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].first);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].second);\n auto f=[](P a,P b){\n\t return P(min(a.first,b.first),\n\t\t min(a.second,b.second));\n\t };\n auto g=[](P a,P b){\n\t if(b.first<0){\n\t if(b.second<0) return a;\n\t return P(a.second,a.second);\n\t }\n\t if(b.second<0)\n\t return P(a.first,a.first);\n\t if(b.second<b.first)\n\t return P(a.second,a.second);\n\t return P(a.first,a.first);\n\t };\n auto h=[](P a,P b){\n\t int x=a.first,y=a.second;\n\t if(x<0) x=b.first;\n\t if(y<0) y=b.second;\n\t return P(x,y);\n\t };\n \n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\n rmq.build(n,v);\n \n int q;\n scanf(\"%d\",&q);\n for(int i=0;i<q;i++){\n int x,y,z;\n scanf(\"%d %d %d\",&x,&y,&z);\n y--;\n if(x==1){\n assert(0<=y&&y<n);\n P c=rmq.query(y);\n c.first=z;\n rmq.update(y,c);\n }\n if(x==2){\n assert(0<=y&&y<n);\n P c=rmq.query(y);\n c.second=z;\n rmq.update(y,c);\n }\n if(x==3){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.first);\n }\n if(x==4){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.second);\n }\n if(x==5){\n rmq.query(0,n);\n rmq.update(0,n,P(-1,i));\n }\n if(x==6){\n rmq.query(0,n);\n rmq.update(0,n,P(i,-1));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":14180,"score_of_the_acc":-0.1009,"final_rank":2},{"submission_id":"aoj_3024_3128414","code_snippet":"#define NDEBUG 1\n#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E,typename F,typename G,typename H>\nstruct SegmentTree{\n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n void update(int k,T x){\n dat[k+=n]=x;\n laz[k]=ei;\n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n scanf(\"%d\",&n);\n using P = pair<int,int>;\n vector<P> v(n);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].first);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].second);\n auto f=[](P a,P b){\n\t return P(min(a.first,b.first),\n\t\t min(a.second,b.second));\n\t };\n auto g=[](P a,P b){\n\t if(b.first<0){\n\t if(b.second<0) return a;\n\t return P(a.second,a.second);\n\t }\n\t if(b.second<0)\n\t return P(a.first,a.first);\n\t if(b.second<b.first)\n\t return P(a.second,a.second);\n\t return P(a.first,a.first);\n\t };\n auto h=[](P a,P b){\n\t int x=a.first,y=a.second;\n\t if(x<0) x=b.first;\n\t if(y<0) y=b.second;\n\t return P(x,y);\n\t };\n \n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\n rmq.build(n,v);\n \n int q;\n scanf(\"%d\",&q);\n for(int i=0;i<q;i++){\n int x,y,z;\n scanf(\"%d %d %d\",&x,&y,&z);\n y--;\n if(x==1){\n assert(0<=y&&y<n);\n P c=rmq.query(y,y+1);\n c.first=z;\n rmq.update(y,c);\n }\n if(x==2){\n assert(0<=y&&y<n);\n P c=rmq.query(y,y+1);\n c.second=z;\n rmq.update(y,c);\n }\n if(x==3){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.first);\n }\n if(x==4){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.second);\n }\n if(x==5){\n rmq.query(0,n);\n rmq.update(0,n,P(-1,i));\n }\n if(x==6){\n rmq.query(0,n);\n rmq.update(0,n,P(i,-1));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":14180,"score_of_the_acc":-0.1009,"final_rank":2},{"submission_id":"aoj_3024_3128413","code_snippet":"#define NDEBUG 1\n#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E,typename F,typename G,typename H>\nstruct SegmentTree{\n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n void update(int k,T x){\n eval(k+=n);\n dat[k]=x; \n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n scanf(\"%d\",&n);\n using P = pair<int,int>;\n vector<P> v(n);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].first);\n for(int i=0;i<n;i++) scanf(\"%d\",&v[i].second);\n auto f=[](P a,P b){\n\t return P(min(a.first,b.first),\n\t\t min(a.second,b.second));\n\t };\n auto g=[](P a,P b){\n\t if(b.first<0){\n\t if(b.second<0) return a;\n\t return P(a.second,a.second);\n\t }\n\t if(b.second<0)\n\t return P(a.first,a.first);\n\t if(b.second<b.first)\n\t return P(a.second,a.second);\n\t return P(a.first,a.first);\n\t };\n auto h=[](P a,P b){\n\t int x=a.first,y=a.second;\n\t if(x<0) x=b.first;\n\t if(y<0) y=b.second;\n\t return P(x,y);\n\t };\n \n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\n rmq.build(n,v);\n \n int q;\n scanf(\"%d\",&q);\n for(int i=0;i<q;i++){\n int x,y,z;\n scanf(\"%d %d %d\",&x,&y,&z);\n y--;\n if(x==1){\n assert(0<=y&&y<n);\n P c=rmq.query(y,y+1);\n c.first=z;\n rmq.update(y,c);\n }\n if(x==2){\n assert(0<=y&&y<n);\n P c=rmq.query(y,y+1);\n c.second=z;\n rmq.update(y,c);\n }\n if(x==3){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.first);\n }\n if(x==4){\n assert(0<=y&&y<z);\n P c=rmq.query(y,z);\n printf(\"%d\\n\",c.second);\n }\n if(x==5){\n rmq.query(0,n);\n rmq.update(0,n,P(-1,i));\n }\n if(x==6){\n rmq.query(0,n);\n rmq.update(0,n,P(i,-1));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":14184,"score_of_the_acc":-0.1063,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_3024_7108764\",\n \"code_snippet\": \"#line 1 \\\"/home/maspy/compro/library/my_template.hpp\\\"\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing pi = pair<ll, ll>;\\nusing vi = vector<ll>;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing i128 = __int128;\\n\\ntemplate <class T>\\nusing vc = vector<T>;\\ntemplate <class T>\\nusing vvc = vector<vc<T>>;\\ntemplate <class T>\\nusing vvvc = vector<vvc<T>>;\\ntemplate <class T>\\nusing vvvvc = vector<vvvc<T>>;\\ntemplate <class T>\\nusing vvvvvc = vector<vvvvc<T>>;\\ntemplate <class T>\\nusing pq = priority_queue<T>;\\ntemplate <class T>\\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\n\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) \\\\\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) \\\\\\n vector<vector<vector<type>>> name( \\\\\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name( \\\\\\n a, vector<vector<vector<type>>>( \\\\\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n\\n// https://trap.jp/post/1224/\\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\\n#define overload4(a, b, c, d, e, ...) e\\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\\n#define FOR_R(...) \\\\\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\\n\\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\\n#define all(x) x.begin(), x.end()\\n#define len(x) ll(x.size())\\n#define elif else if\\n\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define fi first\\n#define se second\\n\\n#define stoi stoll\\n\\ntemplate <typename T, typename U>\\nT SUM(const vector<U> &A) {\\n T sum = 0;\\n for (auto &&a: A) sum += a;\\n return sum;\\n}\\n\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\n\\nint popcnt(int x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(ll x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\n\\ntemplate <typename T>\\nT pick(deque<T> &que) {\\n T a = que.front();\\n que.pop_front();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(pq<T> &que) {\\n T a = que.top();\\n que.pop();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(pqg<T> &que) {\\n assert(que.size());\\n T a = que.top();\\n que.pop();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(vc<T> &que) {\\n assert(que.size());\\n T a = que.back();\\n que.pop_back();\\n return a;\\n}\\n\\ntemplate <typename T, typename U>\\nT ceil(T x, U y) {\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\n\\ntemplate <typename T, typename U>\\nT floor(T x, U y) {\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <typename T, typename U>\\npair<T, T> divmod(T x, U y) {\\n T q = floor(x, y);\\n return {q, x - q * y};\\n}\\n\\ntemplate <typename F>\\nll binary_search(F check, ll ok, ll ng) {\\n assert(check(ok));\\n while (abs(ok - ng) > 1) {\\n auto x = (ng + ok) / 2;\\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\\n }\\n return ok;\\n}\\n\\ntemplate <typename F>\\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\\n FOR(iter) {\\n double x = (ok + ng) / 2;\\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\\n }\\n return (ok + ng) / 2;\\n}\\n\\ntemplate <class T, class S>\\ninline bool chmax(T &a, const S &b) {\\n return (a < b ? a = b, 1 : 0);\\n}\\ntemplate <class T, class S>\\ninline bool chmin(T &a, const S &b) {\\n return (a > b ? a = b, 1 : 0);\\n}\\n\\nvc<int> s_to_vi(const string &S, char first_char) {\\n vc<int> A(S.size());\\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\\n return A;\\n}\\n\\ntemplate <typename T, typename U>\\nvector<T> cumsum(vector<U> &A, int off = 1) {\\n int N = A.size();\\n vector<T> B(N + 1);\\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\\n if (off == 0) B.erase(B.begin());\\n return B;\\n}\\n\\ntemplate <typename CNT, typename T>\\nvc<CNT> bincount(const vc<T> &A, int size) {\\n vc<CNT> C(size);\\n for (auto &&x: A) { ++C[x]; }\\n return C;\\n}\\n\\n// stable\\ntemplate <typename T>\\nvector<int> argsort(const vector<T> &A) {\\n vector<int> ids(A.size());\\n iota(all(ids), 0);\\n sort(all(ids),\\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\\n return ids;\\n}\\n\\n// A[I[0]], A[I[1]], ...\\ntemplate <typename T>\\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\\n int n = len(I);\\n vc<T> B(n);\\n FOR(i, n) B[i] = A[I[i]];\\n return B;\\n}\\n#line 1 \\\"/home/maspy/compro/library/other/io.hpp\\\"\\n// based on yosupo's fastio\\n#include <unistd.h>\\n\\nnamespace detail {\\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\\nstd::true_type check_value(int);\\ntemplate <typename T>\\nstd::false_type check_value(long);\\n} // namespace detail\\n\\ntemplate <typename T>\\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\\ntemplate <typename T>\\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\\ntemplate <typename T>\\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\\n\\nstruct Scanner {\\n FILE *fp;\\n char line[(1 << 15) + 1];\\n size_t st = 0, ed = 0;\\n void reread() {\\n memmove(line, line + st, ed - st);\\n ed -= st;\\n st = 0;\\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\\n line[ed] = '\\\\0';\\n }\\n bool succ() {\\n while (true) {\\n if (st == ed) {\\n reread();\\n if (st == ed) return false;\\n }\\n while (st != ed && isspace(line[st])) st++;\\n if (st != ed) break;\\n }\\n if (ed - st <= 50) {\\n bool sep = false;\\n for (size_t i = st; i < ed; i++) {\\n if (isspace(line[i])) {\\n sep = true;\\n break;\\n }\\n }\\n if (!sep) reread();\\n }\\n return true;\\n }\\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\\n bool read_single(T &ref) {\\n if (!succ()) return false;\\n while (true) {\\n size_t sz = 0;\\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\\n ref.append(line + st, sz);\\n st += sz;\\n if (!sz || st != ed) break;\\n reread();\\n }\\n return true;\\n }\\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\\n bool read_single(T &ref) {\\n if (!succ()) return false;\\n bool neg = false;\\n if (line[st] == '-') {\\n neg = true;\\n st++;\\n }\\n ref = T(0);\\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\\n if (neg) ref = -ref;\\n return true;\\n }\\n template <class T, is_modint_t<T> * = nullptr>\\n bool read_single(T &ref) {\\n long long val = 0;\\n bool f = read_single(val);\\n ref = T(val);\\n return f;\\n }\\n bool read_single(double &ref) {\\n string s;\\n if (!read_single(s)) return false;\\n ref = std::stod(s);\\n return true;\\n }\\n bool read_single(char &ref) {\\n string s;\\n if (!read_single(s) || s.size() != 1) return false;\\n ref = s[0];\\n return true;\\n }\\n template <class T>\\n bool read_single(vector<T> &ref) {\\n for (auto &d: ref) {\\n if (!read_single(d)) return false;\\n }\\n return true;\\n }\\n template <class T, class U>\\n bool read_single(pair<T, U> &p) {\\n return (read_single(p.first) && read_single(p.second));\\n }\\n template <class A, class B, class C>\\n bool read_single(tuple<A, B, C> &p) {\\n return (read_single(get<0>(p)) && read_single(get<1>(p))\\n && read_single(get<2>(p)));\\n }\\n template <class A, class B, class C, class D>\\n bool read_single(tuple<A, B, C, D> &p) {\\n return (read_single(get<0>(p)) && read_single(get<1>(p))\\n && read_single(get<2>(p)) && read_single(get<3>(p)));\\n }\\n void read() {}\\n template <class H, class... T>\\n void read(H &h, T &... t) {\\n bool f = read_single(h);\\n assert(f);\\n read(t...);\\n }\\n Scanner(FILE *fp) : fp(fp) {}\\n};\\n\\nstruct Printer {\\n Printer(FILE *_fp) : fp(_fp) {}\\n ~Printer() { flush(); }\\n\\n static constexpr size_t SIZE = 1 << 15;\\n FILE *fp;\\n char line[SIZE], small[50];\\n size_t pos = 0;\\n void flush() {\\n fwrite(line, 1, pos, fp);\\n pos = 0;\\n }\\n void write(const char &val) {\\n if (pos == SIZE) flush();\\n line[pos++] = val;\\n }\\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\\n void write(T val) {\\n if (pos > (1 << 15) - 50) flush();\\n if (val == 0) {\\n write('0');\\n return;\\n }\\n if (val < 0) {\\n write('-');\\n val = -val; // todo min\\n }\\n size_t len = 0;\\n while (val) {\\n small[len++] = char(0x30 | (val % 10));\\n val /= 10;\\n }\\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\\n pos += len;\\n }\\n void write(const string &s) {\\n for (char c: s) write(c);\\n }\\n void write(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++) write(s[i]);\\n }\\n void write(const double &x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << x;\\n string s = oss.str();\\n write(s);\\n }\\n void write(const long double &x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << x;\\n string s = oss.str();\\n write(s);\\n }\\n template <class T, is_modint_t<T> * = nullptr>\\n void write(T &ref) {\\n write(ref.val);\\n }\\n template <class T>\\n void write(const vector<T> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) write(' ');\\n write(val[i]);\\n }\\n }\\n template <class T, class U>\\n void write(const pair<T, U> &val) {\\n write(val.first);\\n write(' ');\\n write(val.second);\\n }\\n template <class A, class B, class C>\\n void write(const tuple<A, B, C> &val) {\\n auto &[a, b, c] = val;\\n write(a), write(' '), write(b), write(' '), write(c);\\n }\\n template <class A, class B, class C, class D>\\n void write(const tuple<A, B, C, D> &val) {\\n auto &[a, b, c, d] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\\n }\\n template <class A, class B, class C, class D, class E>\\n void write(const tuple<A, B, C, D, E> &val) {\\n auto &[a, b, c, d, e] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\\n }\\n template <class A, class B, class C, class D, class E, class F>\\n void write(const tuple<A, B, C, D, E, F> &val) {\\n auto &[a, b, c, d, e, f] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\\n }\\n template <class T, size_t S>\\n void write(const array<T, S> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) write(' ');\\n write(val[i]);\\n }\\n }\\n void write(i128 val) {\\n string s;\\n bool negative = 0;\\n if(val < 0){\\n negative = 1;\\n val = -val;\\n }\\n while (val) {\\n s += '0' + int(val % 10);\\n val /= 10;\\n }\\n if(negative) s += \\\"-\\\";\\n reverse(all(s));\\n if (len(s) == 0) s = \\\"0\\\";\\n write(s);\\n }\\n};\\n\\nScanner scanner = Scanner(stdin);\\nPrinter printer = Printer(stdout);\\n\\nvoid flush() { printer.flush(); }\\nvoid print() { printer.write('\\\\n'); }\\ntemplate <class Head, class... Tail>\\nvoid print(Head &&head, Tail &&... tail) {\\n printer.write(head);\\n if (sizeof...(Tail)) printer.write(' ');\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid read() {}\\ntemplate <class Head, class... Tail>\\nvoid read(Head &head, Tail &... tail) {\\n scanner.read(head);\\n read(tail...);\\n}\\n\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n char __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n read(name)\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n read(name)\\n\\nvoid YES(bool t = 1) { print(t ? \\\"YES\\\" : \\\"NO\\\"); }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { print(t ? \\\"Yes\\\" : \\\"No\\\"); }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { print(t ? \\\"yes\\\" : \\\"no\\\"); }\\nvoid no(bool t = 1) { yes(!t); }\\n#line 2 \\\"/home/maspy/compro/library/ds/lazysegtree.hpp\\\"\\n\\ntemplate <typename Lazy>\\nstruct LazySegTree {\\n using Monoid_X = typename Lazy::X_structure;\\n using Monoid_A = typename Lazy::A_structure;\\n using X = typename Monoid_X::value_type;\\n using A = typename Monoid_A::value_type;\\n int n, log, size;\\n vc<X> dat;\\n vc<A> laz;\\n\\n LazySegTree() : LazySegTree(0) {}\\n LazySegTree(int n) : LazySegTree(vc<X>(n, Monoid_X::unit())) {}\\n LazySegTree(vc<X> v) : n(len(v)) {\\n log = 1;\\n while ((1 << log) < n) ++log;\\n size = 1 << log;\\n dat.assign(size << 1, Monoid_X::unit());\\n laz.assign(size, Monoid_A::unit());\\n FOR(i, n) dat[size + i] = v[i];\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n template <typename F>\\n LazySegTree(int n, F f) : n(n) {\\n log = 1;\\n while ((1 << log) < n) ++log;\\n size = 1 << log;\\n dat.assign(size << 1, Monoid_X::unit());\\n laz.assign(size, Monoid_A::unit());\\n FOR(i, n) dat[size + i] = f(i);\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n void reset() {\\n fill(all(dat), Monoid_X::unit());\\n fill(all(laz), Monoid_A::unit());\\n }\\n\\n void reset(const vc<X>& v) {\\n assert(len(v) == n);\\n reset();\\n FOR(i, n) dat[size + i] = v[i];\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }\\n\\n void all_apply(int k, A a) {\\n dat[k] = Lazy::act(dat[k], a);\\n if (k < size) laz[k] = Monoid_A::op(laz[k], a);\\n }\\n\\n void push(int k) {\\n all_apply(2 * k, laz[k]);\\n all_apply(2 * k + 1, laz[k]);\\n laz[k] = Monoid_A::unit();\\n }\\n\\n void set(int p, X x) {\\n assert(0 <= p && p < n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n dat[p] = x;\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n\\n X get(int p) {\\n assert(0 <= p && p < n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n return dat[p];\\n }\\n\\n vc<X> get_all() {\\n FOR(i, size) push(i);\\n return {dat.begin() + size, dat.begin() + size + n};\\n }\\n\\n X prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= n);\\n if (l == r) return Monoid_X::unit();\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n X xl = Monoid_X::unit(), xr = Monoid_X::unit();\\n while (l < r) {\\n if (l & 1) xl = Monoid_X::op(xl, dat[l++]);\\n if (r & 1) xr = Monoid_X::op(dat[--r], xr);\\n l >>= 1;\\n r >>= 1;\\n }\\n\\n return Monoid_X::op(xl, xr);\\n }\\n\\n X prod_all() { return dat[1]; }\\n\\n void apply(int p, A a) {\\n assert(0 <= p && p < n);\\n p += size;\\n dat[p] = Lazy::act(dat[p], a);\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n\\n void apply(int l, int r, A a) {\\n assert(0 <= l && l <= r && r <= n);\\n if (l == r) return;\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, a);\\n if (r & 1) all_apply(--r, a);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n\\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n\\n template <typename C>\\n int max_right(C& check, int l) {\\n assert(0 <= l && l <= n);\\n assert(check(Monoid_X::unit()));\\n if (l == n) return n;\\n l += size;\\n for (int i = log; i >= 1; i--) push(l >> i);\\n X sm = Monoid_X::unit();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!check(Monoid_X::op(sm, dat[l]))) {\\n while (l < size) {\\n push(l);\\n l = (2 * l);\\n if (check(Monoid_X::op(sm, dat[l]))) {\\n sm = Monoid_X::op(sm, dat[l]);\\n l++;\\n }\\n }\\n return l - size;\\n }\\n sm = Monoid_X::op(sm, dat[l]);\\n l++;\\n } while ((l & -l) != l);\\n return n;\\n }\\n\\n template <typename C>\\n int min_left(C& check, int r) {\\n assert(0 <= r && r <= n);\\n assert(check(Monoid_X::unit()));\\n if (r == 0) return 0;\\n r += size;\\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\\n X sm = Monoid_X::unit();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!check(Monoid_X::op(dat[r], sm))) {\\n while (r < size) {\\n push(r);\\n r = (2 * r + 1);\\n if (check(Monoid_X::op(dat[r], sm))) {\\n sm = Monoid_X::op(dat[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - size;\\n }\\n sm = Monoid_X::op(dat[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n\\n void debug() { print(\\\"lazysegtree getall:\\\", get_all()); }\\n};\\n#line 4 \\\"main.cpp\\\"\\n\\nstruct MonoX {\\n using value_type = pair<int, int>;\\n using X = value_type;\\n static X op(X x, X y) { return {min(x.fi, y.fi), min(x.se, y.se)}; }\\n static constexpr X unit() {\\n constexpr int mx = numeric_limits<int>::max();\\n return {mx, mx};\\n }\\n static constexpr bool commute = 1;\\n};\\n\\nstruct MonoA {\\n using value_type = int;\\n using X = value_type;\\n static X op(X x, X y) {\\n if (x == 0) return y;\\n return x;\\n }\\n static constexpr X unit() { return 0; }\\n static constexpr bool commute = 0;\\n};\\n\\nstruct Lazy {\\n using MX = MonoX;\\n using MA = MonoA;\\n using X_structure = MX;\\n using A_structure = MA;\\n using X = typename MX::value_type;\\n using A = typename MA::value_type;\\n static constexpr X act(const X &x, const A &a) {\\n if (a == 0) return x;\\n if (a == 1) return {x.fi, x.fi};\\n return {x.se, x.se};\\n }\\n};\\n\\nvoid solve() {\\n LL(N);\\n VEC(int, A, N);\\n VEC(int, B, N);\\n LazySegTree<Lazy> seg(N, [&](int i) -> pair<int, int> {\\n return {A[i], B[i]};\\n });\\n LL(Q);\\n FOR(Q) {\\n LL(x, y, z);\\n --y;\\n if (x == 1) {\\n auto [a, b] = seg.prod(y, y + 1);\\n seg.set(y, {z, b});\\n }\\n if (x == 2) {\\n auto [a, b] = seg.prod(y, y + 1);\\n seg.set(y, {a, z});\\n }\\n if (x == 3) { print(seg.prod(y, z).fi); }\\n if (x == 4) { print(seg.prod(y, z).se); }\\n if (x == 5) seg.apply(0, N, 2);\\n if (x == 6) seg.apply(0, N, 1);\\n }\\n}\\n\\nsigned main() {\\n cout << fixed << setprecision(15);\\n\\n ll T = 1;\\n // LL(T);\\n FOR(T) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 9848,\n \"score_of_the_acc\": -0.0343,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3024_7108757\",\n \"code_snippet\": \"#line 1 \\\"/home/maspy/compro/library/my_template.hpp\\\"\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing pi = pair<ll, ll>;\\nusing vi = vector<ll>;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing i128 = __int128;\\n\\ntemplate <class T>\\nusing vc = vector<T>;\\ntemplate <class T>\\nusing vvc = vector<vc<T>>;\\ntemplate <class T>\\nusing vvvc = vector<vvc<T>>;\\ntemplate <class T>\\nusing vvvvc = vector<vvvc<T>>;\\ntemplate <class T>\\nusing vvvvvc = vector<vvvvc<T>>;\\ntemplate <class T>\\nusing pq = priority_queue<T>;\\ntemplate <class T>\\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\\n\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) \\\\\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) \\\\\\n vector<vector<vector<type>>> name( \\\\\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name( \\\\\\n a, vector<vector<vector<type>>>( \\\\\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n\\n// https://trap.jp/post/1224/\\n#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)\\n#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)\\n#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)\\n#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))\\n#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)\\n#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)\\n#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)\\n#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))\\n#define overload4(a, b, c, d, e, ...) e\\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\\n#define FOR_R(...) \\\\\\n overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\\n\\n#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))\\n#define all(x) x.begin(), x.end()\\n#define len(x) ll(x.size())\\n#define elif else if\\n\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define fi first\\n#define se second\\n\\n#define stoi stoll\\n\\ntemplate <typename T, typename U>\\nT SUM(const vector<U> &A) {\\n T sum = 0;\\n for (auto &&a: A) sum += a;\\n return sum;\\n}\\n\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\n\\nint popcnt(int x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(ll x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\n\\ntemplate <typename T>\\nT pick(deque<T> &que) {\\n T a = que.front();\\n que.pop_front();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(pq<T> &que) {\\n T a = que.top();\\n que.pop();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(pqg<T> &que) {\\n assert(que.size());\\n T a = que.top();\\n que.pop();\\n return a;\\n}\\n\\ntemplate <typename T>\\nT pick(vc<T> &que) {\\n assert(que.size());\\n T a = que.back();\\n que.pop_back();\\n return a;\\n}\\n\\ntemplate <typename T, typename U>\\nT ceil(T x, U y) {\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\n\\ntemplate <typename T, typename U>\\nT floor(T x, U y) {\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <typename T, typename U>\\npair<T, T> divmod(T x, U y) {\\n T q = floor(x, y);\\n return {q, x - q * y};\\n}\\n\\ntemplate <typename F>\\nll binary_search(F check, ll ok, ll ng) {\\n assert(check(ok));\\n while (abs(ok - ng) > 1) {\\n auto x = (ng + ok) / 2;\\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\\n }\\n return ok;\\n}\\n\\ntemplate <typename F>\\ndouble binary_search_real(F check, double ok, double ng, int iter = 100) {\\n FOR(iter) {\\n double x = (ok + ng) / 2;\\n tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));\\n }\\n return (ok + ng) / 2;\\n}\\n\\ntemplate <class T, class S>\\ninline bool chmax(T &a, const S &b) {\\n return (a < b ? a = b, 1 : 0);\\n}\\ntemplate <class T, class S>\\ninline bool chmin(T &a, const S &b) {\\n return (a > b ? a = b, 1 : 0);\\n}\\n\\nvc<int> s_to_vi(const string &S, char first_char) {\\n vc<int> A(S.size());\\n FOR(i, S.size()) { A[i] = S[i] - first_char; }\\n return A;\\n}\\n\\ntemplate <typename T, typename U>\\nvector<T> cumsum(vector<U> &A, int off = 1) {\\n int N = A.size();\\n vector<T> B(N + 1);\\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\\n if (off == 0) B.erase(B.begin());\\n return B;\\n}\\n\\ntemplate <typename CNT, typename T>\\nvc<CNT> bincount(const vc<T> &A, int size) {\\n vc<CNT> C(size);\\n for (auto &&x: A) { ++C[x]; }\\n return C;\\n}\\n\\n// stable\\ntemplate <typename T>\\nvector<int> argsort(const vector<T> &A) {\\n vector<int> ids(A.size());\\n iota(all(ids), 0);\\n sort(all(ids),\\n [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });\\n return ids;\\n}\\n\\n// A[I[0]], A[I[1]], ...\\ntemplate <typename T>\\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\\n int n = len(I);\\n vc<T> B(n);\\n FOR(i, n) B[i] = A[I[i]];\\n return B;\\n}\\n#line 1 \\\"/home/maspy/compro/library/other/io.hpp\\\"\\n// based on yosupo's fastio\\n#include <unistd.h>\\n\\nnamespace detail {\\ntemplate <typename T, decltype(&T::is_modint) = &T::is_modint>\\nstd::true_type check_value(int);\\ntemplate <typename T>\\nstd::false_type check_value(long);\\n} // namespace detail\\n\\ntemplate <typename T>\\nstruct is_modint : decltype(detail::check_value<T>(0)) {};\\ntemplate <typename T>\\nusing is_modint_t = enable_if_t<is_modint<T>::value>;\\ntemplate <typename T>\\nusing is_not_modint_t = enable_if_t<!is_modint<T>::value>;\\n\\nstruct Scanner {\\n FILE *fp;\\n char line[(1 << 15) + 1];\\n size_t st = 0, ed = 0;\\n void reread() {\\n memmove(line, line + st, ed - st);\\n ed -= st;\\n st = 0;\\n ed += fread(line + ed, 1, (1 << 15) - ed, fp);\\n line[ed] = '\\\\0';\\n }\\n bool succ() {\\n while (true) {\\n if (st == ed) {\\n reread();\\n if (st == ed) return false;\\n }\\n while (st != ed && isspace(line[st])) st++;\\n if (st != ed) break;\\n }\\n if (ed - st <= 50) {\\n bool sep = false;\\n for (size_t i = st; i < ed; i++) {\\n if (isspace(line[i])) {\\n sep = true;\\n break;\\n }\\n }\\n if (!sep) reread();\\n }\\n return true;\\n }\\n template <class T, enable_if_t<is_same<T, string>::value, int> = 0>\\n bool read_single(T &ref) {\\n if (!succ()) return false;\\n while (true) {\\n size_t sz = 0;\\n while (st + sz < ed && !isspace(line[st + sz])) sz++;\\n ref.append(line + st, sz);\\n st += sz;\\n if (!sz || st != ed) break;\\n reread();\\n }\\n return true;\\n }\\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\\n bool read_single(T &ref) {\\n if (!succ()) return false;\\n bool neg = false;\\n if (line[st] == '-') {\\n neg = true;\\n st++;\\n }\\n ref = T(0);\\n while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }\\n if (neg) ref = -ref;\\n return true;\\n }\\n template <class T, is_modint_t<T> * = nullptr>\\n bool read_single(T &ref) {\\n long long val = 0;\\n bool f = read_single(val);\\n ref = T(val);\\n return f;\\n }\\n bool read_single(double &ref) {\\n string s;\\n if (!read_single(s)) return false;\\n ref = std::stod(s);\\n return true;\\n }\\n bool read_single(char &ref) {\\n string s;\\n if (!read_single(s) || s.size() != 1) return false;\\n ref = s[0];\\n return true;\\n }\\n template <class T>\\n bool read_single(vector<T> &ref) {\\n for (auto &d: ref) {\\n if (!read_single(d)) return false;\\n }\\n return true;\\n }\\n template <class T, class U>\\n bool read_single(pair<T, U> &p) {\\n return (read_single(p.first) && read_single(p.second));\\n }\\n template <class A, class B, class C>\\n bool read_single(tuple<A, B, C> &p) {\\n return (read_single(get<0>(p)) && read_single(get<1>(p))\\n && read_single(get<2>(p)));\\n }\\n template <class A, class B, class C, class D>\\n bool read_single(tuple<A, B, C, D> &p) {\\n return (read_single(get<0>(p)) && read_single(get<1>(p))\\n && read_single(get<2>(p)) && read_single(get<3>(p)));\\n }\\n void read() {}\\n template <class H, class... T>\\n void read(H &h, T &... t) {\\n bool f = read_single(h);\\n assert(f);\\n read(t...);\\n }\\n Scanner(FILE *fp) : fp(fp) {}\\n};\\n\\nstruct Printer {\\n Printer(FILE *_fp) : fp(_fp) {}\\n ~Printer() { flush(); }\\n\\n static constexpr size_t SIZE = 1 << 15;\\n FILE *fp;\\n char line[SIZE], small[50];\\n size_t pos = 0;\\n void flush() {\\n fwrite(line, 1, pos, fp);\\n pos = 0;\\n }\\n void write(const char &val) {\\n if (pos == SIZE) flush();\\n line[pos++] = val;\\n }\\n template <class T, enable_if_t<is_integral<T>::value, int> = 0>\\n void write(T val) {\\n if (pos > (1 << 15) - 50) flush();\\n if (val == 0) {\\n write('0');\\n return;\\n }\\n if (val < 0) {\\n write('-');\\n val = -val; // todo min\\n }\\n size_t len = 0;\\n while (val) {\\n small[len++] = char(0x30 | (val % 10));\\n val /= 10;\\n }\\n for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }\\n pos += len;\\n }\\n void write(const string &s) {\\n for (char c: s) write(c);\\n }\\n void write(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++) write(s[i]);\\n }\\n void write(const double &x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << x;\\n string s = oss.str();\\n write(s);\\n }\\n void write(const long double &x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << x;\\n string s = oss.str();\\n write(s);\\n }\\n template <class T, is_modint_t<T> * = nullptr>\\n void write(T &ref) {\\n write(ref.val);\\n }\\n template <class T>\\n void write(const vector<T> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) write(' ');\\n write(val[i]);\\n }\\n }\\n template <class T, class U>\\n void write(const pair<T, U> &val) {\\n write(val.first);\\n write(' ');\\n write(val.second);\\n }\\n template <class A, class B, class C>\\n void write(const tuple<A, B, C> &val) {\\n auto &[a, b, c] = val;\\n write(a), write(' '), write(b), write(' '), write(c);\\n }\\n template <class A, class B, class C, class D>\\n void write(const tuple<A, B, C, D> &val) {\\n auto &[a, b, c, d] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);\\n }\\n template <class A, class B, class C, class D, class E>\\n void write(const tuple<A, B, C, D, E> &val) {\\n auto &[a, b, c, d, e] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);\\n }\\n template <class A, class B, class C, class D, class E, class F>\\n void write(const tuple<A, B, C, D, E, F> &val) {\\n auto &[a, b, c, d, e, f] = val;\\n write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);\\n }\\n template <class T, size_t S>\\n void write(const array<T, S> &val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) write(' ');\\n write(val[i]);\\n }\\n }\\n void write(i128 val) {\\n string s;\\n bool negative = 0;\\n if(val < 0){\\n negative = 1;\\n val = -val;\\n }\\n while (val) {\\n s += '0' + int(val % 10);\\n val /= 10;\\n }\\n if(negative) s += \\\"-\\\";\\n reverse(all(s));\\n if (len(s) == 0) s = \\\"0\\\";\\n write(s);\\n }\\n};\\n\\nScanner scanner = Scanner(stdin);\\nPrinter printer = Printer(stdout);\\n\\nvoid flush() { printer.flush(); }\\nvoid print() { printer.write('\\\\n'); }\\ntemplate <class Head, class... Tail>\\nvoid print(Head &&head, Tail &&... tail) {\\n printer.write(head);\\n if (sizeof...(Tail)) printer.write(' ');\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid read() {}\\ntemplate <class Head, class... Tail>\\nvoid read(Head &head, Tail &... tail) {\\n scanner.read(head);\\n read(tail...);\\n}\\n\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n char __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n read(__VA_ARGS__)\\n\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n read(name)\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n read(name)\\n\\nvoid YES(bool t = 1) { print(t ? \\\"YES\\\" : \\\"NO\\\"); }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { print(t ? \\\"Yes\\\" : \\\"No\\\"); }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { print(t ? \\\"yes\\\" : \\\"no\\\"); }\\nvoid no(bool t = 1) { yes(!t); }\\n#line 2 \\\"/home/maspy/compro/library/ds/lazysegtree.hpp\\\"\\n\\ntemplate <typename Lazy>\\nstruct LazySegTree {\\n using Monoid_X = typename Lazy::X_structure;\\n using Monoid_A = typename Lazy::A_structure;\\n using X = typename Monoid_X::value_type;\\n using A = typename Monoid_A::value_type;\\n int n, log, size;\\n vc<X> dat;\\n vc<A> laz;\\n\\n LazySegTree() : LazySegTree(0) {}\\n LazySegTree(int n) : LazySegTree(vc<X>(n, Monoid_X::unit())) {}\\n LazySegTree(vc<X> v) : n(len(v)) {\\n log = 1;\\n while ((1 << log) < n) ++log;\\n size = 1 << log;\\n dat.assign(size << 1, Monoid_X::unit());\\n laz.assign(size, Monoid_A::unit());\\n FOR(i, n) dat[size + i] = v[i];\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n template <typename F>\\n LazySegTree(int n, F f) : n(n) {\\n log = 1;\\n while ((1 << log) < n) ++log;\\n size = 1 << log;\\n dat.assign(size << 1, Monoid_X::unit());\\n laz.assign(size, Monoid_A::unit());\\n FOR(i, n) dat[size + i] = f(i);\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n void reset() {\\n fill(all(dat), Monoid_X::unit());\\n fill(all(laz), Monoid_A::unit());\\n }\\n\\n void reset(const vc<X>& v) {\\n assert(len(v) == n);\\n reset();\\n FOR(i, n) dat[size + i] = v[i];\\n FOR3_R(i, 1, size) update(i);\\n }\\n\\n void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }\\n\\n void all_apply(int k, A a) {\\n dat[k] = Lazy::act(dat[k], a);\\n if (k < size) laz[k] = Monoid_A::op(laz[k], a);\\n }\\n\\n void push(int k) {\\n all_apply(2 * k, laz[k]);\\n all_apply(2 * k + 1, laz[k]);\\n laz[k] = Monoid_A::unit();\\n }\\n\\n void set(int p, X x) {\\n assert(0 <= p && p < n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n dat[p] = x;\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n\\n X get(int p) {\\n assert(0 <= p && p < n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n return dat[p];\\n }\\n\\n vc<X> get_all() {\\n FOR(i, size) push(i);\\n return {dat.begin() + size, dat.begin() + size + n};\\n }\\n\\n X prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= n);\\n if (l == r) return Monoid_X::unit();\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n X xl = Monoid_X::unit(), xr = Monoid_X::unit();\\n while (l < r) {\\n if (l & 1) xl = Monoid_X::op(xl, dat[l++]);\\n if (r & 1) xr = Monoid_X::op(dat[--r], xr);\\n l >>= 1;\\n r >>= 1;\\n }\\n\\n return Monoid_X::op(xl, xr);\\n }\\n\\n X prod_all() { return dat[1]; }\\n\\n void apply(int p, A a) {\\n assert(0 <= p && p < n);\\n p += size;\\n dat[p] = Lazy::act(dat[p], a);\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n\\n void apply(int l, int r, A a) {\\n assert(0 <= l && l <= r && r <= n);\\n if (l == r) return;\\n\\n l += size;\\n r += size;\\n\\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n\\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, a);\\n if (r & 1) all_apply(--r, a);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n\\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n\\n template <typename C>\\n int max_right(C& check, int l) {\\n assert(0 <= l && l <= n);\\n assert(check(Monoid_X::unit()));\\n if (l == n) return n;\\n l += size;\\n for (int i = log; i >= 1; i--) push(l >> i);\\n X sm = Monoid_X::unit();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!check(Monoid_X::op(sm, dat[l]))) {\\n while (l < size) {\\n push(l);\\n l = (2 * l);\\n if (check(Monoid_X::op(sm, dat[l]))) {\\n sm = Monoid_X::op(sm, dat[l]);\\n l++;\\n }\\n }\\n return l - size;\\n }\\n sm = Monoid_X::op(sm, dat[l]);\\n l++;\\n } while ((l & -l) != l);\\n return n;\\n }\\n\\n template <typename C>\\n int min_left(C& check, int r) {\\n assert(0 <= r && r <= n);\\n assert(check(Monoid_X::unit()));\\n if (r == 0) return 0;\\n r += size;\\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\\n X sm = Monoid_X::unit();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!check(Monoid_X::op(dat[r], sm))) {\\n while (r < size) {\\n push(r);\\n r = (2 * r + 1);\\n if (check(Monoid_X::op(dat[r], sm))) {\\n sm = Monoid_X::op(dat[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - size;\\n }\\n sm = Monoid_X::op(dat[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n\\n void debug() { print(\\\"lazysegtree getall:\\\", get_all()); }\\n};\\n#line 4 \\\"main.cpp\\\"\\n\\nstruct MonoX {\\n using value_type = pair<int, int>;\\n using X = value_type;\\n static X op(X x, X y) { return {min(x.fi, y.fi), min(x.se, y.se)}; }\\n static constexpr X unit() {\\n constexpr int mx = numeric_limits<int>::max();\\n return {mx, mx};\\n }\\n static constexpr bool commute = 1;\\n};\\n\\nstruct MonoA {\\n using value_type = int;\\n using X = value_type;\\n static X op(X x, X y) {\\n if (x == 0) return y;\\n return x;\\n }\\n static constexpr X unit() { return 0; }\\n static constexpr bool commute = 0;\\n};\\n\\nstruct Lazy {\\n using MX = MonoX;\\n using MA = MonoA;\\n using X_structure = MX;\\n using A_structure = MA;\\n using X = typename MX::value_type;\\n using A = typename MA::value_type;\\n static constexpr X act(const X &x, const A &a) {\\n if (a == 0) return x;\\n if (a == 1) return {x.fi, x.fi};\\n return {x.se, x.se};\\n }\\n};\\n\\nvoid solve() {\\n LL(N);\\n VEC(int, A, N);\\n VEC(int, B, N);\\n LazySegTree<Lazy> seg(N, [&](int i) -> pair<int, int> {\\n return {A[i], B[i]};\\n });\\n LL(Q);\\n FOR(Q) {\\n LL(x, y, z);\\n --y;\\n if (x == 1) {\\n A[y] = z;\\n seg.set(y, {A[y], B[y]});\\n }\\n if (x == 2) {\\n B[y] = z;\\n seg.set(y, {A[y], B[y]});\\n }\\n if (x == 3) { print(seg.prod(y, z).fi); }\\n if (x == 4) { print(seg.prod(y, z).se); }\\n if (x == 5) seg.apply(0, N, 2);\\n if (x == 6) seg.apply(0, N, 1);\\n }\\n}\\n\\nsigned main() {\\n cout << fixed << setprecision(15);\\n\\n ll T = 1;\\n // LL(T);\\n FOR(T) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 40,\n \"memory_kb\": 9740,\n \"score_of_the_acc\": -0.0231,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3024_4952396\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class T>\\nstruct SegmentTree {\\n typedef function<T(T, T)> F;\\n int n;\\n F f;\\n T unit;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\\n int _n = v.size();\\n init(v.size());\\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\\n }\\n void init(int _n) {\\n n = 1;\\n while (n < _n) n <<= 1;\\n dat.assign(n << 1, unit);\\n }\\n void update(int k, T newdata) {\\n dat[k += n] = newdata;\\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\\n }\\n T query(int a, int b) {\\n T vl = unit, vr = unit;\\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) vl = f(vl, dat[l++]);\\n if (r & 1) vr = f(dat[--r], vr);\\n }\\n return f(vl, vr);\\n }\\n};\\n\\nstruct query {\\n int x, y, z;\\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\\n};\\n\\nusing P = pair<int, int>;\\nint n, q;\\nvector<int> a, b;\\nvector<query> qu, memo[2];\\nSegmentTree<int> seg[2];\\n\\nint main() {\\n cin >> n;\\n a.resize(n);\\n for (auto &p : a) cin >> p;\\n b.resize(n);\\n for (auto &p : b) cin >> p;\\n cin >> q;\\n qu.resize(q);\\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\\n auto f = [](int l, int r) { return min(l, r); };\\n seg[1] = SegmentTree<int>(a, f, 2e9);\\n seg[0] = SegmentTree<int>(b, f, 2e9);\\n bool copied = 0;\\n for (auto [x, y, z] : qu) {\\n if (x <= 2) {\\n --y;\\n int now = seg[x & 1].query(y, y + 1);\\n memo[x & 1].emplace_back(y, now, z);\\n seg[x & 1].update(y, z);\\n } else if (x <= 4)\\n cout << seg[x & 1].query(--y, z) << endl;\\n else {\\n if (!copied)\\n seg[x & 1] = seg[(x & 1) ^ 1];\\n else {\\n while (memo[x & 1].size()) {\\n auto [id, bf, af] = memo[x & 1].back();\\n seg[x & 1].update(id, bf);\\n memo[x & 1].pop_back();\\n }\\n int len = memo[(x & 1) ^ 1].size();\\n for (int j = 0; j < len; ++j) {\\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\\n seg[x & 1].update(id, af);\\n }\\n }\\n copied = 1;\\n memo[0].clear();\\n memo[1].clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 11232,\n \"score_of_the_acc\": -0.1369,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3024_4951667\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class T>\\nstruct SegmentTree {\\n typedef function<T(T, T)> F;\\n int n;\\n F f;\\n T unit;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\\n int _n = v.size();\\n init(v.size());\\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\\n }\\n void init(int _n) {\\n n = 1;\\n while (n < _n) n <<= 1;\\n dat.assign(n << 1, unit);\\n }\\n void update(int k, T newdata) {\\n dat[k += n] = newdata;\\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\\n }\\n T query(int a, int b) {\\n T vl = unit, vr = unit;\\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) vl = f(vl, dat[l++]);\\n if (r & 1) vr = f(dat[--r], vr);\\n }\\n return f(vl, vr);\\n }\\n};\\n\\nstruct query {\\n int x, y, z;\\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\\n};\\n\\nusing P = pair<int, int>;\\nint n, q;\\nvector<int> a, b;\\nvector<query> qu, memo[2];\\nSegmentTree<int> seg[2];\\n\\nint main() {\\n cin >> n;\\n a.resize(n);\\n for (auto &p : a) cin >> p;\\n b.resize(n);\\n for (auto &p : b) cin >> p;\\n cin >> q;\\n qu.resize(q);\\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\\n auto f = [](int l, int r) { return min(l, r); };\\n seg[1] = SegmentTree<int>(a, f, 2e9);\\n seg[0] = SegmentTree<int>(b, f, 2e9);\\n bool copied = 0;\\n for (auto [x, y, z] : qu) {\\n if (x <= 2) {\\n --y;\\n int now = seg[x & 1].query(y, y + 1);\\n memo[x & 1].emplace_back(y, now, z);\\n seg[x & 1].update(y, z);\\n } else if (x <= 4)\\n cout << seg[x & 1].query(--y, z) << endl;\\n else {\\n if (!copied)\\n seg[x & 1] = seg[(x & 1) ^ 1];\\n else {\\n while (memo[x & 1].size()) {\\n auto [id, bf, af] = memo[x & 1].back();\\n seg[x & 1].update(id, bf);\\n memo[x & 1].pop_back();\\n }\\n int len = memo[(x & 1) ^ 1].size();\\n for (int j = 0; j < len; ++j) {\\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\\n seg[(x & 1) ^ 1].update(id, af);\\n }\\n }\\n copied = 1;\\n memo[0].clear();\\n memo[1].clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 190,\n \"memory_kb\": 10900,\n \"score_of_the_acc\": -0.1086,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3024_4951640\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class T>\\nstruct SegmentTree {\\n typedef function<T(T, T)> F;\\n int n;\\n F f;\\n T unit;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(const vector<T> &v, F f, T t) : f(f), unit(t) {\\n int _n = v.size();\\n init(v.size());\\n for (int i = 0; i < _n; ++i) dat[n + i] = v[i];\\n for (int i = n - 1; i >= 0; --i) dat[i] = f(dat[i << 1], dat[(i << 1) | 1]);\\n }\\n void init(int _n) {\\n n = 1;\\n while (n < _n) n <<= 1;\\n dat.assign(n << 1, unit);\\n }\\n void update(int k, T newdata) {\\n dat[k += n] = newdata;\\n while (k >>= 1) dat[k] = f(dat[k << 1], dat[(k << 1) | 1]);\\n }\\n T query(int a, int b) {\\n T vl = unit, vr = unit;\\n for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) vl = f(vl, dat[l++]);\\n if (r & 1) vr = f(dat[--r], vr);\\n }\\n return f(vl, vr);\\n }\\n};\\n\\nstruct query {\\n int x, y, z;\\n query(int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}\\n};\\n\\nusing P = pair<int, int>;\\nint n, q;\\nvector<int> a, b;\\nvector<query> qu, memo[2];\\nSegmentTree<int> seg[2];\\n\\nint main() {\\n cin >> n;\\n a.resize(n);\\n for (auto &p : a) cin >> p;\\n b.resize(n);\\n for (auto &p : b) cin >> p;\\n cin >> q;\\n qu.resize(q);\\n for (auto &p : qu) cin >> p.x >> p.y >> p.z;\\n auto f = [](int l, int r) { return min(l, r); };\\n seg[1] = SegmentTree<int>(a, f, 2e9);\\n seg[0] = SegmentTree<int>(b, f, 2e9);\\n bool copied = 0;\\n for (auto [x, y, z] : qu) {\\n if (x <= 2) {\\n int now = seg[x & 1].query(--y, z);\\n memo[x & 1].emplace_back(y, now, z);\\n seg[x & 1].update(y, z);\\n } else if (x <= 4)\\n cout << seg[x & 1].query(--y, z) << endl;\\n else {\\n if (!copied)\\n seg[x & 1] = seg[(x & 1) ^ 1];\\n else {\\n while (memo[x & 1].size()) {\\n auto [id, bf, af] = memo[x & 1].back();\\n seg[x & 1].update(id, bf);\\n memo[x & 1].pop_back();\\n }\\n int len = memo[(x & 1) ^ 1].size();\\n for (int j = 0; j < len; ++j) {\\n auto [id, bf, af] = memo[(x & 1) ^ 1][j];\\n seg[(x & 1) ^ 1].update(id, af);\\n }\\n }\\n copied = 1;\\n memo[0].clear();\\n memo[1].clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 130,\n \"memory_kb\": 10900,\n \"score_of_the_acc\": -0.0764,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3024_4551727\",\n \"code_snippet\": \"//四則演算 #pragma GCC target(\\\"avx\\\")\\n//並列計算 #pragma GCC optimize(\\\"O3\\\")\\n//条件分岐を減らす #pragma GCC optimize(\\\"unroll-loops\\\")\\n//浮動小数点演算 #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing VI = vector<int>;\\nusing VL = vector<ll>;\\nusing VS = vector<string>;\\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\\n#define each(i, a) for(auto &i : a)\\n#define SORT(i) sort(i.begin(),i.end())\\n#define rSORT(i) sort(i.rbegin(),i.rend())\\n#define fSORT(i,a) sort(i.begin(),i.end(),a)\\n#define all(i) i.begin(),i.end()\\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\\n#define line cout << \\\"-----------------------------\\\\n\\\" \\n#define ENDL(i,n) ((i) == (n) - 1 ? \\\"\\\\n\\\" : \\\" \\\")\\nconstexpr ll INF = 1000000000;\\nconstexpr ll LLINF = 1LL << 60;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr ld eps = 1e-10;\\nconstexpr ld pi = 3.1415926535897932;\\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\\ntemplate<class T>inline void print(const T& a) { cout << a << \\\"\\\\n\\\"; }\\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \\\" \\\"; print(ts...); }\\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \\\"\\\\n\\\" : \\\" \\\"); }\\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\\n\\nint main() {\\n init();\\n\\n int n; cin >> n;\\n int sq = sqrt(n);\\n VI a(n), c(n); cin >> a >> c;\\n VI b((n + sq - 1) / sq), d((n + sq - 1) / sq), e((n + sq - 1) / sq);\\n //e 0:どちらもコピーされていない 1:Aがコピー元 2:Bがコピー元\\n\\n {\\n int s = INF, t = INF;\\n FOR(i, 0, n) {\\n chmin(s, a[i]), chmin(t, c[i]);\\n if (i == n - 1 || (i + 1) % sq == 0) {\\n b[i / sq] = s, d[i / sq] = t;\\n s = t = INF;\\n }\\n }\\n }\\n\\n //type 1:Aをコピーする 2:Bをコピーする\\n function<void(int, int)> Trans = [&](int type, int num)->void {\\n VI *w = &a, *x = &b, *y = &c, *z = &d;\\n if (type == 1)swap(w, y), swap(x, z);\\n x->at(num) = z->at(num);\\n for (int i = sq * num, m = min(n, sq * (num + 1)); i < m; ++i) {\\n w->at(i) = y->at(i);\\n }\\n };\\n function<void(int, int, int, int)> Assign = [&](int type, int idx, int num, int val)->void {\\n VI *w = (type == 1 ? &a : &c), *x = (type == 1 ? &b : &d);\\n w->at(idx) = val;\\n int res = INF;\\n for (int i = num * sq, m = min((num + 1) * sq, n); i < m; ++i) {\\n chmin(res, w->at(i));\\n }\\n x->at(num) = res;\\n };\\n\\n int q; cin >> q;\\n while (q--) {\\n int x, y, z; cin >> x >> y >> z;\\n if (x <= 2) {\\n --y;\\n int num = y / sq;\\n if (e[num] != 0) {\\n Trans(e[num], num);\\n e[num] = 0;\\n }\\n Assign(x, y, num, z);\\n }\\n else if (5 <= x) {\\n each(i, e)if (i == 0)i = 7 - x;\\n }\\n else {\\n --y;\\n int res = INF;\\n for (int i = y; i < z;) {\\n int num = i / sq, k;\\n if (x == 3) {\\n if (e[num] == 2)k = 2;\\n else k = 1;\\n }\\n else {\\n if (e[num] == 1)k = 1;\\n else k = 2;\\n }\\n\\n if (i % sq || z < min(i + sq, n)) {\\n chmin(res, (k == 1 ? a[i] : c[i]));\\n ++i;\\n }\\n else {\\n chmin(res, (k == 1 ? b[num] : d[num]));\\n i += sq;\\n }\\n }\\n print(res);\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 4272,\n \"score_of_the_acc\": -0.2045,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3024_4551725\",\n \"code_snippet\": \"//四則演算 #pragma GCC target(\\\"avx\\\")\\n//並列計算 #pragma GCC optimize(\\\"O3\\\")\\n//条件分岐を減らす #pragma GCC optimize(\\\"unroll-loops\\\")\\n//浮動小数点演算 #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing VI = vector<int>;\\nusing VL = vector<ll>;\\nusing VS = vector<string>;\\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\\n#define each(i, a) for(auto &i : a)\\n#define SORT(i) sort(i.begin(),i.end())\\n#define rSORT(i) sort(i.rbegin(),i.rend())\\n#define fSORT(i,a) sort(i.begin(),i.end(),a)\\n#define all(i) i.begin(),i.end()\\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\\n#define line cout << \\\"-----------------------------\\\\n\\\" \\n#define ENDL(i,n) ((i) == (n) - 1 ? \\\"\\\\n\\\" : \\\" \\\")\\nconstexpr ll INF = 1000000000;\\nconstexpr ll LLINF = 1LL << 60;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr ld eps = 1e-10;\\nconstexpr ld pi = 3.1415926535897932;\\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\\ntemplate<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }\\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\\ntemplate<class T>inline void print(const T& a) { cout << a << \\\"\\\\n\\\"; }\\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \\\" \\\"; print(ts...); }\\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \\\"\\\\n\\\" : \\\" \\\"); }\\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\\n\\nint main() {\\n init();\\n\\n int n; cin >> n;\\n int sq = sqrt(n);\\n VI a(n), c(n); cin >> a >> c;\\n VI b((n + sq - 1) / sq), d((n + sq - 1) / sq), e((n + sq - 1) / sq);\\n //e 0:どちらもコピーされていない 1:Aがコピー元 2:Bがコピー元\\n\\n {\\n int s = INF, t = INF;\\n FOR(i, 0, n) {\\n chmin(s, a[i]), chmin(t, c[i]);\\n if (i == n - 1 || (i + 1) % sq == 0) {\\n b[i / sq] = s, d[i / sq] = t;\\n s = t = INF;\\n }\\n }\\n }\\n\\n //type 1:Aをコピーする 2:Bをコピーする\\n function<void(int, int)> Trans = [&](int type, int num)->void {\\n VI *w = &a, *x = &b, *y = &c, *z = &d;\\n if (type == 1)swap(w, y), swap(x, z);\\n x->at(num) = z->at(num);\\n for (int i = sq * num, m = min(n, sq * (num + 1)); i < m; ++i) {\\n w->at(i) = y->at(i);\\n }\\n };\\n function<void(int, int, int, int)> Assign = [&](int type, int idx, int num, int val)->void {\\n VI *w = (type == 1 ? &a : &c), *x = (type == 1 ? &b : &d);\\n w->at(idx) = val;\\n int res = INF;\\n for (int i = num * sq, m = (num + 1) * sq; i < m; ++i) {\\n chmin(res, w->at(i));\\n }\\n x->at(num) = res;\\n };\\n\\n int q; cin >> q;\\n while (q--) {\\n int x, y, z; cin >> x >> y >> z;\\n if (x <= 2) {\\n --y;\\n int num = y / sq;\\n if (e[num] != 0) {\\n Trans(e[num], num);\\n e[num] = 0;\\n }\\n Assign(x, y, num, z);\\n }\\n else if (5 <= x) {\\n each(i, e)if (i == 0)i = 7 - x;\\n }\\n else {\\n --y;\\n int res = INF;\\n for (int i = y; i < z;) {\\n int num = i / sq, k;\\n if (x == 3) {\\n if (e[num] == 2)k = 2;\\n else k = 1;\\n }\\n else {\\n if (e[num] == 1)k = 1;\\n else k = 2;\\n }\\n\\n if (i % sq || z < min(i + sq, n)) {\\n chmin(res, (k == 1 ? a[i] : c[i]));\\n ++i;\\n }\\n else {\\n chmin(res, (k == 1 ? b[num] : d[num]));\\n i += sq;\\n }\\n }\\n print(res);\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 90,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.0269,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3024_3931689\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n//BEGIN CUT HERE\\ntemplate <typename T>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n F f;\\n T ti;\\n SegmentTree(F f,T ti):f(f),ti(ti){}\\n\\n struct Node{\\n Node *l,*r;\\n T dat;\\n Node(T dat):dat(dat){l=r=nullptr;}\\n };\\n\\n Node* clone(Node *a){\\n return new Node(*a);\\n }\\n\\n Node* reflect(Node *a){\\n a->dat=f(a->l->dat,a->r->dat);\\n return a;\\n }\\n\\n int n,height;\\n Node* build(const vector<T> &v){\\n int n_=v.size();\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n vector<Node*> vs(n<<1);\\n for(int i=0;i<n_;i++) vs[n+i]=new Node(v[i]);\\n for(int i=n_;i<n;i++) vs[n+i]=new Node(ti);\\n for(int i=n-1;i;i--){\\n vs[i]=new Node(ti);\\n vs[i]->l=vs[(i<<1)|0];\\n vs[i]->r=vs[(i<<1)|1];\\n reflect(vs[i]);\\n }\\n return vs[1];\\n }\\n\\n Node* set_val(Node* t,int k,T x,int h){\\n t=clone(t);\\n if(h<0){\\n t->dat=x;\\n return t;\\n }\\n if((k>>h)&1) t->r=set_val(t->r,k,x,h-1);\\n else t->l=set_val(t->l,k,x,h-1);\\n return reflect(t);\\n }\\n\\n T query(Node* t,int l,int r,int lb,int ub){\\n if(r<=lb||ub<=l) return ti;\\n if(l<=lb&&ub<=r) return t->dat;\\n int m=(lb+ub)>>1;\\n return f(query(t->l,l,r,lb,m),query(t->r,l,r,m,ub));\\n }\\n\\n Node* set_val(Node* t,int k,T x){\\n return set_val(t,k,x,height-1);\\n }\\n\\n T query(Node* t,int l,int r){\\n return query(t,l,r,0,n);\\n }\\n};\\n//END CUT HERE\\n//INSERT ABOVE HERE\\nsigned HAPPYQUERY_B(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n;\\n cin>>n;\\n vector<int> as(n);\\n for(int i=0;i<n;i++) cin>>as[i];\\n\\n auto f=[](int a,int b){return min(a,b);};\\n int ti=INT_MAX;\\n SegmentTree<int> seg(f,ti);\\n auto rt=seg.build(as);\\n\\n vector<decltype(rt)> rts;\\n rts.emplace_back(rt);\\n\\n int q1;\\n cin>>q1;\\n rts.reserve(q1+1);\\n\\n for(int i=0;i<q1;i++){\\n int p,x;\\n cin>>p>>x;\\n p--;\\n rt=seg.set_val(rt,p,x);\\n rts.emplace_back(rt);\\n }\\n\\n int q2;\\n cin>>q2;\\n int x=0;\\n for(int i=0;i<q2;i++){\\n int a,b,c;\\n cin>>a>>b>>c;\\n int k=a^x;\\n int l=(b^x)-1;\\n int r=(c^x);\\n assert(l<r);\\n x=seg.query(rts[k],l,r);\\n cout<<x<<\\\"\\\\n\\\";\\n }\\n cout<<flush;\\n return 0;\\n}\\n/*\\n verified on 2019/06/22\\n https://www.hackerrank.com/contests/happy-query-contest/challenges/minimum-history-query\\n*/\\n\\nsigned AOJ_3024(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n;\\n cin>>n;\\n vector<int> as(n),bs(n);\\n for(int i=0;i<n;i++) cin>>as[i];\\n for(int i=0;i<n;i++) cin>>bs[i];\\n\\n auto f=[](int a,int b){return min(a,b);};\\n int ti=INT_MAX;\\n SegmentTree<int> seg(f,ti);\\n auto ra=seg.build(as);\\n auto rb=seg.build(bs);\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int x,y,z;\\n cin>>x>>y>>z;\\n y--;\\n if(x==1) ra=seg.set_val(ra,y,z);\\n if(x==2) rb=seg.set_val(rb,y,z);\\n if(x==3) cout<<seg.query(ra,y,z)<<\\\"\\\\n\\\";\\n if(x==4) cout<<seg.query(rb,y,z)<<\\\"\\\\n\\\";\\n if(x==5) ra=seg.clone(rb);\\n if(x==6) rb=seg.clone(ra);\\n }\\n cout<<flush;\\n return 0;\\n}\\n\\nsigned main(){\\n //HAPPYQUERY_B();\\n AOJ_3024();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 91532,\n \"score_of_the_acc\": -0.4573,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3024_3931623\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint ri() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\treturn n;\\n}\\n\\n#define MAX_NODE 8000000\\nstruct AVL {\\n\\tstruct Node {\\n\\t\\tNode *l;\\n\\t\\tNode *r;\\n\\t\\tint val;\\n\\t\\tint min;\\n\\t\\tint height;\\n\\t\\tint size;\\n\\t\\tNode *fetch() {\\n\\t\\t\\tmin = std::min({val, l->min, r->min});\\n\\t\\t\\theight = 1 + std::max(l->height, r->height);\\n\\t\\t\\tsize = 1 + l->size + r->size;\\n\\t\\t\\treturn this;\\n\\t\\t}\\n\\t\\tNode *rotate_l() {\\n\\t\\t\\tNode *new_root = AVL::new_node(r);\\n\\t\\t\\tr = new_root->l;\\n\\t\\t\\tnew_root->l = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tNode *rotate_r() {\\n\\t\\t\\tNode *new_root = AVL::new_node(l);\\n\\t\\t\\tl = new_root->r;\\n\\t\\t\\tnew_root->r = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tint height_diff() {\\n\\t\\t\\treturn l->height - r->height;\\n\\t\\t}\\n\\t\\tNode *balance() {\\n\\t\\t\\tint dif = height_diff();\\n\\t\\t\\tif (dif == 2) {\\n\\t\\t\\t\\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\\n\\t\\t\\t\\treturn rotate_r();\\n\\t\\t\\t} else if (dif == -2) {\\n\\t\\t\\t\\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\\n\\t\\t\\t\\treturn rotate_l();\\n\\t\\t\\t} else return fetch();\\n\\t\\t}\\n\\t};\\n\\tstatic Node buf[MAX_NODE];\\n\\tstatic int head;\\n\\tstatic Node *NONE;\\n\\tNode *root = NONE;\\n\\tAVL() {\\n\\t\\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\\n\\t}\\n\\tstatic Node *new_node(Node *node) {\\n\\t\\tif (node == NONE) return node;\\n\\t\\tbuf[head] = *node;\\n\\t\\treturn &buf[head++];\\n\\t}\\n\\tNode *push_back(Node *node, int val) {\\n\\t\\tif (node == NONE) {\\n\\t\\t\\tbuf[head] = {NONE, NONE, val, val, 1, 1};\\n\\t\\t\\treturn &buf[head++];\\n\\t\\t}\\n\\t\\tnode = new_node(node);\\n\\t\\tnode->r = push_back(node->r, val);\\n\\t\\treturn node->balance();\\n\\t}\\n\\tNode *assign(Node *node, int index, int val) {\\n\\t\\tnode = new_node(node);\\n\\t\\tint lsize = node->l->size;\\n\\t\\tif (index < lsize) node->l = assign(node->l, index, val);\\n\\t\\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\\n\\t\\telse node->val = val;\\n\\t\\treturn node->balance();\\n\\t}\\n\\tint min(Node *node, int l, int r) {\\n\\t\\tif (l <= 0 && r >= node->size) return node->min;\\n\\t\\tint lsize = node->l->size;\\n\\t\\tint res = 1000000000;\\n\\t\\tif (l <= lsize && r > lsize) res = node->val;\\n\\t\\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\\n\\t\\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\\n\\t\\treturn res;\\n\\t}\\n\\tvoid dump(Node *node, std::vector<int> &res) {\\n\\t\\tif (node->l != NONE) dump(node->l, res);\\n\\t\\tres.push_back(node->val);\\n\\t\\tif (node->r != NONE) dump(node->r, res);\\n\\t}\\n\\tstd::vector<int> dump() {\\n\\t\\tstd::vector<int> res;\\n\\t\\tdump(root, res);\\n\\t\\treturn res;\\n\\t}\\n\\tvoid push_back(int val) {\\n\\t\\troot = push_back(root, val);\\n\\t}\\n\\tvoid assign(int index, int val) {\\n\\t\\troot = assign(root, index, val);\\n\\t}\\n\\tint min(int l, int r) {\\n\\t\\treturn min(root, l, r);\\n\\t}\\n};\\nAVL::Node AVL::buf[MAX_NODE];\\nint AVL::head = 0;\\nAVL::Node *AVL::NONE = AVL::buf;\\n\\nint main() {\\n\\tint n = ri();\\n\\tAVL a, b;\\n\\tfor (int i = 0; i < n; i++) a.push_back(ri());\\n\\tfor (int i = 0; i < n; i++) b.push_back(ri());\\n\\tint q = ri();\\n\\tfor (int i = 0; i < q; i++) {\\n\\t\\tint t = ri();\\n\\t\\tint y = ri();\\n\\t\\tint z = ri();\\n\\t\\tif (t == 1) a.assign(y - 1, z);\\n\\t\\telse if (t == 2) b.assign(y - 1, z);\\n\\t\\telse if (t == 3) printf(\\\"%d\\\\n\\\", a.min(y - 1, z));\\n\\t\\telse if (t == 4) printf(\\\"%d\\\\n\\\", b.min(y - 1, z));\\n\\t\\telse if (t == 5) a.root = b.root;\\n\\t\\telse if (t == 6) b.root = a.root;\\n\\t\\tif (i % 15000 == 0) {\\n\\t\\t\\tstd::vector<int> a_ = a.dump(), b_ = b.dump();\\n\\t\\t\\tAVL::head = 1;\\n\\t\\t\\ta.root = AVL::NONE;\\n\\t\\t\\tb.root = AVL::NONE;\\n\\t\\t\\tfor (auto i : a_) a.push_back(i);\\n\\t\\t\\tfor (auto i : b_) b.push_back(i);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1180,\n \"memory_kb\": 242840,\n \"score_of_the_acc\": -1.6129,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3024_3931620\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint ri() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\treturn n;\\n}\\n\\n#define MAX_NODE 8000000\\nstruct AVL {\\n\\tstruct Node {\\n\\t\\tNode *l;\\n\\t\\tNode *r;\\n\\t\\tint val;\\n\\t\\tint min;\\n\\t\\tint height;\\n\\t\\tint size;\\n\\t\\tNode *fetch() {\\n\\t\\t\\tmin = std::min({val, l->min, r->min});\\n\\t\\t\\theight = 1 + std::max(l->height, r->height);\\n\\t\\t\\tsize = 1 + l->size + r->size;\\n\\t\\t\\treturn this;\\n\\t\\t}\\n\\t\\tNode *rotate_l() {\\n\\t\\t\\tNode *new_root = AVL::new_node(r);\\n\\t\\t\\tr = new_root->l;\\n\\t\\t\\tnew_root->l = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tNode *rotate_r() {\\n\\t\\t\\tNode *new_root = AVL::new_node(l);\\n\\t\\t\\tl = new_root->r;\\n\\t\\t\\tnew_root->r = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tint height_diff() {\\n\\t\\t\\treturn l->height - r->height;\\n\\t\\t}\\n\\t\\tNode *balance() {\\n\\t\\t\\tint dif = height_diff();\\n\\t\\t\\tif (dif == 2) {\\n\\t\\t\\t\\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\\n\\t\\t\\t\\treturn rotate_r();\\n\\t\\t\\t} else if (dif == -2) {\\n\\t\\t\\t\\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\\n\\t\\t\\t\\treturn rotate_l();\\n\\t\\t\\t} else return fetch();\\n\\t\\t}\\n\\t};\\n\\tstatic Node buf[MAX_NODE];\\n\\tstatic int head;\\n\\tstatic Node *NONE;\\n\\tNode *root = NONE;\\n\\tAVL() {\\n\\t\\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\\n\\t}\\n\\tstatic Node *new_node(Node *node) {\\n\\t\\tif (node == NONE) return node;\\n\\t\\tbuf[head] = *node;\\n\\t\\treturn &buf[head++];\\n\\t}\\n\\tNode *push_back(Node *node, int val) {\\n\\t\\tif (node == NONE) {\\n\\t\\t\\tbuf[head] = {NONE, NONE, val, val, 1, 1};\\n\\t\\t\\treturn &buf[head++];\\n\\t\\t}\\n\\t\\tnode = new_node(node);\\n\\t\\tnode->r = push_back(node->r, val);\\n\\t\\treturn node->balance();\\n\\t}\\n\\tNode *assign(Node *node, int index, int val) {\\n\\t\\tnode = new_node(node);\\n\\t\\tint lsize = node->l->size;\\n\\t\\tif (index < lsize) node->l = assign(node->l, index, val);\\n\\t\\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\\n\\t\\telse node->val = val;\\n\\t\\treturn node->balance();\\n\\t}\\n\\tint min(Node *node, int l, int r) {\\n\\t\\tif (l <= 0 && r >= node->size) return node->min;\\n\\t\\tint lsize = node->l->size;\\n\\t\\tint res = 1000000000;\\n\\t\\tif (l <= lsize && r > lsize) res = node->val;\\n\\t\\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\\n\\t\\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\\n\\t\\treturn res;\\n\\t}\\n\\tvoid dump(Node *node, std::vector<int> &res) {\\n\\t\\tif (node->l != NONE) dump(node->l, res);\\n\\t\\tres.push_back(node->val);\\n\\t\\tif (node->r != NONE) dump(node->r, res);\\n\\t}\\n\\tstd::vector<int> dump() {\\n\\t\\tstd::vector<int> res;\\n\\t\\tdump(root, res);\\n\\t\\treturn res;\\n\\t}\\n\\tvoid push_back(int val) {\\n\\t\\troot = push_back(root, val);\\n\\t}\\n\\tvoid assign(int index, int val) {\\n\\t\\troot = assign(root, index, val);\\n\\t}\\n\\tint min(int l, int r) {\\n\\t\\treturn min(root, l, r);\\n\\t}\\n};\\nAVL::Node AVL::buf[MAX_NODE];\\nint AVL::head = 0;\\nAVL::Node *AVL::NONE = AVL::buf;\\n\\nint main() {\\n\\tint n = ri();\\n\\tAVL a, b;\\n\\tfor (int i = 0; i < n; i++) a.push_back(ri());\\n\\tfor (int i = 0; i < n; i++) b.push_back(ri());\\n\\tint q = ri();\\n\\tfor (int i = 0; i < q; i++) {\\n\\t\\tint t = ri();\\n\\t\\tint y = ri();\\n\\t\\tint z = ri();\\n\\t\\tif (t == 1) a.assign(y - 1, z);\\n\\t\\telse if (t == 2) b.assign(y - 1, z);\\n\\t\\telse if (t == 3) printf(\\\"%d\\\\n\\\", a.min(y - 1, z));\\n\\t\\telse if (t == 4) printf(\\\"%d\\\\n\\\", b.min(y - 1, z));\\n\\t\\telse if (t == 5) a.root = b.root;\\n\\t\\telse if (t == 6) b.root = a.root;\\n\\t\\tif (i % 8000 == 0) {\\n\\t\\t\\tstd::vector<int> a_ = a.dump(), b_ = b.dump();\\n\\t\\t\\tAVL::head = 1;\\n\\t\\t\\ta.root = AVL::NONE;\\n\\t\\t\\tb.root = AVL::NONE;\\n\\t\\t\\tfor (auto i : a_) a.push_back(i);\\n\\t\\t\\tfor (auto i : b_) b.push_back(i);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1900,\n \"memory_kb\": 241076,\n \"score_of_the_acc\": -1.9926,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3024_3931599\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint ri() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\treturn n;\\n}\\n\\n#define MAX_NODE 8000000\\nstruct AVL {\\n\\tstruct Node {\\n\\t\\tNode *l;\\n\\t\\tNode *r;\\n\\t\\tint val;\\n\\t\\tint min;\\n\\t\\tint height;\\n\\t\\tint size;\\n\\t\\tNode *fetch() {\\n\\t\\t\\tmin = std::min({val, l->min, r->min});\\n\\t\\t\\theight = 1 + std::max(l->height, r->height);\\n\\t\\t\\tsize = 1 + l->size + r->size;\\n\\t\\t\\treturn this;\\n\\t\\t}\\n\\t\\tNode *rotate_l() {\\n\\t\\t\\tNode *new_root = AVL::new_node(r);\\n\\t\\t\\tr = new_root->l;\\n\\t\\t\\tnew_root->l = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tNode *rotate_r() {\\n\\t\\t\\tNode *new_root = AVL::new_node(l);\\n\\t\\t\\tl = new_root->r;\\n\\t\\t\\tnew_root->r = this;\\n\\t\\t\\tfetch();\\n\\t\\t\\tnew_root->fetch();\\n\\t\\t\\treturn new_root;\\n\\t\\t}\\n\\t\\tint height_diff() {\\n\\t\\t\\treturn l->height - r->height;\\n\\t\\t}\\n\\t\\tNode *balance() {\\n\\t\\t\\tint dif = height_diff();\\n\\t\\t\\tif (dif == 2) {\\n\\t\\t\\t\\tif (l->height_diff() < 0) l = new_node(l)->rotate_l();\\n\\t\\t\\t\\treturn rotate_r();\\n\\t\\t\\t} else if (dif == -2) {\\n\\t\\t\\t\\tif (r->height_diff() > 0) r = new_node(r)->rotate_r();\\n\\t\\t\\t\\treturn rotate_l();\\n\\t\\t\\t} else return fetch();\\n\\t\\t}\\n\\t};\\n\\tstatic Node buf[MAX_NODE];\\n\\tstatic int head;\\n\\tstatic Node *NONE;\\n\\tNode *root = NONE;\\n\\tAVL() {\\n\\t\\tif (!head) buf[head++] = {NONE, NONE, 0, 1000000000, 0, 0};\\n\\t}\\n\\tstatic Node *new_node(Node *node) {\\n\\t\\tif (node == NONE) return node;\\n\\t\\tbuf[head] = *node;\\n\\t\\treturn &buf[head++];\\n\\t}\\n\\tNode *push_back(Node *node, int val) {\\n\\t\\tif (node == NONE) {\\n\\t\\t\\tbuf[head] = {NONE, NONE, val, val, 1, 1};\\n\\t\\t\\treturn &buf[head++];\\n\\t\\t}\\n\\t\\tnode = new_node(node);\\n\\t\\tnode->r = push_back(node->r, val);\\n\\t\\treturn node->balance();\\n\\t}\\n\\tNode *assign(Node *node, int index, int val) {\\n\\t\\tnode = new_node(node);\\n\\t\\tint lsize = node->l->size;\\n\\t\\tif (index < lsize) node->l = assign(node->l, index, val);\\n\\t\\telse if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);\\n\\t\\telse node->val = val;\\n\\t\\treturn node->balance();\\n\\t}\\n\\tint min(Node *node, int l, int r) {\\n\\t\\tif (l <= 0 && r >= node->size) return node->min;\\n\\t\\tint lsize = node->l->size;\\n\\t\\tint res = 1000000000;\\n\\t\\tif (l <= lsize && r > lsize) res = node->val;\\n\\t\\tif (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));\\n\\t\\tif (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));\\n\\t\\treturn res;\\n\\t}\\n\\tvoid push_back(int val) {\\n\\t\\troot = push_back(root, val);\\n\\t}\\n\\tvoid assign(int index, int val) {\\n\\t\\troot = assign(root, index, val);\\n\\t}\\n\\tint min(int l, int r) {\\n\\t\\treturn min(root, l, r);\\n\\t}\\n};\\nAVL::Node AVL::buf[MAX_NODE];\\nint AVL::head = 0;\\nAVL::Node *AVL::NONE = AVL::buf;\\n\\nint main() {\\n\\tint n = ri();\\n\\tAVL a, b;\\n\\tfor (int i = 0; i < n; i++) a.push_back(ri());\\n\\tfor (int i = 0; i < n; i++) b.push_back(ri());\\n\\tint q = ri();\\n\\tfor (int i = 0; i < q; i++) {\\n\\t\\tint t = ri();\\n\\t\\tint y = ri();\\n\\t\\tint z = ri();\\n\\t\\tif (t == 1) a.assign(y - 1, z);\\n\\t\\telse if (t == 2) b.assign(y - 1, z);\\n\\t\\telse if (t == 3) printf(\\\"%d\\\\n\\\", a.min(y - 1, z));\\n\\t\\telse if (t == 4) printf(\\\"%d\\\\n\\\", b.min(y - 1, z));\\n\\t\\telse if (t == 5) a.root = b.root;\\n\\t\\telse if (t == 6) b.root = a.root;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 140,\n \"memory_kb\": 236752,\n \"score_of_the_acc\": -1.0282,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3024_3924208\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nclass PersistentMinSegTree;\\nclass MinSegBranch;\\nusing seg = std::shared_ptr<PersistentMinSegTree>;\\n\\nclass PersistentMinSegTree {\\npublic:\\n\\tvirtual bool is_defined_at(const int position) const = 0;\\n\\tvirtual int min_of_all() const = 0;\\n\\tvirtual int min_of(const int from, const int to) const = 0;\\n\\tvirtual seg updated(const int position, const int new_value) = 0;\\n};\\nclass MinSegBranch : public PersistentMinSegTree {\\n\\tseg left, right;\\n\\tint from, to, min_cache;\\npublic:\\n\\tMinSegBranch(int _from, int _to, const seg& _left, const seg& _right) : left{ _left }, right{ _right }, from{ _from }, to{ _to }, min_cache{ std::min(_left->min_of_all(), _right->min_of_all()) }{};\\n\\tbool is_defined_at(const int position) const override { return from <= position && position <= to; }\\n\\tint min_of_all() const override { return min_cache; }\\n\\tint min_of(const int from, const int to) const override {\\n\\t\\tif (from <= this->from && this->to <= to) {\\n\\t\\t\\treturn min_cache;\\n\\t\\t}\\n\\t\\telse if (this->from <= to && from <= this->to) {\\n\\t\\t\\treturn std::min(left->min_of(from, to), right->min_of(from, to));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn INT_MAX;\\n\\t\\t}\\n\\t}\\n\\tseg updated(const int position, const int new_value) override {\\n\\t\\tif (left->is_defined_at(position)) return std::make_shared<MinSegBranch>(from, to, left->updated(position, new_value), right);\\n\\t\\tif (right->is_defined_at(position)) return std::make_shared<MinSegBranch>(from, to, left, right->updated(position, new_value));\\n\\t\\tthrow 0;\\n\\t}\\n};\\nclass MinSegLeaf : public PersistentMinSegTree {\\n\\tint position, value;\\npublic:\\n\\tMinSegLeaf(const int _position, const int _value) : position{ _position }, value{ _value }{};\\n\\tbool is_defined_at(const int position) const override { return position == this->position; }\\n\\tint min_of_all() const override { return value; }\\n\\tint min_of(const int from, const int to) const override { return (from <= position && position <= to) ? value : INT_MAX; }\\n\\tseg updated(const int position, const int new_value) override {\\n\\t\\treturn (position == this->position) ? std::make_shared<MinSegLeaf>(position, new_value) : throw 0;\\n\\t}\\n};\\n\\n\\nclass MinSegmentTree {\\n\\tseg root;\\n\\tstatic seg make(const std::vector<int>& array, const int from, const int until) {\\n\\t\\treturn (until - from == 1) ? std::shared_ptr<PersistentMinSegTree>(new MinSegLeaf(from, array[from])) : std::make_shared<MinSegBranch>(from, until - 1, make(array, from, (from + until) / 2), make(array, (from + until) / 2, until));\\n\\t}\\n\\tMinSegmentTree(seg _root) :root{ _root } {};\\npublic:\\n\\tvoid copy_from(const MinSegmentTree& tree) {\\n\\t\\troot = tree.root;\\n\\t}\\n\\tstatic MinSegmentTree make(const std::vector<int>& array) {\\n\\t\\treturn MinSegmentTree(make(array, 0, array.size()));\\n\\t}\\n\\tvoid update(int position, int new_value) {\\n\\t\\troot = root->updated(position, new_value);\\n\\t}\\n\\tint min_of(int from, int to) const {\\n\\t\\treturn root->min_of(from, to);\\n\\t}\\n};\\nint main() {\\n\\tstd::cin.tie(0); std::cin.sync_with_stdio(false);\\n\\tint n; std::cin >> n;\\n\\tstd::vector<int> a(n), b(n); for (auto& i : a) std::cin >> i; for (auto& i : b) std::cin >> i;\\n\\tauto seg_a = MinSegmentTree::make(a);\\n\\tauto seg_b = MinSegmentTree::make(b);\\n\\tint q; std::cin >> q;\\n\\tfor (auto _i = 0; _i < q; ++_i) {\\n\\t\\tint x, y, z; std::cin >> x >> y >> z;\\n\\t\\tswitch (x) {\\n\\t\\tcase 1: seg_a.update(y - 1, z); break;\\n\\t\\tcase 2: seg_b.update(y - 1, z); break;\\n\\t\\tcase 3: std::cout << seg_a.min_of(y - 1, z - 1) << '\\\\n'; break;\\n\\t\\tcase 4: std::cout << seg_b.min_of(y - 1, z - 1) << '\\\\n'; break;\\n\\t\\tcase 5: seg_a.copy_from(seg_b); break;\\n\\t\\tcase 6: seg_b.copy_from(seg_a); break;\\n\\t\\tdefault: throw 0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 60952,\n \"score_of_the_acc\": -0.4098,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3024_3880639\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <functional>\\nusing namespace std;\\n\\ntemplate<typename Monoid>\\nstruct SegmentTree {\\n using F = function<Monoid(Monoid, Monoid)>;\\n const F f;\\n const Monoid M1;\\n int sz;\\n vector<Monoid> dat;\\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\\n while (sz < n) sz <<= 1;\\n dat.assign(sz * 2, M1);\\n }\\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\\n void build() {\\n for (int k = sz - 1; k > 0; k--) {\\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n }\\n void update(int k, const Monoid &x) {\\n dat[k += sz] = x;\\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n Monoid get(int a, int b) { // [a, b)\\n Monoid L = M1, R = M1;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) L = f(L, dat[a++]);\\n if (b & 1) R = f(dat[--b], R);\\n }\\n return f(L, R);\\n }\\n Monoid operator[](const int &k) const { return dat[k + sz]; }\\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \\\" \\\";\\n return os;\\n }\\n};\\n\\nconst int INF = numeric_limits<int>::max();\\nint main() {\\n int n; cin >> n;\\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\\n seg1.build();\\n seg2.build();\\n int q; cin >> q;\\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\\n bool init = true;\\n #define eb emplace_back\\n while (q--) {\\n int x, y, z; cin >> x >> y >> z; y--;\\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\\n if (x == 3) cout << seg1.get(y, z) << endl;\\n if (x == 4) cout << seg2.get(y, z) << endl;\\n if (x == 5) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\\n init = false;\\n } else {\\n reverse(a_his.begin(), a_his.end());\\n for (auto &p: a_his) seg1.update(p.first, p.second);\\n for (auto &p: b_upd) seg1.update(p.first, p.second);\\n }\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n if (x == 6) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\\n init = false;\\n } else {\\n reverse(b_his.begin(), b_his.end());\\n for (auto &p: b_his) seg2.update(p.first, p.second);\\n for (auto &p: a_upd) seg2.update(p.first, p.second);\\n }\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 7060,\n \"score_of_the_acc\": -0.1624,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3024_3880631\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <functional>\\nusing namespace std;\\n\\ntemplate<typename Monoid>\\nstruct SegmentTree {\\n using F = function<Monoid(Monoid, Monoid)>;\\n const F f;\\n const Monoid M1;\\n int sz;\\n vector<Monoid> dat;\\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\\n while (sz < n) sz <<= 1;\\n dat.assign(sz * 2, M1);\\n }\\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\\n void build() {\\n for (int k = sz - 1; k > 0; k--) {\\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n }\\n void update(int k, const Monoid &x) {\\n dat[k += sz] = x;\\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n Monoid get(int a, int b) { // [a, b)\\n Monoid L = M1, R = M1;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) L = f(L, dat[a++]);\\n if (b & 1) R = f(dat[--b], R);\\n }\\n return f(L, R);\\n }\\n Monoid operator[](const int &k) const { return dat[k + sz]; }\\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \\\" \\\";\\n return os;\\n }\\n};\\n\\nconst int INF = numeric_limits<int>::max();\\nint main() {\\n int n; cin >> n;\\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\\n int q; cin >> q;\\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\\n bool init = true;\\n #define eb emplace_back\\n while (q--) {\\n int x, y, z; cin >> x >> y >> z; y--;\\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\\n if (x == 3) cout << seg1.get(y, z) << endl;\\n if (x == 4) cout << seg2.get(y, z) << endl;\\n if (x == 5) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\\n init = false;\\n } else {\\n reverse(a_his.begin(), a_his.end());\\n for (auto &p: a_his) seg1.update(p.first, p.second);\\n for (auto &p: b_upd) seg1.update(p.first, p.second);\\n }\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n if (x == 6) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\\n init = false;\\n } else {\\n reverse(b_his.begin(), b_his.end());\\n for (auto &p: b_his) seg2.update(p.first, p.second);\\n for (auto &p: a_upd) seg2.update(p.first, p.second);\\n }\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 260,\n \"memory_kb\": 7060,\n \"score_of_the_acc\": -0.1302,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3024_3880630\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <functional>\\nusing namespace std;\\n\\ntemplate<typename Monoid>\\nstruct SegmentTree {\\n using F = function<Monoid(Monoid, Monoid)>;\\n const F f;\\n const Monoid M1;\\n int sz;\\n vector<Monoid> dat;\\n SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), sz(1) {\\n while (sz < n) sz <<= 1;\\n dat.assign(sz * 2, M1);\\n }\\n void set(int k, const Monoid &x) { dat[k + sz] = x; }\\n void build() {\\n for (int k = sz - 1; k > 0; k--) {\\n dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n }\\n void update(int k, const Monoid &x) {\\n dat[k += sz] = x;\\n while (k >>= 1) dat[k] = f(dat[2 * k], dat[2 * k + 1]);\\n }\\n Monoid get(int a, int b) { // [a, b)\\n Monoid L = M1, R = M1;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) L = f(L, dat[a++]);\\n if (b & 1) R = f(dat[--b], R);\\n }\\n return f(L, R);\\n }\\n Monoid operator[](const int &k) const { return dat[k + sz]; }\\n friend ostream& operator<<(ostream& os, SegmentTree<Monoid> &seg) {\\n for (int i = 0; i < seg.sz; i++) os << seg[i] << \\\" \\\";\\n return os;\\n }\\n};\\n\\nconst int INF = numeric_limits<int>::max();\\nint main() {\\n int n; cin >> n;\\n SegmentTree<int> seg1(n, [](int a, int b) { return min(a, b); }, INF);\\n SegmentTree<int> seg2(n, [](int a, int b) { return min(a, b); }, INF);\\n for (int i = 0; i < n; i++) { int a; cin >> a; seg1.set(i, a); }\\n for (int i = 0; i < n; i++) { int b; cin >> b; seg2.set(i, b); }\\n int q; cin >> q;\\n vector<pair<int, int>> a_his, a_upd, b_his, b_upd;\\n bool init = true;\\n #define eb emplace_back\\n while (q--) {\\n int x, y, z; cin >> x >> y >> z; y--;\\n if (x == 1) a_his.eb(y, seg1[y]), seg1.update(y, z), a_upd.eb(y, z);\\n if (x == 2) b_his.eb(y, seg2[y]), seg2.update(y, z), b_upd.eb(y, z);\\n if (x == 3) cout << seg1.get(y, z) << endl;\\n if (x == 4) cout << seg2.get(y, z) << endl;\\n if (x == 5) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg1.update(i, seg2[i]);\\n init = false;\\n continue;\\n }\\n reverse(a_his.begin(), a_his.end());\\n for (auto &p: a_his) seg1.update(p.first, p.second);\\n for (auto &p: b_upd) seg1.update(p.first, p.second);\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n if (x == 6) {\\n if (init) {\\n for (int i = 0; i < n; i++) seg2.update(i, seg1[i]);\\n init = false;\\n continue;\\n }\\n reverse(b_his.begin(), b_his.end());\\n for (auto &p: b_his) seg2.update(p.first, p.second);\\n for (auto &p: a_upd) seg2.update(p.first, p.second);\\n a_his.clear(), a_upd.clear(), b_his.clear(), b_upd.clear();\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.125,\n \"time_ms\": 260,\n \"memory_kb\": 7000,\n \"score_of_the_acc\": -0.1299,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3024_3629207\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\n\\nstruct Node{\\n int val;\\n Node* lhs, *rhs;\\n Node(int val):val(val),lhs(nullptr),rhs(nullptr){}\\n};\\n\\nNode* update(Node* t,int l, int r,int k,int x){\\n if(k<l||r<=k)return t;\\n if(l+1==r){\\n Node* ret = new Node(x);\\n return ret;\\n }\\n int mid=(l+r)/2;\\n Node* ret = new Node(inf);\\n ret->lhs = update(t->lhs,l,mid,k,x);\\n ret->rhs = update(t->rhs,mid,r,k,x);\\n ret->val = min(ret->lhs->val, ret->rhs->val);\\n return ret;\\n}\\n\\nint query(Node* t,int a,int b, int l, int r){\\n if(b<=l||r<=a)return inf;\\n if(a<=l&&r<=b)return t->val;\\n int vl = query(t->lhs, a,b,l,(l+r)/2);\\n int vr = query(t->rhs, a,b,(l+r)/2, r);\\n return min(vl,vr);\\n}\\n\\nNode* build(vector<int>& v, int l, int r){\\n Node* ret = new Node(inf);\\n if(l+1==r){\\n ret->val=v[l];\\n return ret;\\n }\\n ret->lhs = build(v,l,(l+r)/2);\\n ret->rhs = build(v,(l+r)/2,r);\\n ret->val = min(ret->lhs->val, ret->rhs->val);\\n return ret;\\n}\\nint main(){\\n int n;\\n cin>>n;\\n int m=1;\\n while(m<n)m*=2;\\n vector<int> a(m,inf), b(m,inf);\\n rep(i,n)cin>>a[i];\\n rep(i,n)cin>>b[i];\\n Node* A = build(a,0,m);\\n Node* B = build(b,0,m);\\n int q;\\n cin>>q;\\n while(q--){\\n int x,y,z;\\n scanf(\\\"%d%d%d\\\",&x,&y,&z);\\n --y;\\n if(x==1){\\n A = update(A, 0, m, y, z);\\n }\\n if(x==2){\\n B = update(B, 0, m, y, z);\\n }\\n if(x==5){\\n A = B;\\n }\\n if(x==6){\\n B = A;\\n }\\n if(x==3){\\n printf(\\\"%d\\\\n\\\",query(A,y,z,0,m));\\n }\\n if(x==4){\\n printf(\\\"%d\\\\n\\\",query(B,y,z,0,m));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 91380,\n \"score_of_the_acc\": -0.4997,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3024_3128421\",\n \"code_snippet\": \"#define NDEBUG 1\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E,typename F,typename G,typename H>\\nstruct SegmentTree{\\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n T query(int k){\\n k+=n;\\n for(int i=height;i;i--) eval(k>>i);\\n return reflect(k);\\n }\\n void update(int k,T x){\\n k+=n;\\n //for(int i=height;i;i--) eval(k>>i);\\n dat[k]=x;\\n laz[k]=ei;\\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n scanf(\\\"%d\\\",&n);\\n using P = pair<int,int>;\\n vector<P> v(n);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].first);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].second);\\n auto f=[](P a,P b){\\n\\t return P(min(a.first,b.first),\\n\\t\\t min(a.second,b.second));\\n\\t };\\n auto g=[](P a,P b){\\n\\t if(b.first<0){\\n\\t if(b.second<0) return a;\\n\\t return P(a.second,a.second);\\n\\t }\\n\\t if(b.second<0)\\n\\t return P(a.first,a.first);\\n\\t if(b.second<b.first)\\n\\t return P(a.second,a.second);\\n\\t return P(a.first,a.first);\\n\\t };\\n auto h=[](P a,P b){\\n\\t int x=a.first,y=a.second;\\n\\t if(x<0) x=b.first;\\n\\t if(y<0) y=b.second;\\n\\t return P(x,y);\\n\\t };\\n \\n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\\n rmq.build(n,v);\\n \\n int q;\\n scanf(\\\"%d\\\",&q);\\n for(int i=0;i<q;i++){\\n int x,y,z;\\n scanf(\\\"%d %d %d\\\",&x,&y,&z);\\n y--;\\n if(x==1){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y);\\n c.first=z;\\n rmq.update(y,c);\\n }\\n if(x==2){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y);\\n c.second=z;\\n rmq.update(y,c);\\n }\\n if(x==3){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.first);\\n }\\n if(x==4){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.second);\\n }\\n if(x==5){\\n rmq.query(0,n);\\n rmq.update(0,n,P(-1,i));\\n }\\n if(x==6){\\n rmq.query(0,n);\\n rmq.update(0,n,P(i,-1));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 14184,\n \"score_of_the_acc\": -0.1009,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3024_3128420\",\n \"code_snippet\": \"#define NDEBUG 1\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E,typename F,typename G,typename H>\\nstruct SegmentTree{\\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n T query(int k){\\n k+=n;\\n for(int i=height;i;i--) eval(k>>i);\\n return reflect(k);\\n }\\n void update(int k,T x){\\n k+=n;\\n for(int i=height;i;i--) eval(k>>i);\\n dat[k]=x;\\n laz[k]=ei;\\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n scanf(\\\"%d\\\",&n);\\n using P = pair<int,int>;\\n vector<P> v(n);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].first);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].second);\\n auto f=[](P a,P b){\\n\\t return P(min(a.first,b.first),\\n\\t\\t min(a.second,b.second));\\n\\t };\\n auto g=[](P a,P b){\\n\\t if(b.first<0){\\n\\t if(b.second<0) return a;\\n\\t return P(a.second,a.second);\\n\\t }\\n\\t if(b.second<0)\\n\\t return P(a.first,a.first);\\n\\t if(b.second<b.first)\\n\\t return P(a.second,a.second);\\n\\t return P(a.first,a.first);\\n\\t };\\n auto h=[](P a,P b){\\n\\t int x=a.first,y=a.second;\\n\\t if(x<0) x=b.first;\\n\\t if(y<0) y=b.second;\\n\\t return P(x,y);\\n\\t };\\n \\n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\\n rmq.build(n,v);\\n \\n int q;\\n scanf(\\\"%d\\\",&q);\\n for(int i=0;i<q;i++){\\n int x,y,z;\\n scanf(\\\"%d %d %d\\\",&x,&y,&z);\\n y--;\\n if(x==1){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y);\\n c.first=z;\\n rmq.update(y,c);\\n }\\n if(x==2){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y);\\n c.second=z;\\n rmq.update(y,c);\\n }\\n if(x==3){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.first);\\n }\\n if(x==4){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.second);\\n }\\n if(x==5){\\n rmq.query(0,n);\\n rmq.update(0,n,P(-1,i));\\n }\\n if(x==6){\\n rmq.query(0,n);\\n rmq.update(0,n,P(i,-1));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 14180,\n \"score_of_the_acc\": -0.1009,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3024_3128414\",\n \"code_snippet\": \"#define NDEBUG 1\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E,typename F,typename G,typename H>\\nstruct SegmentTree{\\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n void update(int k,T x){\\n dat[k+=n]=x;\\n laz[k]=ei;\\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n scanf(\\\"%d\\\",&n);\\n using P = pair<int,int>;\\n vector<P> v(n);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].first);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].second);\\n auto f=[](P a,P b){\\n\\t return P(min(a.first,b.first),\\n\\t\\t min(a.second,b.second));\\n\\t };\\n auto g=[](P a,P b){\\n\\t if(b.first<0){\\n\\t if(b.second<0) return a;\\n\\t return P(a.second,a.second);\\n\\t }\\n\\t if(b.second<0)\\n\\t return P(a.first,a.first);\\n\\t if(b.second<b.first)\\n\\t return P(a.second,a.second);\\n\\t return P(a.first,a.first);\\n\\t };\\n auto h=[](P a,P b){\\n\\t int x=a.first,y=a.second;\\n\\t if(x<0) x=b.first;\\n\\t if(y<0) y=b.second;\\n\\t return P(x,y);\\n\\t };\\n \\n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\\n rmq.build(n,v);\\n \\n int q;\\n scanf(\\\"%d\\\",&q);\\n for(int i=0;i<q;i++){\\n int x,y,z;\\n scanf(\\\"%d %d %d\\\",&x,&y,&z);\\n y--;\\n if(x==1){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y,y+1);\\n c.first=z;\\n rmq.update(y,c);\\n }\\n if(x==2){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y,y+1);\\n c.second=z;\\n rmq.update(y,c);\\n }\\n if(x==3){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.first);\\n }\\n if(x==4){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.second);\\n }\\n if(x==5){\\n rmq.query(0,n);\\n rmq.update(0,n,P(-1,i));\\n }\\n if(x==6){\\n rmq.query(0,n);\\n rmq.update(0,n,P(i,-1));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 14180,\n \"score_of_the_acc\": -0.1009,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3024_3128413\",\n \"code_snippet\": \"#define NDEBUG 1\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E,typename F,typename G,typename H>\\nstruct SegmentTree{\\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n void update(int k,T x){\\n eval(k+=n);\\n dat[k]=x; \\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1)); \\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n scanf(\\\"%d\\\",&n);\\n using P = pair<int,int>;\\n vector<P> v(n);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].first);\\n for(int i=0;i<n;i++) scanf(\\\"%d\\\",&v[i].second);\\n auto f=[](P a,P b){\\n\\t return P(min(a.first,b.first),\\n\\t\\t min(a.second,b.second));\\n\\t };\\n auto g=[](P a,P b){\\n\\t if(b.first<0){\\n\\t if(b.second<0) return a;\\n\\t return P(a.second,a.second);\\n\\t }\\n\\t if(b.second<0)\\n\\t return P(a.first,a.first);\\n\\t if(b.second<b.first)\\n\\t return P(a.second,a.second);\\n\\t return P(a.first,a.first);\\n\\t };\\n auto h=[](P a,P b){\\n\\t int x=a.first,y=a.second;\\n\\t if(x<0) x=b.first;\\n\\t if(y<0) y=b.second;\\n\\t return P(x,y);\\n\\t };\\n \\n SegmentTree<P, P, decltype(f), decltype(g), decltype(h)> rmq(n,f,g,h,P(INT_MAX,INT_MAX),P(-1,-1));\\n rmq.build(n,v);\\n \\n int q;\\n scanf(\\\"%d\\\",&q);\\n for(int i=0;i<q;i++){\\n int x,y,z;\\n scanf(\\\"%d %d %d\\\",&x,&y,&z);\\n y--;\\n if(x==1){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y,y+1);\\n c.first=z;\\n rmq.update(y,c);\\n }\\n if(x==2){\\n assert(0<=y&&y<n);\\n P c=rmq.query(y,y+1);\\n c.second=z;\\n rmq.update(y,c);\\n }\\n if(x==3){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.first);\\n }\\n if(x==4){\\n assert(0<=y&&y<z);\\n P c=rmq.query(y,z);\\n printf(\\\"%d\\\\n\\\",c.second);\\n }\\n if(x==5){\\n rmq.query(0,n);\\n rmq.update(0,n,P(-1,i));\\n }\\n if(x==6){\\n rmq.query(0,n);\\n rmq.update(0,n,P(i,-1));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 14184,\n \"score_of_the_acc\": -0.1063,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1875,"cells":{"group_id":{"kind":"string","value":"aoj_3029_cpp"},"problem_description":{"kind":"string","value":"Problem D: AABABCAC\nProblem\n文字列$s$,$t$が与えられる。\n最初、文字列集合$A=${$s$},$B=\\phi$とする。\nこのとき、次の操作をできるだけたくさん行いたい。\n操作\nstep1\n全ての $u ∊ A$ について、以下の処理を行う。\n$u$の全ての部分列(連続でなくてもよい)から、$t$と等しいものを任意に1つ選ぶ。選んだ部分列の$u$に対応するインデックスをそれぞれ$z_1$, $z_2$, …, $z_{|t|}$とする(ただし1 $\\le$ $z_1$ $\\lt$ $z_2$ $\\lt$ … $\\lt$ $z_{|t|}$ $\\le$ $|u|$)。そのような部分列がなければ操作を終了する。\n選んだ部分列の文字$u_{z_1}$, $u_{z_2}$, …, $u_{z_{|t|}}$でもとの文字列を分割し、それらを$B$に追加する。\n例えば、$u=$\"abcdcd\", $t=$\"ac\"の場合は次の2通りの分割の方法が考えられる。\n$u$の1番目の文字と3番目の文字を選んだ場合、\"\"と\"b\"と\"dcd\"に分割される。\n$u$の1番目の文字と5番目の文字を選んだ場合、\"\"と\"bcd\"と\"d\"に分割される。\nstep2\n$A$を$B$に置き換え、$B$を空にする。\n操作回数を1増やす。\n部分列の例\n\"abac\"の部分列は、\n { \"\" , \"a\" , \"b\" , \"c\" , \"aa\" ,\"ab\" , \"ac\" , \"ba\" , \"bc\" , \"aac\" , \"aba\" , \"abc\" , \"bac\" , \"abac\" }\n である。\n\"a\"は\"abac\"の1文字目、または3文字目を抜き出すことによってできた部分列である。\n\"ac\"は\"abac\"の1文字目と4文字目、または3文字目と4文字目を抜き出すことによってできた部分列である。\nInput\n入力は以下の形式で与えられる。\n$s$\n$t$\n1行目に文字列$s$,2行目に文字列$t$が与えられる。\nConstraints\n入力は以下の条件を満たす。\n1 $\\le$ $|t|$ $\\le$ $|s|$ $\\le$ $10^5$\n文字列$s$,$t$に含まれる文字はアルファベットの大文字または小文字\nOutput\n操作回数の最大値を出力せよ。\nSample Input 1\nAABABCAC\nA\nSample Output 1\n2\n1回目の操作は、$A=${ \"AABABCAC\" }で始まる。\nstep1では、$u=$\"AABABCAC\"に対して、例えば4番目の文字を$t$と等しい部分列として選び、\"AAB\"と\"BCAC\"に分割し、それらを$B$に追加する。\nstep2では、$A$を$B$に置き換え、$B$を空にし、操作回数は1となる。\n2回目の操作は、$A=${ \"AAB\" , \"BCAC\" }で始まる。\nstep1では、$u=$\"AAB\"に対して、例えば1番目の文字を$t$と等しい部分列として選び、\"\"と\"AB\"に分割し、それらを$B$に追加する。次に$u=$\"BCAC\"に対して、3番目の文字を$t$と等しい部分列として選び、\"BC\"と\"C\"に分割し、それらを$B$に追加する。\nstep2では、$A$を$B$に置き換え、$B$を空にし、操作回数は2となる。\n3回目の操作は、$A=${ \"\" , \"AB\" , \"BC\" , \"C\" }で始まる。\nstep1では、$u=$\"\"に対して、$t$と等しい部分列が存在しないため、ここで操作を終了する。\nこの例の場合、3回目の操作ではstep1で操作が終了したため、操作回数は2となる。\nSample Input 2\nabaabbabaabaabbabbabaabbab\nab\nSample Output 2\n3\nSample Input 3\nAbCdEfG\naBcDeFg\nSample Output 3\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3029_2752501","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp make_pair\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nint solve(){\n string s,t;\n cin>>s>>t;\n\n if(s.size() == t.size()){\n if(s==t) return 1;\n else return 0;\n }\n\n int r = 1;\n int cur = t.size();\n while(s.size() >= cur){\n cur += (cur+1)*t.size();\n r++;\n }\n\n auto f = [&](int x){\n if(x==0) return true;\n string tt = \"\";\n rep(i,x){\n string ns = tt;\n rep(j,t.size()) ns += t[j] + tt;\n swap(ns, tt);\n }\n // dbg(x,tt);\n int is=0,it=0;\n while(is<s.size() && it<tt.size()){\n if(s[is] == tt[it]){\n is++; it++;\n } else {\n is++;\n }\n }\n return it == tt.size();\n };\n\n int l=0;\n while(r-l>1){\n int mid = (l+r)/2;\n if(f(mid)) l = mid;\n else r = mid;\n }\n return l;\n}\n\n\nint main(){\n cout << solve() << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3464,"score_of_the_acc":-0.0104,"final_rank":3},{"submission_id":"aoj_3029_2751756","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n/*{{{*/ //template\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nconstexpr int INF = numeric_limits<int>::max()/2;\nconstexpr long long LINF = numeric_limits<long long>::max()/3;\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define sz(x) (int)(x).size()\n#define debug(x) cerr<<#x<<\":\"<<x<<endl\n#define debug2(x,y) cerr<<#x<<\",\"<<#y\":\"<<x<<\",\"<<y<<endl\n//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\nstruct Double{ double d; explicit Double(double x) : d(x){} };\nostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << \"[\"; for(const auto& v : vec){ os << v << \",\"; } os << \"]\"; return os; }\ntemplate<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << \"(\" << p.first << \",\"<< p.second <<\")\"; return os; }\ntemplate<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<\"{\"; for(T v:st) os<<v<<\",\"; os <<\"}\"; return os; }\ntemplate<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }\ntemplate<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }\n//constexpr double eps = 1e-14; \nconstexpr double eps = 1e-10; \nconstexpr ll mod = 1e9+7;\nconst int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};\n/*}}}*/\n\nstring s,t;\nint n,m;\n\n// s[idx,n)\n// return : 次の場所\nint rec(int idx , int depth){\n int idx_ = idx;\n if(depth == 0) return idx; // そのまま\n if(idx >= n) return -1;\n idx = rec(idx,depth-1); // 消費 A_n-1\n if(idx == -1) return -1;\n for(int i=0;i<m;i++){\n while(idx < n and t[i] != s[idx]) idx++;\n if(idx >= n) return -1;\n // t[i] == s[idx]\n idx++;\n // s[idx,n)\n idx = rec(idx,depth-1);\n if(idx == -1) return -1;\n }\n //cout << idx_ << \" \" << depth << \" \" << idx << endl;\n return idx;\n}\n\nint main(){\n cin >> s >> t;\n n = s.size();\n m = t.size();\n\n //cout << rec(0,3) << endl;\n //return 0;\n\n int l,r;\n l = 0;\n r = n+1;\n while(r-l>1){\n int mid = (l+r)/2;\n int ret = rec(0,mid);\n //cout << mid << \" \" << ret << endl;\n if(ret < 0){ // NG\n r = mid;\n }else{ // OK\n l = mid;\n }\n }\n cout << l << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":6428,"score_of_the_acc":-0.1475,"final_rank":6},{"submission_id":"aoj_3029_2751528","code_snippet":"#define FOR(i,j,n) for (int i=(j);i<(n);i++)\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define REPN(i,n) for (int i=(n);i>=0;i--)\n#define I(n) scanf(\"%d\", &(n))\n#define LL(n) scanf(\"%lld\", &(n))\n#define pb(n) push_back((n))\n#define mp(i,j) make_pair((i),(j))\n#include <bits/stdc++.h>\nusing namespace std;\n\n//------------------------------typedef集\ntypedef vector<int> vi;\ntypedef pair<int,int> pi;\ntypedef vector<pi> vpi;\ntypedef vector<vi> vvi;\ntypedef vector<vpi> vvpi;\ntypedef vector<vvi> vvvi;\ntypedef long long ll;\n\nstring s,t;\nint si,ti,cnt;\n\nint main(){\n cnt = 1;\n cin >> s;\n cin >> t;\n\n int tsz = t.size();\n int si;\n while(1){\n int ssz = s.size();\n si = 0;\n for(;si<ssz;si++){\n if (s[si] == t[ti]){\n ti++;\n s.erase(s.begin()+si);\n si--;\n ssz--;\n if (ti == tsz){\n ti = 0;\n cnt++;\n break;\n }\n }\n }\n if (si == ssz) break;\n }\n\n int ans = 0;\n while (cnt){\n ans++;\n cnt /= 2;\n }\n cout << ans-1 << endl;\n}","accuracy":0.29545454545454547,"time_ms":10,"memory_kb":3240,"score_of_the_acc":0,"final_rank":9},{"submission_id":"aoj_3029_2751457","code_snippet":"#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <assert.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n#define ALL(c) (c).begin(), (c).end()\n\ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef vector<VL> VVL;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint in() { int x; scanf(\"%d\", &x); return x; }\nll lin() { ll x; scanf(\"%lld\", &x); return x; }\n\nstring s, t;\nint n, m, i;\nbool ok;\n\nvoid check(int d, int k){\n if (d == k - 1){\n int j = 0;\n while (i < n){\n if (s[i] == t[j]){\n j++;\n }\n i++;\n if (j == m) break;\n }\n if (j < m) ok = false;\n }else{\n int j = 0;\n check(d + 1, k);\n while (i < n){\n if (s[i] == t[j]){\n i++;\n j++;\n check(d + 1, k);\n if (j == m) break;\n }else{\n i++;\n }\n }\n if (j < m) ok = false;\n }\n}\n\nint main() {\n cin >> s >> t;\n\n n = s.length(), m = t.length();\n\n int ans = 0;\n FOR(k,1,20){\n // cout << \"check \" << k << endl;\n ok = true;\n i = 0;\n check(0, k);\n\n if (ok) ans = k;\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3332,"score_of_the_acc":-0.0043,"final_rank":2},{"submission_id":"aoj_3029_2751415","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define DBG cerr << '!' << endl;\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\n#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)\n#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))\n#define PB push_back\n#define MP make_pair\n#define FI first\n#define SE second\n#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}\n#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}\n#define ALL(v) v.begin(),v.end()\n#define Decimal fixed<<setprecision(10)\n#define INF 1000000000\n#define MOD 1000000007\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\nstring S;\nstring T;\nint place;\n\nbool dfs(int depth){\n\tif(depth <= 0)return true;\n\tif(!dfs(depth-1))return false;\n\tREP(i,T.size()){\n\t\twhile(S[place] != T[i])\n\t\t{\n\t\t\t//cout << S[place];\n\t\t\tplace++;\n\t\t\tif(place >= S.size())return false;\n\t\t}\n\t\t//cout << depth;\n\t\tplace++;\n\t\tif(depth>1 && place >= S.size())return false;\n\t\tif(!dfs(depth-1))return false;\n\t}\t\n\t\n\treturn true;\n}\n\nint main()\n{\n\tcin >> S >> T;\n\t//cout << S.size() << endl;\n\t//cout << T.size() << endl;\n\tint ans = 0;\n\twhile(1){\n\t\t//cout << endl;\n\t\tplace = 0;\n\t\tif(dfs(ans))ans++;\n\t\telse break;\n\t}\n\t//cout << endl;\n\tcout << ans-1 << endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.0022,"final_rank":1},{"submission_id":"aoj_3029_2751182","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\n#define INF 1e16\n#define mod 1000000007\n\nstring s,t;\nint sa[100010],ta[100010];\nint n,m;\nint nxt[100010][52];\nstring b[20];\nvector<int> ba[20];\n\nint main(){\n cin>>s>>t;\n n=s.size();\n m=t.size();\n rep(i,n){\n if(s[i]>='A'&&s[i]<='Z')sa[i]=s[i]-'A';\n else sa[i]=s[i]-'a'+26;\n }\n rep(i,n){\n if(t[i]>='A'&&t[i]<='Z')ta[i]=t[i]-'A';\n else ta[i]=t[i]-'a'+26;\n }\n b[0]=t;\n rep(i,b[0].size()){\n if(b[0][i]>='A'&&b[0][i]<='Z')ba[0].push_back(b[0][i]-'A');\n else ba[0].push_back(b[0][i]-'a'+26);\n }\n repl(i,1,20){\n if(m*b[i-1].size()>n)break;\n rep(j,m){\n b[i]+=b[i-1];\n b[i]+=t[j];\n }\n b[i]+=b[i-1];\n rep(j,b[i].size()){\n if(b[i][j]>='A'&&b[i][j]<='Z')ba[i].push_back(b[i][j]-'A');\n else ba[i].push_back(b[i][j]-'a'+26);\n }\n }\n memset(nxt,-1,sizeof(nxt));\n for(int i=n-1;i>=0;i--){\n for(int j=0;j<52;j++){\n if(sa[i]==j)nxt[i][j]=i+1;\n else nxt[i][j]=nxt[i+1][j];\n }\n }\n rep(i,20){\n int crt=0;\n if(ba[i].size()==0){\n cout<<i<<endl;\n return 0;\n }\n rep(j,ba[i].size()){\n int nxti=nxt[crt][ba[i][j]];\n if(nxti<0){\n cout<<i<<endl;\n return 0;\n }\n crt=nxti;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":24848,"score_of_the_acc":-1,"final_rank":7},{"submission_id":"aoj_3029_2751068","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nstring s, t;\nbool ok;\nvoid f(int depth, string &ret) {\n\tif (depth == 0)return;\n\tf(depth - 1, ret);\n\tfor (auto &it : t) {\n\t\tret += it;\n\t\tif (ret.size() > s.size()) {\n\t\t\tok = false;\n\t\t\treturn;\n\t\t}\n\t\tf(depth - 1,ret);\n\t}\n}\nstring g(int depth) {\n\tok = true;\n\tstring ret = \"\";\n\tf(depth, ret);\n\tif(ok)return ret;\n\telse return \"\";\n}\nbool check(string x) {\n\tif (x.size() == 0)return false;\n\tint n = s.size();\n\tint m = x.size();\n\tint j = 0;\n\tfor (int i : range(n)) {\n\t\tif (s[i] == x[j])j++;\n\t\tif (j == m)return true;\n\t}\n\treturn false;\n}\nint main() {\n\twhile (cin >> s >> t) {\n\t\tint ub = s.size() + 1;\n\t\tint lb = 0;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\tstring x = g(mid);\n\t\t\t(check(x) ? lb : ub) = mid;\n\t\t}\n\t\tcout << lb << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6576,"score_of_the_acc":-1.1544,"final_rank":8},{"submission_id":"aoj_3029_2744711","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstring s, t;\nint n, m;\n\nstring u;\n\nbool build() {\n string tmp = u;\n for(int i = 0; i < m; ++i) {\n u += t[i]+tmp;\n if(u.size() > s.size()) return false;\n }\n return true;\n}\n\nint main() {\n cin >> s >> t;\n n = s.size();\n m = t.size();\n u = \"\";\n for(int i = 0; i < 20; ++i) {\n int k = 0;\n for(int j = 0; j < n && k < (int)u.size(); ++j) {\n if(s[j] == u[k]) ++k;\n }\n if(k != (int)u.size()) {\n cout << i-1 << endl;\n return 0;\n }\n if(!build()) {\n cout << i << endl;\n return 0;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3588,"score_of_the_acc":-0.0161,"final_rank":5},{"submission_id":"aoj_3029_2744298","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\" \":\"\")<<t;return o;}\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\nvoid prArr(auto a,string s=\" \"){int i=0;for(auto t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\nstring s,t;\n\nstring dfs(int dep){\n if(dep == 1) return t;\n string u = dfs(dep-1);\n if(u == \"$\") return \"$\";\n string res = u;\n for(char ch:t) {\n if(res.size() > s.size()) return \"$\";\n res += ch, res += u;\n }\n return res; \n}\n\nbool check(const string &u){\n int idx = 0;\n for(char ch:s)\n if(idx < (int)u.size() && u[idx] == ch) idx++;\n return idx == (int)u.size();\n}\n\nsigned main(){\n cin>>s>>t;\n \n int ans = 0;\n for(int i=1;i<=20;i++){\n string u = dfs(i);\n if(check(u)) ans = i;\n }\n cout<<ans<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3512,"score_of_the_acc":-0.0126,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_3029_2752501\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp make_pair\\n#define pb push_back\\n#define all(x) begin(x),end(x)\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cerr<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nint solve(){\\n string s,t;\\n cin>>s>>t;\\n\\n if(s.size() == t.size()){\\n if(s==t) return 1;\\n else return 0;\\n }\\n\\n int r = 1;\\n int cur = t.size();\\n while(s.size() >= cur){\\n cur += (cur+1)*t.size();\\n r++;\\n }\\n\\n auto f = [&](int x){\\n if(x==0) return true;\\n string tt = \\\"\\\";\\n rep(i,x){\\n string ns = tt;\\n rep(j,t.size()) ns += t[j] + tt;\\n swap(ns, tt);\\n }\\n // dbg(x,tt);\\n int is=0,it=0;\\n while(is<s.size() && it<tt.size()){\\n if(s[is] == tt[it]){\\n is++; it++;\\n } else {\\n is++;\\n }\\n }\\n return it == tt.size();\\n };\\n\\n int l=0;\\n while(r-l>1){\\n int mid = (l+r)/2;\\n if(f(mid)) l = mid;\\n else r = mid;\\n }\\n return l;\\n}\\n\\n\\nint main(){\\n cout << solve() << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.0104,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3029_2751756\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n/*{{{*/ //template\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\nconstexpr int INF = numeric_limits<int>::max()/2;\\nconstexpr long long LINF = numeric_limits<long long>::max()/3;\\n#define mp make_pair\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define sz(x) (int)(x).size()\\n#define debug(x) cerr<<#x<<\\\":\\\"<<x<<endl\\n#define debug2(x,y) cerr<<#x<<\\\",\\\"<<#y\\\":\\\"<<x<<\\\",\\\"<<y<<endl\\n//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\\nstruct Double{ double d; explicit Double(double x) : d(x){} };\\nostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }\\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << \\\"[\\\"; for(const auto& v : vec){ os << v << \\\",\\\"; } os << \\\"]\\\"; return os; }\\ntemplate<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << \\\"(\\\" << p.first << \\\",\\\"<< p.second <<\\\")\\\"; return os; }\\ntemplate<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<\\\"{\\\"; for(T v:st) os<<v<<\\\",\\\"; os <<\\\"}\\\"; return os; }\\ntemplate<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }\\ntemplate<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\nll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }\\n//constexpr double eps = 1e-14; \\nconstexpr double eps = 1e-10; \\nconstexpr ll mod = 1e9+7;\\nconst int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};\\n/*}}}*/\\n\\nstring s,t;\\nint n,m;\\n\\n// s[idx,n)\\n// return : 次の場所\\nint rec(int idx , int depth){\\n int idx_ = idx;\\n if(depth == 0) return idx; // そのまま\\n if(idx >= n) return -1;\\n idx = rec(idx,depth-1); // 消費 A_n-1\\n if(idx == -1) return -1;\\n for(int i=0;i<m;i++){\\n while(idx < n and t[i] != s[idx]) idx++;\\n if(idx >= n) return -1;\\n // t[i] == s[idx]\\n idx++;\\n // s[idx,n)\\n idx = rec(idx,depth-1);\\n if(idx == -1) return -1;\\n }\\n //cout << idx_ << \\\" \\\" << depth << \\\" \\\" << idx << endl;\\n return idx;\\n}\\n\\nint main(){\\n cin >> s >> t;\\n n = s.size();\\n m = t.size();\\n\\n //cout << rec(0,3) << endl;\\n //return 0;\\n\\n int l,r;\\n l = 0;\\n r = n+1;\\n while(r-l>1){\\n int mid = (l+r)/2;\\n int ret = rec(0,mid);\\n //cout << mid << \\\" \\\" << ret << endl;\\n if(ret < 0){ // NG\\n r = mid;\\n }else{ // OK\\n l = mid;\\n }\\n }\\n cout << l << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6428,\n \"score_of_the_acc\": -0.1475,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3029_2751528\",\n \"code_snippet\": \"#define FOR(i,j,n) for (int i=(j);i<(n);i++)\\n#define REP(i,n) for (int i=0;i<(n);i++)\\n#define REPN(i,n) for (int i=(n);i>=0;i--)\\n#define I(n) scanf(\\\"%d\\\", &(n))\\n#define LL(n) scanf(\\\"%lld\\\", &(n))\\n#define pb(n) push_back((n))\\n#define mp(i,j) make_pair((i),(j))\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//------------------------------typedef集\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pi;\\ntypedef vector<pi> vpi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vpi> vvpi;\\ntypedef vector<vvi> vvvi;\\ntypedef long long ll;\\n\\nstring s,t;\\nint si,ti,cnt;\\n\\nint main(){\\n cnt = 1;\\n cin >> s;\\n cin >> t;\\n\\n int tsz = t.size();\\n int si;\\n while(1){\\n int ssz = s.size();\\n si = 0;\\n for(;si<ssz;si++){\\n if (s[si] == t[ti]){\\n ti++;\\n s.erase(s.begin()+si);\\n si--;\\n ssz--;\\n if (ti == tsz){\\n ti = 0;\\n cnt++;\\n break;\\n }\\n }\\n }\\n if (si == ssz) break;\\n }\\n\\n int ans = 0;\\n while (cnt){\\n ans++;\\n cnt /= 2;\\n }\\n cout << ans-1 << endl;\\n}\",\n \"accuracy\": 0.29545454545454547,\n \"time_ms\": 10,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": 0,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3029_2751457\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <cstdio>\\n#include <cmath>\\n#include <vector>\\n#include <cstring>\\n#include <string>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <assert.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<n; ++i)\\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\\n#define ALL(c) (c).begin(), (c).end()\\n\\ntypedef long long ll;\\ntypedef vector<int> VI;\\ntypedef vector<ll> VL;\\ntypedef vector<VI> VVI;\\ntypedef vector<VL> VVL;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nint in() { int x; scanf(\\\"%d\\\", &x); return x; }\\nll lin() { ll x; scanf(\\\"%lld\\\", &x); return x; }\\n\\nstring s, t;\\nint n, m, i;\\nbool ok;\\n\\nvoid check(int d, int k){\\n if (d == k - 1){\\n int j = 0;\\n while (i < n){\\n if (s[i] == t[j]){\\n j++;\\n }\\n i++;\\n if (j == m) break;\\n }\\n if (j < m) ok = false;\\n }else{\\n int j = 0;\\n check(d + 1, k);\\n while (i < n){\\n if (s[i] == t[j]){\\n i++;\\n j++;\\n check(d + 1, k);\\n if (j == m) break;\\n }else{\\n i++;\\n }\\n }\\n if (j < m) ok = false;\\n }\\n}\\n\\nint main() {\\n cin >> s >> t;\\n\\n n = s.length(), m = t.length();\\n\\n int ans = 0;\\n FOR(k,1,20){\\n // cout << \\\"check \\\" << k << endl;\\n ok = true;\\n i = 0;\\n check(0, k);\\n\\n if (ok) ans = k;\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.0043,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3029_2751415\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define DBG cerr << '!' << endl;\\n#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)\\n#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)\\n#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))\\n#define PB push_back\\n#define MP make_pair\\n#define FI first\\n#define SE second\\n#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}\\n#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}\\n#define ALL(v) v.begin(),v.end()\\n#define Decimal fixed<<setprecision(10)\\n#define INF 1000000000\\n#define MOD 1000000007\\n\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\n\\nstring S;\\nstring T;\\nint place;\\n\\nbool dfs(int depth){\\n\\tif(depth <= 0)return true;\\n\\tif(!dfs(depth-1))return false;\\n\\tREP(i,T.size()){\\n\\t\\twhile(S[place] != T[i])\\n\\t\\t{\\n\\t\\t\\t//cout << S[place];\\n\\t\\t\\tplace++;\\n\\t\\t\\tif(place >= S.size())return false;\\n\\t\\t}\\n\\t\\t//cout << depth;\\n\\t\\tplace++;\\n\\t\\tif(depth>1 && place >= S.size())return false;\\n\\t\\tif(!dfs(depth-1))return false;\\n\\t}\\t\\n\\t\\n\\treturn true;\\n}\\n\\nint main()\\n{\\n\\tcin >> S >> T;\\n\\t//cout << S.size() << endl;\\n\\t//cout << T.size() << endl;\\n\\tint ans = 0;\\n\\twhile(1){\\n\\t\\t//cout << endl;\\n\\t\\tplace = 0;\\n\\t\\tif(dfs(ans))ans++;\\n\\t\\telse break;\\n\\t}\\n\\t//cout << endl;\\n\\tcout << ans-1 << endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.0022,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3029_2751182\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nstring s,t;\\nint sa[100010],ta[100010];\\nint n,m;\\nint nxt[100010][52];\\nstring b[20];\\nvector<int> ba[20];\\n\\nint main(){\\n cin>>s>>t;\\n n=s.size();\\n m=t.size();\\n rep(i,n){\\n if(s[i]>='A'&&s[i]<='Z')sa[i]=s[i]-'A';\\n else sa[i]=s[i]-'a'+26;\\n }\\n rep(i,n){\\n if(t[i]>='A'&&t[i]<='Z')ta[i]=t[i]-'A';\\n else ta[i]=t[i]-'a'+26;\\n }\\n b[0]=t;\\n rep(i,b[0].size()){\\n if(b[0][i]>='A'&&b[0][i]<='Z')ba[0].push_back(b[0][i]-'A');\\n else ba[0].push_back(b[0][i]-'a'+26);\\n }\\n repl(i,1,20){\\n if(m*b[i-1].size()>n)break;\\n rep(j,m){\\n b[i]+=b[i-1];\\n b[i]+=t[j];\\n }\\n b[i]+=b[i-1];\\n rep(j,b[i].size()){\\n if(b[i][j]>='A'&&b[i][j]<='Z')ba[i].push_back(b[i][j]-'A');\\n else ba[i].push_back(b[i][j]-'a'+26);\\n }\\n }\\n memset(nxt,-1,sizeof(nxt));\\n for(int i=n-1;i>=0;i--){\\n for(int j=0;j<52;j++){\\n if(sa[i]==j)nxt[i][j]=i+1;\\n else nxt[i][j]=nxt[i+1][j];\\n }\\n }\\n rep(i,20){\\n int crt=0;\\n if(ba[i].size()==0){\\n cout<<i<<endl;\\n return 0;\\n }\\n rep(j,ba[i].size()){\\n int nxti=nxt[crt][ba[i][j]];\\n if(nxti<0){\\n cout<<i<<endl;\\n return 0;\\n }\\n crt=nxti;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 24848,\n \"score_of_the_acc\": -1,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3029_2751068\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nstring s, t;\\nbool ok;\\nvoid f(int depth, string &ret) {\\n\\tif (depth == 0)return;\\n\\tf(depth - 1, ret);\\n\\tfor (auto &it : t) {\\n\\t\\tret += it;\\n\\t\\tif (ret.size() > s.size()) {\\n\\t\\t\\tok = false;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tf(depth - 1,ret);\\n\\t}\\n}\\nstring g(int depth) {\\n\\tok = true;\\n\\tstring ret = \\\"\\\";\\n\\tf(depth, ret);\\n\\tif(ok)return ret;\\n\\telse return \\\"\\\";\\n}\\nbool check(string x) {\\n\\tif (x.size() == 0)return false;\\n\\tint n = s.size();\\n\\tint m = x.size();\\n\\tint j = 0;\\n\\tfor (int i : range(n)) {\\n\\t\\tif (s[i] == x[j])j++;\\n\\t\\tif (j == m)return true;\\n\\t}\\n\\treturn false;\\n}\\nint main() {\\n\\twhile (cin >> s >> t) {\\n\\t\\tint ub = s.size() + 1;\\n\\t\\tint lb = 0;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\tstring x = g(mid);\\n\\t\\t\\t(check(x) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\tcout << lb << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6576,\n \"score_of_the_acc\": -1.1544,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3029_2744711\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstring s, t;\\nint n, m;\\n\\nstring u;\\n\\nbool build() {\\n string tmp = u;\\n for(int i = 0; i < m; ++i) {\\n u += t[i]+tmp;\\n if(u.size() > s.size()) return false;\\n }\\n return true;\\n}\\n\\nint main() {\\n cin >> s >> t;\\n n = s.size();\\n m = t.size();\\n u = \\\"\\\";\\n for(int i = 0; i < 20; ++i) {\\n int k = 0;\\n for(int j = 0; j < n && k < (int)u.size(); ++j) {\\n if(s[j] == u[k]) ++k;\\n }\\n if(k != (int)u.size()) {\\n cout << i-1 << endl;\\n return 0;\\n }\\n if(!build()) {\\n cout << i << endl;\\n return 0;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.0161,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3029_2744298\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\nostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\nistream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}\\nvoid prArr(auto a,string s=\\\" \\\"){int i=0;for(auto t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\nstring s,t;\\n\\nstring dfs(int dep){\\n if(dep == 1) return t;\\n string u = dfs(dep-1);\\n if(u == \\\"$\\\") return \\\"$\\\";\\n string res = u;\\n for(char ch:t) {\\n if(res.size() > s.size()) return \\\"$\\\";\\n res += ch, res += u;\\n }\\n return res; \\n}\\n\\nbool check(const string &u){\\n int idx = 0;\\n for(char ch:s)\\n if(idx < (int)u.size() && u[idx] == ch) idx++;\\n return idx == (int)u.size();\\n}\\n\\nsigned main(){\\n cin>>s>>t;\\n \\n int ans = 0;\\n for(int i=1;i<=20;i++){\\n string u = dfs(i);\\n if(check(u)) ans = i;\\n }\\n cout<<ans<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.0126,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1876,"cells":{"group_id":{"kind":"string","value":"aoj_3028_cpp"},"problem_description":{"kind":"string","value":"Problem C: Ball\nProblem\n$N$個のボールがあり、各ボールには色と価値が決められている。\nボールの色は$1$から$C$まで$C$種類存在し、各色ごとに選べるボールの数の上限が決められている。\nボールを全体で高々$M$個選ぶとき、得られる価値の合計を最大化せよ。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$ $C$\n$l_1$ $l_2$ ... $l_C$\n$c_1$ $w_1$\n$c_2$ $w_2$\n...\n$c_N$ $w_N$\n入力はすべて整数で与えられる。\n1行目に$N$, $M$, $C$が空白区切りで与えられる。\n2行目に色$i$の選べるボールの数の上限$l_i$($1 \\leq i \\leq C$)が空白区切りで与えられる。\n3行目以降の$N$行にボール$i$の色$c_i$と価値$w_i$($1 \\leq i \\leq N$)が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq M \\leq N \\leq 10^5 $\n$1 \\leq C \\leq 10^5 $\n$0 \\leq l_i \\leq N $\n$1 \\leq c_i \\leq C $\n$1 \\leq w_i \\leq 1000 $\nOutput\n得られる価値の最大値を1行に出力せよ。\nSample Input 1\n3 3 2\n1 1\n1 1\n1 100\n2 10\nSample Output 1\n110\n2番目と3番目のボールを選ぶのが最適である。\nSample Input 2\n3 3 3\n1 0 1\n1 1\n2 100\n3 1\nSample Output 2\n2\nある色のボールが一個も選べない場合もある。\nSample Input 3\n22 7 26\n11 14 15 3 11 7 16 17 1 4 2 19 4 14 16 16 3 13 17 12 7 11 2 20 12 22\n6 10\n1 3\n13 1\n16 5\n4 1\n20 7\n18 4\n26 6\n9 1\n12 2\n21 1\n21 7\n18 1\n14 5\n24 5\n6 1\n3 1\n2 5\n21 2\n7 6\n10 9\n15 7\nSample Output 3\n52"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3028_10342652","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n, m, c;\n cin >> n >> m >> c;\n vector<ll> l(c);\n rep(i, 0, c)\n {\n cin >> l[i];\n }\n vector<vector<ll>> g(c);\n rep(i, 0, n)\n {\n ll x, y;\n cin >> x >> y;\n x--;\n g[x].push_back(y);\n }\n rep(i, 0, c)\n {\n srt(g[i]);\n rev(g[i]);\n }\n vector<ll> ar;\n rep(i, 0, c)\n {\n rep(j, 0, min((ll)g[i].size(), l[i]))\n {\n ar.push_back(g[i][j]);\n }\n }\n srt(ar);\n rev(ar);\n ll ans = 0;\n rep(i, 0, min((ll)ar.size(), m))\n {\n ans += ar[i];\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":9456,"score_of_the_acc":-0.5949,"final_rank":16},{"submission_id":"aoj_3028_9632657","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\nusing Pi = pair<int, int>;\n\nint main() {\n int N, M, C;\n cin >> N >> M >> C;\n vector<int> l(C);\n vector<Pi> cw(N);\n for (int i = 0; i < C; ++i) cin >> l[i];\n for (int i = 0; i < N; ++i) cin >> cw[i].second >> cw[i].first;\n\n std::sort(cw.begin(), cw.end(), std::greater<Pi>());\n\n int cnt = 0, ans = 0;\n for (int i = 0; i < N; ++i) {\n if (l[cw[i].second - 1] > 0) {\n --l[cw[i].second - 1];\n ans += cw[i].first;\n ++cnt;\n }\n if (cnt >= M) break;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":4180,"score_of_the_acc":-0.3808,"final_rank":10},{"submission_id":"aoj_3028_9515835","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\ngreedy\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_C = 100000;\nstatic int NUM[MAX_C]; // limit of each color\n\n//------------------------------------------------------------------------------\nstruct Ball\n{\n int v;\n int c;\n\n Ball(): c(-1), v(0) {}\n Ball(int color, int value): c(color), v(value) {}\n bool operator<(const Ball& other) const { return v > other.v; }\n void debug() const { printf(\"c=%d, v=%d\\n\", c, v); }\n};\n\ntypedef vector<Ball> Balls;\n//------------------------------------------------------------------------------\nint solve(int N, Balls& B, int M, int C)\n{\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n sort(B.begin(), B.end());\n //--------------------------------------------------------------------------\n // compute:\n int res = 0; \n for (Ball b: B)\n {\n if (M == 0) break;\n if (!NUM[b.c]) continue;\n NUM[b.c]--;\n res += b.v;\n M--;\n }\n //--------------------------------------------------------------------------\n // report:\n //printf(\"%d\\n\", res);\n return res;\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, M, C, color, value, num;\n num = scanf(\"%d %d %d \", &N, &M, &C);\n for (int i=0; i<C; ++i) num = scanf(\"%d \", &NUM[i]);\n Balls B(N);\n for (int i=0; i<N; ++i)\n {\n num = scanf(\"%d %d \", &color, &value);\n color--;\n B[i] = Ball(color, value);\n }\n int res = solve(N, B, M, C);\n printf(\"%d\\n\", res);\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":10,"memory_kb":4256,"score_of_the_acc":-0.0143,"final_rank":2},{"submission_id":"aoj_3028_7190861","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (a == 0)return b;\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\nvvll DP(1001,vll(1001,-1));\n\nll dfs(ll N,ll M){\n if(DP[N][M]!=-1)return DP[N][M];\n if(N==0&&M==0)return 0;\n ll res=1e18;\n rep(i,4){\n rep(j,4){\n if(i+j==0||i+j>3)continue;\n if(i>N||j>M)continue;\n chmin(res,dfs(N-i,M-j+i)+1);\n }\n }\n DP[N][M]=res;\n return res;\n}\n\n\nint main() {\n\n\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N,M,C;\n cin>>N>>M>>C;\n vll P(C);\n rep(i,C)cin>>P[i];\n vector<pair<ll,ll>> Q(N);\n rep(i,N){\n cin>>Q[i].second>>Q[i].first;\n Q[i].second--;\n }\n sort(all(Q));\n reverse(all(Q));\n ll an=0;\n rep(i,N){\n if(M>0&&P[Q[i].second]>0){\n an+=Q[i].first;\n M--;\n P[Q[i].second]--;\n }\n }\n cout<<an<<endl;\n\n \n\n\n}","accuracy":1,"time_ms":20,"memory_kb":13084,"score_of_the_acc":-1.125,"final_rank":20},{"submission_id":"aoj_3028_5883565","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main()\n{\n int N,M,C;\n cin>>N>>M>>C;\n int l[C];\n vector<P> ball;\n rep(i,C) cin>>l[i];\n rep(i,N){\n P b;\n cin>>b.second>>b.first;\n ball.push_back(b);\n }\n sort(ball.begin(),ball.end());\n ll ans=0;\n int num=0,now=ball.size();\n for(int i=N-1;i>=0;i--){\n if(!l[ball[i].second-1]) continue;\n ans+=ball[i].first;\n l[ball[i].second-1]--;\n M--;\n if(!M) break;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":40,"memory_kb":4380,"score_of_the_acc":-0.4031,"final_rank":11},{"submission_id":"aoj_3028_5460314","code_snippet":"#include <bits/stdc++.h>\n#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))\n#define precision(d) fixed << setprecision(d)\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nstruct Ball {\n int color, weight;\n // Ball(int c, int w) : color{c}, weight{w} {}\n // compare operator\n bool operator<(const Ball& other) const { return weight > other.weight; }\n};\n\nint main() {\n FastIO;\n\n // ready\n int n, m, c;\n cin >> n >> m >> c;\n\n vector<int> colors(c + 1);\n for (int i = 1; i <= c; i++) {\n int color;\n cin >> color;\n colors[i] = color;\n }\n\n vector<Ball> balls(n);\n for (int i = 0; i < n; i++) {\n int c, w;\n cin >> c >> w;\n balls[i].color = c;\n balls[i].weight = w;\n }\n\n sort(balls.begin(), balls.end());\n\n // checking answer\n int ans = 0;\n for (int i = 0; i < n; i++) {\n if (colors[balls[i].color] > 0) {\n colors[balls[i].color]--;\n ans += balls[i].weight;\n m--;\n }\n if (m == 0) break;\n }\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":4132,"score_of_the_acc":-0.0004,"final_rank":1},{"submission_id":"aoj_3028_5460301","code_snippet":"#include <bits/stdc++.h>\n#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))\n#define precision(d) fixed << setprecision(d)\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nstruct Ball {\n int color, weight;\n Ball(int c, int w) : color{c}, weight{w} {}\n // compare operator\n bool operator<(const Ball& other) const { return weight > other.weight; }\n};\n\nint main() {\n FastIO;\n\n // ready\n int n, m, c;\n cin >> n >> m >> c;\n\n map<int, int> colors;\n for (int i = 1; i <= c; i++) {\n int color;\n cin >> color;\n colors[i] = color;\n }\n\n vector<Ball> balls;\n for (int i = 0; i < n; i++) {\n int c, w;\n cin >> c >> w;\n balls.emplace_back(Ball(c, w));\n }\n\n sort(balls.begin(), balls.end());\n\n // checking answer\n int ans = 0;\n while (m != 0) {\n for (const auto ball : balls) {\n // found ball\n if (colors.find(ball.color) != colors.end()) {\n if (colors[ball.color] > 0) {\n ans += ball.weight;\n colors[ball.color]--;\n m--;\n }\n }\n if (m == 0) break;\n }\n break;\n }\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":50,"memory_kb":8620,"score_of_the_acc":-1.0016,"final_rank":18},{"submission_id":"aoj_3028_5092674","code_snippet":"#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tauto N=in(),M=in(),C=in();\n\tvll L=vecin(C);\n\tvector<pair<ll,ll>> P(N);\n\tREP(i,N){\n\t\tP[i].first=in();\n\t\tP[i].second=in();\n\t}\n\tsort(ALL(P),PAIRCOMP(second,>));\n\n\tll S=0;\n\tREP(i,N){\n\t\tif(L[P[i].first-1]>0){\n\t\t\tL[P[i].first-1]--;\n\t\t\tS += P[i].second;\n\t\t\tM--;\n\t\t}\n\t\tif(!M) break;\n\t}\n\tout(S);\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5452,"score_of_the_acc":-0.1478,"final_rank":8},{"submission_id":"aoj_3028_4995080","code_snippet":"#include<bits//stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define req(i,n) for(int i = 1;i <= n; i++)\n#define rrep(i,n) for(ll i = n-1;i >= 0;i--)\n#define ALL(obj) begin(obj), end(obj)\n#define RALL(a) rbegin(a),rend(a)\ntypedef long long int ll;\ntypedef long double ld;\nconst int MAX = 510000;\nconst ll MOD = 1000000007;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconst ll INF = 1e18;\nint main(){\n int n,m,c;cin>>n>>m>>c;\n vector<int> l(c),now(c,0);\n rep(i,c) cin >>l[i];\n priority_queue<pair<int,int>> pq;\n int C,w;\n rep(i,n){\n cin >> C>>w;pq.push({w,C-1});\n }ll sum = 0,cnt = 0;\n for(;;){\n if(cnt==m||pq.empty())break;\n pair<int,int> p = pq.top();\n pq.pop();\n if(now[p.second] < l[p.second]){\n sum += p.first;now[p.second]++;\n cnt++;\n }\n }cout << sum <<endl;\n}","accuracy":1,"time_ms":50,"memory_kb":4524,"score_of_the_acc":-0.5442,"final_rank":14},{"submission_id":"aoj_3028_4944557","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-3, PI = acos(-1);\n//ここから編集\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n int N, M, C; cin >> N >> M >> C;\n\n vector<int> l(C);\n REP(i,C) cin >> l[i];\n\n priority_queue<pair<int, int>> pq;\n int ans = 0;\n REP(i,N){\n int c, w; cin >> c >> w;\n c--;\n pq.push({w, c});\n }\n int cnt = 0;\n while(pq.size()){\n if(cnt >= M) break;\n if(l[pq.top().second] == 0){\n pq.pop();\n continue;\n }\n\n ans += pq.top().first;\n cnt++;\n l[pq.top().second]--;\n pq.pop();\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4128,"score_of_the_acc":-0.125,"final_rank":4},{"submission_id":"aoj_3028_4242212","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<cstdio>\n#include<cmath>\n#include<deque>\n#include<numeric>\n#include<queue>\n#include<stack>\n#include<cstring>\n#include<limits>\n#include<functional>\n#include<unordered_set>\n#include<iomanip>\n#include<cassert>\n#include<regex>\n#include<bitset>\n#include<complex>\n#include<chrono>\n#include<random>\n#define rep(i,a) for(int i=(int)0;i<(int)a;++i)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(),x.end()\nusing ll=long long;\nconstexpr ll mod = 1e9 + 7;\nconstexpr ll INF = 1LL << 60;\n\nll gcd(ll n, ll m) {\n\tll tmp;\n\twhile (m!=0) {\n\t\ttmp = n % m;\n\t\tn = m;\n\t\tm = tmp;\n\t}\n\treturn n;\n}\n\nll lcm(ll n, ll m) {\n\treturn abs(n * m) / gcd(n, m);//gl=xy\n}\n \ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n \nusing namespace std;\n\nusing P=pair<ll,ll>;\nvoid solve(){\n ll n,m,c;\n cin>>n>>m>>c;\n vector<ll>l(c);\n rep(i,c)cin>>l[i];\n vector<P>p(n);\n priority_queue<P>pq;\n rep(i,n){\n cin>>p[i].second>>p[i].first;\n p[i].second--;\n pq.emplace(p[i]);\n }\n ll ans=0;\n int cnt=0;\n while(!pq.empty()){\n auto x=pq.top();\n pq.pop();\n if(l[x.second]>0){\n ans+=x.first;\n ++cnt;\n l[x.second]--;\n }\n if(cnt>=m)break;\n }\n cout<<ans<<endl;\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n cin.tie(0);\n\tcout<<fixed<<setprecision(15);\n solve();\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7140,"score_of_the_acc":-0.4613,"final_rank":12},{"submission_id":"aoj_3028_4241498","code_snippet":"#pragma GCC optimize (\"Ofast\")\n#pragma GCC target (\"avx\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<queue>\n#include<cmath>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<random>\n#include<functional>\n#include<algorithm>\n#include<stack>\n#include<cstdio>\n#include<cstring>\n#include<bitset>\n#include<unordered_map>\n#include<climits>\n#include<fstream>\n#include<complex>\n#include<time.h>\n#include<cassert>\n#include<functional>\n#include<numeric>\n#include<tuple>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n#define int long long\n#define all(a) (a).begin(),(a).end()\n#define fs first\n#define sc second\n#define xx first\n#define yy second.first\n#define zz second.second\n#define H pair<int, int>\n#define P pair<int, pair<int, int>>\n#define Q(i,j,k) mkp(i,mkp(j,k))\n#define R pair<pair<int, int>, pair<int, int>>\n#define S(i,j,k,l) mkp(mkp(i,j),mkp(k,l))\n#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)\n#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)\n#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)\n#define range(i,v) for(auto& (i) : v)\n#define mkp make_pair\n#define mem(x,k) memset(x,k,sizeof(x))\n#define vec vector\n#define pb emplace_back\n#define lb lower_bound\n#define ub upper_bound\n#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())\n#define getidx(b,i) lower_bound(all(b),(i))-b.begin()\n#define ssp(i,n) (i==n-1?\"\\n\":\" \")\n#define ctoi(c) (int)(c-'0')\n#define itoc(c) (char)(c+'0')\n#define itn int\n#define pri_que priority_queue\n#define pp(x,y) pb(H{x,y})\n#define ppp(x,y,z) pb(Q(x,y,z))\n#define pppp(x,y,z,w) pb(S(x,y,z,w))\n#define cyes cout<<\"Yes\\n\"\n#define cno cout<<\"No\\n\"\n#define endl \"\\n\"\nconstexpr int mod = 1e9 + 7;\nconstexpr int Mod = 998244353;\nconstexpr ll inf = 3 * 1e18;\nconstexpr int Inf = 15 * 1e8;\nconst vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\nll read() { ll u, k = scanf(\"%lld\", &u); return u; }\nstring reads() { string s; cin >> s; return s; }\nH readh(bool g = 0) { H u; ll k = scanf(\"%lld %lld\", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }\nvoid printh(H t) { printf(\"%lld %lld\\n\", t.fs, t.sc); }\nbool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\nll mod_pow(ll x, ll n, ll p = mod) {\n\tll res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * x % p;\n\t\tx = x * x % p;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}//x^n%p\nll bitcount(ll x) {\n\tint sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;\n\treturn sum;\n}\n/*constexpr int fn_ = 1000005;\nll fact_[fn_], comp_[fn_];\nll comb(ll x, ll y, ll Mod = mod) {\n\tif (!fact_[0]) {\n\t\tfact_[0] = 1; comp_[0] = 1;\n\t\tfor (int i = 1; i < fn_; i++) \n\t\t\tfact_[i] = fact_[i - 1] * i % Mod;\n\t\tcomp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);\n\t\tfor (int i = fn_ - 2; i > 0; i--)\n\t\t\tcomp_[i] = comp_[i + 1] * (i + 1) % Mod;\n\t}\n\tif (x < y) return 0;\n\treturn fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;\n}*/\n//--------------------------------------------------------------\n\nsigned main() {\n\tint n, m, c;\n\tcin >> n >> m >> c;\n\tvec<int>l; rep(i, c) l.pb(read());\n\tvec<H>v; rep(i, n) v.pp(read(), read());\n\tfor_each(all(v), [](H& i) {i.fs--; });\n\tsort(all(v), [](H& i, H& j) {return i.sc > j.sc; });\n\tint ans = 0;\n\tfor (int i = 0; i < n && m>0; i++) {\n\t\tif (l[v[i].fs]) {\n\t\t\tl[v[i].fs]--;\n\t\t\tans += v[i].sc;\n\t\t\tm--;\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5728,"score_of_the_acc":-0.3037,"final_rank":9},{"submission_id":"aoj_3028_4241485","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = long long;\n\nint main()\n{\n i64 N, M, C;\n cin >> N >> M >> C;\n vector<i64> l(C);\n for (i64 i = 0; i < C; i++)\n cin >> l[i];\n vector<pair<i64, i64>> b(N);\n for (i64 i = 0; i < N; i++)\n {\n cin >> b[i].second >> b[i].first;\n b[i].second--;\n }\n sort(b.rbegin(), b.rend());\n i64 ans = 0, cnt = 0;\n for (pair<i64, i64> i : b)\n {\n if (0 < l[i.second])\n {\n ans += i.first;\n l[i.second]--;\n cnt++;\n }\n if (M <= cnt)\n break;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4868,"score_of_the_acc":-0.5826,"final_rank":15},{"submission_id":"aoj_3028_4238539","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n#define all(a) (a).begin(),(a).end()\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n,m,c;\n cin >> n >> m >> c;\n vector<pair<int,int>> lim(c);\n vector<pair<int,int>> valc(n);\n for(int i = 0; i < c; i++){\n int x;\n cin >> x;\n lim[i] = {x,0};\n }\n for(int i = 0; i < n; i++){\n int col,val;\n cin >> col >> val;\n col--;\n valc[i] = {val,col};\n }\n sort(all(valc));\n reverse(all(valc));\n \n int cnt = 0;\n int ans = 0;\n int i = 0;\n while(cnt < m && i < n){\n pair<int,int> p;\n p = valc[i];\n if(lim[p.second].second < lim[p.second].first){\n ans += p.first;\n cnt++;\n lim[p.second].second++;\n }\n i++;\n }\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":4212,"score_of_the_acc":-0.1344,"final_rank":5},{"submission_id":"aoj_3028_4238538","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n#define all(a) (a).begin(),(a).end()\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n,m,c;\n cin >> n >> m >> c;\n vector<pair<int,int>> lim(c);\n vector<pair<int,int>> valc(n);\n for(int i = 0; i < c; i++){\n int x;\n cin >> x;\n lim[i] = {x,0};\n }\n for(int i = 0; i < n; i++){\n int col,val;\n cin >> col >> val;\n col--;\n valc[i] = {val,col};\n }\n sort(all(valc));\n reverse(all(valc));\n \n int cnt = 0;\n int ans = 0;\n int i = 0;\n while(cnt < m && i < n){\n pair<int,int> p;\n p = valc[i];\n if(lim[p.second].second < lim[p.second].first){\n ans += p.first;\n cnt++;\n lim[p.second].second++;\n }\n i++;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4228,"score_of_the_acc":-0.1362,"final_rank":6},{"submission_id":"aoj_3028_4235005","code_snippet":"/* _/ _/ _/_/_/ _/\n _/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/\n _/ _/ _/ _/ _/ _/ _/_/_/ _/\n _/ _/ _/ _/ _/ _/ _/ _/ _/\n _/_/ _/_/ _/_/ _/_/ _/_/ _/ */\n#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<iomanip>\n#include<set>\n#include<map>\n#include<queue>\n#include<vector>\nusing namespace std;\nusing ll=long long;\nconst int MOD=1e9+7;\nconst double pi=3.14159265358979323846;\nconst int inf=2e9;\nconst ll INF=1e18;\nusing P=pair<int,int>;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nint main() {\n cin.tie(0),cout.tie(0);\n ios::sync_with_stdio(false);\n ll n,m,c,l[100005]={},ans=0;\n P p[100005]={};\n cin >> n >> m >> c;\n for(int i=0; i<c; i++) {\n cin >> l[i];\n }\n for(int i=0; i<n; i++) {\n cin >> p[i].second >> p[i].first;\n }\n sort(p,p+n,greater<P>());\n for(auto a:p) {\n if(l[a.second-1]) {\n ans+=a.first;\n l[a.second-1]--;\n m--;\n if(m==0) {\n break;\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4784,"score_of_the_acc":-0.0732,"final_rank":3},{"submission_id":"aoj_3028_3888906","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3028.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_CN = 100000;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\n\n/* global variables */\n\nint ls[MAX_CN];\npii wcs[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m, cn;\n scanf(\"%d%d%d\", &n, &m, &cn);\n\n for (int i = 0; i < cn; i++) scanf(\"%d\", ls + i);\n\n for (int i = 0; i < n; i++) {\n int ci, wi;\n scanf(\"%d%d\", &ci, &wi);\n ci--;\n wcs[i] = pii(wi, ci);\n }\n sort(wcs, wcs + n);\n\n int sum = 0;\n for (int i = n - 1; i >= 0 && m > 0; i--) {\n int &wi = wcs[i].first, &ci = wcs[i].second;\n if (ls[ci] > 0) {\n sum += wi;\n ls[ci]--;\n m--;\n }\n }\n\n printf(\"%d\\n\", sum);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4308,"score_of_the_acc":-0.1451,"final_rank":7},{"submission_id":"aoj_3028_3762821","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <utility>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\n\nll ans;\nll n, m, c;\nll l[100005];\npll ball[100005];\n\nint main()\n{\n cin >> n >> m >> c;\n for (int i = 1; i <= c; i++) {\n cin >> l[i];\n }\n\n for (int i = 0; i < n; i++) {\n cin >> ball[i].second >> ball[i].first;\n }\n\n sort(ball, ball + n, greater<pll>());\n\n int cnt = 0;\n for (int i = 0; i < n; i++) {\n if (cnt >= m) break;\n \n if (l[ball[i].second] > 0 &&\n ans + ball[i].first > ans) {\n l[ball[i].second]--;\n cnt++;\n ans += ball[i].first;\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":5224,"score_of_the_acc":-1.1224,"final_rank":19},{"submission_id":"aoj_3028_3762760","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nint n, m, c;\nint l[100010];\n\nsigned main(){\n cin >> n >> m >> c;\n\n for(int i = 0;i < c;i++){\n cin >> l[i];\n }\n\n int c, w;\n\n priority_queue<pair<int, int> > que;\n\n for(int i = 0;i < n;i++){\n cin >> c >> w;\n c--;\n que.push(make_pair(w, c));\n }\n\n int ans = 0;\n\n while(!que.empty() && m > 0){\n if(l[que.top().second] > 0){\n l[que.top().second]--;\n m--;\n ans += que.top().first;\n }\n que.pop();\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":5576,"score_of_the_acc":-0.6617,"final_rank":17},{"submission_id":"aoj_3028_3544337","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n,m,c,p,ans;\nint l[123456];\npair<int,int> wc[123456];\nint main() {\n\tcin>>n>>m>>c;\n\tfor(int i=1;i<=c;i++)cin>>l[i];\n\tfor(int i=0;i<n;i++){\n\t\tcin>>wc[i].second>>wc[i].first;\n\t\twc[i].first=1000-wc[i].first;\n\t}\n\tsort(wc,wc+n);\n\tfor(int i=0;i<n&&p<m;i++){\n\t\tif(l[wc[i].second]){\n\t\t\tl[wc[i].second]--;p++;\n\t\t\tans+=1000-wc[i].first;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4172,"score_of_the_acc":-0.5049,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3028_10342652\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\\n#define Endl endl\\n#define all(a) a.begin(), a.end()\\n#define pr(i, j) make_pair(i, j)\\n#define isin(x, l, r) (l <= x && x < r)\\n#define chmin(a, b) a = min(a, b)\\n#define chmax(a, b) a = max(a, b)\\n#define srt(ar) sort(ar.begin(), ar.end())\\n#define rev(ar) reverse(ar.begin(), ar.end())\\n#define jge(f, s, t) cout << (f ? s : t) << endl\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define printar(ar) \\\\\\n do \\\\\\n { \\\\\\n for (auto dbg : ar) \\\\\\n { \\\\\\n cout << dbg << \\\" \\\"; \\\\\\n } \\\\\\n cout << endl; \\\\\\n } while (0)\\nconst ll inf = 1e18;\\nconst ld pi = 3.14159265358979;\\nconst ld eps = 1e-9;\\ntemplate <class T, ll n, ll idx = 0>\\nauto make_vec(const ll (&d)[n], const T &init) noexcept\\n{\\n if constexpr (idx < n)\\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else\\n return init;\\n}\\n\\ntemplate <class T, ll n>\\nauto make_vec(const ll (&d)[n]) noexcept\\n{\\n return make_vec(d, T{});\\n}\\n//////////////// 以下を貼る ////////////////\\ntemplate <class T>\\nsize_t HashCombine(const size_t seed, const T &v)\\n{\\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\\n}\\n/* pair用 */\\ntemplate <class T, class S>\\nstruct std::hash<std::pair<T, S>>\\n{\\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\\n {\\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\\n }\\n};\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n ll n, m, c;\\n cin >> n >> m >> c;\\n vector<ll> l(c);\\n rep(i, 0, c)\\n {\\n cin >> l[i];\\n }\\n vector<vector<ll>> g(c);\\n rep(i, 0, n)\\n {\\n ll x, y;\\n cin >> x >> y;\\n x--;\\n g[x].push_back(y);\\n }\\n rep(i, 0, c)\\n {\\n srt(g[i]);\\n rev(g[i]);\\n }\\n vector<ll> ar;\\n rep(i, 0, c)\\n {\\n rep(j, 0, min((ll)g[i].size(), l[i]))\\n {\\n ar.push_back(g[i][j]);\\n }\\n }\\n srt(ar);\\n rev(ar);\\n ll ans = 0;\\n rep(i, 0, min((ll)ar.size(), m))\\n {\\n ans += ar[i];\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9456,\n \"score_of_the_acc\": -0.5949,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3028_9632657\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\nusing Pi = pair<int, int>;\\n\\nint main() {\\n int N, M, C;\\n cin >> N >> M >> C;\\n vector<int> l(C);\\n vector<Pi> cw(N);\\n for (int i = 0; i < C; ++i) cin >> l[i];\\n for (int i = 0; i < N; ++i) cin >> cw[i].second >> cw[i].first;\\n\\n std::sort(cw.begin(), cw.end(), std::greater<Pi>());\\n\\n int cnt = 0, ans = 0;\\n for (int i = 0; i < N; ++i) {\\n if (l[cw[i].second - 1] > 0) {\\n --l[cw[i].second - 1];\\n ans += cw[i].first;\\n ++cnt;\\n }\\n if (cnt >= M) break;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4180,\n \"score_of_the_acc\": -0.3808,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3028_9515835\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\ngreedy\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_C = 100000;\\nstatic int NUM[MAX_C]; // limit of each color\\n\\n//------------------------------------------------------------------------------\\nstruct Ball\\n{\\n int v;\\n int c;\\n\\n Ball(): c(-1), v(0) {}\\n Ball(int color, int value): c(color), v(value) {}\\n bool operator<(const Ball& other) const { return v > other.v; }\\n void debug() const { printf(\\\"c=%d, v=%d\\\\n\\\", c, v); }\\n};\\n\\ntypedef vector<Ball> Balls;\\n//------------------------------------------------------------------------------\\nint solve(int N, Balls& B, int M, int C)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n sort(B.begin(), B.end());\\n //--------------------------------------------------------------------------\\n // compute:\\n int res = 0; \\n for (Ball b: B)\\n {\\n if (M == 0) break;\\n if (!NUM[b.c]) continue;\\n NUM[b.c]--;\\n res += b.v;\\n M--;\\n }\\n //--------------------------------------------------------------------------\\n // report:\\n //printf(\\\"%d\\\\n\\\", res);\\n return res;\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, M, C, color, value, num;\\n num = scanf(\\\"%d %d %d \\\", &N, &M, &C);\\n for (int i=0; i<C; ++i) num = scanf(\\\"%d \\\", &NUM[i]);\\n Balls B(N);\\n for (int i=0; i<N; ++i)\\n {\\n num = scanf(\\\"%d %d \\\", &color, &value);\\n color--;\\n B[i] = Ball(color, value);\\n }\\n int res = solve(N, B, M, C);\\n printf(\\\"%d\\\\n\\\", res);\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4256,\n \"score_of_the_acc\": -0.0143,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3028_7190861\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\n\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (a == 0)return b;\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\nll sqrtz(ll N) {\\n ll L = 0;\\n ll R = sqrt(N) + 10000;\\n while (abs(R - L) > 1) {\\n ll mid = (R + L) / 2;\\n if (mid * mid <= N)L = mid;\\n else R = mid;\\n }\\n return L;\\n\\n}\\nvvll DP(1001,vll(1001,-1));\\n\\nll dfs(ll N,ll M){\\n if(DP[N][M]!=-1)return DP[N][M];\\n if(N==0&&M==0)return 0;\\n ll res=1e18;\\n rep(i,4){\\n rep(j,4){\\n if(i+j==0||i+j>3)continue;\\n if(i>N||j>M)continue;\\n chmin(res,dfs(N-i,M-j+i)+1);\\n }\\n }\\n DP[N][M]=res;\\n return res;\\n}\\n\\n\\nint main() {\\n\\n\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n ll N,M,C;\\n cin>>N>>M>>C;\\n vll P(C);\\n rep(i,C)cin>>P[i];\\n vector<pair<ll,ll>> Q(N);\\n rep(i,N){\\n cin>>Q[i].second>>Q[i].first;\\n Q[i].second--;\\n }\\n sort(all(Q));\\n reverse(all(Q));\\n ll an=0;\\n rep(i,N){\\n if(M>0&&P[Q[i].second]>0){\\n an+=Q[i].first;\\n M--;\\n P[Q[i].second]--;\\n }\\n }\\n cout<<an<<endl;\\n\\n \\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 13084,\n \"score_of_the_acc\": -1.125,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3028_5883565\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<stack>\\n#include<set>\\n#include<bitset>\\n#include<vector>\\n#include<string>\\n#include <iomanip>\\n#include <deque>\\n#include<list>\\n#include<cmath>\\n#define rep(i,n) for(int i=0;i<(n);i++)\\nusing namespace std;\\nusing ll=long long;\\nusing P=pair<int,int>;\\nusing P_S=pair<int,string>;\\nusing P_D=pair<double,int>;\\nusing T=tuple<int,int,char,ll,string>;\\n\\nint main()\\n{\\n int N,M,C;\\n cin>>N>>M>>C;\\n int l[C];\\n vector<P> ball;\\n rep(i,C) cin>>l[i];\\n rep(i,N){\\n P b;\\n cin>>b.second>>b.first;\\n ball.push_back(b);\\n }\\n sort(ball.begin(),ball.end());\\n ll ans=0;\\n int num=0,now=ball.size();\\n for(int i=N-1;i>=0;i--){\\n if(!l[ball[i].second-1]) continue;\\n ans+=ball[i].first;\\n l[ball[i].second-1]--;\\n M--;\\n if(!M) break;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4380,\n \"score_of_the_acc\": -0.4031,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3028_5460314\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))\\n#define precision(d) fixed << setprecision(d)\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\nusing namespace std;\\n\\nstruct Ball {\\n int color, weight;\\n // Ball(int c, int w) : color{c}, weight{w} {}\\n // compare operator\\n bool operator<(const Ball& other) const { return weight > other.weight; }\\n};\\n\\nint main() {\\n FastIO;\\n\\n // ready\\n int n, m, c;\\n cin >> n >> m >> c;\\n\\n vector<int> colors(c + 1);\\n for (int i = 1; i <= c; i++) {\\n int color;\\n cin >> color;\\n colors[i] = color;\\n }\\n\\n vector<Ball> balls(n);\\n for (int i = 0; i < n; i++) {\\n int c, w;\\n cin >> c >> w;\\n balls[i].color = c;\\n balls[i].weight = w;\\n }\\n\\n sort(balls.begin(), balls.end());\\n\\n // checking answer\\n int ans = 0;\\n for (int i = 0; i < n; i++) {\\n if (colors[balls[i].color] > 0) {\\n colors[balls[i].color]--;\\n ans += balls[i].weight;\\n m--;\\n }\\n if (m == 0) break;\\n }\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4132,\n \"score_of_the_acc\": -0.0004,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3028_5460301\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define FastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))\\n#define precision(d) fixed << setprecision(d)\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\nusing namespace std;\\n\\nstruct Ball {\\n int color, weight;\\n Ball(int c, int w) : color{c}, weight{w} {}\\n // compare operator\\n bool operator<(const Ball& other) const { return weight > other.weight; }\\n};\\n\\nint main() {\\n FastIO;\\n\\n // ready\\n int n, m, c;\\n cin >> n >> m >> c;\\n\\n map<int, int> colors;\\n for (int i = 1; i <= c; i++) {\\n int color;\\n cin >> color;\\n colors[i] = color;\\n }\\n\\n vector<Ball> balls;\\n for (int i = 0; i < n; i++) {\\n int c, w;\\n cin >> c >> w;\\n balls.emplace_back(Ball(c, w));\\n }\\n\\n sort(balls.begin(), balls.end());\\n\\n // checking answer\\n int ans = 0;\\n while (m != 0) {\\n for (const auto ball : balls) {\\n // found ball\\n if (colors.find(ball.color) != colors.end()) {\\n if (colors[ball.color] > 0) {\\n ans += ball.weight;\\n colors[ball.color]--;\\n m--;\\n }\\n }\\n if (m == 0) break;\\n }\\n break;\\n }\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 8620,\n \"score_of_the_acc\": -1.0016,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3028_5092674\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#define REP(i,num) for(ll i=0;i<(num);++i)\\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\\n#define LOOP(i) while(i--)\\n#define ALL(c) c.begin(),c.end()\\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\\n\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\n\\nconstexpr ll atcoder_mod = 1e9+7;\\n\\ntemplate<typename T=ll>\\nT in(){ T x; cin >> x; return (x); }\\ntemplate<typename T=ll,typename C=vector<T>>\\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\\n\\nvoid vout(){ cout << endl; }\\ntemplate<typename Head,typename... Tail>\\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\\nvoid out(){ cout << endl; }\\ntemplate<typename Head,typename... Tail>\\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\\n\\ntemplate<typename T>\\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\\ntemplate<typename T>\\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(10);\\n\\n\\tauto N=in(),M=in(),C=in();\\n\\tvll L=vecin(C);\\n\\tvector<pair<ll,ll>> P(N);\\n\\tREP(i,N){\\n\\t\\tP[i].first=in();\\n\\t\\tP[i].second=in();\\n\\t}\\n\\tsort(ALL(P),PAIRCOMP(second,>));\\n\\n\\tll S=0;\\n\\tREP(i,N){\\n\\t\\tif(L[P[i].first-1]>0){\\n\\t\\t\\tL[P[i].first-1]--;\\n\\t\\t\\tS += P[i].second;\\n\\t\\t\\tM--;\\n\\t\\t}\\n\\t\\tif(!M) break;\\n\\t}\\n\\tout(S);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5452,\n \"score_of_the_acc\": -0.1478,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3028_4995080\",\n \"code_snippet\": \"#include<bits//stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define req(i,n) for(int i = 1;i <= n; i++)\\n#define rrep(i,n) for(ll i = n-1;i >= 0;i--)\\n#define ALL(obj) begin(obj), end(obj)\\n#define RALL(a) rbegin(a),rend(a)\\ntypedef long long int ll;\\ntypedef long double ld;\\nconst int MAX = 510000;\\nconst ll MOD = 1000000007;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\nconst ll INF = 1e18;\\nint main(){\\n int n,m,c;cin>>n>>m>>c;\\n vector<int> l(c),now(c,0);\\n rep(i,c) cin >>l[i];\\n priority_queue<pair<int,int>> pq;\\n int C,w;\\n rep(i,n){\\n cin >> C>>w;pq.push({w,C-1});\\n }ll sum = 0,cnt = 0;\\n for(;;){\\n if(cnt==m||pq.empty())break;\\n pair<int,int> p = pq.top();\\n pq.pop();\\n if(now[p.second] < l[p.second]){\\n sum += p.first;now[p.second]++;\\n cnt++;\\n }\\n }cout << sum <<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4524,\n \"score_of_the_acc\": -0.5442,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3028_4944557\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-3, PI = acos(-1);\\n//ここから編集\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n int N, M, C; cin >> N >> M >> C;\\n\\n vector<int> l(C);\\n REP(i,C) cin >> l[i];\\n\\n priority_queue<pair<int, int>> pq;\\n int ans = 0;\\n REP(i,N){\\n int c, w; cin >> c >> w;\\n c--;\\n pq.push({w, c});\\n }\\n int cnt = 0;\\n while(pq.size()){\\n if(cnt >= M) break;\\n if(l[pq.top().second] == 0){\\n pq.pop();\\n continue;\\n }\\n\\n ans += pq.top().first;\\n cnt++;\\n l[pq.top().second]--;\\n pq.pop();\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4128,\n \"score_of_the_acc\": -0.125,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3028_4242212\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<cstdio>\\n#include<cmath>\\n#include<deque>\\n#include<numeric>\\n#include<queue>\\n#include<stack>\\n#include<cstring>\\n#include<limits>\\n#include<functional>\\n#include<unordered_set>\\n#include<iomanip>\\n#include<cassert>\\n#include<regex>\\n#include<bitset>\\n#include<complex>\\n#include<chrono>\\n#include<random>\\n#define rep(i,a) for(int i=(int)0;i<(int)a;++i)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(),x.end()\\nusing ll=long long;\\nconstexpr ll mod = 1e9 + 7;\\nconstexpr ll INF = 1LL << 60;\\n\\nll gcd(ll n, ll m) {\\n\\tll tmp;\\n\\twhile (m!=0) {\\n\\t\\ttmp = n % m;\\n\\t\\tn = m;\\n\\t\\tm = tmp;\\n\\t}\\n\\treturn n;\\n}\\n\\nll lcm(ll n, ll m) {\\n\\treturn abs(n * m) / gcd(n, m);//gl=xy\\n}\\n \\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n \\nusing namespace std;\\n\\nusing P=pair<ll,ll>;\\nvoid solve(){\\n ll n,m,c;\\n cin>>n>>m>>c;\\n vector<ll>l(c);\\n rep(i,c)cin>>l[i];\\n vector<P>p(n);\\n priority_queue<P>pq;\\n rep(i,n){\\n cin>>p[i].second>>p[i].first;\\n p[i].second--;\\n pq.emplace(p[i]);\\n }\\n ll ans=0;\\n int cnt=0;\\n while(!pq.empty()){\\n auto x=pq.top();\\n pq.pop();\\n if(l[x.second]>0){\\n ans+=x.first;\\n ++cnt;\\n l[x.second]--;\\n }\\n if(cnt>=m)break;\\n }\\n cout<<ans<<endl;\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n cin.tie(0);\\n\\tcout<<fixed<<setprecision(15);\\n solve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7140,\n \"score_of_the_acc\": -0.4613,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3028_4241498\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"Ofast\\\")\\n#pragma GCC target (\\\"avx\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#define _USE_MATH_DEFINES\\n#include<iostream>\\n#include<string>\\n#include<queue>\\n#include<cmath>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<iomanip>\\n#include<vector>\\n#include<random>\\n#include<functional>\\n#include<algorithm>\\n#include<stack>\\n#include<cstdio>\\n#include<cstring>\\n#include<bitset>\\n#include<unordered_map>\\n#include<climits>\\n#include<fstream>\\n#include<complex>\\n#include<time.h>\\n#include<cassert>\\n#include<functional>\\n#include<numeric>\\n#include<tuple>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n#define int long long\\n#define all(a) (a).begin(),(a).end()\\n#define fs first\\n#define sc second\\n#define xx first\\n#define yy second.first\\n#define zz second.second\\n#define H pair<int, int>\\n#define P pair<int, pair<int, int>>\\n#define Q(i,j,k) mkp(i,mkp(j,k))\\n#define R pair<pair<int, int>, pair<int, int>>\\n#define S(i,j,k,l) mkp(mkp(i,j),mkp(k,l))\\n#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)\\n#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)\\n#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)\\n#define range(i,v) for(auto& (i) : v)\\n#define mkp make_pair\\n#define mem(x,k) memset(x,k,sizeof(x))\\n#define vec vector\\n#define pb emplace_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())\\n#define getidx(b,i) lower_bound(all(b),(i))-b.begin()\\n#define ssp(i,n) (i==n-1?\\\"\\\\n\\\":\\\" \\\")\\n#define ctoi(c) (int)(c-'0')\\n#define itoc(c) (char)(c+'0')\\n#define itn int\\n#define pri_que priority_queue\\n#define pp(x,y) pb(H{x,y})\\n#define ppp(x,y,z) pb(Q(x,y,z))\\n#define pppp(x,y,z,w) pb(S(x,y,z,w))\\n#define cyes cout<<\\\"Yes\\\\n\\\"\\n#define cno cout<<\\\"No\\\\n\\\"\\n#define endl \\\"\\\\n\\\"\\nconstexpr int mod = 1e9 + 7;\\nconstexpr int Mod = 998244353;\\nconstexpr ll inf = 3 * 1e18;\\nconstexpr int Inf = 15 * 1e8;\\nconst vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };\\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\\nll read() { ll u, k = scanf(\\\"%lld\\\", &u); return u; }\\nstring reads() { string s; cin >> s; return s; }\\nH readh(bool g = 0) { H u; ll k = scanf(\\\"%lld %lld\\\", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }\\nvoid printh(H t) { printf(\\\"%lld %lld\\\\n\\\", t.fs, t.sc); }\\nbool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\\nll mod_pow(ll x, ll n, ll p = mod) {\\n\\tll res = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) res = res * x % p;\\n\\t\\tx = x * x % p;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}//x^n%p\\nll bitcount(ll x) {\\n\\tint sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;\\n\\treturn sum;\\n}\\n/*constexpr int fn_ = 1000005;\\nll fact_[fn_], comp_[fn_];\\nll comb(ll x, ll y, ll Mod = mod) {\\n\\tif (!fact_[0]) {\\n\\t\\tfact_[0] = 1; comp_[0] = 1;\\n\\t\\tfor (int i = 1; i < fn_; i++) \\n\\t\\t\\tfact_[i] = fact_[i - 1] * i % Mod;\\n\\t\\tcomp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);\\n\\t\\tfor (int i = fn_ - 2; i > 0; i--)\\n\\t\\t\\tcomp_[i] = comp_[i + 1] * (i + 1) % Mod;\\n\\t}\\n\\tif (x < y) return 0;\\n\\treturn fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;\\n}*/\\n//--------------------------------------------------------------\\n\\nsigned main() {\\n\\tint n, m, c;\\n\\tcin >> n >> m >> c;\\n\\tvec<int>l; rep(i, c) l.pb(read());\\n\\tvec<H>v; rep(i, n) v.pp(read(), read());\\n\\tfor_each(all(v), [](H& i) {i.fs--; });\\n\\tsort(all(v), [](H& i, H& j) {return i.sc > j.sc; });\\n\\tint ans = 0;\\n\\tfor (int i = 0; i < n && m>0; i++) {\\n\\t\\tif (l[v[i].fs]) {\\n\\t\\t\\tl[v[i].fs]--;\\n\\t\\t\\tans += v[i].sc;\\n\\t\\t\\tm--;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5728,\n \"score_of_the_acc\": -0.3037,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3028_4241485\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = long long;\\n\\nint main()\\n{\\n i64 N, M, C;\\n cin >> N >> M >> C;\\n vector<i64> l(C);\\n for (i64 i = 0; i < C; i++)\\n cin >> l[i];\\n vector<pair<i64, i64>> b(N);\\n for (i64 i = 0; i < N; i++)\\n {\\n cin >> b[i].second >> b[i].first;\\n b[i].second--;\\n }\\n sort(b.rbegin(), b.rend());\\n i64 ans = 0, cnt = 0;\\n for (pair<i64, i64> i : b)\\n {\\n if (0 < l[i.second])\\n {\\n ans += i.first;\\n l[i.second]--;\\n cnt++;\\n }\\n if (M <= cnt)\\n break;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4868,\n \"score_of_the_acc\": -0.5826,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3028_4238539\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n#define all(a) (a).begin(),(a).end()\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n,m,c;\\n cin >> n >> m >> c;\\n vector<pair<int,int>> lim(c);\\n vector<pair<int,int>> valc(n);\\n for(int i = 0; i < c; i++){\\n int x;\\n cin >> x;\\n lim[i] = {x,0};\\n }\\n for(int i = 0; i < n; i++){\\n int col,val;\\n cin >> col >> val;\\n col--;\\n valc[i] = {val,col};\\n }\\n sort(all(valc));\\n reverse(all(valc));\\n \\n int cnt = 0;\\n int ans = 0;\\n int i = 0;\\n while(cnt < m && i < n){\\n pair<int,int> p;\\n p = valc[i];\\n if(lim[p.second].second < lim[p.second].first){\\n ans += p.first;\\n cnt++;\\n lim[p.second].second++;\\n }\\n i++;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4212,\n \"score_of_the_acc\": -0.1344,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3028_4238538\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n#define all(a) (a).begin(),(a).end()\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n,m,c;\\n cin >> n >> m >> c;\\n vector<pair<int,int>> lim(c);\\n vector<pair<int,int>> valc(n);\\n for(int i = 0; i < c; i++){\\n int x;\\n cin >> x;\\n lim[i] = {x,0};\\n }\\n for(int i = 0; i < n; i++){\\n int col,val;\\n cin >> col >> val;\\n col--;\\n valc[i] = {val,col};\\n }\\n sort(all(valc));\\n reverse(all(valc));\\n \\n int cnt = 0;\\n int ans = 0;\\n int i = 0;\\n while(cnt < m && i < n){\\n pair<int,int> p;\\n p = valc[i];\\n if(lim[p.second].second < lim[p.second].first){\\n ans += p.first;\\n cnt++;\\n lim[p.second].second++;\\n }\\n i++;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4228,\n \"score_of_the_acc\": -0.1362,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3028_4235005\",\n \"code_snippet\": \"/* _/ _/ _/_/_/ _/\\n _/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/\\n _/ _/ _/ _/ _/ _/ _/_/_/ _/\\n _/ _/ _/ _/ _/ _/ _/ _/ _/\\n _/_/ _/_/ _/_/ _/_/ _/_/ _/ */\\n#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\n#include<iomanip>\\n#include<set>\\n#include<map>\\n#include<queue>\\n#include<vector>\\nusing namespace std;\\nusing ll=long long;\\nconst int MOD=1e9+7;\\nconst double pi=3.14159265358979323846;\\nconst int inf=2e9;\\nconst ll INF=1e18;\\nusing P=pair<int,int>;\\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\nint main() {\\n cin.tie(0),cout.tie(0);\\n ios::sync_with_stdio(false);\\n ll n,m,c,l[100005]={},ans=0;\\n P p[100005]={};\\n cin >> n >> m >> c;\\n for(int i=0; i<c; i++) {\\n cin >> l[i];\\n }\\n for(int i=0; i<n; i++) {\\n cin >> p[i].second >> p[i].first;\\n }\\n sort(p,p+n,greater<P>());\\n for(auto a:p) {\\n if(l[a.second-1]) {\\n ans+=a.first;\\n l[a.second-1]--;\\n m--;\\n if(m==0) {\\n break;\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4784,\n \"score_of_the_acc\": -0.0732,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3028_3888906\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3028.cc: \\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_CN = 100000;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\n\\n/* global variables */\\n\\nint ls[MAX_CN];\\npii wcs[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m, cn;\\n scanf(\\\"%d%d%d\\\", &n, &m, &cn);\\n\\n for (int i = 0; i < cn; i++) scanf(\\\"%d\\\", ls + i);\\n\\n for (int i = 0; i < n; i++) {\\n int ci, wi;\\n scanf(\\\"%d%d\\\", &ci, &wi);\\n ci--;\\n wcs[i] = pii(wi, ci);\\n }\\n sort(wcs, wcs + n);\\n\\n int sum = 0;\\n for (int i = n - 1; i >= 0 && m > 0; i--) {\\n int &wi = wcs[i].first, &ci = wcs[i].second;\\n if (ls[ci] > 0) {\\n sum += wi;\\n ls[ci]--;\\n m--;\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", sum);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4308,\n \"score_of_the_acc\": -0.1451,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3028_3762821\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> pll;\\n\\nll ans;\\nll n, m, c;\\nll l[100005];\\npll ball[100005];\\n\\nint main()\\n{\\n cin >> n >> m >> c;\\n for (int i = 1; i <= c; i++) {\\n cin >> l[i];\\n }\\n\\n for (int i = 0; i < n; i++) {\\n cin >> ball[i].second >> ball[i].first;\\n }\\n\\n sort(ball, ball + n, greater<pll>());\\n\\n int cnt = 0;\\n for (int i = 0; i < n; i++) {\\n if (cnt >= m) break;\\n \\n if (l[ball[i].second] > 0 &&\\n ans + ball[i].first > ans) {\\n l[ball[i].second]--;\\n cnt++;\\n ans += ball[i].first;\\n }\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -1.1224,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3028_3762760\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nint n, m, c;\\nint l[100010];\\n\\nsigned main(){\\n cin >> n >> m >> c;\\n\\n for(int i = 0;i < c;i++){\\n cin >> l[i];\\n }\\n\\n int c, w;\\n\\n priority_queue<pair<int, int> > que;\\n\\n for(int i = 0;i < n;i++){\\n cin >> c >> w;\\n c--;\\n que.push(make_pair(w, c));\\n }\\n\\n int ans = 0;\\n\\n while(!que.empty() && m > 0){\\n if(l[que.top().second] > 0){\\n l[que.top().second]--;\\n m--;\\n ans += que.top().first;\\n }\\n que.pop();\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5576,\n \"score_of_the_acc\": -0.6617,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3028_3544337\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nint n,m,c,p,ans;\\nint l[123456];\\npair<int,int> wc[123456];\\nint main() {\\n\\tcin>>n>>m>>c;\\n\\tfor(int i=1;i<=c;i++)cin>>l[i];\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin>>wc[i].second>>wc[i].first;\\n\\t\\twc[i].first=1000-wc[i].first;\\n\\t}\\n\\tsort(wc,wc+n);\\n\\tfor(int i=0;i<n&&p<m;i++){\\n\\t\\tif(l[wc[i].second]){\\n\\t\\t\\tl[wc[i].second]--;p++;\\n\\t\\t\\tans+=1000-wc[i].first;\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4172,\n \"score_of_the_acc\": -0.5049,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1877,"cells":{"group_id":{"kind":"string","value":"aoj_3032_cpp"},"problem_description":{"kind":"string","value":"Problem G: Combine Two Elements\nProblem\n$N$個の非負整数のペア$(a_i, b_i)$と非負整数$A$, $B$ が与えられる。\n以下のいずれかの操作をできるだけたくさん行いたい。\n$|a_i - b_i| \\leq A$ または $B \\leq |a_i - b_i| \\leq 2A$を満たす要素$i$を取り出し、削除する\n$|(a_i + a_j) - (b_i + b_j)| \\leq A$ または $B \\leq |(a_i + a_j) - (b_i + b_j)| \\leq 2A$ を満たす要素$i$と要素$j$ ($i \\neq j$)の組を取り出し、削除する\n最大の操作回数を求めよ。\nInput\n入力は以下の形式で与えられる。\n$N$ $A$ $B$\n$a_1$ $b_1$\n$a_2$ $b_2$\n...\n$a_N$ $b_N$\n入力はすべて整数で与えられる。\n1行目に$N$,$A$,$B$が空白区切りで与えられる。\n2行目以降の$N$行に$i$個目のペア$a_i$と$b_i$($1 \\leq i \\leq N$)が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq N \\leq 800 $\n$0 \\leq A, B \\leq 10^5 $\n$0 \\leq a_i, b_i \\leq 10^5$\n$A \\leq B$ かつ $B \\leq 2A$\nOutput\n最大の操作回数を1行に出力せよ。\nSample Input 1\n5 3 5\n7 2\n13 1\n1 1\n2 9\n2 4\nSample Output 1\n4\n(7,2)を選んで削除する。\n(1,1)を選んで削除する。\n(2,4)を選んで削除する。\n(13, 1)と(2, 9)を選んで削除する。\n以上のように操作すると４回操作することができ、これが最大となる。\nSample Input 2\n10 7 12\n34 70\n36 0\n12 50\n76 46\n33 45\n61 21\n0 1\n24 3\n98 41\n23 84\nSample Output 2\n5"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3032_5853683","code_snippet":"// #include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <utility>\n#include <vector>\n\ntemplate <int M>\nstruct MInt {\n unsigned int val;\n MInt(): val(0) {}\n MInt(long long x) : val(x >= 0 ? x % M : x % M + M) {}\n static constexpr int get_mod() { return M; }\n static void set_mod(int divisor) { assert(divisor == M); }\n static void init(int x = 10000000) { inv(x, true); fact(x); fact_inv(x); }\n static MInt inv(int x, bool init = false) {\n // assert(0 <= x && x < M && std::__gcd(x, M) == 1);\n static std::vector<MInt> inverse{0, 1};\n int prev = inverse.size();\n if (init && x >= prev) {\n // \"x!\" and \"M\" must be disjoint.\n inverse.resize(x + 1);\n for (int i = prev; i <= x; ++i) inverse[i] = -inverse[M % i] * (M / i);\n }\n if (x < inverse.size()) return inverse[x];\n unsigned int a = x, b = M; int u = 1, v = 0;\n while (b) {\n unsigned int q = a / b;\n std::swap(a -= q * b, b);\n std::swap(u -= q * v, v);\n }\n return u;\n }\n static MInt fact(int x) {\n static std::vector<MInt> f{1};\n int prev = f.size();\n if (x >= prev) {\n f.resize(x + 1);\n for (int i = prev; i <= x; ++i) f[i] = f[i - 1] * i;\n }\n return f[x];\n }\n static MInt fact_inv(int x) {\n static std::vector<MInt> finv{1};\n int prev = finv.size();\n if (x >= prev) {\n finv.resize(x + 1);\n finv[x] = inv(fact(x).val);\n for (int i = x; i > prev; --i) finv[i - 1] = finv[i] * i;\n }\n return finv[x];\n }\n static MInt nCk(int n, int k) {\n if (n < 0 || n < k || k < 0) return 0;\n if (n - k > k) k = n - k;\n return fact(n) * fact_inv(k) * fact_inv(n - k);\n }\n static MInt nPk(int n, int k) { return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k); }\n static MInt nHk(int n, int k) { return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k)); }\n static MInt large_nCk(long long n, int k) {\n if (n < 0 || n < k || k < 0) return 0;\n inv(k, true);\n MInt res = 1;\n for (int i = 1; i <= k; ++i) res *= inv(i) * n--;\n return res;\n }\n MInt pow(long long exponent) const {\n MInt tmp = *this, res = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n MInt &operator+=(const MInt &x) { if((val += x.val) >= M) val -= M; return *this; }\n MInt &operator-=(const MInt &x) { if((val += M - x.val) >= M) val -= M; return *this; }\n MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % M; return *this; }\n MInt &operator/=(const MInt &x) { return *this *= inv(x.val); }\n bool operator==(const MInt &x) const { return val == x.val; }\n bool operator!=(const MInt &x) const { return val != x.val; }\n bool operator<(const MInt &x) const { return val < x.val; }\n bool operator<=(const MInt &x) const { return val <= x.val; }\n bool operator>(const MInt &x) const { return val > x.val; }\n bool operator>=(const MInt &x) const { return val >= x.val; }\n MInt &operator++() { if (++val == M) val = 0; return *this; }\n MInt operator++(int) { MInt res = *this; ++*this; return res; }\n MInt &operator--() { val = (val == 0 ? M : val) - 1; return *this; }\n MInt operator--(int) { MInt res = *this; --*this; return res; }\n MInt operator+() const { return *this; }\n MInt operator-() const { return MInt(val ? M - val : 0); }\n MInt operator+(const MInt &x) const { return MInt(*this) += x; }\n MInt operator-(const MInt &x) const { return MInt(*this) -= x; }\n MInt operator*(const MInt &x) const { return MInt(*this) *= x; }\n MInt operator/(const MInt &x) const { return MInt(*this) /= x; }\n friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }\n friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }\n};\nnamespace std { template <int M> MInt<M> abs(const MInt<M> &x) { return x; } }\n\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, std::vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(long long exponent) const {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n for (int i = 0; i < n; ++i) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const std::vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline std::vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &x) {\n int m = x.height(), n = x.width();\n dat.resize(m, std::vector<T>(n));\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] = x[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &x) {\n int m = height(), n = width();\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] += x[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &x) {\n int m = height(), n = width();\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] -= x[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &x) {\n int m = height(), n = x.width(), l = width();\n std::vector<std::vector<T>> res(m, std::vector<T>(n, 0));\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) {\n for (int k = 0; k < l; ++k) res[i][j] += dat[i][k] * x[k][j];\n }\n std::swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\n\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\n\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\n\nprivate:\n std::vector<std::vector<T>> dat;\n};\n\ntemplate <typename T>\nint gauss_jordan(Matrix<T> &mat, const T EPS = 1e-8, bool is_extended = false) {\n int m = mat.height(), n = mat.width(), rank = 0;\n for (int col = 0; col < n; ++col) {\n if (is_extended && col == n - 1) break;\n int pivot = -1;\n T mx = EPS;\n for (int row = rank; row < m; ++row) {\n if (std::abs(mat[row][col]) > mx) {\n pivot = row;\n mx = std::abs(mat[row][col]);\n }\n }\n if (pivot == -1) continue;\n std::swap(mat[rank], mat[pivot]);\n T tmp = mat[rank][col];\n for (int col2 = 0; col2 < n; ++col2) mat[rank][col2] /= tmp;\n for (int row = 0; row < m; ++row) {\n if (row != rank && std::abs(mat[row][col]) > EPS) {\n tmp = mat[row][col];\n for (int col2 = 0; col2 < n; ++col2) mat[row][col2] -= mat[rank][col2] * tmp;\n }\n }\n ++rank;\n }\n return rank;\n}\n\nstruct Xor128 {\n int rand() {\n unsigned int t = x ^ (x << 11);\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return static_cast<int>(w);\n }\n int rand(int ub) {\n int res = rand() % ub;\n return res < 0 ? res + ub : res;\n }\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\n long long randll() {\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\n return static_cast<long long>(res | rand());\n }\n long long randll(long long ub) {\n long long res = randll() % ub;\n return res < 0 ? res + ub : res;\n }\n long long randll(long long lb, long long ub) { return lb + randll(ub - lb); }\nprivate:\n unsigned int x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned int>(std::time(nullptr));\n} xor128;\n\nint maximum_matching(const std::vector<std::vector<int>> &graph) {\n constexpr int P = 1000000007;\n using ModInt = MInt<P>;\n ModInt::set_mod(P);\n const int n = graph.size();\n Matrix<ModInt> tutte_matrix(n, n, 0);\n for (int i = 0; i < n; ++i) {\n for (const int j : graph[i]) {\n if (j > i) {\n const ModInt x = xor128.rand(1, P);\n tutte_matrix[i][j] = x;\n tutte_matrix[j][i] = -x;\n }\n }\n }\n return gauss_jordan(tutte_matrix, ModInt(0)) / 2;\n}\n\nint main() {\n int n, A, B;\n std::cin >> n >> A >> B;\n int ans = 0;\n std::vector<int> a, b;\n while (n--) {\n int a_i, b_i;\n std::cin >> a_i >> b_i;\n const int x = std::abs(a_i - b_i);\n if (x <= A || (B <= x && x <= 2 * A)) {\n ++ans;\n } else {\n a.emplace_back(a_i);\n b.emplace_back(b_i);\n }\n }\n n = a.size();\n if (n > 0) {\n std::vector<std::vector<int>> graph(n);\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n const int x = std::abs((a[i] + a[j]) - (b[i] + b[j]));\n if (x <= A || (B <= x && x <= 2 * A)) {\n graph[i].emplace_back(j);\n graph[j].emplace_back(i);\n }\n }\n }\n ans += maximum_matching(graph);\n }\n std::cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":5328,"score_of_the_acc":-0.7619,"final_rank":16},{"submission_id":"aoj_3032_4772385","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define rep2(i, x, n) for(int i = x; i <= n; i++)\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\n#define elif else if\n#define sp(x) fixed << setprecision(x)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)x.size()\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\nconst ll MOD = 1e9+7;\n//const ll MOD = 998244353;\nconst int inf = (1<<30)-1;\nconst ll INF = (1LL<<60)-1;\nconst ld EPS = 1e-10;\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\n\ntemplate<typename T>\nstruct Max_Flow{\n struct edge{\n int to; T cap; int rev;\n edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}\n };\n\n vector<vector<edge>> es;\n vector<bool> used;\n const T INF_T;\n\n Max_Flow(int n) : INF_T(numeric_limits<T>::max()){\n es.resize(n), used.resize(n);\n }\n\n void add_edge(int from, int to, T cap, bool directed = true){\n es[from].eb(to, cap, sz(es[to]));\n es[to].eb(from, directed? 0 : cap, sz(es[from])-1);\n }\n\n T dfs(int now, int t, T flow){\n if(now == t) return flow;\n used[now] = true;\n for(auto &e: es[now]){\n if(!used[e.to] && e.cap > 0){\n T f = dfs(e.to, t, min(flow, e.cap));\n if(f > 0){\n e.cap -= f;\n es[e.to][e.rev].cap += f;\n return f;\n }\n }\n }\n return 0;\n }\n\n T max_flow(int s, int t){\n T flow = 0;\n for(;;){\n fill(all(used), false);\n T f = dfs(s, t, INF_T);\n if(f == 0) return flow;\n flow += f;\n }\n }\n};\n\nint main(){\n int N, A, B;\n cin >> N >> A >> B;\n int a[N], b[N];\n bool used[N];\n fill(used, used+N, false);\n int ans = 0;\n rep(i, N){\n cin >> a[i] >> b[i];\n a[i] -= b[i];\n int tmp = abs(a[i]);\n if(tmp <= A || (B <= tmp && tmp <= 2*A)) ans++, used[i] = true;\n }\n Max_Flow<int> G(2*N+2);\n int s = 2*N, t = 2*N+1;\n rep(i, N) G.add_edge(s, i, 1), G.add_edge(N+i, t, 1);\n rep(i, N){\n if(used[i] || a[i] < 0) continue;\n rep(j, N){\n if(used[j]) continue;\n int tmp = abs(a[i]+a[j]);\n if(tmp <= A || (B <= tmp && tmp <= 2*A)) G.add_edge(i, N+j, 1);\n }\n }\n cout << ans+G.max_flow(s, t) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4296,"score_of_the_acc":-0.0626,"final_rank":2},{"submission_id":"aoj_3032_4092716","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\ntemplate <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\n// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\ntemplate <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(ll exponent) {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n REP(i, n) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &x) {\n int m = x.height(), n = x.width();\n dat.resize(m, vector<T>(n));\n REP(i, m) REP(j, n) dat[i][j] = x[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &x) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] += x[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &x) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] -= x[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &x) {\n int m = height(), n = x.width(), l = width();\n vector<vector<T> > res(m, vector<T>(n, 0));\n REP(i, m) REP(j, n) {\n REP(k, l) res[i][j] += dat[i][k] * x[k][j];\n }\n swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\n\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\n\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\n\nprivate:\n vector<vector<T> > dat;\n};\n\ntemplate <typename T>\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\n int m = mat.height(), n = mat.width(), rank = 0;\n REP(col, n) {\n if (is_extended && col == n - 1) break;\n int pivot = -1;\n T mx = EPS;\n FOR(row, rank, m) {\n if (abs(mat[row][col]) > mx) {\n pivot = row;\n mx = abs(mat[row][col]);\n }\n }\n if (pivot == -1) continue;\n swap(mat[rank], mat[pivot]);\n T tmp = mat[rank][col];\n REP(col2, n) mat[rank][col2] /= tmp;\n REP(row, m) {\n if (row != rank && abs(mat[row][col]) > EPS) {\n tmp = mat[row][col];\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\n }\n }\n ++rank;\n }\n return rank;\n}\n\nstruct Xor128 {\n int rand() {\n unsigned t = x ^ (x << 11);\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return static_cast<int>(w);\n }\n int rand(int ub) {\n int res = rand() % ub;\n return (res < 0 ? res + ub : res);\n }\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\n ll randll() {\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\n return static_cast<ll>(res | rand());\n }\n ll randll(ll ub) {\n ll res = randll() % ub;\n return (res < 0 ? res + ub : res);\n }\n ll randll(ll lb, ll ub) { return lb + rand(ub - lb); }\nprivate:\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\n} xor128;\n\nint tutte_theorem(const vector<vector<int> > &graph) {\n int n = graph.size();\n Matrix<double> mat(n, n, 0);\n REP(i, n) {\n for (int e : graph[i]) {\n if (e > i) {\n double x = 0;\n while (x < EPS) {\n int den = xor128.rand();\n if (den > EPS) x = 1.0 * xor128.rand() / den;\n }\n mat[i][e] = x;\n mat[e][i] = -x;\n }\n }\n }\n return gauss_jordan(mat) / 2;\n}\n\nint main() {\n int n, A, B; cin >> n >> A >> B;\n int ans = 0;\n vector<int> a, b;\n while (n--) {\n int ai, bi; cin >> ai >> bi;\n int val = abs(ai - bi);\n if (val <= A || (B <= val && val <= 2 * A)) {\n ++ans;\n } else {\n a.emplace_back(ai);\n b.emplace_back(bi);\n }\n }\n n = a.size();\n if (n > 0) {\n vector<vector<int> > graph(n);\n REP(i, n) FOR(j, i + 1, n) {\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\n if (val <= A || (B <= val && val <= 2 * A)) {\n graph[i].emplace_back(j);\n graph[j].emplace_back(i);\n }\n }\n ans += tutte_theorem(graph);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":7556,"score_of_the_acc":-0.4971,"final_rank":14},{"submission_id":"aoj_3032_4014950","code_snippet":"#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n\nconst double EPS = 1e-8;\n\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n/*-------------------------------------------------*/\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(long long exponent) {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n REP(i, n) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &rhs) {\n int m = rhs.height(), n = rhs.width();\n dat.resize(m, vector<T>(n));\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &rhs) {\n int m = height(), n = rhs.width(), l = width();\n vector<vector<T> > res(m, vector<T>(n, 0));\n REP(i, m) REP(j, n) {\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\n }\n swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\n\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\n\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\n\nprivate:\n vector<vector<T> > dat;\n};\n\ntemplate <typename T>\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\n int m = mat.height(), n = mat.width(), rank = 0;\n REP(col, n) {\n if (is_extended && col == n - 1) break;\n int pivot = -1;\n T mx = EPS;\n FOR(row, rank, m) {\n if (abs(mat[row][col]) > mx) {\n pivot = row;\n mx = abs(mat[row][col]);\n }\n }\n if (pivot == -1) continue;\n swap(mat[rank], mat[pivot]);\n T tmp = mat[rank][col];\n REP(col2, n) mat[rank][col2] /= tmp;\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\n tmp = mat[row][col];\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\n }\n ++rank;\n }\n return rank;\n}\n\nstruct Xor128 {\n int rand() {\n unsigned t = x ^ (x << 11);\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return static_cast<int>(w);\n }\n int rand(int ub) {\n int res = rand() % ub;\n return (res < 0 ? res + ub : res);\n }\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\n long long randll() {\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\n return static_cast<long long>(res | rand());\n }\n long long randll(long long ub) {\n long long res = randll() % ub;\n return (res < 0 ? res + ub : res);\n }\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\nprivate:\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\n} xor128;\n\nint matching(const vector<vector<int> > &graph) {\n int n = graph.size();\n Matrix<double> mat(n, n, 0);\n REP(i, n) {\n for (int e : graph[i]) if (e > i) {\n double x = 0;\n while (x < EPS) {\n int den = xor128.rand();\n if (den > EPS) x = static_cast<double>(xor128.rand()) / den;\n }\n mat[i][e] = x;\n mat[e][i] = -x;\n }\n }\n return gauss_jordan(mat) / 2;\n}\n\nint main() {\n int n, A, B; cin >> n >> A >> B;\n int ans = 0;\n vector<int> a, b;\n while (n--) {\n int ai, bi; cin >> ai >> bi;\n int val = abs(ai - bi);\n if (val <= A || (B <= val && val <= 2 * A)) {\n ++ans;\n } else {\n a.emplace_back(ai);\n b.emplace_back(bi);\n }\n }\n n = a.size();\n if (n > 0) {\n vector<vector<int> > graph(n);\n REP(i, n) FOR(j, i + 1, n) {\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\n if (val <= A || (B <= val && val <= 2 * A)) {\n graph[i].emplace_back(j);\n graph[j].emplace_back(i);\n }\n }\n ans += matching(graph);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":7532,"score_of_the_acc":-0.4953,"final_rank":13},{"submission_id":"aoj_3032_4014646","code_snippet":"#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n\nconst double EPS = 1e-8;\n\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n/*-------------------------------------------------*/\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(long long exponent) {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n REP(i, n) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &rhs) {\n int m = rhs.height(), n = rhs.width();\n dat.resize(m, vector<T>(n));\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &rhs) {\n int m = height(), n = rhs.width(), l = width();\n vector<vector<T> > res(m, vector<T>(n, 0));\n REP(i, m) REP(j, n) {\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\n }\n swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\n\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\n\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\n\nprivate:\n vector<vector<T> > dat;\n};\n\ntemplate <typename T>\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\n int m = mat.height(), n = mat.width(), rank = 0;\n REP(col, n) {\n if (is_extended && col == n - 1) break;\n int pivot = -1;\n T mx = EPS;\n FOR(row, rank, m) {\n if (abs(mat[row][col]) > mx) {\n pivot = row;\n mx = abs(mat[row][col]);\n }\n }\n if (pivot == -1) continue;\n swap(mat[rank], mat[pivot]);\n T tmp = mat[rank][col];\n REP(col2, n) mat[rank][col2] /= tmp;\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\n tmp = mat[row][col];\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\n }\n ++rank;\n }\n return rank;\n}\n\nstruct Xor128 {\n int rand() {\n unsigned t = x ^ (x << 11);\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return static_cast<int>(w);\n }\n int rand(int ub) {\n int res = rand() % ub;\n return (res < 0 ? res + ub : res);\n }\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\n long long randll() {\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\n return static_cast<long long>(res | rand());\n }\n long long randll(long long ub) {\n long long res = randll() % ub;\n return (res < 0 ? res + ub : res);\n }\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\nprivate:\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\n} xor128;\n\nint matching(const vector<vector<int> > &graph) {\n int n = graph.size();\n Matrix<double> mat(n, n, 0);\n REP(i, n) {\n for (int e : graph[i]) if (e > i) {\n double x = static_cast<double>(xor128.rand()) / xor128.rand();\n mat[i][e] = x;\n mat[e][i] = -x;\n }\n }\n return gauss_jordan(mat) / 2;\n}\n\nint main() {\n int n, A, B; cin >> n >> A >> B;\n int ans = 0;\n vector<int> a, b;\n while (n--) {\n int ai, bi; cin >> ai >> bi;\n int val = abs(ai - bi);\n if (val <= A || (B <= val && val <= 2 * A)) {\n ++ans;\n } else {\n a.emplace_back(ai);\n b.emplace_back(bi);\n }\n }\n n = a.size();\n if (n > 0) {\n vector<vector<int> > graph(n);\n REP(i, n) FOR(j, i + 1, n) {\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\n if (val <= A || (B <= val && val <= 2 * A)) {\n graph[i].emplace_back(j);\n graph[j].emplace_back(i);\n }\n }\n ans += matching(graph);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":7512,"score_of_the_acc":-0.4938,"final_rank":12},{"submission_id":"aoj_3032_3827775","code_snippet":"#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n\nconst double EPS = 1e-8;\n/*-------------------------------------------------*/\ntemplate <typename T>\nstruct Matrix {\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\n\n int height() const { return dat.size(); }\n\n int width() const { return dat.front().size(); }\n\n Matrix pow(long long exponent) {\n int n = height();\n Matrix<T> tmp = *this, res(n, n, 0);\n REP(i, n) res[i][i] = 1;\n while (exponent > 0) {\n if (exponent & 1) res *= tmp;\n tmp *= tmp;\n exponent >>= 1;\n }\n return res;\n }\n\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\n\n Matrix &operator=(const Matrix &rhs) {\n int m = rhs.height(), n = rhs.width();\n dat.resize(m, vector<T>(n));\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\n return *this;\n }\n\n Matrix &operator+=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\n return *this;\n }\n\n Matrix &operator-=(const Matrix &rhs) {\n int m = height(), n = width();\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\n return *this;\n }\n\n Matrix &operator*=(const Matrix &rhs) {\n int m = height(), n = rhs.width(), l = width();\n vector<vector<T> > res(m, vector<T>(n, 0));\n REP(i, m) REP(j, n) {\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\n }\n swap(dat, res);\n return *this;\n }\n\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\n\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\n\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\n\nprivate:\n vector<vector<T> > dat;\n};\n\ntemplate <typename T>\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\n int m = mat.height(), n = mat.width(), rank = 0;\n REP(col, n) {\n if (is_extended && col == n - 1) break;\n int pivot = -1;\n T mx = EPS;\n FOR(row, rank, m) {\n if (abs(mat[row][col]) > mx) {\n pivot = row;\n mx = abs(mat[row][col]);\n }\n }\n if (pivot == -1) continue;\n swap(mat[rank], mat[pivot]);\n T tmp = mat[rank][col];\n REP(col2, n) mat[rank][col2] /= tmp;\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\n tmp = mat[row][col];\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\n }\n ++rank;\n }\n return rank;\n}\n\nstruct Xor128 {\n int rand() {\n unsigned t = x ^ (x << 11);\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return static_cast<int>(w);\n }\n int rand(int ub) {\n int res = rand() % ub;\n return (res < 0 ? res + ub : res);\n }\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\n long long randll() {\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\n return static_cast<long long>(res | rand());\n }\n long long randll(long long ub) {\n long long res = randll() % ub;\n return (res < 0 ? res + ub : res);\n }\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\nprivate:\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\n} xor128;\n\ntemplate <typename T>\nint matching(const vector<vector<T> > &graph) {\n int n = graph.size();\n Matrix<double> mat(n, n);\n REP(i, n) FOR(j, i + 1, n) if (graph[i][j] != 0) {\n double x = static_cast<double>(xor128.rand()) / xor128.rand();\n mat[i][j] = x;\n mat[j][i] = -x;\n }\n return gauss_jordan(mat) / 2;\n}\n\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n // freopen(\"input.txt\", \"r\", stdin);\n\n int n, A, B; cin >> n >> A >> B;\n int ans = 0;\n vector<int> a, b;\n while (n--) {\n int ai, bi; cin >> ai >> bi;\n int val = abs(ai - bi);\n if (val <= A || (B <= val && val <= 2 * A)) {\n ++ans;\n } else {\n a.emplace_back(ai);\n b.emplace_back(bi);\n }\n }\n n = a.size();\n if (n > 0) {\n vector<vector<int> > graph(n, vector<int>(n, 0));\n REP(i, n) FOR(j, i + 1, n) {\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\n if (val <= A || (B <= val && val <= 2 * A)) graph[i][j] = graph[j][i] = 1;\n }\n ans += matching(graph);\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":9576,"score_of_the_acc":-0.6492,"final_rank":15},{"submission_id":"aoj_3032_3416747","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-2;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\n#include<cstring>\nstruct edge { int to, cap, rev; };\nvector<edge> G[100000];\nbool used[100000];\nvoid add_edge(int from, int to, int cap) {\n\tG[from].push_back(edge{ to, cap, (int)G[to].size() });\n\tG[to].push_back(edge{ from, 0, (int)G[from].size() - 1 });\n}\nint dfs(int v, int t, int f) {\n\tif (v == t)return f;\n\tused[v] = true;\n\tfor (int i = 0; i < (int)G[v].size(); i++) {\n\t\tedge &e = G[v][i];\n\t\tif (!used[e.to] && e.cap > 0) {\n\t\t\tint d = dfs(e.to, t, min(f, e.cap));\n\t\t\tif (d > 0) {\n\t\t\t\te.cap -= d;\n\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nint max_flow(int s, int t) {\n\tint flow = 0;\n\tfor (;;) {\n\t\tmemset(used, 0, sizeof(used));\n\t\tint f = dfs(s, t, mod);\n\t\tif (f == 0)return flow;\n\t\tflow += f;\n\t}\n}\nvector<P> v[2];\nint main() {\n\tint n, a, b; cin >> n >> a >> b;\n\tint cnt = 0;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tint z = abs(x - y);\n\t\tif (z <= a || (b <= z && z <= 2 * a))cnt++;\n\t\telse {\n\t\t\tif (x-y>0) {\n\t\t\t\tv[0].push_back({ x,y });\n\t\t\t}\n\t\t\telse {\n\t\t\t\tv[1].push_back({ x,y });\n\t\t\t}\n\t\t}\n\t}\n\tint m = v[0].size(); int len = v[1].size();\n\tint sta = m + len, goa = m + len + 1;\n\trep(i, m)add_edge(sta, i, 1);\n\trep(i, len)add_edge(i + m, goa, 1);\n\trep(i, m) {\n\t\trep(j, len) {\n\t\t\tint z = v[0][i].first - v[0][i].second + v[1][j].first - v[1][j].second;\n\t\t\tz = abs(z);\n\t\t\tif (z <= a || (b <= z && z <= 2 * a)) {\n\t\t\t\tadd_edge(i, m + j,1);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = cnt + max_flow(sta,goa);\n\tcout << ans << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6732,"score_of_the_acc":-0.2459,"final_rank":9},{"submission_id":"aoj_3032_3275843","code_snippet":"#include <vector>\n#include <cassert>\n#include <set>\n#include <queue>\n#include <functional>\n#include <algorithm>\n\nstruct edge {\n int to;\n int label;\n};\n\n\n::std::vector<::std::pair<int,int>> gabow_edmonds(const ::std::vector<::std::vector<int>>& gra){\n int N = gra.size();\n ::std::vector<::std::vector<edge>> g(N + 1);\n ::std::vector<::std::pair<int,int>> edges;\n {\n int cnt = N + 1;\n for(int i = 0;i < N;i++){\n for(auto to : gra[i]){\n if(i < to){\n g[to + 1].push_back({i + 1,cnt});\n g[i + 1].push_back({to + 1,cnt++});\n edges.push_back({i + 1, to + 1});\n }\n }\n }\n }\n ::std::vector<int> mate(N + 1 , 0);\n ::std::vector<int> label(N + 1 , -1);\n ::std::vector<int> first(N + 1 , 0);\n\n ::std::function<int(int)> eval_first = [&](int x){\n if(label[first[x]] < 0) return first[x];\n first[x] = eval_first(first[x]);\n return first[x];\n };\n\n ::std::function<void(int,int)> rematch = [&](int v,int w){\n int t = mate[v];\n mate[v] = w;\n if(mate[t] != v) return;\n if(label[v] <= N){\n mate[t] = label[v];\n rematch(label[v] , t);\n }\n else{\n int x = edges[label[v] - N + 1].first;\n int y = edges[label[v] - N + 1].second;\n rematch(x , y);\n rematch(y , x);\n }\n };\n\n ::std::function<void(int,int,int)> assignLabel = [&](int x, int y,int num){\n int r = eval_first(x);\n int s = eval_first(y);\n int join = 0;\n if(r == s) return;\n label[r] = -num;\n label[s] = -num;\n while(true){\n if(s != 0) ::std::swap(r , s);\n r = eval_first(label[mate[r]]);\n if(label[r] == -num){\n join = r;\n break;\n }\n label[r] = -num;\n }\n int v = first[x];\n while(v != join){\n label[v] = num;\n first[v] = join;\n v = first[label[mate[v]]];\n }\n v = first[y];\n while(v != join){\n label[v] = num;\n first[v] = join;\n v = first[label[mate[v]]];\n }\n return;\n };\n\n ::std::function<bool(int)> augment_check = [&](int u){\n first[u] = 0;\n label[u] = 0;\n ::std::queue<int> que;\n que.push(u);\n while(!que.empty()){\n int x = que.front();\n que.pop();\n for(auto e : g[x]){\n int y = e.to;\n if(mate[y] == 0 && y != u){\n mate[y] = x;\n rematch(x , y);\n return true;\n }\n else if(label[y] >= 0){\n assignLabel(x , y , e.label);\n }\n else if(label[mate[y]] < 0){\n label[mate[y]] = x;\n first[mate[y]] = y;\n que.push(mate[y]);\n }\n }\n }\n return false;\n };\n\n for(int i = 1;i <= N;i++){\n if(mate[i] != 0) continue;\n if(augment_check(i)){\n ::std::fill(label.begin() , label.end() , -1);\n }\n }\n\n ::std::vector<::std::pair<int,int>> ans;\n for(int i = 1;i <= N;i++){\n if(i < mate[i]){\n ans.push_back({i , mate[i]});\n }\n }\n return ans;\n}\n\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)\n\nint main(){\n int N,A,B;\n cin >> N >> A >> B;\n vector<int> a(N),b(N);\n for(int i = 0;i < N;i++){\n cin >> a[i] >> b[i];\n }\n vector<vector<int>> g(N * 2);\n for(int i = 0;i < N;i++){\n int t = abs(a[i] - b[i]);\n if(t <= A || (B <= t && t <= 2 * A)){\n g[i].push_back(i + N);\n g[i + N].push_back(i);\n }\n }\n for(int i = 0;i < N;i++){\n for(int j = i + 1;j < N;j++){\n int t = abs(a[i] + a[j] - b[i] - b[j]);\n if(t <= A || (B <= t && t <= 2 * A)){\n g[i].push_back(j);\n g[j].push_back(i);\n }\n }\n }\n\n cout << gabow_edmonds(g).size() << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":16752,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_3032_2997693","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\nstatic const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\ntemplate<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }\ntemplate<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }\n#define each(it,o) for(auto it = (o).begin(); it != (o).end(); ++ it)\n#define all(o) (o).begin(), (o).end()\n#define pb(x) push_back(x)\n#define mp(x,y) make_pair((x),(y))\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src_, int dst_, Weight weight_) : src(src_), dst(dst_), weight(weight_) { }\n\tEdge() {};\n};\ntypedef vector<Edge> Edges;\nstruct MaxWeightMatching {\n\tint nEdge, nVertex;\n\tWeight maxWeight;\n\tvi endPoint, mate, label, labelEdge,\n\t\tinBlossom, blossomParent, blossomBase,\n\t\tbestEdge, unusedBlossoms, allowEdge,\n\t\tblossomBestEdgesUsed,\n\t\tsVerteices;\n\tvector<Weight> dualVar;\n\tvector<vi> neighbEnd, blossomChilds, blossomEdges,\n\t\tblossomBestEdges;\n\tEdges edges;\n\tbool maxCardinality;\n\n\tWeight slack(int k) {\n\t\tEdge &e = edges[k];\n\t\treturn dualVar[e.src] + dualVar[e.dst] - 2 * e.weight;\n\t}\n\tstruct BlossomLeaves {\n\t\tint b;\n\t\tMaxWeightMatching *mw;\n\t\tenum { INITAL, END, NEXT, THIRD } state;\n\t\tvi::const_iterator iter, endi;\n\t\tBlossomLeaves *bl;\n\t\tBlossomLeaves(MaxWeightMatching *mw_, int b_) :\n\t\t\tmw(mw_), b(b_), state(INITAL), bl(NULL) {}\n\t\tbool next(int &r) {\n\t\t\tint t;\n\t\t\tswitch (state) {\n\t\t\tcase INITAL:\n\t\t\t\tif (b < mw->nVertex) {\n\t\t\t\t\tr = b;\n\t\t\t\t\tstate = END;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\titer = mw->blossomChilds[b].begin();\n\t\t\t\t\tendi = mw->blossomChilds[b].end();\n\t\t\t\t\tstate = NEXT;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\tcase END:\n\t\t\t\treturn false;\n\t\t\tcase NEXT:\n\t\t\t\tif (iter == endi)\n\t\t\t\t\treturn false;\n\t\t\t\tt = *iter;\n\t\t\t\t++iter;\n\t\t\t\tif (t < mw->nVertex) {\n\t\t\t\t\tr = t;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbl = new BlossomLeaves(mw, t);\n\t\t\t\t\tstate = THIRD;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\tcase THIRD:\n\t\t\t\tif (!bl->next(t)) {\n\t\t\t\t\tstate = NEXT;\n\t\t\t\t\tdelete bl; bl = NULL;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tr = t;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t};\n\tvoid assignLabel(int w, int t, int p) {\n\t\tint b = inBlossom[w];\n\t\tlabel[w] = label[b] = t;\n\t\tlabelEdge[w] = labelEdge[b] = p;\n\t\tbestEdge[w] = bestEdge[b] = -1;\n\t\tif (t == 1) {\n\t\t\tBlossomLeaves bl(this, b);\n\t\t\tfor (int r; bl.next(r); ) sVerteices.push_back(r);\n\t\t}\n\t\telse if (t == 2) {\n\t\t\tint base = blossomBase[b];\n\t\t\tassignLabel(endPoint[mate[base]], 1, mate[base] ^ 1);\n\t\t}\n\t}\n\tint scanBlossom(int v, int w) {\n\t\tvi path;\n\t\tint base = -1;\n\t\twhile (v != -1) {\n\t\t\tint b = inBlossom[v];\n\t\t\tif (label[b] & 4) {\n\t\t\t\tbase = blossomBase[b];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tpath.push_back(b);\n\t\t\tlabel[b] = 5;\n\t\t\tif (labelEdge[b] == -1) {\n\t\t\t\tv = -1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tv = endPoint[labelEdge[b]];\n\t\t\t\tb = inBlossom[v];\n\t\t\t\tv = endPoint[labelEdge[b]];\n\t\t\t}\n\t\t\tif (w != -1)\n\t\t\t\tswap(v, w);\n\t\t}\n\t\teach(it, path)\n\t\t\tlabel[*it] = 1;\n\t\treturn base;\n\t}\n\tvoid addBlossom(int base, int k) {\n\t\tEdge &e = edges[k];\n\t\tint bb = inBlossom[base],\n\t\t\tbv = inBlossom[e.src],\n\t\t\tbw = inBlossom[e.dst];\n\t\tint b = unusedBlossoms.back(); unusedBlossoms.pop_back();\n\t\tblossomBase[b] = base;\n\t\tblossomParent[b] = -1;\n\t\tblossomParent[bb] = b;\n\t\tblossomChilds[b].clear();\n\t\tblossomEdges[b].clear();\n\t\tvi &bChilds = blossomChilds[b];\n\t\tvi &bEdges = blossomEdges[b];\n\t\twhile (bv != bb) {\n\t\t\tblossomParent[bv] = b;\n\t\t\tbChilds.push_back(bv);\n\t\t\tbEdges.push_back(labelEdge[bv]);\n\t\t\tbv = inBlossom[endPoint[labelEdge[bv]]];\n\t\t}\n\t\tbChilds.push_back(bb);\n\t\treverse(all(bChilds));\n\t\treverse(all(bEdges));\n\t\tbEdges.push_back(2 * k);\n\t\twhile (bw != bb) {\n\t\t\tblossomParent[bw] = b;\n\t\t\tbChilds.push_back(bw);\n\t\t\tbEdges.push_back(labelEdge[bw] ^ 1);\n\t\t\tbw = inBlossom[endPoint[labelEdge[bw]]];\n\t\t}\n\t\tlabel[b] = 1;\n\t\tlabelEdge[b] = labelEdge[bb];\n\t\tdualVar[b] = 0;\n\t\tBlossomLeaves bl(this, b);\n\t\tfor (int v; bl.next(v); ) {\n\t\t\tif (label[inBlossom[v]] == 2)\n\t\t\t\tsVerteices.push_back(v);\n\t\t\tinBlossom[v] = b;\n\t\t}\n\t\tvi bestEdgeTo(2 * nVertex, -1);\n\t\teach(it, bChilds) {\n\t\t\tint bv2 = *it;\n\t\t\tvector<vi> nbLists;\n\t\t\tif (!blossomBestEdgesUsed[bv2]) {\n\t\t\t\tBlossomLeaves bl2(this, bv2);\n\t\t\t\tfor (int v2; bl2.next(v2); ) {\n\t\t\t\t\tnbLists.push_back(neighbEnd[v2]);\n\t\t\t\t\tvi &vv = nbLists.back();\n\t\t\t\t\teach(i, vv)\n\t\t\t\t\t\t*i /= 2;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnbLists.push_back(blossomBestEdges[bv2]);\n\t\t\t}\n\t\t\teach(itt, nbLists) {\n\t\t\t\teach(ittt, *itt) {\n\t\t\t\t\tint k2 = *ittt;\n\t\t\t\t\tEdge &e2 = edges[k2];\n\t\t\t\t\tint i = e2.src, j = e2.dst;\n\t\t\t\t\tif (inBlossom[j] == b)\n\t\t\t\t\t\tswap(i, j);\n\t\t\t\t\tint bj = inBlossom[j];\n\t\t\t\t\tif (bj != b && label[bj] == 1 &&\n\t\t\t\t\t\t(bestEdgeTo[bj] == -1 ||\n\t\t\t\t\t\t\tslack(k2) < slack(bestEdgeTo[bj]))) {\n\t\t\t\t\t\tbestEdgeTo[bj] = k2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tblossomBestEdgesUsed[bv2] = false;\n\t\t\tblossomBestEdges[bv2].clear();\n\t\t\tbestEdge[bv2] = -1;\n\t\t}\n\t\tblossomBestEdgesUsed[b] = true;\n\t\tblossomBestEdges[b].clear();\n\t\teach(it, bestEdgeTo)\n\t\t\tif (*it != -1)\n\t\t\t\tblossomBestEdges[b].push_back(*it);\n\t\tbestEdge[b] = -1;\n\t\teach(it, blossomBestEdges[b])\n\t\t\tif (bestEdge[b] == -1 || slack(*it) < slack(bestEdge[b]))\n\t\t\t\tbestEdge[b] = *it;\n\t}\n\tvoid expandBlossom(int b, bool endStage) {\n\t\tint cSize = blossomChilds[b].size();\n\t\teach(it, blossomChilds[b]) {\n\t\t\tint s = *it;\n\t\t\tblossomParent[s] = -1;\n\t\t\tif (s < nVertex)\n\t\t\t\tinBlossom[s] = s;\n\t\t\telse if (endStage && dualVar[s] == 0)\n\t\t\t\texpandBlossom(s, endStage);\n\t\t\telse {\n\t\t\t\tBlossomLeaves bl(this, s);\n\t\t\t\tfor (int v; bl.next(v); )\n\t\t\t\t\tinBlossom[v] = s;\n\t\t\t}\n\t\t}\n\t\tif (!endStage && label[b] == 2) {\n\t\t\tint entryChild = inBlossom[endPoint[labelEdge[b] ^ 1]];\n\t\t\tint j = find(all(blossomChilds[b]), entryChild) - blossomChilds[b].begin();\n\t\t\tint jStep, evenOdd;\n\t\t\tif (j & 1)\n\t\t\t\tjStep = 1, evenOdd = 0;\n\t\t\telse\n\t\t\t\tjStep = -1, evenOdd = 1;\n\t\t\tint p = labelEdge[b];\n\t\t\twhile (j != 0) {\n\t\t\t\tlabel[endPoint[p ^ 1]] = 0;\n\t\t\t\tlabel[endPoint[blossomEdges[b][j - evenOdd] ^ evenOdd ^ 1]] = 0;\n\t\t\t\tassignLabel(endPoint[p ^ 1], 2, p);\n\t\t\t\tallowEdge[blossomEdges[b][j - evenOdd] / 2] = true;\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t\tp = blossomEdges[b][j - evenOdd] ^ evenOdd;\n\t\t\t\tallowEdge[p / 2] = true;\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t}\n\t\t\tint bv = blossomChilds[b][j];\n\t\t\tlabel[endPoint[p ^ 1]] = label[bv] = 2;\n\t\t\tlabelEdge[endPoint[p ^ 1]] = labelEdge[bv] = p;\n\t\t\tbestEdge[bv] = -1;\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\twhile (blossomChilds[b][j] != entryChild) {\n\t\t\t\tbv = blossomChilds[b][j];\n\t\t\t\tif (label[bv] == 1) {\n\t\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tBlossomLeaves bl(this, bv);\n\t\t\t\tint v;\n\t\t\t\twhile (bl.next(v))\n\t\t\t\t\tif (label[v] != 0)\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (label[v] != 0) {\n\t\t\t\t\tlabel[v] = 0;\n\t\t\t\t\tlabel[endPoint[mate[blossomBase[bv]]]] = 0;\n\t\t\t\t\tassignLabel(v, 2, labelEdge[v]);\n\t\t\t\t}\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t}\n\t\t}\n\t\tlabel[b] = labelEdge[b] = -1;\n\t\tblossomChilds[b].clear();\n\t\tblossomEdges[b].clear();\n\t\tblossomBestEdgesUsed[b] = false;\n\t\tblossomBestEdges[b].clear();\n\t\tbestEdge[b] = -1;\n\t\tunusedBlossoms.push_back(b);\n\t}\n\tvoid augmentBlossom(int b, int v) {\n\t\tint cSize = blossomChilds[b].size();\n\t\tint t = v;\n\t\twhile (blossomParent[t] != b)\n\t\t\tt = blossomParent[t];\n\t\tif (t >= nVertex)\n\t\t\taugmentBlossom(t, v);\n\t\tint i, j, jStep, evenOdd;\n\t\ti = j = find(all(blossomChilds[b]), t) - blossomChilds[b].begin();\n\t\tif (i & 1)\n\t\t\tjStep = 1, evenOdd = 0;\n\t\telse\n\t\t\tjStep = -1, evenOdd = 1;\n\t\twhile (j != 0) {\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\tt = blossomChilds[b][j];\n\t\t\tint p = blossomEdges[b][j - evenOdd] ^ evenOdd;\n\t\t\tif (t >= nVertex)\n\t\t\t\taugmentBlossom(t, endPoint[p]);\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\tt = blossomChilds[b][j];\n\t\t\tif (t >= nVertex)\n\t\t\t\taugmentBlossom(t, endPoint[p ^ 1]);\n\t\t\tmate[endPoint[p]] = p ^ 1;\n\t\t\tmate[endPoint[p ^ 1]] = p;\n\t\t}\n\t\trotate(blossomChilds[b].begin(), blossomChilds[b].begin() + i, blossomChilds[b].end());\n\t\trotate(blossomEdges[b].begin(), blossomEdges[b].begin() + i, blossomEdges[b].end());\n\t\tblossomBase[b] = blossomBase[blossomChilds[b][0]];\n\t}\n\tvoid augmentMatching(int k) {\n\t\tEdge &e = edges[k];\n\t\tint v = e.src, w = e.dst;\n\t\trep(ii, 2) {\n\t\t\tint s = ii == 0 ? v : w, p = ii == 0 ? 2 * k + 1 : 2 * k;\n\t\t\twhile (true) {\n\t\t\t\tint bs = inBlossom[s];\n\t\t\t\tif (bs >= nVertex)\n\t\t\t\t\taugmentBlossom(bs, s);\n\t\t\t\tmate[s] = p;\n\t\t\t\tif (labelEdge[bs] == -1)\n\t\t\t\t\tbreak;\n\t\t\t\tint bt = inBlossom[endPoint[labelEdge[bs]]];\n\t\t\t\ts = endPoint[labelEdge[bt]];\n\t\t\t\tint j = endPoint[labelEdge[bt] ^ 1];\n\t\t\t\tif (bt >= nVertex)\n\t\t\t\t\taugmentBlossom(bt, j);\n\t\t\t\tmate[j] = labelEdge[bt];\n\t\t\t\tp = labelEdge[bt] ^ 1;\n\t\t\t}\n\t\t}\n\t}\n\tvoid mainLoop() {\n\t\trep(t, nVertex) {\n\t\t\tlabel.assign(2 * nVertex, 0);\n\t\t\tbestEdge.assign(2 * nVertex, -1);\n\t\t\tfill(blossomBestEdgesUsed.begin() + nVertex, blossomBestEdgesUsed.end(), false);\n\t\t\tallowEdge.assign(nEdge, false);\n\t\t\tsVerteices.clear();\n\t\t\trep(v, nVertex)\n\t\t\t\tif (mate[v] == -1 && label[inBlossom[v]] == 0)\n\t\t\t\t\tassignLabel(v, 1, -1);\n\t\t\tbool augmented = false;\n\t\t\twhile (true) {\n\t\t\t\tWeight kSlack;\n\t\t\t\twhile (!sVerteices.empty() && !augmented) {\n\t\t\t\t\tint v = sVerteices.back(); sVerteices.pop_back();\n\t\t\t\t\teach(it, neighbEnd[v]) {\n\t\t\t\t\t\tint p = *it;\n\t\t\t\t\t\tint k = p / 2, w = endPoint[p];\n\t\t\t\t\t\tif (inBlossom[v] == inBlossom[w])\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif (!allowEdge[k]) {\n\t\t\t\t\t\t\tkSlack = slack(k);\n\t\t\t\t\t\t\tif (kSlack <= 0)\n\t\t\t\t\t\t\t\tallowEdge[k] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (allowEdge[k]) {\n\t\t\t\t\t\t\tif (label[inBlossom[w]] == 0) {\n\t\t\t\t\t\t\t\tassignLabel(w, 2, p ^ 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (label[inBlossom[w]] == 1) {\n\t\t\t\t\t\t\t\tint base = scanBlossom(v, w);\n\t\t\t\t\t\t\t\tif (base >= 0) {\n\t\t\t\t\t\t\t\t\taddBlossom(base, k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\taugmentMatching(k);\n\t\t\t\t\t\t\t\t\taugmented = true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (label[w] == 0) {\n\t\t\t\t\t\t\t\tlabel[w] = 2;\n\t\t\t\t\t\t\t\tlabelEdge[w] = p ^ 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[inBlossom[w]] == 1) {\n\t\t\t\t\t\t\tint b = inBlossom[v];\n\t\t\t\t\t\t\tif (bestEdge[b] == -1 || kSlack < slack(bestEdge[b]))\n\t\t\t\t\t\t\t\tbestEdge[b] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[w] == 0) {\n\t\t\t\t\t\t\tif (bestEdge[w] == -1 || kSlack < slack(bestEdge[w]))\n\t\t\t\t\t\t\t\tbestEdge[w] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (augmented)\n\t\t\t\t\tbreak;\n\t\t\t\tint deltaType = -1;\n\t\t\t\tWeight delta;\n\t\t\t\tint deltaEdge, deltaBlossom;\n\t\t\t\tif (!maxCardinality) {\n\t\t\t\t\tdeltaType = 1;\n\t\t\t\t\tdelta = *min_element(dualVar.begin(), dualVar.begin() + nVertex);\n\t\t\t\t}\n\t\t\t\trep(v, nVertex) {\n\t\t\t\t\tif (label[inBlossom[v]] == 0 && bestEdge[v] != -1) {\n\t\t\t\t\t\tWeight d = slack(bestEdge[v]);\n\t\t\t\t\t\tif (deltaType == -1 || d < delta) {\n\t\t\t\t\t\t\tdelta = d;\n\t\t\t\t\t\t\tdeltaType = 2;\n\t\t\t\t\t\t\tdeltaEdge = bestEdge[v];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(b, 2 * nVertex) {\n\t\t\t\t\tif (blossomParent[b] == -1 && label[b] == 1 && bestEdge[b] != -1) {\n\t\t\t\t\t\tkSlack = slack(bestEdge[b]);\n\t\t\t\t\t\tWeight d = kSlack / 2;\n\t\t\t\t\t\tif (deltaType == -1 || d < delta) {\n\t\t\t\t\t\t\tdelta = d;\n\t\t\t\t\t\t\tdeltaType = 3;\n\t\t\t\t\t\t\tdeltaEdge = bestEdge[b];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treu(b, nVertex, 2 * nVertex) {\n\t\t\t\t\tif (blossomBase[b] >= 0 && blossomParent[b] == -1 &&\n\t\t\t\t\t\tlabel[b] == 2 &&\n\t\t\t\t\t\t(deltaType == -1 || dualVar[b] < delta)) {\n\t\t\t\t\t\tdelta = dualVar[b];\n\t\t\t\t\t\tdeltaType = 4;\n\t\t\t\t\t\tdeltaBlossom = b;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (deltaType == -1) {\n\t\t\t\t\tdeltaType = 1;\n\t\t\t\t\tdelta = max((Weight)0, *min_element(dualVar.begin(), dualVar.begin() + nVertex));\n\t\t\t\t}\n\t\t\t\trep(v, nVertex) {\n\t\t\t\t\tif (label[inBlossom[v]] == 1) {\n\t\t\t\t\t\tdualVar[v] -= delta;\n\t\t\t\t\t}\n\t\t\t\t\telse if (label[inBlossom[v]] == 2) {\n\t\t\t\t\t\tdualVar[v] += delta;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treu(b, nVertex, 2 * nVertex) {\n\t\t\t\t\tif (blossomBase[b] >= 0 && blossomParent[b] == -1) {\n\t\t\t\t\t\tif (label[b] == 1) {\n\t\t\t\t\t\t\tdualVar[b] += delta;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[b] == 2) {\n\t\t\t\t\t\t\tdualVar[b] -= delta;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (deltaType == 1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 2) {\n\t\t\t\t\tallowEdge[deltaEdge] = true;\n\t\t\t\t\tEdge &e = edges[deltaEdge];\n\t\t\t\t\tint i = e.src, j = e.dst;\n\t\t\t\t\tif (label[inBlossom[i]] == 0)\n\t\t\t\t\t\tswap(i, j);\n\t\t\t\t\tsVerteices.push_back(i);\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 3) {\n\t\t\t\t\tallowEdge[deltaEdge] = true;\n\t\t\t\t\tEdge &e = edges[deltaEdge];\n\t\t\t\t\tint i = e.src;\n\t\t\t\t\tsVerteices.push_back(i);\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 4) {\n\t\t\t\t\texpandBlossom(deltaBlossom, false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!augmented)\n\t\t\t\tbreak;\n\t\t\treu(b, nVertex, 2 * nVertex)\n\t\t\t\tif (blossomParent[b] == -1 && blossomBase[b] >= 0 &&\n\t\t\t\t\tlabel[b] == 1 && dualVar[b] == 0)\n\t\t\t\t\texpandBlossom(b, true);\n\t\t}\n\t}\n\tvi matching(const Edges& edges_, bool maxCardinality_ = false) {\n\t\tedges = edges_; maxCardinality = maxCardinality_;\n\t\tnEdge = edges.size();\n\t\tnVertex = 0;\n\t\teach(i, edges) {\n\t\t\tif (i->src >= nVertex) nVertex = i->src + 1;\n\t\t\tif (i->dst >= nVertex) nVertex = i->dst + 1;\n\t\t}\n\t\tmaxWeight = 0;\n\t\tendPoint.clear();\n\t\tneighbEnd.assign(nVertex, vi());\n\t\trep(i, nEdge) {\n\t\t\tEdge &e = edges[i];\n\t\t\tmaxWeight = max(maxWeight, e.weight);\n\t\t\tendPoint.push_back(e.src);\n\t\t\tendPoint.push_back(e.dst);\n\t\t\tneighbEnd[e.src].push_back(2 * i + 1);\n\t\t\tneighbEnd[e.dst].push_back(2 * i);\n\t\t}\n\t\tmate.assign(nVertex, -1);\n\t\tlabel.assign(2 * nVertex, 0);\n\t\tlabelEdge.assign(2 * nVertex, -1);\n\t\tinBlossom.clear();\n\t\tblossomBase.clear();\n\t\tblossomParent.assign(2 * nVertex, -1);\n\t\tblossomChilds.assign(2 * nVertex, vi());\n\t\tblossomEdges.assign(2 * nVertex, vi());\n\t\tbestEdge.assign(2 * nVertex, -1);\n\t\tblossomBestEdgesUsed.assign(2 * nVertex, false);\n\t\tblossomBestEdges.assign(2 * nVertex, vi());\n\t\tunusedBlossoms.clear();\n\t\tdualVar.clear();\n\t\trep(i, nVertex)\n\t\t\tinBlossom.push_back(i),\n\t\t\tblossomBase.push_back(i),\n\t\t\tunusedBlossoms.push_back(nVertex + i),\n\t\t\tdualVar.push_back(maxWeight);\n\t\trep(i, nVertex)\n\t\t\tblossomBase.push_back(-1),\n\t\t\tdualVar.push_back(0);\n\t\tallowEdge.assign(nEdge, 0);\n\t\tsVerteices = vi();\n\t\tmainLoop();\n\t\trep(v, nVertex)\n\t\t\tif (mate[v] >= 0)\n\t\t\t\tmate[v] = endPoint[mate[v]];\n\t\treturn mate;\n\t}\n\tWeight getWeight(const Edges& e, bool maxCardinality_ = false) {\n\t\tvector<int> v = matching(e, maxCardinality_);\n\t\tWeight w = 0;\n\t\trep(i, v.size()) if (v[i] != -1)\n\t\t\teach(j, e) if (i == j->src && j->dst == v[i]) w += j->weight;\n\t\treturn w;\n\t}\n};\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint N, A, B; cin >> N >> A >> B;\n\tvector<int> a(N), b(N); for (int i = 0; i < N; i++) {\n\t\tcin >> a[i] >> b[i];\n\t}\n\n\tint ans = 0;\n\tvector<bool> used(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tif (abs(a[i] - b[i]) <= A || (abs(a[i] - b[i]) >= B&&abs(a[i] - b[i]) <= 2 * A)) {\n\t\t\tans++;\n\t\t\tused[i] = true;\n\t\t\tdump(i);\n\t\t}\n\t}\n\tEdges edges;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (used[i])continue;\n\t\tfor (int j = i + 1; j < N; j++) {\n\t\t\tif (used[j])continue;\n\t\t\tdump(i, j, abs(a[i] + a[j] - b[i] - b[j]));\n\t\t\tif (abs(a[i] + a[j] - b[i] - b[j]) <= A || (abs(a[i] + a[j] - b[i] - b[j]) >= B&&abs(a[i] + a[j] - b[i] - b[j]) <= 2 * A)) {\n\t\t\t\tedges.emplace_back(i, j, 1);\n\t\t\t}\n\t\t}\n\t}\n\tMaxWeightMatching mwm;\n\tans += mwm.getWeight(edges);\n\tcout << ans << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4680,"score_of_the_acc":-0.0915,"final_rank":6},{"submission_id":"aoj_3032_2851079","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n////フォード - ファルカーソン法 O(Flow|E|)\n\ntypedef int Weight;\n\nconst Weight INF = 1e9;\nconst Weight ZERO = 0;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tint rev;\n\tint id;\n\tEdge(int src_, int dst_, Weight weight_, const int rev_, const int id_) :\n\t\tsrc(src_), dst(dst_), weight(weight_), rev(rev_), id(id_) { }\n\tEdge(int src_, int dst_, Weight weight_, const int rev_) :\n\t\tsrc(src_), dst(dst_), weight(weight_), rev(rev_) { }\n\tEdge() :src(0), dst(0), weight(0) {\n\t}\n};\nbool operator < (const Edge &e, const Edge &f) {\n\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n\te.src != f.src ? e.src < f.src : e.dst < f.dst;\n}\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\nvoid add_edge(Graph&g, int from, int to, int cap)\n{\n\tg[from].push_back(Edge(from, to, cap, (int)g[to].size()));\n\tg[to].push_back(Edge(to, from, 0, (int)g[from].size() - 1));\n}\n//二つを繋ぐ線を完全に消す\nvoid erase_edge(Graph&g, const int from, const int to) {\n\tg[from].erase(remove_if(g[from].begin(), g[from].end(), [=](const Edge&e) {return e.dst == to; }), g[from].end());\n\tg[to].erase(remove_if(g[to].begin(), g[to].end(), [=](const Edge&e) {return e.dst == from; }), g[to].end());\n}\nint dfs(vector<int>&used, Graph&g, int now, int t, int f)\n{\n\tif (now == t) {\n\t\treturn f;\n\t}\n\tused[now] = true;\n\tfor (int i = 0; i<g[now].size(); ++i) {\n\t\tEdge &e = g[now][i];\n\t\tif (!used[e.dst] && e.weight>0) {\n\t\t\tint d = dfs(used, g, e.dst, t, min(f, e.weight));\n\t\t\tif (d > 0) {\n\t\t\t\te.weight -= d;\n\t\t\t\tg[e.dst][e.rev].weight += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\nWeight fold_falc(Graph g, const int start, const int goal) {\n\tWeight ans = 0;\n\twhile (1) {\n\t\tvector<int>used(g.size());\n\t\tint flow = dfs(used, g, start, goal, INF);\n\t\tif (!flow)return ans;\n\t\telse ans += flow;\n\t}\n}\n\nint main() {\n\tint N,A,B;cin>>N>>A>>B;\n\tvector<vector<int>>sas(2);\n\tint ans=0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint a, b;cin>>a>>b;\n\t\tint num=a-b;\n\t\tif ( abs(num)<=A || (B <= abs(num) && abs(num) <= 2 * A)) {\n\t\t\tans++;\n\t\t}\n\t\telse {\n\t\t\tif(num>0)sas[0].push_back(num);\n\t\t\telse sas[1].push_back(-num);\n\t\t}\n\t}\n\tconst int start=0;\n\tconst int zero=1;\n\tconst int one=zero+sas[0].size();\n\tconst int goal=one+sas[1].size();\n\tGraph g(goal+1);\n\n\tfor (int i = 0; i < sas[0].size(); ++i) {\n\t\tadd_edge(g,start,zero+i,1);\n\t}\n\tfor (int i = 0; i < sas[0].size(); ++i) {\n\t\tfor (int j = 0; j < sas[1].size(); ++j) {\n\t\t\tint x=zero+i;\n\t\t\tint y=one+j;\n\t\t\tint num=sas[0][i]-sas[1][j];\n\n\t\t\tif ( abs(num)<=A || (B <= (abs(num)) && (abs(num)) <= 2 * A)) {\n\t\t\t\tadd_edge(g,x,y,1);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < sas[1].size(); ++i) {\n\t\tadd_edge(g, one+i, goal, 1);\n\t}\n\n\tans+=fold_falc(g,start,goal);\n\tcout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6468,"score_of_the_acc":-0.2261,"final_rank":8},{"submission_id":"aoj_3032_2832949","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;++i)\n#define rep(i,n) REP(i,0,n)\n#define EPS (1e-8)\n\nusing namespace std;\n\n#define IINF INT_MAX\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef VVI matrix;\n\n#define MAX 810\ndouble A[MAX][MAX],B[MAX][MAX];\n\nint rnk(int n){\n int res = 0;\n //matrix B(n,VI(n+1,1));\n rep(i,n) rep(j,n+1) B[i][j] = 1;\n \n for(int i=0;i<n;i++) for(int j=0;j<n;j++) B[i][j] = A[i][j];\n \n for(int i=0;i<n;i++){\n int pivot = i;\n for(int j=i;j<n;j++){\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n }\n swap(B[i],B[pivot]);\n if(abs(B[i][i]) > EPS) res++;\n \n \n if(abs(B[i][i]) > EPS){\n for(int j=i+1;j<=n;j++) B[i][j] /= B[i][i];\n for(int j=0;j<n;j++){\n if(i != j){\n for(int k=i+1;k<=n;k++) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n }\n }\n return res;\n}\n\n\n\nint main() {\n srand((unsigned int)time(NULL));\n int N,a,b,c,d,e,n,cnt=0;\n cin >> N >> a >> b;\n vector<int> s,t;\n rep(i,N) {\n cin >> c >> d;\n e = abs(c-d);\n if( e <= a || ( b <= e && e <= 2 * a ) ) ++cnt;\n else s.push_back(c), t.push_back(d);\n }\n n = (int)s.size();\n rep(i,n) {\n REP(j,i+1,n) {\n e = abs( ( s[i] + s[j] ) - ( t[i] + t[j] ) );\n if( e <= a || ( b <= e && e <= 2 * a ) ) {\n\tA[i][j] = rand() % 1000000;\n\tA[j][i] = -A[i][j];\n }\n }\n }\n cout << cnt + (int)(rnk(n)/2) << endl;\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":12616,"score_of_the_acc":-1.1212,"final_rank":20},{"submission_id":"aoj_3032_2755903","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nstruct Dinic{\n const int INF=1<<28;\n struct edge {\n int to,cap,rev;\n edge(){}\n edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){}\n };\n\n int n;\n vector<vector<edge> > G;\n vector<map<int,int> > M;\n vector<int> level,iter;\n\n Dinic(){}\n Dinic(int sz):n(sz),G(n),M(n),level(n),iter(n){}\n \n void add_edge(int from,int to,int cap){\n M[from][to]=G[from].size();\n M[to][from]=G[to].size();\n G[from].push_back(edge(to,cap,G[to].size()));\n G[to].push_back(edge(from,0,G[from].size()-1));\n }\n \n void bfs(int s){\n fill(level.begin(),level.end(),-1);\n queue<int> que;\n level[s]=0;\n que.push(s);\n while(!que.empty()){\n int v=que.front();que.pop();\n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n que.push(e.to);\n }\n }\n }\n }\n int dfs(int v,int t,int f){\n if(v==t) return f;\n for(int &i=iter[v];i<(int)G[v].size();i++){\n edge &e=G[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d = dfs(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n G[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n }\n int flow(int s,int t,int lim){\n int fl=0;\n for(;;){\n bfs(s);\n if(level[t]<0||lim==0) return fl;\n fill(iter.begin(),iter.end(),0);\n int f;\n while((f=dfs(s,t,lim))>0){\n fl+=f;\n lim-=f;\n }\n }\n }\n};\n\nint N,A,B,ans,a,b;\nvector<P>C1,C2;\n\nbool check(int a,int b){\n int X=abs(a-b);\n return X<=A||(B<=X&&X<=2*A);\n}\n\nint main(){\n\n cin>>N>>A>>B;\n\n for(int i=0;i<N;i++){\n cin>>a>>b;\n if(check(a,b))ans++;\n else{\n if(a==b)continue;\n if(a>b)C1.push_back(P(a,b));\n else C2.push_back(P(a,b));\n }\n }\n\n int c1=C1.size(),c2=C2.size();\n\n Dinic D(c1+c2+2);\n\n for(int i=0;i<C1.size();i++){\n for(int j=0;j<C2.size();j++){\n int a=C1[i].first+C2[j].first;\n int b=C1[i].second+C2[j].second;\n if(check(a,b)){\n D.add_edge(i,C1.size()+j,1);\n }\n }\n }\n\n for(int i=0;i<C1.size();i++)D.add_edge(c1+c2,i,1);\n for(int i=0;i<C2.size();i++)D.add_edge(c1+i,c1+c2+1,1);\n\n cout<<ans+D.flow(c1+c2,c1+c2+1,1e8)<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":7744,"score_of_the_acc":-0.3221,"final_rank":10},{"submission_id":"aoj_3032_2754651","code_snippet":"#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\nclass MaxFlow {\npublic:\n struct edge { ll to, cap, rev; };\n\n const ll INF = 1LL << 60;\n ll N;\n vector< vector<edge> > E;\n vector<bool> used;\n\n MaxFlow(ll n): N(n), E(n), used(n) {};\n\n void add_directed_edge(ll from, ll to, ll cap) {\n E[from].push_back((edge) { to, cap, (ll) E[to].size() });\n E[to].push_back((edge) { from, 0, (ll) E[from].size() - 1 });\n }\n\n void add_undirected_edge(ll from, ll to, ll cap) {\n E[from].push_back((edge) { to, cap, (ll) E[to].size() });\n E[to].push_back((edge) { from, cap, (ll) E[from].size() - 1 });\n }\n\n ll dfs(ll v, ll t, ll f) {\n if(v == t) return f;\n used[v] = true;\n REP(i, 0, E[v].size()) {\n edge &e = E[v][i];\n if(!used[e.to] && e.cap > 0) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if(d > 0) {\n e.cap -= d;\n E[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n ll max_flow(ll s, ll t) {\n ll flow = 0;\n while(1) {\n REP(i, 0, N) used[i] = false;\n ll f = dfs(s, t, INF);\n if(f == 0 || f == INF) break;\n flow += f;\n }\n return flow;\n }\n};\n\nint main(void) {\n ll N, A, B;\n cin >> N >> A >> B;\n vector<ll> a(N), b(N);\n REP(i, 0, N) cin >> a[i] >> b[i];\n\n ll ans = 0;\n vector<bool> used(N, false);\n REP(i, 0, N) {\n ll d = abs(a[i] - b[i]);\n if(d <= A || (B <= d && d <= 2 * A)) {\n used[i] = true;\n ans++;\n }\n }\n\n const ll s = N, t = N + 1;\n MaxFlow flow(N + 2);\n REP(i, 0, N) if(!used[i]) {\n ll d = a[i] - b[i];\n if(d > 0) flow.add_directed_edge(s, i, 1);\n if(d < 0) flow.add_directed_edge(i, t, 1);\n }\n REP(i, 0, N) REP(j, 0, N) if(!used[i] && !used[j]) {\n ll di = a[i] - b[i];\n ll dj = a[j] - b[j];\n ll d = abs(di + dj);\n if(d <= A || (B <= d && d <= 2 * A)) {\n if(di > 0 && dj < 0) flow.add_directed_edge(i, j, 1);\n if(di < 0 && dj > 0) flow.add_directed_edge(j, i, 1);\n }\n }\n ans += flow.max_flow(s, t);\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":8060,"score_of_the_acc":-0.3729,"final_rank":11},{"submission_id":"aoj_3032_2752011","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n\n/*\n<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day2/problems/G>\n問題文============================================================\n\n N個の非負整数のペア(ai,bi)と非負整数A, B が与えられる。\n 以下のいずれかの操作をできるだけたくさん行いたい。\n \n (1) |ai−bi|≤A または B≤|ai−bi|≤2Aを満たす要素iを取り出し、削除する\n (2) |(ai+aj)−(bi+bj)|≤A または B≤|(ai+aj)−(bi+bj)|≤2A を満たす要素iと要素j (i≠j)の組を取り出し、削除する\n \n 最大の操作回数を求めよ。\n \n=================================================================\n\n解説=============================================================\n\n 出来うる限り 操作(1)を行う\n その後、余った要素ペアに関して操作(2)の条件を満たすペアとの二部マッチングを解く\n \n================================================================\n*/\n\nll V;\nvector<vector<ll>> G;\nvector<ll> match;\nvector<int> used;\n\nvoid add_edge(ll u, ll v) {\n G[u].push_back(v);\n G[v].push_back(u);\n}\n\nbool dfs(ll v) {\n used[v] = 1;\n for (int i = 0; i < G[v].size(); i++) {\n ll u = G[v][i], w = match[u];\n if (w < 0 || ((used[w] == 0) && dfs(w))) {\n match[v] = u;\n match[u] = v;\n return true;\n }\n }\n return false;\n}\n\nll bipartite_matching() {\n ll res = 0;\n for (int i = 0; i < (int)match.size();i++)match[i] = -1;\n for (int v = 0;v < V;v++) {\n if (match[v] < 0) {\n for (int i = 0; i < (int)used.size();i++)used[i] = 0;\n if (dfs(v))res++;\n }\n }\n return res;\n}\n\nint main(void) {\n\tcin.tie(0); ios::sync_with_stdio(false);\n ll N,A,B; cin >> N >> A >> B;\n vector<ll> a(N),b(N);\n for(int i = 0; i < N;i++) cin >> a[i] >>b[i];\n \n vector<int> f(N,0);\n for(int i = 0; i < N;i++){\n ll Abs = abs(a[i]-b[i]);\n if(Abs <= A || (B <= Abs && Abs <= 2*A)){\n f[i] = -1;\n }\n }\n ll cnt = -accumulate(f.begin(),f.end(),0LL);\n V = 0;\n for(int i = 0; i < N;i++){\n if(f[i] == 0){\n f[i] = V;\n V++;\n }\n }\n G.resize(V);\n match.resize(V);\n used.resize(V);\n \n for(int i = 0; i < N;i++){\n for(int j = 0; j < N;j++){\n if(f[i] == -1 || f[j] == -1) continue;\n ll Absdayo = abs(a[i]+a[j]-b[i]-b[j]);\n if(Absdayo <= A || (B <= Absdayo && Absdayo <= 2*A )){\n add_edge(f[i],f[j]);\n }\n }\n }\n// cout << cnt << \" \" << bipartite_matching() << endl;\n cout << cnt + bipartite_matching() << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4648,"score_of_the_acc":-0.0891,"final_rank":5},{"submission_id":"aoj_3032_2751722","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n\n/*\n<url:>\n問題文============================================================\n\n=================================================================\n\n解説=============================================================\n\n================================================================\n*/\n\nll V;\nvector<vector<ll>> G;\nvector<ll> match;\nvector<int> used;\n\nvoid add_edge(ll u, ll v) {\n G[u].push_back(v);\n G[v].push_back(u);\n}\n\nbool dfs(ll v) {\n used[v] = 1;\n for (int i = 0; i < G[v].size(); i++) {\n ll u = G[v][i], w = match[u];\n if (w < 0 || ((used[w] == 0) && dfs(w))) {\n match[v] = u;\n match[u] = v;\n return true;\n }\n }\n return false;\n}\n\nll bipartite_matching() {\n ll res = 0;\n for (int i = 0; i < (int)match.size();i++)match[i] = -1;\n for (int v = 0;v < V;v++) {\n if (match[v] < 0) {\n for (int i = 0; i < (int)used.size();i++)used[i] = 0;\n if (dfs(v))res++;\n }\n }\n return res;\n}\n\nint main(void) {\n\tcin.tie(0); ios::sync_with_stdio(false);\n ll N,A,B; cin >> N >> A >> B;\n vector<ll> a(N),b(N);\n for(int i = 0; i < N;i++) cin >> a[i] >>b[i];\n \n vector<int> f(N,0);\n for(int i = 0; i < N;i++){\n ll Abs = abs(a[i]-b[i]);\n if(Abs <= A || (B <= Abs && Abs <= 2*A)){\n f[i] = -1;\n }\n }\n ll cnt = -accumulate(f.begin(),f.end(),0LL);\n V = 0;\n for(int i = 0; i < N;i++){\n if(f[i] == 0){\n f[i] = V;\n V++;\n }\n }\n G.resize(V);\n match.resize(V);\n used.resize(V);\n \n for(int i = 0; i < N;i++){\n for(int j = 0; j < N;j++){\n if(f[i] == -1 || f[j] == -1) continue;\n ll Absdayo = abs(a[i]+a[j]-b[i]-b[j]);\n if(Absdayo <= A || (B <= Absdayo && Absdayo <= 2*A )){\n add_edge(f[i],f[j]);\n }\n }\n }\n// cout << cnt << \" \" << bipartite_matching() << endl;\n cout << cnt + bipartite_matching() << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4480,"score_of_the_acc":-0.0765,"final_rank":4},{"submission_id":"aoj_3032_2751553","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\ntypedef long long ll;\n\nint N,A,B;\nint a[830], b[830];\nint c[830];\n\nbool g[830][830];\n\nint main(){\n scanf(\"%d%d%d\",&N,&A,&B);\n REP(i,N)scanf(\"%d%d\",a+i,b+i);\n REP(i,N)c[i] = a[i]-b[i];\n int ans = 0;\n vector<int> pos, neg;\n REP(i,N){\n if(abs(c[i])<=A || (B<=abs(c[i]) && abs(c[i])<=2*A)){\n ans++;\n }else{\n (c[i]<0 ? neg : pos).push_back(c[i]);\n }\n }\n int n = pos.size(), m = neg.size();\n REP(i,n)REP(j,m){\n int x = pos[i] + neg[j];\n if(abs(x)<=A || (B<=abs(x) && abs(x)<=2*A)){\n g[i][n+j] = true;\n }else{\n g[i][n+j] = false;\n }\n }\n int s = n+m;\n int t = n+m+1;\n REP(i,n)g[s][i] = true;\n REP(j,m)g[n+j][t] = true;\n while(true){\n vector<int> bef(n+m+2, -1);\n vector<bool> used(n+m+2, false);\n stack<int> S;\n S.push(s);\n used[s] = true;\n while(!S.empty()){\n int p = S.top(); S.pop();\n REP(to,n+m+2)if(!used[to]){\n if(!g[p][to])continue;\n used[to] = true;\n bef[to] = p;\n S.push(to);\n }\n }\n if(!used[t])break;\n int cur = t;\n while(cur != s){\n int b = bef[cur];\n g[b][cur] = false;\n g[cur][b] = true;\n cur = b;\n }\n ans++;\n }\n printf(\"%d\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":3848,"score_of_the_acc":-1.0289,"final_rank":19},{"submission_id":"aoj_3032_2751548","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb emplace_back\n#define INF (1e9+1)\n\n\n//2部最大マッチング verified AOJ GRL_7_A\n#define MAX_V 800\nvector<int> G[MAX_V];\nint match[MAX_V];\nbool used[MAX_V];\n\nvoid add_edge(int u,int v){\n G[u].pb(v);\n G[v].pb(u);\n}\n\n// 増大路をDFSで探す\nbool dfs(int v){\n used[v]=true;\n rep(i,G[v].size()){\n int u=G[v][i],w=match[u]; //u:vからの移動先の頂点 , w:uとマッチングしている頂点\n if(w<0 || (!used[w] && dfs(w))){ //uがフリーか、このdfsではwを使っておらず かつwの別のペアが見つかった(=増大路発見) 場合\n match[v]=u;\n match[u]=v;\n return true;\n }\n }\n return false;\n}\n\nint bipartite_matching(int V){\n int res=0;\n rep(i,MAX_V)match[i]=-1;\n rep(v,V){\n if(match[v]<0){\n rep(i,MAX_V)used[i]=0;\n if( dfs(v) ) res++; //増大路が見つかればres+=1\n }\n }\n return res;\n}\n\nint main(){\n int ans = 0;\n int v,a,b;\n cin>>v>>a>>b;\n \n vector<int> s(v),t(v);\n rep(i,v){\n cin>>s[i]>>t[i];\n if(abs(s[i]-t[i])<=a or (b<=abs(s[i]-t[i]) and abs(s[i]-t[i])<=2*a))ans++;\n }\n \n auto g = [](int ai,int bi, int aj, int bj){\n return abs((ai+aj)-(bi+bj));\n };\n \n rep(i,v){\n if(abs(s[i]-t[i])<=a or (b<=abs(s[i]-t[i]) and abs(s[i]-t[i])<=2*a))continue;\n rep(j,v){\n if(abs(s[j]-t[j])<=a or (b<=abs(s[j]-t[j]) and abs(s[j]-t[j])<=2*a))continue;\n \n if(g(s[i],t[i],s[j],t[j])<=a or (b<=g(s[i],t[i],s[j],t[j]) and g(s[i],t[i],s[j],t[j])<=2*a) ){\n G[i].pb(j);\n }\n }\n }\n cout<<bipartite_matching(v)+ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3464,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3032_2751514","code_snippet":"#include <cstdio>\n#include <cassert>\n\n#include <vector>\n\nusing namespace std;\n\nclass MaximumMatching {\n /*\n Maximum Cardinality Matching in General Graphs.\n - O(\\sqrt{n} m \\log_{\\max\\{2, 1 + m/n\\}} n) time\n - O(n + m) space \n Note: each vertex is 1-indexed.\n Ref: \n Harold N. Gabow,\n \"The Weighted Matching Approach to Maximum Cardinality Matching\" (2017)\n (https://arxiv.org/abs/1703.03998)\n */\npublic:\n struct Edge { int from, to; };\n static constexpr int Inf = 1 << 30;\n\nprivate:\n enum Label { \n kInner = -1, // should be < 0\n kFree = 0 // should be 0\n };\n struct Link { int from, to; };\n struct Log { int v, par; };\n\n struct LinkedList {\n LinkedList() {}\n LinkedList(int N, int M) : N(N), next(M) { clear(); }\n void clear() { head.assign(N, -1); }\n void push(int h, int u) { next[u] = head[h], head[h] = u; }\n int N;\n vector<int> head, next;\n };\n\n template <typename T>\n struct Queue {\n Queue() {}\n Queue(int N) : qh(0), qt(0), data(N) {}\n T operator [] (int i) const { return data[i]; }\n void enqueue(int u) { data[qt++] = u; }\n int dequeue() { return data[qh++]; }\n bool empty() const { return qh == qt; }\n void clear() { qh = qt = 0; }\n int size() const { return qt; }\n int qh, qt;\n vector<T> data;\n };\n\n struct DisjointSetUnion {\n DisjointSetUnion() {}\n DisjointSetUnion(int N) : par(N) {\n for (int i = 0; i < N; ++i) par[i] = i;\n }\n int find(int u) { return par[u] == u ? u : (par[u] = find(par[u])); }\n void unite(int u, int v) {\n u = find(u), v = find(v);\n if (u != v) par[v] = u;\n }\n vector<int> par;\n };\n\npublic:\n MaximumMatching(int N, const vector<Edge>& in)\n : N(N), NH(N >> 1), ofs(N + 2, 0), edges(in.size() * 2) {\n\n for (auto& e : in) ofs[e.from + 1] += 1, ofs[e.to + 1] += 1;\n for (int i = 1; i <= N + 1; ++i) ofs[i] += ofs[i - 1];\n for (auto& e : in) {\n edges[ofs[e.from]++] = e; edges[ofs[e.to]++] = {e.to, e.from};\n }\n for (int i = N + 1; i > 0; --i) ofs[i] = ofs[i - 1];\n ofs[0] = 0;\n }\n\n int maximum_matching() {\n initialize();\n int match = 0;\n while (match * 2 + 1 < N) {\n reset_count();\n bool has_augmenting_path = do_edmonds_search();\n if (!has_augmenting_path) break;\n match += find_maximal();\n clear();\n }\n return match;\n }\n\nprivate:\n void reset_count() {\n time_current_ = 0; time_augment_ = Inf;\n contract_count_ = 0; outer_id_ = 1;\n dsu_changelog_size_ = dsu_changelog_last_ = 0;\n }\n\n void clear() {\n que.clear();\n for (int u = 1; u <= N; ++u) potential[u] = 1;\n for (int u = 1; u <= N; ++u) dsu.par[u] = u;\n for (int t = time_current_; t <= N / 2; ++t) list.head[t] = -1;\n for (int u = 1; u <= N; ++u) blossom.head[u] = -1;\n }\n\n // first phase\n\n inline void grow(int x, int y, int z) {\n label[y] = kInner;\n potential[y] = time_current_; // visited time\n link[z] = {x, y}; label[z] = label[x];\n potential[z] = time_current_ + 1;\n que.enqueue(z);\n }\n\n void contract(int x, int y) {\n int bx = dsu.find(x), by = dsu.find(y);\n const int h = -(++contract_count_) + kInner;\n label[mate[bx]] = label[mate[by]] = h;\n int lca = -1;\n while (1) {\n if (mate[by] != 0) swap(bx, by);\n bx = lca = dsu.find(link[bx].from);\n if (label[mate[bx]] == h) break;\n label[mate[bx]] = h;\n }\n for (auto bv : {dsu.par[x], dsu.par[y]}) {\n for (; bv != lca; bv = dsu.par[link[bv].from]) {\n int mv = mate[bv];\n link[mv] = {x, y}; label[mv] = label[x];\n potential[mv] = 1 + (time_current_ - potential[mv]) + time_current_;\n que.enqueue(mv);\n dsu.par[bv] = dsu.par[mv] = lca;\n dsu_changelog[dsu_changelog_last_++] = {bv, lca};\n dsu_changelog[dsu_changelog_last_++] = {mv, lca};\n }\n }\n }\n\n bool find_augmenting_path() {\n while (!que.empty()) {\n int x = que.dequeue(), lx = label[x], px = potential[x], bx = dsu.find(x);\n for (int eid = ofs[x]; eid < ofs[x + 1]; ++eid) {\n int y = edges[eid].to;\n if (label[y] > 0) { // outer blossom/vertex\n int time_next = (px + potential[y]) >> 1;\n if (lx != label[y]) {\n if (time_next == time_current_) return true;\n time_augment_ = min(time_next, time_augment_);\n } else {\n if (bx == dsu.find(y)) continue;\n if (time_next == time_current_) {\n contract(x, y); bx = dsu.find(x);\n } else if (time_next <= NH) list.push(time_next, eid);\n }\n } else if (label[y] == kFree) { // free vertex\n int time_next = px + 1;\n if (time_next == time_current_) grow(x, y, mate[y]);\n else if (time_next <= NH) list.push(time_next, eid);\n }\n }\n }\n return false;\n }\n\n bool adjust_dual_variables() {\n // Return true if the current matching is maximum.\n const int time_lim = min(NH + 1, time_augment_);\n for (++time_current_; time_current_ <= time_lim; ++time_current_) {\n dsu_changelog_size_ = dsu_changelog_last_;\n if (time_current_ == time_lim) break;\n bool updated = false;\n for (int h = list.head[time_current_]; h >= 0; h = list.next[h]) {\n auto& e = edges[h]; int x = e.from, y = e.to;\n if (label[y] > 0) {\n // Case: outer -- (free => inner => outer)\n if (potential[x] + potential[y] != (time_current_ << 1)) continue;\n if (dsu.find(x) == dsu.find(y)) continue;\n if (label[x] != label[y]) { time_augment_ = time_current_; return false; }\n contract(x, y); updated = true;\n } else if (label[y] == kFree) {\n grow(x, y, mate[y]); updated = true;\n }\n }\n list.head[time_current_] = -1;\n if (updated) return false;\n }\n return time_current_ > NH;\n }\n\n bool do_edmonds_search() {\n label[0] = kFree;\n for (int u = 1; u <= N; ++u) {\n if (mate[u] == 0) {\n que.enqueue(u); label[u] = u; // component id\n } else label[u] = kFree;\n }\n while (1) {\n if (find_augmenting_path()) break;\n bool maximum = adjust_dual_variables();\n if (maximum) return false;\n if (time_current_ == time_augment_) break;\n }\n for (int u = 1; u <= N; ++u) {\n if (label[u] > 0) potential[u] -= time_current_;\n else if (label[u] < 0) potential[u] = 1 + (time_current_ - potential[u]);\n }\n return true;\n }\n\n // second phase\n\n void rematch(int v, int w) {\n int t = mate[v]; mate[v] = w;\n if (mate[t] != v) return;\n if (link[v].to == dsu.find(link[v].to)) {\n mate[t] = link[v].from;\n rematch(mate[t], t);\n } else {\n int x = link[v].from, y = link[v].to;\n rematch(x, y); rematch(y, x);\n }\n }\n\n bool dfs_augment(int x, int bx) {\n int px = potential[x], lx = label[bx];\n for (int eid = ofs[x]; eid < ofs[x + 1]; ++eid) {\n int y = edges[eid].to;\n if (px + potential[y] != 0) continue;\n int by = dsu.find(y), ly = label[by];\n if (ly > 0) { // outer\n if (lx >= ly) continue;\n int stack_beg = stack_last_;\n for (int bv = by; bv != bx; bv = dsu.find(link[bv].from)) {\n int bw = dsu.find(mate[bv]);\n stack[stack_last_++] = bw; link[bw] = {x, y};\n dsu.par[bv] = dsu.par[bw] = bx;\n }\n while (stack_last_ > stack_beg) {\n int bv = stack[--stack_last_];\n for (int v = blossom.head[bv]; v >= 0; v = blossom.next[v]) {\n if (!dfs_augment(v, bx)) continue;\n stack_last_ = stack_beg;\n return true;\n }\n }\n } else if (ly == kFree) {\n label[by] = kInner; int z = mate[by];\n if (z == 0) { rematch(x, y); rematch(y, x); return true; }\n int bz = dsu.find(z);\n link[bz] = {x, y}; label[bz] = outer_id_++;\n for (int v = blossom.head[bz]; v >= 0; v = blossom.next[v]) {\n if (dfs_augment(v, bz)) return true;\n }\n }\n }\n return false;\n }\n\n int find_maximal() {\n // discard blossoms whose potential is 0.\n for (int u = 1; u <= N; ++u) dsu.par[u] = u;\n for (int i = 0; i < dsu_changelog_size_; ++i) {\n dsu.par[dsu_changelog[i].v] = dsu_changelog[i].par;\n }\n for (int u = 1; u <= N; ++u) {\n label[u] = kFree; blossom.push(dsu.find(u), u);\n }\n int ret = 0;\n for (int u = 1; u <= N; ++u) if (!mate[u]) {\n int bu = dsu.par[u];\n if (label[bu] != kFree) continue;\n label[bu] = outer_id_++;\n for (int v = blossom.head[bu]; v >= 0; v = blossom.next[v]) {\n if (!dfs_augment(v, bu)) continue;\n ret += 1;\n break;\n }\n }\n assert(ret >= 1);\n return ret;\n }\n\n // init\n\n void initialize() {\n que = Queue<int>(N);\n\n mate.assign(N + 1, 0);\n potential.assign(N + 1, 1);\n label.assign(N + 1, kFree);\n link.assign(N + 1, {0, 0});\n\n dsu_changelog.resize(N);\n\n dsu = DisjointSetUnion(N + 1);\n list = LinkedList(NH + 1, edges.size());\n\n blossom = LinkedList(N + 1, N + 1);\n stack.resize(N); stack_last_ = 0;\n }\n\nprivate:\n const int N, NH;\n vector<int> ofs; vector<Edge> edges;\n\n Queue<int> que;\n\n vector<int> mate, potential;\n vector<int> label; vector<Link> link;\n\n vector<Log> dsu_changelog; int dsu_changelog_last_, dsu_changelog_size_;\n\n DisjointSetUnion dsu;\n LinkedList list, blossom;\n vector<int> stack; int stack_last_;\n \n int time_current_, time_augment_;\n int contract_count_, outer_id_;\n};\n\nusing Edge = MaximumMatching::Edge;\n\n// main function\n#include <iostream>\n#include <set>\n#include <random>\nvector<pair<int,int> >ve;\nint a[1000],b[1000];\nint main() {\n\n\tint n,aa,bb;\n\tcin>>n>>aa>>bb;\n\tfor(int i=1;i<=n;i++)cin>>a[i]>>b[i];\n\n\t\n\tfor(int i=1;i<=n;i++)if(abs(a[i]-b[i])<=aa || (bb<=abs(a[i]-b[i]) && abs(a[i]-b[i])<=2*aa)){\n\t\t\n\t\tve.push_back(make_pair(i,i+n));\n\t}\n\tfor(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){\n\t\tint f=abs(a[i]+a[j]-b[i]-b[j]);\n\t\tif(f<=aa || (bb<=f && f<=2*aa)) {\n\t\t\tve.push_back(make_pair(i,j));\n\t\t}\n\t}\n\t\n\t\n\t\n\t\n\tmt19937 mt(12345);\n\n auto run = [] (int N, const vector<Edge>& edges) {\n clock_t beg = clock();\n auto mm = MaximumMatching(N, edges);\n auto ans = mm.maximum_matching();\n clock_t end = clock();\n cout<<ans<<endl;\n };\n\n const int K = 2000;\n\n // random\n {\n \tconst int N = K, M = ve.size();\n // uniform_int_distribution<int> urand(1, N);\n vector<Edge> edges(M);\n for (int i = 0; i < M; ++i) {\n \tint u =ve[i].first, v = ve[i].second;\n edges[i] = {u, v};\n }\n run(N, edges);\n }\n\n \n}","accuracy":1,"time_ms":10,"memory_kb":15148,"score_of_the_acc":-0.8793,"final_rank":17},{"submission_id":"aoj_3032_2751473","code_snippet":"// g++ -std=c++11 a.cpp\n#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<random>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<bitset>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#include<typeinfo>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\n//#define int ll\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n// #define mt make_tuple\n//typedef tuple<pii,int,int> tp;\n//typedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\n//template<class C>constexpr int size(const C &c){return (int)c.size();}\n//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}\nconst double PI=acos(-1);\nconst double EPS=1e-7;\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\nstruct edge{int to,cap,rev;};//ikisaki youryou gyakuhen\nclass MF{//max flow\n\tpublic:\n\tint n;\n\tvector<vector<edge> >G;//[MAX];\n\tvector<bool>used;//[MAX];\n\tMF(int size){\n\t\tn=size;\n\t\tG=vector<vector<edge> >(n);\n\t}\n\tvoid add_edge(int from, int to, int cap){\n\t\tedge q={to,cap,int(G[to].size())};\n\t\tG[from].push_back(q);\n\t\tq={from,0,int(G[from].size()-1)};\n\t\tG[to].push_back(q);\n\t}\n\tint dfs(int v,int t, int f) {\n\t\tif(v==t)return f;\n\t\tused[v]=1;\n\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\tedge &e=G[v][i];\n\t\t\tif(used[e.to]||e.cap<=0) continue;\n\t\t\tint d =dfs(e.to,t,min(f,e.cap));\n\t\t\tif(d>0){\n\t\t\t\te.cap-=d;\n\t\t\t\tG[e.to][e.rev].cap+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint mf(int s,int t) {//from s to t,ford_fulkerson\n\t\tint flow=0,f;\n\t\twhile(1){\n\t\t\tused=vector<bool>(n,false);\n\t\t\tf=dfs(s,t,inf);\n\t\t\tif(f==0)return flow;\n\t\t\tflow+=f;\n\t\t}\n\t}\n};\nint main(){\n\tint n,m,a,b;\n\tcin>>n>>a>>b;\n\tvi A,B,in(n);\n\trep(i,n){\n\t\tint q,w;\n\t\tcin>>q>>w;\n\t\tin[i]=q-w;\n\t}\n\tint out=0;\n\trep(i,n)if(abs(in[i])<=a||b<=abs(in[i])&&abs(in[i])<=2*a)out++;\n\telse if(in[i]>0)A.pb(in[i]);\n\telse B.pb(in[i]);\n\t\n\tn=A.size(),m=B.size();\n\tMF mf(2+n+m);\n\tint s=n+m,t=s+1;\n\trep(i,n)mf.add_edge(s,i,1);\n\trep(i,m)mf.add_edge(n+i,t,1);\n\trep(i,n)rep(j,m){\n\t\tint w=abs(A[i]+B[j]);\n\t\tif(w<=a||b<=w&&w<=2*a)mf.add_edge(i,n+j,1);\n\t}\n\tout+=mf.mf(s,t);\n\tcout<<out<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4380,"score_of_the_acc":-0.0689,"final_rank":3},{"submission_id":"aoj_3032_2751354","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\nstatic const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\ntemplate<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }\ntemplate<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }\n#define each(it,o) for(auto it = (o).begin(); it != (o).end(); ++ it)\n#define all(o) (o).begin(), (o).end()\n#define pb(x) push_back(x)\n#define mp(x,y) make_pair((x),(y))\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src_, int dst_, Weight weight_) : src(src_), dst(dst_), weight(weight_) { }\n\tEdge() {};\n};\ntypedef vector<Edge> Edges;\nstruct MaxWeightMatching {\n\tint nEdge, nVertex;\n\tWeight maxWeight;\n\tvi endPoint, mate, label, labelEdge,\n\t\tinBlossom, blossomParent, blossomBase,\n\t\tbestEdge, unusedBlossoms, allowEdge,\n\t\tblossomBestEdgesUsed,\n\t\tsVerteices;\n\tvector<Weight> dualVar;\n\tvector<vi> neighbEnd, blossomChilds, blossomEdges,\n\t\tblossomBestEdges;\n\tEdges edges;\n\tbool maxCardinality;\n\n\tWeight slack(int k) {\n\t\tEdge &e = edges[k];\n\t\treturn dualVar[e.src] + dualVar[e.dst] - 2 * e.weight;\n\t}\n\tstruct BlossomLeaves {\n\t\tint b;\n\t\tMaxWeightMatching *mw;\n\t\tenum { INITAL, END, NEXT, THIRD } state;\n\t\tvi::const_iterator iter, endi;\n\t\tBlossomLeaves *bl;\n\t\tBlossomLeaves(MaxWeightMatching *mw_, int b_) :\n\t\t\tmw(mw_), b(b_), state(INITAL), bl(NULL) {}\n\t\tbool next(int &r) {\n\t\t\tint t;\n\t\t\tswitch (state) {\n\t\t\tcase INITAL:\n\t\t\t\tif (b < mw->nVertex) {\n\t\t\t\t\tr = b;\n\t\t\t\t\tstate = END;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\titer = mw->blossomChilds[b].begin();\n\t\t\t\t\tendi = mw->blossomChilds[b].end();\n\t\t\t\t\tstate = NEXT;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\tcase END:\n\t\t\t\treturn false;\n\t\t\tcase NEXT:\n\t\t\t\tif (iter == endi)\n\t\t\t\t\treturn false;\n\t\t\t\tt = *iter;\n\t\t\t\t++iter;\n\t\t\t\tif (t < mw->nVertex) {\n\t\t\t\t\tr = t;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbl = new BlossomLeaves(mw, t);\n\t\t\t\t\tstate = THIRD;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\tcase THIRD:\n\t\t\t\tif (!bl->next(t)) {\n\t\t\t\t\tstate = NEXT;\n\t\t\t\t\tdelete bl; bl = NULL;\n\t\t\t\t\treturn next(r);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tr = t;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t};\n\tvoid assignLabel(int w, int t, int p) {\n\t\tint b = inBlossom[w];\n\t\tlabel[w] = label[b] = t;\n\t\tlabelEdge[w] = labelEdge[b] = p;\n\t\tbestEdge[w] = bestEdge[b] = -1;\n\t\tif (t == 1) {\n\t\t\tBlossomLeaves bl(this, b);\n\t\t\tfor (int r; bl.next(r); ) sVerteices.push_back(r);\n\t\t}\n\t\telse if (t == 2) {\n\t\t\tint base = blossomBase[b];\n\t\t\tassignLabel(endPoint[mate[base]], 1, mate[base] ^ 1);\n\t\t}\n\t}\n\tint scanBlossom(int v, int w) {\n\t\tvi path;\n\t\tint base = -1;\n\t\twhile (v != -1) {\n\t\t\tint b = inBlossom[v];\n\t\t\tif (label[b] & 4) {\n\t\t\t\tbase = blossomBase[b];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tpath.push_back(b);\n\t\t\tlabel[b] = 5;\n\t\t\tif (labelEdge[b] == -1) {\n\t\t\t\tv = -1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tv = endPoint[labelEdge[b]];\n\t\t\t\tb = inBlossom[v];\n\t\t\t\tv = endPoint[labelEdge[b]];\n\t\t\t}\n\t\t\tif (w != -1)\n\t\t\t\tswap(v, w);\n\t\t}\n\t\teach(it, path)\n\t\t\tlabel[*it] = 1;\n\t\treturn base;\n\t}\n\tvoid addBlossom(int base, int k) {\n\t\tEdge &e = edges[k];\n\t\tint bb = inBlossom[base],\n\t\t\tbv = inBlossom[e.src],\n\t\t\tbw = inBlossom[e.dst];\n\t\tint b = unusedBlossoms.back(); unusedBlossoms.pop_back();\n\t\tblossomBase[b] = base;\n\t\tblossomParent[b] = -1;\n\t\tblossomParent[bb] = b;\n\t\tblossomChilds[b].clear();\n\t\tblossomEdges[b].clear();\n\t\tvi &bChilds = blossomChilds[b];\n\t\tvi &bEdges = blossomEdges[b];\n\t\twhile (bv != bb) {\n\t\t\tblossomParent[bv] = b;\n\t\t\tbChilds.push_back(bv);\n\t\t\tbEdges.push_back(labelEdge[bv]);\n\t\t\tbv = inBlossom[endPoint[labelEdge[bv]]];\n\t\t}\n\t\tbChilds.push_back(bb);\n\t\treverse(all(bChilds));\n\t\treverse(all(bEdges));\n\t\tbEdges.push_back(2 * k);\n\t\twhile (bw != bb) {\n\t\t\tblossomParent[bw] = b;\n\t\t\tbChilds.push_back(bw);\n\t\t\tbEdges.push_back(labelEdge[bw] ^ 1);\n\t\t\tbw = inBlossom[endPoint[labelEdge[bw]]];\n\t\t}\n\t\tlabel[b] = 1;\n\t\tlabelEdge[b] = labelEdge[bb];\n\t\tdualVar[b] = 0;\n\t\tBlossomLeaves bl(this, b);\n\t\tfor (int v; bl.next(v); ) {\n\t\t\tif (label[inBlossom[v]] == 2)\n\t\t\t\tsVerteices.push_back(v);\n\t\t\tinBlossom[v] = b;\n\t\t}\n\t\tvi bestEdgeTo(2 * nVertex, -1);\n\t\teach(it, bChilds) {\n\t\t\tint bv2 = *it;\n\t\t\tvector<vi> nbLists;\n\t\t\tif (!blossomBestEdgesUsed[bv2]) {\n\t\t\t\tBlossomLeaves bl2(this, bv2);\n\t\t\t\tfor (int v2; bl2.next(v2); ) {\n\t\t\t\t\tnbLists.push_back(neighbEnd[v2]);\n\t\t\t\t\tvi &vv = nbLists.back();\n\t\t\t\t\teach(i, vv)\n\t\t\t\t\t\t*i /= 2;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnbLists.push_back(blossomBestEdges[bv2]);\n\t\t\t}\n\t\t\teach(itt, nbLists) {\n\t\t\t\teach(ittt, *itt) {\n\t\t\t\t\tint k2 = *ittt;\n\t\t\t\t\tEdge &e2 = edges[k2];\n\t\t\t\t\tint i = e2.src, j = e2.dst;\n\t\t\t\t\tif (inBlossom[j] == b)\n\t\t\t\t\t\tswap(i, j);\n\t\t\t\t\tint bj = inBlossom[j];\n\t\t\t\t\tif (bj != b && label[bj] == 1 &&\n\t\t\t\t\t\t(bestEdgeTo[bj] == -1 ||\n\t\t\t\t\t\t\tslack(k2) < slack(bestEdgeTo[bj]))) {\n\t\t\t\t\t\tbestEdgeTo[bj] = k2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tblossomBestEdgesUsed[bv2] = false;\n\t\t\tblossomBestEdges[bv2].clear();\n\t\t\tbestEdge[bv2] = -1;\n\t\t}\n\t\tblossomBestEdgesUsed[b] = true;\n\t\tblossomBestEdges[b].clear();\n\t\teach(it, bestEdgeTo)\n\t\t\tif (*it != -1)\n\t\t\t\tblossomBestEdges[b].push_back(*it);\n\t\tbestEdge[b] = -1;\n\t\teach(it, blossomBestEdges[b])\n\t\t\tif (bestEdge[b] == -1 || slack(*it) < slack(bestEdge[b]))\n\t\t\t\tbestEdge[b] = *it;\n\t}\n\tvoid expandBlossom(int b, bool endStage) {\n\t\tint cSize = blossomChilds[b].size();\n\t\teach(it, blossomChilds[b]) {\n\t\t\tint s = *it;\n\t\t\tblossomParent[s] = -1;\n\t\t\tif (s < nVertex)\n\t\t\t\tinBlossom[s] = s;\n\t\t\telse if (endStage && dualVar[s] == 0)\n\t\t\t\texpandBlossom(s, endStage);\n\t\t\telse {\n\t\t\t\tBlossomLeaves bl(this, s);\n\t\t\t\tfor (int v; bl.next(v); )\n\t\t\t\t\tinBlossom[v] = s;\n\t\t\t}\n\t\t}\n\t\tif (!endStage && label[b] == 2) {\n\t\t\tint entryChild = inBlossom[endPoint[labelEdge[b] ^ 1]];\n\t\t\tint j = find(all(blossomChilds[b]), entryChild) - blossomChilds[b].begin();\n\t\t\tint jStep, evenOdd;\n\t\t\tif (j & 1)\n\t\t\t\tjStep = 1, evenOdd = 0;\n\t\t\telse\n\t\t\t\tjStep = -1, evenOdd = 1;\n\t\t\tint p = labelEdge[b];\n\t\t\twhile (j != 0) {\n\t\t\t\tlabel[endPoint[p ^ 1]] = 0;\n\t\t\t\tlabel[endPoint[blossomEdges[b][j - evenOdd] ^ evenOdd ^ 1]] = 0;\n\t\t\t\tassignLabel(endPoint[p ^ 1], 2, p);\n\t\t\t\tallowEdge[blossomEdges[b][j - evenOdd] / 2] = true;\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t\tp = blossomEdges[b][j - evenOdd] ^ evenOdd;\n\t\t\t\tallowEdge[p / 2] = true;\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t}\n\t\t\tint bv = blossomChilds[b][j];\n\t\t\tlabel[endPoint[p ^ 1]] = label[bv] = 2;\n\t\t\tlabelEdge[endPoint[p ^ 1]] = labelEdge[bv] = p;\n\t\t\tbestEdge[bv] = -1;\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\twhile (blossomChilds[b][j] != entryChild) {\n\t\t\t\tbv = blossomChilds[b][j];\n\t\t\t\tif (label[bv] == 1) {\n\t\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tBlossomLeaves bl(this, bv);\n\t\t\t\tint v;\n\t\t\t\twhile (bl.next(v))\n\t\t\t\t\tif (label[v] != 0)\n\t\t\t\t\t\tbreak;\n\t\t\t\tif (label[v] != 0) {\n\t\t\t\t\tlabel[v] = 0;\n\t\t\t\t\tlabel[endPoint[mate[blossomBase[bv]]]] = 0;\n\t\t\t\t\tassignLabel(v, 2, labelEdge[v]);\n\t\t\t\t}\n\t\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\t}\n\t\t}\n\t\tlabel[b] = labelEdge[b] = -1;\n\t\tblossomChilds[b].clear();\n\t\tblossomEdges[b].clear();\n\t\tblossomBestEdgesUsed[b] = false;\n\t\tblossomBestEdges[b].clear();\n\t\tbestEdge[b] = -1;\n\t\tunusedBlossoms.push_back(b);\n\t}\n\tvoid augmentBlossom(int b, int v) {\n\t\tint cSize = blossomChilds[b].size();\n\t\tint t = v;\n\t\twhile (blossomParent[t] != b)\n\t\t\tt = blossomParent[t];\n\t\tif (t >= nVertex)\n\t\t\taugmentBlossom(t, v);\n\t\tint i, j, jStep, evenOdd;\n\t\ti = j = find(all(blossomChilds[b]), t) - blossomChilds[b].begin();\n\t\tif (i & 1)\n\t\t\tjStep = 1, evenOdd = 0;\n\t\telse\n\t\t\tjStep = -1, evenOdd = 1;\n\t\twhile (j != 0) {\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\tt = blossomChilds[b][j];\n\t\t\tint p = blossomEdges[b][j - evenOdd] ^ evenOdd;\n\t\t\tif (t >= nVertex)\n\t\t\t\taugmentBlossom(t, endPoint[p]);\n\t\t\tj = (j + jStep + cSize) % cSize;\n\t\t\tt = blossomChilds[b][j];\n\t\t\tif (t >= nVertex)\n\t\t\t\taugmentBlossom(t, endPoint[p ^ 1]);\n\t\t\tmate[endPoint[p]] = p ^ 1;\n\t\t\tmate[endPoint[p ^ 1]] = p;\n\t\t}\n\t\trotate(blossomChilds[b].begin(), blossomChilds[b].begin() + i, blossomChilds[b].end());\n\t\trotate(blossomEdges[b].begin(), blossomEdges[b].begin() + i, blossomEdges[b].end());\n\t\tblossomBase[b] = blossomBase[blossomChilds[b][0]];\n\t}\n\tvoid augmentMatching(int k) {\n\t\tEdge &e = edges[k];\n\t\tint v = e.src, w = e.dst;\n\t\trep(ii, 2) {\n\t\t\tint s = ii == 0 ? v : w, p = ii == 0 ? 2 * k + 1 : 2 * k;\n\t\t\twhile (true) {\n\t\t\t\tint bs = inBlossom[s];\n\t\t\t\tif (bs >= nVertex)\n\t\t\t\t\taugmentBlossom(bs, s);\n\t\t\t\tmate[s] = p;\n\t\t\t\tif (labelEdge[bs] == -1)\n\t\t\t\t\tbreak;\n\t\t\t\tint bt = inBlossom[endPoint[labelEdge[bs]]];\n\t\t\t\ts = endPoint[labelEdge[bt]];\n\t\t\t\tint j = endPoint[labelEdge[bt] ^ 1];\n\t\t\t\tif (bt >= nVertex)\n\t\t\t\t\taugmentBlossom(bt, j);\n\t\t\t\tmate[j] = labelEdge[bt];\n\t\t\t\tp = labelEdge[bt] ^ 1;\n\t\t\t}\n\t\t}\n\t}\n\tvoid mainLoop() {\n\t\trep(t, nVertex) {\n\t\t\tlabel.assign(2 * nVertex, 0);\n\t\t\tbestEdge.assign(2 * nVertex, -1);\n\t\t\tfill(blossomBestEdgesUsed.begin() + nVertex, blossomBestEdgesUsed.end(), false);\n\t\t\tallowEdge.assign(nEdge, false);\n\t\t\tsVerteices.clear();\n\t\t\trep(v, nVertex)\n\t\t\t\tif (mate[v] == -1 && label[inBlossom[v]] == 0)\n\t\t\t\t\tassignLabel(v, 1, -1);\n\t\t\tbool augmented = false;\n\t\t\twhile (true) {\n\t\t\t\tWeight kSlack;\n\t\t\t\twhile (!sVerteices.empty() && !augmented) {\n\t\t\t\t\tint v = sVerteices.back(); sVerteices.pop_back();\n\t\t\t\t\teach(it, neighbEnd[v]) {\n\t\t\t\t\t\tint p = *it;\n\t\t\t\t\t\tint k = p / 2, w = endPoint[p];\n\t\t\t\t\t\tif (inBlossom[v] == inBlossom[w])\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tif (!allowEdge[k]) {\n\t\t\t\t\t\t\tkSlack = slack(k);\n\t\t\t\t\t\t\tif (kSlack <= 0)\n\t\t\t\t\t\t\t\tallowEdge[k] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (allowEdge[k]) {\n\t\t\t\t\t\t\tif (label[inBlossom[w]] == 0) {\n\t\t\t\t\t\t\t\tassignLabel(w, 2, p ^ 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (label[inBlossom[w]] == 1) {\n\t\t\t\t\t\t\t\tint base = scanBlossom(v, w);\n\t\t\t\t\t\t\t\tif (base >= 0) {\n\t\t\t\t\t\t\t\t\taddBlossom(base, k);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\taugmentMatching(k);\n\t\t\t\t\t\t\t\t\taugmented = true;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (label[w] == 0) {\n\t\t\t\t\t\t\t\tlabel[w] = 2;\n\t\t\t\t\t\t\t\tlabelEdge[w] = p ^ 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[inBlossom[w]] == 1) {\n\t\t\t\t\t\t\tint b = inBlossom[v];\n\t\t\t\t\t\t\tif (bestEdge[b] == -1 || kSlack < slack(bestEdge[b]))\n\t\t\t\t\t\t\t\tbestEdge[b] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[w] == 0) {\n\t\t\t\t\t\t\tif (bestEdge[w] == -1 || kSlack < slack(bestEdge[w]))\n\t\t\t\t\t\t\t\tbestEdge[w] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (augmented)\n\t\t\t\t\tbreak;\n\t\t\t\tint deltaType = -1;\n\t\t\t\tWeight delta;\n\t\t\t\tint deltaEdge, deltaBlossom;\n\t\t\t\tif (!maxCardinality) {\n\t\t\t\t\tdeltaType = 1;\n\t\t\t\t\tdelta = *min_element(dualVar.begin(), dualVar.begin() + nVertex);\n\t\t\t\t}\n\t\t\t\trep(v, nVertex) {\n\t\t\t\t\tif (label[inBlossom[v]] == 0 && bestEdge[v] != -1) {\n\t\t\t\t\t\tWeight d = slack(bestEdge[v]);\n\t\t\t\t\t\tif (deltaType == -1 || d < delta) {\n\t\t\t\t\t\t\tdelta = d;\n\t\t\t\t\t\t\tdeltaType = 2;\n\t\t\t\t\t\t\tdeltaEdge = bestEdge[v];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(b, 2 * nVertex) {\n\t\t\t\t\tif (blossomParent[b] == -1 && label[b] == 1 && bestEdge[b] != -1) {\n\t\t\t\t\t\tkSlack = slack(bestEdge[b]);\n\t\t\t\t\t\tWeight d = kSlack / 2;\n\t\t\t\t\t\tif (deltaType == -1 || d < delta) {\n\t\t\t\t\t\t\tdelta = d;\n\t\t\t\t\t\t\tdeltaType = 3;\n\t\t\t\t\t\t\tdeltaEdge = bestEdge[b];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treu(b, nVertex, 2 * nVertex) {\n\t\t\t\t\tif (blossomBase[b] >= 0 && blossomParent[b] == -1 &&\n\t\t\t\t\t\tlabel[b] == 2 &&\n\t\t\t\t\t\t(deltaType == -1 || dualVar[b] < delta)) {\n\t\t\t\t\t\tdelta = dualVar[b];\n\t\t\t\t\t\tdeltaType = 4;\n\t\t\t\t\t\tdeltaBlossom = b;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (deltaType == -1) {\n\t\t\t\t\tdeltaType = 1;\n\t\t\t\t\tdelta = max((Weight)0, *min_element(dualVar.begin(), dualVar.begin() + nVertex));\n\t\t\t\t}\n\t\t\t\trep(v, nVertex) {\n\t\t\t\t\tif (label[inBlossom[v]] == 1) {\n\t\t\t\t\t\tdualVar[v] -= delta;\n\t\t\t\t\t}\n\t\t\t\t\telse if (label[inBlossom[v]] == 2) {\n\t\t\t\t\t\tdualVar[v] += delta;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treu(b, nVertex, 2 * nVertex) {\n\t\t\t\t\tif (blossomBase[b] >= 0 && blossomParent[b] == -1) {\n\t\t\t\t\t\tif (label[b] == 1) {\n\t\t\t\t\t\t\tdualVar[b] += delta;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (label[b] == 2) {\n\t\t\t\t\t\t\tdualVar[b] -= delta;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (deltaType == 1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 2) {\n\t\t\t\t\tallowEdge[deltaEdge] = true;\n\t\t\t\t\tEdge &e = edges[deltaEdge];\n\t\t\t\t\tint i = e.src, j = e.dst;\n\t\t\t\t\tif (label[inBlossom[i]] == 0)\n\t\t\t\t\t\tswap(i, j);\n\t\t\t\t\tsVerteices.push_back(i);\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 3) {\n\t\t\t\t\tallowEdge[deltaEdge] = true;\n\t\t\t\t\tEdge &e = edges[deltaEdge];\n\t\t\t\t\tint i = e.src;\n\t\t\t\t\tsVerteices.push_back(i);\n\t\t\t\t}\n\t\t\t\telse if (deltaType == 4) {\n\t\t\t\t\texpandBlossom(deltaBlossom, false);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!augmented)\n\t\t\t\tbreak;\n\t\t\treu(b, nVertex, 2 * nVertex)\n\t\t\t\tif (blossomParent[b] == -1 && blossomBase[b] >= 0 &&\n\t\t\t\t\tlabel[b] == 1 && dualVar[b] == 0)\n\t\t\t\t\texpandBlossom(b, true);\n\t\t}\n\t}\n\tvi matching(const Edges& edges_, bool maxCardinality_ = false) {\n\t\tedges = edges_; maxCardinality = maxCardinality_;\n\t\tnEdge = edges.size();\n\t\tnVertex = 0;\n\t\teach(i, edges) {\n\t\t\tif (i->src >= nVertex) nVertex = i->src + 1;\n\t\t\tif (i->dst >= nVertex) nVertex = i->dst + 1;\n\t\t}\n\t\tmaxWeight = 0;\n\t\tendPoint.clear();\n\t\tneighbEnd.assign(nVertex, vi());\n\t\trep(i, nEdge) {\n\t\t\tEdge &e = edges[i];\n\t\t\tmaxWeight = max(maxWeight, e.weight);\n\t\t\tendPoint.push_back(e.src);\n\t\t\tendPoint.push_back(e.dst);\n\t\t\tneighbEnd[e.src].push_back(2 * i + 1);\n\t\t\tneighbEnd[e.dst].push_back(2 * i);\n\t\t}\n\t\tmate.assign(nVertex, -1);\n\t\tlabel.assign(2 * nVertex, 0);\n\t\tlabelEdge.assign(2 * nVertex, -1);\n\t\tinBlossom.clear();\n\t\tblossomBase.clear();\n\t\tblossomParent.assign(2 * nVertex, -1);\n\t\tblossomChilds.assign(2 * nVertex, vi());\n\t\tblossomEdges.assign(2 * nVertex, vi());\n\t\tbestEdge.assign(2 * nVertex, -1);\n\t\tblossomBestEdgesUsed.assign(2 * nVertex, false);\n\t\tblossomBestEdges.assign(2 * nVertex, vi());\n\t\tunusedBlossoms.clear();\n\t\tdualVar.clear();\n\t\trep(i, nVertex)\n\t\t\tinBlossom.push_back(i),\n\t\t\tblossomBase.push_back(i),\n\t\t\tunusedBlossoms.push_back(nVertex + i),\n\t\t\tdualVar.push_back(maxWeight);\n\t\trep(i, nVertex)\n\t\t\tblossomBase.push_back(-1),\n\t\t\tdualVar.push_back(0);\n\t\tallowEdge.assign(nEdge, 0);\n\t\tsVerteices = vi();\n\t\tmainLoop();\n\t\trep(v, nVertex)\n\t\t\tif (mate[v] >= 0)\n\t\t\t\tmate[v] = endPoint[mate[v]];\n\t\treturn mate;\n\t}\n\tWeight getWeight(const Edges& e, bool maxCardinality_ = false) {\n\t\tvector<int> v = matching(e, maxCardinality_);\n\t\tWeight w = 0;\n\t\trep(i, v.size()) if (v[i] != -1)\n\t\t\teach(j, e) if (i == j->src && j->dst == v[i]) w += j->weight;\n\t\treturn w;\n\t}\n};\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint N, A, B; cin >> N >> A >> B;\n\tvector<int> a(N), b(N); for (int i = 0; i < N; i++) {\n\t\tcin >> a[i] >> b[i];\n\t}\n\n\tint ans = 0;\n\tvector<bool> used(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tif (abs(a[i] - b[i]) <= A || (abs(a[i] - b[i]) >= B&&abs(a[i] - b[i]) <= 2 * A)) {\n\t\t\tans++;\n\t\t\tused[i] = true;\n\t\t\tdump(i);\n\t\t}\n\t}\n\tEdges edges;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (used[i])continue;\n\t\tfor (int j = i + 1; j < N; j++) {\n\t\t\tif (used[j])continue;\n\t\t\tdump(i, j, abs(a[i] + a[j] - b[i] - b[j]));\n\t\t\tif (abs(a[i] + a[j] - b[i] - b[j]) <= A || (abs(a[i] + a[j] - b[i] - b[j]) >= B&&abs(a[i] + a[j] - b[i] - b[j]) <= 2 * A)) {\n\t\t\t\tedges.emplace_back(i, j, 1);\n\t\t\t}\n\t\t}\n\t}\n\tMaxWeightMatching mwm;\n\tans += mwm.getWeight(edges);\n\tcout << ans << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4784,"score_of_the_acc":-0.0993,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_3032_5853683\",\n \"code_snippet\": \"// #include <algorithm>\\n#include <cassert>\\n#include <cmath>\\n#include <ctime>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\ntemplate <int M>\\nstruct MInt {\\n unsigned int val;\\n MInt(): val(0) {}\\n MInt(long long x) : val(x >= 0 ? x % M : x % M + M) {}\\n static constexpr int get_mod() { return M; }\\n static void set_mod(int divisor) { assert(divisor == M); }\\n static void init(int x = 10000000) { inv(x, true); fact(x); fact_inv(x); }\\n static MInt inv(int x, bool init = false) {\\n // assert(0 <= x && x < M && std::__gcd(x, M) == 1);\\n static std::vector<MInt> inverse{0, 1};\\n int prev = inverse.size();\\n if (init && x >= prev) {\\n // \\\"x!\\\" and \\\"M\\\" must be disjoint.\\n inverse.resize(x + 1);\\n for (int i = prev; i <= x; ++i) inverse[i] = -inverse[M % i] * (M / i);\\n }\\n if (x < inverse.size()) return inverse[x];\\n unsigned int a = x, b = M; int u = 1, v = 0;\\n while (b) {\\n unsigned int q = a / b;\\n std::swap(a -= q * b, b);\\n std::swap(u -= q * v, v);\\n }\\n return u;\\n }\\n static MInt fact(int x) {\\n static std::vector<MInt> f{1};\\n int prev = f.size();\\n if (x >= prev) {\\n f.resize(x + 1);\\n for (int i = prev; i <= x; ++i) f[i] = f[i - 1] * i;\\n }\\n return f[x];\\n }\\n static MInt fact_inv(int x) {\\n static std::vector<MInt> finv{1};\\n int prev = finv.size();\\n if (x >= prev) {\\n finv.resize(x + 1);\\n finv[x] = inv(fact(x).val);\\n for (int i = x; i > prev; --i) finv[i - 1] = finv[i] * i;\\n }\\n return finv[x];\\n }\\n static MInt nCk(int n, int k) {\\n if (n < 0 || n < k || k < 0) return 0;\\n if (n - k > k) k = n - k;\\n return fact(n) * fact_inv(k) * fact_inv(n - k);\\n }\\n static MInt nPk(int n, int k) { return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k); }\\n static MInt nHk(int n, int k) { return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k)); }\\n static MInt large_nCk(long long n, int k) {\\n if (n < 0 || n < k || k < 0) return 0;\\n inv(k, true);\\n MInt res = 1;\\n for (int i = 1; i <= k; ++i) res *= inv(i) * n--;\\n return res;\\n }\\n MInt pow(long long exponent) const {\\n MInt tmp = *this, res = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n MInt &operator+=(const MInt &x) { if((val += x.val) >= M) val -= M; return *this; }\\n MInt &operator-=(const MInt &x) { if((val += M - x.val) >= M) val -= M; return *this; }\\n MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % M; return *this; }\\n MInt &operator/=(const MInt &x) { return *this *= inv(x.val); }\\n bool operator==(const MInt &x) const { return val == x.val; }\\n bool operator!=(const MInt &x) const { return val != x.val; }\\n bool operator<(const MInt &x) const { return val < x.val; }\\n bool operator<=(const MInt &x) const { return val <= x.val; }\\n bool operator>(const MInt &x) const { return val > x.val; }\\n bool operator>=(const MInt &x) const { return val >= x.val; }\\n MInt &operator++() { if (++val == M) val = 0; return *this; }\\n MInt operator++(int) { MInt res = *this; ++*this; return res; }\\n MInt &operator--() { val = (val == 0 ? M : val) - 1; return *this; }\\n MInt operator--(int) { MInt res = *this; --*this; return res; }\\n MInt operator+() const { return *this; }\\n MInt operator-() const { return MInt(val ? M - val : 0); }\\n MInt operator+(const MInt &x) const { return MInt(*this) += x; }\\n MInt operator-(const MInt &x) const { return MInt(*this) -= x; }\\n MInt operator*(const MInt &x) const { return MInt(*this) *= x; }\\n MInt operator/(const MInt &x) const { return MInt(*this) /= x; }\\n friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }\\n friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }\\n};\\nnamespace std { template <int M> MInt<M> abs(const MInt<M> &x) { return x; } }\\n\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, std::vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(long long exponent) const {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n for (int i = 0; i < n; ++i) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const std::vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline std::vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &x) {\\n int m = x.height(), n = x.width();\\n dat.resize(m, std::vector<T>(n));\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] = x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &x) {\\n int m = height(), n = width();\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] += x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &x) {\\n int m = height(), n = width();\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) dat[i][j] -= x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &x) {\\n int m = height(), n = x.width(), l = width();\\n std::vector<std::vector<T>> res(m, std::vector<T>(n, 0));\\n for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) {\\n for (int k = 0; k < l; ++k) res[i][j] += dat[i][k] * x[k][j];\\n }\\n std::swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\\n\\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\\n\\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\\n\\nprivate:\\n std::vector<std::vector<T>> dat;\\n};\\n\\ntemplate <typename T>\\nint gauss_jordan(Matrix<T> &mat, const T EPS = 1e-8, bool is_extended = false) {\\n int m = mat.height(), n = mat.width(), rank = 0;\\n for (int col = 0; col < n; ++col) {\\n if (is_extended && col == n - 1) break;\\n int pivot = -1;\\n T mx = EPS;\\n for (int row = rank; row < m; ++row) {\\n if (std::abs(mat[row][col]) > mx) {\\n pivot = row;\\n mx = std::abs(mat[row][col]);\\n }\\n }\\n if (pivot == -1) continue;\\n std::swap(mat[rank], mat[pivot]);\\n T tmp = mat[rank][col];\\n for (int col2 = 0; col2 < n; ++col2) mat[rank][col2] /= tmp;\\n for (int row = 0; row < m; ++row) {\\n if (row != rank && std::abs(mat[row][col]) > EPS) {\\n tmp = mat[row][col];\\n for (int col2 = 0; col2 < n; ++col2) mat[row][col2] -= mat[rank][col2] * tmp;\\n }\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\nstruct Xor128 {\\n int rand() {\\n unsigned int t = x ^ (x << 11);\\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n return static_cast<int>(w);\\n }\\n int rand(int ub) {\\n int res = rand() % ub;\\n return res < 0 ? res + ub : res;\\n }\\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\\n long long randll() {\\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\\n return static_cast<long long>(res | rand());\\n }\\n long long randll(long long ub) {\\n long long res = randll() % ub;\\n return res < 0 ? res + ub : res;\\n }\\n long long randll(long long lb, long long ub) { return lb + randll(ub - lb); }\\nprivate:\\n unsigned int x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned int>(std::time(nullptr));\\n} xor128;\\n\\nint maximum_matching(const std::vector<std::vector<int>> &graph) {\\n constexpr int P = 1000000007;\\n using ModInt = MInt<P>;\\n ModInt::set_mod(P);\\n const int n = graph.size();\\n Matrix<ModInt> tutte_matrix(n, n, 0);\\n for (int i = 0; i < n; ++i) {\\n for (const int j : graph[i]) {\\n if (j > i) {\\n const ModInt x = xor128.rand(1, P);\\n tutte_matrix[i][j] = x;\\n tutte_matrix[j][i] = -x;\\n }\\n }\\n }\\n return gauss_jordan(tutte_matrix, ModInt(0)) / 2;\\n}\\n\\nint main() {\\n int n, A, B;\\n std::cin >> n >> A >> B;\\n int ans = 0;\\n std::vector<int> a, b;\\n while (n--) {\\n int a_i, b_i;\\n std::cin >> a_i >> b_i;\\n const int x = std::abs(a_i - b_i);\\n if (x <= A || (B <= x && x <= 2 * A)) {\\n ++ans;\\n } else {\\n a.emplace_back(a_i);\\n b.emplace_back(b_i);\\n }\\n }\\n n = a.size();\\n if (n > 0) {\\n std::vector<std::vector<int>> graph(n);\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n const int x = std::abs((a[i] + a[j]) - (b[i] + b[j]));\\n if (x <= A || (B <= x && x <= 2 * A)) {\\n graph[i].emplace_back(j);\\n graph[j].emplace_back(i);\\n }\\n }\\n }\\n ans += maximum_matching(graph);\\n }\\n std::cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 5328,\n \"score_of_the_acc\": -0.7619,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3032_4772385\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n#define rep2(i, x, n) for(int i = x; i <= n; i++)\\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\\n#define elif else if\\n#define sp(x) fixed << setprecision(x)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)x.size()\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\nconst ll MOD = 1e9+7;\\n//const ll MOD = 998244353;\\nconst int inf = (1<<30)-1;\\nconst ll INF = (1LL<<60)-1;\\nconst ld EPS = 1e-10;\\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\\n\\ntemplate<typename T>\\nstruct Max_Flow{\\n struct edge{\\n int to; T cap; int rev;\\n edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}\\n };\\n\\n vector<vector<edge>> es;\\n vector<bool> used;\\n const T INF_T;\\n\\n Max_Flow(int n) : INF_T(numeric_limits<T>::max()){\\n es.resize(n), used.resize(n);\\n }\\n\\n void add_edge(int from, int to, T cap, bool directed = true){\\n es[from].eb(to, cap, sz(es[to]));\\n es[to].eb(from, directed? 0 : cap, sz(es[from])-1);\\n }\\n\\n T dfs(int now, int t, T flow){\\n if(now == t) return flow;\\n used[now] = true;\\n for(auto &e: es[now]){\\n if(!used[e.to] && e.cap > 0){\\n T f = dfs(e.to, t, min(flow, e.cap));\\n if(f > 0){\\n e.cap -= f;\\n es[e.to][e.rev].cap += f;\\n return f;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n T max_flow(int s, int t){\\n T flow = 0;\\n for(;;){\\n fill(all(used), false);\\n T f = dfs(s, t, INF_T);\\n if(f == 0) return flow;\\n flow += f;\\n }\\n }\\n};\\n\\nint main(){\\n int N, A, B;\\n cin >> N >> A >> B;\\n int a[N], b[N];\\n bool used[N];\\n fill(used, used+N, false);\\n int ans = 0;\\n rep(i, N){\\n cin >> a[i] >> b[i];\\n a[i] -= b[i];\\n int tmp = abs(a[i]);\\n if(tmp <= A || (B <= tmp && tmp <= 2*A)) ans++, used[i] = true;\\n }\\n Max_Flow<int> G(2*N+2);\\n int s = 2*N, t = 2*N+1;\\n rep(i, N) G.add_edge(s, i, 1), G.add_edge(N+i, t, 1);\\n rep(i, N){\\n if(used[i] || a[i] < 0) continue;\\n rep(j, N){\\n if(used[j]) continue;\\n int tmp = abs(a[i]+a[j]);\\n if(tmp <= A || (B <= tmp && tmp <= 2*A)) G.add_edge(i, N+j, 1);\\n }\\n }\\n cout << ans+G.max_flow(s, t) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4296,\n \"score_of_the_acc\": -0.0626,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3032_4092716\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll = long long;\\ntemplate <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;\\nconst int INF = 0x3f3f3f3f;\\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n// const int MOD = 998244353;\\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\n// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1, 1};\\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\\ntemplate <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n }\\n} iosetup;\\n\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(ll exponent) {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n REP(i, n) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &x) {\\n int m = x.height(), n = x.width();\\n dat.resize(m, vector<T>(n));\\n REP(i, m) REP(j, n) dat[i][j] = x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &x) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] += x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &x) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] -= x[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &x) {\\n int m = height(), n = x.width(), l = width();\\n vector<vector<T> > res(m, vector<T>(n, 0));\\n REP(i, m) REP(j, n) {\\n REP(k, l) res[i][j] += dat[i][k] * x[k][j];\\n }\\n swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &x) const { return Matrix(*this) += x; }\\n\\n Matrix operator-(const Matrix &x) const { return Matrix(*this) -= x; }\\n\\n Matrix operator*(const Matrix &x) const { return Matrix(*this) *= x; }\\n\\nprivate:\\n vector<vector<T> > dat;\\n};\\n\\ntemplate <typename T>\\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\\n int m = mat.height(), n = mat.width(), rank = 0;\\n REP(col, n) {\\n if (is_extended && col == n - 1) break;\\n int pivot = -1;\\n T mx = EPS;\\n FOR(row, rank, m) {\\n if (abs(mat[row][col]) > mx) {\\n pivot = row;\\n mx = abs(mat[row][col]);\\n }\\n }\\n if (pivot == -1) continue;\\n swap(mat[rank], mat[pivot]);\\n T tmp = mat[rank][col];\\n REP(col2, n) mat[rank][col2] /= tmp;\\n REP(row, m) {\\n if (row != rank && abs(mat[row][col]) > EPS) {\\n tmp = mat[row][col];\\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\\n }\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\nstruct Xor128 {\\n int rand() {\\n unsigned t = x ^ (x << 11);\\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n return static_cast<int>(w);\\n }\\n int rand(int ub) {\\n int res = rand() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\\n ll randll() {\\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\\n return static_cast<ll>(res | rand());\\n }\\n ll randll(ll ub) {\\n ll res = randll() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n ll randll(ll lb, ll ub) { return lb + rand(ub - lb); }\\nprivate:\\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\\n} xor128;\\n\\nint tutte_theorem(const vector<vector<int> > &graph) {\\n int n = graph.size();\\n Matrix<double> mat(n, n, 0);\\n REP(i, n) {\\n for (int e : graph[i]) {\\n if (e > i) {\\n double x = 0;\\n while (x < EPS) {\\n int den = xor128.rand();\\n if (den > EPS) x = 1.0 * xor128.rand() / den;\\n }\\n mat[i][e] = x;\\n mat[e][i] = -x;\\n }\\n }\\n }\\n return gauss_jordan(mat) / 2;\\n}\\n\\nint main() {\\n int n, A, B; cin >> n >> A >> B;\\n int ans = 0;\\n vector<int> a, b;\\n while (n--) {\\n int ai, bi; cin >> ai >> bi;\\n int val = abs(ai - bi);\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n ++ans;\\n } else {\\n a.emplace_back(ai);\\n b.emplace_back(bi);\\n }\\n }\\n n = a.size();\\n if (n > 0) {\\n vector<vector<int> > graph(n);\\n REP(i, n) FOR(j, i + 1, n) {\\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n graph[i].emplace_back(j);\\n graph[j].emplace_back(i);\\n }\\n }\\n ans += tutte_theorem(graph);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7556,\n \"score_of_the_acc\": -0.4971,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3032_4014950\",\n \"code_snippet\": \"#include <cmath>\\n#include <ctime>\\n#include <iostream>\\n#include <iomanip>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nconst double EPS = 1e-8;\\n\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n/*-------------------------------------------------*/\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(long long exponent) {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n REP(i, n) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &rhs) {\\n int m = rhs.height(), n = rhs.width();\\n dat.resize(m, vector<T>(n));\\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &rhs) {\\n int m = height(), n = rhs.width(), l = width();\\n vector<vector<T> > res(m, vector<T>(n, 0));\\n REP(i, m) REP(j, n) {\\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\\n }\\n swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\\n\\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\\n\\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\\n\\nprivate:\\n vector<vector<T> > dat;\\n};\\n\\ntemplate <typename T>\\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\\n int m = mat.height(), n = mat.width(), rank = 0;\\n REP(col, n) {\\n if (is_extended && col == n - 1) break;\\n int pivot = -1;\\n T mx = EPS;\\n FOR(row, rank, m) {\\n if (abs(mat[row][col]) > mx) {\\n pivot = row;\\n mx = abs(mat[row][col]);\\n }\\n }\\n if (pivot == -1) continue;\\n swap(mat[rank], mat[pivot]);\\n T tmp = mat[rank][col];\\n REP(col2, n) mat[rank][col2] /= tmp;\\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\\n tmp = mat[row][col];\\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\nstruct Xor128 {\\n int rand() {\\n unsigned t = x ^ (x << 11);\\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n return static_cast<int>(w);\\n }\\n int rand(int ub) {\\n int res = rand() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\\n long long randll() {\\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\\n return static_cast<long long>(res | rand());\\n }\\n long long randll(long long ub) {\\n long long res = randll() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\\nprivate:\\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\\n} xor128;\\n\\nint matching(const vector<vector<int> > &graph) {\\n int n = graph.size();\\n Matrix<double> mat(n, n, 0);\\n REP(i, n) {\\n for (int e : graph[i]) if (e > i) {\\n double x = 0;\\n while (x < EPS) {\\n int den = xor128.rand();\\n if (den > EPS) x = static_cast<double>(xor128.rand()) / den;\\n }\\n mat[i][e] = x;\\n mat[e][i] = -x;\\n }\\n }\\n return gauss_jordan(mat) / 2;\\n}\\n\\nint main() {\\n int n, A, B; cin >> n >> A >> B;\\n int ans = 0;\\n vector<int> a, b;\\n while (n--) {\\n int ai, bi; cin >> ai >> bi;\\n int val = abs(ai - bi);\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n ++ans;\\n } else {\\n a.emplace_back(ai);\\n b.emplace_back(bi);\\n }\\n }\\n n = a.size();\\n if (n > 0) {\\n vector<vector<int> > graph(n);\\n REP(i, n) FOR(j, i + 1, n) {\\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n graph[i].emplace_back(j);\\n graph[j].emplace_back(i);\\n }\\n }\\n ans += matching(graph);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7532,\n \"score_of_the_acc\": -0.4953,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3032_4014646\",\n \"code_snippet\": \"#include <cmath>\\n#include <ctime>\\n#include <iostream>\\n#include <iomanip>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nconst double EPS = 1e-8;\\n\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n/*-------------------------------------------------*/\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(long long exponent) {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n REP(i, n) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &rhs) {\\n int m = rhs.height(), n = rhs.width();\\n dat.resize(m, vector<T>(n));\\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &rhs) {\\n int m = height(), n = rhs.width(), l = width();\\n vector<vector<T> > res(m, vector<T>(n, 0));\\n REP(i, m) REP(j, n) {\\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\\n }\\n swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\\n\\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\\n\\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\\n\\nprivate:\\n vector<vector<T> > dat;\\n};\\n\\ntemplate <typename T>\\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\\n int m = mat.height(), n = mat.width(), rank = 0;\\n REP(col, n) {\\n if (is_extended && col == n - 1) break;\\n int pivot = -1;\\n T mx = EPS;\\n FOR(row, rank, m) {\\n if (abs(mat[row][col]) > mx) {\\n pivot = row;\\n mx = abs(mat[row][col]);\\n }\\n }\\n if (pivot == -1) continue;\\n swap(mat[rank], mat[pivot]);\\n T tmp = mat[rank][col];\\n REP(col2, n) mat[rank][col2] /= tmp;\\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\\n tmp = mat[row][col];\\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\nstruct Xor128 {\\n int rand() {\\n unsigned t = x ^ (x << 11);\\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n return static_cast<int>(w);\\n }\\n int rand(int ub) {\\n int res = rand() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\\n long long randll() {\\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\\n return static_cast<long long>(res | rand());\\n }\\n long long randll(long long ub) {\\n long long res = randll() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\\nprivate:\\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\\n} xor128;\\n\\nint matching(const vector<vector<int> > &graph) {\\n int n = graph.size();\\n Matrix<double> mat(n, n, 0);\\n REP(i, n) {\\n for (int e : graph[i]) if (e > i) {\\n double x = static_cast<double>(xor128.rand()) / xor128.rand();\\n mat[i][e] = x;\\n mat[e][i] = -x;\\n }\\n }\\n return gauss_jordan(mat) / 2;\\n}\\n\\nint main() {\\n int n, A, B; cin >> n >> A >> B;\\n int ans = 0;\\n vector<int> a, b;\\n while (n--) {\\n int ai, bi; cin >> ai >> bi;\\n int val = abs(ai - bi);\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n ++ans;\\n } else {\\n a.emplace_back(ai);\\n b.emplace_back(bi);\\n }\\n }\\n n = a.size();\\n if (n > 0) {\\n vector<vector<int> > graph(n);\\n REP(i, n) FOR(j, i + 1, n) {\\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n graph[i].emplace_back(j);\\n graph[j].emplace_back(i);\\n }\\n }\\n ans += matching(graph);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7512,\n \"score_of_the_acc\": -0.4938,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3032_3827775\",\n \"code_snippet\": \"#include <cmath>\\n#include <ctime>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nconst double EPS = 1e-8;\\n/*-------------------------------------------------*/\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int m, int n, T val = 0) : dat(m, vector<T>(n, val)) {}\\n\\n int height() const { return dat.size(); }\\n\\n int width() const { return dat.front().size(); }\\n\\n Matrix pow(long long exponent) {\\n int n = height();\\n Matrix<T> tmp = *this, res(n, n, 0);\\n REP(i, n) res[i][i] = 1;\\n while (exponent > 0) {\\n if (exponent & 1) res *= tmp;\\n tmp *= tmp;\\n exponent >>= 1;\\n }\\n return res;\\n }\\n\\n inline const vector<T> &operator[](const int idx) const { return dat[idx]; }\\n inline vector<T> &operator[](const int idx) { return dat[idx]; }\\n\\n Matrix &operator=(const Matrix &rhs) {\\n int m = rhs.height(), n = rhs.width();\\n dat.resize(m, vector<T>(n));\\n REP(i, m) REP(j, n) dat[i][j] = rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator+=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] += rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator-=(const Matrix &rhs) {\\n int m = height(), n = width();\\n REP(i, m) REP(j, n) dat[i][j] -= rhs[i][j];\\n return *this;\\n }\\n\\n Matrix &operator*=(const Matrix &rhs) {\\n int m = height(), n = rhs.width(), l = width();\\n vector<vector<T> > res(m, vector<T>(n, 0));\\n REP(i, m) REP(j, n) {\\n REP(k, l) res[i][j] += dat[i][k] * rhs[k][j];\\n }\\n swap(dat, res);\\n return *this;\\n }\\n\\n Matrix operator+(const Matrix &rhs) const { return Matrix(*this) += rhs; }\\n\\n Matrix operator-(const Matrix &rhs) const { return Matrix(*this) -= rhs; }\\n\\n Matrix operator*(const Matrix &rhs) const { return Matrix(*this) *= rhs; }\\n\\nprivate:\\n vector<vector<T> > dat;\\n};\\n\\ntemplate <typename T>\\nint gauss_jordan(Matrix<T> &mat, bool is_extended = false) {\\n int m = mat.height(), n = mat.width(), rank = 0;\\n REP(col, n) {\\n if (is_extended && col == n - 1) break;\\n int pivot = -1;\\n T mx = EPS;\\n FOR(row, rank, m) {\\n if (abs(mat[row][col]) > mx) {\\n pivot = row;\\n mx = abs(mat[row][col]);\\n }\\n }\\n if (pivot == -1) continue;\\n swap(mat[rank], mat[pivot]);\\n T tmp = mat[rank][col];\\n REP(col2, n) mat[rank][col2] /= tmp;\\n REP(row, m) if (row != rank && abs(mat[row][col]) > EPS) {\\n tmp = mat[row][col];\\n REP(col2, n) mat[row][col2] -= mat[rank][col2] * tmp;\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\nstruct Xor128 {\\n int rand() {\\n unsigned t = x ^ (x << 11);\\n x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n return static_cast<int>(w);\\n }\\n int rand(int ub) {\\n int res = rand() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n int rand(int lb, int ub) { return lb + rand(ub - lb); }\\n long long randll() {\\n unsigned long long res = static_cast<unsigned long long>(rand()) << 32;\\n return static_cast<long long>(res | rand());\\n }\\n long long randll(long long ub) {\\n long long res = randll() % ub;\\n return (res < 0 ? res + ub : res);\\n }\\n long long randll(long long lb, long long ub) { return lb + rand(ub - lb); }\\nprivate:\\n unsigned x = 123456789, y = 362436069, z = 521288629, w = static_cast<unsigned>(time(nullptr));\\n} xor128;\\n\\ntemplate <typename T>\\nint matching(const vector<vector<T> > &graph) {\\n int n = graph.size();\\n Matrix<double> mat(n, n);\\n REP(i, n) FOR(j, i + 1, n) if (graph[i][j] != 0) {\\n double x = static_cast<double>(xor128.rand()) / xor128.rand();\\n mat[i][j] = x;\\n mat[j][i] = -x;\\n }\\n return gauss_jordan(mat) / 2;\\n}\\n\\nint main() {\\n cin.tie(0); ios::sync_with_stdio(false);\\n // freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n\\n int n, A, B; cin >> n >> A >> B;\\n int ans = 0;\\n vector<int> a, b;\\n while (n--) {\\n int ai, bi; cin >> ai >> bi;\\n int val = abs(ai - bi);\\n if (val <= A || (B <= val && val <= 2 * A)) {\\n ++ans;\\n } else {\\n a.emplace_back(ai);\\n b.emplace_back(bi);\\n }\\n }\\n n = a.size();\\n if (n > 0) {\\n vector<vector<int> > graph(n, vector<int>(n, 0));\\n REP(i, n) FOR(j, i + 1, n) {\\n int val = abs((a[i] + a[j]) - (b[i] + b[j]));\\n if (val <= A || (B <= val && val <= 2 * A)) graph[i][j] = graph[j][i] = 1;\\n }\\n ans += matching(graph);\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 9576,\n \"score_of_the_acc\": -0.6492,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3032_3416747\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-2;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\n#include<cstring>\\nstruct edge { int to, cap, rev; };\\nvector<edge> G[100000];\\nbool used[100000];\\nvoid add_edge(int from, int to, int cap) {\\n\\tG[from].push_back(edge{ to, cap, (int)G[to].size() });\\n\\tG[to].push_back(edge{ from, 0, (int)G[from].size() - 1 });\\n}\\nint dfs(int v, int t, int f) {\\n\\tif (v == t)return f;\\n\\tused[v] = true;\\n\\tfor (int i = 0; i < (int)G[v].size(); i++) {\\n\\t\\tedge &e = G[v][i];\\n\\t\\tif (!used[e.to] && e.cap > 0) {\\n\\t\\t\\tint d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\nint max_flow(int s, int t) {\\n\\tint flow = 0;\\n\\tfor (;;) {\\n\\t\\tmemset(used, 0, sizeof(used));\\n\\t\\tint f = dfs(s, t, mod);\\n\\t\\tif (f == 0)return flow;\\n\\t\\tflow += f;\\n\\t}\\n}\\nvector<P> v[2];\\nint main() {\\n\\tint n, a, b; cin >> n >> a >> b;\\n\\tint cnt = 0;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tint z = abs(x - y);\\n\\t\\tif (z <= a || (b <= z && z <= 2 * a))cnt++;\\n\\t\\telse {\\n\\t\\t\\tif (x-y>0) {\\n\\t\\t\\t\\tv[0].push_back({ x,y });\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tv[1].push_back({ x,y });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint m = v[0].size(); int len = v[1].size();\\n\\tint sta = m + len, goa = m + len + 1;\\n\\trep(i, m)add_edge(sta, i, 1);\\n\\trep(i, len)add_edge(i + m, goa, 1);\\n\\trep(i, m) {\\n\\t\\trep(j, len) {\\n\\t\\t\\tint z = v[0][i].first - v[0][i].second + v[1][j].first - v[1][j].second;\\n\\t\\t\\tz = abs(z);\\n\\t\\t\\tif (z <= a || (b <= z && z <= 2 * a)) {\\n\\t\\t\\t\\tadd_edge(i, m + j,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = cnt + max_flow(sta,goa);\\n\\tcout << ans << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6732,\n \"score_of_the_acc\": -0.2459,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3032_3275843\",\n \"code_snippet\": \"#include <vector>\\n#include <cassert>\\n#include <set>\\n#include <queue>\\n#include <functional>\\n#include <algorithm>\\n\\nstruct edge {\\n int to;\\n int label;\\n};\\n\\n\\n::std::vector<::std::pair<int,int>> gabow_edmonds(const ::std::vector<::std::vector<int>>& gra){\\n int N = gra.size();\\n ::std::vector<::std::vector<edge>> g(N + 1);\\n ::std::vector<::std::pair<int,int>> edges;\\n {\\n int cnt = N + 1;\\n for(int i = 0;i < N;i++){\\n for(auto to : gra[i]){\\n if(i < to){\\n g[to + 1].push_back({i + 1,cnt});\\n g[i + 1].push_back({to + 1,cnt++});\\n edges.push_back({i + 1, to + 1});\\n }\\n }\\n }\\n }\\n ::std::vector<int> mate(N + 1 , 0);\\n ::std::vector<int> label(N + 1 , -1);\\n ::std::vector<int> first(N + 1 , 0);\\n\\n ::std::function<int(int)> eval_first = [&](int x){\\n if(label[first[x]] < 0) return first[x];\\n first[x] = eval_first(first[x]);\\n return first[x];\\n };\\n\\n ::std::function<void(int,int)> rematch = [&](int v,int w){\\n int t = mate[v];\\n mate[v] = w;\\n if(mate[t] != v) return;\\n if(label[v] <= N){\\n mate[t] = label[v];\\n rematch(label[v] , t);\\n }\\n else{\\n int x = edges[label[v] - N + 1].first;\\n int y = edges[label[v] - N + 1].second;\\n rematch(x , y);\\n rematch(y , x);\\n }\\n };\\n\\n ::std::function<void(int,int,int)> assignLabel = [&](int x, int y,int num){\\n int r = eval_first(x);\\n int s = eval_first(y);\\n int join = 0;\\n if(r == s) return;\\n label[r] = -num;\\n label[s] = -num;\\n while(true){\\n if(s != 0) ::std::swap(r , s);\\n r = eval_first(label[mate[r]]);\\n if(label[r] == -num){\\n join = r;\\n break;\\n }\\n label[r] = -num;\\n }\\n int v = first[x];\\n while(v != join){\\n label[v] = num;\\n first[v] = join;\\n v = first[label[mate[v]]];\\n }\\n v = first[y];\\n while(v != join){\\n label[v] = num;\\n first[v] = join;\\n v = first[label[mate[v]]];\\n }\\n return;\\n };\\n\\n ::std::function<bool(int)> augment_check = [&](int u){\\n first[u] = 0;\\n label[u] = 0;\\n ::std::queue<int> que;\\n que.push(u);\\n while(!que.empty()){\\n int x = que.front();\\n que.pop();\\n for(auto e : g[x]){\\n int y = e.to;\\n if(mate[y] == 0 && y != u){\\n mate[y] = x;\\n rematch(x , y);\\n return true;\\n }\\n else if(label[y] >= 0){\\n assignLabel(x , y , e.label);\\n }\\n else if(label[mate[y]] < 0){\\n label[mate[y]] = x;\\n first[mate[y]] = y;\\n que.push(mate[y]);\\n }\\n }\\n }\\n return false;\\n };\\n\\n for(int i = 1;i <= N;i++){\\n if(mate[i] != 0) continue;\\n if(augment_check(i)){\\n ::std::fill(label.begin() , label.end() , -1);\\n }\\n }\\n\\n ::std::vector<::std::pair<int,int>> ans;\\n for(int i = 1;i <= N;i++){\\n if(i < mate[i]){\\n ans.push_back({i , mate[i]});\\n }\\n }\\n return ans;\\n}\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)\\n\\nint main(){\\n int N,A,B;\\n cin >> N >> A >> B;\\n vector<int> a(N),b(N);\\n for(int i = 0;i < N;i++){\\n cin >> a[i] >> b[i];\\n }\\n vector<vector<int>> g(N * 2);\\n for(int i = 0;i < N;i++){\\n int t = abs(a[i] - b[i]);\\n if(t <= A || (B <= t && t <= 2 * A)){\\n g[i].push_back(i + N);\\n g[i + N].push_back(i);\\n }\\n }\\n for(int i = 0;i < N;i++){\\n for(int j = i + 1;j < N;j++){\\n int t = abs(a[i] + a[j] - b[i] - b[j]);\\n if(t <= A || (B <= t && t <= 2 * A)){\\n g[i].push_back(j);\\n g[j].push_back(i);\\n }\\n }\\n }\\n\\n cout << gabow_edmonds(g).size() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 16752,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3032_2997693\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\\nstatic const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\\ntemplate<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }\\ntemplate<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }\\n#define each(it,o) for(auto it = (o).begin(); it != (o).end(); ++ it)\\n#define all(o) (o).begin(), (o).end()\\n#define pb(x) push_back(x)\\n#define mp(x,y) make_pair((x),(y))\\n#ifdef _DEBUG\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src_, int dst_, Weight weight_) : src(src_), dst(dst_), weight(weight_) { }\\n\\tEdge() {};\\n};\\ntypedef vector<Edge> Edges;\\nstruct MaxWeightMatching {\\n\\tint nEdge, nVertex;\\n\\tWeight maxWeight;\\n\\tvi endPoint, mate, label, labelEdge,\\n\\t\\tinBlossom, blossomParent, blossomBase,\\n\\t\\tbestEdge, unusedBlossoms, allowEdge,\\n\\t\\tblossomBestEdgesUsed,\\n\\t\\tsVerteices;\\n\\tvector<Weight> dualVar;\\n\\tvector<vi> neighbEnd, blossomChilds, blossomEdges,\\n\\t\\tblossomBestEdges;\\n\\tEdges edges;\\n\\tbool maxCardinality;\\n\\n\\tWeight slack(int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\treturn dualVar[e.src] + dualVar[e.dst] - 2 * e.weight;\\n\\t}\\n\\tstruct BlossomLeaves {\\n\\t\\tint b;\\n\\t\\tMaxWeightMatching *mw;\\n\\t\\tenum { INITAL, END, NEXT, THIRD } state;\\n\\t\\tvi::const_iterator iter, endi;\\n\\t\\tBlossomLeaves *bl;\\n\\t\\tBlossomLeaves(MaxWeightMatching *mw_, int b_) :\\n\\t\\t\\tmw(mw_), b(b_), state(INITAL), bl(NULL) {}\\n\\t\\tbool next(int &r) {\\n\\t\\t\\tint t;\\n\\t\\t\\tswitch (state) {\\n\\t\\t\\tcase INITAL:\\n\\t\\t\\t\\tif (b < mw->nVertex) {\\n\\t\\t\\t\\t\\tr = b;\\n\\t\\t\\t\\t\\tstate = END;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\titer = mw->blossomChilds[b].begin();\\n\\t\\t\\t\\t\\tendi = mw->blossomChilds[b].end();\\n\\t\\t\\t\\t\\tstate = NEXT;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase END:\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\tcase NEXT:\\n\\t\\t\\t\\tif (iter == endi)\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\tt = *iter;\\n\\t\\t\\t\\t++iter;\\n\\t\\t\\t\\tif (t < mw->nVertex) {\\n\\t\\t\\t\\t\\tr = t;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tbl = new BlossomLeaves(mw, t);\\n\\t\\t\\t\\t\\tstate = THIRD;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase THIRD:\\n\\t\\t\\t\\tif (!bl->next(t)) {\\n\\t\\t\\t\\t\\tstate = NEXT;\\n\\t\\t\\t\\t\\tdelete bl; bl = NULL;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tr = t;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t};\\n\\tvoid assignLabel(int w, int t, int p) {\\n\\t\\tint b = inBlossom[w];\\n\\t\\tlabel[w] = label[b] = t;\\n\\t\\tlabelEdge[w] = labelEdge[b] = p;\\n\\t\\tbestEdge[w] = bestEdge[b] = -1;\\n\\t\\tif (t == 1) {\\n\\t\\t\\tBlossomLeaves bl(this, b);\\n\\t\\t\\tfor (int r; bl.next(r); ) sVerteices.push_back(r);\\n\\t\\t}\\n\\t\\telse if (t == 2) {\\n\\t\\t\\tint base = blossomBase[b];\\n\\t\\t\\tassignLabel(endPoint[mate[base]], 1, mate[base] ^ 1);\\n\\t\\t}\\n\\t}\\n\\tint scanBlossom(int v, int w) {\\n\\t\\tvi path;\\n\\t\\tint base = -1;\\n\\t\\twhile (v != -1) {\\n\\t\\t\\tint b = inBlossom[v];\\n\\t\\t\\tif (label[b] & 4) {\\n\\t\\t\\t\\tbase = blossomBase[b];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tpath.push_back(b);\\n\\t\\t\\tlabel[b] = 5;\\n\\t\\t\\tif (labelEdge[b] == -1) {\\n\\t\\t\\t\\tv = -1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tv = endPoint[labelEdge[b]];\\n\\t\\t\\t\\tb = inBlossom[v];\\n\\t\\t\\t\\tv = endPoint[labelEdge[b]];\\n\\t\\t\\t}\\n\\t\\t\\tif (w != -1)\\n\\t\\t\\t\\tswap(v, w);\\n\\t\\t}\\n\\t\\teach(it, path)\\n\\t\\t\\tlabel[*it] = 1;\\n\\t\\treturn base;\\n\\t}\\n\\tvoid addBlossom(int base, int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\tint bb = inBlossom[base],\\n\\t\\t\\tbv = inBlossom[e.src],\\n\\t\\t\\tbw = inBlossom[e.dst];\\n\\t\\tint b = unusedBlossoms.back(); unusedBlossoms.pop_back();\\n\\t\\tblossomBase[b] = base;\\n\\t\\tblossomParent[b] = -1;\\n\\t\\tblossomParent[bb] = b;\\n\\t\\tblossomChilds[b].clear();\\n\\t\\tblossomEdges[b].clear();\\n\\t\\tvi &bChilds = blossomChilds[b];\\n\\t\\tvi &bEdges = blossomEdges[b];\\n\\t\\twhile (bv != bb) {\\n\\t\\t\\tblossomParent[bv] = b;\\n\\t\\t\\tbChilds.push_back(bv);\\n\\t\\t\\tbEdges.push_back(labelEdge[bv]);\\n\\t\\t\\tbv = inBlossom[endPoint[labelEdge[bv]]];\\n\\t\\t}\\n\\t\\tbChilds.push_back(bb);\\n\\t\\treverse(all(bChilds));\\n\\t\\treverse(all(bEdges));\\n\\t\\tbEdges.push_back(2 * k);\\n\\t\\twhile (bw != bb) {\\n\\t\\t\\tblossomParent[bw] = b;\\n\\t\\t\\tbChilds.push_back(bw);\\n\\t\\t\\tbEdges.push_back(labelEdge[bw] ^ 1);\\n\\t\\t\\tbw = inBlossom[endPoint[labelEdge[bw]]];\\n\\t\\t}\\n\\t\\tlabel[b] = 1;\\n\\t\\tlabelEdge[b] = labelEdge[bb];\\n\\t\\tdualVar[b] = 0;\\n\\t\\tBlossomLeaves bl(this, b);\\n\\t\\tfor (int v; bl.next(v); ) {\\n\\t\\t\\tif (label[inBlossom[v]] == 2)\\n\\t\\t\\t\\tsVerteices.push_back(v);\\n\\t\\t\\tinBlossom[v] = b;\\n\\t\\t}\\n\\t\\tvi bestEdgeTo(2 * nVertex, -1);\\n\\t\\teach(it, bChilds) {\\n\\t\\t\\tint bv2 = *it;\\n\\t\\t\\tvector<vi> nbLists;\\n\\t\\t\\tif (!blossomBestEdgesUsed[bv2]) {\\n\\t\\t\\t\\tBlossomLeaves bl2(this, bv2);\\n\\t\\t\\t\\tfor (int v2; bl2.next(v2); ) {\\n\\t\\t\\t\\t\\tnbLists.push_back(neighbEnd[v2]);\\n\\t\\t\\t\\t\\tvi &vv = nbLists.back();\\n\\t\\t\\t\\t\\teach(i, vv)\\n\\t\\t\\t\\t\\t\\t*i /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnbLists.push_back(blossomBestEdges[bv2]);\\n\\t\\t\\t}\\n\\t\\t\\teach(itt, nbLists) {\\n\\t\\t\\t\\teach(ittt, *itt) {\\n\\t\\t\\t\\t\\tint k2 = *ittt;\\n\\t\\t\\t\\t\\tEdge &e2 = edges[k2];\\n\\t\\t\\t\\t\\tint i = e2.src, j = e2.dst;\\n\\t\\t\\t\\t\\tif (inBlossom[j] == b)\\n\\t\\t\\t\\t\\t\\tswap(i, j);\\n\\t\\t\\t\\t\\tint bj = inBlossom[j];\\n\\t\\t\\t\\t\\tif (bj != b && label[bj] == 1 &&\\n\\t\\t\\t\\t\\t\\t(bestEdgeTo[bj] == -1 ||\\n\\t\\t\\t\\t\\t\\t\\tslack(k2) < slack(bestEdgeTo[bj]))) {\\n\\t\\t\\t\\t\\t\\tbestEdgeTo[bj] = k2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tblossomBestEdgesUsed[bv2] = false;\\n\\t\\t\\tblossomBestEdges[bv2].clear();\\n\\t\\t\\tbestEdge[bv2] = -1;\\n\\t\\t}\\n\\t\\tblossomBestEdgesUsed[b] = true;\\n\\t\\tblossomBestEdges[b].clear();\\n\\t\\teach(it, bestEdgeTo)\\n\\t\\t\\tif (*it != -1)\\n\\t\\t\\t\\tblossomBestEdges[b].push_back(*it);\\n\\t\\tbestEdge[b] = -1;\\n\\t\\teach(it, blossomBestEdges[b])\\n\\t\\t\\tif (bestEdge[b] == -1 || slack(*it) < slack(bestEdge[b]))\\n\\t\\t\\t\\tbestEdge[b] = *it;\\n\\t}\\n\\tvoid expandBlossom(int b, bool endStage) {\\n\\t\\tint cSize = blossomChilds[b].size();\\n\\t\\teach(it, blossomChilds[b]) {\\n\\t\\t\\tint s = *it;\\n\\t\\t\\tblossomParent[s] = -1;\\n\\t\\t\\tif (s < nVertex)\\n\\t\\t\\t\\tinBlossom[s] = s;\\n\\t\\t\\telse if (endStage && dualVar[s] == 0)\\n\\t\\t\\t\\texpandBlossom(s, endStage);\\n\\t\\t\\telse {\\n\\t\\t\\t\\tBlossomLeaves bl(this, s);\\n\\t\\t\\t\\tfor (int v; bl.next(v); )\\n\\t\\t\\t\\t\\tinBlossom[v] = s;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!endStage && label[b] == 2) {\\n\\t\\t\\tint entryChild = inBlossom[endPoint[labelEdge[b] ^ 1]];\\n\\t\\t\\tint j = find(all(blossomChilds[b]), entryChild) - blossomChilds[b].begin();\\n\\t\\t\\tint jStep, evenOdd;\\n\\t\\t\\tif (j & 1)\\n\\t\\t\\t\\tjStep = 1, evenOdd = 0;\\n\\t\\t\\telse\\n\\t\\t\\t\\tjStep = -1, evenOdd = 1;\\n\\t\\t\\tint p = labelEdge[b];\\n\\t\\t\\twhile (j != 0) {\\n\\t\\t\\t\\tlabel[endPoint[p ^ 1]] = 0;\\n\\t\\t\\t\\tlabel[endPoint[blossomEdges[b][j - evenOdd] ^ evenOdd ^ 1]] = 0;\\n\\t\\t\\t\\tassignLabel(endPoint[p ^ 1], 2, p);\\n\\t\\t\\t\\tallowEdge[blossomEdges[b][j - evenOdd] / 2] = true;\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t\\tp = blossomEdges[b][j - evenOdd] ^ evenOdd;\\n\\t\\t\\t\\tallowEdge[p / 2] = true;\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t}\\n\\t\\t\\tint bv = blossomChilds[b][j];\\n\\t\\t\\tlabel[endPoint[p ^ 1]] = label[bv] = 2;\\n\\t\\t\\tlabelEdge[endPoint[p ^ 1]] = labelEdge[bv] = p;\\n\\t\\t\\tbestEdge[bv] = -1;\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\twhile (blossomChilds[b][j] != entryChild) {\\n\\t\\t\\t\\tbv = blossomChilds[b][j];\\n\\t\\t\\t\\tif (label[bv] == 1) {\\n\\t\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tBlossomLeaves bl(this, bv);\\n\\t\\t\\t\\tint v;\\n\\t\\t\\t\\twhile (bl.next(v))\\n\\t\\t\\t\\t\\tif (label[v] != 0)\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tif (label[v] != 0) {\\n\\t\\t\\t\\t\\tlabel[v] = 0;\\n\\t\\t\\t\\t\\tlabel[endPoint[mate[blossomBase[bv]]]] = 0;\\n\\t\\t\\t\\t\\tassignLabel(v, 2, labelEdge[v]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlabel[b] = labelEdge[b] = -1;\\n\\t\\tblossomChilds[b].clear();\\n\\t\\tblossomEdges[b].clear();\\n\\t\\tblossomBestEdgesUsed[b] = false;\\n\\t\\tblossomBestEdges[b].clear();\\n\\t\\tbestEdge[b] = -1;\\n\\t\\tunusedBlossoms.push_back(b);\\n\\t}\\n\\tvoid augmentBlossom(int b, int v) {\\n\\t\\tint cSize = blossomChilds[b].size();\\n\\t\\tint t = v;\\n\\t\\twhile (blossomParent[t] != b)\\n\\t\\t\\tt = blossomParent[t];\\n\\t\\tif (t >= nVertex)\\n\\t\\t\\taugmentBlossom(t, v);\\n\\t\\tint i, j, jStep, evenOdd;\\n\\t\\ti = j = find(all(blossomChilds[b]), t) - blossomChilds[b].begin();\\n\\t\\tif (i & 1)\\n\\t\\t\\tjStep = 1, evenOdd = 0;\\n\\t\\telse\\n\\t\\t\\tjStep = -1, evenOdd = 1;\\n\\t\\twhile (j != 0) {\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\tt = blossomChilds[b][j];\\n\\t\\t\\tint p = blossomEdges[b][j - evenOdd] ^ evenOdd;\\n\\t\\t\\tif (t >= nVertex)\\n\\t\\t\\t\\taugmentBlossom(t, endPoint[p]);\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\tt = blossomChilds[b][j];\\n\\t\\t\\tif (t >= nVertex)\\n\\t\\t\\t\\taugmentBlossom(t, endPoint[p ^ 1]);\\n\\t\\t\\tmate[endPoint[p]] = p ^ 1;\\n\\t\\t\\tmate[endPoint[p ^ 1]] = p;\\n\\t\\t}\\n\\t\\trotate(blossomChilds[b].begin(), blossomChilds[b].begin() + i, blossomChilds[b].end());\\n\\t\\trotate(blossomEdges[b].begin(), blossomEdges[b].begin() + i, blossomEdges[b].end());\\n\\t\\tblossomBase[b] = blossomBase[blossomChilds[b][0]];\\n\\t}\\n\\tvoid augmentMatching(int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\tint v = e.src, w = e.dst;\\n\\t\\trep(ii, 2) {\\n\\t\\t\\tint s = ii == 0 ? v : w, p = ii == 0 ? 2 * k + 1 : 2 * k;\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tint bs = inBlossom[s];\\n\\t\\t\\t\\tif (bs >= nVertex)\\n\\t\\t\\t\\t\\taugmentBlossom(bs, s);\\n\\t\\t\\t\\tmate[s] = p;\\n\\t\\t\\t\\tif (labelEdge[bs] == -1)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tint bt = inBlossom[endPoint[labelEdge[bs]]];\\n\\t\\t\\t\\ts = endPoint[labelEdge[bt]];\\n\\t\\t\\t\\tint j = endPoint[labelEdge[bt] ^ 1];\\n\\t\\t\\t\\tif (bt >= nVertex)\\n\\t\\t\\t\\t\\taugmentBlossom(bt, j);\\n\\t\\t\\t\\tmate[j] = labelEdge[bt];\\n\\t\\t\\t\\tp = labelEdge[bt] ^ 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid mainLoop() {\\n\\t\\trep(t, nVertex) {\\n\\t\\t\\tlabel.assign(2 * nVertex, 0);\\n\\t\\t\\tbestEdge.assign(2 * nVertex, -1);\\n\\t\\t\\tfill(blossomBestEdgesUsed.begin() + nVertex, blossomBestEdgesUsed.end(), false);\\n\\t\\t\\tallowEdge.assign(nEdge, false);\\n\\t\\t\\tsVerteices.clear();\\n\\t\\t\\trep(v, nVertex)\\n\\t\\t\\t\\tif (mate[v] == -1 && label[inBlossom[v]] == 0)\\n\\t\\t\\t\\t\\tassignLabel(v, 1, -1);\\n\\t\\t\\tbool augmented = false;\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tWeight kSlack;\\n\\t\\t\\t\\twhile (!sVerteices.empty() && !augmented) {\\n\\t\\t\\t\\t\\tint v = sVerteices.back(); sVerteices.pop_back();\\n\\t\\t\\t\\t\\teach(it, neighbEnd[v]) {\\n\\t\\t\\t\\t\\t\\tint p = *it;\\n\\t\\t\\t\\t\\t\\tint k = p / 2, w = endPoint[p];\\n\\t\\t\\t\\t\\t\\tif (inBlossom[v] == inBlossom[w])\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\tif (!allowEdge[k]) {\\n\\t\\t\\t\\t\\t\\t\\tkSlack = slack(k);\\n\\t\\t\\t\\t\\t\\t\\tif (kSlack <= 0)\\n\\t\\t\\t\\t\\t\\t\\t\\tallowEdge[k] = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (allowEdge[k]) {\\n\\t\\t\\t\\t\\t\\t\\tif (label[inBlossom[w]] == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tassignLabel(w, 2, p ^ 1);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (label[inBlossom[w]] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tint base = scanBlossom(v, w);\\n\\t\\t\\t\\t\\t\\t\\t\\tif (base >= 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taddBlossom(base, k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taugmentMatching(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taugmented = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (label[w] == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tlabel[w] = 2;\\n\\t\\t\\t\\t\\t\\t\\t\\tlabelEdge[w] = p ^ 1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[inBlossom[w]] == 1) {\\n\\t\\t\\t\\t\\t\\t\\tint b = inBlossom[v];\\n\\t\\t\\t\\t\\t\\t\\tif (bestEdge[b] == -1 || kSlack < slack(bestEdge[b]))\\n\\t\\t\\t\\t\\t\\t\\t\\tbestEdge[b] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[w] == 0) {\\n\\t\\t\\t\\t\\t\\t\\tif (bestEdge[w] == -1 || kSlack < slack(bestEdge[w]))\\n\\t\\t\\t\\t\\t\\t\\t\\tbestEdge[w] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (augmented)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tint deltaType = -1;\\n\\t\\t\\t\\tWeight delta;\\n\\t\\t\\t\\tint deltaEdge, deltaBlossom;\\n\\t\\t\\t\\tif (!maxCardinality) {\\n\\t\\t\\t\\t\\tdeltaType = 1;\\n\\t\\t\\t\\t\\tdelta = *min_element(dualVar.begin(), dualVar.begin() + nVertex);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(v, nVertex) {\\n\\t\\t\\t\\t\\tif (label[inBlossom[v]] == 0 && bestEdge[v] != -1) {\\n\\t\\t\\t\\t\\t\\tWeight d = slack(bestEdge[v]);\\n\\t\\t\\t\\t\\t\\tif (deltaType == -1 || d < delta) {\\n\\t\\t\\t\\t\\t\\t\\tdelta = d;\\n\\t\\t\\t\\t\\t\\t\\tdeltaType = 2;\\n\\t\\t\\t\\t\\t\\t\\tdeltaEdge = bestEdge[v];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(b, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomParent[b] == -1 && label[b] == 1 && bestEdge[b] != -1) {\\n\\t\\t\\t\\t\\t\\tkSlack = slack(bestEdge[b]);\\n\\t\\t\\t\\t\\t\\tWeight d = kSlack / 2;\\n\\t\\t\\t\\t\\t\\tif (deltaType == -1 || d < delta) {\\n\\t\\t\\t\\t\\t\\t\\tdelta = d;\\n\\t\\t\\t\\t\\t\\t\\tdeltaType = 3;\\n\\t\\t\\t\\t\\t\\t\\tdeltaEdge = bestEdge[b];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treu(b, nVertex, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomBase[b] >= 0 && blossomParent[b] == -1 &&\\n\\t\\t\\t\\t\\t\\tlabel[b] == 2 &&\\n\\t\\t\\t\\t\\t\\t(deltaType == -1 || dualVar[b] < delta)) {\\n\\t\\t\\t\\t\\t\\tdelta = dualVar[b];\\n\\t\\t\\t\\t\\t\\tdeltaType = 4;\\n\\t\\t\\t\\t\\t\\tdeltaBlossom = b;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (deltaType == -1) {\\n\\t\\t\\t\\t\\tdeltaType = 1;\\n\\t\\t\\t\\t\\tdelta = max((Weight)0, *min_element(dualVar.begin(), dualVar.begin() + nVertex));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(v, nVertex) {\\n\\t\\t\\t\\t\\tif (label[inBlossom[v]] == 1) {\\n\\t\\t\\t\\t\\t\\tdualVar[v] -= delta;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (label[inBlossom[v]] == 2) {\\n\\t\\t\\t\\t\\t\\tdualVar[v] += delta;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treu(b, nVertex, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomBase[b] >= 0 && blossomParent[b] == -1) {\\n\\t\\t\\t\\t\\t\\tif (label[b] == 1) {\\n\\t\\t\\t\\t\\t\\t\\tdualVar[b] += delta;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[b] == 2) {\\n\\t\\t\\t\\t\\t\\t\\tdualVar[b] -= delta;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (deltaType == 1) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 2) {\\n\\t\\t\\t\\t\\tallowEdge[deltaEdge] = true;\\n\\t\\t\\t\\t\\tEdge &e = edges[deltaEdge];\\n\\t\\t\\t\\t\\tint i = e.src, j = e.dst;\\n\\t\\t\\t\\t\\tif (label[inBlossom[i]] == 0)\\n\\t\\t\\t\\t\\t\\tswap(i, j);\\n\\t\\t\\t\\t\\tsVerteices.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 3) {\\n\\t\\t\\t\\t\\tallowEdge[deltaEdge] = true;\\n\\t\\t\\t\\t\\tEdge &e = edges[deltaEdge];\\n\\t\\t\\t\\t\\tint i = e.src;\\n\\t\\t\\t\\t\\tsVerteices.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 4) {\\n\\t\\t\\t\\t\\texpandBlossom(deltaBlossom, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!augmented)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\treu(b, nVertex, 2 * nVertex)\\n\\t\\t\\t\\tif (blossomParent[b] == -1 && blossomBase[b] >= 0 &&\\n\\t\\t\\t\\t\\tlabel[b] == 1 && dualVar[b] == 0)\\n\\t\\t\\t\\t\\texpandBlossom(b, true);\\n\\t\\t}\\n\\t}\\n\\tvi matching(const Edges& edges_, bool maxCardinality_ = false) {\\n\\t\\tedges = edges_; maxCardinality = maxCardinality_;\\n\\t\\tnEdge = edges.size();\\n\\t\\tnVertex = 0;\\n\\t\\teach(i, edges) {\\n\\t\\t\\tif (i->src >= nVertex) nVertex = i->src + 1;\\n\\t\\t\\tif (i->dst >= nVertex) nVertex = i->dst + 1;\\n\\t\\t}\\n\\t\\tmaxWeight = 0;\\n\\t\\tendPoint.clear();\\n\\t\\tneighbEnd.assign(nVertex, vi());\\n\\t\\trep(i, nEdge) {\\n\\t\\t\\tEdge &e = edges[i];\\n\\t\\t\\tmaxWeight = max(maxWeight, e.weight);\\n\\t\\t\\tendPoint.push_back(e.src);\\n\\t\\t\\tendPoint.push_back(e.dst);\\n\\t\\t\\tneighbEnd[e.src].push_back(2 * i + 1);\\n\\t\\t\\tneighbEnd[e.dst].push_back(2 * i);\\n\\t\\t}\\n\\t\\tmate.assign(nVertex, -1);\\n\\t\\tlabel.assign(2 * nVertex, 0);\\n\\t\\tlabelEdge.assign(2 * nVertex, -1);\\n\\t\\tinBlossom.clear();\\n\\t\\tblossomBase.clear();\\n\\t\\tblossomParent.assign(2 * nVertex, -1);\\n\\t\\tblossomChilds.assign(2 * nVertex, vi());\\n\\t\\tblossomEdges.assign(2 * nVertex, vi());\\n\\t\\tbestEdge.assign(2 * nVertex, -1);\\n\\t\\tblossomBestEdgesUsed.assign(2 * nVertex, false);\\n\\t\\tblossomBestEdges.assign(2 * nVertex, vi());\\n\\t\\tunusedBlossoms.clear();\\n\\t\\tdualVar.clear();\\n\\t\\trep(i, nVertex)\\n\\t\\t\\tinBlossom.push_back(i),\\n\\t\\t\\tblossomBase.push_back(i),\\n\\t\\t\\tunusedBlossoms.push_back(nVertex + i),\\n\\t\\t\\tdualVar.push_back(maxWeight);\\n\\t\\trep(i, nVertex)\\n\\t\\t\\tblossomBase.push_back(-1),\\n\\t\\t\\tdualVar.push_back(0);\\n\\t\\tallowEdge.assign(nEdge, 0);\\n\\t\\tsVerteices = vi();\\n\\t\\tmainLoop();\\n\\t\\trep(v, nVertex)\\n\\t\\t\\tif (mate[v] >= 0)\\n\\t\\t\\t\\tmate[v] = endPoint[mate[v]];\\n\\t\\treturn mate;\\n\\t}\\n\\tWeight getWeight(const Edges& e, bool maxCardinality_ = false) {\\n\\t\\tvector<int> v = matching(e, maxCardinality_);\\n\\t\\tWeight w = 0;\\n\\t\\trep(i, v.size()) if (v[i] != -1)\\n\\t\\t\\teach(j, e) if (i == j->src && j->dst == v[i]) w += j->weight;\\n\\t\\treturn w;\\n\\t}\\n};\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint N, A, B; cin >> N >> A >> B;\\n\\tvector<int> a(N), b(N); for (int i = 0; i < N; i++) {\\n\\t\\tcin >> a[i] >> b[i];\\n\\t}\\n\\n\\tint ans = 0;\\n\\tvector<bool> used(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (abs(a[i] - b[i]) <= A || (abs(a[i] - b[i]) >= B&&abs(a[i] - b[i]) <= 2 * A)) {\\n\\t\\t\\tans++;\\n\\t\\t\\tused[i] = true;\\n\\t\\t\\tdump(i);\\n\\t\\t}\\n\\t}\\n\\tEdges edges;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (used[i])continue;\\n\\t\\tfor (int j = i + 1; j < N; j++) {\\n\\t\\t\\tif (used[j])continue;\\n\\t\\t\\tdump(i, j, abs(a[i] + a[j] - b[i] - b[j]));\\n\\t\\t\\tif (abs(a[i] + a[j] - b[i] - b[j]) <= A || (abs(a[i] + a[j] - b[i] - b[j]) >= B&&abs(a[i] + a[j] - b[i] - b[j]) <= 2 * A)) {\\n\\t\\t\\t\\tedges.emplace_back(i, j, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tMaxWeightMatching mwm;\\n\\tans += mwm.getWeight(edges);\\n\\tcout << ans << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4680,\n \"score_of_the_acc\": -0.0915,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3032_2851079\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n////フォード - ファルカーソン法 O(Flow|E|)\\n\\ntypedef int Weight;\\n\\nconst Weight INF = 1e9;\\nconst Weight ZERO = 0;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tint id;\\n\\tEdge(int src_, int dst_, Weight weight_, const int rev_, const int id_) :\\n\\t\\tsrc(src_), dst(dst_), weight(weight_), rev(rev_), id(id_) { }\\n\\tEdge(int src_, int dst_, Weight weight_, const int rev_) :\\n\\t\\tsrc(src_), dst(dst_), weight(weight_), rev(rev_) { }\\n\\tEdge() :src(0), dst(0), weight(0) {\\n\\t}\\n};\\nbool operator < (const Edge &e, const Edge &f) {\\n\\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\\n\\te.src != f.src ? e.src < f.src : e.dst < f.dst;\\n}\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\ntypedef vector<Weight> Array;\\ntypedef vector<Array> Matrix;\\nvoid add_edge(Graph&g, int from, int to, int cap)\\n{\\n\\tg[from].push_back(Edge(from, to, cap, (int)g[to].size()));\\n\\tg[to].push_back(Edge(to, from, 0, (int)g[from].size() - 1));\\n}\\n//二つを繋ぐ線を完全に消す\\nvoid erase_edge(Graph&g, const int from, const int to) {\\n\\tg[from].erase(remove_if(g[from].begin(), g[from].end(), [=](const Edge&e) {return e.dst == to; }), g[from].end());\\n\\tg[to].erase(remove_if(g[to].begin(), g[to].end(), [=](const Edge&e) {return e.dst == from; }), g[to].end());\\n}\\nint dfs(vector<int>&used, Graph&g, int now, int t, int f)\\n{\\n\\tif (now == t) {\\n\\t\\treturn f;\\n\\t}\\n\\tused[now] = true;\\n\\tfor (int i = 0; i<g[now].size(); ++i) {\\n\\t\\tEdge &e = g[now][i];\\n\\t\\tif (!used[e.dst] && e.weight>0) {\\n\\t\\t\\tint d = dfs(used, g, e.dst, t, min(f, e.weight));\\n\\t\\t\\tif (d > 0) {\\n\\t\\t\\t\\te.weight -= d;\\n\\t\\t\\t\\tg[e.dst][e.rev].weight += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\nWeight fold_falc(Graph g, const int start, const int goal) {\\n\\tWeight ans = 0;\\n\\twhile (1) {\\n\\t\\tvector<int>used(g.size());\\n\\t\\tint flow = dfs(used, g, start, goal, INF);\\n\\t\\tif (!flow)return ans;\\n\\t\\telse ans += flow;\\n\\t}\\n}\\n\\nint main() {\\n\\tint N,A,B;cin>>N>>A>>B;\\n\\tvector<vector<int>>sas(2);\\n\\tint ans=0;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint a, b;cin>>a>>b;\\n\\t\\tint num=a-b;\\n\\t\\tif ( abs(num)<=A || (B <= abs(num) && abs(num) <= 2 * A)) {\\n\\t\\t\\tans++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif(num>0)sas[0].push_back(num);\\n\\t\\t\\telse sas[1].push_back(-num);\\n\\t\\t}\\n\\t}\\n\\tconst int start=0;\\n\\tconst int zero=1;\\n\\tconst int one=zero+sas[0].size();\\n\\tconst int goal=one+sas[1].size();\\n\\tGraph g(goal+1);\\n\\n\\tfor (int i = 0; i < sas[0].size(); ++i) {\\n\\t\\tadd_edge(g,start,zero+i,1);\\n\\t}\\n\\tfor (int i = 0; i < sas[0].size(); ++i) {\\n\\t\\tfor (int j = 0; j < sas[1].size(); ++j) {\\n\\t\\t\\tint x=zero+i;\\n\\t\\t\\tint y=one+j;\\n\\t\\t\\tint num=sas[0][i]-sas[1][j];\\n\\n\\t\\t\\tif ( abs(num)<=A || (B <= (abs(num)) && (abs(num)) <= 2 * A)) {\\n\\t\\t\\t\\tadd_edge(g,x,y,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < sas[1].size(); ++i) {\\n\\t\\tadd_edge(g, one+i, goal, 1);\\n\\t}\\n\\n\\tans+=fold_falc(g,start,goal);\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6468,\n \"score_of_the_acc\": -0.2261,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3032_2832949\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;++i)\\n#define rep(i,n) REP(i,0,n)\\n#define EPS (1e-8)\\n\\nusing namespace std;\\n\\n#define IINF INT_MAX\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef VVI matrix;\\n\\n#define MAX 810\\ndouble A[MAX][MAX],B[MAX][MAX];\\n\\nint rnk(int n){\\n int res = 0;\\n //matrix B(n,VI(n+1,1));\\n rep(i,n) rep(j,n+1) B[i][j] = 1;\\n \\n for(int i=0;i<n;i++) for(int j=0;j<n;j++) B[i][j] = A[i][j];\\n \\n for(int i=0;i<n;i++){\\n int pivot = i;\\n for(int j=i;j<n;j++){\\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\\n }\\n swap(B[i],B[pivot]);\\n if(abs(B[i][i]) > EPS) res++;\\n \\n \\n if(abs(B[i][i]) > EPS){\\n for(int j=i+1;j<=n;j++) B[i][j] /= B[i][i];\\n for(int j=0;j<n;j++){\\n if(i != j){\\n for(int k=i+1;k<=n;k++) B[j][k] -= B[j][i] * B[i][k];\\n }\\n }\\n }\\n }\\n return res;\\n}\\n\\n\\n\\nint main() {\\n srand((unsigned int)time(NULL));\\n int N,a,b,c,d,e,n,cnt=0;\\n cin >> N >> a >> b;\\n vector<int> s,t;\\n rep(i,N) {\\n cin >> c >> d;\\n e = abs(c-d);\\n if( e <= a || ( b <= e && e <= 2 * a ) ) ++cnt;\\n else s.push_back(c), t.push_back(d);\\n }\\n n = (int)s.size();\\n rep(i,n) {\\n REP(j,i+1,n) {\\n e = abs( ( s[i] + s[j] ) - ( t[i] + t[j] ) );\\n if( e <= a || ( b <= e && e <= 2 * a ) ) {\\n\\tA[i][j] = rand() % 1000000;\\n\\tA[j][i] = -A[i][j];\\n }\\n }\\n }\\n cout << cnt + (int)(rnk(n)/2) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 12616,\n \"score_of_the_acc\": -1.1212,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3032_2755903\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\nstruct Dinic{\\n const int INF=1<<28;\\n struct edge {\\n int to,cap,rev;\\n edge(){}\\n edge(int to,int cap,int rev):to(to),cap(cap),rev(rev){}\\n };\\n\\n int n;\\n vector<vector<edge> > G;\\n vector<map<int,int> > M;\\n vector<int> level,iter;\\n\\n Dinic(){}\\n Dinic(int sz):n(sz),G(n),M(n),level(n),iter(n){}\\n \\n void add_edge(int from,int to,int cap){\\n M[from][to]=G[from].size();\\n M[to][from]=G[to].size();\\n G[from].push_back(edge(to,cap,G[to].size()));\\n G[to].push_back(edge(from,0,G[from].size()-1));\\n }\\n \\n void bfs(int s){\\n fill(level.begin(),level.end(),-1);\\n queue<int> que;\\n level[s]=0;\\n que.push(s);\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n que.push(e.to);\\n }\\n }\\n }\\n }\\n int dfs(int v,int t,int f){\\n if(v==t) return f;\\n for(int &i=iter[v];i<(int)G[v].size();i++){\\n edge &e=G[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n G[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n int flow(int s,int t,int lim){\\n int fl=0;\\n for(;;){\\n bfs(s);\\n if(level[t]<0||lim==0) return fl;\\n fill(iter.begin(),iter.end(),0);\\n int f;\\n while((f=dfs(s,t,lim))>0){\\n fl+=f;\\n lim-=f;\\n }\\n }\\n }\\n};\\n\\nint N,A,B,ans,a,b;\\nvector<P>C1,C2;\\n\\nbool check(int a,int b){\\n int X=abs(a-b);\\n return X<=A||(B<=X&&X<=2*A);\\n}\\n\\nint main(){\\n\\n cin>>N>>A>>B;\\n\\n for(int i=0;i<N;i++){\\n cin>>a>>b;\\n if(check(a,b))ans++;\\n else{\\n if(a==b)continue;\\n if(a>b)C1.push_back(P(a,b));\\n else C2.push_back(P(a,b));\\n }\\n }\\n\\n int c1=C1.size(),c2=C2.size();\\n\\n Dinic D(c1+c2+2);\\n\\n for(int i=0;i<C1.size();i++){\\n for(int j=0;j<C2.size();j++){\\n int a=C1[i].first+C2[j].first;\\n int b=C1[i].second+C2[j].second;\\n if(check(a,b)){\\n D.add_edge(i,C1.size()+j,1);\\n }\\n }\\n }\\n\\n for(int i=0;i<C1.size();i++)D.add_edge(c1+c2,i,1);\\n for(int i=0;i<C2.size();i++)D.add_edge(c1+i,c1+c2+1,1);\\n\\n cout<<ans+D.flow(c1+c2,c1+c2+1,1e8)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7744,\n \"score_of_the_acc\": -0.3221,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3032_2754651\",\n \"code_snippet\": \"#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\\nclass MaxFlow {\\npublic:\\n struct edge { ll to, cap, rev; };\\n\\n const ll INF = 1LL << 60;\\n ll N;\\n vector< vector<edge> > E;\\n vector<bool> used;\\n\\n MaxFlow(ll n): N(n), E(n), used(n) {};\\n\\n void add_directed_edge(ll from, ll to, ll cap) {\\n E[from].push_back((edge) { to, cap, (ll) E[to].size() });\\n E[to].push_back((edge) { from, 0, (ll) E[from].size() - 1 });\\n }\\n\\n void add_undirected_edge(ll from, ll to, ll cap) {\\n E[from].push_back((edge) { to, cap, (ll) E[to].size() });\\n E[to].push_back((edge) { from, cap, (ll) E[from].size() - 1 });\\n }\\n\\n ll dfs(ll v, ll t, ll f) {\\n if(v == t) return f;\\n used[v] = true;\\n REP(i, 0, E[v].size()) {\\n edge &e = E[v][i];\\n if(!used[e.to] && e.cap > 0) {\\n ll d = dfs(e.to, t, min(f, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n E[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n ll max_flow(ll s, ll t) {\\n ll flow = 0;\\n while(1) {\\n REP(i, 0, N) used[i] = false;\\n ll f = dfs(s, t, INF);\\n if(f == 0 || f == INF) break;\\n flow += f;\\n }\\n return flow;\\n }\\n};\\n\\nint main(void) {\\n ll N, A, B;\\n cin >> N >> A >> B;\\n vector<ll> a(N), b(N);\\n REP(i, 0, N) cin >> a[i] >> b[i];\\n\\n ll ans = 0;\\n vector<bool> used(N, false);\\n REP(i, 0, N) {\\n ll d = abs(a[i] - b[i]);\\n if(d <= A || (B <= d && d <= 2 * A)) {\\n used[i] = true;\\n ans++;\\n }\\n }\\n\\n const ll s = N, t = N + 1;\\n MaxFlow flow(N + 2);\\n REP(i, 0, N) if(!used[i]) {\\n ll d = a[i] - b[i];\\n if(d > 0) flow.add_directed_edge(s, i, 1);\\n if(d < 0) flow.add_directed_edge(i, t, 1);\\n }\\n REP(i, 0, N) REP(j, 0, N) if(!used[i] && !used[j]) {\\n ll di = a[i] - b[i];\\n ll dj = a[j] - b[j];\\n ll d = abs(di + dj);\\n if(d <= A || (B <= d && d <= 2 * A)) {\\n if(di > 0 && dj < 0) flow.add_directed_edge(i, j, 1);\\n if(di < 0 && dj > 0) flow.add_directed_edge(j, i, 1);\\n }\\n }\\n ans += flow.max_flow(s, t);\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8060,\n \"score_of_the_acc\": -0.3729,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3032_2752011\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n\\n/*\\n<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day2/problems/G>\\n問題文============================================================\\n\\n N個の非負整数のペア(ai,bi)と非負整数A, B が与えられる。\\n 以下のいずれかの操作をできるだけたくさん行いたい。\\n \\n (1) |ai−bi|≤A または B≤|ai−bi|≤2Aを満たす要素iを取り出し、削除する\\n (2) |(ai+aj)−(bi+bj)|≤A または B≤|(ai+aj)−(bi+bj)|≤2A を満たす要素iと要素j (i≠j)の組を取り出し、削除する\\n \\n 最大の操作回数を求めよ。\\n \\n=================================================================\\n\\n解説=============================================================\\n\\n 出来うる限り 操作(1)を行う\\n その後、余った要素ペアに関して操作(2)の条件を満たすペアとの二部マッチングを解く\\n \\n================================================================\\n*/\\n\\nll V;\\nvector<vector<ll>> G;\\nvector<ll> match;\\nvector<int> used;\\n\\nvoid add_edge(ll u, ll v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n}\\n\\nbool dfs(ll v) {\\n used[v] = 1;\\n for (int i = 0; i < G[v].size(); i++) {\\n ll u = G[v][i], w = match[u];\\n if (w < 0 || ((used[w] == 0) && dfs(w))) {\\n match[v] = u;\\n match[u] = v;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nll bipartite_matching() {\\n ll res = 0;\\n for (int i = 0; i < (int)match.size();i++)match[i] = -1;\\n for (int v = 0;v < V;v++) {\\n if (match[v] < 0) {\\n for (int i = 0; i < (int)used.size();i++)used[i] = 0;\\n if (dfs(v))res++;\\n }\\n }\\n return res;\\n}\\n\\nint main(void) {\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n ll N,A,B; cin >> N >> A >> B;\\n vector<ll> a(N),b(N);\\n for(int i = 0; i < N;i++) cin >> a[i] >>b[i];\\n \\n vector<int> f(N,0);\\n for(int i = 0; i < N;i++){\\n ll Abs = abs(a[i]-b[i]);\\n if(Abs <= A || (B <= Abs && Abs <= 2*A)){\\n f[i] = -1;\\n }\\n }\\n ll cnt = -accumulate(f.begin(),f.end(),0LL);\\n V = 0;\\n for(int i = 0; i < N;i++){\\n if(f[i] == 0){\\n f[i] = V;\\n V++;\\n }\\n }\\n G.resize(V);\\n match.resize(V);\\n used.resize(V);\\n \\n for(int i = 0; i < N;i++){\\n for(int j = 0; j < N;j++){\\n if(f[i] == -1 || f[j] == -1) continue;\\n ll Absdayo = abs(a[i]+a[j]-b[i]-b[j]);\\n if(Absdayo <= A || (B <= Absdayo && Absdayo <= 2*A )){\\n add_edge(f[i],f[j]);\\n }\\n }\\n }\\n// cout << cnt << \\\" \\\" << bipartite_matching() << endl;\\n cout << cnt + bipartite_matching() << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4648,\n \"score_of_the_acc\": -0.0891,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3032_2751722\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n\\n/*\\n<url:>\\n問題文============================================================\\n\\n=================================================================\\n\\n解説=============================================================\\n\\n================================================================\\n*/\\n\\nll V;\\nvector<vector<ll>> G;\\nvector<ll> match;\\nvector<int> used;\\n\\nvoid add_edge(ll u, ll v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n}\\n\\nbool dfs(ll v) {\\n used[v] = 1;\\n for (int i = 0; i < G[v].size(); i++) {\\n ll u = G[v][i], w = match[u];\\n if (w < 0 || ((used[w] == 0) && dfs(w))) {\\n match[v] = u;\\n match[u] = v;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nll bipartite_matching() {\\n ll res = 0;\\n for (int i = 0; i < (int)match.size();i++)match[i] = -1;\\n for (int v = 0;v < V;v++) {\\n if (match[v] < 0) {\\n for (int i = 0; i < (int)used.size();i++)used[i] = 0;\\n if (dfs(v))res++;\\n }\\n }\\n return res;\\n}\\n\\nint main(void) {\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n ll N,A,B; cin >> N >> A >> B;\\n vector<ll> a(N),b(N);\\n for(int i = 0; i < N;i++) cin >> a[i] >>b[i];\\n \\n vector<int> f(N,0);\\n for(int i = 0; i < N;i++){\\n ll Abs = abs(a[i]-b[i]);\\n if(Abs <= A || (B <= Abs && Abs <= 2*A)){\\n f[i] = -1;\\n }\\n }\\n ll cnt = -accumulate(f.begin(),f.end(),0LL);\\n V = 0;\\n for(int i = 0; i < N;i++){\\n if(f[i] == 0){\\n f[i] = V;\\n V++;\\n }\\n }\\n G.resize(V);\\n match.resize(V);\\n used.resize(V);\\n \\n for(int i = 0; i < N;i++){\\n for(int j = 0; j < N;j++){\\n if(f[i] == -1 || f[j] == -1) continue;\\n ll Absdayo = abs(a[i]+a[j]-b[i]-b[j]);\\n if(Absdayo <= A || (B <= Absdayo && Absdayo <= 2*A )){\\n add_edge(f[i],f[j]);\\n }\\n }\\n }\\n// cout << cnt << \\\" \\\" << bipartite_matching() << endl;\\n cout << cnt + bipartite_matching() << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4480,\n \"score_of_the_acc\": -0.0765,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3032_2751553\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\ntypedef long long ll;\\n\\nint N,A,B;\\nint a[830], b[830];\\nint c[830];\\n\\nbool g[830][830];\\n\\nint main(){\\n scanf(\\\"%d%d%d\\\",&N,&A,&B);\\n REP(i,N)scanf(\\\"%d%d\\\",a+i,b+i);\\n REP(i,N)c[i] = a[i]-b[i];\\n int ans = 0;\\n vector<int> pos, neg;\\n REP(i,N){\\n if(abs(c[i])<=A || (B<=abs(c[i]) && abs(c[i])<=2*A)){\\n ans++;\\n }else{\\n (c[i]<0 ? neg : pos).push_back(c[i]);\\n }\\n }\\n int n = pos.size(), m = neg.size();\\n REP(i,n)REP(j,m){\\n int x = pos[i] + neg[j];\\n if(abs(x)<=A || (B<=abs(x) && abs(x)<=2*A)){\\n g[i][n+j] = true;\\n }else{\\n g[i][n+j] = false;\\n }\\n }\\n int s = n+m;\\n int t = n+m+1;\\n REP(i,n)g[s][i] = true;\\n REP(j,m)g[n+j][t] = true;\\n while(true){\\n vector<int> bef(n+m+2, -1);\\n vector<bool> used(n+m+2, false);\\n stack<int> S;\\n S.push(s);\\n used[s] = true;\\n while(!S.empty()){\\n int p = S.top(); S.pop();\\n REP(to,n+m+2)if(!used[to]){\\n if(!g[p][to])continue;\\n used[to] = true;\\n bef[to] = p;\\n S.push(to);\\n }\\n }\\n if(!used[t])break;\\n int cur = t;\\n while(cur != s){\\n int b = bef[cur];\\n g[b][cur] = false;\\n g[cur][b] = true;\\n cur = b;\\n }\\n ans++;\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3848,\n \"score_of_the_acc\": -1.0289,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3032_2751548\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb emplace_back\\n#define INF (1e9+1)\\n\\n\\n//2部最大マッチング verified AOJ GRL_7_A\\n#define MAX_V 800\\nvector<int> G[MAX_V];\\nint match[MAX_V];\\nbool used[MAX_V];\\n\\nvoid add_edge(int u,int v){\\n G[u].pb(v);\\n G[v].pb(u);\\n}\\n\\n// 増大路をDFSで探す\\nbool dfs(int v){\\n used[v]=true;\\n rep(i,G[v].size()){\\n int u=G[v][i],w=match[u]; //u:vからの移動先の頂点 , w:uとマッチングしている頂点\\n if(w<0 || (!used[w] && dfs(w))){ //uがフリーか、このdfsではwを使っておらず かつwの別のペアが見つかった(=増大路発見) 場合\\n match[v]=u;\\n match[u]=v;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint bipartite_matching(int V){\\n int res=0;\\n rep(i,MAX_V)match[i]=-1;\\n rep(v,V){\\n if(match[v]<0){\\n rep(i,MAX_V)used[i]=0;\\n if( dfs(v) ) res++; //増大路が見つかればres+=1\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n int ans = 0;\\n int v,a,b;\\n cin>>v>>a>>b;\\n \\n vector<int> s(v),t(v);\\n rep(i,v){\\n cin>>s[i]>>t[i];\\n if(abs(s[i]-t[i])<=a or (b<=abs(s[i]-t[i]) and abs(s[i]-t[i])<=2*a))ans++;\\n }\\n \\n auto g = [](int ai,int bi, int aj, int bj){\\n return abs((ai+aj)-(bi+bj));\\n };\\n \\n rep(i,v){\\n if(abs(s[i]-t[i])<=a or (b<=abs(s[i]-t[i]) and abs(s[i]-t[i])<=2*a))continue;\\n rep(j,v){\\n if(abs(s[j]-t[j])<=a or (b<=abs(s[j]-t[j]) and abs(s[j]-t[j])<=2*a))continue;\\n \\n if(g(s[i],t[i],s[j],t[j])<=a or (b<=g(s[i],t[i],s[j],t[j]) and g(s[i],t[i],s[j],t[j])<=2*a) ){\\n G[i].pb(j);\\n }\\n }\\n }\\n cout<<bipartite_matching(v)+ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3032_2751514\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cassert>\\n\\n#include <vector>\\n\\nusing namespace std;\\n\\nclass MaximumMatching {\\n /*\\n Maximum Cardinality Matching in General Graphs.\\n - O(\\\\sqrt{n} m \\\\log_{\\\\max\\\\{2, 1 + m/n\\\\}} n) time\\n - O(n + m) space \\n Note: each vertex is 1-indexed.\\n Ref: \\n Harold N. Gabow,\\n \\\"The Weighted Matching Approach to Maximum Cardinality Matching\\\" (2017)\\n (https://arxiv.org/abs/1703.03998)\\n */\\npublic:\\n struct Edge { int from, to; };\\n static constexpr int Inf = 1 << 30;\\n\\nprivate:\\n enum Label { \\n kInner = -1, // should be < 0\\n kFree = 0 // should be 0\\n };\\n struct Link { int from, to; };\\n struct Log { int v, par; };\\n\\n struct LinkedList {\\n LinkedList() {}\\n LinkedList(int N, int M) : N(N), next(M) { clear(); }\\n void clear() { head.assign(N, -1); }\\n void push(int h, int u) { next[u] = head[h], head[h] = u; }\\n int N;\\n vector<int> head, next;\\n };\\n\\n template <typename T>\\n struct Queue {\\n Queue() {}\\n Queue(int N) : qh(0), qt(0), data(N) {}\\n T operator [] (int i) const { return data[i]; }\\n void enqueue(int u) { data[qt++] = u; }\\n int dequeue() { return data[qh++]; }\\n bool empty() const { return qh == qt; }\\n void clear() { qh = qt = 0; }\\n int size() const { return qt; }\\n int qh, qt;\\n vector<T> data;\\n };\\n\\n struct DisjointSetUnion {\\n DisjointSetUnion() {}\\n DisjointSetUnion(int N) : par(N) {\\n for (int i = 0; i < N; ++i) par[i] = i;\\n }\\n int find(int u) { return par[u] == u ? u : (par[u] = find(par[u])); }\\n void unite(int u, int v) {\\n u = find(u), v = find(v);\\n if (u != v) par[v] = u;\\n }\\n vector<int> par;\\n };\\n\\npublic:\\n MaximumMatching(int N, const vector<Edge>& in)\\n : N(N), NH(N >> 1), ofs(N + 2, 0), edges(in.size() * 2) {\\n\\n for (auto& e : in) ofs[e.from + 1] += 1, ofs[e.to + 1] += 1;\\n for (int i = 1; i <= N + 1; ++i) ofs[i] += ofs[i - 1];\\n for (auto& e : in) {\\n edges[ofs[e.from]++] = e; edges[ofs[e.to]++] = {e.to, e.from};\\n }\\n for (int i = N + 1; i > 0; --i) ofs[i] = ofs[i - 1];\\n ofs[0] = 0;\\n }\\n\\n int maximum_matching() {\\n initialize();\\n int match = 0;\\n while (match * 2 + 1 < N) {\\n reset_count();\\n bool has_augmenting_path = do_edmonds_search();\\n if (!has_augmenting_path) break;\\n match += find_maximal();\\n clear();\\n }\\n return match;\\n }\\n\\nprivate:\\n void reset_count() {\\n time_current_ = 0; time_augment_ = Inf;\\n contract_count_ = 0; outer_id_ = 1;\\n dsu_changelog_size_ = dsu_changelog_last_ = 0;\\n }\\n\\n void clear() {\\n que.clear();\\n for (int u = 1; u <= N; ++u) potential[u] = 1;\\n for (int u = 1; u <= N; ++u) dsu.par[u] = u;\\n for (int t = time_current_; t <= N / 2; ++t) list.head[t] = -1;\\n for (int u = 1; u <= N; ++u) blossom.head[u] = -1;\\n }\\n\\n // first phase\\n\\n inline void grow(int x, int y, int z) {\\n label[y] = kInner;\\n potential[y] = time_current_; // visited time\\n link[z] = {x, y}; label[z] = label[x];\\n potential[z] = time_current_ + 1;\\n que.enqueue(z);\\n }\\n\\n void contract(int x, int y) {\\n int bx = dsu.find(x), by = dsu.find(y);\\n const int h = -(++contract_count_) + kInner;\\n label[mate[bx]] = label[mate[by]] = h;\\n int lca = -1;\\n while (1) {\\n if (mate[by] != 0) swap(bx, by);\\n bx = lca = dsu.find(link[bx].from);\\n if (label[mate[bx]] == h) break;\\n label[mate[bx]] = h;\\n }\\n for (auto bv : {dsu.par[x], dsu.par[y]}) {\\n for (; bv != lca; bv = dsu.par[link[bv].from]) {\\n int mv = mate[bv];\\n link[mv] = {x, y}; label[mv] = label[x];\\n potential[mv] = 1 + (time_current_ - potential[mv]) + time_current_;\\n que.enqueue(mv);\\n dsu.par[bv] = dsu.par[mv] = lca;\\n dsu_changelog[dsu_changelog_last_++] = {bv, lca};\\n dsu_changelog[dsu_changelog_last_++] = {mv, lca};\\n }\\n }\\n }\\n\\n bool find_augmenting_path() {\\n while (!que.empty()) {\\n int x = que.dequeue(), lx = label[x], px = potential[x], bx = dsu.find(x);\\n for (int eid = ofs[x]; eid < ofs[x + 1]; ++eid) {\\n int y = edges[eid].to;\\n if (label[y] > 0) { // outer blossom/vertex\\n int time_next = (px + potential[y]) >> 1;\\n if (lx != label[y]) {\\n if (time_next == time_current_) return true;\\n time_augment_ = min(time_next, time_augment_);\\n } else {\\n if (bx == dsu.find(y)) continue;\\n if (time_next == time_current_) {\\n contract(x, y); bx = dsu.find(x);\\n } else if (time_next <= NH) list.push(time_next, eid);\\n }\\n } else if (label[y] == kFree) { // free vertex\\n int time_next = px + 1;\\n if (time_next == time_current_) grow(x, y, mate[y]);\\n else if (time_next <= NH) list.push(time_next, eid);\\n }\\n }\\n }\\n return false;\\n }\\n\\n bool adjust_dual_variables() {\\n // Return true if the current matching is maximum.\\n const int time_lim = min(NH + 1, time_augment_);\\n for (++time_current_; time_current_ <= time_lim; ++time_current_) {\\n dsu_changelog_size_ = dsu_changelog_last_;\\n if (time_current_ == time_lim) break;\\n bool updated = false;\\n for (int h = list.head[time_current_]; h >= 0; h = list.next[h]) {\\n auto& e = edges[h]; int x = e.from, y = e.to;\\n if (label[y] > 0) {\\n // Case: outer -- (free => inner => outer)\\n if (potential[x] + potential[y] != (time_current_ << 1)) continue;\\n if (dsu.find(x) == dsu.find(y)) continue;\\n if (label[x] != label[y]) { time_augment_ = time_current_; return false; }\\n contract(x, y); updated = true;\\n } else if (label[y] == kFree) {\\n grow(x, y, mate[y]); updated = true;\\n }\\n }\\n list.head[time_current_] = -1;\\n if (updated) return false;\\n }\\n return time_current_ > NH;\\n }\\n\\n bool do_edmonds_search() {\\n label[0] = kFree;\\n for (int u = 1; u <= N; ++u) {\\n if (mate[u] == 0) {\\n que.enqueue(u); label[u] = u; // component id\\n } else label[u] = kFree;\\n }\\n while (1) {\\n if (find_augmenting_path()) break;\\n bool maximum = adjust_dual_variables();\\n if (maximum) return false;\\n if (time_current_ == time_augment_) break;\\n }\\n for (int u = 1; u <= N; ++u) {\\n if (label[u] > 0) potential[u] -= time_current_;\\n else if (label[u] < 0) potential[u] = 1 + (time_current_ - potential[u]);\\n }\\n return true;\\n }\\n\\n // second phase\\n\\n void rematch(int v, int w) {\\n int t = mate[v]; mate[v] = w;\\n if (mate[t] != v) return;\\n if (link[v].to == dsu.find(link[v].to)) {\\n mate[t] = link[v].from;\\n rematch(mate[t], t);\\n } else {\\n int x = link[v].from, y = link[v].to;\\n rematch(x, y); rematch(y, x);\\n }\\n }\\n\\n bool dfs_augment(int x, int bx) {\\n int px = potential[x], lx = label[bx];\\n for (int eid = ofs[x]; eid < ofs[x + 1]; ++eid) {\\n int y = edges[eid].to;\\n if (px + potential[y] != 0) continue;\\n int by = dsu.find(y), ly = label[by];\\n if (ly > 0) { // outer\\n if (lx >= ly) continue;\\n int stack_beg = stack_last_;\\n for (int bv = by; bv != bx; bv = dsu.find(link[bv].from)) {\\n int bw = dsu.find(mate[bv]);\\n stack[stack_last_++] = bw; link[bw] = {x, y};\\n dsu.par[bv] = dsu.par[bw] = bx;\\n }\\n while (stack_last_ > stack_beg) {\\n int bv = stack[--stack_last_];\\n for (int v = blossom.head[bv]; v >= 0; v = blossom.next[v]) {\\n if (!dfs_augment(v, bx)) continue;\\n stack_last_ = stack_beg;\\n return true;\\n }\\n }\\n } else if (ly == kFree) {\\n label[by] = kInner; int z = mate[by];\\n if (z == 0) { rematch(x, y); rematch(y, x); return true; }\\n int bz = dsu.find(z);\\n link[bz] = {x, y}; label[bz] = outer_id_++;\\n for (int v = blossom.head[bz]; v >= 0; v = blossom.next[v]) {\\n if (dfs_augment(v, bz)) return true;\\n }\\n }\\n }\\n return false;\\n }\\n\\n int find_maximal() {\\n // discard blossoms whose potential is 0.\\n for (int u = 1; u <= N; ++u) dsu.par[u] = u;\\n for (int i = 0; i < dsu_changelog_size_; ++i) {\\n dsu.par[dsu_changelog[i].v] = dsu_changelog[i].par;\\n }\\n for (int u = 1; u <= N; ++u) {\\n label[u] = kFree; blossom.push(dsu.find(u), u);\\n }\\n int ret = 0;\\n for (int u = 1; u <= N; ++u) if (!mate[u]) {\\n int bu = dsu.par[u];\\n if (label[bu] != kFree) continue;\\n label[bu] = outer_id_++;\\n for (int v = blossom.head[bu]; v >= 0; v = blossom.next[v]) {\\n if (!dfs_augment(v, bu)) continue;\\n ret += 1;\\n break;\\n }\\n }\\n assert(ret >= 1);\\n return ret;\\n }\\n\\n // init\\n\\n void initialize() {\\n que = Queue<int>(N);\\n\\n mate.assign(N + 1, 0);\\n potential.assign(N + 1, 1);\\n label.assign(N + 1, kFree);\\n link.assign(N + 1, {0, 0});\\n\\n dsu_changelog.resize(N);\\n\\n dsu = DisjointSetUnion(N + 1);\\n list = LinkedList(NH + 1, edges.size());\\n\\n blossom = LinkedList(N + 1, N + 1);\\n stack.resize(N); stack_last_ = 0;\\n }\\n\\nprivate:\\n const int N, NH;\\n vector<int> ofs; vector<Edge> edges;\\n\\n Queue<int> que;\\n\\n vector<int> mate, potential;\\n vector<int> label; vector<Link> link;\\n\\n vector<Log> dsu_changelog; int dsu_changelog_last_, dsu_changelog_size_;\\n\\n DisjointSetUnion dsu;\\n LinkedList list, blossom;\\n vector<int> stack; int stack_last_;\\n \\n int time_current_, time_augment_;\\n int contract_count_, outer_id_;\\n};\\n\\nusing Edge = MaximumMatching::Edge;\\n\\n// main function\\n#include <iostream>\\n#include <set>\\n#include <random>\\nvector<pair<int,int> >ve;\\nint a[1000],b[1000];\\nint main() {\\n\\n\\tint n,aa,bb;\\n\\tcin>>n>>aa>>bb;\\n\\tfor(int i=1;i<=n;i++)cin>>a[i]>>b[i];\\n\\n\\t\\n\\tfor(int i=1;i<=n;i++)if(abs(a[i]-b[i])<=aa || (bb<=abs(a[i]-b[i]) && abs(a[i]-b[i])<=2*aa)){\\n\\t\\t\\n\\t\\tve.push_back(make_pair(i,i+n));\\n\\t}\\n\\tfor(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){\\n\\t\\tint f=abs(a[i]+a[j]-b[i]-b[j]);\\n\\t\\tif(f<=aa || (bb<=f && f<=2*aa)) {\\n\\t\\t\\tve.push_back(make_pair(i,j));\\n\\t\\t}\\n\\t}\\n\\t\\n\\t\\n\\t\\n\\t\\n\\tmt19937 mt(12345);\\n\\n auto run = [] (int N, const vector<Edge>& edges) {\\n clock_t beg = clock();\\n auto mm = MaximumMatching(N, edges);\\n auto ans = mm.maximum_matching();\\n clock_t end = clock();\\n cout<<ans<<endl;\\n };\\n\\n const int K = 2000;\\n\\n // random\\n {\\n \\tconst int N = K, M = ve.size();\\n // uniform_int_distribution<int> urand(1, N);\\n vector<Edge> edges(M);\\n for (int i = 0; i < M; ++i) {\\n \\tint u =ve[i].first, v = ve[i].second;\\n edges[i] = {u, v};\\n }\\n run(N, edges);\\n }\\n\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 15148,\n \"score_of_the_acc\": -0.8793,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3032_2751473\",\n \"code_snippet\": \"// g++ -std=c++11 a.cpp\\n#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<random>\\n#include<cstring>\\n#include<queue>\\n#include<stack>\\n#include<bitset>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#include<assert.h>\\n#include<typeinfo>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\n//#define int ll\\ntypedef int Def;\\ntypedef pair<Def,Def> pii;\\ntypedef vector<Def> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef vector<string> vs;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef pair<Def,pii> pip;\\ntypedef vector<pip>vip;\\n// #define mt make_tuple\\n//typedef tuple<pii,int,int> tp;\\n//typedef vector<tp> vt;\\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\\n//template<class C>constexpr int size(const C &c){return (int)c.size();}\\n//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}\\nconst double PI=acos(-1);\\nconst double EPS=1e-7;\\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;\\nint dx[]={0,1,0,-1};\\nint dy[]={1,0,-1,0};\\nstruct edge{int to,cap,rev;};//ikisaki youryou gyakuhen\\nclass MF{//max flow\\n\\tpublic:\\n\\tint n;\\n\\tvector<vector<edge> >G;//[MAX];\\n\\tvector<bool>used;//[MAX];\\n\\tMF(int size){\\n\\t\\tn=size;\\n\\t\\tG=vector<vector<edge> >(n);\\n\\t}\\n\\tvoid add_edge(int from, int to, int cap){\\n\\t\\tedge q={to,cap,int(G[to].size())};\\n\\t\\tG[from].push_back(q);\\n\\t\\tq={from,0,int(G[from].size()-1)};\\n\\t\\tG[to].push_back(q);\\n\\t}\\n\\tint dfs(int v,int t, int f) {\\n\\t\\tif(v==t)return f;\\n\\t\\tused[v]=1;\\n\\t\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\t\\tedge &e=G[v][i];\\n\\t\\t\\tif(used[e.to]||e.cap<=0) continue;\\n\\t\\t\\tint d =dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.cap-=d;\\n\\t\\t\\t\\tG[e.to][e.rev].cap+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\tint mf(int s,int t) {//from s to t,ford_fulkerson\\n\\t\\tint flow=0,f;\\n\\t\\twhile(1){\\n\\t\\t\\tused=vector<bool>(n,false);\\n\\t\\t\\tf=dfs(s,t,inf);\\n\\t\\t\\tif(f==0)return flow;\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n};\\nint main(){\\n\\tint n,m,a,b;\\n\\tcin>>n>>a>>b;\\n\\tvi A,B,in(n);\\n\\trep(i,n){\\n\\t\\tint q,w;\\n\\t\\tcin>>q>>w;\\n\\t\\tin[i]=q-w;\\n\\t}\\n\\tint out=0;\\n\\trep(i,n)if(abs(in[i])<=a||b<=abs(in[i])&&abs(in[i])<=2*a)out++;\\n\\telse if(in[i]>0)A.pb(in[i]);\\n\\telse B.pb(in[i]);\\n\\t\\n\\tn=A.size(),m=B.size();\\n\\tMF mf(2+n+m);\\n\\tint s=n+m,t=s+1;\\n\\trep(i,n)mf.add_edge(s,i,1);\\n\\trep(i,m)mf.add_edge(n+i,t,1);\\n\\trep(i,n)rep(j,m){\\n\\t\\tint w=abs(A[i]+B[j]);\\n\\t\\tif(w<=a||b<=w&&w<=2*a)mf.add_edge(i,n+j,1);\\n\\t}\\n\\tout+=mf.mf(s,t);\\n\\tcout<<out<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4380,\n \"score_of_the_acc\": -0.0689,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3032_2751354\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))\\n#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))\\nstatic const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;\\ntypedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;\\ntemplate<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }\\ntemplate<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }\\n#define each(it,o) for(auto it = (o).begin(); it != (o).end(); ++ it)\\n#define all(o) (o).begin(), (o).end()\\n#define pb(x) push_back(x)\\n#define mp(x,y) make_pair((x),(y))\\n#ifdef _DEBUG\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src_, int dst_, Weight weight_) : src(src_), dst(dst_), weight(weight_) { }\\n\\tEdge() {};\\n};\\ntypedef vector<Edge> Edges;\\nstruct MaxWeightMatching {\\n\\tint nEdge, nVertex;\\n\\tWeight maxWeight;\\n\\tvi endPoint, mate, label, labelEdge,\\n\\t\\tinBlossom, blossomParent, blossomBase,\\n\\t\\tbestEdge, unusedBlossoms, allowEdge,\\n\\t\\tblossomBestEdgesUsed,\\n\\t\\tsVerteices;\\n\\tvector<Weight> dualVar;\\n\\tvector<vi> neighbEnd, blossomChilds, blossomEdges,\\n\\t\\tblossomBestEdges;\\n\\tEdges edges;\\n\\tbool maxCardinality;\\n\\n\\tWeight slack(int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\treturn dualVar[e.src] + dualVar[e.dst] - 2 * e.weight;\\n\\t}\\n\\tstruct BlossomLeaves {\\n\\t\\tint b;\\n\\t\\tMaxWeightMatching *mw;\\n\\t\\tenum { INITAL, END, NEXT, THIRD } state;\\n\\t\\tvi::const_iterator iter, endi;\\n\\t\\tBlossomLeaves *bl;\\n\\t\\tBlossomLeaves(MaxWeightMatching *mw_, int b_) :\\n\\t\\t\\tmw(mw_), b(b_), state(INITAL), bl(NULL) {}\\n\\t\\tbool next(int &r) {\\n\\t\\t\\tint t;\\n\\t\\t\\tswitch (state) {\\n\\t\\t\\tcase INITAL:\\n\\t\\t\\t\\tif (b < mw->nVertex) {\\n\\t\\t\\t\\t\\tr = b;\\n\\t\\t\\t\\t\\tstate = END;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\titer = mw->blossomChilds[b].begin();\\n\\t\\t\\t\\t\\tendi = mw->blossomChilds[b].end();\\n\\t\\t\\t\\t\\tstate = NEXT;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase END:\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\tcase NEXT:\\n\\t\\t\\t\\tif (iter == endi)\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\tt = *iter;\\n\\t\\t\\t\\t++iter;\\n\\t\\t\\t\\tif (t < mw->nVertex) {\\n\\t\\t\\t\\t\\tr = t;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tbl = new BlossomLeaves(mw, t);\\n\\t\\t\\t\\t\\tstate = THIRD;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase THIRD:\\n\\t\\t\\t\\tif (!bl->next(t)) {\\n\\t\\t\\t\\t\\tstate = NEXT;\\n\\t\\t\\t\\t\\tdelete bl; bl = NULL;\\n\\t\\t\\t\\t\\treturn next(r);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tr = t;\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t};\\n\\tvoid assignLabel(int w, int t, int p) {\\n\\t\\tint b = inBlossom[w];\\n\\t\\tlabel[w] = label[b] = t;\\n\\t\\tlabelEdge[w] = labelEdge[b] = p;\\n\\t\\tbestEdge[w] = bestEdge[b] = -1;\\n\\t\\tif (t == 1) {\\n\\t\\t\\tBlossomLeaves bl(this, b);\\n\\t\\t\\tfor (int r; bl.next(r); ) sVerteices.push_back(r);\\n\\t\\t}\\n\\t\\telse if (t == 2) {\\n\\t\\t\\tint base = blossomBase[b];\\n\\t\\t\\tassignLabel(endPoint[mate[base]], 1, mate[base] ^ 1);\\n\\t\\t}\\n\\t}\\n\\tint scanBlossom(int v, int w) {\\n\\t\\tvi path;\\n\\t\\tint base = -1;\\n\\t\\twhile (v != -1) {\\n\\t\\t\\tint b = inBlossom[v];\\n\\t\\t\\tif (label[b] & 4) {\\n\\t\\t\\t\\tbase = blossomBase[b];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tpath.push_back(b);\\n\\t\\t\\tlabel[b] = 5;\\n\\t\\t\\tif (labelEdge[b] == -1) {\\n\\t\\t\\t\\tv = -1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tv = endPoint[labelEdge[b]];\\n\\t\\t\\t\\tb = inBlossom[v];\\n\\t\\t\\t\\tv = endPoint[labelEdge[b]];\\n\\t\\t\\t}\\n\\t\\t\\tif (w != -1)\\n\\t\\t\\t\\tswap(v, w);\\n\\t\\t}\\n\\t\\teach(it, path)\\n\\t\\t\\tlabel[*it] = 1;\\n\\t\\treturn base;\\n\\t}\\n\\tvoid addBlossom(int base, int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\tint bb = inBlossom[base],\\n\\t\\t\\tbv = inBlossom[e.src],\\n\\t\\t\\tbw = inBlossom[e.dst];\\n\\t\\tint b = unusedBlossoms.back(); unusedBlossoms.pop_back();\\n\\t\\tblossomBase[b] = base;\\n\\t\\tblossomParent[b] = -1;\\n\\t\\tblossomParent[bb] = b;\\n\\t\\tblossomChilds[b].clear();\\n\\t\\tblossomEdges[b].clear();\\n\\t\\tvi &bChilds = blossomChilds[b];\\n\\t\\tvi &bEdges = blossomEdges[b];\\n\\t\\twhile (bv != bb) {\\n\\t\\t\\tblossomParent[bv] = b;\\n\\t\\t\\tbChilds.push_back(bv);\\n\\t\\t\\tbEdges.push_back(labelEdge[bv]);\\n\\t\\t\\tbv = inBlossom[endPoint[labelEdge[bv]]];\\n\\t\\t}\\n\\t\\tbChilds.push_back(bb);\\n\\t\\treverse(all(bChilds));\\n\\t\\treverse(all(bEdges));\\n\\t\\tbEdges.push_back(2 * k);\\n\\t\\twhile (bw != bb) {\\n\\t\\t\\tblossomParent[bw] = b;\\n\\t\\t\\tbChilds.push_back(bw);\\n\\t\\t\\tbEdges.push_back(labelEdge[bw] ^ 1);\\n\\t\\t\\tbw = inBlossom[endPoint[labelEdge[bw]]];\\n\\t\\t}\\n\\t\\tlabel[b] = 1;\\n\\t\\tlabelEdge[b] = labelEdge[bb];\\n\\t\\tdualVar[b] = 0;\\n\\t\\tBlossomLeaves bl(this, b);\\n\\t\\tfor (int v; bl.next(v); ) {\\n\\t\\t\\tif (label[inBlossom[v]] == 2)\\n\\t\\t\\t\\tsVerteices.push_back(v);\\n\\t\\t\\tinBlossom[v] = b;\\n\\t\\t}\\n\\t\\tvi bestEdgeTo(2 * nVertex, -1);\\n\\t\\teach(it, bChilds) {\\n\\t\\t\\tint bv2 = *it;\\n\\t\\t\\tvector<vi> nbLists;\\n\\t\\t\\tif (!blossomBestEdgesUsed[bv2]) {\\n\\t\\t\\t\\tBlossomLeaves bl2(this, bv2);\\n\\t\\t\\t\\tfor (int v2; bl2.next(v2); ) {\\n\\t\\t\\t\\t\\tnbLists.push_back(neighbEnd[v2]);\\n\\t\\t\\t\\t\\tvi &vv = nbLists.back();\\n\\t\\t\\t\\t\\teach(i, vv)\\n\\t\\t\\t\\t\\t\\t*i /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnbLists.push_back(blossomBestEdges[bv2]);\\n\\t\\t\\t}\\n\\t\\t\\teach(itt, nbLists) {\\n\\t\\t\\t\\teach(ittt, *itt) {\\n\\t\\t\\t\\t\\tint k2 = *ittt;\\n\\t\\t\\t\\t\\tEdge &e2 = edges[k2];\\n\\t\\t\\t\\t\\tint i = e2.src, j = e2.dst;\\n\\t\\t\\t\\t\\tif (inBlossom[j] == b)\\n\\t\\t\\t\\t\\t\\tswap(i, j);\\n\\t\\t\\t\\t\\tint bj = inBlossom[j];\\n\\t\\t\\t\\t\\tif (bj != b && label[bj] == 1 &&\\n\\t\\t\\t\\t\\t\\t(bestEdgeTo[bj] == -1 ||\\n\\t\\t\\t\\t\\t\\t\\tslack(k2) < slack(bestEdgeTo[bj]))) {\\n\\t\\t\\t\\t\\t\\tbestEdgeTo[bj] = k2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tblossomBestEdgesUsed[bv2] = false;\\n\\t\\t\\tblossomBestEdges[bv2].clear();\\n\\t\\t\\tbestEdge[bv2] = -1;\\n\\t\\t}\\n\\t\\tblossomBestEdgesUsed[b] = true;\\n\\t\\tblossomBestEdges[b].clear();\\n\\t\\teach(it, bestEdgeTo)\\n\\t\\t\\tif (*it != -1)\\n\\t\\t\\t\\tblossomBestEdges[b].push_back(*it);\\n\\t\\tbestEdge[b] = -1;\\n\\t\\teach(it, blossomBestEdges[b])\\n\\t\\t\\tif (bestEdge[b] == -1 || slack(*it) < slack(bestEdge[b]))\\n\\t\\t\\t\\tbestEdge[b] = *it;\\n\\t}\\n\\tvoid expandBlossom(int b, bool endStage) {\\n\\t\\tint cSize = blossomChilds[b].size();\\n\\t\\teach(it, blossomChilds[b]) {\\n\\t\\t\\tint s = *it;\\n\\t\\t\\tblossomParent[s] = -1;\\n\\t\\t\\tif (s < nVertex)\\n\\t\\t\\t\\tinBlossom[s] = s;\\n\\t\\t\\telse if (endStage && dualVar[s] == 0)\\n\\t\\t\\t\\texpandBlossom(s, endStage);\\n\\t\\t\\telse {\\n\\t\\t\\t\\tBlossomLeaves bl(this, s);\\n\\t\\t\\t\\tfor (int v; bl.next(v); )\\n\\t\\t\\t\\t\\tinBlossom[v] = s;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!endStage && label[b] == 2) {\\n\\t\\t\\tint entryChild = inBlossom[endPoint[labelEdge[b] ^ 1]];\\n\\t\\t\\tint j = find(all(blossomChilds[b]), entryChild) - blossomChilds[b].begin();\\n\\t\\t\\tint jStep, evenOdd;\\n\\t\\t\\tif (j & 1)\\n\\t\\t\\t\\tjStep = 1, evenOdd = 0;\\n\\t\\t\\telse\\n\\t\\t\\t\\tjStep = -1, evenOdd = 1;\\n\\t\\t\\tint p = labelEdge[b];\\n\\t\\t\\twhile (j != 0) {\\n\\t\\t\\t\\tlabel[endPoint[p ^ 1]] = 0;\\n\\t\\t\\t\\tlabel[endPoint[blossomEdges[b][j - evenOdd] ^ evenOdd ^ 1]] = 0;\\n\\t\\t\\t\\tassignLabel(endPoint[p ^ 1], 2, p);\\n\\t\\t\\t\\tallowEdge[blossomEdges[b][j - evenOdd] / 2] = true;\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t\\tp = blossomEdges[b][j - evenOdd] ^ evenOdd;\\n\\t\\t\\t\\tallowEdge[p / 2] = true;\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t}\\n\\t\\t\\tint bv = blossomChilds[b][j];\\n\\t\\t\\tlabel[endPoint[p ^ 1]] = label[bv] = 2;\\n\\t\\t\\tlabelEdge[endPoint[p ^ 1]] = labelEdge[bv] = p;\\n\\t\\t\\tbestEdge[bv] = -1;\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\twhile (blossomChilds[b][j] != entryChild) {\\n\\t\\t\\t\\tbv = blossomChilds[b][j];\\n\\t\\t\\t\\tif (label[bv] == 1) {\\n\\t\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tBlossomLeaves bl(this, bv);\\n\\t\\t\\t\\tint v;\\n\\t\\t\\t\\twhile (bl.next(v))\\n\\t\\t\\t\\t\\tif (label[v] != 0)\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tif (label[v] != 0) {\\n\\t\\t\\t\\t\\tlabel[v] = 0;\\n\\t\\t\\t\\t\\tlabel[endPoint[mate[blossomBase[bv]]]] = 0;\\n\\t\\t\\t\\t\\tassignLabel(v, 2, labelEdge[v]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlabel[b] = labelEdge[b] = -1;\\n\\t\\tblossomChilds[b].clear();\\n\\t\\tblossomEdges[b].clear();\\n\\t\\tblossomBestEdgesUsed[b] = false;\\n\\t\\tblossomBestEdges[b].clear();\\n\\t\\tbestEdge[b] = -1;\\n\\t\\tunusedBlossoms.push_back(b);\\n\\t}\\n\\tvoid augmentBlossom(int b, int v) {\\n\\t\\tint cSize = blossomChilds[b].size();\\n\\t\\tint t = v;\\n\\t\\twhile (blossomParent[t] != b)\\n\\t\\t\\tt = blossomParent[t];\\n\\t\\tif (t >= nVertex)\\n\\t\\t\\taugmentBlossom(t, v);\\n\\t\\tint i, j, jStep, evenOdd;\\n\\t\\ti = j = find(all(blossomChilds[b]), t) - blossomChilds[b].begin();\\n\\t\\tif (i & 1)\\n\\t\\t\\tjStep = 1, evenOdd = 0;\\n\\t\\telse\\n\\t\\t\\tjStep = -1, evenOdd = 1;\\n\\t\\twhile (j != 0) {\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\tt = blossomChilds[b][j];\\n\\t\\t\\tint p = blossomEdges[b][j - evenOdd] ^ evenOdd;\\n\\t\\t\\tif (t >= nVertex)\\n\\t\\t\\t\\taugmentBlossom(t, endPoint[p]);\\n\\t\\t\\tj = (j + jStep + cSize) % cSize;\\n\\t\\t\\tt = blossomChilds[b][j];\\n\\t\\t\\tif (t >= nVertex)\\n\\t\\t\\t\\taugmentBlossom(t, endPoint[p ^ 1]);\\n\\t\\t\\tmate[endPoint[p]] = p ^ 1;\\n\\t\\t\\tmate[endPoint[p ^ 1]] = p;\\n\\t\\t}\\n\\t\\trotate(blossomChilds[b].begin(), blossomChilds[b].begin() + i, blossomChilds[b].end());\\n\\t\\trotate(blossomEdges[b].begin(), blossomEdges[b].begin() + i, blossomEdges[b].end());\\n\\t\\tblossomBase[b] = blossomBase[blossomChilds[b][0]];\\n\\t}\\n\\tvoid augmentMatching(int k) {\\n\\t\\tEdge &e = edges[k];\\n\\t\\tint v = e.src, w = e.dst;\\n\\t\\trep(ii, 2) {\\n\\t\\t\\tint s = ii == 0 ? v : w, p = ii == 0 ? 2 * k + 1 : 2 * k;\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tint bs = inBlossom[s];\\n\\t\\t\\t\\tif (bs >= nVertex)\\n\\t\\t\\t\\t\\taugmentBlossom(bs, s);\\n\\t\\t\\t\\tmate[s] = p;\\n\\t\\t\\t\\tif (labelEdge[bs] == -1)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tint bt = inBlossom[endPoint[labelEdge[bs]]];\\n\\t\\t\\t\\ts = endPoint[labelEdge[bt]];\\n\\t\\t\\t\\tint j = endPoint[labelEdge[bt] ^ 1];\\n\\t\\t\\t\\tif (bt >= nVertex)\\n\\t\\t\\t\\t\\taugmentBlossom(bt, j);\\n\\t\\t\\t\\tmate[j] = labelEdge[bt];\\n\\t\\t\\t\\tp = labelEdge[bt] ^ 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid mainLoop() {\\n\\t\\trep(t, nVertex) {\\n\\t\\t\\tlabel.assign(2 * nVertex, 0);\\n\\t\\t\\tbestEdge.assign(2 * nVertex, -1);\\n\\t\\t\\tfill(blossomBestEdgesUsed.begin() + nVertex, blossomBestEdgesUsed.end(), false);\\n\\t\\t\\tallowEdge.assign(nEdge, false);\\n\\t\\t\\tsVerteices.clear();\\n\\t\\t\\trep(v, nVertex)\\n\\t\\t\\t\\tif (mate[v] == -1 && label[inBlossom[v]] == 0)\\n\\t\\t\\t\\t\\tassignLabel(v, 1, -1);\\n\\t\\t\\tbool augmented = false;\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tWeight kSlack;\\n\\t\\t\\t\\twhile (!sVerteices.empty() && !augmented) {\\n\\t\\t\\t\\t\\tint v = sVerteices.back(); sVerteices.pop_back();\\n\\t\\t\\t\\t\\teach(it, neighbEnd[v]) {\\n\\t\\t\\t\\t\\t\\tint p = *it;\\n\\t\\t\\t\\t\\t\\tint k = p / 2, w = endPoint[p];\\n\\t\\t\\t\\t\\t\\tif (inBlossom[v] == inBlossom[w])\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\tif (!allowEdge[k]) {\\n\\t\\t\\t\\t\\t\\t\\tkSlack = slack(k);\\n\\t\\t\\t\\t\\t\\t\\tif (kSlack <= 0)\\n\\t\\t\\t\\t\\t\\t\\t\\tallowEdge[k] = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (allowEdge[k]) {\\n\\t\\t\\t\\t\\t\\t\\tif (label[inBlossom[w]] == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tassignLabel(w, 2, p ^ 1);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (label[inBlossom[w]] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tint base = scanBlossom(v, w);\\n\\t\\t\\t\\t\\t\\t\\t\\tif (base >= 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taddBlossom(base, k);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taugmentMatching(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\taugmented = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse if (label[w] == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tlabel[w] = 2;\\n\\t\\t\\t\\t\\t\\t\\t\\tlabelEdge[w] = p ^ 1;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[inBlossom[w]] == 1) {\\n\\t\\t\\t\\t\\t\\t\\tint b = inBlossom[v];\\n\\t\\t\\t\\t\\t\\t\\tif (bestEdge[b] == -1 || kSlack < slack(bestEdge[b]))\\n\\t\\t\\t\\t\\t\\t\\t\\tbestEdge[b] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[w] == 0) {\\n\\t\\t\\t\\t\\t\\t\\tif (bestEdge[w] == -1 || kSlack < slack(bestEdge[w]))\\n\\t\\t\\t\\t\\t\\t\\t\\tbestEdge[w] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (augmented)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tint deltaType = -1;\\n\\t\\t\\t\\tWeight delta;\\n\\t\\t\\t\\tint deltaEdge, deltaBlossom;\\n\\t\\t\\t\\tif (!maxCardinality) {\\n\\t\\t\\t\\t\\tdeltaType = 1;\\n\\t\\t\\t\\t\\tdelta = *min_element(dualVar.begin(), dualVar.begin() + nVertex);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(v, nVertex) {\\n\\t\\t\\t\\t\\tif (label[inBlossom[v]] == 0 && bestEdge[v] != -1) {\\n\\t\\t\\t\\t\\t\\tWeight d = slack(bestEdge[v]);\\n\\t\\t\\t\\t\\t\\tif (deltaType == -1 || d < delta) {\\n\\t\\t\\t\\t\\t\\t\\tdelta = d;\\n\\t\\t\\t\\t\\t\\t\\tdeltaType = 2;\\n\\t\\t\\t\\t\\t\\t\\tdeltaEdge = bestEdge[v];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(b, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomParent[b] == -1 && label[b] == 1 && bestEdge[b] != -1) {\\n\\t\\t\\t\\t\\t\\tkSlack = slack(bestEdge[b]);\\n\\t\\t\\t\\t\\t\\tWeight d = kSlack / 2;\\n\\t\\t\\t\\t\\t\\tif (deltaType == -1 || d < delta) {\\n\\t\\t\\t\\t\\t\\t\\tdelta = d;\\n\\t\\t\\t\\t\\t\\t\\tdeltaType = 3;\\n\\t\\t\\t\\t\\t\\t\\tdeltaEdge = bestEdge[b];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treu(b, nVertex, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomBase[b] >= 0 && blossomParent[b] == -1 &&\\n\\t\\t\\t\\t\\t\\tlabel[b] == 2 &&\\n\\t\\t\\t\\t\\t\\t(deltaType == -1 || dualVar[b] < delta)) {\\n\\t\\t\\t\\t\\t\\tdelta = dualVar[b];\\n\\t\\t\\t\\t\\t\\tdeltaType = 4;\\n\\t\\t\\t\\t\\t\\tdeltaBlossom = b;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (deltaType == -1) {\\n\\t\\t\\t\\t\\tdeltaType = 1;\\n\\t\\t\\t\\t\\tdelta = max((Weight)0, *min_element(dualVar.begin(), dualVar.begin() + nVertex));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(v, nVertex) {\\n\\t\\t\\t\\t\\tif (label[inBlossom[v]] == 1) {\\n\\t\\t\\t\\t\\t\\tdualVar[v] -= delta;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (label[inBlossom[v]] == 2) {\\n\\t\\t\\t\\t\\t\\tdualVar[v] += delta;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treu(b, nVertex, 2 * nVertex) {\\n\\t\\t\\t\\t\\tif (blossomBase[b] >= 0 && blossomParent[b] == -1) {\\n\\t\\t\\t\\t\\t\\tif (label[b] == 1) {\\n\\t\\t\\t\\t\\t\\t\\tdualVar[b] += delta;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (label[b] == 2) {\\n\\t\\t\\t\\t\\t\\t\\tdualVar[b] -= delta;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (deltaType == 1) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 2) {\\n\\t\\t\\t\\t\\tallowEdge[deltaEdge] = true;\\n\\t\\t\\t\\t\\tEdge &e = edges[deltaEdge];\\n\\t\\t\\t\\t\\tint i = e.src, j = e.dst;\\n\\t\\t\\t\\t\\tif (label[inBlossom[i]] == 0)\\n\\t\\t\\t\\t\\t\\tswap(i, j);\\n\\t\\t\\t\\t\\tsVerteices.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 3) {\\n\\t\\t\\t\\t\\tallowEdge[deltaEdge] = true;\\n\\t\\t\\t\\t\\tEdge &e = edges[deltaEdge];\\n\\t\\t\\t\\t\\tint i = e.src;\\n\\t\\t\\t\\t\\tsVerteices.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (deltaType == 4) {\\n\\t\\t\\t\\t\\texpandBlossom(deltaBlossom, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!augmented)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\treu(b, nVertex, 2 * nVertex)\\n\\t\\t\\t\\tif (blossomParent[b] == -1 && blossomBase[b] >= 0 &&\\n\\t\\t\\t\\t\\tlabel[b] == 1 && dualVar[b] == 0)\\n\\t\\t\\t\\t\\texpandBlossom(b, true);\\n\\t\\t}\\n\\t}\\n\\tvi matching(const Edges& edges_, bool maxCardinality_ = false) {\\n\\t\\tedges = edges_; maxCardinality = maxCardinality_;\\n\\t\\tnEdge = edges.size();\\n\\t\\tnVertex = 0;\\n\\t\\teach(i, edges) {\\n\\t\\t\\tif (i->src >= nVertex) nVertex = i->src + 1;\\n\\t\\t\\tif (i->dst >= nVertex) nVertex = i->dst + 1;\\n\\t\\t}\\n\\t\\tmaxWeight = 0;\\n\\t\\tendPoint.clear();\\n\\t\\tneighbEnd.assign(nVertex, vi());\\n\\t\\trep(i, nEdge) {\\n\\t\\t\\tEdge &e = edges[i];\\n\\t\\t\\tmaxWeight = max(maxWeight, e.weight);\\n\\t\\t\\tendPoint.push_back(e.src);\\n\\t\\t\\tendPoint.push_back(e.dst);\\n\\t\\t\\tneighbEnd[e.src].push_back(2 * i + 1);\\n\\t\\t\\tneighbEnd[e.dst].push_back(2 * i);\\n\\t\\t}\\n\\t\\tmate.assign(nVertex, -1);\\n\\t\\tlabel.assign(2 * nVertex, 0);\\n\\t\\tlabelEdge.assign(2 * nVertex, -1);\\n\\t\\tinBlossom.clear();\\n\\t\\tblossomBase.clear();\\n\\t\\tblossomParent.assign(2 * nVertex, -1);\\n\\t\\tblossomChilds.assign(2 * nVertex, vi());\\n\\t\\tblossomEdges.assign(2 * nVertex, vi());\\n\\t\\tbestEdge.assign(2 * nVertex, -1);\\n\\t\\tblossomBestEdgesUsed.assign(2 * nVertex, false);\\n\\t\\tblossomBestEdges.assign(2 * nVertex, vi());\\n\\t\\tunusedBlossoms.clear();\\n\\t\\tdualVar.clear();\\n\\t\\trep(i, nVertex)\\n\\t\\t\\tinBlossom.push_back(i),\\n\\t\\t\\tblossomBase.push_back(i),\\n\\t\\t\\tunusedBlossoms.push_back(nVertex + i),\\n\\t\\t\\tdualVar.push_back(maxWeight);\\n\\t\\trep(i, nVertex)\\n\\t\\t\\tblossomBase.push_back(-1),\\n\\t\\t\\tdualVar.push_back(0);\\n\\t\\tallowEdge.assign(nEdge, 0);\\n\\t\\tsVerteices = vi();\\n\\t\\tmainLoop();\\n\\t\\trep(v, nVertex)\\n\\t\\t\\tif (mate[v] >= 0)\\n\\t\\t\\t\\tmate[v] = endPoint[mate[v]];\\n\\t\\treturn mate;\\n\\t}\\n\\tWeight getWeight(const Edges& e, bool maxCardinality_ = false) {\\n\\t\\tvector<int> v = matching(e, maxCardinality_);\\n\\t\\tWeight w = 0;\\n\\t\\trep(i, v.size()) if (v[i] != -1)\\n\\t\\t\\teach(j, e) if (i == j->src && j->dst == v[i]) w += j->weight;\\n\\t\\treturn w;\\n\\t}\\n};\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint N, A, B; cin >> N >> A >> B;\\n\\tvector<int> a(N), b(N); for (int i = 0; i < N; i++) {\\n\\t\\tcin >> a[i] >> b[i];\\n\\t}\\n\\n\\tint ans = 0;\\n\\tvector<bool> used(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (abs(a[i] - b[i]) <= A || (abs(a[i] - b[i]) >= B&&abs(a[i] - b[i]) <= 2 * A)) {\\n\\t\\t\\tans++;\\n\\t\\t\\tused[i] = true;\\n\\t\\t\\tdump(i);\\n\\t\\t}\\n\\t}\\n\\tEdges edges;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (used[i])continue;\\n\\t\\tfor (int j = i + 1; j < N; j++) {\\n\\t\\t\\tif (used[j])continue;\\n\\t\\t\\tdump(i, j, abs(a[i] + a[j] - b[i] - b[j]));\\n\\t\\t\\tif (abs(a[i] + a[j] - b[i] - b[j]) <= A || (abs(a[i] + a[j] - b[i] - b[j]) >= B&&abs(a[i] + a[j] - b[i] - b[j]) <= 2 * A)) {\\n\\t\\t\\t\\tedges.emplace_back(i, j, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tMaxWeightMatching mwm;\\n\\tans += mwm.getWeight(edges);\\n\\tcout << ans << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4784,\n \"score_of_the_acc\": -0.0993,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1878,"cells":{"group_id":{"kind":"string","value":"aoj_3030_cpp"},"problem_description":{"kind":"string","value":"Problem E: Light\nProblem\n$W \\times H$ の二次元のマス上に$N$個の街灯がある。\nがっちょ君は$(1,1)$からスタートして$(W,H)$に行きたい。\nがっちょ君は暗いところが怖いので、街灯により明るくなっているマスしか歩きたくない。\n最初、すべての街灯はその街灯のあるマスのみを明るくしている。\nそこで、がっちょ君は好きな街灯$i$に対してコスト$r_i$を設定することにした。なお、コストを設定しない街灯があってもよい。\n街灯$i$はコスト$r_i$を消費することにより、その街灯を中心にマンハッタン距離で$r_i$以内の範囲を明るくすることができる。ただしコストは正の整数とする。\nがっちょ君は上下左右のいずれかの方向に隣接するマスに移動する事ができる。\nがっちょ君は$r_i$の合計値を最小になるように設定することにした。そのときの合計値を求めよ。\n2つの地点 $(a,b)$ と $(c,d)$ 間のマンハッタン距離は $|a−c|$+$|b−d|$ で表される。\nInput\n入力は以下の形式で与えられる。\n$W$ $H$ $N$\n$x_1$ $y_1$\n...\n$x_N$ $y_N$\n入力はすべて整数で与えられる。\n1行目に$W$と$H$と$N$が空白区切りで与えられる。\n続く$N$行に街灯$i$の座標$($$x_i$,$y_i$$)$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq W \\leq 500$\n$1 \\leq H \\leq 500$\n$1 \\leq N \\leq 100$\n$1 \\leq N \\leq W \\times H$\n$1 \\leq $$x_i$$ \\leq W$\n$1 \\leq $$y_i$$ \\leq H$\n同じ座標に複数の街灯はない\nOutput\n$r_i$の合計値の最小値を1行に出力せよ。\nSample Input 1\n10 10 1\n6 6\nSample Output 1\n10\nSample Input 2\n5 10 3\n3 9\n2 8\n5 1\nSample Output 2\n8\nSample Input 3\n1 1 1\n1 1\nSample Output 3\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3030_4462499","code_snippet":"#include <bits/stdc++.h>\n#include <algorithm>\n#include <cmath>\n#include <set>\n#include <cstdio>\n#include <vector>\n#include <iostream>\n#include <utility>\n#include <queue>\n#include <map>\n#include <complex>\n#define fir first\n#define sec second\n#define sz(s) (s).size()\n#define pb push_back\n#define get(n) scanf(\"%d\",&n);\n#define gets(s) string s;cin >> (s);\n#define prfi(n) printf(\"%d\", &n);\n#define prfd(n) printf(\"%lf\", &n);\n#define All(s) (s).begin(), (s).end()\n#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)\n#define For(i,j,k) for(int (i)=(j);(i)<(k);(i)++)\n#define drep(i,j) for(int (i)=(j);(i)>=0;(i)--)\n#define Ford(i,j,k) for(int (i)=(j);i>=(k);i--)\n#define fore(c,v) for(auto (c): (v))\n#define lp for(int __=0;__<n;i++)\n#define mem(a,b) memset(a,b,sizeof(a));\n#define dump(x) std::cout << #x << \" = \" << (x) << std::endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\nusing ull = unsigned long long int;\nusing ll = long long;\nusing ld = long double;\nusing pii = std::pair<int,int>;\nusing pll = std::pair<ll, ll>;\nusing vi = std::vector<int> ;\nusing vvi = std::vector<vi> ;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vd = std::vector<double> ;\nusing vvd = std::vector<vd> ;\nusing qi = std::queue<int> ;\nusing vpii = std::vector<std::pair<int, int> >;\nusing vpll = std::vector<pll>;\nusing namespace std;\n\nconst int Mod = (1e9) + 7;\nconst int INF = 1e9 + 19;\nconst ll INFL = 1e18 + 19;\nconst int dx[] = {-1, 0, 0, 1};\nconst int dy[] = {0, -1, 1, 0};\nconst int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\nconst int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};\nconst double EPS = 1e-10;\n//_____________________________________Templates_________________________________________//\n\ntemplate<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}\ntemplate<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}\ntemplate<class T> inline void pri(T a){cout << a << endl;}\ntemplate<class Z> using vec = vector<Z>;\ntemplate<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n//mainly use for dynamic prog\ntemplate<class T1, class T2>\nvoid update(T1 &a, T2 b){\n a += b;\n if(a > Mod) a %= Mod;\n}\n\ninline void IN(void){\n return;\n}\n\ntemplate <typename First, typename... Rest>\nvoid IN(First& first, Rest&... rest){\n cin >> first;\n IN(rest...);\n return;\n}\n\ninline void OUT(void){\n cout << \"\\n\";\n return;\n}\n\ntemplate <typename First, typename... Rest>\nvoid OUT(First first, Rest... rest){\n cout << first << \" \";\n OUT(rest...);\n return;\n}\n\nbool pairsort(pll pl, pll pr){\n if(pl.first == pr.first)return pl.second > pr.second;\n return pl.first < pr.first;\n}\n\nint cntbit(ll a,int n,int j){int res = 0;For(i,j,n){if(a>>i & 1){res++;}}return res;}\nvector<int> make_bit(int a){vector<int> res; for(int i=31;i>=0;i--)if(a&(1<<i))res.pb(i);return res;}\nbool stdbit(int a, int b){return a&(1 << b); }\nint GCD(int a, int b){if(b > a)return GCD(b,a);if(a%b == 0)return b;else return GCD(b, a%b);}\nint LCM(int a, int b){return a*b/GCD(a,b);}\nint roundup(int a, int b){if(a % b == 0)return a/b;else return (a+b)/b;}\nint rounddown(int a, int b){if(a%b == 0)return a/b;else {return (a-b)/b;}}\nll pow(ll a, ll n){ll res = 1;while(n > 0){if(n&1)res *= a; a *= a; n = n >> 1;}return res;}\nll GetDiviserCount(ll N)//約数の個数\n{\n ll res = 1;\n For(i,2,sqrt(N)+1)\n {\n ll cnt = 0;\n while(N%i == 0)\n {\n cnt++;\n N /= i;\n }\n res *= (cnt + 1);\n if(N == 1)break;\n }\n if(N != 1)res *= 2;\n return res;\n}\nvll GetDivisor(ll N)//約数列挙\n{\n vll res;\n for(ll i = 1;i*i <= N;i++)\n {\n if(N%i == 0)\n {\n res.pb(i);\n if(i*i != N)res.pb(N/i);\n }\n }\n sort(All(res));\n return res;\n}\n\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%Mod+Mod)%Mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= Mod) x -= Mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += Mod-a.x) >= Mod) x -= Mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= Mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n \n // for prime mod\n mint inv() const {\n return pow(Mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n friend ostream& operator<<(ostream& os, const mint& a);\n};\nostream& operator<<(ostream& os, const mint& a)\n{\n os << a.x;\n return os;\n}\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n assert(n < Mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n};\n \ntemplate<class Z>\nstruct Matrix\n{\n using mat = Matrix<Z>;\n vector<vector<Z>> m_dat;\n int m_h;\n int m_w;\n Matrix(int h, int w) : m_h(h), m_w(w) ,m_dat(h,vector<Z>(w)) {}\n vector<Z> &operator[] (int idx)\n {\n return m_dat[idx];\n }\n mat Multiple(mat &a)\n {\n mat C(m_h, a.m_w);\n for(int i=0;i<m_h;i++)\n {\n for(int j=0;j<a.m_w;j++)\n {\n for(int k=0;k<m_w;k++)\n {\n C[i][j] += m_dat[i][k] * a[k][j];\n }\n }\n }\n return C;\n }\n mat Pow(ll x)\n {\n mat B(m_h,m_w);\n for(int i=0;i<m_h;i++)\n {\n B[i][i] = 1;\n }\n mat A = *this;\n while(x > 0)\n {\n if(x&1)B = B.Multiple(A);\n A = A.Multiple(A);\n x = x >> 1;\n }\n return B;\n }\n //friend ostream& operator<<(ostream &os, const mat &A);\n};\n/*\ntemplate<class Z>\nostream& operator<<(ostream &os, Matrix<Z>& A)\n{\n for(int i=0;i<A.m_h;i++)\n {\n for(int j=0;j<A.m_w;j++)\n {\n os << A[i][j] << \" \";\n }\n os << endl;\n }\n return os;\n}\ntemplate<class T>\nusing mat = Matrix<T>;\n*/\n//_____________________ following sorce code_________________________//\nconst int max_n = 3 * (1e5) + 1;\nconst int max_m = 83 * (1e5) + 1;\n\nint n,m,k;\nll N;\nint h,w;\nstring S;\nint a,b,c;\nvi v;\nint ans;\ndouble x,y,z;\nvector<int> G[1010101];\nstruct Dat\n{\n int Num,cost,Man;\n Dat() {}\n Dat(int pos, int cost,int Man) : Num(pos), cost(cost),Man(Man){}\n bool operator>(const Dat &a) const\n {\n return cost > a.cost;\n }\n};\nsigned main (int argc, char* argv[]) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n IN(w,h);\n w--;h--;\n IN(n);\n vi x(n), y(n);\n rep(i,n)\n {\n IN(x[i],y[i]);\n x[i]--;\n y[i]--;\n }\n ans = INF;\n min_priority_queue<Dat> qu;\n vector<vector<int>> dist(n,vi(1010,INF));\n rep(i,n)\n {\n int k = x[i] + y[i];\n dist[i][k] = k;\n qu.push(Dat(i,k,k));\n }\n while(!qu.empty())\n {\n auto e = qu.top();qu.pop();\n int curr = e.Num;\n int cost = e.cost;\n int Man = e.Man;\n if(dist[curr][Man] < cost)continue;\n //dist[curr][Man] = cost;\n rep(i,n)\n {\n if(curr == i)continue;\n int d = max(0,abs(x[i]-x[curr]) + abs(y[i]-y[curr]) - 1 - Man);\n if(dist[i][d] > d + cost)\n {\n dist[i][d] = d+cost;\n qu.push(Dat(i,d+cost,d));\n }\n }\n }\n int ans = INF;\n rep(i,n)\n {\n rep(j,1010)\n {\n chmin(ans, dist[i][j] + max(0,abs(w-x[i]) + abs(h-y[i]) - j));\n }\n }\n cout << ans << endl;\n //for(auto c : ans){cout << c << endl;}\n //cout << fixed << setprecision(15) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":27972,"score_of_the_acc":-0.1417,"final_rank":13},{"submission_id":"aoj_3030_3416746","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-2;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint w, h, n;\nint x[100], y[100];\nint d[100][1001];\nstruct vertice {\n\tint id, bl; int cost;\n\tbool operator<(const vertice &v)const {\n\t\tif (v.cost != cost)return cost > v.cost;\n\t\tif (v.id != id)return v.id > id;\n\t\telse return v.bl > bl;\n\t}\n};\npriority_queue<vertice> q;\nvoid init() {\n\trep(i, 100) {\n\t\trep(j, 1001) {\n\t\t\td[i][j] = mod;\n\t\t}\n\t}\n}\nint main() {\n\tinit();\n\tcin >> w >> h >> n;\n\trep(i, n) {\n\t\tcin >> x[i] >> y[i];\n\t}\n\trep(i, n) {\n\t\tint z = x[i] - 1 + y[i] - 1;\n\t\tq.push({ i,z,z });\n\t\td[i][z] = z;\n\t}\n\tint ans = mod;\n\t//dijkstra\n\twhile (!q.empty()) {\n\t\tvertice v = q.top(); q.pop();\n\t\tint id = v.id,bl=v.bl,cost=v.cost;\n\t\tint dis = h - x[id] + w - y[id];\n\t\tans = min(ans, cost+max(0, dis - bl));\n\t\trep(i, n) {\n\t\t\tif (i == id)continue;\n\t\t\tint dis = abs(x[id] - x[i]) + abs(y[id] - y[i]);\n\t\t\tdis = max(0, dis - bl-1);\n\t\t\tif (d[i][dis] > cost + dis) {\n\t\t\t\td[i][dis] = cost + dis;\n\t\t\t\tq.push({ i,dis,cost + dis });\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4284,"score_of_the_acc":-0.0158,"final_rank":2},{"submission_id":"aoj_3030_3407482","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-2;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint w, h, n;\nint x[100], y[100];\nint d[100][1001];\nstruct vertice {\n\tint id, bl; int cost;\n\tbool operator<(const vertice &v)const {\n\t\tif (v.cost != cost)return cost > v.cost;\n\t\tif (v.id != id)return v.id > id;\n\t\telse return v.bl > bl;\n\t}\n};\npriority_queue<vertice> q;\nvoid init() {\n\trep(i, 100) {\n\t\trep(j, 1001) {\n\t\t\td[i][j] = mod;\n\t\t}\n\t}\n}\nint main() {\n\tinit();\n\tcin >> w >> h >> n;\n\trep(i, n) {\n\t\tcin >> x[i] >> y[i];\n\t}\n\trep(i, n) {\n\t\tint z = x[i] - 1 + y[i] - 1;\n\t\tq.push({ i,z,z });\n\t\td[i][z] = z;\n\t}\n\tint ans = mod;\n\t//dijkstra\n\twhile (!q.empty()) {\n\t\tvertice v = q.top(); q.pop();\n\t\tint id = v.id,bl=v.bl,cost=v.cost;\n\t\tint dis = h - x[id] + w - y[id];\n\t\tans = min(ans, cost+max(0, dis - bl));\n\t\trep(i, n) {\n\t\t\tif (i == id)continue;\n\t\t\tint dis = abs(x[id] - x[i]) + abs(y[id] - y[i]);\n\t\t\tdis = max(0, dis - bl-1);\n\t\t\tif (d[i][dis] > cost + dis) {\n\t\t\t\td[i][dis] = cost + dis;\n\t\t\t\tq.push({ i,dis,cost + dis });\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4224,"score_of_the_acc":-0.0287,"final_rank":4},{"submission_id":"aoj_3030_3407457","code_snippet":"//外灯をつける→次の外灯まで移動する→外灯が消える、N * (W + H)頂点の拡張ダイクストラ。スタートとゴールは大きさ-1の外灯。\n//O(N^2 * (W + H) * logほげ)くらい。\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <tuple>\n#include <cmath>\n#define rep(i, n) for(i = 0; i < n; i++)\n#define int long long\nusing namespace std;\n\nint INF = 1e+9;\nint w, h, n;\nint x[102], y[102];\nint minCost[102][1100];\t//minCost[場所][外灯の大きさ + 1]\n\nsigned main() {\n\tint i, j;\n\t\n\tcin >> w >> h >> n;\n\trep(i, n) { cin >> x[i] >> y[i]; }\n\tx[n] = 1;\n\ty[n] = 1;\n\tx[n + 1] = w;\n\ty[n + 1] = h;\n\tn += 2;\n\t\n\trep(i, n) rep(j, 1100) minCost[i][j] = INF;\n\t\n\ttypedef tuple<int, int, int> T;\n\tpriority_queue<T, vector<T>, greater<T> > que;\n\t\n\tminCost[n - 2][0] = 0;\n\tque.push(T(0, n - 2, 0));\n\twhile (!que.empty()) {\n\t\tT now = que.top(); que.pop();\n\t\tint cst = get<0>(now);\n\t\tint pos = get<1>(now);\n\t\tint sz = get<2>(now) - 1;\n\t\t\n\t\trep(j, n) {\n\t\t\tif (pos == j) continue;\n\t\t\tint lowSz = abs(x[j] - x[pos]) + abs(y[j] - y[pos]) - sz - 1;\n\t\t\tif (j == n - 2 && lowSz >= 0) { continue; }\n\t\t\tif (j == n - 1 && lowSz >= 0) { lowSz++; }\n\t\t\tif (lowSz < 0) lowSz = 0;\n\t\t\tif (minCost[j][lowSz + 1] > cst + lowSz) {\n\t\t\t\tminCost[j][lowSz + 1] = cst + lowSz;\n\t\t\t\tque.push(T(cst + lowSz, j, lowSz + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint ans = INF;\n\trep(i, 1100) ans = min(ans, minCost[n - 1][i]);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5380,"score_of_the_acc":-0.0342,"final_rank":5},{"submission_id":"aoj_3030_3407449","code_snippet":"//外灯をつける→次の外灯まで移動する→外灯が消える、N * (W + H)頂点の拡張ダイクストラ。スタートとゴールは大きさ-1の外灯。\n//O(N^2 * (W + H) * logほげ)くらい。\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <tuple>\n#include <cmath>\n#define rep(i, n) for(i = 0; i < n; i++)\n#define int long long\nusing namespace std;\n\nint INF = 1e+9;\nint w, h, n;\nint x[102], y[102];\nint minCost[102][1100];\t//minCost[場所][外灯の大きさ + 1]\n\nsigned main() {\n\tint i, j;\n\t\n\tcin >> w >> h >> n;\n\trep(i, n) { cin >> x[i] >> y[i]; }\n\tx[n] = 1;\n\ty[n] = 1;\n\tx[n + 1] = w;\n\ty[n + 1] = h;\n\tn += 2;\n\t\n\trep(i, n) rep(j, 1100) minCost[i][j] = INF;\n\t\n\ttypedef tuple<int, int, int> T;\n\tpriority_queue<T, vector<T>, greater<T> > que;\n\t\n\tminCost[n - 2][0] = 0;\n\tque.push(T(0, n - 2, 0));\n\twhile (!que.empty()) {\n\t\tT now = que.top(); que.pop();\n\t\tint cst = get<0>(now);\n\t\tint pos = get<1>(now);\n\t\tint sz = get<2>(now) - 1;\n\t\t\n\t\trep(j, n) {\n\t\t\tif (pos == j) continue;\n\t\t\tint lowSz = abs(x[j] - x[pos]) + abs(y[j] - y[pos]) - sz - 1;\n\t\t\tif (j == n - 2 && lowSz >= 0) continue;\n\t\t\tif (j == n - 1 && lowSz >= 0) continue;\n\t\t\tif (lowSz < 0) lowSz = 0;\n\t\t\tif (minCost[j][lowSz + 1] > cst + lowSz) {\n\t\t\t\tminCost[j][lowSz + 1] = cst + lowSz;\n\t\t\t\tque.push(T(cst + lowSz, j, lowSz + 1));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint ans = INF;\n\trep(i, 1100) ans = min(ans, minCost[n - 1][i]);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.3978494623655914,"time_ms":20,"memory_kb":5224,"score_of_the_acc":-0.0203,"final_rank":19},{"submission_id":"aoj_3030_3147685","code_snippet":"#include<bits/stdc++.h>\nusing ll = long long;\n#define int ll\n#define rep(i,n) for(int i=0;i<n;i++)\n#define loop(i,s,n) for(int i=s;i<n;i++)\n#define erep(e,v) for(auto && e :v)\n#define all(in) in.begin(), in.end()\n#define MP make_pair\n#define INF (sizeof(int) == 4 ? (int)1e9:(int)1e18)\n#define EPS 0.0000000001\nusing namespace std;\ntemplate<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }\ntemplate<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }\ntemplate<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }\ntemplate<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }\ntemplate<class T> void join(T a){for(auto itr :a){if(itr != *a.begin())cout << \" \"; cout << itr;} }\nusing ld = long double;\nusing pii = pair<int,int>;\nusing piii = pair<int,pii>;\nint W,H;\nint dx[]={0,0,1,-1}, dy[]={1,-1,0,0};\nbool valid(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}\nsigned main(){\n int N;\n cin >> W >> H >> N;\n vector<pii>v(N);\n erep(e,v) cin >> e.first >> e.second,--e.first,--e.second;\n v.push_back(pii(0,0));\n v.push_back(pii(W-1,H-1));\n int s = N,t = N+1;\n vector<vector<int>>edge(N+2,vector<int>(N+2,INF));\n vector<vector<int>>d(N+2,vector<int>(1000+ 100,INF));\n priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>>que;\n \n rep(i,N+2)rep(j,N+2)edge[i][j] = abs(v[i].first - v[j].first) + abs(v[i].second - v[j].second);\n que.push({0,s,0});\n d[s][0] = 0;\n while(!que.empty()){\n auto top = que.top();\n int dist = top.front(),v = top[1],cost = top[2];\n que.pop();\n if (dist > d[v][cost])continue;\n rep(nv,edge[v].size()){\n if(nv == v)continue;\n int ncost = edge[v][nv] - cost -(v != s and nv != t);\n cmax(ncost,0LL);\n if(d[nv][ncost] > dist + ncost){\n d[nv][ncost] = dist + ncost;\n que.push({d[nv][ncost],nv,ncost});\n }\n }\n }\n cout << *min_element(all(d[t])) << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":7072,"score_of_the_acc":-0.0554,"final_rank":8},{"submission_id":"aoj_3030_3090691","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#define repi(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,a) repi(i,0,a)\n#define all(a) (a).begin(), (a).end()\n\nconstexpr int MAX_N = 100, INF = 1<<30;\n\nusing P = std::pair<int, int>;\nusing State = std::pair<int, P>;\n\nint W, H, N;\nint x[MAX_N], y[MAX_N];\nint d[MAX_N][1010];\nstd::priority_queue<State, std::vector<State>, std::greater<State> > pque;\nint ans = INF;\n\nint main()\n{\n scanf( \"%d%d%d\", &W, &H, &N );\n rep( i, N )\n scanf( \"%d%d\", x+i, y+i ), --x[i], --y[i];\n\n std::fill( (int*)d, (int*)(d+N), INF );\n\n rep( i, N )\n {\n int cost = x[i]+y[i];\n d[i][cost] = cost;\n pque.push( State( d[i][cost], P( i, cost ) ) );\n }\n\n while( !pque.empty() )\n {\n State st = pque.top(); pque.pop();\n int dist = st.first, v = st.second.first, cost = st.second.second;\n\n if( d[v][cost] < dist )\n continue;\n\n rep( i, N )\n {\n int ncost = std::max( 0, abs(x[i]-x[v])+abs(y[i]-y[v])-cost-1 );\n\n if( d[i][ncost] > d[v][cost]+ncost )\n {\n d[i][ncost] = d[v][cost]+ncost;\n pque.push( State( d[i][ncost], P( i, ncost ) ) );\n }\n }\n }\n\n rep( i, N ) rep( j, W+H+1 )\n ans = std::min( ans, d[i][j]+std::max(0,abs(W-1-x[i])+abs(H-1-y[i])-j) );\n\n printf( \"%d\\n\", ans );\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3720,"score_of_the_acc":-0.0132,"final_rank":1},{"submission_id":"aoj_3030_2859266","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Data{\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(){\n\t\tindex = brightness = sum_cost = 0;\n\t}\n\n\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\n\t\tindex = arg_index;\n\t\tbrightness = arg_brightness;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint index,brightness,sum_cost;\n};\n\n\nint N;\nint W,H;\nint min_cost[101][1000];\nData data[100];\n\nint main(){\n\n\tscanf(\"%d %d %d\",&W,&H,&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&data[i].col,&data[i].row);\n\t\tdata[i].col--;\n\t\tdata[i].row--;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM;\n\t}\n\n\tpriority_queue<Info> Q;\n\tfor(int i = 0; i < N; i++){\n\t\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\n\t\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col));\n\t}\n\n\tint dist,next_Brightness,next_cost;\n\n\tInfo info;\n\n\twhile(!Q.empty()){\n\n\t\tinfo = Q.top();\n\t\tQ.pop();\n\n\t\tif(info.brightness < H+W-2 && min_cost[info.index][info.brightness+1] > info.sum_cost+1){\n\t\t\tmin_cost[info.index][info.brightness+1] = info.sum_cost+1;\n\t\t\tQ.push(Info(info.index,info.brightness+1,info.sum_cost+1));\n\t\t}\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == info.index)continue;\n\n\t\t\tdist = abs(data[info.index].row-data[i].row)+abs(data[info.index].col-data[i].col);\n\n\t\t\tif(dist <= info.brightness+1){\n\t\t\t\tnext_Brightness = 0;\n\t\t\t\tnext_cost = info.sum_cost;\n\t\t\t}else{\n\t\t\t\tnext_Brightness = dist-(info.brightness+1);\n\t\t\t\tnext_cost = info.sum_cost+next_Brightness;\n\t\t\t}\n\n\t\t\tif(min_cost[i][next_Brightness] > next_cost){\n\t\t\t\tmin_cost[i][next_Brightness] = next_cost;\n\t\t\t\tQ.push(Info(i,next_Brightness,next_cost));\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = BIG_NUM;\n\n\tfor(int i = 0; i < N; i++){\n\t\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\n\t\tfor(int k = dist; k <= H+W-2; k++){\n\t\t\tans = min(ans,min_cost[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4192,"score_of_the_acc":-0.068,"final_rank":11},{"submission_id":"aoj_3030_2859262","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Data{\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(){\n\t\tindex = brightness = sum_cost = 0;\n\t}\n\n\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\n\t\tindex = arg_index;\n\t\tbrightness = arg_brightness;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint index,brightness,sum_cost;\n};\n\n\nint N;\nint W,H;\nint min_cost[101][1000];\nData data[100];\n\nint main(){\n\n\tscanf(\"%d %d %d\",&W,&H,&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&data[i].col,&data[i].row);\n\t\tdata[i].col--;\n\t\tdata[i].row--;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM; //min_cost[何番目の街灯か][明るさ] = 最小到達コスト\n\t}\n\n\t//★最初に訪れる街灯を全探索★\n\tpriority_queue<Info> Q;\n\tfor(int i = 0; i < N; i++){\n\t\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\n\t\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col)); //左上まで光を引っ張ってくるイメージ\n\t}\n\n\tint dist,next_Brightness,next_cost;\n\n\tInfo info;\n\n\twhile(!Q.empty()){\n\n\t\tinfo = Q.top();\n\t\tQ.pop();\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == info.index)continue;\n\n\t\t\tdist = abs(data[info.index].row-data[i].row)+abs(data[info.index].col-data[i].col);\n\n\t\t\tif(dist <= info.brightness+1){ //次の街灯への距離-1まで全て照らせる場合\n\t\t\t\tnext_Brightness = 0;\n\t\t\t\tnext_cost = info.sum_cost;\n\t\t\t}else{\n\t\t\t\tnext_Brightness = dist-(info.brightness+1); //★次の街灯から距離1のところまで照らして貰えば良い★\n\t\t\t\tnext_cost = info.sum_cost+next_Brightness;\n\t\t\t}\n\n\t\t\tif(min_cost[i][next_Brightness] > next_cost){\n\t\t\t\tmin_cost[i][next_Brightness] = next_cost;\n\t\t\t\tQ.push(Info(i,next_Brightness,next_cost));\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = BIG_NUM;\n\n\t//右下までの最小コストを求める\n\tfor(int i = 0; i < N; i++){\n\t\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\n\t\tfor(int k = dist; k <= H+W-2; k++){\n\t\t\tans = min(ans,min_cost[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.3978494623655914,"time_ms":20,"memory_kb":4056,"score_of_the_acc":-0.0148,"final_rank":17},{"submission_id":"aoj_3030_2859261","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Data{\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\n\t\tindex = arg_index;\n\t\tbrightness = arg_brightness;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\n\t\treturn sum_cost > arg.sum_cost;\n\t}\n\tint index,brightness,sum_cost;\n};\n\n\nint N;\nint W,H;\nint min_cost[101][1000];\nData data[100];\n\nint main(){\n\n\tscanf(\"%d %d %d\",&W,&H,&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&data[i].col,&data[i].row);\n\t\tdata[i].col--;\n\t\tdata[i].row--;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM; //min_cost[何番目の街灯か][明るさ] = 最小到達コスト\n\t}\n\n\t//★最初に訪れる街灯を全探索★\n\tpriority_queue<Info> Q;\n\tfor(int i = 0; i < N; i++){\n\t\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\n\t\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col)); //左上まで光を引っ張ってくるイメージ\n\t}\n\n\tint dist,next_Brightness,next_cost;\n\n\twhile(!Q.empty()){\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == Q.top().index)continue;\n\n\t\t\tdist = abs(data[Q.top().index].row-data[i].row)+abs(data[Q.top().index].col-data[i].col);\n\n\t\t\tif(dist <= Q.top().brightness+1){ //次の街灯への距離-1まで全て照らせる場合\n\t\t\t\tnext_Brightness = 0;\n\t\t\t\tnext_cost = Q.top().sum_cost;\n\t\t\t}else{\n\t\t\t\tnext_Brightness = dist-(Q.top().brightness+1); //★次の街灯から距離1のところまで照らして貰えば良い★\n\t\t\t\tnext_cost = Q.top().sum_cost+next_Brightness;\n\t\t\t}\n\n\t\t\tif(min_cost[i][next_Brightness] > next_cost){\n\t\t\t\tmin_cost[i][next_Brightness] = next_cost;\n\t\t\t\tQ.push(Info(i,next_Brightness,next_cost));\n\t\t\t}\n\t\t}\n\t\tQ.pop();\n\t}\n\n\tint ans = BIG_NUM;\n\n\t//右下までの最小コストを求める\n\tfor(int i = 0; i < N; i++){\n\t\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\n\t\tfor(int k = dist; k <= H+W-2; k++){\n\t\t\tans = min(ans,min_cost[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.3978494623655914,"time_ms":20,"memory_kb":4088,"score_of_the_acc":-0.0149,"final_rank":18},{"submission_id":"aoj_3030_2847416","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\nstruct aa {\n\tint id;\n\tint li;\n\tint cost;\n\n\tconst bool operator<(const aa&r)const {\n\t\treturn this->cost>r.cost;\n\t}\n};\nint main() {\n\tint W,H,N;cin>>W>>H>>N;\n\n\tvector<pair<int,int>>lights(N+1);\n\n\tlights[0]=make_pair(0,0);\n\tfor (int i = 0; i < N; ++i) {\n\t\tint x,y;cin>>x>>y;\n\t\tlights[i+1]=make_pair(x-1,y-1);\n\t}\n\tlights.emplace_back(W-1,H-1);\n\n\n\tpriority_queue<aa>que;\n\tvector<vector<int>>dp(N+2,vector<int>(1010,1e8));\n\n\tque.push(aa{ 0,0,0 });;\n\tdp[0][0]=0;\n\n\twhile (!que.empty()) {\n\t\taa atop(que.top());\n\t\tque.pop();\n\n\t\tconst int now_id(atop.id);\n\t\tconst int now_li(atop.li);\n\t\tconst int now_cost=atop.cost;\n\n\t\tfor (int next_id = 1; next_id < N + 2; ++next_id) {\n\t\t\tif(now_id==next_id)continue;\n\t\t\tif(now_id==0&&next_id==N+1)continue;\n\n\t\t\tint dis=abs(lights[now_id].first-lights[next_id].first)+abs(lights[now_id].second-lights[next_id].second);\n\n\t\t\tif (next_id != N + 1) {\n\t\t\t\tint next_li=max(1,dis-now_li+1);\n\t\t\t\tint next_cost=now_cost+(next_li-1);\n\n\t\t\t\tif (dp[next_id][next_li] > next_cost) {\n\t\t\t\t\tdp[next_id][next_li]=next_cost;\n\t\t\t\t\tque.push(aa{ next_id,next_li,next_cost });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (dis <= now_li-1) {\n\t\t\t\t\tdp[N+1][0]=min(dp[N+1][0],now_cost);\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdp[N+1][0]=min(dp[N+1][0],now_cost+(dis-(now_li-1)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans=dp[N+1][0];\n\tcout<<ans<<endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4252,"score_of_the_acc":-0.042,"final_rank":7},{"submission_id":"aoj_3030_2760103","code_snippet":"#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\nstruct state {\n ll v, r, cost;\n bool operator>(const state s) const { return cost > s.cost; }\n};\n\nint main(void) {\n ll W, H, N;\n cin >> W >> H >> N;\n vector<ll> X(N), Y(N);\n REP(i, 0, N) cin >> X[i] >> Y[i];\n\n const ll INF = 1LL << 60;\n vector<vector<ll> > dp(N, vector<ll>(1000, INF));\n priority_queue<state, vector<state>, greater<state> > q;\n REP(i, 0, N) {\n ll dist = (X[i] - 1) + (Y[i] - 1);\n q.push((state) { i, dist, dist });\n }\n ll ans = INF;\n while(!q.empty()) {\n ll v = q.top().v, r = q.top().r, cost = q.top().cost;\n // cout << v << \" \" << r << \" \" << cost << endl;\n q.pop();\n if(dp[v][r] <= cost) continue;\n dp[v][r] = cost;\n ans = min(ans, cost + max((W - X[v]) + (H - Y[v]) - r, 0LL));\n REP(nv, 0, N) if(nv != v) {\n ll dist = abs(X[nv] - X[v]) + abs(Y[nv] - Y[v]);\n ll nr = max(dist - r - 1, 0LL), ncost = cost + max(dist - r - 1, 0LL);\n if(dp[nv][nr] > ncost) q.push((state) { nv, nr, ncost });\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":530,"memory_kb":52932,"score_of_the_acc":-0.9183,"final_rank":14},{"submission_id":"aoj_3030_2756289","code_snippet":"#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 sar(a,n) cout<<#a<<\":\";rep(pachico,n)cout<<\" \"<<a[pachico];cout<<endl\n#define svec(v) cout<<#v<<\":\";rep(pachico,v.size())cout<<\" \"<<v[pachico];cout<<endl\n#define svecp(v) cout<<#v<<\":\";each(pachico,v)cout<<\" {\"<<pachico.first<<\":\"<<pachico.second<<\"}\";cout<<endl\n#define sset(s) cout<<#s<<\":\";each(pachico,s)cout<<\" \"<<pachico;cout<<endl\n#define smap(m) cout<<#m<<\":\";each(pachico,m)cout<<\" {\"<<pachico.first<<\":\"<<pachico.second<<\"}\";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 h,w,n;\nvi x,y;\n\nint dist(int a,int b,int c,int d)\n{\n return abs(a-c)+abs(b-d);\n}\n\ntemplate<typename T> class Dijkstra {\npublic:\n\tvector<T> d;\n\tint V;\n\tusing pti = pair<T,int>;\n\tDijkstra(int node_size){\n\t\tV = node_size;\n\t d.resize(V,numeric_limits<T>::max());\n\t}\n\tvoid solve(){\n\t\tpriority_queue<pti,vector<pti>,greater<pti> > que;\n\t\trep(i,n){\n int dir = dist(x[i],y[i],0,0);\n d[i*1001+dir] = dir;\n // cout << i << \" \" << dir << \" \" << dir << \"\\n\";\n que.push(pti(dir,i*1001+dir));\n }\n\t\twhile(!que.empty()){\n\t\t\tpti p = que.top();\n\t\t\tque.pop();\n\t\t\tif(d[p.second] < p.first) continue;\n int v = p.second / 1001,cs = p.second % 1001;\n\t\t\trep(i,n){\n int val = max(dist(x[v],y[v],x[i],y[i])-(cs+1),0);\n if(i != v && d[i*1001+val] > val+p.first){\n d[i*1001+val] = val+p.first;\n que.push(pti(d[i*1001+val],i*1001+val));\n }\n }\n\t\t}\n\t}\n};\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> w >> h >> n;\n x.resize(n),y.resize(n);\n rep(i,n){\n cin >> x[i] >> y[i];\n --x[i],--y[i];\n }\n Dijkstra<int> dj(n*1001);\n dj.solve();\n int ans = INT_MAX;\n rep(i,n){\n rep(j,1001){\n if(dj.d[i*1001+j] != INT_MAX){\n cmn(ans,dj.d[i*1001+j]+max(dist(x[i],y[i],w-1,h-1)-j,0));\n }\n }\n }\n cout << ans << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3900,"score_of_the_acc":-0.0403,"final_rank":6},{"submission_id":"aoj_3030_2755894","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int,int>P;\ntypedef pair<int,P>P2;\n\nint dp[111][1111],H,W,N,ans=1e9;\nint x[111],y[111],man[111][111];\n\nint main(){\n\n for(int i=0;i<111;i++)\n for(int j=0;j<1111;j++)dp[i][j]=1e8;\n\n x[0]=y[0]=1;\n\n cin>>W>>H>>N;N++;\n for(int i=1;i<N;i++)cin>>x[i]>>y[i];\n x[N]=W;\n y[N]=H; N++;\n\n for(int i=0;i<N;i++){\n for(int j=i;j<N;j++){\n man[i][j]=man[j][i]=(abs(x[i]-x[j])+abs(y[i]-y[j]));\n }\n }\n \n priority_queue<P2,vector<P2>,greater<P2> >q;\n q.push(P2(0,P(0,0)));\n dp[0][0]=0;\n\n while(!q.empty()){\n P2 p=q.top();q.pop();\n int cost = p.first;\n int now = p.second.first;\n int ran = p.second.second;\n if(now==N-1){\n cout<<cost<<endl;\n return 0;\n }\n if(dp[now][ran]<cost)continue;\n for(int i=0;i<N;i++)if(now!=i){\n int next;\n if(now==0)next=max(0,man[i][now]-ran);\n else if(i==N-1)next=max(0,man[i][now]-ran);\n else next=max(0,man[i][now]-ran-1);\n int cost2 = cost+next; \n if(cost2>=dp[i][next])continue;\n dp[i][next]=cost2;\n q.push(P2(cost2,P(i,next)));\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":4336,"score_of_the_acc":-0.0161,"final_rank":3},{"submission_id":"aoj_3030_2755493","code_snippet":"#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll LLINF = (1LL<<60);\nconst int INF = (1LL<<30);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nint x[105], y[105];\nint d[105][1010];\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int w, h, n;\n cin >> w >> h >> n;\n REP(i, n) {\n cin >> x[i] >> y[i];\n x[i]--, y[i]--;\n }\n\n REP(i, 105) REP(j, 1010) d[i][j] = LLINF;\n priority_queue<VI, VVI, greater<VI>> que;\n // スタート地点から街灯iに向かう\n REP(i, n) {\n int cost = x[i]+y[i];\n d[i][cost] = cost;\n que.push({cost, i, cost});\n }\n\n while(que.size()) {\n VI v = que.top(); que.pop();\n int dist = v[0], idx = v[1], cost = v[2];\n if(dist > d[idx][cost]) continue;\n REP(i, n) {\n if(idx == i) continue;\n int n_cost = max(0LL, abs(x[idx]-x[i]) + abs(y[idx]-y[i]) - cost - 1);\n if(d[i][n_cost] > d[idx][cost] + n_cost) {\n d[i][n_cost] = d[idx][cost] + n_cost;\n que.push({d[i][n_cost], i, n_cost});\n }\n }\n }\n\n int ans = LLINF;\n REP(i, n) REP(j, 1010) {\n chmin(ans, d[i][j] + max(0LL, abs(w-1-x[i]) + abs(h-1-y[i]) - j));\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6724,"score_of_the_acc":-0.0669,"final_rank":9},{"submission_id":"aoj_3030_2755488","code_snippet":"#define __USE_MINGW_ANSI_STDIO 0\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll LLINF = (1LL<<60);\nconst int INF = (1LL<<30);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nint x[105], y[105];\nint d[105][1010];\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int w, h, n;\n cin >> w >> h >> n;\n bool st_flag = false, en_flag = false;\n REP(i, n) {\n cin >> x[i] >> y[i];\n x[i]--, y[i]--;\n if(x[i] == 0 && y[i] == 0) st_flag = true;\n if(x[i] == w-1 && y[i] == h-1) en_flag = true;\n }\n\n REP(i, 105) REP(j, 1010) d[i][j] = LLINF;\n priority_queue<VI, VVI, greater<VI>> que;\n REP(i, n) {\n // スタート地点から街灯iに向かうとき\n int cost = x[i]+y[i];\n d[i][cost] = cost;\n que.push({cost, i, cost});\n }\n\n while(que.size()) {\n VI v = que.top(); que.pop();\n // cout << v << endl;\n int dist = v[0], idx = v[1], cost = v[2];\n if(dist > d[idx][cost]) continue;\n REP(i, n) {\n if(idx == i) continue;\n int n_cost = max(0LL, abs(x[idx]-x[i]) + abs(y[idx]-y[i]) - cost - 1);\n if(d[i][n_cost] > d[idx][cost] + n_cost) {\n d[i][n_cost] = d[idx][cost] + n_cost;\n que.push({d[i][n_cost], i, n_cost});\n }\n }\n }\n\n int ans = LLINF;\n REP(i, n) REP(j, 1010) {\n // cout << \"i:\" << i << \" j:\" << j << \" \" << d[i][j] << endl;\n chmin(ans, d[i][j] + max(0LL, abs(w-1-x[i]) + abs(h-1-y[i]) - (en_flag?1:0) - j));\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6888,"score_of_the_acc":-0.0677,"final_rank":10},{"submission_id":"aoj_3030_2754775","code_snippet":"#include <bits/stdc++.h>\n #include<iostream>\n #include<cstdio>\n #include<vector>\n #include<queue>\n #include<map>\n #include<cstring>\n #include<string>\n #include <math.h>\n #include<algorithm>\n // #include <boost/multiprecision/cpp_int.hpp>\n #include<functional>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n \n #define ssa pair<string,int>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-8)\n #define equals(a,b) (fabs((a)-(b))<EPS)\nint dx[4]={0,-1,0,1};\nint dy[4]={1,0,-1,0};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tdouble x;\n \tint y,z,w;\n \tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tpa2 operator * (int a) {return pa2(x*a,y*a);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x>p.x: y>p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n #define ppa pair<int,pas>\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n #define pl pair<int,pas>\n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n /* \n int pr[1000010];\n int inv[1000010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\ndouble bekid(double w,int r){\n\tif(r==0) return 1.0;\n\tif(r==1) return w;\n\tif(r%2) return bekid(w,r-1)*w;\n\tdouble f=bekid(w,r/2);\n\treturn f*f;\n}\n\n \n\t\t\tint comb(int nn,int rr){\n\t\t\t\tint r=pr[nn]*inv[rr];\n\t\t\t\tr%=inf;\n\t\t\t\tr*=inv[nn-rr];\n\t\t\t\tr%=inf;\n\t\t\t\treturn r;\n\t\t\t}\n \n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<=ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%inf;\n \t}\n \tfor(int i=0;i<=ert;i++) inv[i]=beki(pr[i],inf-2,inf);\n \t\n }\n */ \n\t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000)\n/*\nstruct Segmin{\n\t// 1\n\t// 2 3\n\t// 4 5 6 7\n\t\n\t\n\tprivate:\n\tpublic:\n\t\n\t// (1<<15)=32768\n\t// 1<<16 = 65536\n\t// 1<<17 = 131072\n\t// 1<<18 = 262144\n\t\n\tint cor=(1<<17);\n\t\n\tvector<pa> vec;\n\t\n\tvoid shoki1(){\n\t\t\n\t\tvec.resize(2*cor+3, mp(0,0));\n\t\tfor(int i=cor;i<2*cor;i++)vec[i].second=1;\n\t}\n\t\tvoid shoki2(){\n\t\t\tfor(int i=cor-1;i>0;i--) {\n\t\t\t\tif(vec[2*i].first<vec[2*i+1].first) vec[i]=vec[2*i];\n\t\t\t\telse if(vec[2*i].first>vec[2*i+1].first)vec[i]=vec[2*i+1];\n\t\t\t\telse vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);\n\t\t\t}\n\t\t}\n\t\t\n\tvoid updadd(int x,int w){\n\t\t//x ���ڂ� w���Z\n\t\tx+=cor;\n\t\tvec[x].first+=w;\n\t\twhile(1){\n\t\t\tx/=2;\n\t\t\tif(x==0) break;\n\t\t\tif(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];\n\t\t\telse if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];\n\t\t\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\n\t\t}\n\t\t\n\t}\n\t\n\tvoid updchan(int x,int w){\n\t\t//x���ڂ�w�ɕύX\n\t\tx+=cor;\n\t\tvec[x].first=w;\n\t\twhile(1){\n\t\t\tx/=2;\n\t\t\tif(x==0) break;\n\t\t\tif(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];\n\t\t\telse if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];\n\t\t\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\n\t\t}\n\t\t\n\t}\n\t// [a,b)\n\t// k-th node\n\t// k no kukanha [l,r)\n\tpa segmin(int a,int b,int k=1,int l=0,int r=-10){\n\t\tif(r<0)r=cor;\n\t\t\n\t//\tcout<<a<<\" \"<<b<<\" \"<<k<<\" \"<<l<<\" \"<<r<<endl;\n\t\t\n\t\tif(a<=l && r<=b){\n\t\t\treturn vec[k];\n\t\t}\n\t\tif(r<=a || b<=l){\n\t\t\treturn mp((1ll<<31)-1,-1);\n\t\t}\n\t\t\n\t\tpa v1=segmin(a,b,k*2,l,(l+r)/2),v2=segmin(a,b,k*2+1,(l+r)/2,r);\n\t\t\n\t\tif(v1.first<v2.first)return v1;\n\t\telse if(v1.first>v2.first) return v2;\n\t\telse return mp(v1.first,v1.second+v2.second);\n\t}\n\t\n};\n\n\n\nstruct Segmax{\n\t// 1\n\t// 2 3\n\t// 4 5 6 7\n\t\n\t\n\tprivate:\n\tpublic:\n\t\n\t// (1<<15)=32768\n\t// 1<<16 = 65536\n\t// 1<<17 = 131072\n\t// 1<<18 = 262144\n\t\n\tint cor=(1<<17);\n\t\n\tvector<pa> vec;\n\t\n\tvoid shoki1(){\n\t\t\n\t\tvec.resize(2*cor+3, mp(0,0));\n\t\tfor(int i=cor;i<2*cor;i++)vec[i].second=1;\n\t}\n\t\tvoid shoki2(){\n\t\t\tfor(int i=cor-1;i>0;i--) {\n\t\t\t\tif(vec[2*i].first>vec[2*i+1].first) vec[i]=vec[2*i];\n\t\t\t\telse if(vec[2*i].first<vec[2*i+1].first)vec[i]=vec[2*i+1];\n\t\t\t\telse vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);\n\t\t\t}\n\t\t}\n\t\t\n\tvoid updadd(int x,int w){\n\t\t//x ���ڂ� w���Z\n\t\tx+=cor;\n\t\tvec[x].first+=w;\n\t\twhile(1){\n\t\t\tx/=2;\n\t\t\tif(x==0) break;\n\t\t\tif(vec[2*x].first>=vec[2*x+1].first) vec[x]=vec[2*x];\n\t\t\telse vec[x]=vec[2*x+1];\n\t\t}\n\t\t\n\t}\n\t\n\tvoid updchan(int x,int w){\n\t\t//x���ڂ�w�ɕύX\n\t\tx+=cor;\n\t\tvec[x].first=w;\n\t\twhile(1){\n\t\t\tx/=2;\n\t\t\tif(x==0) break;\n\t\t\tif(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x];\n\t\t\telse if(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x+1];\n\t\t\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\n\t\t}\n\t\t\n\t}\n\t// [a,b)\n\t// k-th node\n\t// k no kukanha [l,r)\n\tpa segmax(int a,int b,int k=1,int l=0,int r=-10){\n\t\tif(r<0)r=cor;\n\t\t\n\t//\tcout<<a<<\" \"<<b<<\" \"<<k<<\" \"<<l<<\" \"<<r<<endl;\n\t\t\n\t\tif(a<=l && r<=b){\n\t\t\treturn vec[k];\n\t\t}\n\t\tif(r<=a || b<=l){\n\t\t\treturn mp(-(1ll<<31),-1);\n\t\t}\n\t\t\n\t\tpa v1=segmax(a,b,k*2,l,(l+r)/2),v2=segmax(a,b,k*2+1,(l+r)/2,r);\n\t\t\n\t\tif(v1.first>v2.first)return v1;\n\t\telse if(v1.first<v2.first) return v2;\n\t\telse return mp(v1.first,v1.second+v2.second);\n\t}\n\t\n};\n*/\nint w,h,n;\npriority_queue<pa3,vector<pa3>,greater<pa3>> pq; \nbool sumi[200][2000]={0};\nvector<pa3> G[110][1010];\nint x[110],y[110];\nsigned main(){\ncin>>w>>h>>n;\n\tfor(int i=1;i<=n;i++)cin>>x[i]>>y[i];\n\t\n\tfor(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){\n\t\tint d=abs(x[i]-x[j])+abs(y[i]-y[j]);\n\t\t\n\t\tfor(int k=0;k<d;k++){\n\t\t\t\tG[i][k].pb((pa3){j,d-k-1,d-k-1});\n\t\t\t\tG[j][k].pb((pa3){i,d-k-1,d-k-1});\n\t\t}\n\t}\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tfor(int j=0;j<=1001;j++){\n\t\t\tG[i][j].pb((pa3){i,j+1,1});\n\t\t\tG[i][j+1].pb((pa3){i,j,0});\n\t\t}\n\t\tint d=x[i]-1+y[i]-1;\n\t//\tcout<<i<<\" \"<<d<<endl;\n\t\t\t\tG[0][0].pb((pa3){i,max(0ll,d),max(0ll,d)});\n\t\td=w-x[i]+h-y[i];\n\t//\tcout<<i<<\" \"<<d<<endl;\n\t\t\tG[i][max(0ll,d)].pb((pa3){0,1,0});\n\t\t\n\t}\n\t\n\t\tpq.push((pa3){0,0,0});\n\t\n\twhile(pq.size()){\n\t\tpa3 z=pq.top();\n\t\tpq.pop();\n\t\tif(sumi[z.y][z.z])continue;\n\t\tsumi[z.y][z.z]=1;\n\t//\tcout<<z.x<<\" \"<<z.y<<\" \"<<z.z<<endl;\n\t\tif(z.y==0 && z.z==1){\n\t\tcout<<z.x<<endl;\n\t\t\treturn 0;\n\t\t}\n\t\tfor(auto v:G[z.y][z.z]){\n\t\t\t\tpq.push((pa3){z.x+v.z,v.x,v.y});\n\t\t}\n\t\n\t\n\t}\n\t\n\t\n\treturn 0;\n\t\n }","accuracy":1,"time_ms":770,"memory_kb":183424,"score_of_the_acc":-1.8549,"final_rank":16},{"submission_id":"aoj_3030_2752459","code_snippet":"#include<algorithm>\n#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\ntypedef long long lint;\ntypedef vector<int>vi;\ntypedef pair<int,int>pii;\ntypedef pair<lint,pii>plpii;\n#define rep(i,n)for(int i=0;i<(int)(n);++i)\n\nconst int N=1010;\nconst lint inf=1e16;\n\nint main(){\n int w,h,n;\n cin>>w>>h>>n;\n int mi=1e8;\n vector<pii> pts(n+2);\n pts[0]=pii(1,1);\n pts[1]=pii(w,h);\n rep(i,n){\n int x,y;\n cin>>x>>y;\n pts[i+2]=pii(x,y);\n }\n priority_queue<plpii,vector<plpii>,greater<plpii> > que;\n vector<vector<lint> > dis(n+2,vector<lint>(N,inf));\n rep(i,n){\n int d=abs(pts[i+2].first-1)+abs(pts[i+2].second-1);\n que.push(plpii(d,pii(i+2,d)));\n }\n while(!que.empty()){\n plpii top=que.top();que.pop();\n lint d=top.first;\n pii xy=top.second;\n int x=xy.first,y=xy.second;\n if(dis[x][y]<=d)continue;\n dis[x][y]=d;\n rep(i,n+2){\n if(i==x||i==0)continue;\n int c=abs(pts[i].first-pts[x].first)+abs(pts[i].second-pts[x].second);\n c=max(0,i==1?c-y:(c-y-1));\n if(c>=N)continue;\n int nx=i;\n int ny=i==1?0:c;\n if(dis[nx][ny]<=d+c)continue;\n dis[nx][ny]=d+c+1;\n que.push(plpii(d+c,pii(nx,ny)));\n }\n }\n cout<<dis[1][0]<<endl;\n}","accuracy":1,"time_ms":60,"memory_kb":5792,"score_of_the_acc":-0.0756,"final_rank":12},{"submission_id":"aoj_3030_2752004","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n\n/*\n<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day2/problems/E>\n問題文============================================================\n\n W×H の二次元のマス上にN個の街灯がある。\n がっちょ君は(1,1)からスタートして(W,H)に行きたい。\n がっちょ君は暗いところが怖いので、街灯により明るくなっているマスしか歩きたくない。\n 最初、すべての街灯はその街灯のあるマスのみを明るくしている。\n そこで、がっちょ君は好きな街灯iに対してコストriを設定することにした。なお、コストを設定しない街灯があってもよい。\n 街灯iはコストriを消費することにより、その街灯を中心にマンハッタン距離でri以内の範囲を明るくすることができる。ただしコストは正の整数とする。\n がっちょ君は上下左右のいずれかの方向に隣接するマスに移動する事ができる。\n がっちょ君はriの合計値を最小になるように設定することにした。そのときの合計値を求めよ。\n 2つの地点 (a,b) と (c,d) 間のマンハッタン距離は |a−c|+|b−d| で表される。\n \n\n \n=================================================================\n\n解説=============================================================\n\n dist[i][j] := i頂点で明るさがjである地点への最小コストで\n \n 拡張dijkstra\n \n================================================================\n*/\n\nll dist[105][505*505];\nint main(void) {\n\tcin.tie(0); ios::sync_with_stdio(false);\n ll W,H,N; cin >> W >> H >> N;\n vector<ll> x(N+1),y(N+1);\n x[0] = y[0] = 1;\n for(int i = 1; i <= N;i++) cin >> x[i] >> y[i];\n vector<vector<ll>> G(N+1);\n \n for(int i = 1; i <= N; i++){\n for(int j = 1; j <= N;j++){\n if(i == j) continue;\n //if(x[i] <= x[j]){// && y[i] <= y[j]){\n G[i].push_back(j);\n //}\n }\n }\n\n for(int i = 0; i < 105;i++)for(int j = 0; j < 505*505; j++) dist[i][j] = LINF;\n \n typedef pair<ll,pll> plpll;\n // dist[0][0] = 0;\n priority_queue<plpll,vector<plpll>,greater<plpll>> pq;\n for(int i = 1; i <= N;i++){\n ll cost = abs(x[i]-x[0])+abs(y[i]-y[0]);\n pq.push({cost,{i,cost}});\n dist[i][cost] = cost;\n }\n// pq.push({0,{0,0}});\n while(pq.size()){\n auto p = pq.top(); pq.pop();\n ll d = p.first, n = p.second.first, r = p.second.second;\n if(dist[n][r] < d) continue;\n for(ll next : G[n]){\n ll mdis = abs(x[n]-x[next]) + abs(y[n]-y[next]);\n if(r >= mdis-1){\n if(dist[next][0] > dist[n][r]){\n dist[next][0] = dist[n][r];\n pq.push({dist[next][0],{next,0}});\n }\n }else{\n ll cost = mdis-r-1;\n if(dist[next][cost] > dist[n][r] + cost){\n dist[next][cost] = dist[n][r] + cost;\n pq.push({dist[next][cost],{next,cost}});\n }\n }\n }\n }\n ll ans = LINF;\n for(int i = 1; i <= N;i++){\n for(int j = 0; j < 505*505;j++){\n if(dist[i][j]==LINF)continue;\n ll mdis = abs(W-x[i])+abs(H-y[i]);\n ans = min(ans,dist[i][j]+max(mdis-j,0LL));\n }\n }\n cout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":213924,"score_of_the_acc":-1.1316,"final_rank":15},{"submission_id":"aoj_3030_2751963","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int64 INF = 1LL << 60;\n\n#define int long long\nint W, H, N, X[100], Y[100];\nint64 v[100][1005];\n\nsigned main() {\n srand((unsigned) time(NULL));\n cin >> W >> H >> N;\n\n for(int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n }\n fill_n(*v, 100 * 1005, INF);\n\n if(rand() % 2) {\n fill_n(*v, 100 * 1001, INF);\n using Tuplis = tuple< int64, int, int >;\n\n priority_queue< Tuplis, vector< Tuplis >, greater< Tuplis > > que;\n\n\n for(int i = 0; i < N; i++) {\n v[i][abs(X[i] - 1) + abs(Y[i] - 1)] = abs(X[i] - 1) + abs(Y[i] - 1);\n que.emplace(abs(X[i] - 1) + abs(Y[i] - 1), abs(X[i] - 1) + abs(Y[i] - 1), i);\n }\n while(que.size()) {\n int64 cost;\n int l, j;\n tie(cost, l, j) = que.top();\n que.pop();\n if(v[j][l] < cost) continue;\n for(int k = 0; k < N; k++) {\n if(j == k) continue;\n int64 distance = abs(X[k] - X[j]) + abs(Y[k] - Y[j]);\n if(distance >= l) { // 距離のほうが遠い\n int64 add_cost = cost + (distance - l); // 追加で掛かるア\n if(add_cost < v[k][distance]) {\n v[k][distance] = add_cost;\n que.emplace(add_cost, distance, k);\n }\n } else { // 距離のほうが近い\n int64 add_cost = cost;\n if(add_cost < v[k][0]) {\n v[k][0] = add_cost;\n que.emplace(add_cost, 0, k);\n }\n }\n }\n\n\n if(l > 0) {\n if(v[j][l] < v[j][l - 1]) {\n v[j][l - 1] = v[j][l];\n que.emplace(v[j][l - 1], l - 1, j);\n }\n }\n if(l < 1000) {\n if(v[j][l] + 1 < v[j][l + 1]) {\n v[j][l + 1] = v[j][l] + 1;\n que.emplace(v[j][l + 1], l + 1, j);\n }\n }\n }\n int64 ret = INF;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j <= 1000; j++) {\n int64 cost = abs(X[i] - W) + abs(Y[i] - H);\n ret = min(ret, v[i][j] + max(0LL, cost - j));\n }\n }\n cout << ret << endl;\n\n } else {\n using Tuplis = tuple< int64, int, int >;\n\n priority_queue< Tuplis, vector< Tuplis >, greater< Tuplis > > que;\n\n\n for(int i = 0; i < N; i++) {\n v[i][abs(X[i] - 1) + abs(Y[i] - 1)] = abs(X[i] - 1) + abs(Y[i] - 1) - 1;\n que.emplace(abs(X[i] - 1) + abs(Y[i] - 1) - 1, abs(X[i] - 1) + abs(Y[i] - 1), i);\n }\n while(que.size()) {\n int64 cost;\n int l, idx;\n tie(cost, l, idx) = que.top();\n que.pop();\n\n for(int k = 0; k < N; k++) {\n if(idx == k) continue;\n int64 distance = abs(X[k] - X[idx]) + abs(Y[k] - Y[idx]);\n\n int64 add_cost = cost + max(0LL, distance - l); // 追加で掛かるア\n if(add_cost < v[k][max(0LL, distance - l)]) {\n v[k][max(0LL, distance - l)] = add_cost;\n que.emplace(add_cost, max(0LL, distance - l), k);\n }\n\n }\n\n if(v[idx][l] + 1 < v[idx][l + 1]) {\n v[idx][l + 1] = v[idx][l] + 1;\n que.emplace(v[idx][l + 1], l + 1, idx);\n\n }\n }\n int64 ret = INF;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j <= 1003; j++) {\n int64 cost = abs(X[i] - W) + abs(Y[i] - H);\n ret = min(ret, v[i][j] + max(0LL, cost - j));\n }\n }\n cout << ret << endl;\n }\n}","accuracy":0.043010752688172046,"time_ms":10,"memory_kb":3888,"score_of_the_acc":-0.0008,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_3030_4462499\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <algorithm>\\n#include <cmath>\\n#include <set>\\n#include <cstdio>\\n#include <vector>\\n#include <iostream>\\n#include <utility>\\n#include <queue>\\n#include <map>\\n#include <complex>\\n#define fir first\\n#define sec second\\n#define sz(s) (s).size()\\n#define pb push_back\\n#define get(n) scanf(\\\"%d\\\",&n);\\n#define gets(s) string s;cin >> (s);\\n#define prfi(n) printf(\\\"%d\\\", &n);\\n#define prfd(n) printf(\\\"%lf\\\", &n);\\n#define All(s) (s).begin(), (s).end()\\n#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)\\n#define For(i,j,k) for(int (i)=(j);(i)<(k);(i)++)\\n#define drep(i,j) for(int (i)=(j);(i)>=0;(i)--)\\n#define Ford(i,j,k) for(int (i)=(j);i>=(k);i--)\\n#define fore(c,v) for(auto (c): (v))\\n#define lp for(int __=0;__<n;i++)\\n#define mem(a,b) memset(a,b,sizeof(a));\\n#define dump(x) std::cout << #x << \\\" = \\\" << (x) << std::endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\nusing ull = unsigned long long int;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = std::pair<int,int>;\\nusing pll = std::pair<ll, ll>;\\nusing vi = std::vector<int> ;\\nusing vvi = std::vector<vi> ;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vd = std::vector<double> ;\\nusing vvd = std::vector<vd> ;\\nusing qi = std::queue<int> ;\\nusing vpii = std::vector<std::pair<int, int> >;\\nusing vpll = std::vector<pll>;\\nusing namespace std;\\n\\nconst int Mod = (1e9) + 7;\\nconst int INF = 1e9 + 19;\\nconst ll INFL = 1e18 + 19;\\nconst int dx[] = {-1, 0, 0, 1};\\nconst int dy[] = {0, -1, 1, 0};\\nconst int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\\nconst int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};\\nconst double EPS = 1e-10;\\n//_____________________________________Templates_________________________________________//\\n\\ntemplate<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}\\ntemplate<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}\\ntemplate<class T> inline void pri(T a){cout << a << endl;}\\ntemplate<class Z> using vec = vector<Z>;\\ntemplate<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\n//mainly use for dynamic prog\\ntemplate<class T1, class T2>\\nvoid update(T1 &a, T2 b){\\n a += b;\\n if(a > Mod) a %= Mod;\\n}\\n\\ninline void IN(void){\\n return;\\n}\\n\\ntemplate <typename First, typename... Rest>\\nvoid IN(First& first, Rest&... rest){\\n cin >> first;\\n IN(rest...);\\n return;\\n}\\n\\ninline void OUT(void){\\n cout << \\\"\\\\n\\\";\\n return;\\n}\\n\\ntemplate <typename First, typename... Rest>\\nvoid OUT(First first, Rest... rest){\\n cout << first << \\\" \\\";\\n OUT(rest...);\\n return;\\n}\\n\\nbool pairsort(pll pl, pll pr){\\n if(pl.first == pr.first)return pl.second > pr.second;\\n return pl.first < pr.first;\\n}\\n\\nint cntbit(ll a,int n,int j){int res = 0;For(i,j,n){if(a>>i & 1){res++;}}return res;}\\nvector<int> make_bit(int a){vector<int> res; for(int i=31;i>=0;i--)if(a&(1<<i))res.pb(i);return res;}\\nbool stdbit(int a, int b){return a&(1 << b); }\\nint GCD(int a, int b){if(b > a)return GCD(b,a);if(a%b == 0)return b;else return GCD(b, a%b);}\\nint LCM(int a, int b){return a*b/GCD(a,b);}\\nint roundup(int a, int b){if(a % b == 0)return a/b;else return (a+b)/b;}\\nint rounddown(int a, int b){if(a%b == 0)return a/b;else {return (a-b)/b;}}\\nll pow(ll a, ll n){ll res = 1;while(n > 0){if(n&1)res *= a; a *= a; n = n >> 1;}return res;}\\nll GetDiviserCount(ll N)//約数の個数\\n{\\n ll res = 1;\\n For(i,2,sqrt(N)+1)\\n {\\n ll cnt = 0;\\n while(N%i == 0)\\n {\\n cnt++;\\n N /= i;\\n }\\n res *= (cnt + 1);\\n if(N == 1)break;\\n }\\n if(N != 1)res *= 2;\\n return res;\\n}\\nvll GetDivisor(ll N)//約数列挙\\n{\\n vll res;\\n for(ll i = 1;i*i <= N;i++)\\n {\\n if(N%i == 0)\\n {\\n res.pb(i);\\n if(i*i != N)res.pb(N/i);\\n }\\n }\\n sort(All(res));\\n return res;\\n}\\n\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%Mod+Mod)%Mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= Mod) x -= Mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += Mod-a.x) >= Mod) x -= Mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= Mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n \\n // for prime mod\\n mint inv() const {\\n return pow(Mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n friend ostream& operator<<(ostream& os, const mint& a);\\n};\\nostream& operator<<(ostream& os, const mint& a)\\n{\\n os << a.x;\\n return os;\\n}\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n assert(n < Mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n};\\n \\ntemplate<class Z>\\nstruct Matrix\\n{\\n using mat = Matrix<Z>;\\n vector<vector<Z>> m_dat;\\n int m_h;\\n int m_w;\\n Matrix(int h, int w) : m_h(h), m_w(w) ,m_dat(h,vector<Z>(w)) {}\\n vector<Z> &operator[] (int idx)\\n {\\n return m_dat[idx];\\n }\\n mat Multiple(mat &a)\\n {\\n mat C(m_h, a.m_w);\\n for(int i=0;i<m_h;i++)\\n {\\n for(int j=0;j<a.m_w;j++)\\n {\\n for(int k=0;k<m_w;k++)\\n {\\n C[i][j] += m_dat[i][k] * a[k][j];\\n }\\n }\\n }\\n return C;\\n }\\n mat Pow(ll x)\\n {\\n mat B(m_h,m_w);\\n for(int i=0;i<m_h;i++)\\n {\\n B[i][i] = 1;\\n }\\n mat A = *this;\\n while(x > 0)\\n {\\n if(x&1)B = B.Multiple(A);\\n A = A.Multiple(A);\\n x = x >> 1;\\n }\\n return B;\\n }\\n //friend ostream& operator<<(ostream &os, const mat &A);\\n};\\n/*\\ntemplate<class Z>\\nostream& operator<<(ostream &os, Matrix<Z>& A)\\n{\\n for(int i=0;i<A.m_h;i++)\\n {\\n for(int j=0;j<A.m_w;j++)\\n {\\n os << A[i][j] << \\\" \\\";\\n }\\n os << endl;\\n }\\n return os;\\n}\\ntemplate<class T>\\nusing mat = Matrix<T>;\\n*/\\n//_____________________ following sorce code_________________________//\\nconst int max_n = 3 * (1e5) + 1;\\nconst int max_m = 83 * (1e5) + 1;\\n\\nint n,m,k;\\nll N;\\nint h,w;\\nstring S;\\nint a,b,c;\\nvi v;\\nint ans;\\ndouble x,y,z;\\nvector<int> G[1010101];\\nstruct Dat\\n{\\n int Num,cost,Man;\\n Dat() {}\\n Dat(int pos, int cost,int Man) : Num(pos), cost(cost),Man(Man){}\\n bool operator>(const Dat &a) const\\n {\\n return cost > a.cost;\\n }\\n};\\nsigned main (int argc, char* argv[]) {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n IN(w,h);\\n w--;h--;\\n IN(n);\\n vi x(n), y(n);\\n rep(i,n)\\n {\\n IN(x[i],y[i]);\\n x[i]--;\\n y[i]--;\\n }\\n ans = INF;\\n min_priority_queue<Dat> qu;\\n vector<vector<int>> dist(n,vi(1010,INF));\\n rep(i,n)\\n {\\n int k = x[i] + y[i];\\n dist[i][k] = k;\\n qu.push(Dat(i,k,k));\\n }\\n while(!qu.empty())\\n {\\n auto e = qu.top();qu.pop();\\n int curr = e.Num;\\n int cost = e.cost;\\n int Man = e.Man;\\n if(dist[curr][Man] < cost)continue;\\n //dist[curr][Man] = cost;\\n rep(i,n)\\n {\\n if(curr == i)continue;\\n int d = max(0,abs(x[i]-x[curr]) + abs(y[i]-y[curr]) - 1 - Man);\\n if(dist[i][d] > d + cost)\\n {\\n dist[i][d] = d+cost;\\n qu.push(Dat(i,d+cost,d));\\n }\\n }\\n }\\n int ans = INF;\\n rep(i,n)\\n {\\n rep(j,1010)\\n {\\n chmin(ans, dist[i][j] + max(0,abs(w-x[i]) + abs(h-y[i]) - j));\\n }\\n }\\n cout << ans << endl;\\n //for(auto c : ans){cout << c << endl;}\\n //cout << fixed << setprecision(15) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 27972,\n \"score_of_the_acc\": -0.1417,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3030_3416746\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-2;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint w, h, n;\\nint x[100], y[100];\\nint d[100][1001];\\nstruct vertice {\\n\\tint id, bl; int cost;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (v.cost != cost)return cost > v.cost;\\n\\t\\tif (v.id != id)return v.id > id;\\n\\t\\telse return v.bl > bl;\\n\\t}\\n};\\npriority_queue<vertice> q;\\nvoid init() {\\n\\trep(i, 100) {\\n\\t\\trep(j, 1001) {\\n\\t\\t\\td[i][j] = mod;\\n\\t\\t}\\n\\t}\\n}\\nint main() {\\n\\tinit();\\n\\tcin >> w >> h >> n;\\n\\trep(i, n) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t}\\n\\trep(i, n) {\\n\\t\\tint z = x[i] - 1 + y[i] - 1;\\n\\t\\tq.push({ i,z,z });\\n\\t\\td[i][z] = z;\\n\\t}\\n\\tint ans = mod;\\n\\t//dijkstra\\n\\twhile (!q.empty()) {\\n\\t\\tvertice v = q.top(); q.pop();\\n\\t\\tint id = v.id,bl=v.bl,cost=v.cost;\\n\\t\\tint dis = h - x[id] + w - y[id];\\n\\t\\tans = min(ans, cost+max(0, dis - bl));\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (i == id)continue;\\n\\t\\t\\tint dis = abs(x[id] - x[i]) + abs(y[id] - y[i]);\\n\\t\\t\\tdis = max(0, dis - bl-1);\\n\\t\\t\\tif (d[i][dis] > cost + dis) {\\n\\t\\t\\t\\td[i][dis] = cost + dis;\\n\\t\\t\\t\\tq.push({ i,dis,cost + dis });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4284,\n \"score_of_the_acc\": -0.0158,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3030_3407482\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-2;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint w, h, n;\\nint x[100], y[100];\\nint d[100][1001];\\nstruct vertice {\\n\\tint id, bl; int cost;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (v.cost != cost)return cost > v.cost;\\n\\t\\tif (v.id != id)return v.id > id;\\n\\t\\telse return v.bl > bl;\\n\\t}\\n};\\npriority_queue<vertice> q;\\nvoid init() {\\n\\trep(i, 100) {\\n\\t\\trep(j, 1001) {\\n\\t\\t\\td[i][j] = mod;\\n\\t\\t}\\n\\t}\\n}\\nint main() {\\n\\tinit();\\n\\tcin >> w >> h >> n;\\n\\trep(i, n) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t}\\n\\trep(i, n) {\\n\\t\\tint z = x[i] - 1 + y[i] - 1;\\n\\t\\tq.push({ i,z,z });\\n\\t\\td[i][z] = z;\\n\\t}\\n\\tint ans = mod;\\n\\t//dijkstra\\n\\twhile (!q.empty()) {\\n\\t\\tvertice v = q.top(); q.pop();\\n\\t\\tint id = v.id,bl=v.bl,cost=v.cost;\\n\\t\\tint dis = h - x[id] + w - y[id];\\n\\t\\tans = min(ans, cost+max(0, dis - bl));\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (i == id)continue;\\n\\t\\t\\tint dis = abs(x[id] - x[i]) + abs(y[id] - y[i]);\\n\\t\\t\\tdis = max(0, dis - bl-1);\\n\\t\\t\\tif (d[i][dis] > cost + dis) {\\n\\t\\t\\t\\td[i][dis] = cost + dis;\\n\\t\\t\\t\\tq.push({ i,dis,cost + dis });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.0287,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3030_3407457\",\n \"code_snippet\": \"//外灯をつける→次の外灯まで移動する→外灯が消える、N * (W + H)頂点の拡張ダイクストラ。スタートとゴールは大きさ-1の外灯。\\n//O(N^2 * (W + H) * logほげ)くらい。\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\n#include <functional>\\n#include <tuple>\\n#include <cmath>\\n#define rep(i, n) for(i = 0; i < n; i++)\\n#define int long long\\nusing namespace std;\\n\\nint INF = 1e+9;\\nint w, h, n;\\nint x[102], y[102];\\nint minCost[102][1100];\\t//minCost[場所][外灯の大きさ + 1]\\n\\nsigned main() {\\n\\tint i, j;\\n\\t\\n\\tcin >> w >> h >> n;\\n\\trep(i, n) { cin >> x[i] >> y[i]; }\\n\\tx[n] = 1;\\n\\ty[n] = 1;\\n\\tx[n + 1] = w;\\n\\ty[n + 1] = h;\\n\\tn += 2;\\n\\t\\n\\trep(i, n) rep(j, 1100) minCost[i][j] = INF;\\n\\t\\n\\ttypedef tuple<int, int, int> T;\\n\\tpriority_queue<T, vector<T>, greater<T> > que;\\n\\t\\n\\tminCost[n - 2][0] = 0;\\n\\tque.push(T(0, n - 2, 0));\\n\\twhile (!que.empty()) {\\n\\t\\tT now = que.top(); que.pop();\\n\\t\\tint cst = get<0>(now);\\n\\t\\tint pos = get<1>(now);\\n\\t\\tint sz = get<2>(now) - 1;\\n\\t\\t\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (pos == j) continue;\\n\\t\\t\\tint lowSz = abs(x[j] - x[pos]) + abs(y[j] - y[pos]) - sz - 1;\\n\\t\\t\\tif (j == n - 2 && lowSz >= 0) { continue; }\\n\\t\\t\\tif (j == n - 1 && lowSz >= 0) { lowSz++; }\\n\\t\\t\\tif (lowSz < 0) lowSz = 0;\\n\\t\\t\\tif (minCost[j][lowSz + 1] > cst + lowSz) {\\n\\t\\t\\t\\tminCost[j][lowSz + 1] = cst + lowSz;\\n\\t\\t\\t\\tque.push(T(cst + lowSz, j, lowSz + 1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint ans = INF;\\n\\trep(i, 1100) ans = min(ans, minCost[n - 1][i]);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5380,\n \"score_of_the_acc\": -0.0342,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3030_3407449\",\n \"code_snippet\": \"//外灯をつける→次の外灯まで移動する→外灯が消える、N * (W + H)頂点の拡張ダイクストラ。スタートとゴールは大きさ-1の外灯。\\n//O(N^2 * (W + H) * logほげ)くらい。\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\n#include <functional>\\n#include <tuple>\\n#include <cmath>\\n#define rep(i, n) for(i = 0; i < n; i++)\\n#define int long long\\nusing namespace std;\\n\\nint INF = 1e+9;\\nint w, h, n;\\nint x[102], y[102];\\nint minCost[102][1100];\\t//minCost[場所][外灯の大きさ + 1]\\n\\nsigned main() {\\n\\tint i, j;\\n\\t\\n\\tcin >> w >> h >> n;\\n\\trep(i, n) { cin >> x[i] >> y[i]; }\\n\\tx[n] = 1;\\n\\ty[n] = 1;\\n\\tx[n + 1] = w;\\n\\ty[n + 1] = h;\\n\\tn += 2;\\n\\t\\n\\trep(i, n) rep(j, 1100) minCost[i][j] = INF;\\n\\t\\n\\ttypedef tuple<int, int, int> T;\\n\\tpriority_queue<T, vector<T>, greater<T> > que;\\n\\t\\n\\tminCost[n - 2][0] = 0;\\n\\tque.push(T(0, n - 2, 0));\\n\\twhile (!que.empty()) {\\n\\t\\tT now = que.top(); que.pop();\\n\\t\\tint cst = get<0>(now);\\n\\t\\tint pos = get<1>(now);\\n\\t\\tint sz = get<2>(now) - 1;\\n\\t\\t\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (pos == j) continue;\\n\\t\\t\\tint lowSz = abs(x[j] - x[pos]) + abs(y[j] - y[pos]) - sz - 1;\\n\\t\\t\\tif (j == n - 2 && lowSz >= 0) continue;\\n\\t\\t\\tif (j == n - 1 && lowSz >= 0) continue;\\n\\t\\t\\tif (lowSz < 0) lowSz = 0;\\n\\t\\t\\tif (minCost[j][lowSz + 1] > cst + lowSz) {\\n\\t\\t\\t\\tminCost[j][lowSz + 1] = cst + lowSz;\\n\\t\\t\\t\\tque.push(T(cst + lowSz, j, lowSz + 1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint ans = INF;\\n\\trep(i, 1100) ans = min(ans, minCost[n - 1][i]);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3978494623655914,\n \"time_ms\": 20,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -0.0203,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3030_3147685\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing ll = long long;\\n#define int ll\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define loop(i,s,n) for(int i=s;i<n;i++)\\n#define erep(e,v) for(auto && e :v)\\n#define all(in) in.begin(), in.end()\\n#define MP make_pair\\n#define INF (sizeof(int) == 4 ? (int)1e9:(int)1e18)\\n#define EPS 0.0000000001\\nusing namespace std;\\ntemplate<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }\\ntemplate<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }\\ntemplate<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }\\ntemplate<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }\\ntemplate<class T> void join(T a){for(auto itr :a){if(itr != *a.begin())cout << \\\" \\\"; cout << itr;} }\\nusing ld = long double;\\nusing pii = pair<int,int>;\\nusing piii = pair<int,pii>;\\nint W,H;\\nint dx[]={0,0,1,-1}, dy[]={1,-1,0,0};\\nbool valid(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}\\nsigned main(){\\n int N;\\n cin >> W >> H >> N;\\n vector<pii>v(N);\\n erep(e,v) cin >> e.first >> e.second,--e.first,--e.second;\\n v.push_back(pii(0,0));\\n v.push_back(pii(W-1,H-1));\\n int s = N,t = N+1;\\n vector<vector<int>>edge(N+2,vector<int>(N+2,INF));\\n vector<vector<int>>d(N+2,vector<int>(1000+ 100,INF));\\n priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>>que;\\n \\n rep(i,N+2)rep(j,N+2)edge[i][j] = abs(v[i].first - v[j].first) + abs(v[i].second - v[j].second);\\n que.push({0,s,0});\\n d[s][0] = 0;\\n while(!que.empty()){\\n auto top = que.top();\\n int dist = top.front(),v = top[1],cost = top[2];\\n que.pop();\\n if (dist > d[v][cost])continue;\\n rep(nv,edge[v].size()){\\n if(nv == v)continue;\\n int ncost = edge[v][nv] - cost -(v != s and nv != t);\\n cmax(ncost,0LL);\\n if(d[nv][ncost] > dist + ncost){\\n d[nv][ncost] = dist + ncost;\\n que.push({d[nv][ncost],nv,ncost});\\n }\\n }\\n }\\n cout << *min_element(all(d[t])) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7072,\n \"score_of_the_acc\": -0.0554,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3030_3090691\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#define repi(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,a) repi(i,0,a)\\n#define all(a) (a).begin(), (a).end()\\n\\nconstexpr int MAX_N = 100, INF = 1<<30;\\n\\nusing P = std::pair<int, int>;\\nusing State = std::pair<int, P>;\\n\\nint W, H, N;\\nint x[MAX_N], y[MAX_N];\\nint d[MAX_N][1010];\\nstd::priority_queue<State, std::vector<State>, std::greater<State> > pque;\\nint ans = INF;\\n\\nint main()\\n{\\n scanf( \\\"%d%d%d\\\", &W, &H, &N );\\n rep( i, N )\\n scanf( \\\"%d%d\\\", x+i, y+i ), --x[i], --y[i];\\n\\n std::fill( (int*)d, (int*)(d+N), INF );\\n\\n rep( i, N )\\n {\\n int cost = x[i]+y[i];\\n d[i][cost] = cost;\\n pque.push( State( d[i][cost], P( i, cost ) ) );\\n }\\n\\n while( !pque.empty() )\\n {\\n State st = pque.top(); pque.pop();\\n int dist = st.first, v = st.second.first, cost = st.second.second;\\n\\n if( d[v][cost] < dist )\\n continue;\\n\\n rep( i, N )\\n {\\n int ncost = std::max( 0, abs(x[i]-x[v])+abs(y[i]-y[v])-cost-1 );\\n\\n if( d[i][ncost] > d[v][cost]+ncost )\\n {\\n d[i][ncost] = d[v][cost]+ncost;\\n pque.push( State( d[i][ncost], P( i, ncost ) ) );\\n }\\n }\\n }\\n\\n rep( i, N ) rep( j, W+H+1 )\\n ans = std::min( ans, d[i][j]+std::max(0,abs(W-1-x[i])+abs(H-1-y[i])-j) );\\n\\n printf( \\\"%d\\\\n\\\", ans );\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.0132,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3030_2859266\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Data{\\n\\tint row,col;\\n};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\tindex = brightness = sum_cost = 0;\\n\\t}\\n\\n\\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\\n\\t\\tindex = arg_index;\\n\\t\\tbrightness = arg_brightness;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\treturn sum_cost > arg.sum_cost;\\n\\t}\\n\\tint index,brightness,sum_cost;\\n};\\n\\n\\nint N;\\nint W,H;\\nint min_cost[101][1000];\\nData data[100];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&W,&H,&N);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&data[i].col,&data[i].row);\\n\\t\\tdata[i].col--;\\n\\t\\tdata[i].row--;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM;\\n\\t}\\n\\n\\tpriority_queue<Info> Q;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\\n\\t\\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col));\\n\\t}\\n\\n\\tint dist,next_Brightness,next_cost;\\n\\n\\tInfo info;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tinfo = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tif(info.brightness < H+W-2 && min_cost[info.index][info.brightness+1] > info.sum_cost+1){\\n\\t\\t\\tmin_cost[info.index][info.brightness+1] = info.sum_cost+1;\\n\\t\\t\\tQ.push(Info(info.index,info.brightness+1,info.sum_cost+1));\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i == info.index)continue;\\n\\n\\t\\t\\tdist = abs(data[info.index].row-data[i].row)+abs(data[info.index].col-data[i].col);\\n\\n\\t\\t\\tif(dist <= info.brightness+1){\\n\\t\\t\\t\\tnext_Brightness = 0;\\n\\t\\t\\t\\tnext_cost = info.sum_cost;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tnext_Brightness = dist-(info.brightness+1);\\n\\t\\t\\t\\tnext_cost = info.sum_cost+next_Brightness;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_cost[i][next_Brightness] > next_cost){\\n\\t\\t\\t\\tmin_cost[i][next_Brightness] = next_cost;\\n\\t\\t\\t\\tQ.push(Info(i,next_Brightness,next_cost));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\\n\\t\\tfor(int k = dist; k <= H+W-2; k++){\\n\\t\\t\\tans = min(ans,min_cost[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4192,\n \"score_of_the_acc\": -0.068,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3030_2859262\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Data{\\n\\tint row,col;\\n};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\tindex = brightness = sum_cost = 0;\\n\\t}\\n\\n\\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\\n\\t\\tindex = arg_index;\\n\\t\\tbrightness = arg_brightness;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\\n\\t\\treturn sum_cost > arg.sum_cost;\\n\\t}\\n\\tint index,brightness,sum_cost;\\n};\\n\\n\\nint N;\\nint W,H;\\nint min_cost[101][1000];\\nData data[100];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&W,&H,&N);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&data[i].col,&data[i].row);\\n\\t\\tdata[i].col--;\\n\\t\\tdata[i].row--;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM; //min_cost[何番目の街灯か][明るさ] = 最小到達コスト\\n\\t}\\n\\n\\t//★最初に訪れる街灯を全探索★\\n\\tpriority_queue<Info> Q;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\\n\\t\\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col)); //左上まで光を引っ張ってくるイメージ\\n\\t}\\n\\n\\tint dist,next_Brightness,next_cost;\\n\\n\\tInfo info;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tinfo = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i == info.index)continue;\\n\\n\\t\\t\\tdist = abs(data[info.index].row-data[i].row)+abs(data[info.index].col-data[i].col);\\n\\n\\t\\t\\tif(dist <= info.brightness+1){ //次の街灯への距離-1まで全て照らせる場合\\n\\t\\t\\t\\tnext_Brightness = 0;\\n\\t\\t\\t\\tnext_cost = info.sum_cost;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tnext_Brightness = dist-(info.brightness+1); //★次の街灯から距離1のところまで照らして貰えば良い★\\n\\t\\t\\t\\tnext_cost = info.sum_cost+next_Brightness;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_cost[i][next_Brightness] > next_cost){\\n\\t\\t\\t\\tmin_cost[i][next_Brightness] = next_cost;\\n\\t\\t\\t\\tQ.push(Info(i,next_Brightness,next_cost));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\n\\t//右下までの最小コストを求める\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\\n\\t\\tfor(int k = dist; k <= H+W-2; k++){\\n\\t\\t\\tans = min(ans,min_cost[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3978494623655914,\n \"time_ms\": 20,\n \"memory_kb\": 4056,\n \"score_of_the_acc\": -0.0148,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3030_2859261\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Data{\\n\\tint row,col;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_index,int arg_brightness,int arg_sum_cost){\\n\\t\\tindex = arg_index;\\n\\t\\tbrightness = arg_brightness;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{ //総コストの昇順(PQ)\\n\\t\\treturn sum_cost > arg.sum_cost;\\n\\t}\\n\\tint index,brightness,sum_cost;\\n};\\n\\n\\nint N;\\nint W,H;\\nint min_cost[101][1000];\\nData data[100];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&W,&H,&N);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d %d\\\",&data[i].col,&data[i].row);\\n\\t\\tdata[i].col--;\\n\\t\\tdata[i].row--;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k <= H+W-2; k++)min_cost[i][k] = BIG_NUM; //min_cost[何番目の街灯か][明るさ] = 最小到達コスト\\n\\t}\\n\\n\\t//★最初に訪れる街灯を全探索★\\n\\tpriority_queue<Info> Q;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tmin_cost[i][data[i].row+data[i].col] = data[i].row+data[i].col;\\n\\t\\tQ.push(Info(i,data[i].row+data[i].col,data[i].row+data[i].col)); //左上まで光を引っ張ってくるイメージ\\n\\t}\\n\\n\\tint dist,next_Brightness,next_cost;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(i == Q.top().index)continue;\\n\\n\\t\\t\\tdist = abs(data[Q.top().index].row-data[i].row)+abs(data[Q.top().index].col-data[i].col);\\n\\n\\t\\t\\tif(dist <= Q.top().brightness+1){ //次の街灯への距離-1まで全て照らせる場合\\n\\t\\t\\t\\tnext_Brightness = 0;\\n\\t\\t\\t\\tnext_cost = Q.top().sum_cost;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tnext_Brightness = dist-(Q.top().brightness+1); //★次の街灯から距離1のところまで照らして貰えば良い★\\n\\t\\t\\t\\tnext_cost = Q.top().sum_cost+next_Brightness;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_cost[i][next_Brightness] > next_cost){\\n\\t\\t\\t\\tmin_cost[i][next_Brightness] = next_cost;\\n\\t\\t\\t\\tQ.push(Info(i,next_Brightness,next_cost));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tQ.pop();\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\n\\t//右下までの最小コストを求める\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdist = abs((H-1)-data[i].row)+abs((W-1)-data[i].col);\\n\\t\\tfor(int k = dist; k <= H+W-2; k++){\\n\\t\\t\\tans = min(ans,min_cost[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3978494623655914,\n \"time_ms\": 20,\n \"memory_kb\": 4088,\n \"score_of_the_acc\": -0.0149,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3030_2847416\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\nstruct aa {\\n\\tint id;\\n\\tint li;\\n\\tint cost;\\n\\n\\tconst bool operator<(const aa&r)const {\\n\\t\\treturn this->cost>r.cost;\\n\\t}\\n};\\nint main() {\\n\\tint W,H,N;cin>>W>>H>>N;\\n\\n\\tvector<pair<int,int>>lights(N+1);\\n\\n\\tlights[0]=make_pair(0,0);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint x,y;cin>>x>>y;\\n\\t\\tlights[i+1]=make_pair(x-1,y-1);\\n\\t}\\n\\tlights.emplace_back(W-1,H-1);\\n\\n\\n\\tpriority_queue<aa>que;\\n\\tvector<vector<int>>dp(N+2,vector<int>(1010,1e8));\\n\\n\\tque.push(aa{ 0,0,0 });;\\n\\tdp[0][0]=0;\\n\\n\\twhile (!que.empty()) {\\n\\t\\taa atop(que.top());\\n\\t\\tque.pop();\\n\\n\\t\\tconst int now_id(atop.id);\\n\\t\\tconst int now_li(atop.li);\\n\\t\\tconst int now_cost=atop.cost;\\n\\n\\t\\tfor (int next_id = 1; next_id < N + 2; ++next_id) {\\n\\t\\t\\tif(now_id==next_id)continue;\\n\\t\\t\\tif(now_id==0&&next_id==N+1)continue;\\n\\n\\t\\t\\tint dis=abs(lights[now_id].first-lights[next_id].first)+abs(lights[now_id].second-lights[next_id].second);\\n\\n\\t\\t\\tif (next_id != N + 1) {\\n\\t\\t\\t\\tint next_li=max(1,dis-now_li+1);\\n\\t\\t\\t\\tint next_cost=now_cost+(next_li-1);\\n\\n\\t\\t\\t\\tif (dp[next_id][next_li] > next_cost) {\\n\\t\\t\\t\\t\\tdp[next_id][next_li]=next_cost;\\n\\t\\t\\t\\t\\tque.push(aa{ next_id,next_li,next_cost });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (dis <= now_li-1) {\\n\\t\\t\\t\\t\\tdp[N+1][0]=min(dp[N+1][0],now_cost);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tdp[N+1][0]=min(dp[N+1][0],now_cost+(dis-(now_li-1)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans=dp[N+1][0];\\n\\tcout<<ans<<endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4252,\n \"score_of_the_acc\": -0.042,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3030_2760103\",\n \"code_snippet\": \"#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\\nstruct state {\\n ll v, r, cost;\\n bool operator>(const state s) const { return cost > s.cost; }\\n};\\n\\nint main(void) {\\n ll W, H, N;\\n cin >> W >> H >> N;\\n vector<ll> X(N), Y(N);\\n REP(i, 0, N) cin >> X[i] >> Y[i];\\n\\n const ll INF = 1LL << 60;\\n vector<vector<ll> > dp(N, vector<ll>(1000, INF));\\n priority_queue<state, vector<state>, greater<state> > q;\\n REP(i, 0, N) {\\n ll dist = (X[i] - 1) + (Y[i] - 1);\\n q.push((state) { i, dist, dist });\\n }\\n ll ans = INF;\\n while(!q.empty()) {\\n ll v = q.top().v, r = q.top().r, cost = q.top().cost;\\n // cout << v << \\\" \\\" << r << \\\" \\\" << cost << endl;\\n q.pop();\\n if(dp[v][r] <= cost) continue;\\n dp[v][r] = cost;\\n ans = min(ans, cost + max((W - X[v]) + (H - Y[v]) - r, 0LL));\\n REP(nv, 0, N) if(nv != v) {\\n ll dist = abs(X[nv] - X[v]) + abs(Y[nv] - Y[v]);\\n ll nr = max(dist - r - 1, 0LL), ncost = cost + max(dist - r - 1, 0LL);\\n if(dp[nv][nr] > ncost) q.push((state) { nv, nr, ncost });\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 52932,\n \"score_of_the_acc\": -0.9183,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3030_2756289\",\n \"code_snippet\": \"#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 sar(a,n) cout<<#a<<\\\":\\\";rep(pachico,n)cout<<\\\" \\\"<<a[pachico];cout<<endl\\n#define svec(v) cout<<#v<<\\\":\\\";rep(pachico,v.size())cout<<\\\" \\\"<<v[pachico];cout<<endl\\n#define svecp(v) cout<<#v<<\\\":\\\";each(pachico,v)cout<<\\\" {\\\"<<pachico.first<<\\\":\\\"<<pachico.second<<\\\"}\\\";cout<<endl\\n#define sset(s) cout<<#s<<\\\":\\\";each(pachico,s)cout<<\\\" \\\"<<pachico;cout<<endl\\n#define smap(m) cout<<#m<<\\\":\\\";each(pachico,m)cout<<\\\" {\\\"<<pachico.first<<\\\":\\\"<<pachico.second<<\\\"}\\\";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 h,w,n;\\nvi x,y;\\n\\nint dist(int a,int b,int c,int d)\\n{\\n return abs(a-c)+abs(b-d);\\n}\\n\\ntemplate<typename T> class Dijkstra {\\npublic:\\n\\tvector<T> d;\\n\\tint V;\\n\\tusing pti = pair<T,int>;\\n\\tDijkstra(int node_size){\\n\\t\\tV = node_size;\\n\\t d.resize(V,numeric_limits<T>::max());\\n\\t}\\n\\tvoid solve(){\\n\\t\\tpriority_queue<pti,vector<pti>,greater<pti> > que;\\n\\t\\trep(i,n){\\n int dir = dist(x[i],y[i],0,0);\\n d[i*1001+dir] = dir;\\n // cout << i << \\\" \\\" << dir << \\\" \\\" << dir << \\\"\\\\n\\\";\\n que.push(pti(dir,i*1001+dir));\\n }\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tpti p = que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tif(d[p.second] < p.first) continue;\\n int v = p.second / 1001,cs = p.second % 1001;\\n\\t\\t\\trep(i,n){\\n int val = max(dist(x[v],y[v],x[i],y[i])-(cs+1),0);\\n if(i != v && d[i*1001+val] > val+p.first){\\n d[i*1001+val] = val+p.first;\\n que.push(pti(d[i*1001+val],i*1001+val));\\n }\\n }\\n\\t\\t}\\n\\t}\\n};\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> w >> h >> n;\\n x.resize(n),y.resize(n);\\n rep(i,n){\\n cin >> x[i] >> y[i];\\n --x[i],--y[i];\\n }\\n Dijkstra<int> dj(n*1001);\\n dj.solve();\\n int ans = INT_MAX;\\n rep(i,n){\\n rep(j,1001){\\n if(dj.d[i*1001+j] != INT_MAX){\\n cmn(ans,dj.d[i*1001+j]+max(dist(x[i],y[i],w-1,h-1)-j,0));\\n }\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.0403,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3030_2755894\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef pair<int,int>P;\\ntypedef pair<int,P>P2;\\n\\nint dp[111][1111],H,W,N,ans=1e9;\\nint x[111],y[111],man[111][111];\\n\\nint main(){\\n\\n for(int i=0;i<111;i++)\\n for(int j=0;j<1111;j++)dp[i][j]=1e8;\\n\\n x[0]=y[0]=1;\\n\\n cin>>W>>H>>N;N++;\\n for(int i=1;i<N;i++)cin>>x[i]>>y[i];\\n x[N]=W;\\n y[N]=H; N++;\\n\\n for(int i=0;i<N;i++){\\n for(int j=i;j<N;j++){\\n man[i][j]=man[j][i]=(abs(x[i]-x[j])+abs(y[i]-y[j]));\\n }\\n }\\n \\n priority_queue<P2,vector<P2>,greater<P2> >q;\\n q.push(P2(0,P(0,0)));\\n dp[0][0]=0;\\n\\n while(!q.empty()){\\n P2 p=q.top();q.pop();\\n int cost = p.first;\\n int now = p.second.first;\\n int ran = p.second.second;\\n if(now==N-1){\\n cout<<cost<<endl;\\n return 0;\\n }\\n if(dp[now][ran]<cost)continue;\\n for(int i=0;i<N;i++)if(now!=i){\\n int next;\\n if(now==0)next=max(0,man[i][now]-ran);\\n else if(i==N-1)next=max(0,man[i][now]-ran);\\n else next=max(0,man[i][now]-ran-1);\\n int cost2 = cost+next; \\n if(cost2>=dp[i][next])continue;\\n dp[i][next]=cost2;\\n q.push(P2(cost2,P(i,next)));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4336,\n \"score_of_the_acc\": -0.0161,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3030_2755493\",\n \"code_snippet\": \"#define __USE_MINGW_ANSI_STDIO 0\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll LLINF = (1LL<<60);\\nconst int INF = (1LL<<30);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nint x[105], y[105];\\nint d[105][1010];\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int w, h, n;\\n cin >> w >> h >> n;\\n REP(i, n) {\\n cin >> x[i] >> y[i];\\n x[i]--, y[i]--;\\n }\\n\\n REP(i, 105) REP(j, 1010) d[i][j] = LLINF;\\n priority_queue<VI, VVI, greater<VI>> que;\\n // スタート地点から街灯iに向かう\\n REP(i, n) {\\n int cost = x[i]+y[i];\\n d[i][cost] = cost;\\n que.push({cost, i, cost});\\n }\\n\\n while(que.size()) {\\n VI v = que.top(); que.pop();\\n int dist = v[0], idx = v[1], cost = v[2];\\n if(dist > d[idx][cost]) continue;\\n REP(i, n) {\\n if(idx == i) continue;\\n int n_cost = max(0LL, abs(x[idx]-x[i]) + abs(y[idx]-y[i]) - cost - 1);\\n if(d[i][n_cost] > d[idx][cost] + n_cost) {\\n d[i][n_cost] = d[idx][cost] + n_cost;\\n que.push({d[i][n_cost], i, n_cost});\\n }\\n }\\n }\\n\\n int ans = LLINF;\\n REP(i, n) REP(j, 1010) {\\n chmin(ans, d[i][j] + max(0LL, abs(w-1-x[i]) + abs(h-1-y[i]) - j));\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6724,\n \"score_of_the_acc\": -0.0669,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3030_2755488\",\n \"code_snippet\": \"#define __USE_MINGW_ANSI_STDIO 0\\n#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll LLINF = (1LL<<60);\\nconst int INF = (1LL<<30);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nint x[105], y[105];\\nint d[105][1010];\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int w, h, n;\\n cin >> w >> h >> n;\\n bool st_flag = false, en_flag = false;\\n REP(i, n) {\\n cin >> x[i] >> y[i];\\n x[i]--, y[i]--;\\n if(x[i] == 0 && y[i] == 0) st_flag = true;\\n if(x[i] == w-1 && y[i] == h-1) en_flag = true;\\n }\\n\\n REP(i, 105) REP(j, 1010) d[i][j] = LLINF;\\n priority_queue<VI, VVI, greater<VI>> que;\\n REP(i, n) {\\n // スタート地点から街灯iに向かうとき\\n int cost = x[i]+y[i];\\n d[i][cost] = cost;\\n que.push({cost, i, cost});\\n }\\n\\n while(que.size()) {\\n VI v = que.top(); que.pop();\\n // cout << v << endl;\\n int dist = v[0], idx = v[1], cost = v[2];\\n if(dist > d[idx][cost]) continue;\\n REP(i, n) {\\n if(idx == i) continue;\\n int n_cost = max(0LL, abs(x[idx]-x[i]) + abs(y[idx]-y[i]) - cost - 1);\\n if(d[i][n_cost] > d[idx][cost] + n_cost) {\\n d[i][n_cost] = d[idx][cost] + n_cost;\\n que.push({d[i][n_cost], i, n_cost});\\n }\\n }\\n }\\n\\n int ans = LLINF;\\n REP(i, n) REP(j, 1010) {\\n // cout << \\\"i:\\\" << i << \\\" j:\\\" << j << \\\" \\\" << d[i][j] << endl;\\n chmin(ans, d[i][j] + max(0LL, abs(w-1-x[i]) + abs(h-1-y[i]) - (en_flag?1:0) - j));\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6888,\n \"score_of_the_acc\": -0.0677,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3030_2754775\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n #include<iostream>\\n #include<cstdio>\\n #include<vector>\\n #include<queue>\\n #include<map>\\n #include<cstring>\\n #include<string>\\n #include <math.h>\\n #include<algorithm>\\n // #include <boost/multiprecision/cpp_int.hpp>\\n #include<functional>\\n #define int long long\\n #define inf 1000000007\\n #define pa pair<int,int>\\n #define ll long long\\n #define pal pair<double,double>\\n #define ppap pair<pa,int>\\n \\n #define ssa pair<string,int>\\n #define mp make_pair\\n #define pb push_back\\n #define EPS (1e-8)\\n #define equals(a,b) (fabs((a)-(b))<EPS)\\nint dx[4]={0,-1,0,1};\\nint dy[4]={1,0,-1,0};\\n using namespace std;\\n \\t\\t\\tclass pa3{\\n \\tpublic:\\n \\tint x,y,z;\\n \\tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\\n \\tbool operator < (const pa3 &p) const{\\n \\t\\tif(x!=p.x) return x<p.x;\\n \\t\\tif(y!=p.y) return y<p.y;\\n \\t\\t return z<p.z;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\t\\t\\t\\tbool operator > (const pa3 &p) const{\\n \\t\\tif(x!=p.x) return x>p.x;\\n \\t\\tif(y!=p.y) return y>p.y;\\n \\t\\t return z>p.z;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const pa3 &p) const{\\n \\t\\treturn x==p.x && y==p.y && z==p.z;\\n \\t}\\n \\t\\tbool operator != (const pa3 &p) const{\\n \\t\\t\\treturn !( x==p.x && y==p.y && z==p.z);\\n \\t}\\n \\n };\\n \\n class pa4{\\n \\tpublic:\\n \\tdouble x;\\n \\tint y,z,w;\\n \\tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\\n \\tbool operator < (const pa4 &p) const{\\n \\t\\tif(x!=p.x) return x<p.x;\\n \\t\\tif(y!=p.y) return y<p.y;\\n \\t\\tif(z!=p.z)return z<p.z;\\n \\t\\treturn w<p.w;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator > (const pa4 &p) const{\\n \\t\\tif(x!=p.x) return x>p.x;\\n \\t\\tif(y!=p.y) return y>p.y;\\n \\t\\tif(z!=p.z)return z>p.z;\\n \\t\\treturn w>p.w;\\n \\t\\t//return x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const pa4 &p) const{\\n \\t\\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\\n \\t}\\n \\t\\t\\n \\n };\\n class pa2{\\n \\tpublic:\\n \\tint x,y;\\n \\tpa2(int x=0,int y=0):x(x),y(y) {}\\n \\tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\\n \\tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\\n \\tpa2 operator * (int a) {return pa2(x*a,y*a);}\\n \\tbool operator < (const pa2 &p) const{\\n \\t\\treturn x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator > (const pa2 &p) const{\\n \\t\\treturn x != p.x ? x>p.x: y>p.y;\\n \\t}\\n \\tbool operator == (const pa2 &p) const{\\n \\t\\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\\n \\t}\\n \\tbool operator != (const pa2 &p) const{\\n \\t\\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\\n \\t}\\n \\t\\t\\n \\n };\\n \\n #define ppa pair<int,pas>\\n class Point{\\n \\tpublic:\\n \\tdouble x,y;\\n \\tPoint(double x=0,double y=0):x(x),y(y) {}\\n \\tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\\n \\tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\\n \\tPoint operator * (double a) {return Point(x*a,y*a);}\\n \\tPoint operator / (double a) {return Point(x/a,y/a);}\\n \\tdouble absv() {return sqrt(norm());}\\n \\tdouble norm() {return x*x+y*y;}\\n \\tbool operator < (const Point &p) const{\\n \\t\\treturn x != p.x ? x<p.x: y<p.y;\\n \\t}\\n \\tbool operator == (const Point &p) const{\\n \\t\\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\\n \\t}\\n };\\n typedef Point Vector;\\n #define pl pair<int,pas>\\n struct Segment{\\n Point p1,p2;\\n };\\n double dot(Vector a,Vector b){\\n \\treturn a.x*b.x+a.y*b.y;\\n }\\n double cross(Vector a,Vector b){\\n \\treturn a.x*b.y-a.y*b.x;\\n }\\n \\n bool parareru(Point a,Point b,Point c,Point d){\\n //\\tif(abs(cross(a-b,d-c))<EPS)cout<<\\\"dd \\\"<<cross(a-b,d-c)<<endl;\\n \\treturn abs(cross(a-b,d-c))<EPS;\\n }\\n double distance_ls_p(Point a, Point b, Point c) {\\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\\n return abs(cross(b-a, c-a)) / (b-a).absv();\\n }\\n bool is_intersected_ls(Segment a,Segment b) {\\n \\tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\\n \\tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){\\n //\\t\\tcout<<\\\"sss\\\"<<endl;\\n \\t\\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\\n \\t\\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\\n \\t\\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\\n \\t\\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\\n \\t\\treturn false;\\n \\t}\\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\\n }\\n \\n double segment_dis(Segment a,Segment b){\\n \\tif(is_intersected_ls(a,b))return 0;\\n \\tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\\n \\tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\\n \\tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\\n \\tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\\n \\treturn r;\\n }\\n Point intersection_ls(Segment a, Segment b) {\\n Point ba = b.p2-b.p1;\\n double d1 = abs(cross(ba, a.p1-b.p1));\\n double d2 = abs(cross(ba, a.p2-b.p1));\\n double t = d1 / (d1 + d2);\\n \\n return a.p1 + (a.p2-a.p1) * t;\\n }\\n \\n string itos( int i ) {\\n ostringstream s ;\\n s << i ;\\n return s.str() ;\\n }\\n \\n int gcd(int v,int b){\\n \\tif(v>b) return gcd(b,v);\\n \\tif(v==b) return b;\\n \\tif(b%v==0) return v;\\n \\treturn gcd(v,b%v);\\n }\\n \\n double distans(double x1,double y1,double x2,double y2){\\n \\tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\\n \\treturn sqrt(rr);\\n \\t\\n }\\n /* \\n int pr[1000010];\\n int inv[1000010];\\n \\n int beki(int wa,int rr,int warukazu){\\n \\tif(rr==0) return 1%warukazu;\\n \\tif(rr==1) return wa%warukazu;\\n \\tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\\n \\tint zx=beki(wa,rr/2,warukazu);\\n \\treturn (zx*zx)%warukazu;\\n }\\ndouble bekid(double w,int r){\\n\\tif(r==0) return 1.0;\\n\\tif(r==1) return w;\\n\\tif(r%2) return bekid(w,r-1)*w;\\n\\tdouble f=bekid(w,r/2);\\n\\treturn f*f;\\n}\\n\\n \\n\\t\\t\\tint comb(int nn,int rr){\\n\\t\\t\\t\\tint r=pr[nn]*inv[rr];\\n\\t\\t\\t\\tr%=inf;\\n\\t\\t\\t\\tr*=inv[nn-rr];\\n\\t\\t\\t\\tr%=inf;\\n\\t\\t\\t\\treturn r;\\n\\t\\t\\t}\\n \\n \\n void gya(int ert){\\n \\tpr[0]=1;\\n \\tfor(int i=1;i<=ert;i++){\\n \\t\\tpr[i]=(pr[i-1]*i)%inf;\\n \\t}\\n \\tfor(int i=0;i<=ert;i++) inv[i]=beki(pr[i],inf-2,inf);\\n \\t\\n }\\n */ \\n\\t\\t\\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \\n //sort(ve.begin(),ve.end(),greater<int>());\\n //----------------kokomade tenpure------------\\n //vector<double> ans(100000000),ans2(100000000)\\n/*\\nstruct Segmin{\\n\\t// 1\\n\\t// 2 3\\n\\t// 4 5 6 7\\n\\t\\n\\t\\n\\tprivate:\\n\\tpublic:\\n\\t\\n\\t// (1<<15)=32768\\n\\t// 1<<16 = 65536\\n\\t// 1<<17 = 131072\\n\\t// 1<<18 = 262144\\n\\t\\n\\tint cor=(1<<17);\\n\\t\\n\\tvector<pa> vec;\\n\\t\\n\\tvoid shoki1(){\\n\\t\\t\\n\\t\\tvec.resize(2*cor+3, mp(0,0));\\n\\t\\tfor(int i=cor;i<2*cor;i++)vec[i].second=1;\\n\\t}\\n\\t\\tvoid shoki2(){\\n\\t\\t\\tfor(int i=cor-1;i>0;i--) {\\n\\t\\t\\t\\tif(vec[2*i].first<vec[2*i+1].first) vec[i]=vec[2*i];\\n\\t\\t\\t\\telse if(vec[2*i].first>vec[2*i+1].first)vec[i]=vec[2*i+1];\\n\\t\\t\\t\\telse vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\tvoid updadd(int x,int w){\\n\\t\\t//x ���ڂ� w���Z\\n\\t\\tx+=cor;\\n\\t\\tvec[x].first+=w;\\n\\t\\twhile(1){\\n\\t\\t\\tx/=2;\\n\\t\\t\\tif(x==0) break;\\n\\t\\t\\tif(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];\\n\\t\\t\\telse if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];\\n\\t\\t\\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t\\n\\tvoid updchan(int x,int w){\\n\\t\\t//x���ڂ�w�ɕύX\\n\\t\\tx+=cor;\\n\\t\\tvec[x].first=w;\\n\\t\\twhile(1){\\n\\t\\t\\tx/=2;\\n\\t\\t\\tif(x==0) break;\\n\\t\\t\\tif(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x];\\n\\t\\t\\telse if(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x+1];\\n\\t\\t\\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t// [a,b)\\n\\t// k-th node\\n\\t// k no kukanha [l,r)\\n\\tpa segmin(int a,int b,int k=1,int l=0,int r=-10){\\n\\t\\tif(r<0)r=cor;\\n\\t\\t\\n\\t//\\tcout<<a<<\\\" \\\"<<b<<\\\" \\\"<<k<<\\\" \\\"<<l<<\\\" \\\"<<r<<endl;\\n\\t\\t\\n\\t\\tif(a<=l && r<=b){\\n\\t\\t\\treturn vec[k];\\n\\t\\t}\\n\\t\\tif(r<=a || b<=l){\\n\\t\\t\\treturn mp((1ll<<31)-1,-1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tpa v1=segmin(a,b,k*2,l,(l+r)/2),v2=segmin(a,b,k*2+1,(l+r)/2,r);\\n\\t\\t\\n\\t\\tif(v1.first<v2.first)return v1;\\n\\t\\telse if(v1.first>v2.first) return v2;\\n\\t\\telse return mp(v1.first,v1.second+v2.second);\\n\\t}\\n\\t\\n};\\n\\n\\n\\nstruct Segmax{\\n\\t// 1\\n\\t// 2 3\\n\\t// 4 5 6 7\\n\\t\\n\\t\\n\\tprivate:\\n\\tpublic:\\n\\t\\n\\t// (1<<15)=32768\\n\\t// 1<<16 = 65536\\n\\t// 1<<17 = 131072\\n\\t// 1<<18 = 262144\\n\\t\\n\\tint cor=(1<<17);\\n\\t\\n\\tvector<pa> vec;\\n\\t\\n\\tvoid shoki1(){\\n\\t\\t\\n\\t\\tvec.resize(2*cor+3, mp(0,0));\\n\\t\\tfor(int i=cor;i<2*cor;i++)vec[i].second=1;\\n\\t}\\n\\t\\tvoid shoki2(){\\n\\t\\t\\tfor(int i=cor-1;i>0;i--) {\\n\\t\\t\\t\\tif(vec[2*i].first>vec[2*i+1].first) vec[i]=vec[2*i];\\n\\t\\t\\t\\telse if(vec[2*i].first<vec[2*i+1].first)vec[i]=vec[2*i+1];\\n\\t\\t\\t\\telse vec[i]=mp(vec[2*i].first,vec[2*i].second+vec[2*i+1].second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\tvoid updadd(int x,int w){\\n\\t\\t//x ���ڂ� w���Z\\n\\t\\tx+=cor;\\n\\t\\tvec[x].first+=w;\\n\\t\\twhile(1){\\n\\t\\t\\tx/=2;\\n\\t\\t\\tif(x==0) break;\\n\\t\\t\\tif(vec[2*x].first>=vec[2*x+1].first) vec[x]=vec[2*x];\\n\\t\\t\\telse vec[x]=vec[2*x+1];\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t\\n\\tvoid updchan(int x,int w){\\n\\t\\t//x���ڂ�w�ɕύX\\n\\t\\tx+=cor;\\n\\t\\tvec[x].first=w;\\n\\t\\twhile(1){\\n\\t\\t\\tx/=2;\\n\\t\\t\\tif(x==0) break;\\n\\t\\t\\tif(vec[2*x].first>vec[2*x+1].first) vec[x]=vec[2*x];\\n\\t\\t\\telse if(vec[2*x].first<vec[2*x+1].first) vec[x]=vec[2*x+1];\\n\\t\\t\\telse vec[x]=mp(vec[2*x].first,vec[2*x].second+vec[2*x+1].second);\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t// [a,b)\\n\\t// k-th node\\n\\t// k no kukanha [l,r)\\n\\tpa segmax(int a,int b,int k=1,int l=0,int r=-10){\\n\\t\\tif(r<0)r=cor;\\n\\t\\t\\n\\t//\\tcout<<a<<\\\" \\\"<<b<<\\\" \\\"<<k<<\\\" \\\"<<l<<\\\" \\\"<<r<<endl;\\n\\t\\t\\n\\t\\tif(a<=l && r<=b){\\n\\t\\t\\treturn vec[k];\\n\\t\\t}\\n\\t\\tif(r<=a || b<=l){\\n\\t\\t\\treturn mp(-(1ll<<31),-1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tpa v1=segmax(a,b,k*2,l,(l+r)/2),v2=segmax(a,b,k*2+1,(l+r)/2,r);\\n\\t\\t\\n\\t\\tif(v1.first>v2.first)return v1;\\n\\t\\telse if(v1.first<v2.first) return v2;\\n\\t\\telse return mp(v1.first,v1.second+v2.second);\\n\\t}\\n\\t\\n};\\n*/\\nint w,h,n;\\npriority_queue<pa3,vector<pa3>,greater<pa3>> pq; \\nbool sumi[200][2000]={0};\\nvector<pa3> G[110][1010];\\nint x[110],y[110];\\nsigned main(){\\ncin>>w>>h>>n;\\n\\tfor(int i=1;i<=n;i++)cin>>x[i]>>y[i];\\n\\t\\n\\tfor(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){\\n\\t\\tint d=abs(x[i]-x[j])+abs(y[i]-y[j]);\\n\\t\\t\\n\\t\\tfor(int k=0;k<d;k++){\\n\\t\\t\\t\\tG[i][k].pb((pa3){j,d-k-1,d-k-1});\\n\\t\\t\\t\\tG[j][k].pb((pa3){i,d-k-1,d-k-1});\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tfor(int j=0;j<=1001;j++){\\n\\t\\t\\tG[i][j].pb((pa3){i,j+1,1});\\n\\t\\t\\tG[i][j+1].pb((pa3){i,j,0});\\n\\t\\t}\\n\\t\\tint d=x[i]-1+y[i]-1;\\n\\t//\\tcout<<i<<\\\" \\\"<<d<<endl;\\n\\t\\t\\t\\tG[0][0].pb((pa3){i,max(0ll,d),max(0ll,d)});\\n\\t\\td=w-x[i]+h-y[i];\\n\\t//\\tcout<<i<<\\\" \\\"<<d<<endl;\\n\\t\\t\\tG[i][max(0ll,d)].pb((pa3){0,1,0});\\n\\t\\t\\n\\t}\\n\\t\\n\\t\\tpq.push((pa3){0,0,0});\\n\\t\\n\\twhile(pq.size()){\\n\\t\\tpa3 z=pq.top();\\n\\t\\tpq.pop();\\n\\t\\tif(sumi[z.y][z.z])continue;\\n\\t\\tsumi[z.y][z.z]=1;\\n\\t//\\tcout<<z.x<<\\\" \\\"<<z.y<<\\\" \\\"<<z.z<<endl;\\n\\t\\tif(z.y==0 && z.z==1){\\n\\t\\tcout<<z.x<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tfor(auto v:G[z.y][z.z]){\\n\\t\\t\\t\\tpq.push((pa3){z.x+v.z,v.x,v.y});\\n\\t\\t}\\n\\t\\n\\t\\n\\t}\\n\\t\\n\\t\\n\\treturn 0;\\n\\t\\n }\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 183424,\n \"score_of_the_acc\": -1.8549,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3030_2752459\",\n \"code_snippet\": \"#include<algorithm>\\n#include<iostream>\\n#include<queue>\\n#include<vector>\\nusing namespace std;\\ntypedef long long lint;\\ntypedef vector<int>vi;\\ntypedef pair<int,int>pii;\\ntypedef pair<lint,pii>plpii;\\n#define rep(i,n)for(int i=0;i<(int)(n);++i)\\n\\nconst int N=1010;\\nconst lint inf=1e16;\\n\\nint main(){\\n int w,h,n;\\n cin>>w>>h>>n;\\n int mi=1e8;\\n vector<pii> pts(n+2);\\n pts[0]=pii(1,1);\\n pts[1]=pii(w,h);\\n rep(i,n){\\n int x,y;\\n cin>>x>>y;\\n pts[i+2]=pii(x,y);\\n }\\n priority_queue<plpii,vector<plpii>,greater<plpii> > que;\\n vector<vector<lint> > dis(n+2,vector<lint>(N,inf));\\n rep(i,n){\\n int d=abs(pts[i+2].first-1)+abs(pts[i+2].second-1);\\n que.push(plpii(d,pii(i+2,d)));\\n }\\n while(!que.empty()){\\n plpii top=que.top();que.pop();\\n lint d=top.first;\\n pii xy=top.second;\\n int x=xy.first,y=xy.second;\\n if(dis[x][y]<=d)continue;\\n dis[x][y]=d;\\n rep(i,n+2){\\n if(i==x||i==0)continue;\\n int c=abs(pts[i].first-pts[x].first)+abs(pts[i].second-pts[x].second);\\n c=max(0,i==1?c-y:(c-y-1));\\n if(c>=N)continue;\\n int nx=i;\\n int ny=i==1?0:c;\\n if(dis[nx][ny]<=d+c)continue;\\n dis[nx][ny]=d+c+1;\\n que.push(plpii(d+c,pii(nx,ny)));\\n }\\n }\\n cout<<dis[1][0]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5792,\n \"score_of_the_acc\": -0.0756,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3030_2752004\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n\\n/*\\n<url:https://onlinejudge.u-aizu.ac.jp/services/room.html#RitsCamp18Day2/problems/E>\\n問題文============================================================\\n\\n W×H の二次元のマス上にN個の街灯がある。\\n がっちょ君は(1,1)からスタートして(W,H)に行きたい。\\n がっちょ君は暗いところが怖いので、街灯により明るくなっているマスしか歩きたくない。\\n 最初、すべての街灯はその街灯のあるマスのみを明るくしている。\\n そこで、がっちょ君は好きな街灯iに対してコストriを設定することにした。なお、コストを設定しない街灯があってもよい。\\n 街灯iはコストriを消費することにより、その街灯を中心にマンハッタン距離でri以内の範囲を明るくすることができる。ただしコストは正の整数とする。\\n がっちょ君は上下左右のいずれかの方向に隣接するマスに移動する事ができる。\\n がっちょ君はriの合計値を最小になるように設定することにした。そのときの合計値を求めよ。\\n 2つの地点 (a,b) と (c,d) 間のマンハッタン距離は |a−c|+|b−d| で表される。\\n \\n\\n \\n=================================================================\\n\\n解説=============================================================\\n\\n dist[i][j] := i頂点で明るさがjである地点への最小コストで\\n \\n 拡張dijkstra\\n \\n================================================================\\n*/\\n\\nll dist[105][505*505];\\nint main(void) {\\n\\tcin.tie(0); ios::sync_with_stdio(false);\\n ll W,H,N; cin >> W >> H >> N;\\n vector<ll> x(N+1),y(N+1);\\n x[0] = y[0] = 1;\\n for(int i = 1; i <= N;i++) cin >> x[i] >> y[i];\\n vector<vector<ll>> G(N+1);\\n \\n for(int i = 1; i <= N; i++){\\n for(int j = 1; j <= N;j++){\\n if(i == j) continue;\\n //if(x[i] <= x[j]){// && y[i] <= y[j]){\\n G[i].push_back(j);\\n //}\\n }\\n }\\n\\n for(int i = 0; i < 105;i++)for(int j = 0; j < 505*505; j++) dist[i][j] = LINF;\\n \\n typedef pair<ll,pll> plpll;\\n // dist[0][0] = 0;\\n priority_queue<plpll,vector<plpll>,greater<plpll>> pq;\\n for(int i = 1; i <= N;i++){\\n ll cost = abs(x[i]-x[0])+abs(y[i]-y[0]);\\n pq.push({cost,{i,cost}});\\n dist[i][cost] = cost;\\n }\\n// pq.push({0,{0,0}});\\n while(pq.size()){\\n auto p = pq.top(); pq.pop();\\n ll d = p.first, n = p.second.first, r = p.second.second;\\n if(dist[n][r] < d) continue;\\n for(ll next : G[n]){\\n ll mdis = abs(x[n]-x[next]) + abs(y[n]-y[next]);\\n if(r >= mdis-1){\\n if(dist[next][0] > dist[n][r]){\\n dist[next][0] = dist[n][r];\\n pq.push({dist[next][0],{next,0}});\\n }\\n }else{\\n ll cost = mdis-r-1;\\n if(dist[next][cost] > dist[n][r] + cost){\\n dist[next][cost] = dist[n][r] + cost;\\n pq.push({dist[next][cost],{next,cost}});\\n }\\n }\\n }\\n }\\n ll ans = LINF;\\n for(int i = 1; i <= N;i++){\\n for(int j = 0; j < 505*505;j++){\\n if(dist[i][j]==LINF)continue;\\n ll mdis = abs(W-x[i])+abs(H-y[i]);\\n ans = min(ans,dist[i][j]+max(mdis-j,0LL));\\n }\\n }\\n cout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 213924,\n \"score_of_the_acc\": -1.1316,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3030_2751963\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int64 INF = 1LL << 60;\\n\\n#define int long long\\nint W, H, N, X[100], Y[100];\\nint64 v[100][1005];\\n\\nsigned main() {\\n srand((unsigned) time(NULL));\\n cin >> W >> H >> N;\\n\\n for(int i = 0; i < N; i++) {\\n cin >> X[i] >> Y[i];\\n }\\n fill_n(*v, 100 * 1005, INF);\\n\\n if(rand() % 2) {\\n fill_n(*v, 100 * 1001, INF);\\n using Tuplis = tuple< int64, int, int >;\\n\\n priority_queue< Tuplis, vector< Tuplis >, greater< Tuplis > > que;\\n\\n\\n for(int i = 0; i < N; i++) {\\n v[i][abs(X[i] - 1) + abs(Y[i] - 1)] = abs(X[i] - 1) + abs(Y[i] - 1);\\n que.emplace(abs(X[i] - 1) + abs(Y[i] - 1), abs(X[i] - 1) + abs(Y[i] - 1), i);\\n }\\n while(que.size()) {\\n int64 cost;\\n int l, j;\\n tie(cost, l, j) = que.top();\\n que.pop();\\n if(v[j][l] < cost) continue;\\n for(int k = 0; k < N; k++) {\\n if(j == k) continue;\\n int64 distance = abs(X[k] - X[j]) + abs(Y[k] - Y[j]);\\n if(distance >= l) { // 距離のほうが遠い\\n int64 add_cost = cost + (distance - l); // 追加で掛かるア\\n if(add_cost < v[k][distance]) {\\n v[k][distance] = add_cost;\\n que.emplace(add_cost, distance, k);\\n }\\n } else { // 距離のほうが近い\\n int64 add_cost = cost;\\n if(add_cost < v[k][0]) {\\n v[k][0] = add_cost;\\n que.emplace(add_cost, 0, k);\\n }\\n }\\n }\\n\\n\\n if(l > 0) {\\n if(v[j][l] < v[j][l - 1]) {\\n v[j][l - 1] = v[j][l];\\n que.emplace(v[j][l - 1], l - 1, j);\\n }\\n }\\n if(l < 1000) {\\n if(v[j][l] + 1 < v[j][l + 1]) {\\n v[j][l + 1] = v[j][l] + 1;\\n que.emplace(v[j][l + 1], l + 1, j);\\n }\\n }\\n }\\n int64 ret = INF;\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j <= 1000; j++) {\\n int64 cost = abs(X[i] - W) + abs(Y[i] - H);\\n ret = min(ret, v[i][j] + max(0LL, cost - j));\\n }\\n }\\n cout << ret << endl;\\n\\n } else {\\n using Tuplis = tuple< int64, int, int >;\\n\\n priority_queue< Tuplis, vector< Tuplis >, greater< Tuplis > > que;\\n\\n\\n for(int i = 0; i < N; i++) {\\n v[i][abs(X[i] - 1) + abs(Y[i] - 1)] = abs(X[i] - 1) + abs(Y[i] - 1) - 1;\\n que.emplace(abs(X[i] - 1) + abs(Y[i] - 1) - 1, abs(X[i] - 1) + abs(Y[i] - 1), i);\\n }\\n while(que.size()) {\\n int64 cost;\\n int l, idx;\\n tie(cost, l, idx) = que.top();\\n que.pop();\\n\\n for(int k = 0; k < N; k++) {\\n if(idx == k) continue;\\n int64 distance = abs(X[k] - X[idx]) + abs(Y[k] - Y[idx]);\\n\\n int64 add_cost = cost + max(0LL, distance - l); // 追加で掛かるア\\n if(add_cost < v[k][max(0LL, distance - l)]) {\\n v[k][max(0LL, distance - l)] = add_cost;\\n que.emplace(add_cost, max(0LL, distance - l), k);\\n }\\n\\n }\\n\\n if(v[idx][l] + 1 < v[idx][l + 1]) {\\n v[idx][l + 1] = v[idx][l] + 1;\\n que.emplace(v[idx][l + 1], l + 1, idx);\\n\\n }\\n }\\n int64 ret = INF;\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j <= 1003; j++) {\\n int64 cost = abs(X[i] - W) + abs(Y[i] - H);\\n ret = min(ret, v[i][j] + max(0LL, cost - j));\\n }\\n }\\n cout << ret << endl;\\n }\\n}\",\n \"accuracy\": 0.043010752688172046,\n \"time_ms\": 10,\n \"memory_kb\": 3888,\n \"score_of_the_acc\": -0.0008,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1879,"cells":{"group_id":{"kind":"string","value":"aoj_3033_cpp"},"problem_description":{"kind":"string","value":"Problem H: Hth Number\nProblem\n長さ$N$の文字列$S$がある。$S$に含まれる文字はすべて0以上9以下の数字である。\n$S$のすべての部分文字列から作られる数を全列挙してできた項数$\\frac{N\\times(N+1)}{2}$の数列を作った時、\nその数列の中で$H$番目に小さい値を求めよ。\nInput\n入力は以下の形式で与えられる。\n$N$ $H$\n$S$\n入力はすべて整数で与えられる。\n1行目に$N$と$H$が空白区切りで与えられる。\n2行目に長さ$N$の文字列$S$が与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq N \\leq 10^5$\n$1 \\leq H \\leq \\frac{N \\times (N+1)}{2}$\n$|S| = N$\n$S$に含まれる文字はすべて0, 1, 2, 3, 4, 5, 6, 7, 8, 9のいずれかである\nOutput\n$H$番目の値を1行に出力せよ。\n(出力の先頭に余計な0は含んではならない。)\nSample Input 1\n2 3\n00\nSample Output 1\n0\nSample Input 2\n4 9\n0012\nSample Output 2\n12\nSample Input 3\n5 13\n10031\nSample Output 3\n100\nSample Input3の場合、10031の部分文字列から作られる数は以下の通りである。\n1, 0, 0, 3, 1\n10, 00, 03, 31\n100, 003, 031\n1003, 0031\n10031\nこれらをを小さい順に並べると\n0, 0, 0, 1, 1, 3, 3, 3, 10, 31, 31, 31, 100, 1003, 10031 になり、13番目に小さい値は100である。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3033_4218303","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\n#define NUM1 1000000009\n#define NUM2 99999883\n\nstruct Info{\n\tull hash_1,hash_2;\n};\null HASH[SIZE][2],POW[SIZE][2];\n\nll T_length,H,digit;\nll table[SIZE],ruisekiwa[SIZE];\nvector<int> V;\nchar T[SIZE];\n\nbool IS_SAME(Info left,Info right){\n\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nInfo calcHash(int left,int right){\n\n\tInfo ret;\n\n\tint length = right-left+1;\n\n\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\n\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\n\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\n\n\treturn ret;\n}\n\n//AとBの一致長さを返す\nll calc_match_len(int start_A,int start_B,int length){\n\n\tll left = 0,right = length-1,mid = (left+right)/2;\n\tll match_len = 0;\n\tInfo tmp_A,tmp_B;\n\n\twhile(left <= right){\n\n\t\ttmp_A = calcHash(start_A,start_A+mid);\n\t\ttmp_B = calcHash(start_B,start_B+mid);\n\n\t\tif(IS_SAME(tmp_A,tmp_B)){\n\t\t\tmatch_len = mid+1;\n\t\t\tleft = mid+1;\n\t\t}else{\n\t\t\tright = mid-1;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\treturn match_len;\n}\n\nbool compare(int a,int b){\n\n\tll match_len = calc_match_len(a,b,digit);\n\n\treturn T[a+match_len] < T[b+match_len];\n}\n\n\nint main(){\n\n\tscanf(\"%lld %lld\",&T_length,&H);\n\n\tscanf(\"%s\",T);\n\n\tll num_zero = 0;\n\tfor(int i = 0; i < T_length; ){\n\t\tif(T[i] != '0'){\n\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tll count = 0;\n\t\tfor(;i+count < T_length && T[i+count] == '0'; count++);\n\n\t\tnum_zero += (count*(count+1))/2;\n\t\ti += count;\n\t}\n\n\tif(num_zero >= H){\n\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\t//2通りのハッシュ値を計算する\n\tHASH[0][0] = 0;\n\tHASH[0][1] = 0;\n\tPOW[0][0] = 1;\n\tPOW[0][1] = 1;\n\n\t//Tのハッシュ値を求める\n\tfor(int i = 1; i <= T_length; i++){\n\t\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\n\t\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\n\n\t\tPOW[i][0] = POW[i-1][0]*NUM1;\n\t\tPOW[i][1] = POW[i-1][1]*NUM2;\n\t}\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\truisekiwa[i] = 0; //桁iの数がいくつあるか\n\t}\n\n\ttable[T_length] = T_length;\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\tif(T[i] != '0'){\n\n\t\t\ttable[i] = i;\n\t\t}else{\n\n\t\t\ttable[i] = table[i+1];\n\t\t}\n\n\t\truisekiwa[T_length-table[i]]++;\n\t\truisekiwa[0]--;\n\t}\n\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\truisekiwa[i] += ruisekiwa[i+1];\n\t}\n\n\tdigit = 0;\n\tll sum = num_zero;\n\n\tfor(int i = 1; i <= T_length; i++){\n\n\t\tif(sum+ruisekiwa[i] >= H){\n\t\t\tdigit = i;\n\t\t\tbreak;\n\t\t}\n\t\tsum += ruisekiwa[i];\n\t}\n\n\t//printf(\"sum:%lld digit:%lld\\n\",sum,digit);\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\tif(table[i]+digit > T_length)break;\n\n\t\tV.push_back(table[i]);\n\t}\n\n\tsort(V.begin(),V.end(),compare);\n\n\tfor(int i = 0; i < digit; i++){\n\n\t\tprintf(\"%c\",T[V[H-(sum+1)]+i]);\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":8004,"score_of_the_acc":-0.8107,"final_rank":14},{"submission_id":"aoj_3033_4217911","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\n#define NUM1 1000000009\n#define NUM2 99999883\n\nstruct Info{\n\tull hash_1,hash_2;\n};\null HASH[SIZE][2],POW[SIZE][2];\n\nll T_length,H,range,max_range,last_range;\nll Rank[SIZE]; //接尾辞文字列の開始位置iの、辞書順にsortした際の順位表\nll Suffix_Array[SIZE]; //接尾辞文字列の開始位置<インデックス>→毎回、辞書順に開始位置をソートする\nll Work[SIZE]; //作業用配列\nll table[SIZE],ruisekiwa[SIZE];\n\nchar T[SIZE];\n\nbool IS_SAME(Info left,Info right){\n\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nInfo calcHash(int left,int right){\n\n\tInfo ret;\n\n\tint length = right-left+1;\n\n\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\n\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\n\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\n\n\treturn ret;\n}\n\n//AとBの一致長さを返す\nll calc_match_len(int start_A,int start_B,int length){\n\n\tll left = 0,right = length-1,mid = (left+right)/2;\n\tll match_len = 0;\n\tInfo tmp_A,tmp_B;\n\n\twhile(left <= right){\n\n\t\ttmp_A = calcHash(start_A,start_A+mid);\n\t\ttmp_B = calcHash(start_B,start_B+mid);\n\n\t\tif(IS_SAME(tmp_A,tmp_B)){\n\t\t\tmatch_len = mid+1;\n\t\t\tleft = mid+1;\n\t\t}else{\n\t\t\tright = mid-1;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\treturn match_len;\n}\n\n\n//まずrank[a]とrank[b]を比較、等しければrank[a+range],rank[b+range]を比較\nbool compare_Suffix_Array(int a,int b){\n\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\n\telse{\n\t\tint rank_a = a + range <= T_length ? Rank[a + range]:-1; //rangeを足した部分が範囲外なら、最高にするため、rankを-1にする\n\t\tint rank_b = b + range <= T_length ? Rank[b + range]:-1;\n\t\treturn rank_a < rank_b;\n\t}\n}\n\nbool final_compare_Suffix_Array(int a,int b){\n\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\n\telse{\n\n\t\tll len_A = T_length-Suffix_Array[a],len_B =T_length-Suffix_Array[b];\n\n\t\tll match_len = calc_match_len(Suffix_Array[a],Suffix_Array[b],min(len_A,len_B));\n\n\t\treturn T[Suffix_Array[a]+match_len] < T[Suffix_Array[b]+match_len];\n\t}\n}\n\n//文字列Tの接尾辞配列を構築\nvoid make_Suffix_Array(){\n\tfor(int i = 0; i <= T_length; i++){\n\t\tSuffix_Array[i] = table[i];\n\t\tRank[table[i]] = i < T_length? (T[table[i]]-'0'):-1; //初期ランク設定:T[T_length]は空文字なので、最高となるように-1とする\n\t}\n\n\t//range,2*range,4*range,とソート幅を次第に伸ばしていく\n\tfor(range = 1; range <= T_length; range*=2){\n\n\t\tif(2*range > max_range)break;\n\n\t\tsort(Suffix_Array,Suffix_Array+(T_length+1),compare_Suffix_Array); //range文字の幅でsuffix_Arrayをソート\n\n\t\tWork[Suffix_Array[0]] = 0;\n\t\tfor(int i = 1; i <= T_length; i++){\n\t\t\tWork[Suffix_Array[i]] = Work[Suffix_Array[i-1]] + (compare_Suffix_Array(Suffix_Array[i-1],Suffix_Array[i])?1:0);\n\t\t}\n\t\tfor(int i = 0; i <= T_length; i++){\n\t\t\tRank[i] = Work[i];\n\t\t}\n\n\t\tlast_range = range;\n\t}\n\n\tsort(Suffix_Array,Suffix_Array+(T_length+1),final_compare_Suffix_Array);\n}\n\n\nint main(){\n\n\tscanf(\"%lld %lld\",&T_length,&H);\n\n\tscanf(\"%s\",T);\n\n\tll num_zero = 0;\n\tfor(int i = 0; i < T_length; ){\n\t\tif(T[i] != '0'){\n\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tll count = 0;\n\t\tfor(;i+count < T_length && T[i+count] == '0'; count++);\n\n\t\tnum_zero += (count*(count+1))/2;\n\t\ti += count;\n\t}\n\n\tif(num_zero >= H){\n\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\t//2通りのハッシュ値を計算する\n\tHASH[0][0] = 0;\n\tHASH[0][1] = 0;\n\tPOW[0][0] = 1;\n\tPOW[0][1] = 1;\n\n\t//Tのハッシュ値を求める\n\tfor(int i = 1; i <= T_length; i++){\n\t\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\n\t\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\n\n\t\tPOW[i][0] = POW[i-1][0]*NUM1;\n\t\tPOW[i][1] = POW[i-1][1]*NUM2;\n\t}\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\truisekiwa[i] = 0; //桁iの数がいくつあるか\n\t}\n\n\ttable[T_length] = T_length;\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\tif(T[i] != '0'){\n\n\t\t\ttable[i] = i;\n\t\t}else{\n\n\t\t\ttable[i] = table[i+1];\n\t\t}\n\n\t\truisekiwa[T_length-table[i]]++;\n\t\truisekiwa[0]--;\n\t}\n\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\truisekiwa[i] += ruisekiwa[i+1];\n\t}\n\n\tll digit = 0;\n\tll sum = num_zero;\n\n\tfor(int i = 1; i <= T_length; i++){\n\n\t\tif(sum+ruisekiwa[i] >= H){\n\t\t\tdigit = i;\n\t\t\tbreak;\n\t\t}\n\t\tsum += ruisekiwa[i];\n\t}\n\n\tmax_range = digit;\n\tmake_Suffix_Array();\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\tll head = Suffix_Array[i];\n\n\t\tif(T_length-head < digit)continue;\n\n\t\tsum++;\n\t\tif(sum == H){\n\n\t\t\tfor(int k = 0; k < digit; k++){\n\n\t\t\t\tprintf(\"%c\",T[head+k]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":0.6949152542372882,"time_ms":70,"memory_kb":9816,"score_of_the_acc":-0.9379,"final_rank":19},{"submission_id":"aoj_3033_4217906","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\n#define NUM1 1000000007\n#define NUM2 99999883\n\nstruct Info{\n\tull hash_1,hash_2;\n};\null HASH[SIZE][2],POW[SIZE][2];\n\nll T_length,H,range,max_range,last_range;\nll Rank[SIZE]; //接尾辞文字列の開始位置iの、辞書順にsortした際の順位表\nll Suffix_Array[SIZE]; //接尾辞文字列の開始位置<インデックス>→毎回、辞書順に開始位置をソートする\nll Work[SIZE]; //作業用配列\nll table[SIZE],ruisekiwa[SIZE];\n\nchar T[SIZE];\n\nbool IS_SAME(Info left,Info right){\n\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nInfo calcHash(int left,int right){\n\n\tInfo ret;\n\n\tint length = right-left+1;\n\n\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\n\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\n\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\n\n\treturn ret;\n}\n\n//AとBの一致長さを返す\nll calc_match_len(int start_A,int start_B,int length){\n\n\tll left = 0,right = length-1,mid = (left+right)/2;\n\tll match_len = 0;\n\tInfo tmp_A,tmp_B;\n\n\twhile(left <= right){\n\n\t\ttmp_A = calcHash(start_A,start_A+mid);\n\t\ttmp_B = calcHash(start_B,start_B+mid);\n\n\t\tif(IS_SAME(tmp_A,tmp_B)){\n\t\t\tmatch_len = mid+1;\n\t\t\tleft = mid+1;\n\t\t}else{\n\t\t\tright = mid-1;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n\n\treturn match_len;\n}\n\n\n//まずrank[a]とrank[b]を比較、等しければrank[a+range],rank[b+range]を比較\nbool compare_Suffix_Array(int a,int b){\n\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\n\telse{\n\t\tint rank_a = a + range <= T_length ? Rank[a + range]:-1; //rangeを足した部分が範囲外なら、最高にするため、rankを-1にする\n\t\tint rank_b = b + range <= T_length ? Rank[b + range]:-1;\n\t\treturn rank_a < rank_b;\n\t}\n}\n\nbool final_compare_Suffix_Array(int a,int b){\n\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\n\telse{\n\n\t\tll len_A = T_length-Suffix_Array[a],len_B =T_length-Suffix_Array[b];\n\n\t\tll match_len = calc_match_len(Suffix_Array[a],Suffix_Array[b],min(len_A,len_B));\n\n\t\treturn T[Suffix_Array[a]+match_len] < T[Suffix_Array[b]+match_len];\n\t}\n}\n\n//文字列Tの接尾辞配列を構築\nvoid make_Suffix_Array(){\n\tfor(int i = 0; i <= T_length; i++){\n\t\tSuffix_Array[i] = table[i];\n\t\tRank[table[i]] = i < T_length? (T[table[i]]-'0'):-1; //初期ランク設定:T[T_length]は空文字なので、最高となるように-1とする\n\t}\n\n\t//range,2*range,4*range,とソート幅を次第に伸ばしていく\n\tfor(range = 1; range <= T_length; range*=2){\n\n\t\tif(2*range > max_range)break;\n\n\t\tsort(Suffix_Array,Suffix_Array+(T_length+1),compare_Suffix_Array); //range文字の幅でsuffix_Arrayをソート\n\n\t\tWork[Suffix_Array[0]] = 0;\n\t\tfor(int i = 1; i <= T_length; i++){\n\t\t\tWork[Suffix_Array[i]] = Work[Suffix_Array[i-1]] + (compare_Suffix_Array(Suffix_Array[i-1],Suffix_Array[i])?1:0);\n\t\t}\n\t\tfor(int i = 0; i <= T_length; i++){\n\t\t\tRank[i] = Work[i];\n\t\t}\n\n\t\tlast_range = range;\n\t}\n\n\tsort(Suffix_Array,Suffix_Array+(T_length+1),final_compare_Suffix_Array);\n}\n\n\nint main(){\n\n\tscanf(\"%lld %lld\",&T_length,&H);\n\n\tscanf(\"%s\",T);\n\n\tll num_zero = 0;\n\tfor(int i = 0; i < T_length; ){\n\t\tif(T[i] != '0'){\n\n\t\t\ti += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tll count = 0;\n\t\tfor(;i+count < T_length && T[i+count] == '0'; count++);\n\n\t\tnum_zero += (count*(count+1))/2;\n\t\ti += count;\n\t}\n\n\tif(num_zero >= H){\n\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\t//2通りのハッシュ値を計算する\n\tHASH[0][0] = 0;\n\tHASH[0][1] = 0;\n\tPOW[0][0] = 1;\n\tPOW[0][1] = 1;\n\n\t//Tのハッシュ値を求める\n\tfor(int i = 1; i <= T_length; i++){\n\t\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\n\t\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\n\n\t\tPOW[i][0] = POW[i-1][0]*NUM1;\n\t\tPOW[i][1] = POW[i-1][1]*NUM2;\n\t}\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\truisekiwa[i] = 0; //桁iの数がいくつあるか\n\t}\n\n\ttable[T_length] = T_length;\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\tif(T[i] != '0'){\n\n\t\t\ttable[i] = i;\n\t\t}else{\n\n\t\t\ttable[i] = table[i+1];\n\t\t}\n\n\t\truisekiwa[T_length-table[i]]++;\n\t\truisekiwa[0]--;\n\t}\n\n\tfor(int i = T_length-1; i >= 0; i--){\n\n\t\truisekiwa[i] += ruisekiwa[i+1];\n\t}\n\n\tll digit = 0;\n\tll sum = num_zero;\n\n\tfor(int i = 1; i <= T_length; i++){\n\n\t\tif(sum+ruisekiwa[i] >= H){\n\t\t\tdigit = i;\n\t\t\tbreak;\n\t\t}\n\t\tsum += ruisekiwa[i];\n\t}\n\n\tmax_range = digit;\n\tmake_Suffix_Array();\n\n\tfor(int i = 0; i <= T_length; i++){\n\n\t\tll head = Suffix_Array[i];\n\n\t\tif(T_length-head < digit)continue;\n\n\t\tsum++;\n\t\tif(sum == H){\n\n\t\t\tfor(int k = 0; k < digit; k++){\n\n\t\t\t\tprintf(\"%c\",T[head+k]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":0.6949152542372882,"time_ms":70,"memory_kb":9772,"score_of_the_acc":-0.932,"final_rank":18},{"submission_id":"aoj_3033_4102645","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n\nvoid set_rank(std::vector<int>& rank, const std::vector<int>& sorted_indices, const std::vector<long long int>& compare_value) {\n\trank[sorted_indices.front()] = 0;\n\tfor (auto i = 1; i < sorted_indices.size(); ++i) {\n\t\trank[sorted_indices[i]] = rank[sorted_indices[i - 1]] + (compare_value[sorted_indices[i]] == compare_value[sorted_indices[i - 1]] ? 0 : 1);\n\t}\n}\nstd::vector<int> make_suffix_array(const std::string& str) {\n\tstd::vector<int> rank(str.size()), indices(str.size());\n\tstd::vector<long long int> compare_value(str.size());\n\tstd::iota(indices.begin(), indices.end(), 0);\n\tstd::copy(str.begin(), str.end(), compare_value.begin());\n\tconst auto comparator = [&compare_value](int i, int j) {return compare_value[i] < compare_value[j]; };\n\tstd::sort(indices.begin(), indices.end(), comparator);\n\tset_rank(rank, indices, compare_value);\n\tfor (auto i = 0; (1 << i) < str.size(); ++i) {\n\t\tfor (auto j = 0; j < str.size(); ++j) {\n\t\t\tcompare_value[j] = rank[j] * (str.size() + 1LL) + (j + (1 << i) < str.size() ? rank[j + (1 << i)] : -1);\n\t\t}\n\t\tstd::sort(indices.begin(), indices.end(), comparator);\n\t\tset_rank(rank, indices, compare_value);\n\t}\n\treturn indices;\n}\ntemplate<typename Idx, typename F>\nint upper_bound(Idx from, Idx until, const F& predicate) {\n\twhile (from < until) {\n\t\tconst auto mid = (from + until) / 2;\n\t\tif (predicate(mid)) until = mid;\n\t\telse from = mid + 1;\n\t}\n\treturn until;\n}\n\n\nint main() {\n\tint n; long long int h; std::cin >> n >> h;\n\tstd::string str; std::cin >> str;\n\tstd::vector<int> next_positive(n, 0);\n\tfor (auto i = 0; i < str.size(); ++i) if (str[i] == '0') next_positive[i] = 1;\n\tfor (auto i = 2; i <= str.size(); ++i) if (str[str.size() - i] == '0') next_positive[str.size() - i] += next_positive[str.size() - i + 1];\n\tstd::vector<long long int> substrings(n + 1, 0);\n\tlong long int for_zero = 0;\n\tfor (auto i = 0; i < next_positive.size(); ++i) {\n\t\tconst auto head = next_positive[i] + i;\n\t\tif (head != n) substrings[n - head]++;\n\t\tif (i == 0 || str[i - 1] != '0') {\n\t\t\tfor_zero += next_positive[i] * (next_positive[i] + 1LL) >> 1;\n\t\t}\n\t}\n\tfor (int i = substrings.size() - 2; i > 0; --i) substrings[i] += substrings[i + 1];\n\tfor (auto i = 1; i < substrings.size(); ++i) substrings[i] += substrings[i - 1];\n\tconst auto length = std::distance(substrings.begin(), std::lower_bound(substrings.begin(), substrings.end(), h - for_zero));\n\tif (length == 0) {\n\t\tstd::cout << \"0\\n\";\n\t}else {\n\t\tconst auto sa = make_suffix_array(str);\n\t\tconst auto rank = h - substrings[length - 1] - for_zero;\n\t\tstd::vector<int> substr, multipler(n, 0);\n\t\tfor (const auto i : sa) {\n\t\t\tif (str[i] == '0') {\n\t\t\t\tconst auto head = i + next_positive[i];\n\t\t\t\tif (head != n) multipler[head]++;\n\t\t\t}else if (0 <= i && i <= n - length) {\n\t\t\t\twhile (multipler[i]-- >= 0) substr.push_back(i);\n\t\t\t}\n\t\t}\n\t\tstd::cout << str.substr(substr[rank - 1], length) << std::endl;\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":5860,"score_of_the_acc":-0.2268,"final_rank":2},{"submission_id":"aoj_3033_3407704","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\n\n\nll n,k,h,ran[101010],tmp[101010],sa[101010];\n\nbool compare_sa(int i,int j){\n if(ran[i]!=ran[j])return ran[i]<ran[j];\n int ri = (i+k<=n?ran[i+k] : -1);\n int rj = (j+k<=n?ran[j+k] : -1);\n return ri<rj;\n}\n\nvoid constract_sa(string&s){\n rep(i,n+1){\n sa[i]=i;\n ran[i]=(i<n?s[i] : -1);\n }\n for(k=1 ; k<=n ;k*=2 ){\n sort(sa,sa+n+1,compare_sa);\n tmp[sa[0]]=0;\n rep(i,n){\n tmp[sa[i+1]]=tmp[sa[i]]+compare_sa(sa[i],sa[i+1]);\n }\n rep(i,n+1)ran[i]=tmp[i];\n }\n}\nint main(){\n cin>>n>>h;\n string s;\n cin>>s;\n bool all_zero=true;\n rep(i,n)if(s[i]!='0')all_zero=false;\n if(all_zero){\n cout<<0<<endl;\n return 0;\n }\n vector<int> nonzero(n,-1);\n nonzero[0]=-1;\n reverse(s.begin(),s.end());\n rep(i,n){\n if(s[i]!='0')nonzero[i]=i;\n else if(i!=0) nonzero[i]=nonzero[i-1];\n }\n reverse(s.begin(),s.end());\n vector<ll> cnt(n+1);\n rep(i,n){\n cnt[nonzero[i]+1]++;\n }\n rep(i,n-1)cnt[n-i-1]+=cnt[n-i];\n rep(i,n)if(nonzero[i]!=-1)cnt[0]+=i-nonzero[i];\n int keta=0;\n while(h-cnt[keta]>0){\n h-=cnt[keta];\n ++keta;\n }\n if(!keta){\n cout<<0<<endl;\n return 0;\n }\n constract_sa(s);\n rep(i,n+1)sa[ran[i]]=i;\n vector<int> cnt2(n+1);\n rep(i,n)cnt2[n-nonzero[i]-1]++;\n int ans=-1;\n rep(i,n+1){\n if(n-sa[i]<keta)continue;\n if(h<=cnt2[sa[i]]){\n ans=sa[i];\n break;\n }\n h-=cnt2[sa[i]];\n }\n cout<<s.substr(ans,keta)<<endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":6776,"score_of_the_acc":-0.5859,"final_rank":11},{"submission_id":"aoj_3033_3407611","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cstdlib>\n#define int long long\n#define rep(i, n) for(i = 0; i < n; i++)\nusing namespace std;\n\nint n, h;\nstring s;\nint cnts[100001];\t\t//cnts[i] = i桁(no leading 0)の数がいくつあるか. \"0\"や\"00\"は0桁としてカウント.\nint begin_cnts[100001];\n\n//spagetti-source, 動く形に書き直すのが難しかった()\nstruct SAComp {\n const int h, *g;\n SAComp(int h, int* g) : h(h), g(g) {}\n bool operator() (int a, int b) {\n return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a+h] < g[b+h];\n }\n};\nvector<int> construct_sa(string s) {\n int n = s.length();\n int *g = new int[n+1];\n int *b = new int[n+1];\n int *v = new int[n+1];\n int i;\n rep(i,n+1) v[i] = i, g[i] = s[i];\n b[0] = 0; b[n] = 0;\n\n sort(v, v+n+1, SAComp(0, g));\n for(int h = 1; b[n] != n ; h *= 2) {\n SAComp comp(h, g);\n sort(v, v+n+1, comp);\n rep(i, n) b[i+1] = b[i] + comp(v[i], v[i+1]);\n rep(i, n+1) g[v[i]] = b[i];\n }\n delete[] g;\n delete[] b;\n \n vector<int> ret;\n rep(i, n + 1) ret.push_back(v[i]);\n delete[] v;\n return ret;\n}\n\n/*vector<int> construct_sa(string &s) {\n\tvector<string> vs;\n\tint i, j;\n\t\n\trep(i, s.length() + 1) {\n\t\tstring suf;\n\t\tfor (j = i; j < s.length(); j++) suf += s[j];\n\t\tvs.push_back(suf);\n\t}\n\tsort(vs.begin(), vs.end());\n\t\n\tvector<int> sa;\n\trep(i, vs.size()) sa.push_back(s.length() - vs[i].length());\n\treturn sa;\n}*/\n\nsigned main() {\n\tint i, j;\n\t\n\tcin >> n >> h >> s;\n\t\n\tj = 0;\n\trep(i, n) {\n\t\tif (j < i) j = i;\n\t\tfor (; j < n; j++) if (s[j] != '0') break;\n\t\t\n\t\tcnts[0] += j - i;\n\t\tcnts[1] -= j - i;\n\t\tcnts[1] += 1;\n\t\tcnts[n - j + 1] -= 1;\n\t}\n\trep(i, n) cnts[i + 1] += cnts[i];\n\t\n\tint cnt = 0;\n\trep(i, n + 1) {\n\t\tcnt += cnts[i];\n\t\tif (cnt >= h) break;\n\t}\n\t\n\tint keta = i;\n\tif (keta == 0) { cout << 0 << endl; return 0; }\n\t\n\tcnt = 0;\n\trep(i, keta) { cnt += cnts[i]; }\n\th = h - cnt;\n\t\n\tj = n - keta;\n\tfor (i = n - keta; i >= 0; i--) {\n\t\tif (s[i] == '0') continue;\n\t\tif (j >= i) j = i - 1;\n\t\tfor (; j >= 0; j--) if (s[j] != '0') break;\n\t\tbegin_cnts[i] = i - j;\n\t}\n\t\n\tvector<int> sa = construct_sa(s);\n\t\n\t//rep(i, sa.size()) cout << \"sa[\" << i << \"] = \" << sa[i] << endl;\n\t\n\trep(i, sa.size()) {\n\t\tif (sa[i] == s.length()) continue;\t//空文字列\n\t\tif (s[sa[i]] == '0') continue;\t\t//先頭が0のものは無視\n\t\th -= begin_cnts[sa[i]];\t\t\t\t//[0…0], s[sa[i]], …であって、桁数= ketaになるパターン数\n\t\tif (h <= 0) break;\n\t}\n\t\n\tint offset = sa[i];\n\tstring ans;\n\trep(i, keta) ans += s[offset + i];\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":6836,"score_of_the_acc":-0.3587,"final_rank":4},{"submission_id":"aoj_3033_3213985","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <string>\n#include <iostream>\n#include <cmath>\n#include <bitset>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <unordered_map>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<int, int> P;\nint n, k;\nint rk[100002];\nint tmp[100002];\n\nbool compare_sa(int i, int j){\n if(rk[i]!=rk[j]) return rk[i]<rk[j];\n else{\n int ri, rj;\n if(i+k<=n) ri=rk[i+k];\n else ri=-1;\n if(j+k<=n) rj=rk[j+k];\n else rj=-1;\n return ri<rj;\n }\n}\n\nvoid construct_sa(string s, int *sa){\n n=s.size();\n for(int i=0; i<=n; i++){\n sa[i]=i;\n if(i<n){\n rk[i]=s[i]-'0';\n }else{\n rk[i]=-1;\n }\n }\n for(k=1; k<=n; k*=2){\n sort(sa, sa+n+1, compare_sa);\n tmp[sa[0]]=0;\n for(int i=1; i<=n; i++){\n tmp[sa[i]]=tmp[sa[i-1]];\n if(compare_sa(sa[i-1], sa[i])) tmp[sa[i]]++;\n }\n for(int i=0; i<=n; i++) rk[i]=tmp[i];\n }\n}\n\nint main()\n{\n\tll h;\n cin>>n>>h;\n string s;\n cin>>s;\n ll w[100001]={}, ws[100001];\n ws[0]=0;\n ll ct=0;\n ll z=0;\n for(int i=0; i<n; i++){\n if(s[i]=='0'){\n ct++;\n }else{\n w[i]=ct+1;\n z+=ct*(ct+1)/2;\n ct=0;\n }\n }\n w[n]=ct+1;\n z+=ct*(ct+1)/2;\n if(h<=z){\n cout<<0<<endl;\n return 0;\n }\n ws[0]=0;\n for(int i=1; i<=n; i++) ws[i]=ws[i-1]+w[i-1];\n h-=z;\n int sa[100001];\n construct_sa(s, sa);\n //for(int i=0; i<=n; i++) cout<<sa[i]<<\" \";\n //cout<<endl;\n for(int d=1; d<=n; d++){\n if(ws[n-d+1]<h){\n h-=ws[n-d+1];\n continue;\n }\n for(int i=1; i<=n; i++){\n if(sa[i]>n-d || s[sa[i]]=='0') continue;\n if(h<=w[sa[i]]){\n for(int j=0; j<d; j++) cout<<s[sa[i]+j];\n cout<<endl;\n return 0;\n }\n h-=w[sa[i]];\n }\n }\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":5992,"score_of_the_acc":-0.4211,"final_rank":5},{"submission_id":"aoj_3033_3042308","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct SuffixArray{\n Int n,k;\n string S;\n vector<Int> sa,lcp;\n SuffixArray(){}\n SuffixArray(string& S):S(S){init();}\n void init(){\n n=S.length();\n S.push_back('$');\n build_sa();\n }\n void build_sa(){\n sa.clear();\n sa.resize(n+1,0);\n iota(sa.begin(),sa.end(),0);\n sort(sa.begin(),sa.end(),\n\t [&](Int a,Int b){\n\t if(S[a]==S[b]) return a>b;\n\t return S[a]<S[b];\n\t });\n vector<Int> c(n+1,0),r(n+1),cnt(n+1),s(n+1);\n for(Int i=0;i<=n;i++) r[i]=S[i];\n for(Int len=1;len<=n;len*=2){\n for(Int i=0;i<=n;i++){\n\t c[sa[i]]=\n\t i>0 &&\n\t r[sa[i-1]]==r[sa[i]] &&\n\t sa[i-1]+len<=n &&\n\t r[sa[i-1]+len/2]==r[sa[i]+len/2] ?\n\t c[sa[i-1]]:i;\n }\n iota(cnt.begin(),cnt.end(),0);\n copy(sa.begin(),sa.end(),r.begin());\n for(Int i=0;i<=n;i++){\n\tInt s1=r[i]-len;\n\tif(s1>=0) sa[cnt[c[s1]]++]=s1;\n }\n c.swap(r);\n }\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,k;\n string s;\n cin>>n>>k>>s;\n auto calc=[](Int x){return x*(x+1)/2;};\n Int zs=0;\n vector<Int> cnt(n+1,1);\n for(Int i=0;i<n;i++){\n if(s[i]=='0'){\n if(i+1>=n||s[i+1]!='0') zs+=calc(cnt[i]);\n if(i+1<n) cnt[i+1]+=cnt[i];\n cnt[i]=0;\n }\n }\n if(k<=zs){\n cout<<0<<endl;\n return 0;\n }\n k-=zs+1;\n vector<Int> sum(n+1,0);\n for(Int i=0;i<n;i++) sum[i+1]=sum[i]+cnt[i];\n Int len=1;\n while(k>=sum[n+1-len]&&len<n) k-=sum[n+1-(len++)];\n SuffixArray sa(s);\n Int pos=0;\n for(Int i=1;i<=n;i++){\n if(s[sa.sa[i]]=='0'||sa.sa[i]+len>n) continue;\n //cout<<len<<\" \"<<i<<\" \"<<k<<endl;\n if(k>=0) pos=sa.sa[i];\n k-=cnt[sa.sa[i]];\n }\n cout<<s.substr(pos,len)<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":8460,"score_of_the_acc":-0.5194,"final_rank":10},{"submission_id":"aoj_3033_2787093","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstruct SuffixArray {\n int N, k;\n vector<int> rank, sa;\n string s;\n\n SuffixArray(string t) {\n s = t, k = 1, N = t.length();\n rank = sa = vector<int>(N+1);\n build();\n }\n\n bool compare_sa(int i, int j) {\n if(rank[i] != rank[j]) return rank[i] < rank[j];\n else {\n int vi = (i+k <= N ? rank[i+k] : -1);\n int vj = (j+k <= N ? rank[j+k] : -1);\n return vi < vj;\n }\n }\n\n void build() {\n for(int i=0; i<=N; i++) {\n sa[i] = i;\n rank[i] = (i < N ? s[i] : -1);\n }\n\n for(k=1; k<=N; k*=2) {\n sort(sa.begin(), sa.end(), [&](int i, int j) {\n return compare_sa(i, j);\n });\n\n vector<int> tmp(N+1, 0);\n tmp[ sa[0] ] = 0;\n for(int i=1; i<=N; i++) {\n tmp[ sa[i] ] = tmp[ sa[i-1] ] + (compare_sa(sa[i-1], sa[i]) ? 1 : 0);\n }\n\n swap(rank, tmp);\n }\n }\n\n string get_substr(int idx) {\n return s.substr(sa[idx]);\n }\n\n void output() {\n for(int i=0; i<=N; i++) {\n fprintf(stderr, \"idx = %d, str = %s\\n\", i, get_substr(i).c_str());\n }\n }\n\n int operator[](int idx) const {\n return sa[idx];\n }\n};\n\nconst int SIZE = 1 << 17;\nstruct segtree {\n long long int node[2*SIZE];\n segtree() {\n fill(node, node+2*SIZE, 0);\n }\n void update(int idx, long long int val) {\n idx += SIZE - 1;\n node[idx] += val;\n while(idx > 0) {\n idx = (idx - 1) / 2;\n node[idx] = node[2*idx+1] + node[2*idx+2];\n }\n }\n long long int query(int a, int b, int l=0, int r=SIZE, int k=0) {\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return node[k];\n int mid = (l + r) / 2;\n long long int vl = query(a, b, l, mid, 2*k+1);\n long long int vr = query(a, b, mid, r, 2*k+2);\n return vl + vr;\n }\n};\n\nsegtree seg;\nint main() {\n int N;\n long long int H; cin >> N >> H;\n\n string s; cin >> s;\n SuffixArray suf(s);\n // suf.output();\n\n int len = s.length(), cnt_zero = 0;\n vector<long long int> weight(len);\n for(size_t i=0; i<s.length(); i++) {\n if(s[i] == '0') {\n cnt_zero++;\n H -= cnt_zero;\n }\n else {\n weight[i] = cnt_zero + 1;\n // printf(\"weight[%zu] = %d\\n\", i, weight[i]);\n cnt_zero = 0;\n }\n }\n\n if(H <= 0) {\n cout << 0 << endl;\n return 0;\n }\n else {\n vector<int> order;\n for(int i=0; i<=len; i++) {\n if(suf[i] >= len || s[ suf[i] ] == '0') continue;\n else {\n order.push_back(i);\n }\n }\n\n vector<int> end_point[100010];\n for(auto x : order) {\n seg.update(x, weight[ suf[x] ]);\n // printf(\"pos = %d, end_point = %d, weight = %lld\\n\", x, N-suf[x], weight[ suf[x] ]);\n end_point[N - suf[x]].push_back(x);\n }\n\n int step = 1;\n for(; H > seg.query(0, len+1); step++) {\n H -= seg.query(0, len+1);\n for(auto v : end_point[step]) {\n seg.update(v, -weight[ suf[v] ]);\n }\n }\n\n int ub = len+1, lb = 0;\n while(ub - lb > 1) {\n int mid = (ub + lb) / 2;\n // printf(\"mid = %d, val = %lld\\n\", mid, seg.query(0, mid));\n if(H <= seg.query(0, mid)) ub = mid;\n else lb = mid;\n }\n\n // printf(\"H = %lld, lb = %d, step = %d\\n\", H, lb, step);\n cout << s.substr(suf[lb], step) << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":12452,"score_of_the_acc":-1.3529,"final_rank":16},{"submission_id":"aoj_3033_2771312","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n\nusing ll = long long;\nusing Pll = pair<ll, ll>;\n\nclass SuffixArray {\nprivate:\n string s;\n int n;\n vector<int> rank;\n vector<int> sa;\npublic:\n SuffixArray(string _s) : s(_s) {\n n = s.size();\n rank.resize(n + 1);\n sa.resize(n + 1);\n construct();\n }\n vector<int> construct() {\n for (int i = 0; i <= n; ++i) {\n sa[i] = i;\n rank[i] = i < n ? s[i] : -1;\n }\n\n int k;\n auto compare = [&](int i, int j) {\n if (rank[i] != rank[j]) return rank[i] < rank[j];\n else {\n int ri = i + k <= n ? rank[i + k] : -1;\n int rj = j + k <= n ? rank[j + k] : -1;\n return ri < rj;\n }\n };\n\n vector<int> tmp(n + 1);\n for (k = 1; k <= n; k *= 2) {\n sort(sa.begin(), sa.end(), compare);\n\n tmp[sa[0]] = 0;\n for (int i = 1; i <= n; ++i) {\n tmp[sa[i]] = tmp[sa[i - 1]] + (compare(sa[i - 1], sa[i]) ? 1 : 0);\n }\n for (int i = 0; i <= n; ++i) {\n rank[i] = tmp[i];\n }\n }\n return sa;\n }\n};\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int n;\n ll k;\n cin >> n >> k;\n string s;\n cin >> s;\n vector<ll> lead(n + 1); // leading zero\n rep2(i, 1, n + 1) {\n if (s[i - 1] == '0') {\n lead[i] = lead[i - 1] + 1;\n }\n }\n\n ll num_zero = accumulate(lead.begin(), lead.end(), 0ll);\n k -= num_zero;\n if (k <= 0) {\n cout << 0 << endl;\n return 0;\n }\n\n auto f = [&](ll m) {\n ll a = 0;\n rep(i, n) {\n if (s[i] != '0') {\n a += (lead[i] + 1) * min<ll>(n - i, m);\n }\n }\n return a;\n };\n\n ll l = 0, r = n;\n while (r - l > 1) {\n ll m = (l + r) / 2;\n if (k <= f(m)) r = m;\n else l = m;\n }\n\n ll len = r;\n ll kk = k - f(len - 1);\n SuffixArray suf(s);\n vector<int> sa = suf.construct();\n rep2(i, 1, sa.size()) {\n if (sa[i] == n || s[sa[i]] == '0' || n - sa[i] < len) continue;\n int num = lead[sa[i]] + 1;\n kk -= num;\n if (kk <= 0) {\n cout << s.substr(sa[i], len) << endl;\n return 0;\n }\n }\n}","accuracy":1,"time_ms":110,"memory_kb":5516,"score_of_the_acc":-0.5921,"final_rank":12},{"submission_id":"aoj_3033_2761720","code_snippet":"#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\nvector<ll> suffix_array(const string &S) {\n ll n = S.length(), k = 1;\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\n\n auto compare_sa = [&](ll i, ll j) {\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\n ll ri = i + k <= n ? rnk[i + k] : -1;\n ll rj = j + k <= n ? rnk[j + k] : -1;\n return ri < rj;\n };\n\n REP(i, 0, n + 1) sa[i] = i;\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\n\n for(; k <= n; k *= 2) {\n sort(sa.begin(), sa.end(), compare_sa);\n tmp[sa[0]] = 0;\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n REP(i, 0, n + 1) rnk[i] = tmp[i];\n }\n\n return sa;\n}\n\nint main(void) {\n ll N, H;\n string S;\n cin >> N >> H >> S;\n\n vector<ll> a(N, 0);\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\n\n vector<ll> imos(N + 2, 0);\n REP(i, 0, N) {\n if(S[i] != '0') {\n imos[1] += a[i] + 1;\n imos[N - i + 1] -= a[i] + 1;\n } else {\n imos[1] += a[i] + 1;\n imos[2] -= a[i] + 1;\n }\n }\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\n\n ll x = 1, cnt = 1;\n while(1) {\n if(cnt <= H && H < cnt + imos[x]) break;\n cnt += imos[x];\n x++;\n }\n\n vector<ll> sa = suffix_array(S);\n REP(i, 1, N + 1) {\n ll j = sa[i];\n if((x == 1 || S[j] != '0') && j + x <= N) {\n if(cnt <= H && H < cnt + a[j] + 1) {\n cout << S.substr(j, x) << endl;\n break;\n }\n cnt += a[j] + 1;\n }\n }\n}","accuracy":1,"time_ms":60,"memory_kb":6908,"score_of_the_acc":-0.4861,"final_rank":8},{"submission_id":"aoj_3033_2761499","code_snippet":"#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\nvector<ll> construct_suffix_array(const string &S) {\n ll n = S.length(), k = 1;\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\n\n auto compare_sa = [&](const ll& i, const ll& j) {\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\n ll ri = i + k <= n ? rnk[i + k] : -1;\n ll rj = j + k <= n ? rnk[j + k] : -1;\n return ri < rj;\n };\n\n REP(i, 0, n + 1) sa[i] = i;\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\n\n for(; k <= n; k *= 2) {\n sort(sa.begin(), sa.end(), compare_sa);\n tmp[sa[0]] = 0;\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n REP(i, 0, n + 1) rnk[i] = tmp[i];\n }\n\n return sa;\n}\n\nint main(void) {\n ll N, H;\n string S;\n cin >> N >> H >> S;\n\n vector<ll> a(N, 0);\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\n\n vector<ll> imos(N + 2, 0);\n REP(i, 0, N) {\n if(S[i] != '0') {\n imos[1] += a[i] + 1;\n imos[N - i + 1] -= a[i] + 1;\n } else {\n imos[1] += a[i] + 1;\n imos[2] -= a[i] + 1;\n }\n }\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\n\n ll x = 1, cnt = 1;\n while(1) {\n if(cnt <= H && H < cnt + imos[x]) break;\n cnt += imos[x];\n x++;\n }\n\n vector<ll> sa = construct_suffix_array(S);\n REP(i, 1, N + 1) {\n ll j = sa[i];\n if((x == 1 || S[j] != '0') && j + x <= N) {\n if(cnt <= H && H < cnt + a[j] + 1) {\n cout << S.substr(j, x) << endl;\n break;\n }\n cnt += a[j] + 1;\n }\n }\n}","accuracy":1,"time_ms":60,"memory_kb":6880,"score_of_the_acc":-0.4823,"final_rank":7},{"submission_id":"aoj_3033_2761493","code_snippet":"#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\nvector<ll> construct_suffix_array(const string &S) {\n ll n = S.length(), k = 1;\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\n\n auto compare_sa = [&](const ll &i, const ll &j) {\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\n ll ri = i + k <= n ? rnk[i + k] : -1;\n ll rj = j + k <= n ? rnk[j + k] : -1;\n return ri < rj;\n };\n\n REP(i, 0, n + 1) sa[i] = i;\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\n\n for(; k <= n; k *= 2) {\n sort(sa.begin(), sa.end(), compare_sa);\n tmp[sa[0]] = 0;\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n REP(i, 0, n + 1) rnk[i] = tmp[i];\n }\n\n return sa;\n}\n\nint main(void) {\n ll N, H;\n string S;\n cin >> N >> H >> S;\n\n vector<ll> a(N, 0);\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\n\n vector<ll> imos(N + 2, 0);\n REP(i, 0, N) {\n if(S[i] != '0') {\n imos[1] += a[i] + 1;\n imos[N - i + 1] -= a[i] + 1;\n } else {\n imos[1] += a[i] + 1;\n imos[2] -= a[i] + 1;\n }\n }\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\n\n ll x = 1, cnt = 1;\n while(1) {\n if(cnt <= H && H < cnt + imos[x]) break;\n cnt += imos[x];\n x++;\n }\n\n vector<ll> sa = construct_suffix_array(S);\n REP(i, 1, N + 1) {\n ll j = sa[i];\n if((x == 1 || S[j] != '0') && j + x <= N) {\n if(cnt <= H && H < cnt + a[j] + 1) {\n cout << S.substr(j, x) << endl;\n break;\n }\n cnt += a[j] + 1;\n }\n }\n}","accuracy":1,"time_ms":60,"memory_kb":6908,"score_of_the_acc":-0.4861,"final_rank":8},{"submission_id":"aoj_3033_2761077","code_snippet":"#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\nconst ll MAX_N = 500000;\nll n, k;\nll rnk[MAX_N + 1];\nll tmp[MAX_N + 1];\n\nbool compare_sa(ll i, ll j) {\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\n ll ri = i + k <= n ? rnk[i + k] : -1;\n ll rj = j + k <= n ? rnk[j + k] : -1;\n return ri < rj;\n}\n\nvector<ll> construct_sa(const string &S) {\n n = S.length();\n vector<ll> sa(n + 1);\n REP(i, 0, n + 1) sa[i] = i;\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\n for(k = 1; k <= n; k *= 2) {\n sort(sa.begin(), sa.end(), compare_sa);\n tmp[sa[0]] = 0;\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n REP(i, 0, n + 1) rnk[i] = tmp[i];\n }\n return sa;\n}\n\nint main(void) {\n ll N, H;\n string S;\n cin >> N >> H >> S;\n\n vector<ll> a(N, 0);\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\n\n vector<ll> imos(N + 2, 0);\n REP(i, 0, N) {\n if(S[i] != '0') {\n imos[1] += a[i] + 1;\n imos[N - i + 1] -= a[i] + 1;\n } else {\n imos[1] += a[i] + 1;\n imos[2] -= a[i] + 1;\n }\n }\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\n\n ll x = 1, cnt = 1;\n while(1) {\n if(cnt <= H && H < cnt + imos[x]) break;\n cnt += imos[x];\n x++;\n }\n\n vector<ll> sa = construct_sa(S);\n REP(i, 1, N + 1) {\n ll j = sa[i];\n if((x == 1 || S[j] != '0') && j + x <= N) {\n if(cnt <= H && H < cnt + a[j] + 1) {\n cout << S.substr(j, x) << endl;\n break;\n }\n cnt += a[j] + 1;\n }\n }\n}","accuracy":1,"time_ms":80,"memory_kb":6916,"score_of_the_acc":-0.6048,"final_rank":13},{"submission_id":"aoj_3033_2755612","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct SuffixArray {\n vector< int > SA;\n string s;\n\n void Build_SA(const string &str) {\n s = str;\n SA.resize(s.size());\n iota(begin(SA), end(SA), 0);\n sort(begin(SA), end(SA), [&](const int &a, const int &b) {\n if(s[a] == s[b]) return (a > b);\n return (s[a] < s[b]);\n });\n vector< int > classes(s.size()), c(s.size()), cnt(s.size());\n for(int i = 0; i < s.size(); i++) {\n c[i] = s[i];\n }\n for(int len = 1; len < s.size(); len <<= 1) {\n for(int i = 0; i < s.size(); i++) {\n if(i > 0 && c[SA[i - 1]] == c[SA[i]] && SA[i - 1] + len < s.size() && c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {\n classes[SA[i]] = classes[SA[i - 1]];\n } else {\n classes[SA[i]] = i;\n }\n }\n iota(begin(cnt), end(cnt), 0);\n copy(begin(SA), end(SA), begin(c));\n for(int i = 0; i < s.size(); i++) {\n int s1 = c[i] - len;\n if(s1 >= 0) SA[cnt[classes[s1]]++] = s1;\n }\n classes.swap(c);\n }\n }\n\n int operator[](int k) const {\n return (SA[k]);\n }\n\n int size() const {\n return (s.size());\n }\n\n bool lt_substr(string &t, int si = 0, int ti = 0) {\n int sn = s.size(), tn = t.size();\n while(si < sn && ti < tn) {\n if(s[si] < t[ti]) return (true);\n if(s[si] > t[ti]) return (false);\n ++si, ++ti;\n }\n return (si >= sn && ti < tn);\n }\n\n int lower_bound(string &t) {\n int low = -1, high = SA.size();\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(lt_substr(t, SA[mid])) low = mid;\n else high = mid;\n }\n return (high);\n }\n\n pair< int, int > lower_upper_bound(string &t) {\n int idx = lower_bound(t);\n int low = idx - 1, high = SA.size();\n t.back()++;\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(lt_substr(t, SA[mid])) low = mid;\n else high = mid;\n }\n t.back()--;\n return (make_pair(idx, high));\n }\n\n void output() {\n for(int i = 0; i < size(); i++) {\n cout << i << \": \" << s.substr(SA[i]) << endl;\n }\n }\n};\n\nusing int64 = long long;\n\ntemplate< class T >\nstruct BinaryIndexedTree {\n vector< T > data;\n\n BinaryIndexedTree(int sz) {\n data.assign(++sz, 0);\n }\n\n T sum(int k) {\n T ret = 0;\n for(++k; k > 0; k -= k & -k) ret += data[k];\n return (ret);\n }\n\n void add(int k, T x) {\n for(++k; k < data.size(); k += k & -k) data[k] += x;\n }\n};\n\ntemplate< class T >\nstruct AdditionalBIT : BinaryIndexedTree< T > {\n int curr;\n\n AdditionalBIT(int sz) : BinaryIndexedTree< T >(sz) {\n curr = 1;\n while(curr <= sz) curr <<= 1;\n }\n\n int lower_bound(T w) {\n if(w <= 0) return (0);\n int i = 0;\n for(int k = curr; k > 0; k >>= 1) {\n if(i + k < BinaryIndexedTree< T >::data.size() && BinaryIndexedTree< T >::data[i + k] < w) {\n w -= BinaryIndexedTree< T >::data[i + k];\n i += k;\n }\n }\n return (i);\n }\n};\n\nint main() {\n int64 N, H;\n string S;\n\n cin >> N >> H;\n cin >> S;\n\n int wait = 0;\n vector< int > weight(S.size());\n for(int i = 0; i < S.size(); i++) {\n if(S[i] == '0') {\n ++wait;\n H -= wait;\n } else {\n weight[i] += wait + 1;\n wait = 0;\n }\n }\n\n SuffixArray sa;\n sa.Build_SA(S);\n\n if(H <= 0) {\n cout << 0 << endl;\n return (0);\n }\n\n vector< int > order;\n for(int i = 0; i < S.size(); i++) {\n if(S[sa[i]] == '0') continue;\n order.emplace_back(i);\n }\n\n AdditionalBIT< int64 > bit(N);\n vector< int > end[100001];\n for(auto &v : order) {\n bit.add(v, weight[sa[v]]);\n end[N - sa[v]].emplace_back(v);\n }\n\n int keta = 1;\n for(; H - bit.sum(N - 1) >= 1; ++keta) {\n H -= bit.sum(N - 1);\n for(auto &p : end[keta]) bit.add(p, -weight[sa[p]]);\n }\n\n cout << S.substr(sa[bit.lower_bound(H)], keta) << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":10360,"score_of_the_acc":-0.8349,"final_rank":15},{"submission_id":"aoj_3033_2755611","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct SuffixArray {\n vector< int > SA;\n string s;\n\n void Build_SA(const string &str) {\n s = str;\n SA.resize(s.size());\n iota(begin(SA), end(SA), 0);\n sort(begin(SA), end(SA), [&](const int &a, const int &b) {\n if(s[a] == s[b]) return (a > b);\n return (s[a] < s[b]);\n });\n vector< int > classes(s.size()), c(s.size()), cnt(s.size());\n for(int i = 0; i < s.size(); i++) {\n c[i] = s[i];\n }\n for(int len = 1; len < s.size(); len <<= 1) {\n for(int i = 0; i < s.size(); i++) {\n if(i > 0 && c[SA[i - 1]] == c[SA[i]] && SA[i - 1] + len < s.size() && c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {\n classes[SA[i]] = classes[SA[i - 1]];\n } else {\n classes[SA[i]] = i;\n }\n }\n iota(begin(cnt), end(cnt), 0);\n copy(begin(SA), end(SA), begin(c));\n for(int i = 0; i < s.size(); i++) {\n int s1 = c[i] - len;\n if(s1 >= 0) SA[cnt[classes[s1]]++] = s1;\n }\n classes.swap(c);\n }\n }\n\n int operator[](int k) const {\n return (SA[k]);\n }\n\n int size() const {\n return (s.size());\n }\n\n bool lt_substr(string &t, int si = 0, int ti = 0) {\n int sn = s.size(), tn = t.size();\n while(si < sn && ti < tn) {\n if(s[si] < t[ti]) return (true);\n if(s[si] > t[ti]) return (false);\n ++si, ++ti;\n }\n return (si >= sn && ti < tn);\n }\n\n int lower_bound(string &t) {\n int low = -1, high = SA.size();\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(lt_substr(t, SA[mid])) low = mid;\n else high = mid;\n }\n return (high);\n }\n\n pair< int, int > lower_upper_bound(string &t) {\n int idx = lower_bound(t);\n int low = idx - 1, high = SA.size();\n t.back()++;\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(lt_substr(t, SA[mid])) low = mid;\n else high = mid;\n }\n t.back()--;\n return (make_pair(idx, high));\n }\n\n void output() {\n for(int i = 0; i < size(); i++) {\n cout << i << \": \" << s.substr(SA[i]) << endl;\n }\n }\n};\n\nusing int64 = long long;\n\ntemplate< class T >\nstruct BinaryIndexedTree {\n vector< T > data;\n\n BinaryIndexedTree(int sz) {\n data.assign(++sz, 0);\n }\n\n T sum(int k) {\n T ret = 0;\n for(++k; k > 0; k -= k & -k) ret += data[k];\n return (ret);\n }\n\n void add(int k, T x) {\n for(++k; k < data.size(); k += k & -k) data[k] += x;\n }\n};\n\ntemplate< class T >\nstruct AdditionalBIT : BinaryIndexedTree< T > {\n int curr;\n\n AdditionalBIT(int sz) : BinaryIndexedTree< T >(sz) {\n curr = 1;\n while(curr <= sz) curr <<= 1;\n }\n\n int lower_bound(T w) {\n if(w <= 0) return (0);\n int i = 0;\n for(int k = curr; k > 0; k >>= 1) {\n if(i + k < BinaryIndexedTree< T >::data.size() && BinaryIndexedTree< T >::data[i + k] < w) {\n w -= BinaryIndexedTree< T >::data[i + k];\n i += k;\n }\n }\n return (i);\n }\n};\n\nint main() {\n int N, H;\n string S;\n\n cin >> N >> H;\n cin >> S;\n\n int wait = 0;\n vector< int > weight(S.size());\n for(int i = 0; i < S.size(); i++) {\n if(S[i] == '0') {\n ++wait;\n H -= wait;\n } else {\n weight[i] += wait + 1;\n wait = 0;\n }\n }\n\n SuffixArray sa;\n sa.Build_SA(S);\n\n if(H <= 0) {\n cout << 0 << endl;\n return (0);\n }\n\n vector< int > order;\n for(int i = 0; i < S.size(); i++) {\n if(S[sa[i]] == '0') continue;\n order.emplace_back(i);\n }\n\n AdditionalBIT< int64 > bit(N);\n vector< int > end[100001];\n for(auto &v : order) {\n bit.add(v, weight[sa[v]]);\n end[N - sa[v]].emplace_back(v);\n }\n\n int keta = 1;\n for(; H - bit.sum(N - 1) >= 1; ++keta) {\n H -= bit.sum(N - 1);\n for(auto &p : end[keta]) bit.add(p, -weight[sa[p]]);\n }\n\n cout << S.substr(sa[bit.lower_bound(H)], keta) << endl;\n}","accuracy":0.6779661016949152,"time_ms":20,"memory_kb":8264,"score_of_the_acc":-0.4341,"final_rank":20},{"submission_id":"aoj_3033_2754664","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\n#define INF 1e16\n#define mod 1000000007\n\nint _n,_k;\nint ranks[101010];\nint tmp[101010];\n\nbool compare_sa(int i,int j){\n if(ranks[i]!=ranks[j])return ranks[i]<ranks[j];\n else{\n int ri=i+_k<=_n?ranks[i+_k]:-1;\n int rj=j+_k<=_n?ranks[j+_k]:-1;\n return ri<rj;\n }\n}\nvoid construct_sa(string s,int *sa){\n _n=s.length();\n for(int i=0;i<=_n;i++){\n sa[i]=i;\n ranks[i]=i<_n?s[i]:-1;\n }\n for(_k=1;_k<=_n;_k*=2){\n sort(sa,sa+_n+1,compare_sa);\n tmp[sa[0]]=0;\n for(int i=1;i<=_n;i++){\n tmp[sa[i]]=tmp[sa[i-1]]+(compare_sa(sa[i-1],sa[i])?1:0);\n }\n for(int i=0;i<=_n;i++){\n ranks[i]=tmp[i];\n }\n }\n}\n\nll n,h;\nstring s;\nll cnt[101010];\nint sa[101010];\nll sum[101010];\n\nint main(){\n cin>>n>>h>>s;\n for(ll i=0;i<n;){\n if(s[i]!='0'){\n sum[i]++;\n ll suf=n-i;\n cnt[1]++;\n cnt[suf+1]--;\n i++;\n continue;\n }\n ll j;\n for(j=i;j<n&&s[j]=='0';j++);\n ll len=j-i;\n ll suf=n-j;\n sum[j]+=len;\n cnt[0]+=len*(len+1)/2;\n cnt[1]+=len;\n cnt[suf+1]-=len;\n i=j;\n }\n\n for(ll i=1;i<100001;i++)cnt[i+1]+=cnt[i];\n\n construct_sa(s,sa);\n\n if(h<=cnt[0]){\n cout<<0<<endl;\n }else{\n h-=cnt[0];\n ll d=-1;\n repl(i,1,n+1){\n if(h<=cnt[i]){\n d=i;\n break;\n }else h-=cnt[i];\n }\n repl(i,1,n+1){\n if(n-sa[i]>=d&&s[sa[i]]!='0'){\n if(h<=sum[sa[i]]){\n cout<<s.substr(sa[i],d)<<endl;\n return 0;\n }else h-=sum[sa[i]];\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":5964,"score_of_the_acc":-0.4762,"final_rank":6},{"submission_id":"aoj_3033_2752510","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp make_pair\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nclass SuffixArray {\npublic:\n const string &s;\n vector<int> sa, rank;\n int n;\n void construct_sa(){\n sa.resize(n+1);\n rank.resize(n+1);\n rep(i,n+1){\n sa[i]=i;\n rank[i] = (i<n)?s[i]:(-1);\n }\n vector<int> tmp(n+1,0);\n for(int k=1; k<=n; k*=2){\n auto comp = [&](const int i, const int j){\n if(rank[i]!=rank[j]) return rank[i]<rank[j];\n int ri = (i+k<=n)?(rank[i+k]):-1;\n int rj = (j+k<=n)?(rank[j+k]):-1;\n return ri < rj;\n };\n sort(all(sa), comp);\n tmp[sa[0]]=0;\n rep(i,1,n+1){\n tmp[sa[i]] = tmp[sa[i-1]];\n if(comp(sa[i-1], sa[i])) tmp[sa[i]]++;\n }\n swap(tmp, rank);\n }\n }\n SuffixArray(const string &str) : s(str){\n n = s.size();\n construct_sa();\n }\n};\n\n\nvoid solve(int n, ll h, string &str, int len){\n if(len == 0){\n cout << \"0\" << endl;\n return;\n }\n\n SuffixArray sa(str);\n vector<int> arr(n+1,0);\n rep(i,1,n+1) if(str[sa.sa[i]]>'0'){\n int idx = sa.sa[i];\n int d = 1;\n if(n-idx < len) d = 0;\n else {\n while(idx-d>=0 && str[idx-d]=='0') d++;\n }\n arr[i] = arr[i-1] + d;\n if(arr[i] >= h){\n cout << str.substr(idx, len) << endl;\n return;\n }\n }\n assert(false);\n}\n\nint main(void){\n\tint n;\n\tll h;\n\tstring str;\n\tscanf(\"%d%lld\",&n,&h);\n\tcin >> str;\n\tint z=-1;\n\tvector<int> nonzero(n+1);\n\tvector<ll> cnt(n+1);\n\tfor(int i=0;i<=n;i++){\n\t\tcnt[i]=0;\n\t}\n\tfor(int i=n-1;i>=0;i--){\n\t\tif(str[i]>='1'){\n\t\t\tz=i;\n\t\t}\n\t\tnonzero[i]=z;\n\t}\n\tfor(int i=0;i<n;i++){\n\t\t//printf(\"%d\\n\",nonzero[i]);\n\t\tif(nonzero[i]==-1)continue;\n\t\tcnt[n-nonzero[i]]++;\n\t}\n\tfor(int i=n;i>1;i--){\n\t\tcnt[i-1]+=cnt[i];\n\t}\n\tll len=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(str[i]=='0'){\n\t\t\tlen++;\n\t\t}else{\n\t\t\tcnt[0]+=len*(len+1)/2LL;\n\t\t\tlen=0;\n\t\t}\n\t}\n\tcnt[0]+=len*(len+1)/2LL;\n\tll sum=0;\n\tfor(int i=0;i<=n;i++){\n\t\tsum+=cnt[i];\n\t\tif(sum>=h){\n\t\t\tsum-=cnt[i];\n\t\t\tsolve(n,h-sum,str,i);\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5472,"score_of_the_acc":-0.2921,"final_rank":3},{"submission_id":"aoj_3033_2752396","code_snippet":"#include<algorithm>\n#include<iostream>\n#include<cstring>\n#include<vector>\nusing namespace std;\ntypedef long long lint;\ntypedef vector<int>vi;\ntypedef pair<int,int>pii;\n#define rep(i,n)for(int i=0;i<(int)(n);++i)\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\nconst int DEBUG=0;\n\n// http://www.prefield.com/algorithm/string/suffix_array.html\n\n// Larsson-Sadakane's Suffix array Construction: O(n (log n)^2)\nstruct SAComp {\n const int h, *g;\n SAComp(int h, int* g) : h(h), g(g) {}\n bool operator() (int a, int b) {\n return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a+h] < g[b+h];\n }\n};\nint *buildSA(const char* t, int n) {\n int g[n+1], b[n+1], *v = new int[n+1];\n REP(i,n+1) v[i] = i, g[i] = t[i];\n b[0] = 0; b[n] = 0;\n\n sort(v, v+n+1, SAComp(0, g));\n for(int h = 1; b[n] != n ; h *= 2) {\n SAComp comp(h, g);\n sort(v, v+n+1, comp);\n REP(i, n) b[i+1] = b[i] + comp(v[i], v[i+1]);\n REP(i, n+1) g[v[i]] = b[i];\n }\n return v;\n}\n// Naive matching O(m log n)\nint find(char *t, int n, char *p, int m, int *sa) {\n int a = 0, b = n;\n while (a < b) {\n int c = (a + b) / 2;\n if (strncmp(t+sa[c], p, m) < 0) a = c+1; else b = c;\n }\n return strncmp(t+sa[a], p, m) == 0 ? sa[a] : -1;\n}\n\n// Kasai-Lee-Arimura-Arikawa-Park's simple LCP computation: O(n)\nint *buildLCP(char *t, int n, int *a) {\n int h = 0, b[n+1], *lcp = new int[n+1];\n REP(i, n+1) b[a[i]] = i;\n REP(i, n+1) {\n if (b[i]){\n for (int j = a[b[i]-1]; j+h<n && i+h<n && t[j+h] == t[i+h]; ++h);\n lcp[b[i]] = h;\n } else lcp[b[i]] = -1;\n if (h > 0) --h;\n }\n return lcp;\n}\n// call RMQ = buildRMQ(lcp, n+1)\nint *buildRMQ(int *a, int n) {\n int logn = 1;\n for (int k = 1; k < n; k *= 2) ++logn;\n int *r = new int[n * logn];\n int *b = r; copy(a, a+n, b);\n for (int k = 1; k < n; k *= 2) {\n copy(b, b+n, b+n); b += n;\n REP(i, n-k) b[i] = min(b[i], b[i+k]);\n }\n return r;\n}\n// inner LCP computation with RMQ: O(1)\nint minimum(int x, int y, int *rmq, int n) {\n int z = y - x, k = 0, e = 1, s; // y - x >= e = 2^k なる最大 k\n s = ( (z & 0xffff0000) != 0 ) << 4; z >>= s; e <<= s; k |= s;\n s = ( (z & 0x0000ff00) != 0 ) << 3; z >>= s; e <<= s; k |= s;\n s = ( (z & 0x000000f0) != 0 ) << 2; z >>= s; e <<= s; k |= s;\n s = ( (z & 0x0000000c) != 0 ) << 1; z >>= s; e <<= s; k |= s;\n s = ( (z & 0x00000002) != 0 ) << 0; z >>= s; e <<= s; k |= s;\n return min( rmq[x+n*k], rmq[y+n*k-e+1] );\n}\n// outer LCP computation: O(m - o)\nint computeLCP(char *t, int n, char *p, int m, int o, int k) {\n int i = o;\n for (; i < m && k+i < n && p[i] == t[k+i]; ++i);\n return i;\n}\n// Mamber-Myers's O(m + log n) string matching with LCP/RMQ\n#define COMP(h, k) (h == m || (k+h<n && p[h]<t[k+h]))\nint find(char *t, int n, char *p, int m, int *sa, int *rmq) {\n int l = 0, lh = 0, r = n, rh = computeLCP(t,n+1,p,m,0,sa[n]);\n if (!COMP(rh, sa[r])) return -1;\n for (int k = (l+r)/2; l+1 < r; k = (l+r)/2) {\n int A = minimum(l+1, k, rmq, n+1), B = minimum(k+1, r, rmq, n+1);\n if (A >= B) {\n if (lh < A) l = k;\n else if (lh > A) r = k, rh = A;\n else {\n int i = computeLCP(t, n+1, p, m, A, sa[k]);\n if (COMP(i, sa[k])) r = k, rh = i; else l = k, lh = i;\n }\n } else {\n if (rh < B) r = k;\n else if (rh > B) l = k, lh = B;\n else {\n int i = computeLCP(t, n+1, p, m, B, sa[k]);\n if (COMP(i, sa[k])) r = k, rh = i; else l = k, lh = i;\n }\n }\n }\n return rh == m ? sa[r] : -1;\n}\n\nint main(){\n int n;\n lint h;\n string s;\n cin>>n>>h>>s;\n vi multa(n+1);\n int cnt=0;\n rep(i,n+1){\n cnt++;\n if(i<n&&s[i]=='0'){\n multa[i]=0;\n }else{\n multa[i]=cnt;\n cnt=0;\n }\n }\n int lo=-1,hi=n;\n while(hi-lo>1){\n int x=(hi+lo)/2;\n lint cnt=0;\n rep(i,n+1){\n if(i<n)\n\tcnt+=(lint)min(x,n-i)*multa[i];\n cnt+=(lint)multa[i]*(lint)(multa[i]-1)/2;\n }\n if(cnt>=h)\n hi=x;\n else\n lo=x;\n }\n int *sa=buildSA(s.c_str(),n);\n if(DEBUG){\n rep(i,n+1){\n cerr<<\"suf:\"<<sa[i]<<\" \"<<s.substr(sa[i])<<endl;\n }\n }\n int len=hi;\n if(DEBUG)cerr<<\"len=\"<<len<<endl;\n vi tak;\n rep(i,n+1){\n if(sa[i]<=n-len)tak.push_back(sa[i]);\n }\n lint base=0;\n rep(i,n+1){\n if(i<n)\n base+=(lint)min(len-1,n-i)*multa[i];\n base+=(lint)multa[i]*(lint)(multa[i]-1)/2;\n }\n if(len==0){\n cout<<0<<endl;\n return 0;\n }\n if(DEBUG)\n cerr<<\"base=\"<<base<<endl;\n if(DEBUG){\n cerr<<\"tak:\";\n rep(i,tak.size()){\n cerr<<\" \"<<tak[i];\n //cerr<<\" \"<<s.substr(tak[i])<<endl;\n }\n cerr<<endl;\n }\n int tmp=0,idx=-1;\n rep(i,tak.size()){\n if(s[tak[i]]!='0'){\n tmp+=multa[tak[i]];\n if(tmp+base>=h){\n\tidx=tak[i];\n\tbreak;\n }\n }\n }\n cout<<s.substr(idx,len)<<endl;\n}","accuracy":1,"time_ms":50,"memory_kb":5052,"score_of_the_acc":-0.1765,"final_rank":1},{"submission_id":"aoj_3033_2751817","code_snippet":"//ランタイムエラーの原因が分からなかったので、もしやと思い、sortをstable_sortに書き換えたらAcceptedした。なぜsortではダメなのか、よくわからない…\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#define int long long\nusing namespace std;\ntypedef pair<int, int> P;\n\n/*https://kimiyuki.net/blog/2016/04/09/arc-050-d/より引用*/\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\n#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))\nvector<int> suffix_array(string const & s) {\n int n = s.length();\n vector<int> sa(n+1);\n vector<int> rank(n+1);\n repeat (i,n+1) {\n sa[i] = i;\n rank[i] = i < n ? s[i] : -1;\n }\n auto rankf = [&](int i) { return i <= n ? rank[i] : -1; };\n vector<int> nxt(n+1);\n for (int k = 1; k <= n; k <<= 1) {\n auto cmp = [&](int i, int j) { return make_pair(rank[i], rankf(i + k)) < make_pair(rank[j], rankf(j + k)); };\n sort(sa.begin(), sa.end(), cmp);\n nxt[sa[0]] = 0;\n repeat_from (i,1,n+1) {\n nxt[sa[i]] = nxt[sa[i-1]] + (cmp(sa[i-1], sa[i]) ? 1 : 0);\n }\n rank.swap(nxt);\n }\n return sa;\n}\n/*終わり*/\n\n/*ローリングハッシュ https://odan3240.hatenablog.com/entry/2015/02/16/111938*/\nstruct RollingHash {\n typedef long long int_type;\n typedef pair<int_type,int_type> hash_type;\n\n int_type base1;\n int_type base2;\n int_type mod1;\n int_type mod2;\n vector<int_type> hash1;\n vector<int_type> hash2;\n vector<int_type> pow1;\n vector<int_type> pow2;\n\n RollingHash() : base1(1009), base2(1007), mod1(1000000007), mod2(1000000009) {}\n\n void init(const string &s) {\n int n = s.size();\n\n hash1.assign(n+1,0);\n hash2.assign(n+1,0);\n pow1.assign(n+1,1);\n pow2.assign(n+1,1);\n\n for(int i=0;i<n;i++) {\n hash1[i+1] = (hash1[i]+s[i]) * base1 % mod1;\n hash2[i+1] = (hash2[i]+s[i]) * base2 % mod2;\n pow1[i+1] = pow1[i] * base1 % mod1;\n pow2[i+1] = pow2[i] * base2 % mod2;\n }\n }\n\n\t//[l, r)のハッシュ値を返す\n hash_type get(int l,int r) {\n int_type t1 = ((hash1[r] - hash1[l] * pow1[r-l]) % mod1 + mod1) % mod1;\n int_type t2 = ((hash2[r] - hash2[l] * pow2[r-l]) % mod2 + mod2) % mod2;\n return make_pair(t1, t2);\n }\n};\n/*終わり*/\n\nint n, h;\nstring s;\nint rs[100001];\nint imos[100005];\t//imos[i] = i桁の数字が何個あるか\nvector<int> sa;\nvector<int> saInv;\t//saInv[i] = sa[id] = iなるidを書いておく\nRollingHash rh;\n\nbool compare(const P &l, const P &r) {\n\tif (rh.get(l.first, l.second) == rh.get(r.first, r.second)) return true;\n\tif (saInv[l.first] < saInv[r.first]) return true;\n\treturn false;\n}\n\nsigned main() {\n\tint i;\n\t\n\tcin >> n >> h >> s;\n\tfor (i = 0; i < n; i++) rs[i + 1] = rs[i] + (s[i] > '0');\n\t\n\tfor (i = 0; i < n; i++) {\n\t\tint st = i, ed = n + 1, mid; //(st, ed]\n\t\twhile (ed - st >= 2) {\n\t\t\tmid = (st + ed) / 2;\n\t\t\tif (rs[mid] - rs[i] >= 1) ed = mid;\n\t\t\telse st = mid;\n\t\t}\n\t\tif (s[i] == '0') { imos[0] += ed - i - 1; imos[1] -= ed - i - 1; }\n\t\timos[1]++;\n\t\timos[n + 2 - ed]--;\n\t}\n\t\n\tfor (i = 0; i <= n + 1; i++) imos[i + 1] += imos[i];\n\t//cout << \"imos:\" << endl;\n\t//for (i = 0; i <= n; i++) cout << imos[i] << endl;\n\t//cout << \"imos*\" << endl;\n\t\n\tfor (i = 0; i <= n; i++) {\n\t\th -= imos[i];\n\t\tif (h <= 0) break;\n\t}\n\t\n\tint keta = i;\t\t//答えはi桁。\n\tif (keta == 0) { cout << 0 << endl; return 0; }\n\t//cout << \"keta, h = \" << keta << \", \" << h << endl;\n\t\n\tvector<P> kukan;\t//答えの候補 … [l, r)\n\t\n\tfor (i = 0; i < n; i++) {\n\t\tint st = i, ed = n + 1, mid; //(st, ed]\n\t\twhile (ed - st >= 2) {\n\t\t\tmid = (st + ed) / 2;\n\t\t\tif (rs[mid] - rs[i] >= 1) ed = mid;\n\t\t\telse st = mid;\n\t\t}\n\t\tif (ed + keta - 1 <= n) {\n\t\t\tkukan.push_back(P(ed - 1, ed + keta - 1));\n\t\t}\n\t}\n\t\n\t//cout << \"ソート前\" << endl;\n\t//for (i = 0; i < kukan.size(); i++) { cout << kukan[i].first << \" \" << kukan[i].second << endl; }\n\t\n\tsa = suffix_array(s);\n\tsaInv.resize(sa.size());\n\tfor (i = 0; i < sa.size(); i++) saInv[sa[i]] = i;\n\t//for (i = 0; i < sa.size(); i++) { cout << \"sa[\" << i << \"] = \" << sa[i] << endl; }\n\trh.init(s);\n\t//for (i = 0; i < n; i++) for (int j = 0; j < n; j++) cout << \"[\" << i << \", \" << j << \"] = \" << rh.get(i, j).first << endl;\n\t\n\t//kukanをソートしたい。その比較関数にsuffix_array, ローリングハッシュを用いる.\n\tstable_sort(kukan.begin(), kukan.end(), compare);\n\t//cout << \"ソート後\" << endl;\n\t//for (i = 0; i < kukan.size(); i++) { cout << kukan[i].first << \" \" << kukan[i].second << endl; }\n\t\n\t//あとは、適当に答えるだけ。\n\tint id = (int)kukan.size() - 1 + h;\n\tbool flag = false;\n\tfor (i = kukan[id].first; i < kukan[id].second; i++) {\n\t\tif (s[i] != '0') flag = true;\n\t\tif (flag) cout << s[i];\n\t}\n\tcout << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":11376,"score_of_the_acc":-1.8546,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3033_4218303\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\n#define NUM1 1000000009\\n#define NUM2 99999883\\n\\nstruct Info{\\n\\tull hash_1,hash_2;\\n};\\null HASH[SIZE][2],POW[SIZE][2];\\n\\nll T_length,H,digit;\\nll table[SIZE],ruisekiwa[SIZE];\\nvector<int> V;\\nchar T[SIZE];\\n\\nbool IS_SAME(Info left,Info right){\\n\\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nInfo calcHash(int left,int right){\\n\\n\\tInfo ret;\\n\\n\\tint length = right-left+1;\\n\\n\\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\\n\\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\\n\\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\\n\\n\\treturn ret;\\n}\\n\\n//AとBの一致長さを返す\\nll calc_match_len(int start_A,int start_B,int length){\\n\\n\\tll left = 0,right = length-1,mid = (left+right)/2;\\n\\tll match_len = 0;\\n\\tInfo tmp_A,tmp_B;\\n\\n\\twhile(left <= right){\\n\\n\\t\\ttmp_A = calcHash(start_A,start_A+mid);\\n\\t\\ttmp_B = calcHash(start_B,start_B+mid);\\n\\n\\t\\tif(IS_SAME(tmp_A,tmp_B)){\\n\\t\\t\\tmatch_len = mid+1;\\n\\t\\t\\tleft = mid+1;\\n\\t\\t}else{\\n\\t\\t\\tright = mid-1;\\n\\t\\t}\\n\\t\\tmid = (left+right)/2;\\n\\t}\\n\\n\\treturn match_len;\\n}\\n\\nbool compare(int a,int b){\\n\\n\\tll match_len = calc_match_len(a,b,digit);\\n\\n\\treturn T[a+match_len] < T[b+match_len];\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&T_length,&H);\\n\\n\\tscanf(\\\"%s\\\",T);\\n\\n\\tll num_zero = 0;\\n\\tfor(int i = 0; i < T_length; ){\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ti += 1;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tll count = 0;\\n\\t\\tfor(;i+count < T_length && T[i+count] == '0'; count++);\\n\\n\\t\\tnum_zero += (count*(count+1))/2;\\n\\t\\ti += count;\\n\\t}\\n\\n\\tif(num_zero >= H){\\n\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t//2通りのハッシュ値を計算する\\n\\tHASH[0][0] = 0;\\n\\tHASH[0][1] = 0;\\n\\tPOW[0][0] = 1;\\n\\tPOW[0][1] = 1;\\n\\n\\t//Tのハッシュ値を求める\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\t\\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\\n\\t\\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\\n\\n\\t\\tPOW[i][0] = POW[i-1][0]*NUM1;\\n\\t\\tPOW[i][1] = POW[i-1][1]*NUM2;\\n\\t}\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\truisekiwa[i] = 0; //桁iの数がいくつあるか\\n\\t}\\n\\n\\ttable[T_length] = T_length;\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ttable[i] = i;\\n\\t\\t}else{\\n\\n\\t\\t\\ttable[i] = table[i+1];\\n\\t\\t}\\n\\n\\t\\truisekiwa[T_length-table[i]]++;\\n\\t\\truisekiwa[0]--;\\n\\t}\\n\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\truisekiwa[i] += ruisekiwa[i+1];\\n\\t}\\n\\n\\tdigit = 0;\\n\\tll sum = num_zero;\\n\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\n\\t\\tif(sum+ruisekiwa[i] >= H){\\n\\t\\t\\tdigit = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tsum += ruisekiwa[i];\\n\\t}\\n\\n\\t//printf(\\\"sum:%lld digit:%lld\\\\n\\\",sum,digit);\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\tif(table[i]+digit > T_length)break;\\n\\n\\t\\tV.push_back(table[i]);\\n\\t}\\n\\n\\tsort(V.begin(),V.end(),compare);\\n\\n\\tfor(int i = 0; i < digit; i++){\\n\\n\\t\\tprintf(\\\"%c\\\",T[V[H-(sum+1)]+i]);\\n\\t}\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 8004,\n \"score_of_the_acc\": -0.8107,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3033_4217911\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\n#define NUM1 1000000009\\n#define NUM2 99999883\\n\\nstruct Info{\\n\\tull hash_1,hash_2;\\n};\\null HASH[SIZE][2],POW[SIZE][2];\\n\\nll T_length,H,range,max_range,last_range;\\nll Rank[SIZE]; //接尾辞文字列の開始位置iの、辞書順にsortした際の順位表\\nll Suffix_Array[SIZE]; //接尾辞文字列の開始位置<インデックス>→毎回、辞書順に開始位置をソートする\\nll Work[SIZE]; //作業用配列\\nll table[SIZE],ruisekiwa[SIZE];\\n\\nchar T[SIZE];\\n\\nbool IS_SAME(Info left,Info right){\\n\\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nInfo calcHash(int left,int right){\\n\\n\\tInfo ret;\\n\\n\\tint length = right-left+1;\\n\\n\\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\\n\\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\\n\\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\\n\\n\\treturn ret;\\n}\\n\\n//AとBの一致長さを返す\\nll calc_match_len(int start_A,int start_B,int length){\\n\\n\\tll left = 0,right = length-1,mid = (left+right)/2;\\n\\tll match_len = 0;\\n\\tInfo tmp_A,tmp_B;\\n\\n\\twhile(left <= right){\\n\\n\\t\\ttmp_A = calcHash(start_A,start_A+mid);\\n\\t\\ttmp_B = calcHash(start_B,start_B+mid);\\n\\n\\t\\tif(IS_SAME(tmp_A,tmp_B)){\\n\\t\\t\\tmatch_len = mid+1;\\n\\t\\t\\tleft = mid+1;\\n\\t\\t}else{\\n\\t\\t\\tright = mid-1;\\n\\t\\t}\\n\\t\\tmid = (left+right)/2;\\n\\t}\\n\\n\\treturn match_len;\\n}\\n\\n\\n//まずrank[a]とrank[b]を比較、等しければrank[a+range],rank[b+range]を比較\\nbool compare_Suffix_Array(int a,int b){\\n\\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\\n\\telse{\\n\\t\\tint rank_a = a + range <= T_length ? Rank[a + range]:-1; //rangeを足した部分が範囲外なら、最高にするため、rankを-1にする\\n\\t\\tint rank_b = b + range <= T_length ? Rank[b + range]:-1;\\n\\t\\treturn rank_a < rank_b;\\n\\t}\\n}\\n\\nbool final_compare_Suffix_Array(int a,int b){\\n\\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\\n\\telse{\\n\\n\\t\\tll len_A = T_length-Suffix_Array[a],len_B =T_length-Suffix_Array[b];\\n\\n\\t\\tll match_len = calc_match_len(Suffix_Array[a],Suffix_Array[b],min(len_A,len_B));\\n\\n\\t\\treturn T[Suffix_Array[a]+match_len] < T[Suffix_Array[b]+match_len];\\n\\t}\\n}\\n\\n//文字列Tの接尾辞配列を構築\\nvoid make_Suffix_Array(){\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\t\\tSuffix_Array[i] = table[i];\\n\\t\\tRank[table[i]] = i < T_length? (T[table[i]]-'0'):-1; //初期ランク設定:T[T_length]は空文字なので、最高となるように-1とする\\n\\t}\\n\\n\\t//range,2*range,4*range,とソート幅を次第に伸ばしていく\\n\\tfor(range = 1; range <= T_length; range*=2){\\n\\n\\t\\tif(2*range > max_range)break;\\n\\n\\t\\tsort(Suffix_Array,Suffix_Array+(T_length+1),compare_Suffix_Array); //range文字の幅でsuffix_Arrayをソート\\n\\n\\t\\tWork[Suffix_Array[0]] = 0;\\n\\t\\tfor(int i = 1; i <= T_length; i++){\\n\\t\\t\\tWork[Suffix_Array[i]] = Work[Suffix_Array[i-1]] + (compare_Suffix_Array(Suffix_Array[i-1],Suffix_Array[i])?1:0);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i <= T_length; i++){\\n\\t\\t\\tRank[i] = Work[i];\\n\\t\\t}\\n\\n\\t\\tlast_range = range;\\n\\t}\\n\\n\\tsort(Suffix_Array,Suffix_Array+(T_length+1),final_compare_Suffix_Array);\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&T_length,&H);\\n\\n\\tscanf(\\\"%s\\\",T);\\n\\n\\tll num_zero = 0;\\n\\tfor(int i = 0; i < T_length; ){\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ti += 1;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tll count = 0;\\n\\t\\tfor(;i+count < T_length && T[i+count] == '0'; count++);\\n\\n\\t\\tnum_zero += (count*(count+1))/2;\\n\\t\\ti += count;\\n\\t}\\n\\n\\tif(num_zero >= H){\\n\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t//2通りのハッシュ値を計算する\\n\\tHASH[0][0] = 0;\\n\\tHASH[0][1] = 0;\\n\\tPOW[0][0] = 1;\\n\\tPOW[0][1] = 1;\\n\\n\\t//Tのハッシュ値を求める\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\t\\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\\n\\t\\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\\n\\n\\t\\tPOW[i][0] = POW[i-1][0]*NUM1;\\n\\t\\tPOW[i][1] = POW[i-1][1]*NUM2;\\n\\t}\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\truisekiwa[i] = 0; //桁iの数がいくつあるか\\n\\t}\\n\\n\\ttable[T_length] = T_length;\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ttable[i] = i;\\n\\t\\t}else{\\n\\n\\t\\t\\ttable[i] = table[i+1];\\n\\t\\t}\\n\\n\\t\\truisekiwa[T_length-table[i]]++;\\n\\t\\truisekiwa[0]--;\\n\\t}\\n\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\truisekiwa[i] += ruisekiwa[i+1];\\n\\t}\\n\\n\\tll digit = 0;\\n\\tll sum = num_zero;\\n\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\n\\t\\tif(sum+ruisekiwa[i] >= H){\\n\\t\\t\\tdigit = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tsum += ruisekiwa[i];\\n\\t}\\n\\n\\tmax_range = digit;\\n\\tmake_Suffix_Array();\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\tll head = Suffix_Array[i];\\n\\n\\t\\tif(T_length-head < digit)continue;\\n\\n\\t\\tsum++;\\n\\t\\tif(sum == H){\\n\\n\\t\\t\\tfor(int k = 0; k < digit; k++){\\n\\n\\t\\t\\t\\tprintf(\\\"%c\\\",T[head+k]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6949152542372882,\n \"time_ms\": 70,\n \"memory_kb\": 9816,\n \"score_of_the_acc\": -0.9379,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3033_4217906\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 100005\\n\\n#define NUM1 1000000007\\n#define NUM2 99999883\\n\\nstruct Info{\\n\\tull hash_1,hash_2;\\n};\\null HASH[SIZE][2],POW[SIZE][2];\\n\\nll T_length,H,range,max_range,last_range;\\nll Rank[SIZE]; //接尾辞文字列の開始位置iの、辞書順にsortした際の順位表\\nll Suffix_Array[SIZE]; //接尾辞文字列の開始位置<インデックス>→毎回、辞書順に開始位置をソートする\\nll Work[SIZE]; //作業用配列\\nll table[SIZE],ruisekiwa[SIZE];\\n\\nchar T[SIZE];\\n\\nbool IS_SAME(Info left,Info right){\\n\\tif(left.hash_1 == right.hash_1 && left.hash_2 == right.hash_2)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nInfo calcHash(int left,int right){\\n\\n\\tInfo ret;\\n\\n\\tint length = right-left+1;\\n\\n\\t//indexのずれに注意:T[right]までのハッシュ値はHASH[right+1]に記録されている\\n\\tret.hash_1 = HASH[right+1][0]-HASH[left][0]*POW[length][0];\\n\\tret.hash_2 = HASH[right+1][1]-HASH[left][1]*POW[length][1];\\n\\n\\treturn ret;\\n}\\n\\n//AとBの一致長さを返す\\nll calc_match_len(int start_A,int start_B,int length){\\n\\n\\tll left = 0,right = length-1,mid = (left+right)/2;\\n\\tll match_len = 0;\\n\\tInfo tmp_A,tmp_B;\\n\\n\\twhile(left <= right){\\n\\n\\t\\ttmp_A = calcHash(start_A,start_A+mid);\\n\\t\\ttmp_B = calcHash(start_B,start_B+mid);\\n\\n\\t\\tif(IS_SAME(tmp_A,tmp_B)){\\n\\t\\t\\tmatch_len = mid+1;\\n\\t\\t\\tleft = mid+1;\\n\\t\\t}else{\\n\\t\\t\\tright = mid-1;\\n\\t\\t}\\n\\t\\tmid = (left+right)/2;\\n\\t}\\n\\n\\treturn match_len;\\n}\\n\\n\\n//まずrank[a]とrank[b]を比較、等しければrank[a+range],rank[b+range]を比較\\nbool compare_Suffix_Array(int a,int b){\\n\\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\\n\\telse{\\n\\t\\tint rank_a = a + range <= T_length ? Rank[a + range]:-1; //rangeを足した部分が範囲外なら、最高にするため、rankを-1にする\\n\\t\\tint rank_b = b + range <= T_length ? Rank[b + range]:-1;\\n\\t\\treturn rank_a < rank_b;\\n\\t}\\n}\\n\\nbool final_compare_Suffix_Array(int a,int b){\\n\\tif(Rank[a] != Rank[b])return Rank[a] < Rank[b];\\n\\telse{\\n\\n\\t\\tll len_A = T_length-Suffix_Array[a],len_B =T_length-Suffix_Array[b];\\n\\n\\t\\tll match_len = calc_match_len(Suffix_Array[a],Suffix_Array[b],min(len_A,len_B));\\n\\n\\t\\treturn T[Suffix_Array[a]+match_len] < T[Suffix_Array[b]+match_len];\\n\\t}\\n}\\n\\n//文字列Tの接尾辞配列を構築\\nvoid make_Suffix_Array(){\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\t\\tSuffix_Array[i] = table[i];\\n\\t\\tRank[table[i]] = i < T_length? (T[table[i]]-'0'):-1; //初期ランク設定:T[T_length]は空文字なので、最高となるように-1とする\\n\\t}\\n\\n\\t//range,2*range,4*range,とソート幅を次第に伸ばしていく\\n\\tfor(range = 1; range <= T_length; range*=2){\\n\\n\\t\\tif(2*range > max_range)break;\\n\\n\\t\\tsort(Suffix_Array,Suffix_Array+(T_length+1),compare_Suffix_Array); //range文字の幅でsuffix_Arrayをソート\\n\\n\\t\\tWork[Suffix_Array[0]] = 0;\\n\\t\\tfor(int i = 1; i <= T_length; i++){\\n\\t\\t\\tWork[Suffix_Array[i]] = Work[Suffix_Array[i-1]] + (compare_Suffix_Array(Suffix_Array[i-1],Suffix_Array[i])?1:0);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i <= T_length; i++){\\n\\t\\t\\tRank[i] = Work[i];\\n\\t\\t}\\n\\n\\t\\tlast_range = range;\\n\\t}\\n\\n\\tsort(Suffix_Array,Suffix_Array+(T_length+1),final_compare_Suffix_Array);\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&T_length,&H);\\n\\n\\tscanf(\\\"%s\\\",T);\\n\\n\\tll num_zero = 0;\\n\\tfor(int i = 0; i < T_length; ){\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ti += 1;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tll count = 0;\\n\\t\\tfor(;i+count < T_length && T[i+count] == '0'; count++);\\n\\n\\t\\tnum_zero += (count*(count+1))/2;\\n\\t\\ti += count;\\n\\t}\\n\\n\\tif(num_zero >= H){\\n\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t//2通りのハッシュ値を計算する\\n\\tHASH[0][0] = 0;\\n\\tHASH[0][1] = 0;\\n\\tPOW[0][0] = 1;\\n\\tPOW[0][1] = 1;\\n\\n\\t//Tのハッシュ値を求める\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\t\\tHASH[i][0] = T[i-1] + HASH[i-1][0]*NUM1;\\n\\t\\tHASH[i][1] = T[i-1] + HASH[i-1][1]*NUM2;\\n\\n\\t\\tPOW[i][0] = POW[i-1][0]*NUM1;\\n\\t\\tPOW[i][1] = POW[i-1][1]*NUM2;\\n\\t}\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\truisekiwa[i] = 0; //桁iの数がいくつあるか\\n\\t}\\n\\n\\ttable[T_length] = T_length;\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\tif(T[i] != '0'){\\n\\n\\t\\t\\ttable[i] = i;\\n\\t\\t}else{\\n\\n\\t\\t\\ttable[i] = table[i+1];\\n\\t\\t}\\n\\n\\t\\truisekiwa[T_length-table[i]]++;\\n\\t\\truisekiwa[0]--;\\n\\t}\\n\\n\\tfor(int i = T_length-1; i >= 0; i--){\\n\\n\\t\\truisekiwa[i] += ruisekiwa[i+1];\\n\\t}\\n\\n\\tll digit = 0;\\n\\tll sum = num_zero;\\n\\n\\tfor(int i = 1; i <= T_length; i++){\\n\\n\\t\\tif(sum+ruisekiwa[i] >= H){\\n\\t\\t\\tdigit = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tsum += ruisekiwa[i];\\n\\t}\\n\\n\\tmax_range = digit;\\n\\tmake_Suffix_Array();\\n\\n\\tfor(int i = 0; i <= T_length; i++){\\n\\n\\t\\tll head = Suffix_Array[i];\\n\\n\\t\\tif(T_length-head < digit)continue;\\n\\n\\t\\tsum++;\\n\\t\\tif(sum == H){\\n\\n\\t\\t\\tfor(int k = 0; k < digit; k++){\\n\\n\\t\\t\\t\\tprintf(\\\"%c\\\",T[head+k]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6949152542372882,\n \"time_ms\": 70,\n \"memory_kb\": 9772,\n \"score_of_the_acc\": -0.932,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3033_4102645\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <list>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n#include <cassert>\\n#include <random>\\n\\nvoid set_rank(std::vector<int>& rank, const std::vector<int>& sorted_indices, const std::vector<long long int>& compare_value) {\\n\\trank[sorted_indices.front()] = 0;\\n\\tfor (auto i = 1; i < sorted_indices.size(); ++i) {\\n\\t\\trank[sorted_indices[i]] = rank[sorted_indices[i - 1]] + (compare_value[sorted_indices[i]] == compare_value[sorted_indices[i - 1]] ? 0 : 1);\\n\\t}\\n}\\nstd::vector<int> make_suffix_array(const std::string& str) {\\n\\tstd::vector<int> rank(str.size()), indices(str.size());\\n\\tstd::vector<long long int> compare_value(str.size());\\n\\tstd::iota(indices.begin(), indices.end(), 0);\\n\\tstd::copy(str.begin(), str.end(), compare_value.begin());\\n\\tconst auto comparator = [&compare_value](int i, int j) {return compare_value[i] < compare_value[j]; };\\n\\tstd::sort(indices.begin(), indices.end(), comparator);\\n\\tset_rank(rank, indices, compare_value);\\n\\tfor (auto i = 0; (1 << i) < str.size(); ++i) {\\n\\t\\tfor (auto j = 0; j < str.size(); ++j) {\\n\\t\\t\\tcompare_value[j] = rank[j] * (str.size() + 1LL) + (j + (1 << i) < str.size() ? rank[j + (1 << i)] : -1);\\n\\t\\t}\\n\\t\\tstd::sort(indices.begin(), indices.end(), comparator);\\n\\t\\tset_rank(rank, indices, compare_value);\\n\\t}\\n\\treturn indices;\\n}\\ntemplate<typename Idx, typename F>\\nint upper_bound(Idx from, Idx until, const F& predicate) {\\n\\twhile (from < until) {\\n\\t\\tconst auto mid = (from + until) / 2;\\n\\t\\tif (predicate(mid)) until = mid;\\n\\t\\telse from = mid + 1;\\n\\t}\\n\\treturn until;\\n}\\n\\n\\nint main() {\\n\\tint n; long long int h; std::cin >> n >> h;\\n\\tstd::string str; std::cin >> str;\\n\\tstd::vector<int> next_positive(n, 0);\\n\\tfor (auto i = 0; i < str.size(); ++i) if (str[i] == '0') next_positive[i] = 1;\\n\\tfor (auto i = 2; i <= str.size(); ++i) if (str[str.size() - i] == '0') next_positive[str.size() - i] += next_positive[str.size() - i + 1];\\n\\tstd::vector<long long int> substrings(n + 1, 0);\\n\\tlong long int for_zero = 0;\\n\\tfor (auto i = 0; i < next_positive.size(); ++i) {\\n\\t\\tconst auto head = next_positive[i] + i;\\n\\t\\tif (head != n) substrings[n - head]++;\\n\\t\\tif (i == 0 || str[i - 1] != '0') {\\n\\t\\t\\tfor_zero += next_positive[i] * (next_positive[i] + 1LL) >> 1;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = substrings.size() - 2; i > 0; --i) substrings[i] += substrings[i + 1];\\n\\tfor (auto i = 1; i < substrings.size(); ++i) substrings[i] += substrings[i - 1];\\n\\tconst auto length = std::distance(substrings.begin(), std::lower_bound(substrings.begin(), substrings.end(), h - for_zero));\\n\\tif (length == 0) {\\n\\t\\tstd::cout << \\\"0\\\\n\\\";\\n\\t}else {\\n\\t\\tconst auto sa = make_suffix_array(str);\\n\\t\\tconst auto rank = h - substrings[length - 1] - for_zero;\\n\\t\\tstd::vector<int> substr, multipler(n, 0);\\n\\t\\tfor (const auto i : sa) {\\n\\t\\t\\tif (str[i] == '0') {\\n\\t\\t\\t\\tconst auto head = i + next_positive[i];\\n\\t\\t\\t\\tif (head != n) multipler[head]++;\\n\\t\\t\\t}else if (0 <= i && i <= n - length) {\\n\\t\\t\\t\\twhile (multipler[i]-- >= 0) substr.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::cout << str.substr(substr[rank - 1], length) << std::endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5860,\n \"score_of_the_acc\": -0.2268,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3033_3407704\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\n\\n\\nll n,k,h,ran[101010],tmp[101010],sa[101010];\\n\\nbool compare_sa(int i,int j){\\n if(ran[i]!=ran[j])return ran[i]<ran[j];\\n int ri = (i+k<=n?ran[i+k] : -1);\\n int rj = (j+k<=n?ran[j+k] : -1);\\n return ri<rj;\\n}\\n\\nvoid constract_sa(string&s){\\n rep(i,n+1){\\n sa[i]=i;\\n ran[i]=(i<n?s[i] : -1);\\n }\\n for(k=1 ; k<=n ;k*=2 ){\\n sort(sa,sa+n+1,compare_sa);\\n tmp[sa[0]]=0;\\n rep(i,n){\\n tmp[sa[i+1]]=tmp[sa[i]]+compare_sa(sa[i],sa[i+1]);\\n }\\n rep(i,n+1)ran[i]=tmp[i];\\n }\\n}\\nint main(){\\n cin>>n>>h;\\n string s;\\n cin>>s;\\n bool all_zero=true;\\n rep(i,n)if(s[i]!='0')all_zero=false;\\n if(all_zero){\\n cout<<0<<endl;\\n return 0;\\n }\\n vector<int> nonzero(n,-1);\\n nonzero[0]=-1;\\n reverse(s.begin(),s.end());\\n rep(i,n){\\n if(s[i]!='0')nonzero[i]=i;\\n else if(i!=0) nonzero[i]=nonzero[i-1];\\n }\\n reverse(s.begin(),s.end());\\n vector<ll> cnt(n+1);\\n rep(i,n){\\n cnt[nonzero[i]+1]++;\\n }\\n rep(i,n-1)cnt[n-i-1]+=cnt[n-i];\\n rep(i,n)if(nonzero[i]!=-1)cnt[0]+=i-nonzero[i];\\n int keta=0;\\n while(h-cnt[keta]>0){\\n h-=cnt[keta];\\n ++keta;\\n }\\n if(!keta){\\n cout<<0<<endl;\\n return 0;\\n }\\n constract_sa(s);\\n rep(i,n+1)sa[ran[i]]=i;\\n vector<int> cnt2(n+1);\\n rep(i,n)cnt2[n-nonzero[i]-1]++;\\n int ans=-1;\\n rep(i,n+1){\\n if(n-sa[i]<keta)continue;\\n if(h<=cnt2[sa[i]]){\\n ans=sa[i];\\n break;\\n }\\n h-=cnt2[sa[i]];\\n }\\n cout<<s.substr(ans,keta)<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 6776,\n \"score_of_the_acc\": -0.5859,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3033_3407611\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cstdlib>\\n#define int long long\\n#define rep(i, n) for(i = 0; i < n; i++)\\nusing namespace std;\\n\\nint n, h;\\nstring s;\\nint cnts[100001];\\t\\t//cnts[i] = i桁(no leading 0)の数がいくつあるか. \\\"0\\\"や\\\"00\\\"は0桁としてカウント.\\nint begin_cnts[100001];\\n\\n//spagetti-source, 動く形に書き直すのが難しかった()\\nstruct SAComp {\\n const int h, *g;\\n SAComp(int h, int* g) : h(h), g(g) {}\\n bool operator() (int a, int b) {\\n return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a+h] < g[b+h];\\n }\\n};\\nvector<int> construct_sa(string s) {\\n int n = s.length();\\n int *g = new int[n+1];\\n int *b = new int[n+1];\\n int *v = new int[n+1];\\n int i;\\n rep(i,n+1) v[i] = i, g[i] = s[i];\\n b[0] = 0; b[n] = 0;\\n\\n sort(v, v+n+1, SAComp(0, g));\\n for(int h = 1; b[n] != n ; h *= 2) {\\n SAComp comp(h, g);\\n sort(v, v+n+1, comp);\\n rep(i, n) b[i+1] = b[i] + comp(v[i], v[i+1]);\\n rep(i, n+1) g[v[i]] = b[i];\\n }\\n delete[] g;\\n delete[] b;\\n \\n vector<int> ret;\\n rep(i, n + 1) ret.push_back(v[i]);\\n delete[] v;\\n return ret;\\n}\\n\\n/*vector<int> construct_sa(string &s) {\\n\\tvector<string> vs;\\n\\tint i, j;\\n\\t\\n\\trep(i, s.length() + 1) {\\n\\t\\tstring suf;\\n\\t\\tfor (j = i; j < s.length(); j++) suf += s[j];\\n\\t\\tvs.push_back(suf);\\n\\t}\\n\\tsort(vs.begin(), vs.end());\\n\\t\\n\\tvector<int> sa;\\n\\trep(i, vs.size()) sa.push_back(s.length() - vs[i].length());\\n\\treturn sa;\\n}*/\\n\\nsigned main() {\\n\\tint i, j;\\n\\t\\n\\tcin >> n >> h >> s;\\n\\t\\n\\tj = 0;\\n\\trep(i, n) {\\n\\t\\tif (j < i) j = i;\\n\\t\\tfor (; j < n; j++) if (s[j] != '0') break;\\n\\t\\t\\n\\t\\tcnts[0] += j - i;\\n\\t\\tcnts[1] -= j - i;\\n\\t\\tcnts[1] += 1;\\n\\t\\tcnts[n - j + 1] -= 1;\\n\\t}\\n\\trep(i, n) cnts[i + 1] += cnts[i];\\n\\t\\n\\tint cnt = 0;\\n\\trep(i, n + 1) {\\n\\t\\tcnt += cnts[i];\\n\\t\\tif (cnt >= h) break;\\n\\t}\\n\\t\\n\\tint keta = i;\\n\\tif (keta == 0) { cout << 0 << endl; return 0; }\\n\\t\\n\\tcnt = 0;\\n\\trep(i, keta) { cnt += cnts[i]; }\\n\\th = h - cnt;\\n\\t\\n\\tj = n - keta;\\n\\tfor (i = n - keta; i >= 0; i--) {\\n\\t\\tif (s[i] == '0') continue;\\n\\t\\tif (j >= i) j = i - 1;\\n\\t\\tfor (; j >= 0; j--) if (s[j] != '0') break;\\n\\t\\tbegin_cnts[i] = i - j;\\n\\t}\\n\\t\\n\\tvector<int> sa = construct_sa(s);\\n\\t\\n\\t//rep(i, sa.size()) cout << \\\"sa[\\\" << i << \\\"] = \\\" << sa[i] << endl;\\n\\t\\n\\trep(i, sa.size()) {\\n\\t\\tif (sa[i] == s.length()) continue;\\t//空文字列\\n\\t\\tif (s[sa[i]] == '0') continue;\\t\\t//先頭が0のものは無視\\n\\t\\th -= begin_cnts[sa[i]];\\t\\t\\t\\t//[0…0], s[sa[i]], …であって、桁数= ketaになるパターン数\\n\\t\\tif (h <= 0) break;\\n\\t}\\n\\t\\n\\tint offset = sa[i];\\n\\tstring ans;\\n\\trep(i, keta) ans += s[offset + i];\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6836,\n \"score_of_the_acc\": -0.3587,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3033_3213985\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <iostream>\\n#include <cmath>\\n#include <bitset>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <unordered_map>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef pair<int, int> P;\\nint n, k;\\nint rk[100002];\\nint tmp[100002];\\n\\nbool compare_sa(int i, int j){\\n if(rk[i]!=rk[j]) return rk[i]<rk[j];\\n else{\\n int ri, rj;\\n if(i+k<=n) ri=rk[i+k];\\n else ri=-1;\\n if(j+k<=n) rj=rk[j+k];\\n else rj=-1;\\n return ri<rj;\\n }\\n}\\n\\nvoid construct_sa(string s, int *sa){\\n n=s.size();\\n for(int i=0; i<=n; i++){\\n sa[i]=i;\\n if(i<n){\\n rk[i]=s[i]-'0';\\n }else{\\n rk[i]=-1;\\n }\\n }\\n for(k=1; k<=n; k*=2){\\n sort(sa, sa+n+1, compare_sa);\\n tmp[sa[0]]=0;\\n for(int i=1; i<=n; i++){\\n tmp[sa[i]]=tmp[sa[i-1]];\\n if(compare_sa(sa[i-1], sa[i])) tmp[sa[i]]++;\\n }\\n for(int i=0; i<=n; i++) rk[i]=tmp[i];\\n }\\n}\\n\\nint main()\\n{\\n\\tll h;\\n cin>>n>>h;\\n string s;\\n cin>>s;\\n ll w[100001]={}, ws[100001];\\n ws[0]=0;\\n ll ct=0;\\n ll z=0;\\n for(int i=0; i<n; i++){\\n if(s[i]=='0'){\\n ct++;\\n }else{\\n w[i]=ct+1;\\n z+=ct*(ct+1)/2;\\n ct=0;\\n }\\n }\\n w[n]=ct+1;\\n z+=ct*(ct+1)/2;\\n if(h<=z){\\n cout<<0<<endl;\\n return 0;\\n }\\n ws[0]=0;\\n for(int i=1; i<=n; i++) ws[i]=ws[i-1]+w[i-1];\\n h-=z;\\n int sa[100001];\\n construct_sa(s, sa);\\n //for(int i=0; i<=n; i++) cout<<sa[i]<<\\\" \\\";\\n //cout<<endl;\\n for(int d=1; d<=n; d++){\\n if(ws[n-d+1]<h){\\n h-=ws[n-d+1];\\n continue;\\n }\\n for(int i=1; i<=n; i++){\\n if(sa[i]>n-d || s[sa[i]]=='0') continue;\\n if(h<=w[sa[i]]){\\n for(int j=0; j<d; j++) cout<<s[sa[i]+j];\\n cout<<endl;\\n return 0;\\n }\\n h-=w[sa[i]];\\n }\\n }\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5992,\n \"score_of_the_acc\": -0.4211,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3033_3042308\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct SuffixArray{\\n Int n,k;\\n string S;\\n vector<Int> sa,lcp;\\n SuffixArray(){}\\n SuffixArray(string& S):S(S){init();}\\n void init(){\\n n=S.length();\\n S.push_back('$');\\n build_sa();\\n }\\n void build_sa(){\\n sa.clear();\\n sa.resize(n+1,0);\\n iota(sa.begin(),sa.end(),0);\\n sort(sa.begin(),sa.end(),\\n\\t [&](Int a,Int b){\\n\\t if(S[a]==S[b]) return a>b;\\n\\t return S[a]<S[b];\\n\\t });\\n vector<Int> c(n+1,0),r(n+1),cnt(n+1),s(n+1);\\n for(Int i=0;i<=n;i++) r[i]=S[i];\\n for(Int len=1;len<=n;len*=2){\\n for(Int i=0;i<=n;i++){\\n\\t c[sa[i]]=\\n\\t i>0 &&\\n\\t r[sa[i-1]]==r[sa[i]] &&\\n\\t sa[i-1]+len<=n &&\\n\\t r[sa[i-1]+len/2]==r[sa[i]+len/2] ?\\n\\t c[sa[i-1]]:i;\\n }\\n iota(cnt.begin(),cnt.end(),0);\\n copy(sa.begin(),sa.end(),r.begin());\\n for(Int i=0;i<=n;i++){\\n\\tInt s1=r[i]-len;\\n\\tif(s1>=0) sa[cnt[c[s1]]++]=s1;\\n }\\n c.swap(r);\\n }\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,k;\\n string s;\\n cin>>n>>k>>s;\\n auto calc=[](Int x){return x*(x+1)/2;};\\n Int zs=0;\\n vector<Int> cnt(n+1,1);\\n for(Int i=0;i<n;i++){\\n if(s[i]=='0'){\\n if(i+1>=n||s[i+1]!='0') zs+=calc(cnt[i]);\\n if(i+1<n) cnt[i+1]+=cnt[i];\\n cnt[i]=0;\\n }\\n }\\n if(k<=zs){\\n cout<<0<<endl;\\n return 0;\\n }\\n k-=zs+1;\\n vector<Int> sum(n+1,0);\\n for(Int i=0;i<n;i++) sum[i+1]=sum[i]+cnt[i];\\n Int len=1;\\n while(k>=sum[n+1-len]&&len<n) k-=sum[n+1-(len++)];\\n SuffixArray sa(s);\\n Int pos=0;\\n for(Int i=1;i<=n;i++){\\n if(s[sa.sa[i]]=='0'||sa.sa[i]+len>n) continue;\\n //cout<<len<<\\\" \\\"<<i<<\\\" \\\"<<k<<endl;\\n if(k>=0) pos=sa.sa[i];\\n k-=cnt[sa.sa[i]];\\n }\\n cout<<s.substr(pos,len)<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8460,\n \"score_of_the_acc\": -0.5194,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3033_2787093\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n\\nstruct SuffixArray {\\n int N, k;\\n vector<int> rank, sa;\\n string s;\\n\\n SuffixArray(string t) {\\n s = t, k = 1, N = t.length();\\n rank = sa = vector<int>(N+1);\\n build();\\n }\\n\\n bool compare_sa(int i, int j) {\\n if(rank[i] != rank[j]) return rank[i] < rank[j];\\n else {\\n int vi = (i+k <= N ? rank[i+k] : -1);\\n int vj = (j+k <= N ? rank[j+k] : -1);\\n return vi < vj;\\n }\\n }\\n\\n void build() {\\n for(int i=0; i<=N; i++) {\\n sa[i] = i;\\n rank[i] = (i < N ? s[i] : -1);\\n }\\n\\n for(k=1; k<=N; k*=2) {\\n sort(sa.begin(), sa.end(), [&](int i, int j) {\\n return compare_sa(i, j);\\n });\\n\\n vector<int> tmp(N+1, 0);\\n tmp[ sa[0] ] = 0;\\n for(int i=1; i<=N; i++) {\\n tmp[ sa[i] ] = tmp[ sa[i-1] ] + (compare_sa(sa[i-1], sa[i]) ? 1 : 0);\\n }\\n\\n swap(rank, tmp);\\n }\\n }\\n\\n string get_substr(int idx) {\\n return s.substr(sa[idx]);\\n }\\n\\n void output() {\\n for(int i=0; i<=N; i++) {\\n fprintf(stderr, \\\"idx = %d, str = %s\\\\n\\\", i, get_substr(i).c_str());\\n }\\n }\\n\\n int operator[](int idx) const {\\n return sa[idx];\\n }\\n};\\n\\nconst int SIZE = 1 << 17;\\nstruct segtree {\\n long long int node[2*SIZE];\\n segtree() {\\n fill(node, node+2*SIZE, 0);\\n }\\n void update(int idx, long long int val) {\\n idx += SIZE - 1;\\n node[idx] += val;\\n while(idx > 0) {\\n idx = (idx - 1) / 2;\\n node[idx] = node[2*idx+1] + node[2*idx+2];\\n }\\n }\\n long long int query(int a, int b, int l=0, int r=SIZE, int k=0) {\\n if(b <= l || r <= a) return 0;\\n if(a <= l && r <= b) return node[k];\\n int mid = (l + r) / 2;\\n long long int vl = query(a, b, l, mid, 2*k+1);\\n long long int vr = query(a, b, mid, r, 2*k+2);\\n return vl + vr;\\n }\\n};\\n\\nsegtree seg;\\nint main() {\\n int N;\\n long long int H; cin >> N >> H;\\n\\n string s; cin >> s;\\n SuffixArray suf(s);\\n // suf.output();\\n\\n int len = s.length(), cnt_zero = 0;\\n vector<long long int> weight(len);\\n for(size_t i=0; i<s.length(); i++) {\\n if(s[i] == '0') {\\n cnt_zero++;\\n H -= cnt_zero;\\n }\\n else {\\n weight[i] = cnt_zero + 1;\\n // printf(\\\"weight[%zu] = %d\\\\n\\\", i, weight[i]);\\n cnt_zero = 0;\\n }\\n }\\n\\n if(H <= 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n else {\\n vector<int> order;\\n for(int i=0; i<=len; i++) {\\n if(suf[i] >= len || s[ suf[i] ] == '0') continue;\\n else {\\n order.push_back(i);\\n }\\n }\\n\\n vector<int> end_point[100010];\\n for(auto x : order) {\\n seg.update(x, weight[ suf[x] ]);\\n // printf(\\\"pos = %d, end_point = %d, weight = %lld\\\\n\\\", x, N-suf[x], weight[ suf[x] ]);\\n end_point[N - suf[x]].push_back(x);\\n }\\n\\n int step = 1;\\n for(; H > seg.query(0, len+1); step++) {\\n H -= seg.query(0, len+1);\\n for(auto v : end_point[step]) {\\n seg.update(v, -weight[ suf[v] ]);\\n }\\n }\\n\\n int ub = len+1, lb = 0;\\n while(ub - lb > 1) {\\n int mid = (ub + lb) / 2;\\n // printf(\\\"mid = %d, val = %lld\\\\n\\\", mid, seg.query(0, mid));\\n if(H <= seg.query(0, mid)) ub = mid;\\n else lb = mid;\\n }\\n\\n // printf(\\\"H = %lld, lb = %d, step = %d\\\\n\\\", H, lb, step);\\n cout << s.substr(suf[lb], step) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 12452,\n \"score_of_the_acc\": -1.3529,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3033_2771312\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define rep(i,n) for (int i=0;i<(n);i++)\\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\\n\\nusing ll = long long;\\nusing Pll = pair<ll, ll>;\\n\\nclass SuffixArray {\\nprivate:\\n string s;\\n int n;\\n vector<int> rank;\\n vector<int> sa;\\npublic:\\n SuffixArray(string _s) : s(_s) {\\n n = s.size();\\n rank.resize(n + 1);\\n sa.resize(n + 1);\\n construct();\\n }\\n vector<int> construct() {\\n for (int i = 0; i <= n; ++i) {\\n sa[i] = i;\\n rank[i] = i < n ? s[i] : -1;\\n }\\n\\n int k;\\n auto compare = [&](int i, int j) {\\n if (rank[i] != rank[j]) return rank[i] < rank[j];\\n else {\\n int ri = i + k <= n ? rank[i + k] : -1;\\n int rj = j + k <= n ? rank[j + k] : -1;\\n return ri < rj;\\n }\\n };\\n\\n vector<int> tmp(n + 1);\\n for (k = 1; k <= n; k *= 2) {\\n sort(sa.begin(), sa.end(), compare);\\n\\n tmp[sa[0]] = 0;\\n for (int i = 1; i <= n; ++i) {\\n tmp[sa[i]] = tmp[sa[i - 1]] + (compare(sa[i - 1], sa[i]) ? 1 : 0);\\n }\\n for (int i = 0; i <= n; ++i) {\\n rank[i] = tmp[i];\\n }\\n }\\n return sa;\\n }\\n};\\n\\nint main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int n;\\n ll k;\\n cin >> n >> k;\\n string s;\\n cin >> s;\\n vector<ll> lead(n + 1); // leading zero\\n rep2(i, 1, n + 1) {\\n if (s[i - 1] == '0') {\\n lead[i] = lead[i - 1] + 1;\\n }\\n }\\n\\n ll num_zero = accumulate(lead.begin(), lead.end(), 0ll);\\n k -= num_zero;\\n if (k <= 0) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n auto f = [&](ll m) {\\n ll a = 0;\\n rep(i, n) {\\n if (s[i] != '0') {\\n a += (lead[i] + 1) * min<ll>(n - i, m);\\n }\\n }\\n return a;\\n };\\n\\n ll l = 0, r = n;\\n while (r - l > 1) {\\n ll m = (l + r) / 2;\\n if (k <= f(m)) r = m;\\n else l = m;\\n }\\n\\n ll len = r;\\n ll kk = k - f(len - 1);\\n SuffixArray suf(s);\\n vector<int> sa = suf.construct();\\n rep2(i, 1, sa.size()) {\\n if (sa[i] == n || s[sa[i]] == '0' || n - sa[i] < len) continue;\\n int num = lead[sa[i]] + 1;\\n kk -= num;\\n if (kk <= 0) {\\n cout << s.substr(sa[i], len) << endl;\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 5516,\n \"score_of_the_acc\": -0.5921,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3033_2761720\",\n \"code_snippet\": \"#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\\nvector<ll> suffix_array(const string &S) {\\n ll n = S.length(), k = 1;\\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\\n\\n auto compare_sa = [&](ll i, ll j) {\\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\\n ll ri = i + k <= n ? rnk[i + k] : -1;\\n ll rj = j + k <= n ? rnk[j + k] : -1;\\n return ri < rj;\\n };\\n\\n REP(i, 0, n + 1) sa[i] = i;\\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\\n\\n for(; k <= n; k *= 2) {\\n sort(sa.begin(), sa.end(), compare_sa);\\n tmp[sa[0]] = 0;\\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\\n REP(i, 0, n + 1) rnk[i] = tmp[i];\\n }\\n\\n return sa;\\n}\\n\\nint main(void) {\\n ll N, H;\\n string S;\\n cin >> N >> H >> S;\\n\\n vector<ll> a(N, 0);\\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\\n\\n vector<ll> imos(N + 2, 0);\\n REP(i, 0, N) {\\n if(S[i] != '0') {\\n imos[1] += a[i] + 1;\\n imos[N - i + 1] -= a[i] + 1;\\n } else {\\n imos[1] += a[i] + 1;\\n imos[2] -= a[i] + 1;\\n }\\n }\\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\\n\\n ll x = 1, cnt = 1;\\n while(1) {\\n if(cnt <= H && H < cnt + imos[x]) break;\\n cnt += imos[x];\\n x++;\\n }\\n\\n vector<ll> sa = suffix_array(S);\\n REP(i, 1, N + 1) {\\n ll j = sa[i];\\n if((x == 1 || S[j] != '0') && j + x <= N) {\\n if(cnt <= H && H < cnt + a[j] + 1) {\\n cout << S.substr(j, x) << endl;\\n break;\\n }\\n cnt += a[j] + 1;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6908,\n \"score_of_the_acc\": -0.4861,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3033_2761499\",\n \"code_snippet\": \"#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\\nvector<ll> construct_suffix_array(const string &S) {\\n ll n = S.length(), k = 1;\\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\\n\\n auto compare_sa = [&](const ll& i, const ll& j) {\\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\\n ll ri = i + k <= n ? rnk[i + k] : -1;\\n ll rj = j + k <= n ? rnk[j + k] : -1;\\n return ri < rj;\\n };\\n\\n REP(i, 0, n + 1) sa[i] = i;\\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\\n\\n for(; k <= n; k *= 2) {\\n sort(sa.begin(), sa.end(), compare_sa);\\n tmp[sa[0]] = 0;\\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\\n REP(i, 0, n + 1) rnk[i] = tmp[i];\\n }\\n\\n return sa;\\n}\\n\\nint main(void) {\\n ll N, H;\\n string S;\\n cin >> N >> H >> S;\\n\\n vector<ll> a(N, 0);\\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\\n\\n vector<ll> imos(N + 2, 0);\\n REP(i, 0, N) {\\n if(S[i] != '0') {\\n imos[1] += a[i] + 1;\\n imos[N - i + 1] -= a[i] + 1;\\n } else {\\n imos[1] += a[i] + 1;\\n imos[2] -= a[i] + 1;\\n }\\n }\\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\\n\\n ll x = 1, cnt = 1;\\n while(1) {\\n if(cnt <= H && H < cnt + imos[x]) break;\\n cnt += imos[x];\\n x++;\\n }\\n\\n vector<ll> sa = construct_suffix_array(S);\\n REP(i, 1, N + 1) {\\n ll j = sa[i];\\n if((x == 1 || S[j] != '0') && j + x <= N) {\\n if(cnt <= H && H < cnt + a[j] + 1) {\\n cout << S.substr(j, x) << endl;\\n break;\\n }\\n cnt += a[j] + 1;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6880,\n \"score_of_the_acc\": -0.4823,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3033_2761493\",\n \"code_snippet\": \"#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\\nvector<ll> construct_suffix_array(const string &S) {\\n ll n = S.length(), k = 1;\\n vector<ll> sa(n + 1), rnk(n + 1), tmp(n + 1);\\n\\n auto compare_sa = [&](const ll &i, const ll &j) {\\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\\n ll ri = i + k <= n ? rnk[i + k] : -1;\\n ll rj = j + k <= n ? rnk[j + k] : -1;\\n return ri < rj;\\n };\\n\\n REP(i, 0, n + 1) sa[i] = i;\\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\\n\\n for(; k <= n; k *= 2) {\\n sort(sa.begin(), sa.end(), compare_sa);\\n tmp[sa[0]] = 0;\\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\\n REP(i, 0, n + 1) rnk[i] = tmp[i];\\n }\\n\\n return sa;\\n}\\n\\nint main(void) {\\n ll N, H;\\n string S;\\n cin >> N >> H >> S;\\n\\n vector<ll> a(N, 0);\\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\\n\\n vector<ll> imos(N + 2, 0);\\n REP(i, 0, N) {\\n if(S[i] != '0') {\\n imos[1] += a[i] + 1;\\n imos[N - i + 1] -= a[i] + 1;\\n } else {\\n imos[1] += a[i] + 1;\\n imos[2] -= a[i] + 1;\\n }\\n }\\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\\n\\n ll x = 1, cnt = 1;\\n while(1) {\\n if(cnt <= H && H < cnt + imos[x]) break;\\n cnt += imos[x];\\n x++;\\n }\\n\\n vector<ll> sa = construct_suffix_array(S);\\n REP(i, 1, N + 1) {\\n ll j = sa[i];\\n if((x == 1 || S[j] != '0') && j + x <= N) {\\n if(cnt <= H && H < cnt + a[j] + 1) {\\n cout << S.substr(j, x) << endl;\\n break;\\n }\\n cnt += a[j] + 1;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6908,\n \"score_of_the_acc\": -0.4861,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3033_2761077\",\n \"code_snippet\": \"#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\\nconst ll MAX_N = 500000;\\nll n, k;\\nll rnk[MAX_N + 1];\\nll tmp[MAX_N + 1];\\n\\nbool compare_sa(ll i, ll j) {\\n if(rnk[i] != rnk[j]) return rnk[i] < rnk[j];\\n ll ri = i + k <= n ? rnk[i + k] : -1;\\n ll rj = j + k <= n ? rnk[j + k] : -1;\\n return ri < rj;\\n}\\n\\nvector<ll> construct_sa(const string &S) {\\n n = S.length();\\n vector<ll> sa(n + 1);\\n REP(i, 0, n + 1) sa[i] = i;\\n REP(i, 0, n + 1) rnk[i] = i < n ? S[i] : -1;\\n for(k = 1; k <= n; k *= 2) {\\n sort(sa.begin(), sa.end(), compare_sa);\\n tmp[sa[0]] = 0;\\n REP(i, 1, n + 1) tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\\n REP(i, 0, n + 1) rnk[i] = tmp[i];\\n }\\n return sa;\\n}\\n\\nint main(void) {\\n ll N, H;\\n string S;\\n cin >> N >> H >> S;\\n\\n vector<ll> a(N, 0);\\n REP(i, 0, N - 1) if(S[i] == '0') a[i + 1] += a[i] + 1;\\n\\n vector<ll> imos(N + 2, 0);\\n REP(i, 0, N) {\\n if(S[i] != '0') {\\n imos[1] += a[i] + 1;\\n imos[N - i + 1] -= a[i] + 1;\\n } else {\\n imos[1] += a[i] + 1;\\n imos[2] -= a[i] + 1;\\n }\\n }\\n REP(i, 0, N + 1) imos[i + 1] += imos[i];\\n\\n ll x = 1, cnt = 1;\\n while(1) {\\n if(cnt <= H && H < cnt + imos[x]) break;\\n cnt += imos[x];\\n x++;\\n }\\n\\n vector<ll> sa = construct_sa(S);\\n REP(i, 1, N + 1) {\\n ll j = sa[i];\\n if((x == 1 || S[j] != '0') && j + x <= N) {\\n if(cnt <= H && H < cnt + a[j] + 1) {\\n cout << S.substr(j, x) << endl;\\n break;\\n }\\n cnt += a[j] + 1;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 6916,\n \"score_of_the_acc\": -0.6048,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3033_2755612\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstruct SuffixArray {\\n vector< int > SA;\\n string s;\\n\\n void Build_SA(const string &str) {\\n s = str;\\n SA.resize(s.size());\\n iota(begin(SA), end(SA), 0);\\n sort(begin(SA), end(SA), [&](const int &a, const int &b) {\\n if(s[a] == s[b]) return (a > b);\\n return (s[a] < s[b]);\\n });\\n vector< int > classes(s.size()), c(s.size()), cnt(s.size());\\n for(int i = 0; i < s.size(); i++) {\\n c[i] = s[i];\\n }\\n for(int len = 1; len < s.size(); len <<= 1) {\\n for(int i = 0; i < s.size(); i++) {\\n if(i > 0 && c[SA[i - 1]] == c[SA[i]] && SA[i - 1] + len < s.size() && c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {\\n classes[SA[i]] = classes[SA[i - 1]];\\n } else {\\n classes[SA[i]] = i;\\n }\\n }\\n iota(begin(cnt), end(cnt), 0);\\n copy(begin(SA), end(SA), begin(c));\\n for(int i = 0; i < s.size(); i++) {\\n int s1 = c[i] - len;\\n if(s1 >= 0) SA[cnt[classes[s1]]++] = s1;\\n }\\n classes.swap(c);\\n }\\n }\\n\\n int operator[](int k) const {\\n return (SA[k]);\\n }\\n\\n int size() const {\\n return (s.size());\\n }\\n\\n bool lt_substr(string &t, int si = 0, int ti = 0) {\\n int sn = s.size(), tn = t.size();\\n while(si < sn && ti < tn) {\\n if(s[si] < t[ti]) return (true);\\n if(s[si] > t[ti]) return (false);\\n ++si, ++ti;\\n }\\n return (si >= sn && ti < tn);\\n }\\n\\n int lower_bound(string &t) {\\n int low = -1, high = SA.size();\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(lt_substr(t, SA[mid])) low = mid;\\n else high = mid;\\n }\\n return (high);\\n }\\n\\n pair< int, int > lower_upper_bound(string &t) {\\n int idx = lower_bound(t);\\n int low = idx - 1, high = SA.size();\\n t.back()++;\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(lt_substr(t, SA[mid])) low = mid;\\n else high = mid;\\n }\\n t.back()--;\\n return (make_pair(idx, high));\\n }\\n\\n void output() {\\n for(int i = 0; i < size(); i++) {\\n cout << i << \\\": \\\" << s.substr(SA[i]) << endl;\\n }\\n }\\n};\\n\\nusing int64 = long long;\\n\\ntemplate< class T >\\nstruct BinaryIndexedTree {\\n vector< T > data;\\n\\n BinaryIndexedTree(int sz) {\\n data.assign(++sz, 0);\\n }\\n\\n T sum(int k) {\\n T ret = 0;\\n for(++k; k > 0; k -= k & -k) ret += data[k];\\n return (ret);\\n }\\n\\n void add(int k, T x) {\\n for(++k; k < data.size(); k += k & -k) data[k] += x;\\n }\\n};\\n\\ntemplate< class T >\\nstruct AdditionalBIT : BinaryIndexedTree< T > {\\n int curr;\\n\\n AdditionalBIT(int sz) : BinaryIndexedTree< T >(sz) {\\n curr = 1;\\n while(curr <= sz) curr <<= 1;\\n }\\n\\n int lower_bound(T w) {\\n if(w <= 0) return (0);\\n int i = 0;\\n for(int k = curr; k > 0; k >>= 1) {\\n if(i + k < BinaryIndexedTree< T >::data.size() && BinaryIndexedTree< T >::data[i + k] < w) {\\n w -= BinaryIndexedTree< T >::data[i + k];\\n i += k;\\n }\\n }\\n return (i);\\n }\\n};\\n\\nint main() {\\n int64 N, H;\\n string S;\\n\\n cin >> N >> H;\\n cin >> S;\\n\\n int wait = 0;\\n vector< int > weight(S.size());\\n for(int i = 0; i < S.size(); i++) {\\n if(S[i] == '0') {\\n ++wait;\\n H -= wait;\\n } else {\\n weight[i] += wait + 1;\\n wait = 0;\\n }\\n }\\n\\n SuffixArray sa;\\n sa.Build_SA(S);\\n\\n if(H <= 0) {\\n cout << 0 << endl;\\n return (0);\\n }\\n\\n vector< int > order;\\n for(int i = 0; i < S.size(); i++) {\\n if(S[sa[i]] == '0') continue;\\n order.emplace_back(i);\\n }\\n\\n AdditionalBIT< int64 > bit(N);\\n vector< int > end[100001];\\n for(auto &v : order) {\\n bit.add(v, weight[sa[v]]);\\n end[N - sa[v]].emplace_back(v);\\n }\\n\\n int keta = 1;\\n for(; H - bit.sum(N - 1) >= 1; ++keta) {\\n H -= bit.sum(N - 1);\\n for(auto &p : end[keta]) bit.add(p, -weight[sa[p]]);\\n }\\n\\n cout << S.substr(sa[bit.lower_bound(H)], keta) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 10360,\n \"score_of_the_acc\": -0.8349,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3033_2755611\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstruct SuffixArray {\\n vector< int > SA;\\n string s;\\n\\n void Build_SA(const string &str) {\\n s = str;\\n SA.resize(s.size());\\n iota(begin(SA), end(SA), 0);\\n sort(begin(SA), end(SA), [&](const int &a, const int &b) {\\n if(s[a] == s[b]) return (a > b);\\n return (s[a] < s[b]);\\n });\\n vector< int > classes(s.size()), c(s.size()), cnt(s.size());\\n for(int i = 0; i < s.size(); i++) {\\n c[i] = s[i];\\n }\\n for(int len = 1; len < s.size(); len <<= 1) {\\n for(int i = 0; i < s.size(); i++) {\\n if(i > 0 && c[SA[i - 1]] == c[SA[i]] && SA[i - 1] + len < s.size() && c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {\\n classes[SA[i]] = classes[SA[i - 1]];\\n } else {\\n classes[SA[i]] = i;\\n }\\n }\\n iota(begin(cnt), end(cnt), 0);\\n copy(begin(SA), end(SA), begin(c));\\n for(int i = 0; i < s.size(); i++) {\\n int s1 = c[i] - len;\\n if(s1 >= 0) SA[cnt[classes[s1]]++] = s1;\\n }\\n classes.swap(c);\\n }\\n }\\n\\n int operator[](int k) const {\\n return (SA[k]);\\n }\\n\\n int size() const {\\n return (s.size());\\n }\\n\\n bool lt_substr(string &t, int si = 0, int ti = 0) {\\n int sn = s.size(), tn = t.size();\\n while(si < sn && ti < tn) {\\n if(s[si] < t[ti]) return (true);\\n if(s[si] > t[ti]) return (false);\\n ++si, ++ti;\\n }\\n return (si >= sn && ti < tn);\\n }\\n\\n int lower_bound(string &t) {\\n int low = -1, high = SA.size();\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(lt_substr(t, SA[mid])) low = mid;\\n else high = mid;\\n }\\n return (high);\\n }\\n\\n pair< int, int > lower_upper_bound(string &t) {\\n int idx = lower_bound(t);\\n int low = idx - 1, high = SA.size();\\n t.back()++;\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(lt_substr(t, SA[mid])) low = mid;\\n else high = mid;\\n }\\n t.back()--;\\n return (make_pair(idx, high));\\n }\\n\\n void output() {\\n for(int i = 0; i < size(); i++) {\\n cout << i << \\\": \\\" << s.substr(SA[i]) << endl;\\n }\\n }\\n};\\n\\nusing int64 = long long;\\n\\ntemplate< class T >\\nstruct BinaryIndexedTree {\\n vector< T > data;\\n\\n BinaryIndexedTree(int sz) {\\n data.assign(++sz, 0);\\n }\\n\\n T sum(int k) {\\n T ret = 0;\\n for(++k; k > 0; k -= k & -k) ret += data[k];\\n return (ret);\\n }\\n\\n void add(int k, T x) {\\n for(++k; k < data.size(); k += k & -k) data[k] += x;\\n }\\n};\\n\\ntemplate< class T >\\nstruct AdditionalBIT : BinaryIndexedTree< T > {\\n int curr;\\n\\n AdditionalBIT(int sz) : BinaryIndexedTree< T >(sz) {\\n curr = 1;\\n while(curr <= sz) curr <<= 1;\\n }\\n\\n int lower_bound(T w) {\\n if(w <= 0) return (0);\\n int i = 0;\\n for(int k = curr; k > 0; k >>= 1) {\\n if(i + k < BinaryIndexedTree< T >::data.size() && BinaryIndexedTree< T >::data[i + k] < w) {\\n w -= BinaryIndexedTree< T >::data[i + k];\\n i += k;\\n }\\n }\\n return (i);\\n }\\n};\\n\\nint main() {\\n int N, H;\\n string S;\\n\\n cin >> N >> H;\\n cin >> S;\\n\\n int wait = 0;\\n vector< int > weight(S.size());\\n for(int i = 0; i < S.size(); i++) {\\n if(S[i] == '0') {\\n ++wait;\\n H -= wait;\\n } else {\\n weight[i] += wait + 1;\\n wait = 0;\\n }\\n }\\n\\n SuffixArray sa;\\n sa.Build_SA(S);\\n\\n if(H <= 0) {\\n cout << 0 << endl;\\n return (0);\\n }\\n\\n vector< int > order;\\n for(int i = 0; i < S.size(); i++) {\\n if(S[sa[i]] == '0') continue;\\n order.emplace_back(i);\\n }\\n\\n AdditionalBIT< int64 > bit(N);\\n vector< int > end[100001];\\n for(auto &v : order) {\\n bit.add(v, weight[sa[v]]);\\n end[N - sa[v]].emplace_back(v);\\n }\\n\\n int keta = 1;\\n for(; H - bit.sum(N - 1) >= 1; ++keta) {\\n H -= bit.sum(N - 1);\\n for(auto &p : end[keta]) bit.add(p, -weight[sa[p]]);\\n }\\n\\n cout << S.substr(sa[bit.lower_bound(H)], keta) << endl;\\n}\",\n \"accuracy\": 0.6779661016949152,\n \"time_ms\": 20,\n \"memory_kb\": 8264,\n \"score_of_the_acc\": -0.4341,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3033_2754664\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nint _n,_k;\\nint ranks[101010];\\nint tmp[101010];\\n\\nbool compare_sa(int i,int j){\\n if(ranks[i]!=ranks[j])return ranks[i]<ranks[j];\\n else{\\n int ri=i+_k<=_n?ranks[i+_k]:-1;\\n int rj=j+_k<=_n?ranks[j+_k]:-1;\\n return ri<rj;\\n }\\n}\\nvoid construct_sa(string s,int *sa){\\n _n=s.length();\\n for(int i=0;i<=_n;i++){\\n sa[i]=i;\\n ranks[i]=i<_n?s[i]:-1;\\n }\\n for(_k=1;_k<=_n;_k*=2){\\n sort(sa,sa+_n+1,compare_sa);\\n tmp[sa[0]]=0;\\n for(int i=1;i<=_n;i++){\\n tmp[sa[i]]=tmp[sa[i-1]]+(compare_sa(sa[i-1],sa[i])?1:0);\\n }\\n for(int i=0;i<=_n;i++){\\n ranks[i]=tmp[i];\\n }\\n }\\n}\\n\\nll n,h;\\nstring s;\\nll cnt[101010];\\nint sa[101010];\\nll sum[101010];\\n\\nint main(){\\n cin>>n>>h>>s;\\n for(ll i=0;i<n;){\\n if(s[i]!='0'){\\n sum[i]++;\\n ll suf=n-i;\\n cnt[1]++;\\n cnt[suf+1]--;\\n i++;\\n continue;\\n }\\n ll j;\\n for(j=i;j<n&&s[j]=='0';j++);\\n ll len=j-i;\\n ll suf=n-j;\\n sum[j]+=len;\\n cnt[0]+=len*(len+1)/2;\\n cnt[1]+=len;\\n cnt[suf+1]-=len;\\n i=j;\\n }\\n\\n for(ll i=1;i<100001;i++)cnt[i+1]+=cnt[i];\\n\\n construct_sa(s,sa);\\n\\n if(h<=cnt[0]){\\n cout<<0<<endl;\\n }else{\\n h-=cnt[0];\\n ll d=-1;\\n repl(i,1,n+1){\\n if(h<=cnt[i]){\\n d=i;\\n break;\\n }else h-=cnt[i];\\n }\\n repl(i,1,n+1){\\n if(n-sa[i]>=d&&s[sa[i]]!='0'){\\n if(h<=sum[sa[i]]){\\n cout<<s.substr(sa[i],d)<<endl;\\n return 0;\\n }else h-=sum[sa[i]];\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5964,\n \"score_of_the_acc\": -0.4762,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3033_2752510\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp make_pair\\n#define pb push_back\\n#define all(x) begin(x),end(x)\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cerr<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\nclass SuffixArray {\\npublic:\\n const string &s;\\n vector<int> sa, rank;\\n int n;\\n void construct_sa(){\\n sa.resize(n+1);\\n rank.resize(n+1);\\n rep(i,n+1){\\n sa[i]=i;\\n rank[i] = (i<n)?s[i]:(-1);\\n }\\n vector<int> tmp(n+1,0);\\n for(int k=1; k<=n; k*=2){\\n auto comp = [&](const int i, const int j){\\n if(rank[i]!=rank[j]) return rank[i]<rank[j];\\n int ri = (i+k<=n)?(rank[i+k]):-1;\\n int rj = (j+k<=n)?(rank[j+k]):-1;\\n return ri < rj;\\n };\\n sort(all(sa), comp);\\n tmp[sa[0]]=0;\\n rep(i,1,n+1){\\n tmp[sa[i]] = tmp[sa[i-1]];\\n if(comp(sa[i-1], sa[i])) tmp[sa[i]]++;\\n }\\n swap(tmp, rank);\\n }\\n }\\n SuffixArray(const string &str) : s(str){\\n n = s.size();\\n construct_sa();\\n }\\n};\\n\\n\\nvoid solve(int n, ll h, string &str, int len){\\n if(len == 0){\\n cout << \\\"0\\\" << endl;\\n return;\\n }\\n\\n SuffixArray sa(str);\\n vector<int> arr(n+1,0);\\n rep(i,1,n+1) if(str[sa.sa[i]]>'0'){\\n int idx = sa.sa[i];\\n int d = 1;\\n if(n-idx < len) d = 0;\\n else {\\n while(idx-d>=0 && str[idx-d]=='0') d++;\\n }\\n arr[i] = arr[i-1] + d;\\n if(arr[i] >= h){\\n cout << str.substr(idx, len) << endl;\\n return;\\n }\\n }\\n assert(false);\\n}\\n\\nint main(void){\\n\\tint n;\\n\\tll h;\\n\\tstring str;\\n\\tscanf(\\\"%d%lld\\\",&n,&h);\\n\\tcin >> str;\\n\\tint z=-1;\\n\\tvector<int> nonzero(n+1);\\n\\tvector<ll> cnt(n+1);\\n\\tfor(int i=0;i<=n;i++){\\n\\t\\tcnt[i]=0;\\n\\t}\\n\\tfor(int i=n-1;i>=0;i--){\\n\\t\\tif(str[i]>='1'){\\n\\t\\t\\tz=i;\\n\\t\\t}\\n\\t\\tnonzero[i]=z;\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\t//printf(\\\"%d\\\\n\\\",nonzero[i]);\\n\\t\\tif(nonzero[i]==-1)continue;\\n\\t\\tcnt[n-nonzero[i]]++;\\n\\t}\\n\\tfor(int i=n;i>1;i--){\\n\\t\\tcnt[i-1]+=cnt[i];\\n\\t}\\n\\tll len=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(str[i]=='0'){\\n\\t\\t\\tlen++;\\n\\t\\t}else{\\n\\t\\t\\tcnt[0]+=len*(len+1)/2LL;\\n\\t\\t\\tlen=0;\\n\\t\\t}\\n\\t}\\n\\tcnt[0]+=len*(len+1)/2LL;\\n\\tll sum=0;\\n\\tfor(int i=0;i<=n;i++){\\n\\t\\tsum+=cnt[i];\\n\\t\\tif(sum>=h){\\n\\t\\t\\tsum-=cnt[i];\\n\\t\\t\\tsolve(n,h-sum,str,i);\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5472,\n \"score_of_the_acc\": -0.2921,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3033_2752396\",\n \"code_snippet\": \"#include<algorithm>\\n#include<iostream>\\n#include<cstring>\\n#include<vector>\\nusing namespace std;\\ntypedef long long lint;\\ntypedef vector<int>vi;\\ntypedef pair<int,int>pii;\\n#define rep(i,n)for(int i=0;i<(int)(n);++i)\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\nconst int DEBUG=0;\\n\\n// http://www.prefield.com/algorithm/string/suffix_array.html\\n\\n// Larsson-Sadakane's Suffix array Construction: O(n (log n)^2)\\nstruct SAComp {\\n const int h, *g;\\n SAComp(int h, int* g) : h(h), g(g) {}\\n bool operator() (int a, int b) {\\n return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a+h] < g[b+h];\\n }\\n};\\nint *buildSA(const char* t, int n) {\\n int g[n+1], b[n+1], *v = new int[n+1];\\n REP(i,n+1) v[i] = i, g[i] = t[i];\\n b[0] = 0; b[n] = 0;\\n\\n sort(v, v+n+1, SAComp(0, g));\\n for(int h = 1; b[n] != n ; h *= 2) {\\n SAComp comp(h, g);\\n sort(v, v+n+1, comp);\\n REP(i, n) b[i+1] = b[i] + comp(v[i], v[i+1]);\\n REP(i, n+1) g[v[i]] = b[i];\\n }\\n return v;\\n}\\n// Naive matching O(m log n)\\nint find(char *t, int n, char *p, int m, int *sa) {\\n int a = 0, b = n;\\n while (a < b) {\\n int c = (a + b) / 2;\\n if (strncmp(t+sa[c], p, m) < 0) a = c+1; else b = c;\\n }\\n return strncmp(t+sa[a], p, m) == 0 ? sa[a] : -1;\\n}\\n\\n// Kasai-Lee-Arimura-Arikawa-Park's simple LCP computation: O(n)\\nint *buildLCP(char *t, int n, int *a) {\\n int h = 0, b[n+1], *lcp = new int[n+1];\\n REP(i, n+1) b[a[i]] = i;\\n REP(i, n+1) {\\n if (b[i]){\\n for (int j = a[b[i]-1]; j+h<n && i+h<n && t[j+h] == t[i+h]; ++h);\\n lcp[b[i]] = h;\\n } else lcp[b[i]] = -1;\\n if (h > 0) --h;\\n }\\n return lcp;\\n}\\n// call RMQ = buildRMQ(lcp, n+1)\\nint *buildRMQ(int *a, int n) {\\n int logn = 1;\\n for (int k = 1; k < n; k *= 2) ++logn;\\n int *r = new int[n * logn];\\n int *b = r; copy(a, a+n, b);\\n for (int k = 1; k < n; k *= 2) {\\n copy(b, b+n, b+n); b += n;\\n REP(i, n-k) b[i] = min(b[i], b[i+k]);\\n }\\n return r;\\n}\\n// inner LCP computation with RMQ: O(1)\\nint minimum(int x, int y, int *rmq, int n) {\\n int z = y - x, k = 0, e = 1, s; // y - x >= e = 2^k なる最大 k\\n s = ( (z & 0xffff0000) != 0 ) << 4; z >>= s; e <<= s; k |= s;\\n s = ( (z & 0x0000ff00) != 0 ) << 3; z >>= s; e <<= s; k |= s;\\n s = ( (z & 0x000000f0) != 0 ) << 2; z >>= s; e <<= s; k |= s;\\n s = ( (z & 0x0000000c) != 0 ) << 1; z >>= s; e <<= s; k |= s;\\n s = ( (z & 0x00000002) != 0 ) << 0; z >>= s; e <<= s; k |= s;\\n return min( rmq[x+n*k], rmq[y+n*k-e+1] );\\n}\\n// outer LCP computation: O(m - o)\\nint computeLCP(char *t, int n, char *p, int m, int o, int k) {\\n int i = o;\\n for (; i < m && k+i < n && p[i] == t[k+i]; ++i);\\n return i;\\n}\\n// Mamber-Myers's O(m + log n) string matching with LCP/RMQ\\n#define COMP(h, k) (h == m || (k+h<n && p[h]<t[k+h]))\\nint find(char *t, int n, char *p, int m, int *sa, int *rmq) {\\n int l = 0, lh = 0, r = n, rh = computeLCP(t,n+1,p,m,0,sa[n]);\\n if (!COMP(rh, sa[r])) return -1;\\n for (int k = (l+r)/2; l+1 < r; k = (l+r)/2) {\\n int A = minimum(l+1, k, rmq, n+1), B = minimum(k+1, r, rmq, n+1);\\n if (A >= B) {\\n if (lh < A) l = k;\\n else if (lh > A) r = k, rh = A;\\n else {\\n int i = computeLCP(t, n+1, p, m, A, sa[k]);\\n if (COMP(i, sa[k])) r = k, rh = i; else l = k, lh = i;\\n }\\n } else {\\n if (rh < B) r = k;\\n else if (rh > B) l = k, lh = B;\\n else {\\n int i = computeLCP(t, n+1, p, m, B, sa[k]);\\n if (COMP(i, sa[k])) r = k, rh = i; else l = k, lh = i;\\n }\\n }\\n }\\n return rh == m ? sa[r] : -1;\\n}\\n\\nint main(){\\n int n;\\n lint h;\\n string s;\\n cin>>n>>h>>s;\\n vi multa(n+1);\\n int cnt=0;\\n rep(i,n+1){\\n cnt++;\\n if(i<n&&s[i]=='0'){\\n multa[i]=0;\\n }else{\\n multa[i]=cnt;\\n cnt=0;\\n }\\n }\\n int lo=-1,hi=n;\\n while(hi-lo>1){\\n int x=(hi+lo)/2;\\n lint cnt=0;\\n rep(i,n+1){\\n if(i<n)\\n\\tcnt+=(lint)min(x,n-i)*multa[i];\\n cnt+=(lint)multa[i]*(lint)(multa[i]-1)/2;\\n }\\n if(cnt>=h)\\n hi=x;\\n else\\n lo=x;\\n }\\n int *sa=buildSA(s.c_str(),n);\\n if(DEBUG){\\n rep(i,n+1){\\n cerr<<\\\"suf:\\\"<<sa[i]<<\\\" \\\"<<s.substr(sa[i])<<endl;\\n }\\n }\\n int len=hi;\\n if(DEBUG)cerr<<\\\"len=\\\"<<len<<endl;\\n vi tak;\\n rep(i,n+1){\\n if(sa[i]<=n-len)tak.push_back(sa[i]);\\n }\\n lint base=0;\\n rep(i,n+1){\\n if(i<n)\\n base+=(lint)min(len-1,n-i)*multa[i];\\n base+=(lint)multa[i]*(lint)(multa[i]-1)/2;\\n }\\n if(len==0){\\n cout<<0<<endl;\\n return 0;\\n }\\n if(DEBUG)\\n cerr<<\\\"base=\\\"<<base<<endl;\\n if(DEBUG){\\n cerr<<\\\"tak:\\\";\\n rep(i,tak.size()){\\n cerr<<\\\" \\\"<<tak[i];\\n //cerr<<\\\" \\\"<<s.substr(tak[i])<<endl;\\n }\\n cerr<<endl;\\n }\\n int tmp=0,idx=-1;\\n rep(i,tak.size()){\\n if(s[tak[i]]!='0'){\\n tmp+=multa[tak[i]];\\n if(tmp+base>=h){\\n\\tidx=tak[i];\\n\\tbreak;\\n }\\n }\\n }\\n cout<<s.substr(idx,len)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5052,\n \"score_of_the_acc\": -0.1765,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3033_2751817\",\n \"code_snippet\": \"//ランタイムエラーの原因が分からなかったので、もしやと思い、sortをstable_sortに書き換えたらAcceptedした。なぜsortではダメなのか、よくわからない…\\n#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#define int long long\\nusing namespace std;\\ntypedef pair<int, int> P;\\n\\n/*https://kimiyuki.net/blog/2016/04/09/arc-050-d/より引用*/\\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\\n#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))\\nvector<int> suffix_array(string const & s) {\\n int n = s.length();\\n vector<int> sa(n+1);\\n vector<int> rank(n+1);\\n repeat (i,n+1) {\\n sa[i] = i;\\n rank[i] = i < n ? s[i] : -1;\\n }\\n auto rankf = [&](int i) { return i <= n ? rank[i] : -1; };\\n vector<int> nxt(n+1);\\n for (int k = 1; k <= n; k <<= 1) {\\n auto cmp = [&](int i, int j) { return make_pair(rank[i], rankf(i + k)) < make_pair(rank[j], rankf(j + k)); };\\n sort(sa.begin(), sa.end(), cmp);\\n nxt[sa[0]] = 0;\\n repeat_from (i,1,n+1) {\\n nxt[sa[i]] = nxt[sa[i-1]] + (cmp(sa[i-1], sa[i]) ? 1 : 0);\\n }\\n rank.swap(nxt);\\n }\\n return sa;\\n}\\n/*終わり*/\\n\\n/*ローリングハッシュ https://odan3240.hatenablog.com/entry/2015/02/16/111938*/\\nstruct RollingHash {\\n typedef long long int_type;\\n typedef pair<int_type,int_type> hash_type;\\n\\n int_type base1;\\n int_type base2;\\n int_type mod1;\\n int_type mod2;\\n vector<int_type> hash1;\\n vector<int_type> hash2;\\n vector<int_type> pow1;\\n vector<int_type> pow2;\\n\\n RollingHash() : base1(1009), base2(1007), mod1(1000000007), mod2(1000000009) {}\\n\\n void init(const string &s) {\\n int n = s.size();\\n\\n hash1.assign(n+1,0);\\n hash2.assign(n+1,0);\\n pow1.assign(n+1,1);\\n pow2.assign(n+1,1);\\n\\n for(int i=0;i<n;i++) {\\n hash1[i+1] = (hash1[i]+s[i]) * base1 % mod1;\\n hash2[i+1] = (hash2[i]+s[i]) * base2 % mod2;\\n pow1[i+1] = pow1[i] * base1 % mod1;\\n pow2[i+1] = pow2[i] * base2 % mod2;\\n }\\n }\\n\\n\\t//[l, r)のハッシュ値を返す\\n hash_type get(int l,int r) {\\n int_type t1 = ((hash1[r] - hash1[l] * pow1[r-l]) % mod1 + mod1) % mod1;\\n int_type t2 = ((hash2[r] - hash2[l] * pow2[r-l]) % mod2 + mod2) % mod2;\\n return make_pair(t1, t2);\\n }\\n};\\n/*終わり*/\\n\\nint n, h;\\nstring s;\\nint rs[100001];\\nint imos[100005];\\t//imos[i] = i桁の数字が何個あるか\\nvector<int> sa;\\nvector<int> saInv;\\t//saInv[i] = sa[id] = iなるidを書いておく\\nRollingHash rh;\\n\\nbool compare(const P &l, const P &r) {\\n\\tif (rh.get(l.first, l.second) == rh.get(r.first, r.second)) return true;\\n\\tif (saInv[l.first] < saInv[r.first]) return true;\\n\\treturn false;\\n}\\n\\nsigned main() {\\n\\tint i;\\n\\t\\n\\tcin >> n >> h >> s;\\n\\tfor (i = 0; i < n; i++) rs[i + 1] = rs[i] + (s[i] > '0');\\n\\t\\n\\tfor (i = 0; i < n; i++) {\\n\\t\\tint st = i, ed = n + 1, mid; //(st, ed]\\n\\t\\twhile (ed - st >= 2) {\\n\\t\\t\\tmid = (st + ed) / 2;\\n\\t\\t\\tif (rs[mid] - rs[i] >= 1) ed = mid;\\n\\t\\t\\telse st = mid;\\n\\t\\t}\\n\\t\\tif (s[i] == '0') { imos[0] += ed - i - 1; imos[1] -= ed - i - 1; }\\n\\t\\timos[1]++;\\n\\t\\timos[n + 2 - ed]--;\\n\\t}\\n\\t\\n\\tfor (i = 0; i <= n + 1; i++) imos[i + 1] += imos[i];\\n\\t//cout << \\\"imos:\\\" << endl;\\n\\t//for (i = 0; i <= n; i++) cout << imos[i] << endl;\\n\\t//cout << \\\"imos*\\\" << endl;\\n\\t\\n\\tfor (i = 0; i <= n; i++) {\\n\\t\\th -= imos[i];\\n\\t\\tif (h <= 0) break;\\n\\t}\\n\\t\\n\\tint keta = i;\\t\\t//答えはi桁。\\n\\tif (keta == 0) { cout << 0 << endl; return 0; }\\n\\t//cout << \\\"keta, h = \\\" << keta << \\\", \\\" << h << endl;\\n\\t\\n\\tvector<P> kukan;\\t//答えの候補 … [l, r)\\n\\t\\n\\tfor (i = 0; i < n; i++) {\\n\\t\\tint st = i, ed = n + 1, mid; //(st, ed]\\n\\t\\twhile (ed - st >= 2) {\\n\\t\\t\\tmid = (st + ed) / 2;\\n\\t\\t\\tif (rs[mid] - rs[i] >= 1) ed = mid;\\n\\t\\t\\telse st = mid;\\n\\t\\t}\\n\\t\\tif (ed + keta - 1 <= n) {\\n\\t\\t\\tkukan.push_back(P(ed - 1, ed + keta - 1));\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//cout << \\\"ソート前\\\" << endl;\\n\\t//for (i = 0; i < kukan.size(); i++) { cout << kukan[i].first << \\\" \\\" << kukan[i].second << endl; }\\n\\t\\n\\tsa = suffix_array(s);\\n\\tsaInv.resize(sa.size());\\n\\tfor (i = 0; i < sa.size(); i++) saInv[sa[i]] = i;\\n\\t//for (i = 0; i < sa.size(); i++) { cout << \\\"sa[\\\" << i << \\\"] = \\\" << sa[i] << endl; }\\n\\trh.init(s);\\n\\t//for (i = 0; i < n; i++) for (int j = 0; j < n; j++) cout << \\\"[\\\" << i << \\\", \\\" << j << \\\"] = \\\" << rh.get(i, j).first << endl;\\n\\t\\n\\t//kukanをソートしたい。その比較関数にsuffix_array, ローリングハッシュを用いる.\\n\\tstable_sort(kukan.begin(), kukan.end(), compare);\\n\\t//cout << \\\"ソート後\\\" << endl;\\n\\t//for (i = 0; i < kukan.size(); i++) { cout << kukan[i].first << \\\" \\\" << kukan[i].second << endl; }\\n\\t\\n\\t//あとは、適当に答えるだけ。\\n\\tint id = (int)kukan.size() - 1 + h;\\n\\tbool flag = false;\\n\\tfor (i = kukan[id].first; i < kukan[id].second; i++) {\\n\\t\\tif (s[i] != '0') flag = true;\\n\\t\\tif (flag) cout << s[i];\\n\\t}\\n\\tcout << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 11376,\n \"score_of_the_acc\": -1.8546,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1880,"cells":{"group_id":{"kind":"string","value":"aoj_3034_cpp"},"problem_description":{"kind":"string","value":"Problem I: Explosion\nProblem\n大魔王めぐみんは地上に生存する$N$人の勇者を倒そうと考えている。\nめぐみんは$M$回まで爆発魔法を唱えることができる。\n爆発魔法は任意の座標を中心に半径$r$以内に存在している勇者を消滅させる魔法である。\n勇者はとても痩せているため大きさは考慮しなくてよい。\n$M$回の爆発魔法は全て同じ大きさの半径で唱えるものとする。\n勇者を全滅させるのに必要最小限の半径の魔法を使うことにした。\n爆発魔法の半径の大きさを最小化せよ。\nInput\n$N$ $M$\n$x_1$ $y_1$\n...\n$x_N$ $y_N$\n入力は以下の形式で与えられる。\n1行目に 勇者の数 $N$ 、唱える爆発の数 $M$ が整数で与えられる。\n2行目以降にそれぞれの勇者$i$の座標 $x_i$ $,$ $y_i$ が整数で与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq M \\leq N \\leq 14$\n$0 \\leq x_i $,$ y_i \\leq 10^5$\nOutput\n爆発魔法の半径の最小値を実数で出力せよ。\n$10^{-3}$を超える絶対誤差を含んではならない。\nSample Input 1\n5 2\n0 0\n5 5\n10 10\n100 100\n200 200\nSample Output 1\n70.710678118755\nSample Input 2\n10 5\n321 675\n4312 6534\n312 532\n412 6543\n21 43\n654 321\n543 0\n32 5\n41 76\n5 1\nSample Output 2\n169.824909833728\nSample Input 3\n14 3\n312 342\n4893 432\n321 4\n389 4\n23 543\n0 0\n1 1\n2 2\n432 12\n435 32\n1 5\n2 10\n100 100\n20 50\nSample Output 3\n218.087711712613\nSample Input 4\n5 2\n0 0\n0 0\n0 0\n0 0\n0 0\nSample Output 4\n0.000000000001"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3034_10198826","code_snippet":"// AOJ #3034\n// Explosion 2025.2.6\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nstruct Point { double x, y; };\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n vector<Point> pts(N);\n for (int i = 0; i < N; i++){\n cin >> pts[i].x >> pts[i].y;\n }\n\n if(M >= N){\n cout << fixed << setprecision(12) << 0.0 << endl;\n return 0;\n }\n \n double eps = 1e-9;\n // 上界の設定：入力点間の最大距離\n double high = 0.0;\n for (int i = 0; i < N; i++){\n for (int j = i+1; j < N; j++){\n double dx = pts[i].x - pts[j].x;\n double dy = pts[i].y - pts[j].y;\n double d = sqrt(dx*dx + dy*dy);\n high = max(high, d);\n }\n }\n // N==1 の場合 high==0 のはず．\n \n // 二分探索のための関数：r で全員を M 回以内の爆発でカバーできるか\n auto canCover = [&](double r) -> bool {\n vector<int> candidateMasks;\n \n // (1) 各勇者の座標を中心にする候補\n for (int i = 0; i < N; i++){\n int mask = 0;\n for (int j = 0; j < N; j++){\n double dx = pts[j].x - pts[i].x;\n double dy = pts[j].y - pts[i].y;\n if (sqrt(dx*dx + dy*dy) <= r + eps)\n mask |= (1 << j);\n }\n candidateMasks.push_back(mask);\n }\n \n // (2) 各2点間の円の交点を候補とする\n for (int i = 0; i < N; i++){\n for (int j = i+1; j < N; j++){\n double dx = pts[j].x - pts[i].x;\n double dy = pts[j].y - pts[i].y;\n double d = sqrt(dx*dx + dy*dy);\n if (d > 2*r + eps) continue;\n \n double mx = (pts[i].x + pts[j].x) / 2.0;\n double my = (pts[i].y + pts[j].y) / 2.0;\n double h = sqrt(max(0.0, r*r - (d/2.0)*(d/2.0)));\n double ux = -dy / d;\n double uy = dx / d;\n \n for (int sign = -1; sign <= 1; sign += 2){\n double cx = mx + sign * h * ux;\n double cy = my + sign * h * uy;\n int mask = 0;\n for (int k = 0; k < N; k++){\n double dx2 = pts[k].x - cx;\n double dy2 = pts[k].y - cy;\n if(sqrt(dx2*dx2 + dy2*dy2) <= r + eps)\n mask |= (1 << k);\n }\n candidateMasks.push_back(mask);\n }\n }\n }\n \n int FULL = (1 << N) - 1;\n vector<int> dp(1 << N, INT_MAX);\n dp[0] = 0;\n for (int mask = 0; mask < (1 << N); mask++){\n if(dp[mask] == INT_MAX) continue;\n for (int cmask : candidateMasks){\n int newMask = mask | cmask;\n dp[newMask] = min(dp[newMask], dp[mask] + 1);\n }\n }\n return dp[FULL] <= M;\n };\n \n double lo = 0.0, hi = high;\n for (int iter = 0; iter < 60; iter++){\n double mid = (lo + hi) / 2.0;\n if (canCover(mid)) hi = mid;\n else lo = mid;\n }\n cout << fixed << setprecision(12) << hi << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3596,"score_of_the_acc":-0.0147,"final_rank":1},{"submission_id":"aoj_3034_4610503","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\n#define SORT(v, n) sort(v, v + n);\n#define REVERSE(v, n) reverse(v, v+n);\n#define vsort(v) sort(v.begin(), v.end());\n#define all(v) v.begin(), v.end()\n#define mp(n, m) make_pair(n, m);\n#define cout(d) cout<<d<<endl;\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\n#define cinline(n) getline(cin,n);\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\n#define PI (acos(-1))\n#define FILL(v, n, x) fill(v, v + n, x);\n#define sz(x) long long(x.size())\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vs = vector<string>;\nusing vpll = vector<pair<ll, ll>>;\nusing vtp = vector<tuple<ll,ll,ll>>;\nusing vb = vector<bool>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst ll INF = 1e9;\nconst ll MOD = 1e9+7;\nconst ll LINF = 1e18;\n\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\n\n/* 幾何ライブラリ */\nusing DD = double;\nconst DD EPS = 1e-10; // to be set appropriately\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \", \" << l[1] << '}';}\n};\n\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n return 0;\n}\n\n// 円や直線の交点\nvector<Point> crosspoint(const Line &l, const Line &m) {\n vector<Point> res;\n DD d = cross(m[1] - m[0], l[1] - l[0]);\n if (abs(d) < EPS) return vector<Point>();\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\n return res;\n}\n\n// 外心\nPoint gaisin(Point a, Point b, Point c) {\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\n return crosspoint(ab, bc)[0];\n}\n\n// 最小包含円\ndouble minimum_bounding_circle(vector<Point>& v){\n ll n=v.size();\n if(n<=1) return 0;\n \n vector<Point> cond; // 候補\n rep(i,n) irep(j,i+1,n){\n cond.push_back((v[i]+v[j])/2);\n irep(k,j+1,n){\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\n auto p=gaisin(v[i],v[j],v[k]);\n cond.push_back(p);\n }\n }\n \n double res=INF;\n for(auto e: cond){\n double tmp=0;\n rep(i,n) chmax(tmp,abs(e-v[i]));\n chmin(res,tmp);\n }\n \n return res;\n}\n\nconst ll maxn=1<<14;\ndouble dp1[maxn]; // 最小包含円の半径\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\n\nsigned main()\n{\n cin.tie( 0 ); ios::sync_with_stdio( false );\n \n ll n,m; cin>>n>>m;\n vector<Point> v;\n set<Point> exist;\n rep(i,n){\n ll x,y; cin>>x>>y;\n Point p=Point(x,y);\n if(exist.count(p)) continue;\n v.push_back(p);\n exist.insert(p);\n }\n n=v.size();\n \n if(n<=m){\n cout<<0<<endl;\n return 0;\n }\n \n rep(s,1<<n){\n vector<Point> points;\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\n double r=minimum_bounding_circle(points);\n dp1[s]=r;\n }\n \n // NOTE: ここでINF初期化する理由\n // 以下のループの中で、以下の様にdp2の遷移を行っている\n // dp[i][_]が求まっているとして、i+1個の円で集合sを包含するときの円の最小値は、\n // sをbitとbit2の2つの集合に分けて、bitはi個の円、bit2は1個の円で包含することを考える\n // すると遷移は、chmin(dp2[i+1][s],max(dp2[i][bit],dp1[bit2])) と表される\n // このとき、i=0の場合において遷移の過程でdp2[i][bit]が未定義の場合が有り得る\n // dp2[0][1]は0個の円で1個の点を包含する訳だが不可能である(そもそもdp2[0][_]には遷移元が存在しない)\n // この場合dpテーブルを更新しないためにINF初期化する必要がある\n // memo: 一方、dp2[2][1]など、点より多い円で包含する場合は遷移の過程でテーブルが埋められるので問題ない\n // 例えば、dp2[2][1]はmax(dp2[1][0],dp1[1])から更新されるが、dp2[1][0]はmax(dp2[0][0],dp1[0])から0と初期化されるはずである\n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\n dp2[0][0]=0;\n rep(i,m){\n rep(bit,1<<n){\n ll rem=((1<<n)-1)-bit; // 2^n における、集合bitの補集合\n \n // bitの補集合remの、部分集合全てについてのループ\n for(ll bit2=rem; bit2>=0 ;bit2--){\n bit2&=rem;\n \n // NOTE: ここでやっていること\n // まず、max(dp2[i][bit],dp1[bit2])について\n // dp2[i][bit]はi個の円で集合bitを覆うとき、その円の中でも最大のものが最小となるときの半径が格納されている\n // dp1[bit2]は集合bit2の最小包含円の半径である\n // よってmax()は、i+1個の円でbit, bit2を覆うときの最大の円の半径を取ってきている\n // 上記で求めた最大の半径をmax_valueとして、素直にdp2の遷移を実装した結果が以下となる\n // chmin(dp2[i+1][bit|bit2],max_value)\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\n }\n }\n }\n \n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\n \n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\n \n}","accuracy":1,"time_ms":200,"memory_kb":5088,"score_of_the_acc":-0.1417,"final_rank":8},{"submission_id":"aoj_3034_4610470","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\n#define SORT(v, n) sort(v, v + n);\n#define REVERSE(v, n) reverse(v, v+n);\n#define vsort(v) sort(v.begin(), v.end());\n#define all(v) v.begin(), v.end()\n#define mp(n, m) make_pair(n, m);\n#define cout(d) cout<<d<<endl;\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\n#define cinline(n) getline(cin,n);\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\n#define PI (acos(-1))\n#define FILL(v, n, x) fill(v, v + n, x);\n#define sz(x) long long(x.size())\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vs = vector<string>;\nusing vpll = vector<pair<ll, ll>>;\nusing vtp = vector<tuple<ll,ll,ll>>;\nusing vb = vector<bool>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst ll INF = 1e9;\nconst ll MOD = 1e9+7;\nconst ll LINF = 1e18;\n\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\n\n/* 幾何ライブラリ */\nusing DD = double;\nconst DD EPS = 1e-10; // to be set appropriately\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \", \" << l[1] << '}';}\n};\n\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n return 0;\n}\n\n// 円や直線の交点\nvector<Point> crosspoint(const Line &l, const Line &m) {\n vector<Point> res;\n DD d = cross(m[1] - m[0], l[1] - l[0]);\n if (abs(d) < EPS) return vector<Point>();\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\n return res;\n}\n\n// 外心\nPoint gaisin(Point a, Point b, Point c) {\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\n return crosspoint(ab, bc)[0];\n}\n\n// 最小包含円\ndouble minimum_bounding_circle(vector<Point>& v){\n ll n=v.size();\n if(n<=1) return 0;\n \n vector<Point> cond; // 候補\n rep(i,n) irep(j,i+1,n){\n cond.push_back((v[i]+v[j])/2);\n irep(k,j+1,n){\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\n auto p=gaisin(v[i],v[j],v[k]);\n cond.push_back(p);\n }\n }\n \n double res=INF;\n for(auto e: cond){\n double tmp=0;\n rep(i,n) chmax(tmp,abs(e-v[i]));\n chmin(res,tmp);\n }\n \n return res;\n}\n\nconst ll maxn=1<<14;\ndouble dp1[maxn]; // 最小包含円の半径\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\n\nsigned main()\n{\n cin.tie( 0 ); ios::sync_with_stdio( false );\n \n ll n,m; cin>>n>>m;\n vector<Point> v;\n set<Point> exist;\n rep(i,n){\n ll x,y; cin>>x>>y;\n Point p=Point(x,y);\n if(exist.count(p)) continue;\n v.push_back(p);\n exist.insert(p);\n }\n n=v.size();\n \n if(n<=m){\n cout<<0<<endl;\n return 0;\n }\n \n rep(s,1<<n){\n vector<Point> points;\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\n double r=minimum_bounding_circle(points);\n dp1[s]=r;\n }\n \n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\n dp2[0][0]=0;\n rep(i,m){\n rep(bit,1<<n){\n ll rem=((1<<n)-1)-bit;\n for(ll bit2=rem; bit2>=0 ;bit2--){\n bit2&=rem;\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\n }\n }\n }\n \n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\n \n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\n \n \n}","accuracy":1,"time_ms":200,"memory_kb":5048,"score_of_the_acc":-0.1401,"final_rank":6},{"submission_id":"aoj_3034_4608940","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\n#define SORT(v, n) sort(v, v + n);\n#define REVERSE(v, n) reverse(v, v+n);\n#define vsort(v) sort(v.begin(), v.end());\n#define all(v) v.begin(), v.end()\n#define mp(n, m) make_pair(n, m);\n#define cout(d) cout<<d<<endl;\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\n#define cinline(n) getline(cin,n);\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\n#define PI (acos(-1))\n#define FILL(v, n, x) fill(v, v + n, x);\n#define sz(x) long long(x.size())\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vs = vector<string>;\nusing vpll = vector<pair<ll, ll>>;\nusing vtp = vector<tuple<ll,ll,ll>>;\nusing vb = vector<bool>;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst ll INF = 1e9;\nconst ll MOD = 1e9+7;\nconst ll LINF = 1e18;\n\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\n\n/* 幾何ライブラリ */\nusing DD = double;\nconst DD EPS = 1e-10; // to be set appropriately\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \", \" << l[1] << '}';}\n};\n\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n return 0;\n}\n\n// 円や直線の交点\nvector<Point> crosspoint(const Line &l, const Line &m) {\n vector<Point> res;\n DD d = cross(m[1] - m[0], l[1] - l[0]);\n if (abs(d) < EPS) return vector<Point>();\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\n return res;\n}\n\n// 外心\nPoint gaisin(Point a, Point b, Point c) {\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\n return crosspoint(ab, bc)[0];\n}\n\n// 最小包含円\ndouble minimum_bounding_circle(vector<Point>& v){\n ll n=v.size();\n if(n<=1) return 0;\n \n vector<Point> cond; // 候補\n rep(i,n) irep(j,i+1,n){\n cond.push_back((v[i]+v[j])/2);\n irep(k,j+1,n){\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\n auto p=gaisin(v[i],v[j],v[k]);\n cond.push_back(p);\n }\n }\n \n double res=INF;\n for(auto e: cond){\n double tmp=0;\n rep(i,n) chmax(tmp,abs(e-v[i]));\n chmin(res,tmp);\n }\n \n return res;\n}\n\nconst ll maxn=1<<14;\ndouble dp1[maxn]; // 最小包含円の半径\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\n\nsigned main()\n{\n cin.tie( 0 ); ios::sync_with_stdio( false );\n \n ll n,m; cin>>n>>m;\n vector<Point> v;\n set<Point> exist;\n rep(i,n){\n ll x,y; cin>>x>>y;\n Point p=Point(x,y);\n if(exist.count(p)) continue;\n v.push_back(p);\n exist.insert(p);\n }\n n=v.size();\n \n if(n<=m){\n cout<<0<<endl;\n return 0;\n }\n \n rep(s,1<<n){\n vector<Point> points;\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\n double r=minimum_bounding_circle(points);\n dp1[s]=r;\n }\n \n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\n dp2[0][0]=0;\n rep(i,m){\n rep(bit,1<<n){\n ll rem=((1<<n)-1)-bit;\n for(ll bit2=rem; ;bit2=(bit2-1)&rem){\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\n if(!bit2) break;\n }\n }\n }\n \n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\n \n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\n \n \n}","accuracy":1,"time_ms":200,"memory_kb":5108,"score_of_the_acc":-0.1426,"final_rank":9},{"submission_id":"aoj_3034_4400210","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define EPS 0.0000001\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\t\treturn x != p.x? x < p.x: y < p.y;\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\tPoint p[2];\n};\n\nint N,M;\nint POW[15];\ndouble dp[15][1 << 15];\ndouble NUM = 20000000;\nPoint point[15];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 15; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tfor(int i = 0; i <= M; i++){\n\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\tdp[i][state] = BIG_NUM;\n\t\t}\n\t}\n\n\tvector<int> V;\n\n\n\tLine line1,line2;\n\tPoint center;\n\n\tfor(int state = 1; state < POW[N]; state++){\n\n\t\tV.clear();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tif(V.size() == 1){\n\n\t\t\tdp[1][state] = 0;\n\t\t\t//printf(\"dp[1][%d]:%.3lf\\n\",state,dp[1][state]);\n\t\t\tcontinue;\n\n\t\t}else if(V.size() == 2){\n\n\t\t\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\n\n\t\t\tint work_state = state;\n\n\t\t\tcenter = Point((point[V[0]].x+point[V[1]].x)/2,(point[V[0]].y+point[V[1]].y)/2);\n\n\t\t\tfor(int k = 0; k < N; k++){\n\t\t\t\tif(k == V[0] || k == V[1])continue;\n\n\t\t\t\tif(calc_dist(center,point[k]) <= dp[1][state]){\n\n\t\t\t\t\twork_state += POW[k];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdp[1][work_state] = min(dp[1][work_state],dp[1][state]);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\t//3点以上\n\n\t\t//2点を直径とする\n\t\tfor(int a = 0; a < V.size()-1; a++){\n\t\t\tfor(int b = a+1; b < V.size(); b++){\n\n\t\t\t\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\n\t\t\t\tdouble tmp_dist = calc_dist(point[V[a]],point[V[b]])/2;\n\n\t\t\t\tbool FLG = true;\n\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\tif(k == a || k == b)continue;\n\n\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(FLG){\n\n\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//3点を通る\n\t\tfor(int a = 0; a < V.size()-2; a++){\n\t\t\tfor(int b = a+1; b < V.size()-1; b++){\n\t\t\t\tfor(int c = b+1; c < V.size(); c++){\n\n\t\t\t\t\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\n\t\t\t\t\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\n\n\t\t\t\t\tif(fabs(slope1-slope2) < EPS){ //一直線上\n\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\t\t\t\t\t\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\n\n\t\t\t\t\t\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline1.p[0] = Point(-NUM,mid1.y);\n\t\t\t\t\t\t\tline1.p[1] = Point(NUM,mid1.y);\n\n\t\t\t\t\t\t}else if(fabs(slope1) < EPS){ //水平\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x,NUM);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope1 = (-1.0)/slope1;\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline2.p[0] = Point(-NUM,mid2.y);\n\t\t\t\t\t\t\tline2.p[1] = Point(NUM,mid2.y);\n\n\t\t\t\t\t\t}else if(fabs(slope2) < EPS){ //水平\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x,NUM);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope2 = (-1.0)/slope2;\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcenter = calc_Cross_Point(line1,line2);\n\t\t\t\t\t}\n\n\n\t\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\t\tbool FLG = true;\n\t\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\t\tif(k == a || k == b || k == c)continue;\n\n\t\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist){\n\n\t\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\n\tint tmp_state;\n\n\tfor(int state = 1; state < POW[N]-1; state++){\n\n\t\tV.clear();\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 1; i <= M-1; i++){\n\t\t\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\n\n\t\t\t\ttmp_state = 0;\n\n\t\t\t\tfor(int loop = 0; loop < V.size(); loop++){\n\t\t\t\t\tif(a & POW[loop]){\n\n\t\t\t\t\t\ttmp_state += POW[V[loop]];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\tfor(int i = 1; i <= M; i++){\n\n\t\tans = min(ans,dp[i][POW[N]-1]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":640,"memory_kb":4832,"score_of_the_acc":-0.326,"final_rank":10},{"submission_id":"aoj_3034_4400092","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n#define EPS 0.00001\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\t\treturn x != p.x? x < p.x: y < p.y;\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\tPoint p[2];\n};\n\nint N,M;\nint POW[15];\ndouble dp[15][1 << 15];\ndouble NUM = 20000000;\nPoint point[15];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 15; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tfor(int i = 0; i <= M; i++){\n\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\tdp[i][state] = BIG_NUM;\n\t\t}\n\t}\n\n\tvector<int> V;\n\n\n\tLine line1,line2;\n\tPoint center;\n\n\tfor(int state = 1; state < POW[N]; state++){\n\n\t\tV.clear();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tif(V.size() == 1){\n\n\t\t\tdp[1][state] = 0;\n\t\t\t//printf(\"dp[1][%d]:%.3lf\\n\",state,dp[1][state]);\n\t\t\tcontinue;\n\n\t\t}else if(V.size() == 2){\n\n\t\t\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\n\n\t\t\tint work_state = state;\n\n\t\t\tcenter = Point((point[V[0]].x+point[V[1]].x)/2,(point[V[0]].y+point[V[1]].y)/2);\n\n\t\t\tfor(int k = 0; k < N; k++){\n\t\t\t\tif(k == V[0] || k == V[1])continue;\n\n\t\t\t\tif(calc_dist(center,point[k]) <= dp[1][state]){\n\n\t\t\t\t\twork_state += POW[k];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdp[1][work_state] = min(dp[1][work_state],dp[1][state]);\n\n\t\t\tcontinue;\n\t\t}\n\n\t\t//3点以上\n\n\t\t//2点を直径とする\n\t\tfor(int a = 0; a < V.size()-1; a++){\n\t\t\tfor(int b = a+1; b < V.size(); b++){\n\n\t\t\t\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y,point[V[b]].y)/2);\n\n\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\tbool FLG = true;\n\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\tif(k == a || k == b)continue;\n\n\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(FLG){\n\n\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//3点を通る\n\t\tfor(int a = 0; a < V.size()-2; a++){\n\t\t\tfor(int b = a+1; b < V.size()-1; b++){\n\t\t\t\tfor(int c = b+1; c < V.size(); c++){\n\n\t\t\t\t\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\n\t\t\t\t\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\n\n\t\t\t\t\tif(fabs(slope1-slope2) < EPS){ //一直線上\n\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\t\t\t\t\t\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\n\n\t\t\t\t\t\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline1.p[0] = Point(-NUM,mid1.y);\n\t\t\t\t\t\t\tline1.p[1] = Point(NUM,mid1.y);\n\n\t\t\t\t\t\t}else if(fabs(slope1) < EPS){ //水平\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x,NUM);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope1 = (-1.0)/slope1;\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline2.p[0] = Point(-NUM,mid2.y);\n\t\t\t\t\t\t\tline2.p[1] = Point(NUM,mid2.y);\n\n\t\t\t\t\t\t}else if(fabs(slope2) < EPS){ //水平\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x,NUM);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope2 = (-1.0)/slope2;\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t/*if(!is_Cross(line1,line2)){\n\n\t\t\t\t\t\t\tprintf(\"交わらない!! V[a]:%d V[b]:%d V[c]:%d\\n\",V[a],V[b],V[c]);\n\t\t\t\t\t\t\tprintf(\"slope1:%.1lf slope2:%.1lf\\n\",slope1,slope2);\n\t\t\t\t\t\t\treturn 0;\n\t\t\t\t\t\t}*/\n\n\t\t\t\t\t\tcenter = calc_Cross_Point(line1,line2);\n\t\t\t\t\t}\n\n\n\t\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\t\tbool FLG = true;\n\t\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\t\tif(k == a || k == b || k == c)continue;\n\n\t\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\n\n\t\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t/*\tif(fabs(dp[1][state]-BIG_NUM) < EPS){\n\n\t\t\tprintf(\"BUG!! state:%d\\n\",state);\n\t\t\treturn 0;\n\t\t}*/\n\n\n\t\t//printf(\"dp[1][%d]:%.3lf\\n\",state,dp[1][state]);\n\t}\n\n\tint tmp_state;\n\n\tfor(int state = 1; state < POW[N]-1; state++){\n\n\t\tV.clear();\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 1; i <= M-1; i++){\n\t\t\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\n\n\t\t\t\ttmp_state = 0;\n\n\t\t\t\tfor(int loop = 0; loop < V.size(); loop++){\n\t\t\t\t\tif(a & POW[loop]){\n\n\t\t\t\t\t\ttmp_state += POW[V[loop]];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\tfor(int i = 1; i <= M; i++){\n\n\t\tans = min(ans,dp[i][POW[N]-1]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.6545454545454545,"time_ms":360,"memory_kb":3688,"score_of_the_acc":-0.1556,"final_rank":16},{"submission_id":"aoj_3034_4399960","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\t\treturn x != p.x? x < p.x: y < p.y;\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\tPoint p[2];\n};\n\nint N,M;\nint POW[15];\ndouble dp[15][1 << 15];\ndouble NUM = 200000;\nPoint point[15];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 15; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tfor(int i = 0; i <= M; i++){\n\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\tdp[i][state] = BIG_NUM;\n\t\t}\n\t}\n\n\tvector<int> V;\n\n\n\tLine line1,line2;\n\tPoint center;\n\n\tfor(int state = 1; state < POW[N]; state++){\n\n\t\tV.clear();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tif(V.size() == 1){\n\n\t\t\tdp[1][state] = 0;\n\t\t\tcontinue;\n\n\t\t}else if(V.size() == 2){\n\n\t\t\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\n\t\t\tcontinue;\n\t\t}\n\n\t\t//3点以上\n\n\t\t//2点を直径とする\n\t\tfor(int a = 0; a < V.size()-1; a++){\n\t\t\tfor(int b = a+1; b < V.size(); b++){\n\n\t\t\t\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y,point[V[b]].y)/2);\n\n\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\tbool FLG = true;\n\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\tif(k == a || k == b)continue;\n\n\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(FLG){\n\n\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//3点を通る\n\t\tfor(int a = 0; a < V.size()-2; a++){\n\t\t\tfor(int b = a+1; b < V.size()-1; b++){\n\t\t\t\tfor(int c = b+1; c < V.size(); c++){\n\n\t\t\t\t\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\n\t\t\t\t\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\n\n\t\t\t\t\tif(fabs(slope1-slope2) < EPS){ //一直線上\n\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\t\t\t\t\t\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\n\n\t\t\t\t\t\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline1.p[0] = Point(-NUM,mid1.y);\n\t\t\t\t\t\t\tline1.p[1] = Point(NUM,mid1.y);\n\n\t\t\t\t\t\t}else if(fabs(slope1) < EPS){ //水平\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x,NUM);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope1 = (-1.0)/slope1;\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline2.p[0] = Point(-NUM,mid2.y);\n\t\t\t\t\t\t\tline2.p[1] = Point(NUM,mid2.y);\n\n\t\t\t\t\t\t}else if(fabs(slope2) < EPS){ //水平\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x,NUM);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope2 = (-1.0)/slope2;\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcenter = calc_Cross_Point(line1,line2);\n\t\t\t\t\t}\n\n\n\t\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\t\tbool FLG = true;\n\t\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\t\tif(k == a || k == b || k == c)continue;\n\n\t\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\n\n\t\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint tmp_state;\n\n\tfor(int state = 1; state < POW[N]-1; state++){\n\n\t\tV.clear();\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 1; i <= M-1; i++){\n\t\t\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\n\n\t\t\t\ttmp_state = 0;\n\n\t\t\t\tfor(int loop = 0; loop < V.size(); loop++){\n\t\t\t\t\tif(a & POW[loop]){\n\n\t\t\t\t\t\ttmp_state += POW[V[loop]];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\tfor(int i = 1; i <= M; i++){\n\n\t\tans = min(ans,dp[i][POW[N]-1]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.16363636363636364,"time_ms":350,"memory_kb":3800,"score_of_the_acc":-0.1557,"final_rank":17},{"submission_id":"aoj_3034_4399887","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\t\treturn x != p.x? x < p.x: y < p.y;\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\tPoint p[2];\n};\n\nint N,M;\nint POW[15];\ndouble dp[15][1 << 15];\ndouble NUM = 200000;\nPoint point[15];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble calc_slope(Line A){\n\n\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\n\n\t\treturn 0;\n\n\t}else{\n\n\t\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\n\t}\n}\n\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(x1 != x2){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < 15; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tfor(int i = 0; i <= M; i++){\n\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\tdp[i][state] = BIG_NUM;\n\t\t}\n\t}\n\n\tvector<int> V;\n\n\n\tLine line1,line2;\n\tPoint center;\n\n\tfor(int state = 1; state < POW[N]; state++){\n\n\t\tV.clear();\n\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tif(V.size() == 1){\n\n\t\t\tdp[1][state] = 0;\n\t\t\tcontinue;\n\n\t\t}else if(V.size() == 2){\n\n\t\t\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\n\t\t\tcontinue;\n\t\t}\n\n\t\t//3点以上\n\t\tfor(int a = 0; a < V.size()-2; a++){\n\t\t\tfor(int b = a+1; b < V.size()-1; b++){\n\t\t\t\tfor(int c = b+1; c < V.size(); c++){\n\n\t\t\t\t\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\n\t\t\t\t\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\n\n\t\t\t\t\tif(fabs(slope1-slope2) < EPS){ //一直線上\n\n\t\t\t\t\t\tdouble dist1 = calc_dist(point[V[a]],point[V[b]]);\n\t\t\t\t\t\tdouble dist2 = calc_dist(point[V[a]],point[V[c]]);\n\t\t\t\t\t\tdouble dist3 = calc_dist(point[V[b]],point[V[c]]);\n\n\t\t\t\t\t\tif(dist1 > dist2 && dist1 > dist3){\n\n\t\t\t\t\t\t\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\n\t\t\t\t\t\t}else if(dist2 > dist1 && dist2 > dist3){\n\n\t\t\t\t\t\t\tcenter = Point((point[V[a]].x+point[V[c]].x)/2,(point[V[a]].y+point[V[c]].y)/2);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tcenter = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\n\t\t\t\t\t\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\n\n\t\t\t\t\t\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline1.p[0] = Point(-NUM,mid1.y);\n\t\t\t\t\t\t\tline1.p[1] = Point(NUM,mid1.y);\n\n\t\t\t\t\t\t}else if(fabs(slope1) < EPS){ //水平\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x,NUM);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope1 = (-1.0)/slope1;\n\n\t\t\t\t\t\t\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\n\t\t\t\t\t\t\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\n\n\t\t\t\t\t\t\tline2.p[0] = Point(-NUM,mid2.y);\n\t\t\t\t\t\t\tline2.p[1] = Point(NUM,mid2.y);\n\n\t\t\t\t\t\t}else if(fabs(slope2) < EPS){ //水平\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x,NUM);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x,-NUM);\n\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\tslope2 = (-1.0)/slope2;\n\n\t\t\t\t\t\t\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\n\t\t\t\t\t\t\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tcenter = calc_Cross_Point(line1,line2);\n\t\t\t\t\t}\n\n\n\t\t\t\t\tdouble tmp_dist = calc_dist(center,point[V[a]]);\n\n\t\t\t\t\tbool FLG = true;\n\t\t\t\t\tfor(int k = 0; k < V.size(); k++){\n\n\t\t\t\t\t\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\n\n\t\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif(FLG){\n\n\t\t\t\t\t\tdp[1][state] = min(dp[1][state],tmp_dist);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//printf(\"dp[1][%d]:%.1lf\\n\",state,dp[1][state]);\n\t}\n\n\tint tmp_state;\n\n\tfor(int state = 1; state < POW[N]-1; state++){\n\n\t\tV.clear();\n\t\tfor(int loop = 0; loop < N; loop++){\n\t\t\tif(state & POW[loop]){\n\n\t\t\t\t//Do nothing\n\n\t\t\t}else{\n\n\t\t\t\tV.push_back(loop);\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 1; i <= M-1; i++){\n\t\t\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\n\n\t\t\t\ttmp_state = 0;\n\n\t\t\t\tfor(int loop = 0; loop < V.size(); loop++){\n\t\t\t\t\tif(a & POW[loop]){\n\n\t\t\t\t\t\ttmp_state += POW[V[loop]];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\tfor(int i = 1; i <= M; i++){\n\n\t\tans = min(ans,dp[i][POW[N]-1]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.03636363636363636,"time_ms":360,"memory_kb":3784,"score_of_the_acc":-0.1595,"final_rank":20},{"submission_id":"aoj_3034_4106026","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n/* 幾何ライブラリ */\nusing DD = double;\nconst DD INF = 1LL<<60; // to be set appropriately\nconst DD EPS = 1e-10; // to be set appropriately\nconst DD PI = acosl(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n/* Line */\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \", \" << l[1] << '}';}\n};\n\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n return 0;\n}\n\n// 円や直線の交点\nvector<Point> crosspoint(const Line &l, const Line &m) {\n vector<Point> res;\n DD d = cross(m[1] - m[0], l[1] - l[0]);\n if (abs(d) < EPS) return vector<Point>();\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\n return res;\n}\n\n// 外心\nPoint gaisin(Point a, Point b, Point c) {\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\n return crosspoint(ab, bc)[0];\n}\n\n// 最小包含円\nDD mic(const vector<Point> &v) {\n int N = (int)v.size();\n if (N <= 1) return 0;\n\n // 候補\n vector<Point> alt;\n for (int i = 0; i < N; ++i) {\n for (int j = i+1; j < N; ++j) {\n alt.push_back( (v[i] + v[j]) / 2 );\n for (int k = j+1; k < N; ++k) {\n if (simple_ccw(v[i], v[j], v[k]) == 0) continue;\n auto r = gaisin(v[i], v[j], v[k]);\n alt.push_back(r);\n }\n }\n }\n\n // 調べる\n DD res = INF;\n for (auto r : alt) {\n DD tmp = 0;\n for (auto p : v) chmax(tmp, abs(p - r));\n chmin(res, tmp);\n }\n return res;\n}\n\n\nint main() {\n int N, M; cin >> N >> M;\n vector<Point> v(N);\n for (int i = 0; i < N; ++i) cin >> v[i].x >> v[i].y;\n\n // pre\n vector<DD> need(1<<N, 0);\n for (int bit = 0; bit < (1<<N); ++bit) {\n vector<Point> part;\n for (int i = 0; i < N; ++i) {\n if (bit & (1<<i)) part.push_back(v[i]);\n }\n need[bit] = mic(part);\n\n //cout << bit << \": \" << need[bit] << endl;\n }\n \n // bitDP\n vector<vector<DD>> dp(M+1, vector<DD>(1<<N,INF));\n dp[0][0] = 0;\n for (int m = 0; m < M; ++m) {\n for (int bit = 0; bit < (1<<N); ++bit) {\n int rem = ((1<<N)-1) - bit;\n for (int bit2 = rem; ; bit2 = (bit2-1) & rem) {\n chmin(dp[m+1][bit|bit2], max(dp[m][bit], need[bit2]));\n if (!bit2) break;\n }\n }\n }\n \n cout << fixed << setprecision(10) << dp[M][(1<<N)-1] << endl;\n}","accuracy":1,"time_ms":210,"memory_kb":4968,"score_of_the_acc":-0.1413,"final_rank":7},{"submission_id":"aoj_3034_3907741","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nstruct Vector {\n\tdouble x, y;\n\tdouble length() const { return std::sqrt(x * x + y * y); }\n\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\n\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\n\tVector rotate90() const { return Vector{ -y, x }; }\n\tVector flip180() const { return Vector{ -x, -y }; }\n};\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\nstruct Coordinate {\n\tdouble x, y;\n\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\n\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\n\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\n};\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nconstexpr double EPS = 0.000000001;\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (bravers[i].distance_from(center) <= radius + EPS) {\n\t\t\tstate ^= 1 << i;\n\t\t}\n\t}\n\treturn state;\n}\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\n\tif (state == 0) return true;\n\tif (rest == 0) return false;\n\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\n\tmemo[rest][state] = 0;\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\n\t\t\tmemo[rest][state] = 1;\n\t\t\treturn true;\n\t\t}\n\t\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\n\t\t\tauto mid = bravers[i].mid_point(bravers[j]);\n\t\t\tauto vec = bravers[i] - bravers[j];\n\t\t\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\n\t\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\n\t\t\t\tmemo[rest][state] = 1;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\n\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\n\tdouble min = 0.0;\n\tdouble max = 150000;\n\twhile (min + 0.000001 < max) {\n\t\tauto mid = (min + max) / 2;\n\t\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\n\t\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\n\t\telse min = mid;\n\t}\n\tstd::cout << std::setprecision(10) << std::fixed << max << '\\n';\n}","accuracy":1,"time_ms":230,"memory_kb":3600,"score_of_the_acc":-0.0945,"final_rank":2},{"submission_id":"aoj_3034_3907737","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nstruct Vector {\n\tdouble x, y;\n\tdouble length() const { return std::sqrt(x * x + y * y); }\n\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\n\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\n\tVector rotate90() const { return Vector{ -y, x }; }\n\tVector flip180() const { return Vector{ -x, -y }; }\n};\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\nstruct Coordinate {\n\tdouble x, y;\n\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\n\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\n\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\n};\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nconstexpr double EPS = 0.000000001;\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (bravers[i].distance_from(center) <= radius + EPS) {\n\t\t\tstate ^= 1 << i;\n\t\t}\n\t}\n\treturn state;\n}\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\n\tif (state == 0) return true;\n\tif (rest == 0) return false;\n\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\n\tmemo[rest][state] = 0;\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\n\t\t\tmemo[rest][state] = 1;\n\t\t\treturn true;\n\t\t}\n\t\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\n\t\t\tauto mid = bravers[i].mid_point(bravers[j]);\n\t\t\tauto vec = bravers[i] - bravers[j];\n\t\t\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\n\t\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\n\t\t\t\tmemo[rest][state] = 1;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\n\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\n\tdouble min = 0.0;\n\tdouble max = 15000;\n\twhile (min + 0.000001 < max) {\n\t\tauto mid = (min + max) / 2;\n\t\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\n\t\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\n\t\telse min = mid;\n\t}\n\tstd::cout << std::setprecision(10) << std::fixed << max << '\\n';\n}","accuracy":0.07272727272727272,"time_ms":50,"memory_kb":3344,"score_of_the_acc":-0.0044,"final_rank":19},{"submission_id":"aoj_3034_3907733","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nstruct Vector {\n\tdouble x, y;\n\tdouble length() const { return std::sqrt(x * x + y * y); }\n\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\n\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\n\tVector rotate90() const { return Vector{ -y, x }; }\n\tVector flip180() const { return Vector{ -x, -y }; }\n};\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\nstruct Coordinate {\n\tdouble x, y;\n\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\n\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\n\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\n};\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\nconstexpr double EPS = 0.0000001;\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (bravers[i].distance_from(center) <= radius + EPS) {\n\t\t\tstate ^= 1 << i;\n\t\t}\n\t}\n\treturn state;\n}\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\n\tif (state == 0) return true;\n\tif (rest == 0) return false;\n\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\n\tmemo[rest][state] = 0;\n\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\n\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\n\t\t\tmemo[rest][state] = 1;\n\t\t\treturn true;\n\t\t}\n\t\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\n\t\t\tauto mid = bravers[i].mid_point(bravers[j]);\n\t\t\tauto vec = bravers[i] - bravers[j];\n\t\t\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\n\t\t\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\n\t\t\t\tmemo[rest][state] = 1;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\n\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\n\tdouble min = 0.0;\n\tdouble max = 15000;\n\twhile (min + 0.0001 < max) {\n\t\tauto mid = (min + max) / 2;\n\t\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\n\t\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\n\t\telse min = mid;\n\t}\n\tstd::cout << std::setprecision(10) << std::fixed << max << '\\n';\n}","accuracy":0.07272727272727272,"time_ms":40,"memory_kb":3344,"score_of_the_acc":0,"final_rank":18},{"submission_id":"aoj_3034_3416750","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\nint n, m;\nld x[14], y[14];\nld d[14][14];\nld rd[1 << 14];\nbool can(int s,ld r) {\n\tvector<int> v;\n\trep(i, n) {\n\t\tif (s&(1 << i))v.push_back(i);\n\t}\n\tif (v.size() <= 1)return true;\n\tint len = v.size();\n\trep(i, len) {\n\t\tRep(j, i + 1, len) {\n\t\t\tint id = v[i], jd = v[j];\n\t\t\tif (2*r < d[id][jd])return false;\n\t\t\tld X = (x[jd] - x[id]) / 2.0;\n\t\t\tld Y = (y[jd] - y[id]) / 2.0;\n\t\t\tld dist = sqrt(pow(r, 2) - pow(d[id][jd] / 2.0, 2));\n\t\t\tld sr = d[id][jd] / 2.0;\n\t\t\tld x3 = Y * dist / sr; ld y3 = -X * dist / sr;\n\t\t\tld midx = (x[id] + x[jd]) / 2.0, midy = (y[id] + y[jd]) / 2.0;\n\t\t\tld cx = x3 + midx, cy = y3 + midy;\n\t\t\tbool valid = true;\n\t\t\trep(k, len) {\n\t\t\t\tint kd = v[k];\n\t\t\t\tld dis = sqrt(pow(cx - x[kd], 2) + pow(cy - y[kd], 2));\n\t\t\t\tif (dis > r+eps) {\n\t\t\t\t\tvalid = false; break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (valid)return true;\n\t\t\tvalid = true;\n\t\t\tcx = -x3 + midx, cy = -y3 + midy;\n\t\t\trep(k, len) {\n\t\t\t\tint kd = v[k];\n\t\t\t\tld dis = sqrt(pow(cx - x[kd], 2) + pow(cy - y[kd], 2));\n\t\t\t\tif (dis > r+eps) {\n\t\t\t\t\tvalid = false; break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (valid)return true;\n\t\t}\n\t}\n\treturn false;\n}\nld dp[1 << 14], cop[1 << 14];\nint main() {\n\tcin >> n >> m;\n\trep(i, n) {\n\t\tcin >> x[i] >> y[i];\n\t}\n\trep(i, n) {\n\t\trep(j, n) {\n\t\t\td[i][j] = sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2));\n\t\t}\n\t}\n\trep(i, (1 << n)) {\n\t\tld le = 0, ri = 200000;\n\t\twhile (ri - le > eps) {\n\t\t\tld r = (ri + le) / 2;\n\t\t\tif (can(i, r))ri = r;\n\t\t\telse le = r;\n\t\t}\n\t\trd[i] = ri;\n\t}\n\tfill(dp, dp + (1 << n), mod);\n\tdp[0] = 0;\n\trep(aa, m) {\n\t\trep(j, (1 << n)) {\n\t\t\tcop[j] = dp[j];\n\t\t}\n\t\trep(j, (1 << n)) {\n\t\t\tvector<int> v;\n\t\t\trep(i, n) {\n\t\t\t\tif (j&(1 << i))continue;\n\t\t\t\tv.push_back(i);\n\t\t\t}\n\t\t\tint len = v.size();\n\t\t\trep(i, (1 << len)) {\n\t\t\t\tint s = 0;\n\t\t\t\trep(k, len) {\n\t\t\t\t\tif (i&(1 << k))s += (1 << v[k]);\n\t\t\t\t}\n\t\t\t\tcop[j + s] = min(cop[j + s], max(dp[j], rd[s]));\n\t\t\t}\n\t\t}\n\t\trep(j, (1 << n)) {\n\t\t\tdp[j] = cop[j];\n\t\t}\n\t}\n\tcout << fixed << setprecision(5);\n\tcout << dp[(1 << n) - 1] << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":2300,"memory_kb":4064,"score_of_the_acc":-1.0293,"final_rank":14},{"submission_id":"aoj_3034_3407723","code_snippet":"//典型的な前処理O(N * 2^N) + O(M * 3^N)のDPで、最小包含円を求めるのが本質。O(N^3)かけても間に合うのが\n//優しいけど、ちょっとライブラリを探してきた。\n#include <iostream>\n#include <vector>\n#include <complex>\n#include <cassert>\n#include <random>\n#include <algorithm>\n#include <cstdio>\n#include <cmath>\n#define rep(i, n) for(i = 0; i < n; i++)\nusing namespace std;\n\nvoid chmin(double &a, double b) { a = min(a, b); }\n\n//BEGIN: https://tubo28.me/algorithm/minball/\nusing ld = double;\nusing P = complex<ld>;\ndouble eps = 1e-12;\ndouble cross(P a, P b) { return a.real() * b.imag() - a.imag() * b.real(); }\n\ntemplate <class iter>\nstd::pair<P, ld> min_ball(iter left, iter right, int seed = 1333) {\n const int n = right - left;\n\n assert(n >= 1);\n if (n == 1) {\n return {*left, ld(0)};\n }\n\n std::mt19937 mt(seed);\n std::shuffle(left, right, mt);\n // std::random_shuffle(left, right); // simple but deprecated\n\n iter ps = left;\n using circle = std::pair<P, ld>;\n\n auto make_circle_3 = [](const P &a, const P &b, const P &c) -> circle {\n ld A = std::norm(b - c), B = std::norm(c - a), C = std::norm(a - b),\n S = cross(b - a, c - a);\n P p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) / (4 * S * S);\n ld r2 = std::norm(p - a);\n return {p, r2};\n };\n\n auto make_circle_2 = [](const P &a, const P &b) -> circle {\n P c = (a + b) / (ld)2;\n ld r2 = std::norm(a - c);\n return {c, r2};\n };\n\n auto in_circle = [](const P &a, const circle &c) -> bool {\n return std::norm(a - c.first) <= c.second + eps;\n };\n\n circle c = make_circle_2(ps[0], ps[1]);\n\n // MiniDisc\n for (int i = 2; i < n; ++i) {\n if (!in_circle(ps[i], c)) {\n // MiniDiscWithPoint\n c = make_circle_2(ps[0], ps[i]);\n for (int j = 1; j < i; ++j) {\n if (!in_circle(ps[j], c)) {\n // MiniDiscWith2Points\n c = make_circle_2(ps[i], ps[j]);\n for (int k = 0; k < j; ++k) {\n if (!in_circle(ps[k], c)) {\n c = make_circle_3(ps[i], ps[j], ps[k]);\n }\n }\n }\n }\n }\n }\n return c;\n}\n//END\n\nint n, m;\nP p[14];\ndouble radius[1 << 14];\ndouble dp[15][1 << 14];\n\nint main() {\n\tint i, j, k;\n\t\n\tcin >> n >> m;\n\trep(i, n) {\n\t\tdouble x, y; cin >> x >> y;\n\t\tp[i] = P(x, y);\n\t}\n\t\n\trep(i, (1 << n)) {\n\t\tif (i == 0) continue;\n\t\tvector<P> ps;\n\t\trep(j, n) {\n\t\t\tif ((i >> j) % 2 == 1) {\n\t\t\t\tps.push_back(p[j]);\n\t\t\t}\n\t\t}\n\t\tradius[i] = min_ball(ps.begin(), ps.end()).second;\n\t\tradius[i] = sqrt(radius[i]);\n\t}\n\n\tdouble INF = 1e+9;\n\trep(i, n + 1) rep(j, (1 << n)) dp[i][j] = INF;\n\t\n\tdp[0][0] = 0;\n\trep(i, m) {\n\t\trep(j, (1 << n)) {\n\t\t\t//参考：https://kimiyuki.net/blog/2017/07/16/enumerate-sets-with-bit-manipulation/\n\t\t\tint z = (1 << n) - 1 - j;\n\t\t\tfor (int y = 0; ; y = (y - z) & z) {\n\t\t\t\tchmin(dp[i + 1][j + y], max(dp[i][j], radius[y]));\n\t\t\t\tif (y == z) break;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tdouble ans = INF;\n\trep(i, m + 1) {\n\t\tchmin(ans, dp[i][(1 << n) - 1]);\n\t}\n\tprintf(\"%.14f\\n\", ans);\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":5284,"score_of_the_acc":-0.1099,"final_rank":3},{"submission_id":"aoj_3034_3251578","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n/* 基本要素 */\ntypedef complex<double> Point;\ntypedef pair<Point, Point> Line;\ntypedef vector<Point> VP;\nconst double PI = acos(-1);\nconst double EPS = 1e-9; // 許容誤差^2\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 点集合を含む最小の円の中心\nPoint minEnclosingCircle(const VP& ps) {\n Point c;\n double move = 0.5;\n rep(i,30) { // 2^(-39-1) \\approx 0.9e-12\n rep(t,30) {\n double max = 0;\n int k = 0;\n rep (j, ps.size()) if (max < norm(ps[j]-c)) {\n max = norm(ps[j]-c);\n k = j;\n }\n c += (ps[k]-c) * move;\n }\n move /= 2;\n }\n return c;\n}\n\nPoint READ(){\n int x,y;\n cin >>x >>y;\n return Point(x,y);\n}\n\nconst int N = 14;\nconst int INF = 19191919;\nint dp[1<<N];\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n VP p(n);\n rep(i,n) p[i] = READ();\n\n vector<double> r(1<<n);\n for(int mask=1; mask<(1<<n); ++mask){\n VP pts;\n rep(i,n)if(mask>>i&1) pts.pb(p[i]);\n\n Point c = minEnclosingCircle(pts);\n for(Point pp:pts) r[mask] = max(r[mask], abs(pp-c));\n }\n\n auto check = [&](double lim){\n rep(i,1<<n) dp[i] = INF;\n dp[(1<<n)-1] = 0;\n\n for(int mask = (1<<n)-1; mask>0; --mask){\n int sub = mask;\n do{\n sub = sub-1;\n sub &= mask;\n int tgt = mask^sub;\n if(r[tgt] <= lim) dp[sub] = min(dp[sub], dp[mask]+1);\n }while(sub>0);\n }\n\n return dp[0]<=m;\n };\n\n double ng=0, ok = 500000;\n rep(loop,100){\n double mid = (ng+ok)/2;\n if(check(mid)) ok = mid;\n else ng = mid;\n }\n printf(\"%.10f\\n\", ok);\n return 0;\n}","accuracy":1,"time_ms":1800,"memory_kb":3468,"score_of_the_acc":-0.7838,"final_rank":12},{"submission_id":"aoj_3034_2851164","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n/* 幾何の基本 */\n\n#include <complex>\n\ntypedef complex<ld> Point;\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// 点の入力\nPoint input_Point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// 誤差つき等号判定\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// 内積\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// 外積\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// 直線の定義\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// 円の定義\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// ccw\n// 1: a,b,cが反時計周りの順に並ぶ\n//-1: a,b,cが時計周りの順に並ぶ\n// 2: c,a,bの順に直線に並ぶ\n//-2: a,b,cの順に直線に並ぶ\n// 0: a,c,bの順に直線に並ぶ\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\n\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\n\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\n\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\n\treturn 0; // a,c,bの順に直線に並ぶ\n}\n\n\n/* 交差判定 */\n\n// 直線と直線の交差判定\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// 直線と線分の交差判定\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// 線分と線分の交差判定\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 点の直線上判定\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// 点の線分上判定\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// 垂線の足\nPoint proj(const Line &l, const Point& p) {\n\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\n\treturn l.a + t * (l.b - l.a);\n}\n\n//線対象の位置にある点\nPoint reflect(const Line &l, const Point &p) {\n\tPoint pr = proj(l, p);\n\treturn pr * 2.l - p;\n}\n\n// 直線と直線の交点\nPoint is_ll(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n// 直線と直線の交点\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// 線分と線分の交点\n// 重なってる部分あるとassert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//先にisis_ssしてね\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// 線分と線分の交点\nvector<Point> is_ss2(const Line &s, const Line& t) {\n\tvector<Point> kouho(is_ll2(s, t));\n\tvector<Point>ans;\n\tfor (auto p : kouho) {\n\t\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\n\t}\n\treturn ans;\n}\n// 直線と点の距離\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n//直線と直線の距離\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// 直線と線分の距離\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// 線分と点の距離\nld dist_sp(const Line& s, const Point& p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nld dist_ss(const Line& s, const Line& t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\n\n//直線と直線の二等分線のベクトル\nLine line_bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n//点と点の垂直二等分線 aを左に見ながら\nLine point_bisection(const Point&a, const Point&b) {\n\tconst Point cen((a + b) / 2.l);\n\tconst Point vec = (b - a)*Point(0, 1);\n\treturn Line(cen, cen + vec);\n}\n\n//三つの点からなる外心\nPoint outer_center(const vector<Point>&ps) {\n\tassert(ps.size() == 3);\n\tLine l1 = point_bisection(ps[0], ps[1]);\n\tLine l2 = point_bisection(ps[1], ps[2]);\n\n\treturn is_ll(l1, l2);\n}\n\n\n//三つの直線からなる内心\n//三つの直線が並行でないことは確かめといてね\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//三つの直線からなる傍心\n//三つの直線が並行でないことは確かめといてね\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:並行\n//c:並行でない\n//三つの直線から同距離の位置を求める。\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(line_bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* 円 */\n\n// 円と円の交点\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n/*\n点が円の中にいるか\n0 => out\n1 => on\n2 => in*/\nint is_in_Circle(const Point& p, const Circle &cir) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\nint is_in_Circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n/*\n円lcが円rcの中にいるか\n0 => out\n1 => on\n2 => in*/\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// 円と直線の交点\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// 円と線分の距離\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// 円と点の接線\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// 円と円の接線\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), nret.begin(), nret.end());\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//二つの円の重なり面積\nld two_Circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* 多角形 */\n\ntypedef vector<Point> Polygon;\n\n\n\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\n//同一直線上に三つの点がないこと\n#include<random>\nCircle welzl(vector<Point>ps) {\n\tstruct solver {\n\t\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\n\t\t\tif (ps.empty() || rs.size() == 3) {\n\t\t\t\tif (rs.size() == 1) {\n\t\t\t\t\treturn Circle(Point(rs[0]), 0);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 2) {\n\t\t\t\t\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\n\t\t\t\t}\n\t\t\t\telse if (rs.size() == 3) {\n\t\t\t\t\tvector<Line> ls(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\n\t\t\t\t\t}\n\t\t\t\t\tPoint center = outer_center(rs);\n\t\t\t\t\treturn Circle(center, abs(center - rs[0]));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn Circle(Point(), 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPoint p_ba = ps.back();\n\t\t\t\tps.pop_back();\n\t\t\t\tCircle d = solve(ps, rs);\n\t\t\t\tps.push_back(p_ba);\n\t\t\t\tif (is_in_Circle(d, p_ba)) {\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\trs.push_back(p_ba);\n\t\t\t\t\tps.pop_back();\n\t\t\t\t\tauto ans = solve(ps, rs);\n\t\t\t\t\tps.push_back(p_ba);\n\t\t\t\t\trs.pop_back();\n\t\t\t\t\treturn ans;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}so;\n\tstd::random_device rd;\n\tstd::mt19937 mt(rd());\n\tshuffle(ps.begin(), ps.end(), mt);\n\tvector<Point>rs;\n\tCircle ans = so.solve(ps, rs);\n\treturn ans;\n}\n// 面積\nld get_area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n//多角形の回転方向\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// 円の内外判定\n/*0 => out\n1 => on\n2 => in*/\nint is_in_Polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//円の内外判定2 高速\nenum { out, on, in };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// 凸包\n//点や線を返すことも有り得るので注意\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n//凸カット\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon q;\n\tPolygon r;\n\tfor(int i=0;i<n;++i) {\n\t\tPoint a = ps[i], b = ps[(i + 1) % n];\n\t\tLine m = Line(a, b);\n\t\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\n\t\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\n\t\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\n\t\t\tq.push_back(is_ll(l, m));\n\t\t\tr.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ q,r };\n\treturn polys;\n}\n\n\n/* アレンジメント */\nvoid add_Point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\nbool solve(vector<pair<ld, vector<int>>>bombs, int N, int M, ld len) {\n\t{\n\t\tauto n_bombs(bombs);\n\t\tn_bombs.clear();\n\t\tfor (int i = 0; i < bombs.size(); ++i) {\n\t\t\tld r=bombs[i].first;\n\t\t\tif(r<len)n_bombs.emplace_back(bombs[i]);\n\t\t}\n\t\tbombs=n_bombs;\n\t}\n\n\tvector<vector<int>>memo(M+1,vector<int>(1<<N));\n\tmemo[0][0]=true;\n\tfor (int b_use = 0; b_use < M; ++b_use) {\n\t\tfor (int i = 0; i < (1 << N); ++i) {\n\t\t\tif(!memo[b_use][i])continue;\n\n\t\t\tfor (auto&& now_b : bombs) {\n\n\t\t\t\tbitset<14>bs(i);\n\t\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\t\tif(now_b.second[j])bs[j]=true;\n\t\t\t\t}\n\t\t\t\tmemo[b_use+1][bs.to_ulong()]=true;\n\t\t\t}\n\t\t}\n\t}\n\treturn memo[M][(1<<N)-1];\n}\n\n\n\nint main() {\n\tint N,M;cin>>N>>M;\n\tvector<Point>pos;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint x,y;cin>>x>>y;\n\t\tpos.push_back(Point(x,y));\n\t}\n\n\tvector<pair<ld,vector<int>>>bombs;\n\t{\n\t\tvector<int>v(3);\n\t\tfor (v[0] = 0; v[0] < N; ++v[0]) {\n\t\t\t{\n\t\t\t\tld r=1e-8;\n\t\t\t\tCircle c(pos[v[0]], r);\n\n\t\t\t\tvector<int>oks(N);\n\t\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\tif (is_in_Circle(c, pos[i])) {\n\t\t\t\t\t\toks[i] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbombs.push_back(make_pair(r, oks));\n\t\t\t}\n\t\t\tfor ( v[1] = v[0] + 1; v[1] < N; ++v[1]) {\n\t\t\t\t{\n\t\t\t\t\tPoint p((pos[v[0]]+pos[v[1]])/2.0l);\n\t\t\t\t\tconst ld r = abs(p - pos[v[0]]);\n\t\t\t\t\tCircle c(p, r);\n\n\t\t\t\t\tvector<int>oks(N);\n\t\t\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\t\tif (is_in_Circle(c, pos[i])) {\n\t\t\t\t\t\t\toks[i] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbombs.push_back(make_pair(r, oks));\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor (v[2] = v[1] + 1; v[2] < N; ++v[2]) {\n\t\t\t\t\tvector<Point>ci_pos(3);\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tci_pos[i]=pos[v[i]];\n\t\t\t\t\t}\n\t\t\t\t\tLine l1 = point_bisection(ci_pos[0], ci_pos[1]);\n\t\t\t\t\tLine l2 = point_bisection(ci_pos[1], ci_pos[2]);\n\t\t\t\t\tPoint sv = l1.b - l1.a, tv = l2.b - l2.a;\n\t\t\t\t\tif (abs(cross(sv, tv)) < eps) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tPoint p(outer_center(ci_pos));\n\t\t\t\t\tconst ld r=abs(p-ci_pos[0]);\n\t\t\t\t\tCircle c(p,r);\n\n\t\t\t\t\tvector<int>oks(N);\n\t\t\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\t\t\tif (is_in_Circle(c, pos[i])) {\n\t\t\t\t\t\t\toks[i]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbombs.push_back(make_pair(r,oks));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tmap<int, ld>mp;\n\t\tfor (auto&& bomb : bombs) {\n\t\t\tbitset<14>bs;\n\t\t\tfor (int i = 0; i < bomb.second.size(); ++i) {\n\t\t\t\tif(bomb.second[i])bs[i]=true;\n\t\t\t}\n\t\t\tif (mp.find(bs.to_ulong()) == mp.end()) {\n\t\t\t\tmp[bs.to_ulong()]=bomb.first;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmp[bs.to_ulong()]=min(bomb.first,mp[bs.to_ulong()]);\n\t\t\t}\n\t\t}\n\t\tauto n_bombs(bombs);\n\t\tn_bombs.clear();\n\t\tfor (auto m : mp) {\n\t\t\tbitset<14>bs(m.first);\n\t\t\tvector<int>v(N);\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tif(bs[i])v[i]=true;\n\t\t\t}\n\t\t\tn_bombs.emplace_back(m.second,v);\n\t\t}\n\t\tbombs=n_bombs;\n\t}\n\n\tld l=0,r=1e5;\n\tint time=30;\n\twhile (time--) {\n\t\tld m=(l+r)/2;\n\t\tif (solve(bombs, N, M, m)) {\n\t\t\tr=m;\n\t\t}\n\t\telse {\n\t\t\tl=m;\n\t\t}\n\t}\n\tcout<<setprecision(10)<<fixed;\n\tcout<<l<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":970,"memory_kb":4004,"score_of_the_acc":-0.4384,"final_rank":11},{"submission_id":"aoj_3034_2832917","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;++i)\n#define rep(i,n) REP(i,0,n)\n#define ALL(x) x.begin(),x.end()\n#define EPS (1e-8)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1 \n#define ONLINE_BACK 2\n#define ONLINE_FRONT -2\n#define ON_SEGMENT 0\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> ii;\n\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\n\n\nconst int MAX_V = 2000; /////////////////////////////////////////////////////////////\n\nstruct Edge{ int to,cap,rev; };\n\nvector<Edge> G[MAX_V];\nbool used[MAX_V];\n\nvoid add_edge(int from,int to,int cap){\n G[from].push_back((Edge){to,cap,(int)G[to].size()});\n G[to].push_back((Edge){from,0,(int)G[from].size()-1});\n}\n\nint dfs(int v,int t,int f){\n if( v == t ) return f;\n used[v] = true;\n for(int i=0;i<(int)G[v].size();i++){\n Edge &e = G[v][i];\n if( !used[e.to] && e.cap > 0 ){\n int d = dfs(e.to,t,min(f,e.cap));\n if( d > 0 ){\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow = 0;\n for(;;){\n memset(used,0,sizeof(used));\n int f = dfs(s,t,INT_MAX);\n if( f == 0 ) return flow;\n flow += f;\n }\n}\n\nvoid init(int _size=MAX_V){ rep(i,_size) G[i].clear(); }\n\n\n\nclass Point{\npublic:\n double x,y;\n\n Point(double x = 0,double y = 0): x(x),y(y){}\n\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\n\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\n\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\n\n};\n\nstruct Segment{\n Point p1,p2;\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\n\n};\n\ntypedef Point Vector;\ntypedef Segment Line;\ntypedef vector<Point> Polygon;\n\nostream& operator << (ostream& os,const Point& a){ return os << \"(\" << a.x << \",\" << a.y << \")\"; }\n\nostream& operator << (ostream& os,const Segment& a){ return os << \"( \" << a.p1 << \" , \" << a.p2 << \" )\"; }\n\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\n\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\n\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\n\ndouble abs(Point a){ return sqrt(norm(a)); }\n\n//rad は角度をラジアンで持たせること\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\n\n// 度をラジアンに変換\ndouble toRad(double agl){ return agl*M_PI/180.0; }\n\n// a => prev, b => cur, c=> next\n// prev から cur へ行って next へ行く際の角度を求める\ndouble getArg(Point a,Point b,Point c){\n double arg1 = atan2(b.y-a.y,b.x-a.x);\n double arg2 = atan2(c.y-b.y,c.x-b.x);\n double arg = fabs( arg1 - arg2 );\n while( arg > M_PI ) arg -= 2.0 * M_PI;\n return fabs(arg);\n}\n\n\n\n\n\n\nint N,M;\nPoint ps[111];\n\nint dp[20*20*20][1<<14];\nint calc(int n,double r) {\n vector<int> vec;\n\n rep(i,n) {\n int bits = 0;\n rep(j,n) {\n if( LTE(abs(ps[i]-ps[j]),r) ) {\n\tbits |= (1<<j);\n }\n }\n vec.push_back(bits);\n }\n \n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i == j)continue;\n Point Rr = ps[i]-ps[j];\n if(abs(Rr) <= r*2+EPS || 1){\n\tPoint UKPC,U,P1,P2;\n\tUKPC = (ps[i]+ps[j])*0.5;\n\tdouble l = abs(ps[i]-ps[j]) * 0.5;\n\tif( LTE(r * r - l * l,0) ) continue;\n\tdouble T = sqrt(r*r-l*l);\n\t\n\tUKPC = (ps[i]+ps[j])*0.5;\n\t//P1 = UKPC + (ps[i]-point[j])/abs(point[i]-point[j])*polar(T,PI/2.0);\n\tPoint uni = (ps[i] - ps[j]) / abs(ps[i]-ps[j]);\n\t//cout << \"uni = \" << uni <<endl;\n\t//P1 = UKPC + (T*((ps[i]-ps[j])/abs(ps[i]-ps[j])))*\n\tP1 = UKPC + rotate(uni,M_PI/2.0) * T;\n\t//P2 = UKPC + (ps[i]-point[j])/abs(point[i]-point[j])*polar(T,-PI/2.0);\n\t//P2 = UKPC + (ps[i]-ps[j])/abs(ps[i]-ps[j])*rotate(T,-M_PI/2.0);\n\tP2 = UKPC + rotate(uni,-M_PI/2.0) * T;\n\t/*\n\tputs(\"\");\n\tcout << ps[i] << \" and \" << ps[j] << endl;\n\tcout << \"UKPC = \" << UKPC << endl;\n\tcout << \"T = \" << T << endl;\n\tcout << \"P1 = \" << P1 << \", P2 = \" << P2 << endl;\n\t*/\n\t//cout << ps[i] << \" and \" << ps[j] <<endl;;\n\tdouble Calc;\n\tint bits = 0;\n\tfor(int k=0;k<n;k++){\n\t Calc = abs(P1-ps[k]);\n\t if(fabs(Calc) < r+EPS){\n\t bits |= (1<<k);\n\t }\n\t}\n\t//bitset<5> BIT(bits);\n\t//cout << BIT << endl;\n\tvec.push_back(bits);\n\tbits = 0;\n\tfor(int k=0;k<n;k++){\n\t Calc = abs(P2-ps[k]);\n\t if(fabs(Calc) < r+EPS){\n\t bits |= (1<<k);\n\t }\n\t}\n\t//BIT = bits;\n\t//cout << BIT << endl;\n\tvec.push_back(bits);\n \n }\n \n }\n }\n assert(vec.size()<20*20*20);\n int len = vec.size();\n rep(i,len+1) rep(j,(1<<n)) {\n dp[i][j] = INT_MAX;\n }\n dp[0][0] = 0;\n\n rep(i,len) {\n rep(j,(1<<n)) {\n int bits = vec[i];\n dp[i+1][j] = min(dp[i+1][j|bits],dp[i][j]);\n if( dp[i][j] == INT_MAX ) continue;\n dp[i+1][j|bits] = min(dp[i+1][j|bits],dp[i][j]+1);\n\n }\n }\n int resp = dp[len][(1<<n)-1];\n return resp;\n}\n\nbool check(double r) {\n return calc(N,r) <= M;\n}\n\nvoid compute() {\n double L=0,R=100000000;//fewopajfeaw\n rep(_,100) {//feoajfewao\n double _M = ( L + R ) * 0.5;\n if( check(_M) ) {\n R = _M;\n } else {\n L = _M;\n }\n }\n printf(\"%.10f\\n\",L);\n}\n\nint main() {\n cin >> N >> M;\n rep(i,N) cin >> ps[i].x >> ps[i].y;\n compute();\n return 0;\n}","accuracy":1,"time_ms":1270,"memory_kb":27928,"score_of_the_acc":-1.5442,"final_rank":15},{"submission_id":"aoj_3034_2812330","code_snippet":"// 基本テンプレート\n \n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\nusing ld = double;\nusing P = complex<ld>;\nusing G = vector<P>;\nconst ld pi = acos(-1);\nconst ld eps = 1e-10;\nconst ld inf = 1e12;\n \nld cross(const P& a, const P& b) { return a.real()*b.imag() - a.imag()*b.real(); }\nld dot(const P& a, const P& b) { return a.real()*b.real() + a.imag()*b.imag(); }\n\nusing C = pair<ld, P>;\n#define rad first\n#define pnt second\n \nC smallest_enclosing_disc(vector<P> ps){\n auto c3 = [](const P &a, const P &b, const P &c){\n ld A = norm(b - c);\n ld B = norm(c - a);\n ld C = norm(a - b);\n ld S = abs(cross(b - a, c - a));\n P p = (A*(B+C-A)*a + B*(C+A-B)*b + C*(A+B-C)*c) / (4*S*S);\n ld r = abs(p - a);\n return make_pair(r, p);\n };\n \n auto c2 = [](const P &a, const P &b){\n P c = (a + b) / (ld)2;\n ld r = abs(a - c);\n return make_pair(r, c);\n };\n \n auto in_circle = [](const P &a, const C &c){\n return norm(a - c.pnt) <= c.rad*c.rad + eps;\n };\n \n int n = ps.size();\n if(n == 1) return make_pair(0, ps[0]);\n random_shuffle(ps.begin(), ps.end());\n C c = c2(ps[0], ps[1]);\n for(int i = 2; i < n; ++i){\n if(!in_circle(ps[i], c)){\n c = c2(ps[0], ps[i]);\n for(int j = 1; j < i; ++j){\n if(!in_circle(ps[j], c)){\n c = c2(ps[j], ps[i]);\n for(int k = 0; k < j; ++k){\n if(!in_circle(ps[k], c)){\n c = c3(ps[i], ps[j], ps[k]);\n }\n }\n }\n }\n }\n }\n return c;\n}\n\ndouble circle_r[1 << 14];\ndouble dp[1 << 14][20];\ndouble solve(int bit, int k) {\n if(dp[bit][k] >= 0) return dp[bit][k];\n if(k == 1) return dp[bit][k] = circle_r[bit];\n \n dp[bit][k] = inf;\n for(int part=bit; part>0; part=(part-1)&bit) {\n int nbit = bit ^ part;\n chmin(dp[bit][k], max(solve(nbit, k-1), circle_r[part]));\n // printf(\"lhs(%lld, %lld) = %.12f, rhs(%lld) = %.12f\\n\", nbit, k-1, dp[nbit][k-1], part, circle_r[part]);\n }\n // printf(\"dp[%lld][%lld] = %.12f\\n\", bit, k, dp[bit][k]);\n return dp[bit][k];\n}\n \nsigned main() {\n int N, M; cin >> N >> M;\n vector<P> ps;\n for(int i=0; i<N; i++) {\n double x, y; cin >> x >> y;\n ps.push_back(P(x, y));\n }\n\n for(int bit=1; bit<(1<<N); bit++) {\n vector<P> tmp;\n for(int i=0; i<N; i++) {\n if(bit >> i & 1) tmp.push_back(ps[i]);\n }\n circle_r[bit] = smallest_enclosing_disc(tmp).first;\n // printf(\"circle_r[%lld] = %.12f\\n\", bit, circle_r[bit]);\n }\n\n for(int i=0; i<(1 << N); i++) {\n fill(dp[i], dp[i] + 20, -1);\n }\n printf(\"%.12f\\n\", solve((1 << N) - 1, M));\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":5956,"score_of_the_acc":-0.1195,"final_rank":4},{"submission_id":"aoj_3034_2756312","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Real = double;\nusing Point = complex< Real >;\nconst Real EPS = 1e-8, PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\nPoint rotate(Real theta, const Point &p) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) {\n return (r * 180.0 / PI);\n}\n\nReal degree_to_radian(Real d) {\n return (d * PI / 180.0);\n}\n\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n const Point v(b - a), w(c - b);\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n if(alpha > beta) swap(alpha, beta);\n Real theta = (beta - alpha);\n return min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n\nstruct Line {\n Point a, b;\n\n Line() = default;\n\n Line(Point a, Point b) : a(a), b(b) {}\n\n Line(Real A, Real B, Real C) // Ax + By = C\n {\n if(eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\n else if(eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\n else a = Point(0, C / B), b = Point(C / A, 0);\n }\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" to \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\nstruct Segment : Line {\n Segment() = default;\n\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n Point p;\n Real r;\n\n Circle() = default;\n\n Circle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector< Point >;\nusing Polygon = vector< Point >;\nusing Segments = vector< Segment >;\nusing Lines = vector< Line >;\nusing Circles = vector< Circle >;\n\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - imag(a) * real(b);\n}\n\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n if(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n if(dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n if(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) {\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\nbool intersect(const Line &l, const Point &p) {\n return abs(ccw(l.a, l.b, p)) != 1;\n}\n\nbool intersect(const Line &l, const Line &m) {\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\n}\n\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\nbool intersect(const Line &l, const Segment &s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) {\n return distance(l, c.p) <= c.r + EPS;\n}\n\nbool intersect(const Circle &c, const Point &p) {\n return abs(abs(p - c.p) - c.r) < EPS;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nbool intersect(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n if(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n if(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n const Point h = projection(l, c.p);\n if(dot(l.a - h, l.b - h) < 0) return 2;\n return 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r < d) return 4;\n if(eq(c1.r + c2.r, d)) return 3;\n if(c1.r - c2.r < d) return 2;\n if(eq(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\nReal distance(const Point &a, const Point &b) {\n return abs(a - b);\n}\n\nReal distance(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\nReal distance(const Line &l, const Line &m) {\n return intersect(l, m) ? 0 : distance(l, m.a);\n}\n\nReal distance(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(intersect(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n if(intersect(a, b)) return 0;\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n if(intersect(l, s)) return 0;\n return min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) {\n return crosspoint(Line(l), Line(m));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair< Point, Point > crosspoint(const Circle &c, const Line l) {\n Point pr = projection(l, c.p);\n Point e = (l.b - l.a) / abs(l.b - l.a);\n if(eq(distance(l, c.p), c.r)) return {pr, pr};\n double base = sqrt(c.r * c.r - norm(pr - c.p));\n return {pr - e * base, pr + e * base};\n}\n\npair< Point, Point > crosspoint(const Circle &c, const Segment &l) {\n Line aa = Line(l.a, l.b);\n if(intersect(c, l) == 2) return crosspoint(c, aa);\n auto ret = crosspoint(c, aa);\n if(dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\n else ret.first = ret.second;\n return ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair< Point, Point > crosspoint(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\npair< Point, Point > tangent(const Circle &c1, const Point &p2) {\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if(c1.r < c2.r) swap(c1, c2);\n Real g = norm(c1.p - c2.p);\n if(eq(g, 0)) return ret;\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI * 0.5, u);\n for(int s : {-1, 1}) {\n Real h = (c1.r + s * c2.r) / sqrt(g);\n if(eq(1 - h * h, 0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if(1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n }\n }\n return ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\nbool is_convex(const Polygon &p) {\n int n = (int) p.size();\n for(int i = 0; i < n; i++) {\n if(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n }\n return true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\nPolygon convex_hull(Polygon &p) {\n int n = (int) p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n vector< Point > ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]) {\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\nenum {\n OUT, ON, IN\n};\n\nint contains(const Polygon &Q, const Point &p) {\n bool in = false;\n for(int i = 0; i < Q.size(); i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvoid merge_segments(vector< Segment > &segs) {\n\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\n if(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n if(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n if(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n return true;\n };\n\n for(int i = 0; i < segs.size(); i++) {\n if(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n }\n for(int i = 0; i < segs.size(); i++) {\n for(int j = i + 1; j < segs.size(); j++) {\n if(merge_if_able(segs[i], segs[j])) {\n segs[j--] = segs.back(), segs.pop_back();\n }\n }\n }\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\nvector< vector< int > > segment_arrangement(vector< Segment > &segs, vector< Point > &ps) {\n vector< vector< int > > g;\n int N = (int) segs.size();\n for(int i = 0; i < N; i++) {\n ps.emplace_back(segs[i].a);\n ps.emplace_back(segs[i].b);\n for(int j = i + 1; j < N; j++) {\n const Point p1 = segs[i].b - segs[i].a;\n const Point p2 = segs[j].b - segs[j].a;\n if(cross(p1, p2) == 0) continue;\n if(intersect(segs[i], segs[j])) {\n ps.emplace_back(crosspoint(segs[i], segs[j]));\n }\n }\n }\n sort(begin(ps), end(ps));\n ps.erase(unique(begin(ps), end(ps)), end(ps));\n\n int M = (int) ps.size();\n g.resize(M);\n for(int i = 0; i < N; i++) {\n vector< int > vec;\n for(int j = 0; j < M; j++) {\n if(intersect(segs[i], ps[j])) {\n vec.emplace_back(j);\n }\n }\n for(int j = 1; j < vec.size(); j++) {\n g[vec[j - 1]].push_back(vec[j]);\n g[vec[j]].push_back(vec[j - 1]);\n }\n }\n return (g);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\nPolygon convex_cut(const Polygon &U, Line l) {\n Polygon ret;\n for(int i = 0; i < U.size(); i++) {\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n ret.push_back(crosspoint(Line(now, nxt), l));\n }\n }\n return (ret);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\nReal area2(const Polygon &p) {\n Real A = 0;\n for(int i = 0; i < p.size(); ++i) {\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\nReal area2(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(eq(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\nReal convex_diameter(const Polygon &p) {\n int N = (int) p.size();\n int is = 0, js = 0;\n for(int i = 1; i < N; i++) {\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n j = (j + 1) % N;\n } else {\n i = (i + 1) % N;\n }\n if(norm(p[i] - p[j]) > maxdis) {\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n } while(i != is || j != js);\n return sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\nReal closest_pair(Points ps) {\n if(ps.size() <= 1) throw (0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) {\n return imag(a) < imag(b);\n };\n vector< Point > beet(ps.size());\n const Real INF = 1e18;\n\n function< Real(int, int) > rec = [&](int left, int right) {\n if(right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = real(ps[mid]);\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for(int i = left; i < right; i++) {\n if(abs(real(ps[i]) - x) >= ret) continue;\n for(int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if(imag(luz) >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int) ps.size());\n}\n\nReal smallest_enclosing_circle(Points &ps) {\n if(ps.size() == 1) return 0;\n\n mt19937 mt;\n mt.seed(random_device()());\n shuffle(begin(ps), end(ps), mt);\n\n auto make_circle3 = [](const Point &a, const Point &b, const Point &c) {\n auto A = norm(b - c), B = norm(c - a), C = norm(a - b);\n auto S = abs(cross(b - a, c - a));\n auto p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) * 0.25 / S / S;\n return Circle(p, abs(p - a));\n };\n\n auto make_circle2 = [](const Point &a, const Point &b) {\n Point c = (a + b) * 0.5;\n return Circle(c, abs(a - c));\n };\n\n auto in_circle = [](const Point &a, const Circle &c) {\n return norm(a - c.p) < c.r * c.r + EPS;\n };\n\n Circle c = make_circle2(ps[0], ps[1]);\n for(int i = 2; i < ps.size(); ++i) {\n if(!in_circle(ps[i], c)) {\n c = make_circle2(ps[0], ps[i]);\n for(int j = 1; j < i; ++j) {\n if(!in_circle(ps[j], c)) {\n c = make_circle2(ps[j], ps[i]);\n for(int k = 0; k < j; ++k) {\n if(!in_circle(ps[k], c)) {\n c = make_circle3(ps[i], ps[j], ps[k]);\n }\n }\n }\n }\n }\n }\n return c.r;\n}\n\ndouble cover[1 << 14];\ndouble dp[1 << 14][15];\nbool memo[1 << 14][15];\n\ndouble rec(int bit, int sum) {\n if(sum == 1) return cover[bit];\n if(memo[bit][sum]) return dp[bit][sum];\n double ret = 1e9;\n for(int i = bit & (bit - 1); i > 0; i = (i - 1) & bit) {\n int other = i ^bit;\n ret = min(ret, max(rec(other, sum - 1), cover[i]));\n }\n memo[bit][sum] = true;\n return dp[bit][sum] = ret;\n}\n\nint main() {\n int N, M;\n Point p[14];\n\n cin >> N >> M;\n for(int i = 0; i < N; i++) {\n cin >> p[i];\n }\n for(int i = 1; i < (1 << N); i++) {\n Points ps;\n for(int j = 0; j < N; j++) {\n if((i >> j) & 1) ps.emplace_back(p[j]);\n }\n cover[i] = smallest_enclosing_circle(ps);\n }\n cout << fixed << setprecision(10) << rec((1 << N) - 1, M) << endl;\n}","accuracy":1,"time_ms":140,"memory_kb":5668,"score_of_the_acc":-0.1388,"final_rank":5},{"submission_id":"aoj_3034_2755890","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define rep(i,n) for(int i=0;i<n;i++)\n#define D long double\nusing namespace std;\n//typedef long double D;\ntypedef complex<long double> P;\ntypedef vector<P> VP;\ntypedef pair<P, P> L; // Line\ntypedef vector<P> VP;\nconst D EPS = 1e-9; // 許容誤差。問題によって変える\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) < (m) + EPS)\n#define GE(n,m) ((n) + EPS > (m))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\nD dot(P a, P b) {return (conj(a)*b).X; }\nD cross(P a, P b) { return (conj(a)*b).Y;}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b,c) > EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\nbool isecSP(P a1, P a2, P b) {\n return !ccw(a1, a2, b);\n}\nP crosspointLL(P a1, P a2, P b1, P b2) {\n long double d1 = cross(b2-b1, b1-a1);\n long double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n if (EQ(d2, 0)) throw \"kouten ga nai\"; // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\nP circumcenter(P a, P b, P c) {\n a = (a-c)*(long double)0.5;\n b = (b-c)*(long double)0.5;\n return c + crosspointLL(a, a*P(1,1), b, b*P(1,1));\n}\nint dp[1<<14],n,m;\nD min_s[1<<14];\nVP v;\nvoid Mae_syori(){\n r(i,(1<<n))min_s[i]=1e15;\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n for(int k=j+1;k<n;k++){\n if(isecSP(v[i],v[j],v[k]))continue;\n if(isecSP(v[i],v[k],v[j]))continue;\n if(isecSP(v[k],v[j],v[i]))continue;\n P c=circumcenter(v[i],v[j],v[k]);\n D ans=0;\n ans=max(ans,abs(v[i]-c));\n ans=max(ans,abs(v[j]-c));\n ans=max(ans,abs(v[k]-c));\n int mask=0;\n for(int l=0;l<n;l++){\n if(abs(v[l]-c)<=ans)mask|=(1<<l);\n }\n min_s[mask]=min(ans,min_s[mask]);\n }\n D ans=abs(v[i]-v[j])/2;\n P c=(v[i]+v[j]);c/=2;\n int mask=0;\n for(int l=0;l<n;l++){\n if(abs(v[l]-c)<=ans)mask|=(1<<l);\n }\n min_s[mask]=min(ans,min_s[mask]);\n }\n }\n r(i,n)min_s[(1<<i)]=0;\n for(int i=(1<<n)-1;i>=0;i--){\n for(int j=(i-1)&i;j>0;j=(j-1)&i){\n min_s[j]=min(min_s[j],min_s[i]);\n }\n }\n for(int i=0;i<(1<<n);i++) min_s[i]+=0.0000000001;\n}\nD dfs(int S){\n if(dp[S])return dp[S];\n D res=1e8;\n for(int i=(S-1)&S;i>0;i=(i-1)&S){\n res=min(res,dfs(i)+dfs(i^S));\n }\n return dp[S]=res;\n}\nbool check(D mid){\n memset(dp,0,sizeof(dp));\n for(int i=1;i<(1<<n);i++){\n if(min_s[i]<=mid)dp[i]=1;\n }\n return dfs((1<<n)-1)<=m;\n}\nD nibutan(){\n D l=0,r=100000;\n r(i,77){\n D mid=(l+r)/2;//cout<<mid<<endl;\n if(check(mid))r=mid;\n else l=mid;\n }\n return l;\n}\nint main(){\n cin>>n>>m;\n r(i,n){\n int x,y;\n cin>>x>>y;\n v.push_back(P(x,y));\n }\n Mae_syori();\n printf(\"%.12Lf\\n\",nibutan());\n}","accuracy":1,"time_ms":2020,"memory_kb":3616,"score_of_the_acc":-0.8872,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3034_10198826\",\n \"code_snippet\": \"// AOJ #3034\\n// Explosion 2025.2.6\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n \\nstruct Point { double x, y; };\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N, M;\\n cin >> N >> M;\\n vector<Point> pts(N);\\n for (int i = 0; i < N; i++){\\n cin >> pts[i].x >> pts[i].y;\\n }\\n\\n if(M >= N){\\n cout << fixed << setprecision(12) << 0.0 << endl;\\n return 0;\\n }\\n \\n double eps = 1e-9;\\n // 上界の設定：入力点間の最大距離\\n double high = 0.0;\\n for (int i = 0; i < N; i++){\\n for (int j = i+1; j < N; j++){\\n double dx = pts[i].x - pts[j].x;\\n double dy = pts[i].y - pts[j].y;\\n double d = sqrt(dx*dx + dy*dy);\\n high = max(high, d);\\n }\\n }\\n // N==1 の場合 high==0 のはず．\\n \\n // 二分探索のための関数：r で全員を M 回以内の爆発でカバーできるか\\n auto canCover = [&](double r) -> bool {\\n vector<int> candidateMasks;\\n \\n // (1) 各勇者の座標を中心にする候補\\n for (int i = 0; i < N; i++){\\n int mask = 0;\\n for (int j = 0; j < N; j++){\\n double dx = pts[j].x - pts[i].x;\\n double dy = pts[j].y - pts[i].y;\\n if (sqrt(dx*dx + dy*dy) <= r + eps)\\n mask |= (1 << j);\\n }\\n candidateMasks.push_back(mask);\\n }\\n \\n // (2) 各2点間の円の交点を候補とする\\n for (int i = 0; i < N; i++){\\n for (int j = i+1; j < N; j++){\\n double dx = pts[j].x - pts[i].x;\\n double dy = pts[j].y - pts[i].y;\\n double d = sqrt(dx*dx + dy*dy);\\n if (d > 2*r + eps) continue;\\n \\n double mx = (pts[i].x + pts[j].x) / 2.0;\\n double my = (pts[i].y + pts[j].y) / 2.0;\\n double h = sqrt(max(0.0, r*r - (d/2.0)*(d/2.0)));\\n double ux = -dy / d;\\n double uy = dx / d;\\n \\n for (int sign = -1; sign <= 1; sign += 2){\\n double cx = mx + sign * h * ux;\\n double cy = my + sign * h * uy;\\n int mask = 0;\\n for (int k = 0; k < N; k++){\\n double dx2 = pts[k].x - cx;\\n double dy2 = pts[k].y - cy;\\n if(sqrt(dx2*dx2 + dy2*dy2) <= r + eps)\\n mask |= (1 << k);\\n }\\n candidateMasks.push_back(mask);\\n }\\n }\\n }\\n \\n int FULL = (1 << N) - 1;\\n vector<int> dp(1 << N, INT_MAX);\\n dp[0] = 0;\\n for (int mask = 0; mask < (1 << N); mask++){\\n if(dp[mask] == INT_MAX) continue;\\n for (int cmask : candidateMasks){\\n int newMask = mask | cmask;\\n dp[newMask] = min(dp[newMask], dp[mask] + 1);\\n }\\n }\\n return dp[FULL] <= M;\\n };\\n \\n double lo = 0.0, hi = high;\\n for (int iter = 0; iter < 60; iter++){\\n double mid = (lo + hi) / 2.0;\\n if (canCover(mid)) hi = mid;\\n else lo = mid;\\n }\\n cout << fixed << setprecision(12) << hi << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.0147,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3034_4610503\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\\n#define SORT(v, n) sort(v, v + n);\\n#define REVERSE(v, n) reverse(v, v+n);\\n#define vsort(v) sort(v.begin(), v.end());\\n#define all(v) v.begin(), v.end()\\n#define mp(n, m) make_pair(n, m);\\n#define cout(d) cout<<d<<endl;\\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\\n#define cinline(n) getline(cin,n);\\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\\n#define PI (acos(-1))\\n#define FILL(v, n, x) fill(v, v + n, x);\\n#define sz(x) long long(x.size())\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vs = vector<string>;\\nusing vpll = vector<pair<ll, ll>>;\\nusing vtp = vector<tuple<ll,ll,ll>>;\\nusing vb = vector<bool>;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nconst ll INF = 1e9;\\nconst ll MOD = 1e9+7;\\nconst ll LINF = 1e18;\\n\\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\\n\\n/* 幾何ライブラリ */\\nusing DD = double;\\nconst DD EPS = 1e-10; // to be set appropriately\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n/* Line */\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \\\", \\\" << l[1] << '}';}\\n};\\n\\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n return 0;\\n}\\n\\n// 円や直線の交点\\nvector<Point> crosspoint(const Line &l, const Line &m) {\\n vector<Point> res;\\n DD d = cross(m[1] - m[0], l[1] - l[0]);\\n if (abs(d) < EPS) return vector<Point>();\\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\\n return res;\\n}\\n\\n// 外心\\nPoint gaisin(Point a, Point b, Point c) {\\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\\n return crosspoint(ab, bc)[0];\\n}\\n\\n// 最小包含円\\ndouble minimum_bounding_circle(vector<Point>& v){\\n ll n=v.size();\\n if(n<=1) return 0;\\n \\n vector<Point> cond; // 候補\\n rep(i,n) irep(j,i+1,n){\\n cond.push_back((v[i]+v[j])/2);\\n irep(k,j+1,n){\\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\\n auto p=gaisin(v[i],v[j],v[k]);\\n cond.push_back(p);\\n }\\n }\\n \\n double res=INF;\\n for(auto e: cond){\\n double tmp=0;\\n rep(i,n) chmax(tmp,abs(e-v[i]));\\n chmin(res,tmp);\\n }\\n \\n return res;\\n}\\n\\nconst ll maxn=1<<14;\\ndouble dp1[maxn]; // 最小包含円の半径\\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\\n\\nsigned main()\\n{\\n cin.tie( 0 ); ios::sync_with_stdio( false );\\n \\n ll n,m; cin>>n>>m;\\n vector<Point> v;\\n set<Point> exist;\\n rep(i,n){\\n ll x,y; cin>>x>>y;\\n Point p=Point(x,y);\\n if(exist.count(p)) continue;\\n v.push_back(p);\\n exist.insert(p);\\n }\\n n=v.size();\\n \\n if(n<=m){\\n cout<<0<<endl;\\n return 0;\\n }\\n \\n rep(s,1<<n){\\n vector<Point> points;\\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\\n double r=minimum_bounding_circle(points);\\n dp1[s]=r;\\n }\\n \\n // NOTE: ここでINF初期化する理由\\n // 以下のループの中で、以下の様にdp2の遷移を行っている\\n // dp[i][_]が求まっているとして、i+1個の円で集合sを包含するときの円の最小値は、\\n // sをbitとbit2の2つの集合に分けて、bitはi個の円、bit2は1個の円で包含することを考える\\n // すると遷移は、chmin(dp2[i+1][s],max(dp2[i][bit],dp1[bit2])) と表される\\n // このとき、i=0の場合において遷移の過程でdp2[i][bit]が未定義の場合が有り得る\\n // dp2[0][1]は0個の円で1個の点を包含する訳だが不可能である(そもそもdp2[0][_]には遷移元が存在しない)\\n // この場合dpテーブルを更新しないためにINF初期化する必要がある\\n // memo: 一方、dp2[2][1]など、点より多い円で包含する場合は遷移の過程でテーブルが埋められるので問題ない\\n // 例えば、dp2[2][1]はmax(dp2[1][0],dp1[1])から更新されるが、dp2[1][0]はmax(dp2[0][0],dp1[0])から0と初期化されるはずである\\n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\\n dp2[0][0]=0;\\n rep(i,m){\\n rep(bit,1<<n){\\n ll rem=((1<<n)-1)-bit; // 2^n における、集合bitの補集合\\n \\n // bitの補集合remの、部分集合全てについてのループ\\n for(ll bit2=rem; bit2>=0 ;bit2--){\\n bit2&=rem;\\n \\n // NOTE: ここでやっていること\\n // まず、max(dp2[i][bit],dp1[bit2])について\\n // dp2[i][bit]はi個の円で集合bitを覆うとき、その円の中でも最大のものが最小となるときの半径が格納されている\\n // dp1[bit2]は集合bit2の最小包含円の半径である\\n // よってmax()は、i+1個の円でbit, bit2を覆うときの最大の円の半径を取ってきている\\n // 上記で求めた最大の半径をmax_valueとして、素直にdp2の遷移を実装した結果が以下となる\\n // chmin(dp2[i+1][bit|bit2],max_value)\\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\\n }\\n }\\n }\\n \\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\\n \\n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5088,\n \"score_of_the_acc\": -0.1417,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3034_4610470\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\\n#define SORT(v, n) sort(v, v + n);\\n#define REVERSE(v, n) reverse(v, v+n);\\n#define vsort(v) sort(v.begin(), v.end());\\n#define all(v) v.begin(), v.end()\\n#define mp(n, m) make_pair(n, m);\\n#define cout(d) cout<<d<<endl;\\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\\n#define cinline(n) getline(cin,n);\\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\\n#define PI (acos(-1))\\n#define FILL(v, n, x) fill(v, v + n, x);\\n#define sz(x) long long(x.size())\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vs = vector<string>;\\nusing vpll = vector<pair<ll, ll>>;\\nusing vtp = vector<tuple<ll,ll,ll>>;\\nusing vb = vector<bool>;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nconst ll INF = 1e9;\\nconst ll MOD = 1e9+7;\\nconst ll LINF = 1e18;\\n\\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\\n\\n/* 幾何ライブラリ */\\nusing DD = double;\\nconst DD EPS = 1e-10; // to be set appropriately\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n/* Line */\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \\\", \\\" << l[1] << '}';}\\n};\\n\\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n return 0;\\n}\\n\\n// 円や直線の交点\\nvector<Point> crosspoint(const Line &l, const Line &m) {\\n vector<Point> res;\\n DD d = cross(m[1] - m[0], l[1] - l[0]);\\n if (abs(d) < EPS) return vector<Point>();\\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\\n return res;\\n}\\n\\n// 外心\\nPoint gaisin(Point a, Point b, Point c) {\\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\\n return crosspoint(ab, bc)[0];\\n}\\n\\n// 最小包含円\\ndouble minimum_bounding_circle(vector<Point>& v){\\n ll n=v.size();\\n if(n<=1) return 0;\\n \\n vector<Point> cond; // 候補\\n rep(i,n) irep(j,i+1,n){\\n cond.push_back((v[i]+v[j])/2);\\n irep(k,j+1,n){\\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\\n auto p=gaisin(v[i],v[j],v[k]);\\n cond.push_back(p);\\n }\\n }\\n \\n double res=INF;\\n for(auto e: cond){\\n double tmp=0;\\n rep(i,n) chmax(tmp,abs(e-v[i]));\\n chmin(res,tmp);\\n }\\n \\n return res;\\n}\\n\\nconst ll maxn=1<<14;\\ndouble dp1[maxn]; // 最小包含円の半径\\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\\n\\nsigned main()\\n{\\n cin.tie( 0 ); ios::sync_with_stdio( false );\\n \\n ll n,m; cin>>n>>m;\\n vector<Point> v;\\n set<Point> exist;\\n rep(i,n){\\n ll x,y; cin>>x>>y;\\n Point p=Point(x,y);\\n if(exist.count(p)) continue;\\n v.push_back(p);\\n exist.insert(p);\\n }\\n n=v.size();\\n \\n if(n<=m){\\n cout<<0<<endl;\\n return 0;\\n }\\n \\n rep(s,1<<n){\\n vector<Point> points;\\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\\n double r=minimum_bounding_circle(points);\\n dp1[s]=r;\\n }\\n \\n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\\n dp2[0][0]=0;\\n rep(i,m){\\n rep(bit,1<<n){\\n ll rem=((1<<n)-1)-bit;\\n for(ll bit2=rem; bit2>=0 ;bit2--){\\n bit2&=rem;\\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\\n }\\n }\\n }\\n \\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\\n \\n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\\n \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5048,\n \"score_of_the_acc\": -0.1401,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3034_4608940\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)\\n#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)\\n#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)\\n#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)\\n#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)\\n#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)\\n#define SORT(v, n) sort(v, v + n);\\n#define REVERSE(v, n) reverse(v, v+n);\\n#define vsort(v) sort(v.begin(), v.end());\\n#define all(v) v.begin(), v.end()\\n#define mp(n, m) make_pair(n, m);\\n#define cout(d) cout<<d<<endl;\\n#define coutd(d) cout<<std::setprecision(10)<<d<<endl;\\n#define cinline(n) getline(cin,n);\\n#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);\\n#define PI (acos(-1))\\n#define FILL(v, n, x) fill(v, v + n, x);\\n#define sz(x) long long(x.size())\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vs = vector<string>;\\nusing vpll = vector<pair<ll, ll>>;\\nusing vtp = vector<tuple<ll,ll,ll>>;\\nusing vb = vector<bool>;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nconst ll INF = 1e9;\\nconst ll MOD = 1e9+7;\\nconst ll LINF = 1e18;\\n\\n// https://drken1215.hatenablog.com/entry/2020/01/13/230900\\n\\n/* 幾何ライブラリ */\\nusing DD = double;\\nconst DD EPS = 1e-10; // to be set appropriately\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n/* Line */\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \\\", \\\" << l[1] << '}';}\\n};\\n\\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n return 0;\\n}\\n\\n// 円や直線の交点\\nvector<Point> crosspoint(const Line &l, const Line &m) {\\n vector<Point> res;\\n DD d = cross(m[1] - m[0], l[1] - l[0]);\\n if (abs(d) < EPS) return vector<Point>();\\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\\n return res;\\n}\\n\\n// 外心\\nPoint gaisin(Point a, Point b, Point c) {\\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\\n return crosspoint(ab, bc)[0];\\n}\\n\\n// 最小包含円\\ndouble minimum_bounding_circle(vector<Point>& v){\\n ll n=v.size();\\n if(n<=1) return 0;\\n \\n vector<Point> cond; // 候補\\n rep(i,n) irep(j,i+1,n){\\n cond.push_back((v[i]+v[j])/2);\\n irep(k,j+1,n){\\n if(simple_ccw(v[i],v[j],v[k])==0) continue;\\n auto p=gaisin(v[i],v[j],v[k]);\\n cond.push_back(p);\\n }\\n }\\n \\n double res=INF;\\n for(auto e: cond){\\n double tmp=0;\\n rep(i,n) chmax(tmp,abs(e-v[i]));\\n chmin(res,tmp);\\n }\\n \\n return res;\\n}\\n\\nconst ll maxn=1<<14;\\ndouble dp1[maxn]; // 最小包含円の半径\\ndouble dp2[15][maxn]; // i個の円で集合sを包含するときの最大の円の半径の最小値\\n\\nsigned main()\\n{\\n cin.tie( 0 ); ios::sync_with_stdio( false );\\n \\n ll n,m; cin>>n>>m;\\n vector<Point> v;\\n set<Point> exist;\\n rep(i,n){\\n ll x,y; cin>>x>>y;\\n Point p=Point(x,y);\\n if(exist.count(p)) continue;\\n v.push_back(p);\\n exist.insert(p);\\n }\\n n=v.size();\\n \\n if(n<=m){\\n cout<<0<<endl;\\n return 0;\\n }\\n \\n rep(s,1<<n){\\n vector<Point> points;\\n rep(i,n) if(s>>i&1) points.push_back(v[i]);\\n double r=minimum_bounding_circle(points);\\n dp1[s]=r;\\n }\\n \\n rep(i,m+1) rep(s,1<<n) dp2[i][s]=INF;\\n dp2[0][0]=0;\\n rep(i,m){\\n rep(bit,1<<n){\\n ll rem=((1<<n)-1)-bit;\\n for(ll bit2=rem; ;bit2=(bit2-1)&rem){\\n chmin(dp2[i+1][bit|bit2], max(dp2[i][bit],dp1[bit2]));\\n if(!bit2) break;\\n }\\n }\\n }\\n \\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp1[s]<<endl;\\n // rep(s,1<<n) cout<<std::setprecision(10)<<dp2[m][s]<<endl;\\n \\n cout<<std::setprecision(10)<<dp2[m][(1<<n)-1]<<endl;\\n \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5108,\n \"score_of_the_acc\": -0.1426,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3034_4400210\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define EPS 0.0000001\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\t\\treturn x != p.x? x < p.x: y < p.y;\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\tPoint p[2];\\n};\\n\\nint N,M;\\nint POW[15];\\ndouble dp[15][1 << 15];\\ndouble NUM = 20000000;\\nPoint point[15];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(x1 != x2){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_minus(Point a,Point b){\\n Point ret;\\n\\n ret.x = a.x-b.x;\\n ret.y = a.y-b.y;\\n\\n return ret;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 15; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i <= M; i++){\\n\\t\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\t\\tdp[i][state] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> V;\\n\\n\\n\\tLine line1,line2;\\n\\tPoint center;\\n\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(V.size() == 1){\\n\\n\\t\\t\\tdp[1][state] = 0;\\n\\t\\t\\t//printf(\\\"dp[1][%d]:%.3lf\\\\n\\\",state,dp[1][state]);\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}else if(V.size() == 2){\\n\\n\\t\\t\\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\\n\\n\\t\\t\\tint work_state = state;\\n\\n\\t\\t\\tcenter = Point((point[V[0]].x+point[V[1]].x)/2,(point[V[0]].y+point[V[1]].y)/2);\\n\\n\\t\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\t\\tif(k == V[0] || k == V[1])continue;\\n\\n\\t\\t\\t\\tif(calc_dist(center,point[k]) <= dp[1][state]){\\n\\n\\t\\t\\t\\t\\twork_state += POW[k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdp[1][work_state] = min(dp[1][work_state],dp[1][state]);\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//3点以上\\n\\n\\t\\t//2点を直径とする\\n\\t\\tfor(int a = 0; a < V.size()-1; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size(); b++){\\n\\n\\t\\t\\t\\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\n\\t\\t\\t\\tdouble tmp_dist = calc_dist(point[V[a]],point[V[b]])/2;\\n\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\tif(k == a || k == b)continue;\\n\\n\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//3点を通る\\n\\t\\tfor(int a = 0; a < V.size()-2; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size()-1; b++){\\n\\t\\t\\t\\tfor(int c = b+1; c < V.size(); c++){\\n\\n\\t\\t\\t\\t\\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\\n\\t\\t\\t\\t\\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\\n\\n\\t\\t\\t\\t\\tif(fabs(slope1-slope2) < EPS){ //一直線上\\n\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\t\\t\\t\\t\\t\\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(-NUM,mid1.y);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(NUM,mid1.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope1) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope1 = (-1.0)/slope1;\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(-NUM,mid2.y);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(NUM,mid2.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope2) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope2 = (-1.0)/slope2;\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcenter = calc_Cross_Point(line1,line2);\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(k == a || k == b || k == c)continue;\\n\\n\\t\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist){\\n\\n\\t\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n\\n\\n\\tint tmp_state;\\n\\n\\tfor(int state = 1; state < POW[N]-1; state++){\\n\\n\\t\\tV.clear();\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 1; i <= M-1; i++){\\n\\t\\t\\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\\n\\n\\t\\t\\t\\ttmp_state = 0;\\n\\n\\t\\t\\t\\tfor(int loop = 0; loop < V.size(); loop++){\\n\\t\\t\\t\\t\\tif(a & POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\ttmp_state += POW[V[loop]];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\tfor(int i = 1; i <= M; i++){\\n\\n\\t\\tans = min(ans,dp[i][POW[N]-1]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 4832,\n \"score_of_the_acc\": -0.326,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3034_4400092\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n#define EPS 0.00001\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\t\\treturn x != p.x? x < p.x: y < p.y;\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\tPoint p[2];\\n};\\n\\nint N,M;\\nint POW[15];\\ndouble dp[15][1 << 15];\\ndouble NUM = 20000000;\\nPoint point[15];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(x1 != x2){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_minus(Point a,Point b){\\n Point ret;\\n\\n ret.x = a.x-b.x;\\n ret.y = a.y-b.y;\\n\\n return ret;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 15; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i <= M; i++){\\n\\t\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\t\\tdp[i][state] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> V;\\n\\n\\n\\tLine line1,line2;\\n\\tPoint center;\\n\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(V.size() == 1){\\n\\n\\t\\t\\tdp[1][state] = 0;\\n\\t\\t\\t//printf(\\\"dp[1][%d]:%.3lf\\\\n\\\",state,dp[1][state]);\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}else if(V.size() == 2){\\n\\n\\t\\t\\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\\n\\n\\t\\t\\tint work_state = state;\\n\\n\\t\\t\\tcenter = Point((point[V[0]].x+point[V[1]].x)/2,(point[V[0]].y+point[V[1]].y)/2);\\n\\n\\t\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\t\\tif(k == V[0] || k == V[1])continue;\\n\\n\\t\\t\\t\\tif(calc_dist(center,point[k]) <= dp[1][state]){\\n\\n\\t\\t\\t\\t\\twork_state += POW[k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdp[1][work_state] = min(dp[1][work_state],dp[1][state]);\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//3点以上\\n\\n\\t\\t//2点を直径とする\\n\\t\\tfor(int a = 0; a < V.size()-1; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size(); b++){\\n\\n\\t\\t\\t\\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y,point[V[b]].y)/2);\\n\\n\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\tif(k == a || k == b)continue;\\n\\n\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//3点を通る\\n\\t\\tfor(int a = 0; a < V.size()-2; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size()-1; b++){\\n\\t\\t\\t\\tfor(int c = b+1; c < V.size(); c++){\\n\\n\\t\\t\\t\\t\\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\\n\\t\\t\\t\\t\\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\\n\\n\\t\\t\\t\\t\\tif(fabs(slope1-slope2) < EPS){ //一直線上\\n\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\t\\t\\t\\t\\t\\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(-NUM,mid1.y);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(NUM,mid1.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope1) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope1 = (-1.0)/slope1;\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(-NUM,mid2.y);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(NUM,mid2.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope2) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope2 = (-1.0)/slope2;\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t/*if(!is_Cross(line1,line2)){\\n\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"交わらない!! V[a]:%d V[b]:%d V[c]:%d\\\\n\\\",V[a],V[b],V[c]);\\n\\t\\t\\t\\t\\t\\t\\tprintf(\\\"slope1:%.1lf slope2:%.1lf\\\\n\\\",slope1,slope2);\\n\\t\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t\\t}*/\\n\\n\\t\\t\\t\\t\\t\\tcenter = calc_Cross_Point(line1,line2);\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(k == a || k == b || k == c)continue;\\n\\n\\t\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\\n\\n\\t\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t/*\\tif(fabs(dp[1][state]-BIG_NUM) < EPS){\\n\\n\\t\\t\\tprintf(\\\"BUG!! state:%d\\\\n\\\",state);\\n\\t\\t\\treturn 0;\\n\\t\\t}*/\\n\\n\\n\\t\\t//printf(\\\"dp[1][%d]:%.3lf\\\\n\\\",state,dp[1][state]);\\n\\t}\\n\\n\\tint tmp_state;\\n\\n\\tfor(int state = 1; state < POW[N]-1; state++){\\n\\n\\t\\tV.clear();\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 1; i <= M-1; i++){\\n\\t\\t\\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\\n\\n\\t\\t\\t\\ttmp_state = 0;\\n\\n\\t\\t\\t\\tfor(int loop = 0; loop < V.size(); loop++){\\n\\t\\t\\t\\t\\tif(a & POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\ttmp_state += POW[V[loop]];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\tfor(int i = 1; i <= M; i++){\\n\\n\\t\\tans = min(ans,dp[i][POW[N]-1]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6545454545454545,\n \"time_ms\": 360,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.1556,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3034_4399960\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\t\\treturn x != p.x? x < p.x: y < p.y;\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\tPoint p[2];\\n};\\n\\nint N,M;\\nint POW[15];\\ndouble dp[15][1 << 15];\\ndouble NUM = 200000;\\nPoint point[15];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(x1 != x2){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_minus(Point a,Point b){\\n Point ret;\\n\\n ret.x = a.x-b.x;\\n ret.y = a.y-b.y;\\n\\n return ret;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 15; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i <= M; i++){\\n\\t\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\t\\tdp[i][state] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> V;\\n\\n\\n\\tLine line1,line2;\\n\\tPoint center;\\n\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(V.size() == 1){\\n\\n\\t\\t\\tdp[1][state] = 0;\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}else if(V.size() == 2){\\n\\n\\t\\t\\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//3点以上\\n\\n\\t\\t//2点を直径とする\\n\\t\\tfor(int a = 0; a < V.size()-1; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size(); b++){\\n\\n\\t\\t\\t\\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y,point[V[b]].y)/2);\\n\\n\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\tif(k == a || k == b)continue;\\n\\n\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//3点を通る\\n\\t\\tfor(int a = 0; a < V.size()-2; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size()-1; b++){\\n\\t\\t\\t\\tfor(int c = b+1; c < V.size(); c++){\\n\\n\\t\\t\\t\\t\\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\\n\\t\\t\\t\\t\\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\\n\\n\\t\\t\\t\\t\\tif(fabs(slope1-slope2) < EPS){ //一直線上\\n\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\t\\t\\t\\t\\t\\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(-NUM,mid1.y);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(NUM,mid1.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope1) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope1 = (-1.0)/slope1;\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(-NUM,mid2.y);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(NUM,mid2.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope2) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope2 = (-1.0)/slope2;\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcenter = calc_Cross_Point(line1,line2);\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(k == a || k == b || k == c)continue;\\n\\n\\t\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\\n\\n\\t\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint tmp_state;\\n\\n\\tfor(int state = 1; state < POW[N]-1; state++){\\n\\n\\t\\tV.clear();\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 1; i <= M-1; i++){\\n\\t\\t\\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\\n\\n\\t\\t\\t\\ttmp_state = 0;\\n\\n\\t\\t\\t\\tfor(int loop = 0; loop < V.size(); loop++){\\n\\t\\t\\t\\t\\tif(a & POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\ttmp_state += POW[V[loop]];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\tfor(int i = 1; i <= M; i++){\\n\\n\\t\\tans = min(ans,dp[i][POW[N]-1]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16363636363636364,\n \"time_ms\": 350,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -0.1557,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3034_4399887\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\t\\treturn x != p.x? x < p.x: y < p.y;\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\tPoint p[2];\\n};\\n\\nint N,M;\\nint POW[15];\\ndouble dp[15][1 << 15];\\ndouble NUM = 200000;\\nPoint point[15];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(x1 != x2){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_minus(Point a,Point b){\\n Point ret;\\n\\n ret.x = a.x-b.x;\\n ret.y = a.y-b.y;\\n\\n return ret;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < 15; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i <= M; i++){\\n\\t\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\t\\tdp[i][state] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> V;\\n\\n\\n\\tLine line1,line2;\\n\\tPoint center;\\n\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(V.size() == 1){\\n\\n\\t\\t\\tdp[1][state] = 0;\\n\\t\\t\\tcontinue;\\n\\n\\t\\t}else if(V.size() == 2){\\n\\n\\t\\t\\tdp[1][state] = calc_dist(point[V[0]],point[V[1]])/2;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//3点以上\\n\\t\\tfor(int a = 0; a < V.size()-2; a++){\\n\\t\\t\\tfor(int b = a+1; b < V.size()-1; b++){\\n\\t\\t\\t\\tfor(int c = b+1; c < V.size(); c++){\\n\\n\\t\\t\\t\\t\\tdouble slope1 = calc_slope(Line(point[V[a]],point[V[b]]));\\n\\t\\t\\t\\t\\tdouble slope2 = calc_slope(Line(point[V[b]],point[V[c]]));\\n\\n\\t\\t\\t\\t\\tif(fabs(slope1-slope2) < EPS){ //一直線上\\n\\n\\t\\t\\t\\t\\t\\tdouble dist1 = calc_dist(point[V[a]],point[V[b]]);\\n\\t\\t\\t\\t\\t\\tdouble dist2 = calc_dist(point[V[a]],point[V[c]]);\\n\\t\\t\\t\\t\\t\\tdouble dist3 = calc_dist(point[V[b]],point[V[c]]);\\n\\n\\t\\t\\t\\t\\t\\tif(dist1 > dist2 && dist1 > dist3){\\n\\n\\t\\t\\t\\t\\t\\t\\tcenter = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\t}else if(dist2 > dist1 && dist2 > dist3){\\n\\n\\t\\t\\t\\t\\t\\t\\tcenter = Point((point[V[a]].x+point[V[c]].x)/2,(point[V[a]].y+point[V[c]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tcenter = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tPoint mid1 = Point((point[V[a]].x+point[V[b]].x)/2,(point[V[a]].y+point[V[b]].y)/2);\\n\\t\\t\\t\\t\\t\\tPoint mid2 = Point((point[V[b]].x+point[V[c]].x)/2,(point[V[b]].y+point[V[c]].y)/2);\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope1-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(-NUM,mid1.y);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(NUM,mid1.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope1) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope1 = (-1.0)/slope1;\\n\\n\\t\\t\\t\\t\\t\\t\\tline1.p[0] = Point(mid1.x-NUM,mid1.y-NUM*slope1);\\n\\t\\t\\t\\t\\t\\t\\tline1.p[1] = Point(mid1.x+NUM,mid1.y+NUM*slope1);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(slope2-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(-NUM,mid2.y);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(NUM,mid2.y);\\n\\n\\t\\t\\t\\t\\t\\t}else if(fabs(slope2) < EPS){ //水平\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x,NUM);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x,-NUM);\\n\\n\\t\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t\\tslope2 = (-1.0)/slope2;\\n\\n\\t\\t\\t\\t\\t\\t\\tline2.p[0] = Point(mid2.x-NUM,mid2.y-NUM*slope2);\\n\\t\\t\\t\\t\\t\\t\\tline2.p[1] = Point(mid2.x+NUM,mid2.y+NUM*slope2);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcenter = calc_Cross_Point(line1,line2);\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(center,point[V[a]]);\\n\\n\\t\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < V.size(); k++){\\n\\n\\t\\t\\t\\t\\t\\tif(calc_dist(center,point[V[k]]) > tmp_dist+EPS){\\n\\n\\t\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t\\t\\tdp[1][state] = min(dp[1][state],tmp_dist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"dp[1][%d]:%.1lf\\\\n\\\",state,dp[1][state]);\\n\\t}\\n\\n\\tint tmp_state;\\n\\n\\tfor(int state = 1; state < POW[N]-1; state++){\\n\\n\\t\\tV.clear();\\n\\t\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\t\\tif(state & POW[loop]){\\n\\n\\t\\t\\t\\t//Do nothing\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV.push_back(loop);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 1; i <= M-1; i++){\\n\\t\\t\\tif(fabs(dp[i][state]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int a = 1; a < POW[V.size()]; a++){ //足し合わせる状態\\n\\n\\t\\t\\t\\ttmp_state = 0;\\n\\n\\t\\t\\t\\tfor(int loop = 0; loop < V.size(); loop++){\\n\\t\\t\\t\\t\\tif(a & POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\ttmp_state += POW[V[loop]];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdp[i+1][state+tmp_state] = min(dp[i+1][state+tmp_state],max(dp[i][state],dp[1][tmp_state]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\tfor(int i = 1; i <= M; i++){\\n\\n\\t\\tans = min(ans,dp[i][POW[N]-1]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.03636363636363636,\n \"time_ms\": 360,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.1595,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3034_4106026\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <iomanip>\\nusing namespace std;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n/* 幾何ライブラリ */\\nusing DD = double;\\nconst DD INF = 1LL<<60; // to be set appropriately\\nconst DD EPS = 1e-10; // to be set appropriately\\nconst DD PI = acosl(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n/* Line */\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \\\", \\\" << l[1] << '}';}\\n};\\n\\n// 1：a-bから見てcは左側(反時計回り)、-1：a-bから見てcは右側(時計回り)、0：一直線上\\nint simple_ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n return 0;\\n}\\n\\n// 円や直線の交点\\nvector<Point> crosspoint(const Line &l, const Line &m) {\\n vector<Point> res;\\n DD d = cross(m[1] - m[0], l[1] - l[0]);\\n if (abs(d) < EPS) return vector<Point>();\\n res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);\\n return res;\\n}\\n\\n// 外心\\nPoint gaisin(Point a, Point b, Point c) {\\n Line ab((a+b)/2, (a+b)/2 + rot90(a-b));\\n Line bc((b+c)/2, (b+c)/2 + rot90(b-c));\\n return crosspoint(ab, bc)[0];\\n}\\n\\n// 最小包含円\\nDD mic(const vector<Point> &v) {\\n int N = (int)v.size();\\n if (N <= 1) return 0;\\n\\n // 候補\\n vector<Point> alt;\\n for (int i = 0; i < N; ++i) {\\n for (int j = i+1; j < N; ++j) {\\n alt.push_back( (v[i] + v[j]) / 2 );\\n for (int k = j+1; k < N; ++k) {\\n if (simple_ccw(v[i], v[j], v[k]) == 0) continue;\\n auto r = gaisin(v[i], v[j], v[k]);\\n alt.push_back(r);\\n }\\n }\\n }\\n\\n // 調べる\\n DD res = INF;\\n for (auto r : alt) {\\n DD tmp = 0;\\n for (auto p : v) chmax(tmp, abs(p - r));\\n chmin(res, tmp);\\n }\\n return res;\\n}\\n\\n\\nint main() {\\n int N, M; cin >> N >> M;\\n vector<Point> v(N);\\n for (int i = 0; i < N; ++i) cin >> v[i].x >> v[i].y;\\n\\n // pre\\n vector<DD> need(1<<N, 0);\\n for (int bit = 0; bit < (1<<N); ++bit) {\\n vector<Point> part;\\n for (int i = 0; i < N; ++i) {\\n if (bit & (1<<i)) part.push_back(v[i]);\\n }\\n need[bit] = mic(part);\\n\\n //cout << bit << \\\": \\\" << need[bit] << endl;\\n }\\n \\n // bitDP\\n vector<vector<DD>> dp(M+1, vector<DD>(1<<N,INF));\\n dp[0][0] = 0;\\n for (int m = 0; m < M; ++m) {\\n for (int bit = 0; bit < (1<<N); ++bit) {\\n int rem = ((1<<N)-1) - bit;\\n for (int bit2 = rem; ; bit2 = (bit2-1) & rem) {\\n chmin(dp[m+1][bit|bit2], max(dp[m][bit], need[bit2]));\\n if (!bit2) break;\\n }\\n }\\n }\\n \\n cout << fixed << setprecision(10) << dp[M][(1<<N)-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 4968,\n \"score_of_the_acc\": -0.1413,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3034_3907741\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nstruct Vector {\\n\\tdouble x, y;\\n\\tdouble length() const { return std::sqrt(x * x + y * y); }\\n\\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\\n\\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\\n\\tVector rotate90() const { return Vector{ -y, x }; }\\n\\tVector flip180() const { return Vector{ -x, -y }; }\\n};\\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\\nstruct Coordinate {\\n\\tdouble x, y;\\n\\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\\n\\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\\n\\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\\n};\\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nconstexpr double EPS = 0.000000001;\\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (bravers[i].distance_from(center) <= radius + EPS) {\\n\\t\\t\\tstate ^= 1 << i;\\n\\t\\t}\\n\\t}\\n\\treturn state;\\n}\\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\\n\\tif (state == 0) return true;\\n\\tif (rest == 0) return false;\\n\\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\\n\\tmemo[rest][state] = 0;\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\\n\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\\n\\t\\t\\tauto mid = bravers[i].mid_point(bravers[j]);\\n\\t\\t\\tauto vec = bravers[i] - bravers[j];\\n\\t\\t\\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\\n\\t\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\\n\\t\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\\n\\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\\n\\tdouble min = 0.0;\\n\\tdouble max = 150000;\\n\\twhile (min + 0.000001 < max) {\\n\\t\\tauto mid = (min + max) / 2;\\n\\t\\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\\n\\t\\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\\n\\t\\telse min = mid;\\n\\t}\\n\\tstd::cout << std::setprecision(10) << std::fixed << max << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.0945,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3034_3907737\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nstruct Vector {\\n\\tdouble x, y;\\n\\tdouble length() const { return std::sqrt(x * x + y * y); }\\n\\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\\n\\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\\n\\tVector rotate90() const { return Vector{ -y, x }; }\\n\\tVector flip180() const { return Vector{ -x, -y }; }\\n};\\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\\nstruct Coordinate {\\n\\tdouble x, y;\\n\\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\\n\\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\\n\\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\\n};\\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nconstexpr double EPS = 0.000000001;\\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (bravers[i].distance_from(center) <= radius + EPS) {\\n\\t\\t\\tstate ^= 1 << i;\\n\\t\\t}\\n\\t}\\n\\treturn state;\\n}\\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\\n\\tif (state == 0) return true;\\n\\tif (rest == 0) return false;\\n\\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\\n\\tmemo[rest][state] = 0;\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\\n\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\\n\\t\\t\\tauto mid = bravers[i].mid_point(bravers[j]);\\n\\t\\t\\tauto vec = bravers[i] - bravers[j];\\n\\t\\t\\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\\n\\t\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\\n\\t\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\\n\\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\\n\\tdouble min = 0.0;\\n\\tdouble max = 15000;\\n\\twhile (min + 0.000001 < max) {\\n\\t\\tauto mid = (min + max) / 2;\\n\\t\\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\\n\\t\\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\\n\\t\\telse min = mid;\\n\\t}\\n\\tstd::cout << std::setprecision(10) << std::fixed << max << '\\\\n';\\n}\",\n \"accuracy\": 0.07272727272727272,\n \"time_ms\": 50,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.0044,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3034_3907733\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <tuple>\\n#include <bitset>\\n#include <memory>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <iomanip>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nstruct Vector {\\n\\tdouble x, y;\\n\\tdouble length() const { return std::sqrt(x * x + y * y); }\\n\\tdouble dot(const Vector& that) const { return x * that.x + y * that.y; }\\n\\tdouble cross(const Vector& that) const { return x * that.y - y * that.x; }\\n\\tVector rotate90() const { return Vector{ -y, x }; }\\n\\tVector flip180() const { return Vector{ -x, -y }; }\\n};\\nVector operator*(const Vector& vec, const double scala) { return Vector{ vec.x * scala, vec.y * scala }; }\\nVector operator*(const double scala, const Vector& vec) { return Vector{ vec.x * scala, vec.y * scala }; }\\nstruct Coordinate {\\n\\tdouble x, y;\\n\\tdouble distance_from(const Coordinate& that) const { return (*this - that).length(); }\\n\\tCoordinate mid_point(const Coordinate& that) const { return Coordinate{ (x + that.x) / 2, (y + that.y) / 2 }; }\\n\\tVector operator-(const Coordinate& that) const { return Vector{ x - that.x, y - that.y }; }\\n};\\nCoordinate operator+(const Vector& vec, const Coordinate& coordinate) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nCoordinate operator+(const Coordinate& coordinate, const Vector& vec) { return Coordinate{ vec.x + coordinate.x, vec.y + coordinate.y }; }\\nconstexpr double EPS = 0.0000001;\\nint remove_all(const std::vector<Coordinate>& bravers, int state, const double radius, const Coordinate center) {\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (bravers[i].distance_from(center) <= radius + EPS) {\\n\\t\\t\\tstate ^= 1 << i;\\n\\t\\t}\\n\\t}\\n\\treturn state;\\n}\\nbool can_defeat(const std::vector<Coordinate>& bravers, const int state, const int rest, const double radius, std::vector<std::vector<int>> &memo) {\\n\\tif (state == 0) return true;\\n\\tif (rest == 0) return false;\\n\\tif (memo[rest][state] >= 0) return memo[rest][state] == 1;\\n\\tmemo[rest][state] = 0;\\n\\tfor (auto i = 0; i < bravers.size(); ++i) if ((state & (1 << i)) != 0) {\\n\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, bravers[i]), rest - 1, radius, memo)) {\\n\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tfor (auto j = 0; j < i; ++j) if ((state & (1 << j)) != 0 && bravers[i].distance_from(bravers[j]) <= radius * 2 + EPS && EPS < bravers[i].distance_from(bravers[j])) {\\n\\t\\t\\tauto mid = bravers[i].mid_point(bravers[j]);\\n\\t\\t\\tauto vec = bravers[i] - bravers[j];\\n\\t\\t\\tauto catheti = vec.rotate90() * std::sqrt(radius * radius - vec.length() * vec.length() / 4) * (1 / vec.length());\\n\\t\\t\\tif (can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti), rest - 1, radius, memo) || can_defeat(bravers, remove_all(bravers, state, radius, mid + catheti.flip180()), rest - 1, radius, memo)) {\\n\\t\\t\\t\\tmemo[rest][state] = 1;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<Coordinate> bravers(n); for (auto& braver : bravers) std::cin >> braver.x >> braver.y;\\n\\tstd::vector<std::vector<int>> memo(m + 1, std::vector<int>(1 << n, -1));\\n\\tdouble min = 0.0;\\n\\tdouble max = 15000;\\n\\twhile (min + 0.0001 < max) {\\n\\t\\tauto mid = (min + max) / 2;\\n\\t\\tfor (auto& vec : memo) std::fill(vec.begin(), vec.end(), -1);\\n\\t\\tif (can_defeat(bravers, (1 << n) - 1, m, mid, memo)) max = mid;\\n\\t\\telse min = mid;\\n\\t}\\n\\tstd::cout << std::setprecision(10) << std::fixed << max << '\\\\n';\\n}\",\n \"accuracy\": 0.07272727272727272,\n \"time_ms\": 40,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": 0,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3034_3416750\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\nint n, m;\\nld x[14], y[14];\\nld d[14][14];\\nld rd[1 << 14];\\nbool can(int s,ld r) {\\n\\tvector<int> v;\\n\\trep(i, n) {\\n\\t\\tif (s&(1 << i))v.push_back(i);\\n\\t}\\n\\tif (v.size() <= 1)return true;\\n\\tint len = v.size();\\n\\trep(i, len) {\\n\\t\\tRep(j, i + 1, len) {\\n\\t\\t\\tint id = v[i], jd = v[j];\\n\\t\\t\\tif (2*r < d[id][jd])return false;\\n\\t\\t\\tld X = (x[jd] - x[id]) / 2.0;\\n\\t\\t\\tld Y = (y[jd] - y[id]) / 2.0;\\n\\t\\t\\tld dist = sqrt(pow(r, 2) - pow(d[id][jd] / 2.0, 2));\\n\\t\\t\\tld sr = d[id][jd] / 2.0;\\n\\t\\t\\tld x3 = Y * dist / sr; ld y3 = -X * dist / sr;\\n\\t\\t\\tld midx = (x[id] + x[jd]) / 2.0, midy = (y[id] + y[jd]) / 2.0;\\n\\t\\t\\tld cx = x3 + midx, cy = y3 + midy;\\n\\t\\t\\tbool valid = true;\\n\\t\\t\\trep(k, len) {\\n\\t\\t\\t\\tint kd = v[k];\\n\\t\\t\\t\\tld dis = sqrt(pow(cx - x[kd], 2) + pow(cy - y[kd], 2));\\n\\t\\t\\t\\tif (dis > r+eps) {\\n\\t\\t\\t\\t\\tvalid = false; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (valid)return true;\\n\\t\\t\\tvalid = true;\\n\\t\\t\\tcx = -x3 + midx, cy = -y3 + midy;\\n\\t\\t\\trep(k, len) {\\n\\t\\t\\t\\tint kd = v[k];\\n\\t\\t\\t\\tld dis = sqrt(pow(cx - x[kd], 2) + pow(cy - y[kd], 2));\\n\\t\\t\\t\\tif (dis > r+eps) {\\n\\t\\t\\t\\t\\tvalid = false; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (valid)return true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nld dp[1 << 14], cop[1 << 14];\\nint main() {\\n\\tcin >> n >> m;\\n\\trep(i, n) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t}\\n\\trep(i, n) {\\n\\t\\trep(j, n) {\\n\\t\\t\\td[i][j] = sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2));\\n\\t\\t}\\n\\t}\\n\\trep(i, (1 << n)) {\\n\\t\\tld le = 0, ri = 200000;\\n\\t\\twhile (ri - le > eps) {\\n\\t\\t\\tld r = (ri + le) / 2;\\n\\t\\t\\tif (can(i, r))ri = r;\\n\\t\\t\\telse le = r;\\n\\t\\t}\\n\\t\\trd[i] = ri;\\n\\t}\\n\\tfill(dp, dp + (1 << n), mod);\\n\\tdp[0] = 0;\\n\\trep(aa, m) {\\n\\t\\trep(j, (1 << n)) {\\n\\t\\t\\tcop[j] = dp[j];\\n\\t\\t}\\n\\t\\trep(j, (1 << n)) {\\n\\t\\t\\tvector<int> v;\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (j&(1 << i))continue;\\n\\t\\t\\t\\tv.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tint len = v.size();\\n\\t\\t\\trep(i, (1 << len)) {\\n\\t\\t\\t\\tint s = 0;\\n\\t\\t\\t\\trep(k, len) {\\n\\t\\t\\t\\t\\tif (i&(1 << k))s += (1 << v[k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcop[j + s] = min(cop[j + s], max(dp[j], rd[s]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(j, (1 << n)) {\\n\\t\\t\\tdp[j] = cop[j];\\n\\t\\t}\\n\\t}\\n\\tcout << fixed << setprecision(5);\\n\\tcout << dp[(1 << n) - 1] << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2300,\n \"memory_kb\": 4064,\n \"score_of_the_acc\": -1.0293,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3034_3407723\",\n \"code_snippet\": \"//典型的な前処理O(N * 2^N) + O(M * 3^N)のDPで、最小包含円を求めるのが本質。O(N^3)かけても間に合うのが\\n//優しいけど、ちょっとライブラリを探してきた。\\n#include <iostream>\\n#include <vector>\\n#include <complex>\\n#include <cassert>\\n#include <random>\\n#include <algorithm>\\n#include <cstdio>\\n#include <cmath>\\n#define rep(i, n) for(i = 0; i < n; i++)\\nusing namespace std;\\n\\nvoid chmin(double &a, double b) { a = min(a, b); }\\n\\n//BEGIN: https://tubo28.me/algorithm/minball/\\nusing ld = double;\\nusing P = complex<ld>;\\ndouble eps = 1e-12;\\ndouble cross(P a, P b) { return a.real() * b.imag() - a.imag() * b.real(); }\\n\\ntemplate <class iter>\\nstd::pair<P, ld> min_ball(iter left, iter right, int seed = 1333) {\\n const int n = right - left;\\n\\n assert(n >= 1);\\n if (n == 1) {\\n return {*left, ld(0)};\\n }\\n\\n std::mt19937 mt(seed);\\n std::shuffle(left, right, mt);\\n // std::random_shuffle(left, right); // simple but deprecated\\n\\n iter ps = left;\\n using circle = std::pair<P, ld>;\\n\\n auto make_circle_3 = [](const P &a, const P &b, const P &c) -> circle {\\n ld A = std::norm(b - c), B = std::norm(c - a), C = std::norm(a - b),\\n S = cross(b - a, c - a);\\n P p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) / (4 * S * S);\\n ld r2 = std::norm(p - a);\\n return {p, r2};\\n };\\n\\n auto make_circle_2 = [](const P &a, const P &b) -> circle {\\n P c = (a + b) / (ld)2;\\n ld r2 = std::norm(a - c);\\n return {c, r2};\\n };\\n\\n auto in_circle = [](const P &a, const circle &c) -> bool {\\n return std::norm(a - c.first) <= c.second + eps;\\n };\\n\\n circle c = make_circle_2(ps[0], ps[1]);\\n\\n // MiniDisc\\n for (int i = 2; i < n; ++i) {\\n if (!in_circle(ps[i], c)) {\\n // MiniDiscWithPoint\\n c = make_circle_2(ps[0], ps[i]);\\n for (int j = 1; j < i; ++j) {\\n if (!in_circle(ps[j], c)) {\\n // MiniDiscWith2Points\\n c = make_circle_2(ps[i], ps[j]);\\n for (int k = 0; k < j; ++k) {\\n if (!in_circle(ps[k], c)) {\\n c = make_circle_3(ps[i], ps[j], ps[k]);\\n }\\n }\\n }\\n }\\n }\\n }\\n return c;\\n}\\n//END\\n\\nint n, m;\\nP p[14];\\ndouble radius[1 << 14];\\ndouble dp[15][1 << 14];\\n\\nint main() {\\n\\tint i, j, k;\\n\\t\\n\\tcin >> n >> m;\\n\\trep(i, n) {\\n\\t\\tdouble x, y; cin >> x >> y;\\n\\t\\tp[i] = P(x, y);\\n\\t}\\n\\t\\n\\trep(i, (1 << n)) {\\n\\t\\tif (i == 0) continue;\\n\\t\\tvector<P> ps;\\n\\t\\trep(j, n) {\\n\\t\\t\\tif ((i >> j) % 2 == 1) {\\n\\t\\t\\t\\tps.push_back(p[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tradius[i] = min_ball(ps.begin(), ps.end()).second;\\n\\t\\tradius[i] = sqrt(radius[i]);\\n\\t}\\n\\n\\tdouble INF = 1e+9;\\n\\trep(i, n + 1) rep(j, (1 << n)) dp[i][j] = INF;\\n\\t\\n\\tdp[0][0] = 0;\\n\\trep(i, m) {\\n\\t\\trep(j, (1 << n)) {\\n\\t\\t\\t//参考：https://kimiyuki.net/blog/2017/07/16/enumerate-sets-with-bit-manipulation/\\n\\t\\t\\tint z = (1 << n) - 1 - j;\\n\\t\\t\\tfor (int y = 0; ; y = (y - z) & z) {\\n\\t\\t\\t\\tchmin(dp[i + 1][j + y], max(dp[i][j], radius[y]));\\n\\t\\t\\t\\tif (y == z) break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tdouble ans = INF;\\n\\trep(i, m + 1) {\\n\\t\\tchmin(ans, dp[i][(1 << n) - 1]);\\n\\t}\\n\\tprintf(\\\"%.14f\\\\n\\\", ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 5284,\n \"score_of_the_acc\": -0.1099,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3034_3251578\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\n/* 基本要素 */\\ntypedef complex<double> Point;\\ntypedef pair<Point, Point> Line;\\ntypedef vector<Point> VP;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-9; // 許容誤差^2\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 点集合を含む最小の円の中心\\nPoint minEnclosingCircle(const VP& ps) {\\n Point c;\\n double move = 0.5;\\n rep(i,30) { // 2^(-39-1) \\\\approx 0.9e-12\\n rep(t,30) {\\n double max = 0;\\n int k = 0;\\n rep (j, ps.size()) if (max < norm(ps[j]-c)) {\\n max = norm(ps[j]-c);\\n k = j;\\n }\\n c += (ps[k]-c) * move;\\n }\\n move /= 2;\\n }\\n return c;\\n}\\n\\nPoint READ(){\\n int x,y;\\n cin >>x >>y;\\n return Point(x,y);\\n}\\n\\nconst int N = 14;\\nconst int INF = 19191919;\\nint dp[1<<N];\\n\\nint main(){\\n int n,m;\\n cin >>n >>m;\\n\\n VP p(n);\\n rep(i,n) p[i] = READ();\\n\\n vector<double> r(1<<n);\\n for(int mask=1; mask<(1<<n); ++mask){\\n VP pts;\\n rep(i,n)if(mask>>i&1) pts.pb(p[i]);\\n\\n Point c = minEnclosingCircle(pts);\\n for(Point pp:pts) r[mask] = max(r[mask], abs(pp-c));\\n }\\n\\n auto check = [&](double lim){\\n rep(i,1<<n) dp[i] = INF;\\n dp[(1<<n)-1] = 0;\\n\\n for(int mask = (1<<n)-1; mask>0; --mask){\\n int sub = mask;\\n do{\\n sub = sub-1;\\n sub &= mask;\\n int tgt = mask^sub;\\n if(r[tgt] <= lim) dp[sub] = min(dp[sub], dp[mask]+1);\\n }while(sub>0);\\n }\\n\\n return dp[0]<=m;\\n };\\n\\n double ng=0, ok = 500000;\\n rep(loop,100){\\n double mid = (ng+ok)/2;\\n if(check(mid)) ok = mid;\\n else ng = mid;\\n }\\n printf(\\\"%.10f\\\\n\\\", ok);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.7838,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3034_2851164\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n/* 幾何の基本 */\\n\\n#include <complex>\\n\\ntypedef complex<ld> Point;\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// 点の入力\\nPoint input_Point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// 誤差つき等号判定\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// 内積\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// 外積\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// 直線の定義\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// 円の定義\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// ccw\\n// 1: a,b,cが反時計周りの順に並ぶ\\n//-1: a,b,cが時計周りの順に並ぶ\\n// 2: c,a,bの順に直線に並ぶ\\n//-2: a,b,cの順に直線に並ぶ\\n// 0: a,c,bの順に直線に並ぶ\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,cが反時計周りの順に並ぶ\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,cが時計周りの順に並ぶ\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,bの順に直線に並ぶ\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,cの順に直線に並ぶ\\n\\treturn 0; // a,c,bの順に直線に並ぶ\\n}\\n\\n\\n/* 交差判定 */\\n\\n// 直線と直線の交差判定\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// 直線と線分の交差判定\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// 線分と線分の交差判定\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// 点の直線上判定\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// 点の線分上判定\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// 垂線の足\\nPoint proj(const Line &l, const Point& p) {\\n\\tld t = dot(p - l.a, l.b - l.a) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.b - l.a);\\n}\\n\\n//線対象の位置にある点\\nPoint reflect(const Line &l, const Point &p) {\\n\\tPoint pr = proj(l, p);\\n\\treturn pr * 2.l - p;\\n}\\n\\n// 直線と直線の交点\\nPoint is_ll(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n// 直線と直線の交点\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// 線分と線分の交点\\n// 重なってる部分あるとassert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//先にisis_ssしてね\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// 線分と線分の交点\\nvector<Point> is_ss2(const Line &s, const Line& t) {\\n\\tvector<Point> kouho(is_ll2(s, t));\\n\\tvector<Point>ans;\\n\\tfor (auto p : kouho) {\\n\\t\\tif (isis_sp(s, p) && isis_sp(t, p))ans.emplace_back(p);\\n\\t}\\n\\treturn ans;\\n}\\n// 直線と点の距離\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n//直線と直線の距離\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// 直線と線分の距離\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// 線分と点の距離\\nld dist_sp(const Line& s, const Point& p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(r - p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// 線分と線分の距離\\nld dist_ss(const Line& s, const Line& t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\n\\n//直線と直線の二等分線のベクトル\\nLine line_bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n//点と点の垂直二等分線 aを左に見ながら\\nLine point_bisection(const Point&a, const Point&b) {\\n\\tconst Point cen((a + b) / 2.l);\\n\\tconst Point vec = (b - a)*Point(0, 1);\\n\\treturn Line(cen, cen + vec);\\n}\\n\\n//三つの点からなる外心\\nPoint outer_center(const vector<Point>&ps) {\\n\\tassert(ps.size() == 3);\\n\\tLine l1 = point_bisection(ps[0], ps[1]);\\n\\tLine l2 = point_bisection(ps[1], ps[2]);\\n\\n\\treturn is_ll(l1, l2);\\n}\\n\\n\\n//三つの直線からなる内心\\n//三つの直線が並行でないことは確かめといてね\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(line_bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(line_bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//三つの直線からなる傍心\\n//三つの直線が並行でないことは確かめといてね\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(line_bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(line_bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:並行\\n//c:並行でない\\n//三つの直線から同距離の位置を求める。\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(line_bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(line_bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(line_bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* 円 */\\n\\n// 円と円の交点\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n/*\\n点が円の中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint is_in_Circle(const Point& p, const Circle &cir) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\nint is_in_Circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n/*\\n円lcが円rcの中にいるか\\n0 => out\\n1 => on\\n2 => in*/\\nint Circle_in_Circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// 円と直線の交点\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// 円と線分の距離\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// 円と点の接線\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// 円と円の接線\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), nret.begin(), nret.end());\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//二つの円の重なり面積\\nld two_Circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* 多角形 */\\n\\ntypedef vector<Point> Polygon;\\n\\n\\n\\n//多角形(複数の点)の最小包含円をO(N=頂点数)で求めるアルゴリズム\\n//同一直線上に三つの点がないこと\\n#include<random>\\nCircle welzl(vector<Point>ps) {\\n\\tstruct solver {\\n\\t\\tCircle solve(vector<Point>&ps, vector<Point>&rs) {\\n\\t\\t\\tif (ps.empty() || rs.size() == 3) {\\n\\t\\t\\t\\tif (rs.size() == 1) {\\n\\t\\t\\t\\t\\treturn Circle(Point(rs[0]), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 2) {\\n\\t\\t\\t\\t\\treturn Circle((rs[0] + rs[1]) / 2.0l, abs(rs[1] - rs[0]) / 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (rs.size() == 3) {\\n\\t\\t\\t\\t\\tvector<Line> ls(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tls[i] = Line(rs[i], rs[(i + 1) % 3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tPoint center = outer_center(rs);\\n\\t\\t\\t\\t\\treturn Circle(center, abs(center - rs[0]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn Circle(Point(), 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPoint p_ba = ps.back();\\n\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\tCircle d = solve(ps, rs);\\n\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\tif (is_in_Circle(d, p_ba)) {\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\trs.push_back(p_ba);\\n\\t\\t\\t\\t\\tps.pop_back();\\n\\t\\t\\t\\t\\tauto ans = solve(ps, rs);\\n\\t\\t\\t\\t\\tps.push_back(p_ba);\\n\\t\\t\\t\\t\\trs.pop_back();\\n\\t\\t\\t\\t\\treturn ans;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}so;\\n\\tstd::random_device rd;\\n\\tstd::mt19937 mt(rd());\\n\\tshuffle(ps.begin(), ps.end(), mt);\\n\\tvector<Point>rs;\\n\\tCircle ans = so.solve(ps, rs);\\n\\treturn ans;\\n}\\n// 面積\\nld get_area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tfor (int j = 0; j<n; ++j) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n//多角形の回転方向\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// 円の内外判定\\n/*0 => out\\n1 => on\\n2 => in*/\\nint is_in_Polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//円の内外判定2 高速\\nenum { out, on, in };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// 凸包\\n//点や線を返すことも有り得るので注意\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n//凸カット\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon q;\\n\\tPolygon r;\\n\\tfor(int i=0;i<n;++i) {\\n\\t\\tPoint a = ps[i], b = ps[(i + 1) % n];\\n\\t\\tLine m = Line(a, b);\\n\\t\\tif (ccw(l.a, l.b, a) != -1) q.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) != 1) r.push_back(a);\\n\\t\\tif (ccw(l.a, l.b, a) * ccw(l.a, l.b, b) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tq.push_back(is_ll(l, m));\\n\\t\\t\\tr.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ q,r };\\n\\treturn polys;\\n}\\n\\n\\n/* アレンジメント */\\nvoid add_Point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\nbool solve(vector<pair<ld, vector<int>>>bombs, int N, int M, ld len) {\\n\\t{\\n\\t\\tauto n_bombs(bombs);\\n\\t\\tn_bombs.clear();\\n\\t\\tfor (int i = 0; i < bombs.size(); ++i) {\\n\\t\\t\\tld r=bombs[i].first;\\n\\t\\t\\tif(r<len)n_bombs.emplace_back(bombs[i]);\\n\\t\\t}\\n\\t\\tbombs=n_bombs;\\n\\t}\\n\\n\\tvector<vector<int>>memo(M+1,vector<int>(1<<N));\\n\\tmemo[0][0]=true;\\n\\tfor (int b_use = 0; b_use < M; ++b_use) {\\n\\t\\tfor (int i = 0; i < (1 << N); ++i) {\\n\\t\\t\\tif(!memo[b_use][i])continue;\\n\\n\\t\\t\\tfor (auto&& now_b : bombs) {\\n\\n\\t\\t\\t\\tbitset<14>bs(i);\\n\\t\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\t\\tif(now_b.second[j])bs[j]=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo[b_use+1][bs.to_ulong()]=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo[M][(1<<N)-1];\\n}\\n\\n\\n\\nint main() {\\n\\tint N,M;cin>>N>>M;\\n\\tvector<Point>pos;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint x,y;cin>>x>>y;\\n\\t\\tpos.push_back(Point(x,y));\\n\\t}\\n\\n\\tvector<pair<ld,vector<int>>>bombs;\\n\\t{\\n\\t\\tvector<int>v(3);\\n\\t\\tfor (v[0] = 0; v[0] < N; ++v[0]) {\\n\\t\\t\\t{\\n\\t\\t\\t\\tld r=1e-8;\\n\\t\\t\\t\\tCircle c(pos[v[0]], r);\\n\\n\\t\\t\\t\\tvector<int>oks(N);\\n\\t\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\t\\tif (is_in_Circle(c, pos[i])) {\\n\\t\\t\\t\\t\\t\\toks[i] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbombs.push_back(make_pair(r, oks));\\n\\t\\t\\t}\\n\\t\\t\\tfor ( v[1] = v[0] + 1; v[1] < N; ++v[1]) {\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tPoint p((pos[v[0]]+pos[v[1]])/2.0l);\\n\\t\\t\\t\\t\\tconst ld r = abs(p - pos[v[0]]);\\n\\t\\t\\t\\t\\tCircle c(p, r);\\n\\n\\t\\t\\t\\t\\tvector<int>oks(N);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\t\\t\\tif (is_in_Circle(c, pos[i])) {\\n\\t\\t\\t\\t\\t\\t\\toks[i] = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbombs.push_back(make_pair(r, oks));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor (v[2] = v[1] + 1; v[2] < N; ++v[2]) {\\n\\t\\t\\t\\t\\tvector<Point>ci_pos(3);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tci_pos[i]=pos[v[i]];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tLine l1 = point_bisection(ci_pos[0], ci_pos[1]);\\n\\t\\t\\t\\t\\tLine l2 = point_bisection(ci_pos[1], ci_pos[2]);\\n\\t\\t\\t\\t\\tPoint sv = l1.b - l1.a, tv = l2.b - l2.a;\\n\\t\\t\\t\\t\\tif (abs(cross(sv, tv)) < eps) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tPoint p(outer_center(ci_pos));\\n\\t\\t\\t\\t\\tconst ld r=abs(p-ci_pos[0]);\\n\\t\\t\\t\\t\\tCircle c(p,r);\\n\\n\\t\\t\\t\\t\\tvector<int>oks(N);\\n\\t\\t\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\t\\t\\tif (is_in_Circle(c, pos[i])) {\\n\\t\\t\\t\\t\\t\\t\\toks[i]=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbombs.push_back(make_pair(r,oks));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tmap<int, ld>mp;\\n\\t\\tfor (auto&& bomb : bombs) {\\n\\t\\t\\tbitset<14>bs;\\n\\t\\t\\tfor (int i = 0; i < bomb.second.size(); ++i) {\\n\\t\\t\\t\\tif(bomb.second[i])bs[i]=true;\\n\\t\\t\\t}\\n\\t\\t\\tif (mp.find(bs.to_ulong()) == mp.end()) {\\n\\t\\t\\t\\tmp[bs.to_ulong()]=bomb.first;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmp[bs.to_ulong()]=min(bomb.first,mp[bs.to_ulong()]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tauto n_bombs(bombs);\\n\\t\\tn_bombs.clear();\\n\\t\\tfor (auto m : mp) {\\n\\t\\t\\tbitset<14>bs(m.first);\\n\\t\\t\\tvector<int>v(N);\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tif(bs[i])v[i]=true;\\n\\t\\t\\t}\\n\\t\\t\\tn_bombs.emplace_back(m.second,v);\\n\\t\\t}\\n\\t\\tbombs=n_bombs;\\n\\t}\\n\\n\\tld l=0,r=1e5;\\n\\tint time=30;\\n\\twhile (time--) {\\n\\t\\tld m=(l+r)/2;\\n\\t\\tif (solve(bombs, N, M, m)) {\\n\\t\\t\\tr=m;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tl=m;\\n\\t\\t}\\n\\t}\\n\\tcout<<setprecision(10)<<fixed;\\n\\tcout<<l<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -0.4384,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3034_2832917\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;++i)\\n#define rep(i,n) REP(i,0,n)\\n#define ALL(x) x.begin(),x.end()\\n#define EPS (1e-8)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n#define COUNTER_CLOCKWISE 1\\n#define CLOCKWISE -1 \\n#define ONLINE_BACK 2\\n#define ONLINE_FRONT -2\\n#define ON_SEGMENT 0\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> ii;\\n\\ninline bool LT(double a,double b) { return !equals(a,b) && a < b; }\\ninline bool LTE(double a,double b) { return equals(a,b) || a < b; }\\n\\n\\nconst int MAX_V = 2000; /////////////////////////////////////////////////////////////\\n\\nstruct Edge{ int to,cap,rev; };\\n\\nvector<Edge> G[MAX_V];\\nbool used[MAX_V];\\n\\nvoid add_edge(int from,int to,int cap){\\n G[from].push_back((Edge){to,cap,(int)G[to].size()});\\n G[to].push_back((Edge){from,0,(int)G[from].size()-1});\\n}\\n\\nint dfs(int v,int t,int f){\\n if( v == t ) return f;\\n used[v] = true;\\n for(int i=0;i<(int)G[v].size();i++){\\n Edge &e = G[v][i];\\n if( !used[e.to] && e.cap > 0 ){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if( d > 0 ){\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow = 0;\\n for(;;){\\n memset(used,0,sizeof(used));\\n int f = dfs(s,t,INT_MAX);\\n if( f == 0 ) return flow;\\n flow += f;\\n }\\n}\\n\\nvoid init(int _size=MAX_V){ rep(i,_size) G[i].clear(); }\\n\\n\\n\\nclass Point{\\npublic:\\n double x,y;\\n\\n Point(double x = 0,double y = 0): x(x),y(y){}\\n\\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\n bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }\\n\\n bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }\\n\\n};\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}\\n bool operator < (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }\\n bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }\\n\\n};\\n\\ntypedef Point Vector;\\ntypedef Segment Line;\\ntypedef vector<Point> Polygon;\\n\\nostream& operator << (ostream& os,const Point& a){ return os << \\\"(\\\" << a.x << \\\",\\\" << a.y << \\\")\\\"; }\\n\\nostream& operator << (ostream& os,const Segment& a){ return os << \\\"( \\\" << a.p1 << \\\" , \\\" << a.p2 << \\\" )\\\"; }\\n\\ndouble dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }\\n\\ndouble cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }\\n\\ndouble norm(Point a){ return a.x*a.x+a.y*a.y; }\\n\\ndouble abs(Point a){ return sqrt(norm(a)); }\\n\\n//rad は角度をラジアンで持たせること\\nPoint rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }\\n\\n// 度をラジアンに変換\\ndouble toRad(double agl){ return agl*M_PI/180.0; }\\n\\n// a => prev, b => cur, c=> next\\n// prev から cur へ行って next へ行く際の角度を求める\\ndouble getArg(Point a,Point b,Point c){\\n double arg1 = atan2(b.y-a.y,b.x-a.x);\\n double arg2 = atan2(c.y-b.y,c.x-b.x);\\n double arg = fabs( arg1 - arg2 );\\n while( arg > M_PI ) arg -= 2.0 * M_PI;\\n return fabs(arg);\\n}\\n\\n\\n\\n\\n\\n\\nint N,M;\\nPoint ps[111];\\n\\nint dp[20*20*20][1<<14];\\nint calc(int n,double r) {\\n vector<int> vec;\\n\\n rep(i,n) {\\n int bits = 0;\\n rep(j,n) {\\n if( LTE(abs(ps[i]-ps[j]),r) ) {\\n\\tbits |= (1<<j);\\n }\\n }\\n vec.push_back(bits);\\n }\\n \\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i == j)continue;\\n Point Rr = ps[i]-ps[j];\\n if(abs(Rr) <= r*2+EPS || 1){\\n\\tPoint UKPC,U,P1,P2;\\n\\tUKPC = (ps[i]+ps[j])*0.5;\\n\\tdouble l = abs(ps[i]-ps[j]) * 0.5;\\n\\tif( LTE(r * r - l * l,0) ) continue;\\n\\tdouble T = sqrt(r*r-l*l);\\n\\t\\n\\tUKPC = (ps[i]+ps[j])*0.5;\\n\\t//P1 = UKPC + (ps[i]-point[j])/abs(point[i]-point[j])*polar(T,PI/2.0);\\n\\tPoint uni = (ps[i] - ps[j]) / abs(ps[i]-ps[j]);\\n\\t//cout << \\\"uni = \\\" << uni <<endl;\\n\\t//P1 = UKPC + (T*((ps[i]-ps[j])/abs(ps[i]-ps[j])))*\\n\\tP1 = UKPC + rotate(uni,M_PI/2.0) * T;\\n\\t//P2 = UKPC + (ps[i]-point[j])/abs(point[i]-point[j])*polar(T,-PI/2.0);\\n\\t//P2 = UKPC + (ps[i]-ps[j])/abs(ps[i]-ps[j])*rotate(T,-M_PI/2.0);\\n\\tP2 = UKPC + rotate(uni,-M_PI/2.0) * T;\\n\\t/*\\n\\tputs(\\\"\\\");\\n\\tcout << ps[i] << \\\" and \\\" << ps[j] << endl;\\n\\tcout << \\\"UKPC = \\\" << UKPC << endl;\\n\\tcout << \\\"T = \\\" << T << endl;\\n\\tcout << \\\"P1 = \\\" << P1 << \\\", P2 = \\\" << P2 << endl;\\n\\t*/\\n\\t//cout << ps[i] << \\\" and \\\" << ps[j] <<endl;;\\n\\tdouble Calc;\\n\\tint bits = 0;\\n\\tfor(int k=0;k<n;k++){\\n\\t Calc = abs(P1-ps[k]);\\n\\t if(fabs(Calc) < r+EPS){\\n\\t bits |= (1<<k);\\n\\t }\\n\\t}\\n\\t//bitset<5> BIT(bits);\\n\\t//cout << BIT << endl;\\n\\tvec.push_back(bits);\\n\\tbits = 0;\\n\\tfor(int k=0;k<n;k++){\\n\\t Calc = abs(P2-ps[k]);\\n\\t if(fabs(Calc) < r+EPS){\\n\\t bits |= (1<<k);\\n\\t }\\n\\t}\\n\\t//BIT = bits;\\n\\t//cout << BIT << endl;\\n\\tvec.push_back(bits);\\n \\n }\\n \\n }\\n }\\n assert(vec.size()<20*20*20);\\n int len = vec.size();\\n rep(i,len+1) rep(j,(1<<n)) {\\n dp[i][j] = INT_MAX;\\n }\\n dp[0][0] = 0;\\n\\n rep(i,len) {\\n rep(j,(1<<n)) {\\n int bits = vec[i];\\n dp[i+1][j] = min(dp[i+1][j|bits],dp[i][j]);\\n if( dp[i][j] == INT_MAX ) continue;\\n dp[i+1][j|bits] = min(dp[i+1][j|bits],dp[i][j]+1);\\n\\n }\\n }\\n int resp = dp[len][(1<<n)-1];\\n return resp;\\n}\\n\\nbool check(double r) {\\n return calc(N,r) <= M;\\n}\\n\\nvoid compute() {\\n double L=0,R=100000000;//fewopajfeaw\\n rep(_,100) {//feoajfewao\\n double _M = ( L + R ) * 0.5;\\n if( check(_M) ) {\\n R = _M;\\n } else {\\n L = _M;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",L);\\n}\\n\\nint main() {\\n cin >> N >> M;\\n rep(i,N) cin >> ps[i].x >> ps[i].y;\\n compute();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 27928,\n \"score_of_the_acc\": -1.5442,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3034_2812330\",\n \"code_snippet\": \"// 基本テンプレート\\n \\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\nusing namespace std;\\n \\n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\\n#define debug(...) fprintf(stderr, __VA_ARGS__)\\n#define int long long int\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst ll INF = 1001001001001001LL;\\nconst ll MOD = 1000000007LL;\\n\\nusing ld = double;\\nusing P = complex<ld>;\\nusing G = vector<P>;\\nconst ld pi = acos(-1);\\nconst ld eps = 1e-10;\\nconst ld inf = 1e12;\\n \\nld cross(const P& a, const P& b) { return a.real()*b.imag() - a.imag()*b.real(); }\\nld dot(const P& a, const P& b) { return a.real()*b.real() + a.imag()*b.imag(); }\\n\\nusing C = pair<ld, P>;\\n#define rad first\\n#define pnt second\\n \\nC smallest_enclosing_disc(vector<P> ps){\\n auto c3 = [](const P &a, const P &b, const P &c){\\n ld A = norm(b - c);\\n ld B = norm(c - a);\\n ld C = norm(a - b);\\n ld S = abs(cross(b - a, c - a));\\n P p = (A*(B+C-A)*a + B*(C+A-B)*b + C*(A+B-C)*c) / (4*S*S);\\n ld r = abs(p - a);\\n return make_pair(r, p);\\n };\\n \\n auto c2 = [](const P &a, const P &b){\\n P c = (a + b) / (ld)2;\\n ld r = abs(a - c);\\n return make_pair(r, c);\\n };\\n \\n auto in_circle = [](const P &a, const C &c){\\n return norm(a - c.pnt) <= c.rad*c.rad + eps;\\n };\\n \\n int n = ps.size();\\n if(n == 1) return make_pair(0, ps[0]);\\n random_shuffle(ps.begin(), ps.end());\\n C c = c2(ps[0], ps[1]);\\n for(int i = 2; i < n; ++i){\\n if(!in_circle(ps[i], c)){\\n c = c2(ps[0], ps[i]);\\n for(int j = 1; j < i; ++j){\\n if(!in_circle(ps[j], c)){\\n c = c2(ps[j], ps[i]);\\n for(int k = 0; k < j; ++k){\\n if(!in_circle(ps[k], c)){\\n c = c3(ps[i], ps[j], ps[k]);\\n }\\n }\\n }\\n }\\n }\\n }\\n return c;\\n}\\n\\ndouble circle_r[1 << 14];\\ndouble dp[1 << 14][20];\\ndouble solve(int bit, int k) {\\n if(dp[bit][k] >= 0) return dp[bit][k];\\n if(k == 1) return dp[bit][k] = circle_r[bit];\\n \\n dp[bit][k] = inf;\\n for(int part=bit; part>0; part=(part-1)&bit) {\\n int nbit = bit ^ part;\\n chmin(dp[bit][k], max(solve(nbit, k-1), circle_r[part]));\\n // printf(\\\"lhs(%lld, %lld) = %.12f, rhs(%lld) = %.12f\\\\n\\\", nbit, k-1, dp[nbit][k-1], part, circle_r[part]);\\n }\\n // printf(\\\"dp[%lld][%lld] = %.12f\\\\n\\\", bit, k, dp[bit][k]);\\n return dp[bit][k];\\n}\\n \\nsigned main() {\\n int N, M; cin >> N >> M;\\n vector<P> ps;\\n for(int i=0; i<N; i++) {\\n double x, y; cin >> x >> y;\\n ps.push_back(P(x, y));\\n }\\n\\n for(int bit=1; bit<(1<<N); bit++) {\\n vector<P> tmp;\\n for(int i=0; i<N; i++) {\\n if(bit >> i & 1) tmp.push_back(ps[i]);\\n }\\n circle_r[bit] = smallest_enclosing_disc(tmp).first;\\n // printf(\\\"circle_r[%lld] = %.12f\\\\n\\\", bit, circle_r[bit]);\\n }\\n\\n for(int i=0; i<(1 << N); i++) {\\n fill(dp[i], dp[i] + 20, -1);\\n }\\n printf(\\\"%.12f\\\\n\\\", solve((1 << N) - 1, M));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5956,\n \"score_of_the_acc\": -0.1195,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3034_2756312\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing Real = double;\\nusing Point = complex< Real >;\\nconst Real EPS = 1e-8, PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, Point &p) {\\n os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\nPoint rotate(Real theta, const Point &p) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) {\\n return (r * 180.0 / PI);\\n}\\n\\nReal degree_to_radian(Real d) {\\n return (d * PI / 180.0);\\n}\\n\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n const Point v(b - a), w(c - b);\\n Real alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n if(alpha > beta) swap(alpha, beta);\\n Real theta = (beta - alpha);\\n return min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\n bool operator<(const Point &a, const Point &b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\n\\nstruct Line {\\n Point a, b;\\n\\n Line() = default;\\n\\n Line(Point a, Point b) : a(a), b(b) {}\\n\\n Line(Real A, Real B, Real C) // Ax + By = C\\n {\\n if(eq(A, 0)) a = Point(0, C / B), b = Point(1, C / B);\\n else if(eq(B, 0)) b = Point(C / A, 0), b = Point(C / A, 1);\\n else a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n\\n friend ostream &operator<<(ostream &os, Line &p) {\\n return os << p.a << \\\" to \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a) {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\nstruct Segment : Line {\\n Segment() = default;\\n\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n Point p;\\n Real r;\\n\\n Circle() = default;\\n\\n Circle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector< Point >;\\nusing Polygon = vector< Point >;\\nusing Segments = vector< Segment >;\\nusing Lines = vector< Line >;\\nusing Circles = vector< Circle >;\\n\\nReal cross(const Point &a, const Point &b) {\\n return real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\nReal dot(const Point &a, const Point &b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n if(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n if(dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\"\\n if(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\nbool intersect(const Line &l, const Point &p) {\\n return abs(ccw(l.a, l.b, p)) != 1;\\n}\\n\\nbool intersect(const Line &l, const Line &m) {\\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\\n}\\n\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\nbool intersect(const Line &l, const Segment &s) {\\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) {\\n return distance(l, c.p) <= c.r + EPS;\\n}\\n\\nbool intersect(const Circle &c, const Point &p) {\\n return abs(abs(p - c.p) - c.r) < EPS;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nbool intersect(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n if(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n if(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n if(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n const Point h = projection(l, c.p);\\n if(dot(l.a - h, l.b - h) < 0) return 2;\\n return 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n if(c1.r < c2.r) swap(c1, c2);\\n Real d = abs(c1.p - c2.p);\\n if(c1.r + c2.r < d) return 4;\\n if(eq(c1.r + c2.r, d)) return 3;\\n if(c1.r - c2.r < d) return 2;\\n if(eq(c1.r - c2.r, d)) return 1;\\n return 0;\\n}\\n\\nReal distance(const Point &a, const Point &b) {\\n return abs(a - b);\\n}\\n\\nReal distance(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nReal distance(const Line &l, const Line &m) {\\n return intersect(l, m) ? 0 : distance(l, m.a);\\n}\\n\\nReal distance(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if(intersect(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n if(intersect(a, b)) return 0;\\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n if(intersect(l, s)) return 0;\\n return min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) {\\n return crosspoint(Line(l), Line(m));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair< Point, Point > crosspoint(const Circle &c, const Line l) {\\n Point pr = projection(l, c.p);\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n if(eq(distance(l, c.p), c.r)) return {pr, pr};\\n double base = sqrt(c.r * c.r - norm(pr - c.p));\\n return {pr - e * base, pr + e * base};\\n}\\n\\npair< Point, Point > crosspoint(const Circle &c, const Segment &l) {\\n Line aa = Line(l.a, l.b);\\n if(intersect(c, l) == 2) return crosspoint(c, aa);\\n auto ret = crosspoint(c, aa);\\n if(dot(l.a - ret.first, l.b - ret.first) < 0) ret.second = ret.first;\\n else ret.first = ret.second;\\n return ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair< Point, Point > crosspoint(const Circle &c1, const Circle &c2) {\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\npair< Point, Point > tangent(const Circle &c1, const Point &p2) {\\n return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r)));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\nLines tangent(Circle c1, Circle c2) {\\n Lines ret;\\n if(c1.r < c2.r) swap(c1, c2);\\n Real g = norm(c1.p - c2.p);\\n if(eq(g, 0)) return ret;\\n Point u = (c2.p - c1.p) / sqrt(g);\\n Point v = rotate(PI * 0.5, u);\\n for(int s : {-1, 1}) {\\n Real h = (c1.r + s * c2.r) / sqrt(g);\\n if(eq(1 - h * h, 0)) {\\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n } else if(1 - h * h > 0) {\\n Point uu = u * h, vv = v * sqrt(1 - h * h);\\n ret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n ret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n }\\n }\\n return ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\nbool is_convex(const Polygon &p) {\\n int n = (int) p.size();\\n for(int i = 0; i < n; i++) {\\n if(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n }\\n return true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\nPolygon convex_hull(Polygon &p) {\\n int n = (int) p.size(), k = 0;\\n if(n <= 2) return p;\\n sort(p.begin(), p.end());\\n vector< Point > ch(2 * n);\\n for(int i = 0; i < n; ch[k++] = p[i++]) {\\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\nenum {\\n OUT, ON, IN\\n};\\n\\nint contains(const Polygon &Q, const Point &p) {\\n bool in = false;\\n for(int i = 0; i < Q.size(); i++) {\\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n if(a.imag() > b.imag()) swap(a, b);\\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\nvoid merge_segments(vector< Segment > &segs) {\\n\\n auto merge_if_able = [](Segment &s1, const Segment &s2) {\\n if(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n if(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n if(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n s1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n return true;\\n };\\n\\n for(int i = 0; i < segs.size(); i++) {\\n if(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n }\\n for(int i = 0; i < segs.size(); i++) {\\n for(int j = i + 1; j < segs.size(); j++) {\\n if(merge_if_able(segs[i], segs[j])) {\\n segs[j--] = segs.back(), segs.pop_back();\\n }\\n }\\n }\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\nvector< vector< int > > segment_arrangement(vector< Segment > &segs, vector< Point > &ps) {\\n vector< vector< int > > g;\\n int N = (int) segs.size();\\n for(int i = 0; i < N; i++) {\\n ps.emplace_back(segs[i].a);\\n ps.emplace_back(segs[i].b);\\n for(int j = i + 1; j < N; j++) {\\n const Point p1 = segs[i].b - segs[i].a;\\n const Point p2 = segs[j].b - segs[j].a;\\n if(cross(p1, p2) == 0) continue;\\n if(intersect(segs[i], segs[j])) {\\n ps.emplace_back(crosspoint(segs[i], segs[j]));\\n }\\n }\\n }\\n sort(begin(ps), end(ps));\\n ps.erase(unique(begin(ps), end(ps)), end(ps));\\n\\n int M = (int) ps.size();\\n g.resize(M);\\n for(int i = 0; i < N; i++) {\\n vector< int > vec;\\n for(int j = 0; j < M; j++) {\\n if(intersect(segs[i], ps[j])) {\\n vec.emplace_back(j);\\n }\\n }\\n for(int j = 1; j < vec.size(); j++) {\\n g[vec[j - 1]].push_back(vec[j]);\\n g[vec[j]].push_back(vec[j - 1]);\\n }\\n }\\n return (g);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\nPolygon convex_cut(const Polygon &U, Line l) {\\n Polygon ret;\\n for(int i = 0; i < U.size(); i++) {\\n Point now = U[i], nxt = U[(i + 1) % U.size()];\\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n ret.push_back(crosspoint(Line(now, nxt), l));\\n }\\n }\\n return (ret);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\nReal area2(const Polygon &p) {\\n Real A = 0;\\n for(int i = 0; i < p.size(); ++i) {\\n A += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\nReal area2(const Polygon &p, const Circle &c) {\\n if(p.size() < 3) return 0.0;\\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n Point va = c.p - a, vb = c.p - b;\\n Real f = cross(va, vb), ret = 0.0;\\n if(eq(f, 0.0)) return ret;\\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n if(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n auto u = crosspoint(c, Segment(a, b));\\n vector< Point > tot{a, u.first, u.second, b};\\n for(int i = 0; i + 1 < tot.size(); i++) {\\n ret += cross_area(c, tot[i], tot[i + 1]);\\n }\\n return ret;\\n };\\n Real A = 0;\\n for(int i = 0; i < p.size(); i++) {\\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n }\\n return A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\nReal convex_diameter(const Polygon &p) {\\n int N = (int) p.size();\\n int is = 0, js = 0;\\n for(int i = 1; i < N; i++) {\\n if(p[i].imag() > p[is].imag()) is = i;\\n if(p[i].imag() < p[js].imag()) js = i;\\n }\\n Real maxdis = norm(p[is] - p[js]);\\n\\n int maxi, maxj, i, j;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n j = (j + 1) % N;\\n } else {\\n i = (i + 1) % N;\\n }\\n if(norm(p[i] - p[j]) > maxdis) {\\n maxdis = norm(p[i] - p[j]);\\n maxi = i;\\n maxj = j;\\n }\\n } while(i != is || j != js);\\n return sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\nReal closest_pair(Points ps) {\\n if(ps.size() <= 1) throw (0);\\n sort(begin(ps), end(ps));\\n\\n auto compare_y = [&](const Point &a, const Point &b) {\\n return imag(a) < imag(b);\\n };\\n vector< Point > beet(ps.size());\\n const Real INF = 1e18;\\n\\n function< Real(int, int) > rec = [&](int left, int right) {\\n if(right - left <= 1) return INF;\\n int mid = (left + right) >> 1;\\n auto x = real(ps[mid]);\\n auto ret = min(rec(left, mid), rec(mid, right));\\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n int ptr = 0;\\n for(int i = left; i < right; i++) {\\n if(abs(real(ps[i]) - x) >= ret) continue;\\n for(int j = 0; j < ptr; j++) {\\n auto luz = ps[i] - beet[ptr - j - 1];\\n if(imag(luz) >= ret) break;\\n ret = min(ret, abs(luz));\\n }\\n beet[ptr++] = ps[i];\\n }\\n return ret;\\n };\\n return rec(0, (int) ps.size());\\n}\\n\\nReal smallest_enclosing_circle(Points &ps) {\\n if(ps.size() == 1) return 0;\\n\\n mt19937 mt;\\n mt.seed(random_device()());\\n shuffle(begin(ps), end(ps), mt);\\n\\n auto make_circle3 = [](const Point &a, const Point &b, const Point &c) {\\n auto A = norm(b - c), B = norm(c - a), C = norm(a - b);\\n auto S = abs(cross(b - a, c - a));\\n auto p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) * 0.25 / S / S;\\n return Circle(p, abs(p - a));\\n };\\n\\n auto make_circle2 = [](const Point &a, const Point &b) {\\n Point c = (a + b) * 0.5;\\n return Circle(c, abs(a - c));\\n };\\n\\n auto in_circle = [](const Point &a, const Circle &c) {\\n return norm(a - c.p) < c.r * c.r + EPS;\\n };\\n\\n Circle c = make_circle2(ps[0], ps[1]);\\n for(int i = 2; i < ps.size(); ++i) {\\n if(!in_circle(ps[i], c)) {\\n c = make_circle2(ps[0], ps[i]);\\n for(int j = 1; j < i; ++j) {\\n if(!in_circle(ps[j], c)) {\\n c = make_circle2(ps[j], ps[i]);\\n for(int k = 0; k < j; ++k) {\\n if(!in_circle(ps[k], c)) {\\n c = make_circle3(ps[i], ps[j], ps[k]);\\n }\\n }\\n }\\n }\\n }\\n }\\n return c.r;\\n}\\n\\ndouble cover[1 << 14];\\ndouble dp[1 << 14][15];\\nbool memo[1 << 14][15];\\n\\ndouble rec(int bit, int sum) {\\n if(sum == 1) return cover[bit];\\n if(memo[bit][sum]) return dp[bit][sum];\\n double ret = 1e9;\\n for(int i = bit & (bit - 1); i > 0; i = (i - 1) & bit) {\\n int other = i ^bit;\\n ret = min(ret, max(rec(other, sum - 1), cover[i]));\\n }\\n memo[bit][sum] = true;\\n return dp[bit][sum] = ret;\\n}\\n\\nint main() {\\n int N, M;\\n Point p[14];\\n\\n cin >> N >> M;\\n for(int i = 0; i < N; i++) {\\n cin >> p[i];\\n }\\n for(int i = 1; i < (1 << N); i++) {\\n Points ps;\\n for(int j = 0; j < N; j++) {\\n if((i >> j) & 1) ps.emplace_back(p[j]);\\n }\\n cover[i] = smallest_enclosing_circle(ps);\\n }\\n cout << fixed << setprecision(10) << rec((1 << N) - 1, M) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 5668,\n \"score_of_the_acc\": -0.1388,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3034_2755890\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define D long double\\nusing namespace std;\\n//typedef long double D;\\ntypedef complex<long double> P;\\ntypedef vector<P> VP;\\ntypedef pair<P, P> L; // Line\\ntypedef vector<P> VP;\\nconst D EPS = 1e-9; // 許容誤差。問題によって変える\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) < (m) + EPS)\\n#define GE(n,m) ((n) + EPS > (m))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\nD dot(P a, P b) {return (conj(a)*b).X; }\\nD cross(P a, P b) { return (conj(a)*b).Y;}\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b,c) > EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\nbool isecSP(P a1, P a2, P b) {\\n return !ccw(a1, a2, b);\\n}\\nP crosspointLL(P a1, P a2, P b1, P b2) {\\n long double d1 = cross(b2-b1, b1-a1);\\n long double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n if (EQ(d2, 0)) throw \\\"kouten ga nai\\\"; // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\nP circumcenter(P a, P b, P c) {\\n a = (a-c)*(long double)0.5;\\n b = (b-c)*(long double)0.5;\\n return c + crosspointLL(a, a*P(1,1), b, b*P(1,1));\\n}\\nint dp[1<<14],n,m;\\nD min_s[1<<14];\\nVP v;\\nvoid Mae_syori(){\\n r(i,(1<<n))min_s[i]=1e15;\\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n for(int k=j+1;k<n;k++){\\n if(isecSP(v[i],v[j],v[k]))continue;\\n if(isecSP(v[i],v[k],v[j]))continue;\\n if(isecSP(v[k],v[j],v[i]))continue;\\n P c=circumcenter(v[i],v[j],v[k]);\\n D ans=0;\\n ans=max(ans,abs(v[i]-c));\\n ans=max(ans,abs(v[j]-c));\\n ans=max(ans,abs(v[k]-c));\\n int mask=0;\\n for(int l=0;l<n;l++){\\n if(abs(v[l]-c)<=ans)mask|=(1<<l);\\n }\\n min_s[mask]=min(ans,min_s[mask]);\\n }\\n D ans=abs(v[i]-v[j])/2;\\n P c=(v[i]+v[j]);c/=2;\\n int mask=0;\\n for(int l=0;l<n;l++){\\n if(abs(v[l]-c)<=ans)mask|=(1<<l);\\n }\\n min_s[mask]=min(ans,min_s[mask]);\\n }\\n }\\n r(i,n)min_s[(1<<i)]=0;\\n for(int i=(1<<n)-1;i>=0;i--){\\n for(int j=(i-1)&i;j>0;j=(j-1)&i){\\n min_s[j]=min(min_s[j],min_s[i]);\\n }\\n }\\n for(int i=0;i<(1<<n);i++) min_s[i]+=0.0000000001;\\n}\\nD dfs(int S){\\n if(dp[S])return dp[S];\\n D res=1e8;\\n for(int i=(S-1)&S;i>0;i=(i-1)&S){\\n res=min(res,dfs(i)+dfs(i^S));\\n }\\n return dp[S]=res;\\n}\\nbool check(D mid){\\n memset(dp,0,sizeof(dp));\\n for(int i=1;i<(1<<n);i++){\\n if(min_s[i]<=mid)dp[i]=1;\\n }\\n return dfs((1<<n)-1)<=m;\\n}\\nD nibutan(){\\n D l=0,r=100000;\\n r(i,77){\\n D mid=(l+r)/2;//cout<<mid<<endl;\\n if(check(mid))r=mid;\\n else l=mid;\\n }\\n return l;\\n}\\nint main(){\\n cin>>n>>m;\\n r(i,n){\\n int x,y;\\n cin>>x>>y;\\n v.push_back(P(x,y));\\n }\\n Mae_syori();\\n printf(\\\"%.12Lf\\\\n\\\",nibutan());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2020,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -0.8872,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1881,"cells":{"group_id":{"kind":"string","value":"aoj_3036_cpp"},"problem_description":{"kind":"string","value":"Problem K: Move on Ice\nProblem\nペンギンのフロロは無限に広い氷の上のマス($sx$,$sy$)にいる。\nマス($tx$,$ty$)に穴があり、そこから水に入ることができる。\n氷の上に$n$個の氷の塊があり、それぞれマス($x_i$,$y_i$)にある。\nフロロは上下左右の4方向に移動できる。\n氷の上は滑りやすいので、移動すると氷の塊にぶつかるまで動き続ける。\n氷の塊にぶつかると氷の塊のあるマスの1マス手前で止まる。\n穴のマスを通過することで穴に入ることができる。\nフロロは1度だけ全力で踏ん張ることにより途中で止まることができる。\n氷の塊にぶつかると痛いのでできるだけぶつかる回数を少なくしたい。\n穴のあるマス($tx$,$ty$)へ移動するまでにぶつかる回数の最小値を求めよ。\n辿り着けない場合は$-$1を出力せよ。\nInput\n入力は以下の形式で与えられる。\n$sx$ $sy$\n$tx$ $ty$\n$n$\n$x_1$ $y_1$\n...\n$x_n$ $y_n$\n入力はすべて整数で与えられる。\n1行目にフロロがいるマスの座標が空白区切りで与えられる。\n2行目に穴があるマスの座標が空白区切りで与えられる。\n3行目に氷の塊の数$n$が与えられる。\n続く$n$行目に氷の塊があるマスの座標が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$0 \\leq n \\leq 10^5$\n$0 \\leq sx$,$sy$,$tx$,$ty$,$x_i$,$y_i \\leq 10^9$\n与えられる座標はすべて異なる\nOutput\n穴に移動するまでにぶつかる回数の最小値を出力せよ。\n辿り着けない場合は$-$1を出力せよ。\nSample Input 1\n0 0\n13 33\n2\n0 34\n14 0\nSample Output 1\n0\nSample Input 2\n0 1\n5 0\n4\n2 1\n1 3\n4 2\n3 0\nSample Output 2\n4\nSample Input 3\n0 0\n0 2\n1\n0 1\nSample Output 3\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3036_5734075","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\ntypedef pair<int,int> P;\ntypedef pair<int,P> PP;\nint dx[4]={0,-1,0,1},dy[4]={-1,0,1,0},INF=1e9+7;\nint d[111111][4],d2[111111][4];\nmap<int,vector<PP> > m[2],m2[2];\nP a[111111];\nset<int> se[2];\nmap<int,int> ma[2];\nmap<int,vector<P> > mm[2];\n\nclass RMQ{\npublic:\n int n,dat[1111111];\n void init(int _n){\n n=1;while(n<_n)n*=2;\n fill(dat,dat+2*n-1,INF);\n }\n void update(int k,int a){\n k+=n-1;dat[k]=a;\n while(k>0){\n k=(k-1)/2;\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\n }\n }\n int query(int a,int b){return query(a,b,0,0,n);}\n int query(int a,int b,int k,int l,int r){\n if(r<=a||b<=l) return INF;\n if(a<=l&&r<=b) return dat[k];\n int vl=query(a,b,k*2+1,l,(l+r)/2);\n int vr=query(a,b,k*2+2,(l+r)/2,r);\n return min(vl,vr);\n }\n};\n\nRMQ r;\nint main() {\n int n,sx,sy,tx,ty;\n cin >> sx >> sy >> tx >> ty >> n;\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\n a[n]=P(sx,sy);\n a[n+1]=P(tx,ty);\n rep(i,n+2) {\n if(i==n) continue;\n m[0][a[i].F].push_back(PP(a[i].S,P(i,0)));\n m[0][a[i].F].push_back(PP(a[i].S,P(i,2)));\n m[1][a[i].S].push_back(PP(a[i].F,P(i,1)));\n m[1][a[i].S].push_back(PP(a[i].F,P(i,3)));\n }\n rep(i,2) {\n for(map<int,vector<PP> >::iterator it=m[i].begin();it!=m[i].end();it++) {\n sort(it->S.begin(),it->S.end());\n }\n }\n rep(i,111111)rep(j,4)d[i][j]=INF;\n queue<P> que;\n rep(i,4) {\n que.push(P(n,i));\n d[n][i]=0;\n }\n while(!que.empty()) {\n P p=que.front();que.pop();\n int x=a[p.F].F,y=a[p.F].S,t=p.S;\n if(p.F!=n) x+=dx[t],y+=dy[t];\n if(t%2) {\n if(!m[0].count(x)) continue;\n int k=upper_bound(m[0][x].begin(),m[0][x].end(),PP(y,P(-INF,-INF)))-m[0][x].begin();\n if(k!=m[0][x].size()) {\n PP q=m[0][x][k];\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\n d[q.S.F][q.S.S]=d[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n }\n k--;\n if(k>=0) {\n PP q=m[0][x][k];\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\n d[q.S.F][q.S.S]=d[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n }\n } else {\n if(!m[1].count(y)) continue;\n int k=upper_bound(m[1][y].begin(),m[1][y].end(),PP(x,P(-INF,-INF)))-m[1][y].begin();\n if(k!=m[1][y].size()) {\n PP q=m[1][y][k];\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\n d[q.S.F][q.S.S]=d[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n }\n k--;\n if(k>=0) {\n PP q=m[1][y][k];\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\n d[q.S.F][q.S.S]=d[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n }\n }\n }\n rep(i,n+2) {\n if(i<n) {\n m2[0][a[i].F-1].push_back(PP(a[i].S,P(i,1)));\n m2[0][a[i].F+1].push_back(PP(a[i].S,P(i,3)));\n m2[1][a[i].S-1].push_back(PP(a[i].F,P(i,0)));\n m2[1][a[i].S+1].push_back(PP(a[i].F,P(i,2)));\n m2[0][a[i].F].push_back(PP(a[i].S-1,P(INF,-1)));\n m2[0][a[i].F].push_back(PP(a[i].S+1,P(-INF,-1)));\n m2[1][a[i].S].push_back(PP(a[i].F-1,P(INF,-1)));\n m2[1][a[i].S].push_back(PP(a[i].F+1,P(-INF,-1)));\n } else {\n m2[0][a[i].F].push_back(PP(a[i].S,P(i,1)));\n m2[0][a[i].F].push_back(PP(a[i].S,P(i,3)));\n m2[1][a[i].S].push_back(PP(a[i].F,P(i,0)));\n m2[1][a[i].S].push_back(PP(a[i].F,P(i,2)));\n }\n }\n rep(i,2) {\n for(map<int,vector<PP> >::iterator it=m2[i].begin();it!=m2[i].end();it++) {\n sort(it->S.begin(),it->S.end());\n }\n }\n rep(i,111111)rep(j,4)d2[i][j]=INF;\n rep(i,4) {\n que.push(P(n+1,i));\n d2[n+1][i]=0;\n }\n while(!que.empty()) {\n P p=que.front();que.pop();\n int x=a[p.F].F,y=a[p.F].S,t=p.S;\n x+=dx[t],y+=dy[t];\n if(t==0) {\n int k=lower_bound(m2[0][x].begin(),m2[0][x].end(),PP(y,P(INF,-1)))-m2[0][x].begin()-1;\n while(k>=0&&m2[0][x][k].S.S!=-1) {\n PP q=m2[0][x][k];\n if(a[q.S.F].S<=y&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n k--;\n }\n } else if(t==1) {\n int k=lower_bound(m2[1][y].begin(),m2[1][y].end(),PP(x,P(INF,-1)))-m2[1][y].begin()-1;\n while(k>=0&&m2[1][y][k].S.S!=-1) {\n PP q=m2[1][y][k];\n if(a[q.S.F].F<=x&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n k--;\n }\n } else if(t==2) {\n int k=upper_bound(m2[0][x].begin(),m2[0][x].end(),PP(y,P(-INF,-1)))-m2[0][x].begin();\n while(k<m2[0][x].size()&&m2[0][x][k].S.S!=-1) {\n PP q=m2[0][x][k];\n if(y<=a[q.S.F].S&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n k++;\n }\n } else {\n int k=upper_bound(m2[1][y].begin(),m2[1][y].end(),PP(x,P(-INF,-1)))-m2[1][y].begin();\n while(k<m2[1][y].size()&&m2[1][y][k].S.S!=-1) {\n PP q=m2[1][y][k];\n if(x<=a[q.S.F].F&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\n que.push(P(q.S.F,q.S.S));\n }\n k++;\n }\n }\n }\n int ans=INF;\n rep(i,4) ans=min(ans,d[n+1][i]);\n if(ans!=INF) ans--;\n rep(i,n+2) {\n rep(j,3) {\n se[0].insert(a[i].F-1+j);\n se[1].insert(a[i].S-1+j);\n }\n }\n se[0].insert(-INF);\n se[0].insert(INF);\n se[1].insert(-INF);\n se[1].insert(INF);\n rep(i,2) {\n int k=0;\n for(set<int>::iterator it=se[i].begin();it!=se[i].end();it++) ma[i][*it]=k++;\n }\n rep(t,2) {\n rep(i,2) mm[i].clear();\n if(t) {\n rep(i,n+2) {\n if(i<n) {\n mm[0][a[i].F].push_back(P(a[i].S-1,d[i][0]));\n mm[0][a[i].F].push_back(P(a[i].S+1,d[i][2]));\n mm[0][a[i].F].push_back(P(a[i].S,-1));\n } else {\n mm[0][a[i].F].push_back(P(a[i].S,d[i][0]));\n mm[0][a[i].F].push_back(P(a[i].S,d[i][2]));\n }\n mm[1][a[i].F].push_back(P(a[i].S,i));\n }\n } else {\n rep(i,n+2) {\n if(i<n) {\n mm[0][a[i].S].push_back(P(a[i].F-1,d[i][1]));\n mm[0][a[i].S].push_back(P(a[i].F+1,d[i][3]));\n mm[0][a[i].S].push_back(P(a[i].F,-1));\n } else {\n mm[0][a[i].S].push_back(P(a[i].F,d[i][1]));\n mm[0][a[i].S].push_back(P(a[i].F,d[i][3]));\n }\n mm[1][a[i].S].push_back(P(a[i].F,i));\n }\n }\n for(map<int,vector<P> >::iterator it=mm[1].begin();it!=mm[1].end();it++) {\n if(it->S.size()) {\n it->S.push_back(P(-INF,INF));\n it->S.push_back(P(INF,INF));\n sort(it->S.begin(),it->S.end());\n }\n }\n rep(k,2) {\n map<int,vector<P> >::iterator it2=mm[1].begin();\n r.init(se[t].size());\n for(map<int,vector<P> >::iterator it=mm[0].begin();;it++) {\n while(it2!=mm[1].end()&&(it==mm[0].end()||it2->F<it->F)) {\n vector<P> v=it2->S;\n rep(i,v.size()-1) {\n int x,y;\n if(t) {\n if(v[i].S==INF) x=INF;\n else x=d2[v[i].S][2];\n if(v[i+1].S==INF) y=INF;\n else y=d2[v[i+1].S][0];\n } else {\n if(v[i].S==INF) x=INF;\n else x=d2[v[i].S][3];\n if(v[i+1].S==INF) y=INF;\n else y=d2[v[i+1].S][1];\n }\n ans=min(ans,r.query(ma[t][v[i].F],ma[t][v[i+1].F])+min(x,y));\n }\n it2++;\n }\n if(it==mm[0].end()) break;\n vector<P> v=it->S;\n rep(i,v.size()) {\n int x=ma[t][v[i].F];\n r.update(x,v[i].S==-1?INF:min(r.query(x,x+1),v[i].S));\n }\n }\n map<int,vector<P> > mm2[2];\n rep(i,2)for(map<int,vector<P> >::iterator it=mm[i].begin();it!=mm[i].end();it++) mm2[i][-it->F]=it->S;\n rep(i,2)mm[i]=mm2[i];\n }\n }\n cout << (ans==INF?-1:ans) << endl;\n return 0;\n}","accuracy":1,"time_ms":1730,"memory_kb":150716,"score_of_the_acc":-1.6909,"final_rank":6},{"submission_id":"aoj_3036_3408005","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvector<int> G[mn];\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tG[ni].push_back(i);\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t\tG[ni].push_back(i);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t\tG[ni].push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t\tG[ni].push_back(i);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t\tG[ni].push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t\tG[ni].push_back(i);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t\tG[ni].push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t\tG[ni].push_back(i);\n\t\t\t}\n\t\t}\n\t}\n}\nint sid;\nvoid invdijkstra(int root) {\n\td[1][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second;\n\t\trep(j, G[i].size()) {\n\t\t\tint to = G[i][j];\n\t\t\tif (to == sid)d[1][sid] = min(d[1][sid], p.first);\n\t\t\telse {\n\t\t\t\tif (p.first + 1 < d[1][to]) {\n\t\t\t\t\td[1][to] = p.first + 1;\n\t\t\t\t\tq.push({ d[1][to],to });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans >= mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\n\t}\n\trep(i, len) {\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); invdijkstra(gid);\n\tans = d[0][gid];\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":30,"memory_kb":69760,"score_of_the_acc":-0.2076,"final_rank":16},{"submission_id":"aoj_3036_3407891","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans >= mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\n\t}\n\trep(i, len) {\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\tans = d[0][gid];\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":30,"memory_kb":58044,"score_of_the_acc":-0.1359,"final_rank":13},{"submission_id":"aoj_3036_3407883","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\n\t}\n\trep(i, len) {\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t\tinv[{v[i].x, v[i].y}] = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\tans = d[0][gid];\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":30,"memory_kb":58028,"score_of_the_acc":-0.1358,"final_rank":12},{"submission_id":"aoj_3036_3407878","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\tans = d[0][gid];\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":30,"memory_kb":58044,"score_of_the_acc":-0.1359,"final_rank":13},{"submission_id":"aoj_3036_3407876","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\tans = d[sid][gid];\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.05,"time_ms":30,"memory_kb":58032,"score_of_the_acc":-0.1358,"final_rank":19},{"submission_id":"aoj_3036_3407850","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 500005;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]+1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue; \n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":30,"memory_kb":58044,"score_of_the_acc":-0.1359,"final_rank":13},{"submission_id":"aoj_3036_3407848","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 300003;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cx[i][j].first, d[1][id]+1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue; \n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tif (v[id].f == 3) {\n\t\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tst.update(cy[i][j].first, d[1][id] + 1);\n\t\t\t}\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":20,"memory_kb":37744,"score_of_the_acc":-0.006,"final_rank":11},{"submission_id":"aoj_3036_3407842","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 300003;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tif (v[id].f == 2)continue;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":10,"memory_kb":37728,"score_of_the_acc":-0.0001,"final_rank":8},{"submission_id":"aoj_3036_3407833","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 300003;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":20,"memory_kb":37736,"score_of_the_acc":-0.0059,"final_rank":10},{"submission_id":"aoj_3036_3407823","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 300003;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0&&loc<cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0&&loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cx[x].size()) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0 && loc<cy[y].size()) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = uy[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.175,"time_ms":20,"memory_kb":37728,"score_of_the_acc":-0.0059,"final_rank":9},{"submission_id":"aoj_3036_3407808","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\n\nint n;\nint sx, sy, gx, gy;\n\nstruct vertice {\n\tint x, y, f;\n\tbool operator<(const vertice &v)const {\n\t\tif (x != v.x)return x < v.x;\n\t\tif (y != v.y)return y < v.y;\n\t\treturn f < v.f;\n\t}\n\tbool operator==(const vertice &v)const {\n\t\tif (x == v.x&&y == v.y&&f == v.f)return true;\n\t\treturn false;\n\t}\n};\n\nvoid compress(vector<vertice> &v) {\n\tint n = v.size();\n\tvector<LP> x, y;\n\trep(i, n) {\n\t\tx.push_back({ v[i].x,i });\n\t\ty.push_back({ v[i].y,i });\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\tint cur = 0;\n\trep(i, n) {\n\t\tv[x[i].second].x = cur;\n\t\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\n\t\t\ti++; v[x[i].second].x = cur;\n\t\t}\n\t\tcur++;\n\t}\n\tcur = 0;\n\trep(i, n) {\n\t\tv[y[i].second].y = cur;\n\t\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\n\t\t\ti++; v[y[i].second].y = cur;\n\t\t}\n\t\tcur++;\n\t}\n}\n\nvector<vertice> v; map<P, int> inv;\n\nconst int mn = 300003;\nvector<P> cx[mn], cy[mn];\n\nint d[2][mn];\npriority_queue<P, vector<P>, greater<P>> q;\nvoid dijkstra(int id, int root) {\n\td[id][root] = 0;\n\tq.push({ 0,root });\n\twhile (!q.empty()) {\n\t\tP p = q.top(); q.pop();\n\t\tint i = p.second; int dist = p.first;\n\t\tint x = v[i].x, y = v[i].y;\n\t\t//x軸\n\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\tloc--;\n\t\tif (loc >= 0) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first + 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cx[x].size()) {\n\t\t\tint ni = cx[x][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{x, cx[x][loc].first - 1}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\t//y軸\n\t\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\tloc--;\n\t\tif (loc >= 0) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first + 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t\tloc++;\n\t\tif (v[i].f >= 2)loc++;\n\t\tif (loc < cy[y].size()) {\n\t\t\tint ni = cy[y][loc].second;\n\t\t\tif (v[ni].f == 0) {\n\t\t\t\tni = inv[{cy[y][loc].first - 1, y}];\n\t\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\t\td[id][ni] = dist + 1;\n\t\t\t\t\tq.push({ d[id][ni],ni });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dist + 1 < d[id][ni]) {\n\t\t\t\td[id][ni] = min(d[id][ni], dist);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint ans = mod;\n\nstruct SegT {\nprivate:\n\tint sz; vector<int> node;\n\tconst int init_c = mod;\npublic:\n\tSegT(int n) {\n\t\tsz = 1;\n\t\twhile (sz < n)sz *= 2;\n\t\tnode.resize(2 * sz - 1, init_c);\n\t}\n\tint f(int a, int b) {\n\t\treturn min(a, b);\n\t}\n\tvoid update(int k, int a) {\n\t\tk += sz - 1;\n\t\tnode[k] = a;\n\t\twhile (k > 0) {\n\t\t\tk = (k - 1) / 2;\n\t\t\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\n\t\t}\n\t}\n\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\n\t\tif (r < 0)r = sz;\n\t\tif (r <= a || b <= l)return init_c;\n\t\telse if (a <= l && r <= b)return node[k];\n\t\telse {\n\t\t\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\n\t\t\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\n\t\t\treturn f(vl, vr);\n\t\t}\n\t}\n};\nint len;\n\n//全頂点が入ってるほう\nvector<P> ux[mn], uy[mn];\n//下から\nvoid calc1() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\n//上から\nvoid calc2() {\n\tSegT st(mn);\n\tper(i, mn) {\n\t\trep(j, ux[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = i, y = ux[i][j].first;\n\t\t\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0) {\n\t\t\t\tle = cx[x][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cx[x].size()) {\n\t\t\t\tri = cx[x][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][ux[i][j].second]);\n\t\t}\n\t\trep(j, cx[i].size()) {\n\t\t\tint id = cx[i][j].second;\n\t\t\tst.update(cx[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc3() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc4() {\n\tSegT st(mn);\n\trep(i, mn) {\n\t\trep(j, uy[i].size()) {\n\t\t\tint le = 0, ri = mn;\n\t\t\tint x = uy[i][j].first, y = i;\n\t\t\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\n\t\t\tloc--;\n\t\t\tif (loc >= 0) {\n\t\t\t\tle = cy[y][loc].first + 1;\n\t\t\t}\n\t\t\tloc++;\n\t\t\tint nowi = ux[i][j].second;\n\t\t\tif (v[nowi].f >= 2)loc++;\n\t\t\tif (loc < cy[y].size()) {\n\t\t\t\tri = cy[y][loc].first;\n\t\t\t}\n\t\t\tint z = st.query(le, ri);\n\t\t\tans = min(ans, z + d[0][uy[i][j].second]);\n\t\t}\n\t\trep(j, cy[i].size()) {\n\t\t\tint id = cy[i][j].second;\n\t\t\tst.update(cy[i][j].first, d[1][id]);\n\t\t}\n\t}\n}\nvoid calc() {\n\tcalc1(); calc2(); calc3(); calc4();\n\tif (ans == mod)cout << -1 << endl;\n\telse cout << ans << endl;\n\treturn;\n}\nint main() {\n\tcin >> sx >> sy >> gx >> gy;\n\tcin >> n;\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tv.push_back({ x,y,0 });\n\t\tv.push_back({ x + 1,y,1 });\n\t\tv.push_back({ x - 1,y,1 });\n\t\tv.push_back({ x,y + 1,1 });\n\t\tv.push_back({ x,y - 1,1 });\n\t}\n\tv.push_back({ sx,sy,2 });\n\tv.push_back({ gx,gy,3 });\n\tcompress(v);\n\tsort(v.begin(), v.end());\n\tlen = unique(v.begin(), v.end()) - v.begin();\n\n\tint sid, gid;\n\trep(i, len) {\n\t\tinv[{v[i].x, v[i].y}] = i;\n\t\tif (v[i].f == 2) {\n\t\t\tsid = i;\n\t\t}\n\t\telse if (v[i].f == 3) {\n\t\t\tgid = i;\n\t\t}\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 1)continue;\n\t\tcx[x].push_back({ y,i });\n\t\tcy[y].push_back({ x,i });\n\t}\n\trep(i, len) {\n\t\tint x = v[i].x, y = v[i].y, f = v[i].f;\n\t\tif (f == 0)continue;\n\t\tux[x].push_back({ y,i });\n\t\tuy[y].push_back({ x,i });\n\n\t}\n\trep(i, mn) {\n\t\tsort(cx[i].begin(), cx[i].end());\n\t\tsort(cy[i].begin(), cy[i].end());\n\t\tsort(ux[i].begin(), ux[i].end());\n\t\tsort(uy[i].begin(), uy[i].end());\n\t}\n\n\t//dijkstra\n\trep(i, 2)rep(j, mn)d[i][j] = mod;\n\tdijkstra(0, sid); dijkstra(1, gid);\n\n\tcalc();\n\n\t//stop\n\treturn 0;\n}","accuracy":0.075,"time_ms":20,"memory_kb":37716,"score_of_the_acc":-0.0058,"final_rank":18},{"submission_id":"aoj_3036_2758395","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\n\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate<typename SEG> using SetInitialLeaf = function<void(SEG&, int)>;\ntemplate<typename SEG> using SetInitialSegment = function<void(SEG&, const int, const int)>;\ntemplate<typename RET, typename SEG> using GetSingleSegment = function<RET(SEG&, const int, const int)>;\ntemplate<typename RET> using GetMergedSegment = function<RET(RET, RET)>;\ntemplate<typename SEG, typename Q> using UpdateSingleSegment = function<void(SEG&, Q)>;\n\nstruct node { int ret; };\n\nSetInitialLeaf<node>\nset_leaf = [](node &v, const int id) {\n\tv.ret = INF;\n};\n\nSetInitialSegment<node>\nset_segment = [](node &v, const int l, const int r) {};\n\nGetSingleSegment<int, node>\nsegment_min = [](node &v, const int l, const int r) {\n\treturn v.ret;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](int l, int r) {\n\treturn l < r ? l : r;\n};\n\nUpdateSingleSegment<node, int>\nforce_update = [](node &v, int l) {\n\tv.ret = l;\n};\n\nUpdateSingleSegment<node, int>\nweak_update = [](node &v, int l) {\n\tif (v.ret > l)v.ret = l;\n};\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = node;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree {\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment, SetInitialLeaf<Node>& init_leaf, int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1);\n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv.ret = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t)\n\t\t:get_single_segment(gss),\n\t\tget_merged_segment(gms) {\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) {\n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k].ret = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update_segment(int a, int b, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, b, 0, 0, size, update_segment, value);\n\t}\n\n\ttemplate<typename Q>\n\tvoid update_element(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, a + 1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":870,"memory_kb":201264,"score_of_the_acc":-1.5,"final_rank":3},{"submission_id":"aoj_3036_2758385","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\n\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\ntemplate<typename SEG> using SetInitialLeaf = function<void(SEG&, int)>;\ntemplate<typename SEG> using SetInitialSegment = function<void(SEG&, const int, const int)>;\ntemplate<typename RET, typename SEG> using GetSingleSegment = function<RET(SEG&, const int, const int)>;\ntemplate<typename RET> using GetMergedSegment = function<RET(RET, RET)>;\ntemplate<typename SEG, typename Q> using UpdateSingleSegment = function<void(SEG&, Q)>;\n\nstruct node { int ret; };\n\nSetInitialLeaf<node>\nset_leaf = [](node &v, const int id) {\n\tv.ret = INF;\n};\n\nSetInitialSegment<node>\nset_segment = [](node &v, const int l, const int r) {};\n\nGetSingleSegment<int, node>\nsegment_min = [](node &v, const int l, const int r) {\n\treturn v.ret;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](int l, int r) {\n\treturn l < r ? l : r;\n};\n\nUpdateSingleSegment<node, int>\nforce_update = [](node &v, int l) {\n\tv.ret = l;\n};\n\nUpdateSingleSegment<node, int>\nweak_update = [](node &v, int l) {\n\tif (v.ret < l)v.ret = l;\n};\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = node;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree {\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment, SetInitialLeaf<Node>& init_leaf, int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1);\n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv.ret = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t)\n\t\t:get_single_segment(gss),\n\t\tget_merged_segment(gms) {\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) {\n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k].ret = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update_segment(int a, int b, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, b, 0, 0, size, update_segment, value);\n\t}\n\n\ttemplate<typename Q>\n\tvoid update_element(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, a + 1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":0.175,"time_ms":50,"memory_kb":155548,"score_of_the_acc":-0.7437,"final_rank":17},{"submission_id":"aoj_3036_2758325","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn l < r ? l : r;\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment ,SetInitialLeaf<Node>& init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":880,"memory_kb":201184,"score_of_the_acc":-1.5053,"final_rank":4},{"submission_id":"aoj_3036_2758322","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn min(l, r);\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment ,SetInitialLeaf<Node>& init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":850,"memory_kb":201032,"score_of_the_acc":-1.487,"final_rank":1},{"submission_id":"aoj_3036_2758321","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn min(l, r);\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":850,"memory_kb":201128,"score_of_the_acc":-1.4875,"final_rank":2},{"submission_id":"aoj_3036_2758320","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn min(l, r);\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up(); \n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1130,"memory_kb":201192,"score_of_the_acc":-1.6507,"final_rank":5},{"submission_id":"aoj_3036_2758319","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn min(l, r);\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tinit_segment(v, l, r);\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf(v, l);\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();assert(ret >= 4);\n\t\tsolve_up(); assert(ret >= 4);\n\t\tsolve_left(); assert(ret >= 4);\n\t\tsolve_right(); assert(ret >= 4);\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":0.5,"time_ms":70,"memory_kb":155684,"score_of_the_acc":-0.7562,"final_rank":7},{"submission_id":"aoj_3036_2758318","code_snippet":"#ifndef VS\n#include<bits/stdc++.h>\n#endif\n\nusing namespace std;\ntypedef long long LL;\n\n#ifdef BTK\n#define DEBUG if(1)\n#else\n#define CIN_ONLY if(1)\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\n}star;\n#define DEBUG if(0)\n#endif\n\n#define ALL(v) (v).begin(),(v).end()\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\n\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\n\nconstexpr int MAX_N = 812345;\nstruct P{\n\tint r, c;\n};\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\n\nP S, T;\nint N;\nP in[MAX_N];\nnamespace Z{\n\tint latte[MAX_N];\n\tint id;\n\tvoid init() {\n\t\tid = 0;\n\t}\n\tinline void set(int v) {\n\t\tlatte[id++] = v;\n\t}\n\tinline void build() {\n\t\tsort(latte, latte + id);\n\t\tid = unique(latte, latte + id) - latte;\n\t}\n\tinline int ItoZ(int v) {\n\t\treturn lower_bound(latte, latte + id, v) - latte;\n\t}\n\tinline int ZtoI(int v) {\n\t\treturn latte[v];\n\t}\n}\n\nbool input() {\n\tif(cin >> S >> T);\n\telse return false;\n\tcin >> N;\n\tZ::init();\n\tfor (int j : {-1, 0, 1}) {\n\t\tZ::set(S.r + j);\n\t\tZ::set(S.c + j);\n\t\tZ::set(T.r + j);\n\t\tZ::set(T.c + j);\n\t}\n\tfor (int i : range(N)) {\n\t\tcin >> in[i];\n\t\tfor (int j : {-1, 0, 1}) {\n\t\t\tZ::set(in[i].r + j);\n\t\t\tZ::set(in[i].c + j);\n\t\t}\n\t}\n\tZ::build();\n\tS.r = Z::ItoZ(S.r);\tS.c = Z::ItoZ(S.c);\n\tT.r = Z::ItoZ(T.r);\tT.c = Z::ItoZ(T.c);\n\tfor (int i : range(N)) {\n\t\tin[i].r = Z::ItoZ(in[i].r);\n\t\tin[i].c = Z::ItoZ(in[i].c);\n\t}\n#ifdef BTK\n\tcout << S.r << \" \" << S.c << endl;\n\tcout << T.r << \" \" << T.c << endl;\n\tcout << N << endl;\n\tfor (int i : range(N)) {\n\t\tcout << in[i].r << \" \" << in[i].c << endl;\n\t}\n#endif\n\treturn true;\n}\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\nconstexpr int dr[4] = { 1,0,0,-1 };\nconstexpr int dc[4] = { 0,1,-1,0 };\nconst string ds = { \"DRLU\" };\nstruct Tate {\n\tstatic constexpr int index = 0;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lr == rr ? lc < rc : lr < rr;\n\t}\n};\nstruct Yoko {\n\tstatic constexpr int index = 1;\n\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\n\t\treturn lc == rc ? lr < rr : lc < rc;\n\t}\n};\n\nnamespace pts {\n\tint pt[2][MAX_N];\n\tint cr[MAX_N];\n\ttemplate<typename dir>\n\tinline bool ice_comp(const int li, const int ri) {\n\t\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\n\t}\n\tvoid build() {\n\t\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\n\t\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\n\t\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\n\t\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\n\t}\n\ttemplate<typename dir>\n\tinline int lower_bound(int r, int c) {\n\t\tint lb = -1, ub = N;\n\t\twhile (ub - lb > 1) {\n\t\t\tconst int mid = (lb + ub) / 2;\n\t\t\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\n\t\t}\n\t\treturn ub;\n\t}\n\tinline bool isIce(int r, int c) {\n\t\tint id = lower_bound<Yoko>(r, c);\n\t\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\n\t}\n}\n\nstruct Down {\n\tstatic constexpr int index = 0;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c);\n\t\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\nstruct Right {\n\tstatic constexpr int index = 1;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c);\n\t\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Left {\n\tstatic constexpr int index = 2;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Tate>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\n\t\t\treturn pts::pt[Tate::index][id];\n\t\telse return -1;\n\t}\n};\nstruct Up {\n\tstatic constexpr int index = 3;\n\tstatic inline int getIce(int r, int c) {\n\t\tint id = pts::lower_bound<Yoko>(r, c) - 1;\n\t\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\n\t\t\treturn pts::pt[Yoko::index][id];\n\t\telse return -1;\n\t}\n};\n\t\t\ninline bool isReachable(int r,int c,int nr,int nc) {\n\tif (r == nr) {\n\t\tif (c < nc) {\n\t\t\tconst int id = Right::getIce(r, c);\n\t\t\treturn id == -1 || nc < in[id].c;\n\t\t}\n\t\telse if (nc < c) {\n\t\t\tconst int id = Left::getIce(r, c);\n\t\t\treturn id == -1 || in[id].c < nc;\n\t\t}\n\t\telse return true;\n\t}\n\telse if (c == nc) {\n\t\tif (r < nr) {\n\t\t\tconst int id = Down::getIce(r, c);\n\t\t\treturn id == -1 || nr < in[id].r;\n\t\t}\n\t\telse if (nr < r) {\n\t\t\tconst int id = Up::getIce(r, c);\n\t\t\treturn id == -1 || in[id].r < nr;\n\t\t}\n\t\telse return true;\n\t}\n\telse return false;\n}\n\n\nvector<P> g[MAX_N][4];\nvector<P> rg[MAX_N][4];\n\nint dist[MAX_N][4];\nint rdist[MAX_N][4];\ntemplate<typename dir> \ninline void addArc(const int i, const int j, const int r,const int c) {\n\tconst int id = dir::getIce(r, c);\n\tif (id != -1) {\n\t\tg[i][j].push_back(P{ id,3 - dir::index });\n\t\trg[id][3 - dir::index].push_back(P{ i,j });\n\t}\n}\nvoid buildGraph(){\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tint r = in[i].r + dr[d];\n\t\t\tint c = in[i].c + dc[d];\n\t\t\tif (pts::isIce(r, c))continue;\n\t\t\taddArc<Down>(i, d, r, c);\n\t\t\taddArc<Up>(i, d, r, c);\n\t\t\taddArc<Left>(i, d, r, c);\n\t\t\taddArc<Right>(i, d, r, c);\n\t\t}\n\t}\n}\ntemplate<typename dir>\nvoid uku(){\n\tint id = dir::getIce(S.r, S.c);\n\tif (id != -1) {\n\t\tconst int r = in[id].r + dr[3 - dir::index];\n\t\tconst int c = in[id].c + dc[3 - dir::index];\n\t\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\n\t}\n}\nconstexpr int INF = 1e7;\nqueue<P> que;\nvoid bfs() {\n\tuku<Down>();\n\tuku<Left>();\n\tuku<Right>();\n\tuku<Up>();\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 0)que.push(P{ i,d });\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tif (dist[i][d] == 1)que.push(P{ i,d });\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : g[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i : range(N)) {\n\t\tfor (int d : range(4)) {\n\t\t\tconst int r = in[i].r + dr[d];\n\t\t\tconst int c = in[i].c + dc[d];\n\t\t\tif (isReachable(r, c, T.r, T.c)) {\n\t\t\t\trdist[i][d] = 0;\n\t\t\t\tque.push(P{ i,d });\n\t\t\t}\n\t\t}\n\t}\n\twhile (!que.empty()) {\n\t\tint i = que.front().r;\n\t\tint j = que.front().c;\n\t\tque.pop();\n\t\tfor (auto &it : rg[i][j]) {\n\t\t\tint ni = it.r;\n\t\t\tint nj = it.c;\n\t\t\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\n\t\t\t\tque.push(it);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//default::min\ntemplate<typename SEG>\nusing SetInitialLeaf = function<void(SEG&, int)>;\n\ntemplate<typename SEG>\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\n\ntemplate<typename RET, typename SEG>\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\n\ntemplate<typename RET>\nusing GetMergedSegment = function<RET(RET, RET)>;\n\ntemplate<typename SEG, typename Q>\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\n\nSetInitialLeaf<int>\nset_leaf = [](int &v, const int id) {\n\tv = INF;\n};\n\nSetInitialSegment<int>\nset_segment = [](int &v, const int l, const int r) {\n\tv = INF;\n};\n\nGetSingleSegment<int,int> \nsegment_min = [](int &v, const int l, const int r) {\n\treturn v;\n};\n\nGetMergedSegment<int>\nmerge_segment = [](const int l, const int r) {\n\treturn min(l, r);\n};\n\nUpdateSingleSegment<int,int>\nforce_update = [](int &v, int l) {\n\tv = l;\n};\n\nUpdateSingleSegment<int, int>\nweak_update = [](int &v, int l) {\n\tchmin(v, l);\n};\n\n\ntemplate<typename T>\nstruct BufferManager {\n\tT *mem;\n\tint ptr;\n\tBufferManager(T* mem) {\n\t\tptr = 0;\n\t\tthis->mem = mem;\n\t}\n\tT* get(int m) {\n\t\tptr += m;\n\t\treturn mem + ptr - m;\n\t}\n\tvoid reset() {\n\t\tptr = 0;\n\t}\n};\n\nnamespace NodeBuffer {\n\tconstexpr int BufferSize = 812345;\n\tusing NodeType = int;\n\tNodeType mem[BufferSize];\n\tBufferManager<NodeType> buffer(mem);\n}\n\ntemplate<typename Node, typename RET>\nstruct SegmentTree{\n\tint size;\n\tNode *seg;\n\tGetSingleSegment<RET, Node> get_single_segment;\n\tGetMergedSegment<RET> get_merged_segment;\n\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\n\t\tauto &v = seg[k];\n\t\tif (r - l == 1) {\n\t\t\t//葉の時の処理\n\t\t\tinit_leaf;\n\t\t}\n\t\telse if (r - l>1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \n\t\t\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\n\t\t\tv = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m),\n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\tSegmentTree(\n\t\tint n,\n\t\tGetSingleSegment<RET, Node> gss,\n\t\tGetMergedSegment<RET> gms,\n\t\tSetInitialSegment<Node> sis,\n\t\tSetInitialLeaf<Node> sil,\n\t\tBufferManager<Node> buf = NodeBuffer::buffer\n\t\t) \n\t\t:get_single_segment(gss),\n\t\t get_merged_segment(gms){\n\t\tsize = 1; while (size<n)size *= 2;\n\t\tseg = buf.get(size + 10);\n\t\tinit(0, size, sis, sil);\n\t}\n#define LQ a,b,k*2+1,l,m\n#define RQ a,b,k*2+2,m,r\n\tRET get(int a, int b, int k, int l, int r) {\n\t\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\n\t\tint m = (l + r) / 2;\n\t\tbool ll = !(m <= a || b <= l);\n\t\tbool rr = !(r <= a || b <= m);\n\t\tRET ret;\n\t\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\n\t\telse if (ll)ret = get(LQ); else ret = get(RQ);\n\t\treturn ret;\n\t}\n\tRET get(int a, int b) { \n\t\treturn get(a, b, 0, 0, size);\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\n\t\tif (r <= a || b <= l)return;\n\t\tif (a <= l && r <= b) {\n\t\t\tupdate_segment(seg[k], value);\n\t\t}\n\t\telse {\n\t\t\tint m = (l + r) / 2;\n\t\t\tupdate(LQ, update_segment, value);\n\t\t\tupdate(RQ, update_segment, value);\n\t\t\tseg[k] = get_merged_segment(\n\t\t\t\tget_single_segment(seg[k * 2 + 1], l, m), \n\t\t\t\tget_single_segment(seg[k * 2 + 2], m, r)\n\t\t\t);\n\t\t}\n\t}\n\ttemplate<typename Q>\n\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\n\t\tupdate(a, a+1, 0, 0, size, update_segment, value);\n\t}\n};\n\nint ret = INF;\nvoid solve_down() {\n\tconstexpr int dir = Down::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\n\t\tfor (int i : range(lb, ub-1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_right() {\n\tconstexpr int dir = Right::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = 0; lb < N;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub < N&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub++;\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\n\t\tfor (int i : range(lb, ub - 1)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(lb, ub)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_up() {\n\tconstexpr int dir = Up::index;\n\tconstexpr int s = Left::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Tate::index];\n\t\twhile (ub >=0 &&\n\t\t\tin[pt[lb]].r == in[pt[ub]].r) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\n\nvoid solve_left() {\n\tconstexpr int dir = Left::index;\n\tconstexpr int s = Up::index;\n\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\n\tauto query = [&](int l, int r) {\n\t\tif (r - l >= 1)return rmq.get(l, r);\n\t\telse return INF;\n\t};\n\tfor (int lb = N-1; lb >= 0;) {\n\t\tint ub = lb;\n\t\tint* pt = pts::pt[Yoko::index];\n\t\twhile (ub >=0&&\n\t\t\tin[pt[lb]].c == in[pt[ub]].c) {\n\t\t\tub--;\n\t\t}\n\t\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\n\t\tfor (int i : range(ub+1, lb)) {\n\t\t\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\n\t\t\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\n\t\t\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\n\t\t}\n\t\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\n\t\tfor (int i : range(ub+1, lb+1)) {\n\t\t\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\n\t\t\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\n\t\t\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\n\t\t}\n\t\tlb = ub;\n\t}\n\tNodeBuffer::buffer.reset();\n}\ninline bool isReachableWithHop(int r,int c) {\n\treturn (isReachable(r, c, r, T.c) &&\n\t\tisReachable(r, T.c, T.r, T.c)) ||\n\t\t(isReachable(r, c, T.r, c) &&\n\t\t\tisReachable(T.r, c, T.r, T.c));\n}\n\nint main() {\n\twhile (input()) {\n\t\tpts::build();\n\t\tif (isReachableWithHop(S.r, S.c)) {\n\t\t\tcout << 0 << endl; continue;\n\t\t}\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tg[i][j].clear();\n\t\t\t\trg[i][j].clear();\n\t\t\t\tdist[i][j] = INF;\n\t\t\t\trdist[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tbuildGraph();\n\t\tbfs();\n\t\t\n\t\tfor (int i : range(N)) {\n\t\t\tfor (int j : range(4)) {\n\t\t\t\tconst int r = in[i].r + dr[j];\n\t\t\t\tconst int c = in[i].c + dc[j];\n\t\t\t\tif (isReachableWithHop(r, c)) {\n\t\t\t\t\tchmin(ret, dist[i][j]);\n\t\t\t\t\tisReachableWithHop(r, c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (int i : range(N)) {\n\t\t\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\n\t\t\t\tconst int r = S.r;\n\t\t\t\tconst int c = in[i].c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\n\t\t\t\tconst int r = in[i].r;\n\t\t\t\tconst int c = S.c;\n\t\t\t\tif (Down::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Down::index] + 1);\n\t\t\t\tif (Left::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Left::index] + 1);\n\t\t\t\tif (Right::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Right::index] + 1);\n\t\t\t\tif (Up::getIce(r, c) == i)\n\t\t\t\t\tchmin(ret, rdist[i][3 - Up::index] + 1);\n\t\t\t}\n\t\t}\n\t\tsolve_down();\n\t\tsolve_up();\n\t\tsolve_left();\n\t\tsolve_right();\n\t\tif (ret == INF)cout << -1 << endl;\n\t\telse cout << ret << endl;\n\t}\n\treturn 0;\n}","accuracy":0.025,"time_ms":50,"memory_kb":155560,"score_of_the_acc":-0.7438,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_3036_5734075\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> PP;\\nint dx[4]={0,-1,0,1},dy[4]={-1,0,1,0},INF=1e9+7;\\nint d[111111][4],d2[111111][4];\\nmap<int,vector<PP> > m[2],m2[2];\\nP a[111111];\\nset<int> se[2];\\nmap<int,int> ma[2];\\nmap<int,vector<P> > mm[2];\\n\\nclass RMQ{\\npublic:\\n int n,dat[1111111];\\n void init(int _n){\\n n=1;while(n<_n)n*=2;\\n fill(dat,dat+2*n-1,INF);\\n }\\n void update(int k,int a){\\n k+=n-1;dat[k]=a;\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n int query(int a,int b){return query(a,b,0,0,n);}\\n int query(int a,int b,int k,int l,int r){\\n if(r<=a||b<=l) return INF;\\n if(a<=l&&r<=b) return dat[k];\\n int vl=query(a,b,k*2+1,l,(l+r)/2);\\n int vr=query(a,b,k*2+2,(l+r)/2,r);\\n return min(vl,vr);\\n }\\n};\\n\\nRMQ r;\\nint main() {\\n int n,sx,sy,tx,ty;\\n cin >> sx >> sy >> tx >> ty >> n;\\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\\n a[n]=P(sx,sy);\\n a[n+1]=P(tx,ty);\\n rep(i,n+2) {\\n if(i==n) continue;\\n m[0][a[i].F].push_back(PP(a[i].S,P(i,0)));\\n m[0][a[i].F].push_back(PP(a[i].S,P(i,2)));\\n m[1][a[i].S].push_back(PP(a[i].F,P(i,1)));\\n m[1][a[i].S].push_back(PP(a[i].F,P(i,3)));\\n }\\n rep(i,2) {\\n for(map<int,vector<PP> >::iterator it=m[i].begin();it!=m[i].end();it++) {\\n sort(it->S.begin(),it->S.end());\\n }\\n }\\n rep(i,111111)rep(j,4)d[i][j]=INF;\\n queue<P> que;\\n rep(i,4) {\\n que.push(P(n,i));\\n d[n][i]=0;\\n }\\n while(!que.empty()) {\\n P p=que.front();que.pop();\\n int x=a[p.F].F,y=a[p.F].S,t=p.S;\\n if(p.F!=n) x+=dx[t],y+=dy[t];\\n if(t%2) {\\n if(!m[0].count(x)) continue;\\n int k=upper_bound(m[0][x].begin(),m[0][x].end(),PP(y,P(-INF,-INF)))-m[0][x].begin();\\n if(k!=m[0][x].size()) {\\n PP q=m[0][x][k];\\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\\n d[q.S.F][q.S.S]=d[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n }\\n k--;\\n if(k>=0) {\\n PP q=m[0][x][k];\\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\\n d[q.S.F][q.S.S]=d[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n }\\n } else {\\n if(!m[1].count(y)) continue;\\n int k=upper_bound(m[1][y].begin(),m[1][y].end(),PP(x,P(-INF,-INF)))-m[1][y].begin();\\n if(k!=m[1][y].size()) {\\n PP q=m[1][y][k];\\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\\n d[q.S.F][q.S.S]=d[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n }\\n k--;\\n if(k>=0) {\\n PP q=m[1][y][k];\\n if(d[q.S.F][q.S.S]>d[p.F][t]+1) {\\n d[q.S.F][q.S.S]=d[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n }\\n }\\n }\\n rep(i,n+2) {\\n if(i<n) {\\n m2[0][a[i].F-1].push_back(PP(a[i].S,P(i,1)));\\n m2[0][a[i].F+1].push_back(PP(a[i].S,P(i,3)));\\n m2[1][a[i].S-1].push_back(PP(a[i].F,P(i,0)));\\n m2[1][a[i].S+1].push_back(PP(a[i].F,P(i,2)));\\n m2[0][a[i].F].push_back(PP(a[i].S-1,P(INF,-1)));\\n m2[0][a[i].F].push_back(PP(a[i].S+1,P(-INF,-1)));\\n m2[1][a[i].S].push_back(PP(a[i].F-1,P(INF,-1)));\\n m2[1][a[i].S].push_back(PP(a[i].F+1,P(-INF,-1)));\\n } else {\\n m2[0][a[i].F].push_back(PP(a[i].S,P(i,1)));\\n m2[0][a[i].F].push_back(PP(a[i].S,P(i,3)));\\n m2[1][a[i].S].push_back(PP(a[i].F,P(i,0)));\\n m2[1][a[i].S].push_back(PP(a[i].F,P(i,2)));\\n }\\n }\\n rep(i,2) {\\n for(map<int,vector<PP> >::iterator it=m2[i].begin();it!=m2[i].end();it++) {\\n sort(it->S.begin(),it->S.end());\\n }\\n }\\n rep(i,111111)rep(j,4)d2[i][j]=INF;\\n rep(i,4) {\\n que.push(P(n+1,i));\\n d2[n+1][i]=0;\\n }\\n while(!que.empty()) {\\n P p=que.front();que.pop();\\n int x=a[p.F].F,y=a[p.F].S,t=p.S;\\n x+=dx[t],y+=dy[t];\\n if(t==0) {\\n int k=lower_bound(m2[0][x].begin(),m2[0][x].end(),PP(y,P(INF,-1)))-m2[0][x].begin()-1;\\n while(k>=0&&m2[0][x][k].S.S!=-1) {\\n PP q=m2[0][x][k];\\n if(a[q.S.F].S<=y&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n k--;\\n }\\n } else if(t==1) {\\n int k=lower_bound(m2[1][y].begin(),m2[1][y].end(),PP(x,P(INF,-1)))-m2[1][y].begin()-1;\\n while(k>=0&&m2[1][y][k].S.S!=-1) {\\n PP q=m2[1][y][k];\\n if(a[q.S.F].F<=x&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n k--;\\n }\\n } else if(t==2) {\\n int k=upper_bound(m2[0][x].begin(),m2[0][x].end(),PP(y,P(-INF,-1)))-m2[0][x].begin();\\n while(k<m2[0][x].size()&&m2[0][x][k].S.S!=-1) {\\n PP q=m2[0][x][k];\\n if(y<=a[q.S.F].S&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n k++;\\n }\\n } else {\\n int k=upper_bound(m2[1][y].begin(),m2[1][y].end(),PP(x,P(-INF,-1)))-m2[1][y].begin();\\n while(k<m2[1][y].size()&&m2[1][y][k].S.S!=-1) {\\n PP q=m2[1][y][k];\\n if(x<=a[q.S.F].F&&d2[q.S.F][q.S.S]>d2[p.F][t]+1) {\\n d2[q.S.F][q.S.S]=d2[p.F][t]+1;\\n que.push(P(q.S.F,q.S.S));\\n }\\n k++;\\n }\\n }\\n }\\n int ans=INF;\\n rep(i,4) ans=min(ans,d[n+1][i]);\\n if(ans!=INF) ans--;\\n rep(i,n+2) {\\n rep(j,3) {\\n se[0].insert(a[i].F-1+j);\\n se[1].insert(a[i].S-1+j);\\n }\\n }\\n se[0].insert(-INF);\\n se[0].insert(INF);\\n se[1].insert(-INF);\\n se[1].insert(INF);\\n rep(i,2) {\\n int k=0;\\n for(set<int>::iterator it=se[i].begin();it!=se[i].end();it++) ma[i][*it]=k++;\\n }\\n rep(t,2) {\\n rep(i,2) mm[i].clear();\\n if(t) {\\n rep(i,n+2) {\\n if(i<n) {\\n mm[0][a[i].F].push_back(P(a[i].S-1,d[i][0]));\\n mm[0][a[i].F].push_back(P(a[i].S+1,d[i][2]));\\n mm[0][a[i].F].push_back(P(a[i].S,-1));\\n } else {\\n mm[0][a[i].F].push_back(P(a[i].S,d[i][0]));\\n mm[0][a[i].F].push_back(P(a[i].S,d[i][2]));\\n }\\n mm[1][a[i].F].push_back(P(a[i].S,i));\\n }\\n } else {\\n rep(i,n+2) {\\n if(i<n) {\\n mm[0][a[i].S].push_back(P(a[i].F-1,d[i][1]));\\n mm[0][a[i].S].push_back(P(a[i].F+1,d[i][3]));\\n mm[0][a[i].S].push_back(P(a[i].F,-1));\\n } else {\\n mm[0][a[i].S].push_back(P(a[i].F,d[i][1]));\\n mm[0][a[i].S].push_back(P(a[i].F,d[i][3]));\\n }\\n mm[1][a[i].S].push_back(P(a[i].F,i));\\n }\\n }\\n for(map<int,vector<P> >::iterator it=mm[1].begin();it!=mm[1].end();it++) {\\n if(it->S.size()) {\\n it->S.push_back(P(-INF,INF));\\n it->S.push_back(P(INF,INF));\\n sort(it->S.begin(),it->S.end());\\n }\\n }\\n rep(k,2) {\\n map<int,vector<P> >::iterator it2=mm[1].begin();\\n r.init(se[t].size());\\n for(map<int,vector<P> >::iterator it=mm[0].begin();;it++) {\\n while(it2!=mm[1].end()&&(it==mm[0].end()||it2->F<it->F)) {\\n vector<P> v=it2->S;\\n rep(i,v.size()-1) {\\n int x,y;\\n if(t) {\\n if(v[i].S==INF) x=INF;\\n else x=d2[v[i].S][2];\\n if(v[i+1].S==INF) y=INF;\\n else y=d2[v[i+1].S][0];\\n } else {\\n if(v[i].S==INF) x=INF;\\n else x=d2[v[i].S][3];\\n if(v[i+1].S==INF) y=INF;\\n else y=d2[v[i+1].S][1];\\n }\\n ans=min(ans,r.query(ma[t][v[i].F],ma[t][v[i+1].F])+min(x,y));\\n }\\n it2++;\\n }\\n if(it==mm[0].end()) break;\\n vector<P> v=it->S;\\n rep(i,v.size()) {\\n int x=ma[t][v[i].F];\\n r.update(x,v[i].S==-1?INF:min(r.query(x,x+1),v[i].S));\\n }\\n }\\n map<int,vector<P> > mm2[2];\\n rep(i,2)for(map<int,vector<P> >::iterator it=mm[i].begin();it!=mm[i].end();it++) mm2[i][-it->F]=it->S;\\n rep(i,2)mm[i]=mm2[i];\\n }\\n }\\n cout << (ans==INF?-1:ans) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1730,\n \"memory_kb\": 150716,\n \"score_of_the_acc\": -1.6909,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3036_3408005\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvector<int> G[mn];\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t\\tG[ni].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint sid;\\nvoid invdijkstra(int root) {\\n\\td[1][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second;\\n\\t\\trep(j, G[i].size()) {\\n\\t\\t\\tint to = G[i][j];\\n\\t\\t\\tif (to == sid)d[1][sid] = min(d[1][sid], p.first);\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (p.first + 1 < d[1][to]) {\\n\\t\\t\\t\\t\\td[1][to] = p.first + 1;\\n\\t\\t\\t\\t\\tq.push({ d[1][to],to });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans >= mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\n\\t}\\n\\trep(i, len) {\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); invdijkstra(gid);\\n\\tans = d[0][gid];\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 30,\n \"memory_kb\": 69760,\n \"score_of_the_acc\": -0.2076,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3036_3407891\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans >= mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\n\\t}\\n\\trep(i, len) {\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\tans = d[0][gid];\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 30,\n \"memory_kb\": 58044,\n \"score_of_the_acc\": -0.1359,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3036_3407883\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\n\\t}\\n\\trep(i, len) {\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\tans = d[0][gid];\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 30,\n \"memory_kb\": 58028,\n \"score_of_the_acc\": -0.1358,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3036_3407878\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\tans = d[0][gid];\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 30,\n \"memory_kb\": 58044,\n \"score_of_the_acc\": -0.1359,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3036_3407876\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\tans = d[sid][gid];\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.05,\n \"time_ms\": 30,\n \"memory_kb\": 58032,\n \"score_of_the_acc\": -0.1358,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3036_3407850\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 500005;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue; \\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 30,\n \"memory_kb\": 58044,\n \"score_of_the_acc\": -0.1359,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3036_3407848\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 300003;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cx[i][j].first, d[1][id]+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue; \\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tif (v[id].f == 3) {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tst.update(cy[i][j].first, d[1][id] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 20,\n \"memory_kb\": 37744,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3036_3407842\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 300003;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tif (v[id].f == 2)continue;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 10,\n \"memory_kb\": 37728,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3036_3407833\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 300003;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 20,\n \"memory_kb\": 37736,\n \"score_of_the_acc\": -0.0059,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3036_3407823\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 300003;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0&&loc<cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0&&loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cx[x].size()) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0 && loc<cy[y].size()) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = uy[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 20,\n \"memory_kb\": 37728,\n \"score_of_the_acc\": -0.0059,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3036_3407808\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\n\\nint n;\\nint sx, sy, gx, gy;\\n\\nstruct vertice {\\n\\tint x, y, f;\\n\\tbool operator<(const vertice &v)const {\\n\\t\\tif (x != v.x)return x < v.x;\\n\\t\\tif (y != v.y)return y < v.y;\\n\\t\\treturn f < v.f;\\n\\t}\\n\\tbool operator==(const vertice &v)const {\\n\\t\\tif (x == v.x&&y == v.y&&f == v.f)return true;\\n\\t\\treturn false;\\n\\t}\\n};\\n\\nvoid compress(vector<vertice> &v) {\\n\\tint n = v.size();\\n\\tvector<LP> x, y;\\n\\trep(i, n) {\\n\\t\\tx.push_back({ v[i].x,i });\\n\\t\\ty.push_back({ v[i].y,i });\\n\\t}\\n\\tsort(x.begin(), x.end());\\n\\tsort(y.begin(), y.end());\\n\\tint cur = 0;\\n\\trep(i, n) {\\n\\t\\tv[x[i].second].x = cur;\\n\\t\\twhile (i + 1 < n&&x[i].first == x[i + 1].first) {\\n\\t\\t\\ti++; v[x[i].second].x = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n\\tcur = 0;\\n\\trep(i, n) {\\n\\t\\tv[y[i].second].y = cur;\\n\\t\\twhile (i + 1 < n&&y[i].first == y[i + 1].first) {\\n\\t\\t\\ti++; v[y[i].second].y = cur;\\n\\t\\t}\\n\\t\\tcur++;\\n\\t}\\n}\\n\\nvector<vertice> v; map<P, int> inv;\\n\\nconst int mn = 300003;\\nvector<P> cx[mn], cy[mn];\\n\\nint d[2][mn];\\npriority_queue<P, vector<P>, greater<P>> q;\\nvoid dijkstra(int id, int root) {\\n\\td[id][root] = 0;\\n\\tq.push({ 0,root });\\n\\twhile (!q.empty()) {\\n\\t\\tP p = q.top(); q.pop();\\n\\t\\tint i = p.second; int dist = p.first;\\n\\t\\tint x = v[i].x, y = v[i].y;\\n\\t\\t//x軸\\n\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first + 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\tint ni = cx[x][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{x, cx[x][loc].first - 1}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//y軸\\n\\t\\tloc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\tloc--;\\n\\t\\tif (loc >= 0) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first + 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tloc++;\\n\\t\\tif (v[i].f >= 2)loc++;\\n\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\tint ni = cy[y][loc].second;\\n\\t\\t\\tif (v[ni].f == 0) {\\n\\t\\t\\t\\tni = inv[{cy[y][loc].first - 1, y}];\\n\\t\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\t\\td[id][ni] = dist + 1;\\n\\t\\t\\t\\t\\tq.push({ d[id][ni],ni });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dist + 1 < d[id][ni]) {\\n\\t\\t\\t\\td[id][ni] = min(d[id][ni], dist);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint ans = mod;\\n\\nstruct SegT {\\nprivate:\\n\\tint sz; vector<int> node;\\n\\tconst int init_c = mod;\\npublic:\\n\\tSegT(int n) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n)sz *= 2;\\n\\t\\tnode.resize(2 * sz - 1, init_c);\\n\\t}\\n\\tint f(int a, int b) {\\n\\t\\treturn min(a, b);\\n\\t}\\n\\tvoid update(int k, int a) {\\n\\t\\tk += sz - 1;\\n\\t\\tnode[k] = a;\\n\\t\\twhile (k > 0) {\\n\\t\\t\\tk = (k - 1) / 2;\\n\\t\\t\\tnode[k] = f(node[k * 2 + 1], node[k * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tint query(int a, int b, int k = 0, int l = 0, int r = -1) {\\n\\t\\tif (r < 0)r = sz;\\n\\t\\tif (r <= a || b <= l)return init_c;\\n\\t\\telse if (a <= l && r <= b)return node[k];\\n\\t\\telse {\\n\\t\\t\\tint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n\\t\\t\\tint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n\\t\\t\\treturn f(vl, vr);\\n\\t\\t}\\n\\t}\\n};\\nint len;\\n\\n//全頂点が入ってるほう\\nvector<P> ux[mn], uy[mn];\\n//下から\\nvoid calc1() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\n//上から\\nvoid calc2() {\\n\\tSegT st(mn);\\n\\tper(i, mn) {\\n\\t\\trep(j, ux[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = i, y = ux[i][j].first;\\n\\t\\t\\tint loc = lower_bound(cx[x].begin(), cx[x].end(), P{ y,-1 }) - cx[x].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0) {\\n\\t\\t\\t\\tle = cx[x][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cx[x].size()) {\\n\\t\\t\\t\\tri = cx[x][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][ux[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cx[i].size()) {\\n\\t\\t\\tint id = cx[i][j].second;\\n\\t\\t\\tst.update(cx[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc3() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc4() {\\n\\tSegT st(mn);\\n\\trep(i, mn) {\\n\\t\\trep(j, uy[i].size()) {\\n\\t\\t\\tint le = 0, ri = mn;\\n\\t\\t\\tint x = uy[i][j].first, y = i;\\n\\t\\t\\tint loc = lower_bound(cy[y].begin(), cy[y].end(), P{ x,-1 }) - cy[y].begin();\\n\\t\\t\\tloc--;\\n\\t\\t\\tif (loc >= 0) {\\n\\t\\t\\t\\tle = cy[y][loc].first + 1;\\n\\t\\t\\t}\\n\\t\\t\\tloc++;\\n\\t\\t\\tint nowi = ux[i][j].second;\\n\\t\\t\\tif (v[nowi].f >= 2)loc++;\\n\\t\\t\\tif (loc < cy[y].size()) {\\n\\t\\t\\t\\tri = cy[y][loc].first;\\n\\t\\t\\t}\\n\\t\\t\\tint z = st.query(le, ri);\\n\\t\\t\\tans = min(ans, z + d[0][uy[i][j].second]);\\n\\t\\t}\\n\\t\\trep(j, cy[i].size()) {\\n\\t\\t\\tint id = cy[i][j].second;\\n\\t\\t\\tst.update(cy[i][j].first, d[1][id]);\\n\\t\\t}\\n\\t}\\n}\\nvoid calc() {\\n\\tcalc1(); calc2(); calc3(); calc4();\\n\\tif (ans == mod)cout << -1 << endl;\\n\\telse cout << ans << endl;\\n\\treturn;\\n}\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy;\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tv.push_back({ x,y,0 });\\n\\t\\tv.push_back({ x + 1,y,1 });\\n\\t\\tv.push_back({ x - 1,y,1 });\\n\\t\\tv.push_back({ x,y + 1,1 });\\n\\t\\tv.push_back({ x,y - 1,1 });\\n\\t}\\n\\tv.push_back({ sx,sy,2 });\\n\\tv.push_back({ gx,gy,3 });\\n\\tcompress(v);\\n\\tsort(v.begin(), v.end());\\n\\tlen = unique(v.begin(), v.end()) - v.begin();\\n\\n\\tint sid, gid;\\n\\trep(i, len) {\\n\\t\\tinv[{v[i].x, v[i].y}] = i;\\n\\t\\tif (v[i].f == 2) {\\n\\t\\t\\tsid = i;\\n\\t\\t}\\n\\t\\telse if (v[i].f == 3) {\\n\\t\\t\\tgid = i;\\n\\t\\t}\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 1)continue;\\n\\t\\tcx[x].push_back({ y,i });\\n\\t\\tcy[y].push_back({ x,i });\\n\\t}\\n\\trep(i, len) {\\n\\t\\tint x = v[i].x, y = v[i].y, f = v[i].f;\\n\\t\\tif (f == 0)continue;\\n\\t\\tux[x].push_back({ y,i });\\n\\t\\tuy[y].push_back({ x,i });\\n\\n\\t}\\n\\trep(i, mn) {\\n\\t\\tsort(cx[i].begin(), cx[i].end());\\n\\t\\tsort(cy[i].begin(), cy[i].end());\\n\\t\\tsort(ux[i].begin(), ux[i].end());\\n\\t\\tsort(uy[i].begin(), uy[i].end());\\n\\t}\\n\\n\\t//dijkstra\\n\\trep(i, 2)rep(j, mn)d[i][j] = mod;\\n\\tdijkstra(0, sid); dijkstra(1, gid);\\n\\n\\tcalc();\\n\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.075,\n \"time_ms\": 20,\n \"memory_kb\": 37716,\n \"score_of_the_acc\": -0.0058,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3036_2758395\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\n\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\ntemplate<typename SEG> using SetInitialLeaf = function<void(SEG&, int)>;\\ntemplate<typename SEG> using SetInitialSegment = function<void(SEG&, const int, const int)>;\\ntemplate<typename RET, typename SEG> using GetSingleSegment = function<RET(SEG&, const int, const int)>;\\ntemplate<typename RET> using GetMergedSegment = function<RET(RET, RET)>;\\ntemplate<typename SEG, typename Q> using UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nstruct node { int ret; };\\n\\nSetInitialLeaf<node>\\nset_leaf = [](node &v, const int id) {\\n\\tv.ret = INF;\\n};\\n\\nSetInitialSegment<node>\\nset_segment = [](node &v, const int l, const int r) {};\\n\\nGetSingleSegment<int, node>\\nsegment_min = [](node &v, const int l, const int r) {\\n\\treturn v.ret;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](int l, int r) {\\n\\treturn l < r ? l : r;\\n};\\n\\nUpdateSingleSegment<node, int>\\nforce_update = [](node &v, int l) {\\n\\tv.ret = l;\\n};\\n\\nUpdateSingleSegment<node, int>\\nweak_update = [](node &v, int l) {\\n\\tif (v.ret > l)v.ret = l;\\n};\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = node;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree {\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment, SetInitialLeaf<Node>& init_leaf, int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1);\\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv.ret = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t)\\n\\t\\t:get_single_segment(gss),\\n\\t\\tget_merged_segment(gms) {\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) {\\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k].ret = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update_segment(int a, int b, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, b, 0, 0, size, update_segment, value);\\n\\t}\\n\\n\\ttemplate<typename Q>\\n\\tvoid update_element(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, a + 1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 201264,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3036_2758385\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\n\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\ntemplate<typename SEG> using SetInitialLeaf = function<void(SEG&, int)>;\\ntemplate<typename SEG> using SetInitialSegment = function<void(SEG&, const int, const int)>;\\ntemplate<typename RET, typename SEG> using GetSingleSegment = function<RET(SEG&, const int, const int)>;\\ntemplate<typename RET> using GetMergedSegment = function<RET(RET, RET)>;\\ntemplate<typename SEG, typename Q> using UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nstruct node { int ret; };\\n\\nSetInitialLeaf<node>\\nset_leaf = [](node &v, const int id) {\\n\\tv.ret = INF;\\n};\\n\\nSetInitialSegment<node>\\nset_segment = [](node &v, const int l, const int r) {};\\n\\nGetSingleSegment<int, node>\\nsegment_min = [](node &v, const int l, const int r) {\\n\\treturn v.ret;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](int l, int r) {\\n\\treturn l < r ? l : r;\\n};\\n\\nUpdateSingleSegment<node, int>\\nforce_update = [](node &v, int l) {\\n\\tv.ret = l;\\n};\\n\\nUpdateSingleSegment<node, int>\\nweak_update = [](node &v, int l) {\\n\\tif (v.ret < l)v.ret = l;\\n};\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = node;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree {\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment, SetInitialLeaf<Node>& init_leaf, int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1);\\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv.ret = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t)\\n\\t\\t:get_single_segment(gss),\\n\\t\\tget_merged_segment(gms) {\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) {\\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k].ret = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update_segment(int a, int b, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, b, 0, 0, size, update_segment, value);\\n\\t}\\n\\n\\ttemplate<typename Q>\\n\\tvoid update_element(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, a + 1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<node, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update_element(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update_element(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 50,\n \"memory_kb\": 155548,\n \"score_of_the_acc\": -0.7437,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3036_2758325\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn l < r ? l : r;\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment ,SetInitialLeaf<Node>& init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 201184,\n \"score_of_the_acc\": -1.5053,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3036_2758322\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn min(l, r);\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node>& init_segment ,SetInitialLeaf<Node>& init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 201032,\n \"score_of_the_acc\": -1.487,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3036_2758321\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn min(l, r);\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> &update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> &update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 201128,\n \"score_of_the_acc\": -1.4875,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3036_2758320\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn min(l, r);\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up(); \\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1130,\n \"memory_kb\": 201192,\n \"score_of_the_acc\": -1.6507,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3036_2758319\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn min(l, r);\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tinit_segment(v, l, r);\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf(v, l);\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();assert(ret >= 4);\\n\\t\\tsolve_up(); assert(ret >= 4);\\n\\t\\tsolve_left(); assert(ret >= 4);\\n\\t\\tsolve_right(); assert(ret >= 4);\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 70,\n \"memory_kb\": 155684,\n \"score_of_the_acc\": -0.7562,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3036_2758318\",\n \"code_snippet\": \"#ifndef VS\\n#include<bits/stdc++.h>\\n#endif\\n\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef BTK\\n#define DEBUG if(1)\\n#else\\n#define CIN_ONLY if(1)\\nstruct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}\\n}star;\\n#define DEBUG if(0)\\n#endif\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REC(ret, ...) std::function<ret (__VA_ARGS__)>\\ntemplate <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}\\ntemplate <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}\\ntemplate <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}\\n\\nclass range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};\\n\\nconstexpr int MAX_N = 812345;\\nstruct P{\\n\\tint r, c;\\n};\\nistream& operator>>(istream &is, P &v) { is >> v.r >> v.c; return is; }\\n\\nP S, T;\\nint N;\\nP in[MAX_N];\\nnamespace Z{\\n\\tint latte[MAX_N];\\n\\tint id;\\n\\tvoid init() {\\n\\t\\tid = 0;\\n\\t}\\n\\tinline void set(int v) {\\n\\t\\tlatte[id++] = v;\\n\\t}\\n\\tinline void build() {\\n\\t\\tsort(latte, latte + id);\\n\\t\\tid = unique(latte, latte + id) - latte;\\n\\t}\\n\\tinline int ItoZ(int v) {\\n\\t\\treturn lower_bound(latte, latte + id, v) - latte;\\n\\t}\\n\\tinline int ZtoI(int v) {\\n\\t\\treturn latte[v];\\n\\t}\\n}\\n\\nbool input() {\\n\\tif(cin >> S >> T);\\n\\telse return false;\\n\\tcin >> N;\\n\\tZ::init();\\n\\tfor (int j : {-1, 0, 1}) {\\n\\t\\tZ::set(S.r + j);\\n\\t\\tZ::set(S.c + j);\\n\\t\\tZ::set(T.r + j);\\n\\t\\tZ::set(T.c + j);\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tcin >> in[i];\\n\\t\\tfor (int j : {-1, 0, 1}) {\\n\\t\\t\\tZ::set(in[i].r + j);\\n\\t\\t\\tZ::set(in[i].c + j);\\n\\t\\t}\\n\\t}\\n\\tZ::build();\\n\\tS.r = Z::ItoZ(S.r);\\tS.c = Z::ItoZ(S.c);\\n\\tT.r = Z::ItoZ(T.r);\\tT.c = Z::ItoZ(T.c);\\n\\tfor (int i : range(N)) {\\n\\t\\tin[i].r = Z::ItoZ(in[i].r);\\n\\t\\tin[i].c = Z::ItoZ(in[i].c);\\n\\t}\\n#ifdef BTK\\n\\tcout << S.r << \\\" \\\" << S.c << endl;\\n\\tcout << T.r << \\\" \\\" << T.c << endl;\\n\\tcout << N << endl;\\n\\tfor (int i : range(N)) {\\n\\t\\tcout << in[i].r << \\\" \\\" << in[i].c << endl;\\n\\t}\\n#endif\\n\\treturn true;\\n}\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\nconstexpr int dr[4] = { 1,0,0,-1 };\\nconstexpr int dc[4] = { 0,1,-1,0 };\\nconst string ds = { \\\"DRLU\\\" };\\nstruct Tate {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lr == rr ? lc < rc : lr < rr;\\n\\t}\\n};\\nstruct Yoko {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline bool comp(const int lr, const int lc, const int rr, const int rc) {\\n\\t\\treturn lc == rc ? lr < rr : lc < rc;\\n\\t}\\n};\\n\\nnamespace pts {\\n\\tint pt[2][MAX_N];\\n\\tint cr[MAX_N];\\n\\ttemplate<typename dir>\\n\\tinline bool ice_comp(const int li, const int ri) {\\n\\t\\treturn dir::comp(in[li].r, in[li].c, in[ri].r, in[ri].c);\\n\\t}\\n\\tvoid build() {\\n\\t\\tiota(pt[Yoko::index], pt[Yoko::index] + N, 0);\\n\\t\\tiota(pt[Tate::index], pt[Tate::index] + N, 0);\\n\\t\\tsort(pt[Yoko::index], pt[Yoko::index] + N, ice_comp<Yoko>);\\n\\t\\tsort(pt[Tate::index], pt[Tate::index] + N, ice_comp<Tate>);\\n\\t}\\n\\ttemplate<typename dir>\\n\\tinline int lower_bound(int r, int c) {\\n\\t\\tint lb = -1, ub = N;\\n\\t\\twhile (ub - lb > 1) {\\n\\t\\t\\tconst int mid = (lb + ub) / 2;\\n\\t\\t\\t(!dir::comp(r, c, in[pt[dir::index][mid]].r, in[pt[dir::index][mid]].c) ? lb : ub) = mid;\\n\\t\\t}\\n\\t\\treturn ub;\\n\\t}\\n\\tinline bool isIce(int r, int c) {\\n\\t\\tint id = lower_bound<Yoko>(r, c);\\n\\t\\treturn id != N && in[pt[Yoko::index][id]].r == r && in[pt[Yoko::index][id]].c == c;\\n\\t}\\n}\\n\\nstruct Down {\\n\\tstatic constexpr int index = 0;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\nstruct Right {\\n\\tstatic constexpr int index = 1;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c);\\n\\t\\tif (id != N && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Left {\\n\\tstatic constexpr int index = 2;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Tate>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Tate::index][id]].r == r)\\n\\t\\t\\treturn pts::pt[Tate::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\nstruct Up {\\n\\tstatic constexpr int index = 3;\\n\\tstatic inline int getIce(int r, int c) {\\n\\t\\tint id = pts::lower_bound<Yoko>(r, c) - 1;\\n\\t\\tif (id != -1 && in[pts::pt[Yoko::index][id]].c == c)\\n\\t\\t\\treturn pts::pt[Yoko::index][id];\\n\\t\\telse return -1;\\n\\t}\\n};\\n\\t\\t\\ninline bool isReachable(int r,int c,int nr,int nc) {\\n\\tif (r == nr) {\\n\\t\\tif (c < nc) {\\n\\t\\t\\tconst int id = Right::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nc < in[id].c;\\n\\t\\t}\\n\\t\\telse if (nc < c) {\\n\\t\\t\\tconst int id = Left::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].c < nc;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse if (c == nc) {\\n\\t\\tif (r < nr) {\\n\\t\\t\\tconst int id = Down::getIce(r, c);\\n\\t\\t\\treturn id == -1 || nr < in[id].r;\\n\\t\\t}\\n\\t\\telse if (nr < r) {\\n\\t\\t\\tconst int id = Up::getIce(r, c);\\n\\t\\t\\treturn id == -1 || in[id].r < nr;\\n\\t\\t}\\n\\t\\telse return true;\\n\\t}\\n\\telse return false;\\n}\\n\\n\\nvector<P> g[MAX_N][4];\\nvector<P> rg[MAX_N][4];\\n\\nint dist[MAX_N][4];\\nint rdist[MAX_N][4];\\ntemplate<typename dir> \\ninline void addArc(const int i, const int j, const int r,const int c) {\\n\\tconst int id = dir::getIce(r, c);\\n\\tif (id != -1) {\\n\\t\\tg[i][j].push_back(P{ id,3 - dir::index });\\n\\t\\trg[id][3 - dir::index].push_back(P{ i,j });\\n\\t}\\n}\\nvoid buildGraph(){\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tint r = in[i].r + dr[d];\\n\\t\\t\\tint c = in[i].c + dc[d];\\n\\t\\t\\tif (pts::isIce(r, c))continue;\\n\\t\\t\\taddArc<Down>(i, d, r, c);\\n\\t\\t\\taddArc<Up>(i, d, r, c);\\n\\t\\t\\taddArc<Left>(i, d, r, c);\\n\\t\\t\\taddArc<Right>(i, d, r, c);\\n\\t\\t}\\n\\t}\\n}\\ntemplate<typename dir>\\nvoid uku(){\\n\\tint id = dir::getIce(S.r, S.c);\\n\\tif (id != -1) {\\n\\t\\tconst int r = in[id].r + dr[3 - dir::index];\\n\\t\\tconst int c = in[id].c + dc[3 - dir::index];\\n\\t\\tdist[id][3 - dir::index] = (S.r != r || S.c != c);\\n\\t}\\n}\\nconstexpr int INF = 1e7;\\nqueue<P> que;\\nvoid bfs() {\\n\\tuku<Down>();\\n\\tuku<Left>();\\n\\tuku<Right>();\\n\\tuku<Up>();\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 0)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tif (dist[i][d] == 1)que.push(P{ i,d });\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : g[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(dist[ni][nj], dist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i : range(N)) {\\n\\t\\tfor (int d : range(4)) {\\n\\t\\t\\tconst int r = in[i].r + dr[d];\\n\\t\\t\\tconst int c = in[i].c + dc[d];\\n\\t\\t\\tif (isReachable(r, c, T.r, T.c)) {\\n\\t\\t\\t\\trdist[i][d] = 0;\\n\\t\\t\\t\\tque.push(P{ i,d });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tint i = que.front().r;\\n\\t\\tint j = que.front().c;\\n\\t\\tque.pop();\\n\\t\\tfor (auto &it : rg[i][j]) {\\n\\t\\t\\tint ni = it.r;\\n\\t\\t\\tint nj = it.c;\\n\\t\\t\\tif (chmin(rdist[ni][nj], rdist[i][j] + 1)) {\\n\\t\\t\\t\\tque.push(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n//default::min\\ntemplate<typename SEG>\\nusing SetInitialLeaf = function<void(SEG&, int)>;\\n\\ntemplate<typename SEG>\\nusing SetInitialSegment = function<void(SEG&, const int, const int)>;\\n\\ntemplate<typename RET, typename SEG>\\nusing GetSingleSegment = function<RET(SEG&, const int, const int)>;\\n\\ntemplate<typename RET>\\nusing GetMergedSegment = function<RET(RET, RET)>;\\n\\ntemplate<typename SEG, typename Q>\\nusing UpdateSingleSegment = function<void(SEG&, Q)>;\\n\\nSetInitialLeaf<int>\\nset_leaf = [](int &v, const int id) {\\n\\tv = INF;\\n};\\n\\nSetInitialSegment<int>\\nset_segment = [](int &v, const int l, const int r) {\\n\\tv = INF;\\n};\\n\\nGetSingleSegment<int,int> \\nsegment_min = [](int &v, const int l, const int r) {\\n\\treturn v;\\n};\\n\\nGetMergedSegment<int>\\nmerge_segment = [](const int l, const int r) {\\n\\treturn min(l, r);\\n};\\n\\nUpdateSingleSegment<int,int>\\nforce_update = [](int &v, int l) {\\n\\tv = l;\\n};\\n\\nUpdateSingleSegment<int, int>\\nweak_update = [](int &v, int l) {\\n\\tchmin(v, l);\\n};\\n\\n\\ntemplate<typename T>\\nstruct BufferManager {\\n\\tT *mem;\\n\\tint ptr;\\n\\tBufferManager(T* mem) {\\n\\t\\tptr = 0;\\n\\t\\tthis->mem = mem;\\n\\t}\\n\\tT* get(int m) {\\n\\t\\tptr += m;\\n\\t\\treturn mem + ptr - m;\\n\\t}\\n\\tvoid reset() {\\n\\t\\tptr = 0;\\n\\t}\\n};\\n\\nnamespace NodeBuffer {\\n\\tconstexpr int BufferSize = 812345;\\n\\tusing NodeType = int;\\n\\tNodeType mem[BufferSize];\\n\\tBufferManager<NodeType> buffer(mem);\\n}\\n\\ntemplate<typename Node, typename RET>\\nstruct SegmentTree{\\n\\tint size;\\n\\tNode *seg;\\n\\tGetSingleSegment<RET, Node> get_single_segment;\\n\\tGetMergedSegment<RET> get_merged_segment;\\n\\tvoid init(int l, int r, SetInitialSegment<Node> init_segment ,SetInitialLeaf<Node> init_leaf ,int k = 0) {\\n\\t\\tauto &v = seg[k];\\n\\t\\tif (r - l == 1) {\\n\\t\\t\\t//葉の時の処理\\n\\t\\t\\tinit_leaf;\\n\\t\\t}\\n\\t\\telse if (r - l>1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tinit(l, m, init_segment, init_leaf, k * 2 + 1); \\n\\t\\t\\tinit(m, r, init_segment, init_leaf, k * 2 + 2);\\n\\t\\t\\tv = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m),\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\tSegmentTree(\\n\\t\\tint n,\\n\\t\\tGetSingleSegment<RET, Node> gss,\\n\\t\\tGetMergedSegment<RET> gms,\\n\\t\\tSetInitialSegment<Node> sis,\\n\\t\\tSetInitialLeaf<Node> sil,\\n\\t\\tBufferManager<Node> buf = NodeBuffer::buffer\\n\\t\\t) \\n\\t\\t:get_single_segment(gss),\\n\\t\\t get_merged_segment(gms){\\n\\t\\tsize = 1; while (size<n)size *= 2;\\n\\t\\tseg = buf.get(size + 10);\\n\\t\\tinit(0, size, sis, sil);\\n\\t}\\n#define LQ a,b,k*2+1,l,m\\n#define RQ a,b,k*2+2,m,r\\n\\tRET get(int a, int b, int k, int l, int r) {\\n\\t\\tif (a <= l && r <= b)return get_single_segment(seg[k], l, r);\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tbool ll = !(m <= a || b <= l);\\n\\t\\tbool rr = !(r <= a || b <= m);\\n\\t\\tRET ret;\\n\\t\\tif (ll&&rr)ret = get_merged_segment(get(LQ), get(RQ));\\n\\t\\telse if (ll)ret = get(LQ); else ret = get(RQ);\\n\\t\\treturn ret;\\n\\t}\\n\\tRET get(int a, int b) { \\n\\t\\treturn get(a, b, 0, 0, size);\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, int b, int k, int l, int r, UpdateSingleSegment<Node,Q> update_segment, Q value) {\\n\\t\\tif (r <= a || b <= l)return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tupdate_segment(seg[k], value);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tupdate(LQ, update_segment, value);\\n\\t\\t\\tupdate(RQ, update_segment, value);\\n\\t\\t\\tseg[k] = get_merged_segment(\\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 1], l, m), \\n\\t\\t\\t\\tget_single_segment(seg[k * 2 + 2], m, r)\\n\\t\\t\\t);\\n\\t\\t}\\n\\t}\\n\\ttemplate<typename Q>\\n\\tvoid update(int a, UpdateSingleSegment<Node, Q> update_segment, Q value) {\\n\\t\\tupdate(a, a+1, 0, 0, size, update_segment, value);\\n\\t}\\n};\\n\\nint ret = INF;\\nvoid solve_down() {\\n\\tconstexpr int dir = Down::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].c) + 1);\\n\\t\\tfor (int i : range(lb, ub-1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_right() {\\n\\tconstexpr int dir = Right::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = 0; lb < N;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub < N&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub++;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][s] + query(0, in[pt[lb]].r) + 1);\\n\\t\\tfor (int i : range(lb, ub - 1)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub - 1]][3 - s] + query(in[pt[ub - 1]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(lb, ub)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_up() {\\n\\tconstexpr int dir = Up::index;\\n\\tconstexpr int s = Left::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Tate::index];\\n\\t\\twhile (ub >=0 &&\\n\\t\\t\\tin[pt[lb]].r == in[pt[ub]].r) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].c) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].c + 1, in[pt[i + 1]].c);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].c + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].c, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].c + dc[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\n\\nvoid solve_left() {\\n\\tconstexpr int dir = Left::index;\\n\\tconstexpr int s = Up::index;\\n\\tSegmentTree<int, int> rmq(Z::id, segment_min, merge_segment, set_segment, set_leaf);\\n\\tauto query = [&](int l, int r) {\\n\\t\\tif (r - l >= 1)return rmq.get(l, r);\\n\\t\\telse return INF;\\n\\t};\\n\\tfor (int lb = N-1; lb >= 0;) {\\n\\t\\tint ub = lb;\\n\\t\\tint* pt = pts::pt[Yoko::index];\\n\\t\\twhile (ub >=0&&\\n\\t\\t\\tin[pt[lb]].c == in[pt[ub]].c) {\\n\\t\\t\\tub--;\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[ub+1]][s] + query(0, in[pt[ub+1]].r) + 1);\\n\\t\\tfor (int i : range(ub+1, lb)) {\\n\\t\\t\\tconst int seg_cost = query(in[pt[i]].r + 1, in[pt[i + 1]].r);\\n\\t\\t\\tchmin(ret, rdist[pt[i]][3 - s] + seg_cost + 1);\\n\\t\\t\\tchmin(ret, rdist[pt[i + 1]][s] + seg_cost + 1);\\n\\t\\t}\\n\\t\\tchmin(ret, rdist[pt[lb]][3 - s] + query(in[pt[lb]].r + 1, Z::id) + 1);\\n\\t\\tfor (int i : range(ub+1, lb+1)) {\\n\\t\\t\\trmq.update(in[pt[i]].r, force_update, dist[pt[i]][dir]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[s], weak_update, dist[pt[i]][s]);\\n\\t\\t\\trmq.update(in[pt[i]].r + dr[3 - s], weak_update, dist[pt[i]][3 - s]);\\n\\t\\t}\\n\\t\\tlb = ub;\\n\\t}\\n\\tNodeBuffer::buffer.reset();\\n}\\ninline bool isReachableWithHop(int r,int c) {\\n\\treturn (isReachable(r, c, r, T.c) &&\\n\\t\\tisReachable(r, T.c, T.r, T.c)) ||\\n\\t\\t(isReachable(r, c, T.r, c) &&\\n\\t\\t\\tisReachable(T.r, c, T.r, T.c));\\n}\\n\\nint main() {\\n\\twhile (input()) {\\n\\t\\tpts::build();\\n\\t\\tif (isReachableWithHop(S.r, S.c)) {\\n\\t\\t\\tcout << 0 << endl; continue;\\n\\t\\t}\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tg[i][j].clear();\\n\\t\\t\\t\\trg[i][j].clear();\\n\\t\\t\\t\\tdist[i][j] = INF;\\n\\t\\t\\t\\trdist[i][j] = INF;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildGraph();\\n\\t\\tbfs();\\n\\t\\t\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tfor (int j : range(4)) {\\n\\t\\t\\t\\tconst int r = in[i].r + dr[j];\\n\\t\\t\\t\\tconst int c = in[i].c + dc[j];\\n\\t\\t\\t\\tif (isReachableWithHop(r, c)) {\\n\\t\\t\\t\\t\\tchmin(ret, dist[i][j]);\\n\\t\\t\\t\\t\\tisReachableWithHop(r, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int i : range(N)) {\\n\\t\\t\\tif (isReachable(S.r,S.c,S.r,in[i].c)) {\\n\\t\\t\\t\\tconst int r = S.r;\\n\\t\\t\\t\\tconst int c = in[i].c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t\\tif (isReachable(S.r, S.c, in[i].r, S.c)) {\\n\\t\\t\\t\\tconst int r = in[i].r;\\n\\t\\t\\t\\tconst int c = S.c;\\n\\t\\t\\t\\tif (Down::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Down::index] + 1);\\n\\t\\t\\t\\tif (Left::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Left::index] + 1);\\n\\t\\t\\t\\tif (Right::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Right::index] + 1);\\n\\t\\t\\t\\tif (Up::getIce(r, c) == i)\\n\\t\\t\\t\\t\\tchmin(ret, rdist[i][3 - Up::index] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsolve_down();\\n\\t\\tsolve_up();\\n\\t\\tsolve_left();\\n\\t\\tsolve_right();\\n\\t\\tif (ret == INF)cout << -1 << endl;\\n\\t\\telse cout << ret << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.025,\n \"time_ms\": 50,\n \"memory_kb\": 155560,\n \"score_of_the_acc\": -0.7438,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1882,"cells":{"group_id":{"kind":"string","value":"aoj_3037_cpp"},"problem_description":{"kind":"string","value":"Problem L: Tree Fragments\nProblem\nあいちゃんは、$N$個の頂点と$N-1$本の辺からなる木$T$を持っている。各頂点には$1$から$N$までの番号と、正の整数の重みがついている。\n次の$Q$回のクエリに順に答えよ。\n$1 \\le a_i,b_i \\le N$($a_i \\ne b_i$)が与えられるので、$T$の$a_i$-$b_i$パス上の頂点とそれに接続する辺を取り除いてできる、いくつかの連結成分の中で、重みが最大となる連結成分の重みを出力する。そのような連結成分が1つもない場合、0と出力する。\nただし、連結成分の重みはその連結成分に含まれる頂点の重みの和で定義される。\nInput\n入力は以下の形式で与えられる。\n$N$\n$w_1$ $w_2$ ... $w_N$\n$u_1$ $v_1$\n$u_2$ $v_2$\n...\n$u_{N-1}$ $v_{N-1}$\n$Q$\n$a_1$ $b_1$\n$a_2$ $b_2$\n...\n$a_Q$ $b_Q$\n入力はすべて整数で与えられる。\n1行目に$T$の頂点数$N$が与えられる。\n2行目に頂点$i$($1 \\le i \\le N$)の重み$w_i$が空白区切りで与えられる。\n3行目以降の$N$-1行に辺$_i$($1 \\le i \\le N-1$)の端点$u_i,v_i$が空白区切りで与えられる。\n$N$+2行目にクエリの数$Q$が与えられる。\n$N$+3行目以降の$Q$行に、クエリ$_i$($1 \\le i \\le Q$)を表す$a_i,b_i$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$2 \\le N \\le 10^5$\n$1 \\le Q \\le 10^5$\n$1 \\le w_i \\le 10^8$($1 \\le i \\le N$)\n$1 \\le u_i,v_i \\le N$($1 \\le i \\le N-1$)\n$u_i \\ne v_i$\n$i \\ne j$なら$(u_i,v_i) \\ne (u_j,v_j)$かつ$(u_i,v_i) \\ne (v_j, u_j)$\n$1 \\le a_i,b_i \\le N$($1 \\le i \\le Q$)\n$a_i \\ne b_i$\nOuput\nクエリ毎に、0または重みが最大となる連結成分の重みを1行に出力する。\nSample Input 1\n10\n1 2 3 4 5 6 7 8 9 10\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n2 8\n8 9\n8 10\n3\n3 8\n7 1\n7 10\nSample Output 1\n13\n27\n12\nSample Input 2\n5\n1 2 3 4 5\n1 2\n2 3\n3 4\n4 5\n3\n1 2\n1 5\n2 4\nSample Output 2\n12\n0\n5\nSample Input 3\n15\n3 8 4 2 6 5 1 2 10 3 4 2 6 1 1\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n6 8\n1 9\n9 10\n10 11\n10 12\n9 13\n13 14\n13 15\n5\n1 1\n2 7\n6 10\n1 15\n3 4\nSample Output 3\n28\n30\n12\n28\n46"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3037_10422763","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long long LOG = 20;\n\nstruct Node {\n long long m1, m2, m3;\n};\n\nvector<vector<long long>> parent, max_up;\nvector<long long> p, par, glub, maxb;\nvector<Node> mxs;\n\nvoid dfs(long long v, long long PRED, vector<vector<long long>> &g, vector<long long> &a) {\n par[v] = PRED;\n p[v] += a[v];\n multiset<long long> st;\n for (auto i: g[v]) {\n if (i != PRED) dfs(i, v, g, a);\n if (i != PRED) p[v] += p[i];\n if (i != PRED) st.insert(p[i]);\n while (st.size() >= 4) st.erase(st.begin());\n }\n while (st.size() != 3) st.insert(0);\n Node o;\n o.m3 = *st.begin();\n st.erase(st.begin());\n o.m2 = *st.begin();\n st.erase(st.begin());\n o.m1 = *st.begin();\n st.erase(st.begin());\n mxs[v] = o;\n}\n\nvoid dfs2(long long u, long long p, vector<vector<long long>> &g) {\n parent[u][0] = p;\n glub[u] = 0;\n glub[u] = glub[p] + 1;\n max_up[u][0] = max(maxb[u], maxb[p]);\n for (long long i = 1; i < LOG; ++i) {\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\n }\n for (long long v: g[u]) {\n if (v != p) {\n dfs2(v, u, g);\n }\n }\n}\n\nlong long lca(long long u, long long v) {\n if (glub[u] < glub[v]) swap(u, v);\n for (long long i = LOG - 1; i >= 0; --i) {\n if (glub[u] - (1 << i) >= glub[v]) {\n u = parent[u][i];\n }\n }\n if (u == v) return u;\n for (long long i = LOG - 1; i >= 0; --i) {\n if (parent[u][i] != parent[v][i]) {\n u = parent[u][i];\n v = parent[v][i];\n }\n }\n return parent[u][0];\n}\n\nlong long p_on_s(long long v, long long s) {\n for (long long i = LOG; i >= 0; i--) {\n if ((1 << i) <= s) {\n v = parent[v][i];\n s -= (1 << i);\n }\n }\n return v;\n}\n\nlong long GET(long long u, long long v) {\n long long ancestor = lca(u, v);\n long long max_val = 0;\n for (long long i = LOG - 1; i >= 0; --i) {\n if (glub[u] - (1 << i) >= glub[ancestor]) {\n max_val = max(max_val, max_up[u][i]);\n u = parent[u][i];\n }\n }\n max_val = max(max_val, maxb[u]);\n for (long long i = LOG - 1; i >= 0; --i) {\n if (glub[v] - (1 << i) >= glub[ancestor]) {\n max_val = max(max_val, max_up[v][i]);\n v = parent[v][i];\n }\n }\n max_val = max(max_val, maxb[v]);\n return max_val;\n}\n\nsigned main() {\n long long n;\n cin >> n;\n vector<long long> a(n);\n for (long long i = 0; i < n; i++) cin >> a[i];\n long long FULL = 0;\n for (auto i: a) FULL += i;\n vector<vector<long long>> g(n);\n for (long long i = 0; i < n - 1; i++) {\n long long X, Y;\n cin >> X >> Y;\n X--;\n Y--;\n g[X].push_back(Y);\n g[Y].push_back(X);\n }\n p.resize(n, 0);\n par.resize(n, 0);\n mxs.resize(n, {0, 0});\n dfs(0, -1, g, a);\n maxb.resize(n, 0);\n parent.resize(n, vector<long long>(LOG));\n max_up.resize(n, vector<long long>(LOG));\n glub.resize(n, 0);\n for (long long i = 1; i < n; i++) {\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\n else maxb[i] = mxs[par[i]].m1;\n }\n dfs2(0, 0, g);\n long long q;\n cin >> q;\n while (q--) {\n long long x, y;\n cin >> x >> y;\n x--;\n y--;\n long long z = lca(x, y);\n if (z == x || z == y) {\n if (z == y) swap(x, y);\n cout << max({GET(x, y), FULL - p[z], mxs[y].m1}) << \"\\n\";\n continue;\n }\n long long xx, yy;\n if (glub[x] - glub[z] == 1) xx = -1;\n else xx = p_on_s(x, glub[x] - glub[z] - 2);\n if (glub[y] - glub[z] == 1) yy = -1;\n else yy = p_on_s(y, glub[y] - glub[z] - 2);\n long long xxx = p_on_s(x, glub[x] - glub[z] - 1);\n long long yyy = p_on_s(y, glub[y] - glub[z] - 1);\n multiset<long long, greater<>> otb;\n long long getmax_x = 0;\n long long getmax_y = 0;\n if (xx != -1) getmax_x = GET(x, xx);\n if (yy != -1) getmax_y = GET(y, yy);\n multiset<long long, greater<>> mxs_s;\n mxs_s.insert(mxs[z].m1);\n mxs_s.insert(mxs[z].m2);\n mxs_s.insert(mxs[z].m3);\n if (mxs_s.find(p[xxx]) != mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\n if (mxs_s.find(p[yyy]) != mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\n cout << max({*mxs_s.begin(), getmax_x, getmax_y, mxs[y].m1, mxs[x].m1, FULL - p[lca(x, y)]}) << \"\\n\";\n }\n}","accuracy":1,"time_ms":290,"memory_kb":54536,"score_of_the_acc":-0.9413,"final_rank":13},{"submission_id":"aoj_3037_10422762","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int MAXN = 1e5 + 5;\nconst int LOG = 20;\n\nstruct Node {\n int m1, m2, m3, m4;\n};\n\nvector<int> maxb;\nint parent[MAXN][LOG];\nint depth[MAXN];\nint max_up[MAXN][LOG];\nvector<int> p, par;\nvector<Node> mxs;\n\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\n par[v] = PRED;\n p[v] += a[v];\n multiset<int> st;\n for (auto i: g[v]) {\n if (i != PRED) dfs(i, v, g, a);\n if (i != PRED) p[v] += p[i];\n if (i != PRED) st.insert(p[i]);\n while (st.size() >= 4) st.erase(st.begin());\n }\n while (st.size() != 3) st.insert(0);\n Node o;\n o.m3 = *st.begin();\n st.erase(st.begin());\n o.m2 = *st.begin();\n st.erase(st.begin());\n o.m1 = *st.begin();\n st.erase(st.begin());\n mxs[v] = o;\n}\n\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\n parent[u][0] = p;\n depth[u] = 0;\n depth[u] = depth[p] + 1;\n max_up[u][0] = max(maxb[u], maxb[p]);\n for (int i = 1; i < LOG; ++i) {\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\n }\n for (int v: g[u]) {\n if (v != p) {\n dfs2(v, u, g);\n }\n }\n}\n\nint lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v);\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[v]) {\n u = parent[u][i];\n }\n }\n if (u == v) return u;\n for (int i = LOG - 1; i >= 0; --i) {\n if (parent[u][i] != parent[v][i]) {\n u = parent[u][i];\n v = parent[v][i];\n }\n }\n return parent[u][0];\n}\n\nint p_on_s(int v, int s) {\n for (int i = LOG; i >= 0; i--) {\n if ((1 << i) <= s) {\n v = parent[v][i];\n s -= (1 << i);\n }\n }\n return v;\n}\n\nint get_max_on_path(int u, int v) {\n int ancestor = lca(u, v);\n int max_val = 0;\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[u][i]);\n u = parent[u][i];\n }\n }\n max_val = max(max_val, maxb[u]);\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[v] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[v][i]);\n v = parent[v][i];\n }\n }\n max_val = max(max_val, maxb[v]);\n return max_val;\n}\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n int FULL = 0;\n for (auto i: a) FULL += i;\n vector<vector<int>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int X, Y;\n cin >> X >> Y;\n X--;\n Y--;\n g[X].push_back(Y);\n g[Y].push_back(X);\n }\n p.resize(n, 0);\n par.resize(n);\n mxs.resize(n, {0, 0});\n dfs(0, -1, g, a);\n maxb.resize(n, 0);\n for (int i = 1; i < n; i++) {\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\n else maxb[i] = mxs[par[i]].m1;\n }\n dfs2(0, 0, g);\n int q;\n cin >> q;\n while (q--) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n int z = lca(x, y);\n if(z==x || z==y){\n if(z==y) swap(x,y);\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\"\\n\";\n continue;\n }\n int xx,yy;\n if(depth[x]-depth[z]==1) xx=-1;\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\n if(depth[y]-depth[z]==1) yy=-1;\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\n\n multiset<int,greater<>> otb;\n int getmax_x=0;\n int getmax_y=0;\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\n\n multiset<int,greater<>> mxs_s;\n mxs_s.insert(mxs[z].m1);\n mxs_s.insert(mxs[z].m2);\n mxs_s.insert(mxs[z].m3);\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\"\\n\";\n }\n}","accuracy":1,"time_ms":250,"memory_kb":47612,"score_of_the_acc":-0.7752,"final_rank":7},{"submission_id":"aoj_3037_10422760","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int MAXN = 1e5 + 5;\nconst int LOG = 20;\n\nstruct Node {\n int m1, m2, m3, m4;\n};\n\nvector<int> maxb;\nint parent[MAXN][LOG];\nint depth[MAXN];\nint max_up[MAXN][LOG];\n\nvector<int> p, par;\nvector<Node> mxs;\n\nNode merge(Node &n1, Node &n2) {\n vector<int> y;\n y = {n1.m1, n1.m2, n1.m3, n1.m4, n2.m1, n2.m2, n2.m3, n2.m4};\n sort(y.rbegin(), y.rend());\n Node ans;\n ans.m1 = y[0];\n ans.m2 = y[1];\n ans.m3 = y[2];\n ans.m4 = y[3];\n return ans;\n}\n\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\n par[v] = PRED;\n p[v] += a[v];\n multiset<int> st;\n for (auto i: g[v]) {\n if (i != PRED) dfs(i, v, g, a);\n if (i != PRED) p[v] += p[i];\n if (i != PRED) st.insert(p[i]);\n while (st.size() >= 5) st.erase(st.begin());\n }\n while (st.size() != 4) st.insert(0);\n Node o;\n o.m4 = *st.begin();\n st.erase(st.begin());\n o.m3 = *st.begin();\n st.erase(st.begin());\n o.m2 = *st.begin();\n st.erase(st.begin());\n o.m1 = *st.begin();\n st.erase(st.begin());\n mxs[v] = o;\n}\n\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\n parent[u][0] = p;\n depth[u] = 0;\n depth[u] = depth[p] + 1;\n max_up[u][0] = max(maxb[u], maxb[p]); // Инициализация для первого предка\n\n for (int i = 1; i < LOG; ++i) {\n //cout<<u<<' '<<i<<\"\\n\";\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\n }\n\n for (int v: g[u]) {\n if (v != p) {\n dfs2(v, u, g);\n }\n }\n}\n\nint lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v);\n\n // Поднимаем u до уровня v\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[v]) {\n u = parent[u][i];\n }\n }\n\n if (u == v) return u;\n\n // Поднимаем вместе до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (parent[u][i] != parent[v][i]) {\n u = parent[u][i];\n v = parent[v][i];\n }\n }\n\n return parent[u][0];\n}\n\nint p_on_s(int v, int s) {\n for (int i = LOG; i >= 0; i--) {\n if ((1 << i) <= s) {\n v = parent[v][i];\n s -= (1 << i);\n }\n }\n return v;\n}\n\nint get_max_on_path(int u, int v) {\n int ancestor = lca(u, v);\n int max_val = 0;\n\n // Поднимаемся от u до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[u][i]);\n u = parent[u][i];\n }\n }\n max_val = max(max_val, maxb[u]);\n\n // Поднимаемся от v до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[v] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[v][i]);\n v = parent[v][i];\n }\n }\n max_val = max(max_val, maxb[v]);\n\n return max_val;\n}\n\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n int FULL = 0;\n for (auto i: a) FULL += i;\n vector<vector<int>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int X, Y;\n cin >> X >> Y;\n X--;\n Y--;\n g[X].push_back(Y);\n g[Y].push_back(X);\n }\n p.resize(n, 0);\n par.resize(n);\n mxs.resize(n, {0, 0});\n dfs(0, -1, g, a);\n maxb.resize(n, 0);\n for (int i = 1; i < n; i++) {\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\n else maxb[i] = mxs[par[i]].m1;\n }\n dfs2(0, 0, g);\n int q;\n cin >> q;\n //for (int i = 0; i < n; i++) cout << maxb[i] << \"\\n\";\n\n while (q--) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n int z = lca(x, y);\n if(z==x || z==y){\n if(z==y) swap(x,y);\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\"\\n\";\n continue;\n }\n int xx,yy;\n if(depth[x]-depth[z]==1) xx=-1;\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\n if(depth[y]-depth[z]==1) yy=-1;\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\n\n multiset<int,greater<>> otb;\n int getmax_x=0;\n int getmax_y=0;\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\n\n multiset<int,greater<>> mxs_s;\n mxs_s.insert(mxs[z].m1);\n mxs_s.insert(mxs[z].m2);\n mxs_s.insert(mxs[z].m3);\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\"\\n\";\n //cout<<*mxs_s.begin()<<' '<<getmax_x<<' '<<getmax_y<<' '<<mxs[y].m1<<' '<<mxs[x].m1<<' '<<FULL - p[lca(x, y)]<<\"\\n\";\n// cout << get_max_on_path(x, y) << ' ' << mxs[x].m1 << ' ' << mxs[y].m1 << ' ' << FULL - p[lca(x, y)]\n// << \"\\n\";\n// cout << max({get_max_on_path(x, y), mxs[x].m1, mxs[y].m1, FULL - p[lca(x, y)]}) << \"\\n\";\n\n }\n}","accuracy":1,"time_ms":250,"memory_kb":47440,"score_of_the_acc":-0.7731,"final_rank":6},{"submission_id":"aoj_3037_10422759","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MAXN = 1e5 + 5;\nconst int LOG = 20;\n\nstruct Node {\n int m1, m2, m3, m4;\n};\n\nvector<int> maxb;\nint parent[MAXN][LOG];\nint depth[MAXN];\nint max_up[MAXN][LOG];\n\nvector<int> p, par;\nvector<Node> mxs;\n\nNode merge(Node &n1, Node &n2) {\n vector<int> y;\n y = {n1.m1, n1.m2, n1.m3, n1.m4, n2.m1, n2.m2, n2.m3, n2.m4};\n sort(y.rbegin(), y.rend());\n Node ans;\n ans.m1 = y[0];\n ans.m2 = y[1];\n ans.m3 = y[2];\n ans.m4 = y[3];\n return ans;\n}\n\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\n par[v] = PRED;\n p[v] += a[v];\n multiset<int> st;\n for (auto i: g[v]) {\n if (i != PRED) dfs(i, v, g, a);\n if (i != PRED) p[v] += p[i];\n if (i != PRED) st.insert(p[i]);\n while (st.size() >= 5) st.erase(st.begin());\n }\n while (st.size() != 4) st.insert(0);\n Node o;\n o.m4 = *st.begin();\n st.erase(st.begin());\n o.m3 = *st.begin();\n st.erase(st.begin());\n o.m2 = *st.begin();\n st.erase(st.begin());\n o.m1 = *st.begin();\n st.erase(st.begin());\n mxs[v] = o;\n}\n\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\n parent[u][0] = p;\n depth[u] = 0;\n depth[u] = depth[p] + 1;\n max_up[u][0] = max(maxb[u], maxb[p]); // Инициализация для первого предка\n\n for (int i = 1; i < LOG; ++i) {\n //cout<<u<<' '<<i<<\"\\n\";\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\n }\n\n for (int v: g[u]) {\n if (v != p) {\n dfs2(v, u, g);\n }\n }\n}\n\nint lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v);\n\n // Поднимаем u до уровня v\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[v]) {\n u = parent[u][i];\n }\n }\n\n if (u == v) return u;\n\n // Поднимаем вместе до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (parent[u][i] != parent[v][i]) {\n u = parent[u][i];\n v = parent[v][i];\n }\n }\n\n return parent[u][0];\n}\n\nint p_on_s(int v, int s) {\n for (int i = LOG; i >= 0; i--) {\n if ((1 << i) <= s) {\n v = parent[v][i];\n s -= (1 << i);\n }\n }\n return v;\n}\n\nint get_max_on_path(int u, int v) {\n int ancestor = lca(u, v);\n int max_val = 0;\n\n // Поднимаемся от u до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[u] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[u][i]);\n u = parent[u][i];\n }\n }\n max_val = max(max_val, maxb[u]);\n\n // Поднимаемся от v до LCA\n for (int i = LOG - 1; i >= 0; --i) {\n if (depth[v] - (1 << i) >= depth[ancestor]) {\n max_val = max(max_val, max_up[v][i]);\n v = parent[v][i];\n }\n }\n max_val = max(max_val, maxb[v]);\n\n return max_val;\n}\n\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n int FULL = 0;\n for (auto i: a) FULL += i;\n vector<vector<int>> g(n);\n for (int i = 0; i < n - 1; i++) {\n int X, Y;\n cin >> X >> Y;\n X--;\n Y--;\n g[X].push_back(Y);\n g[Y].push_back(X);\n }\n p.resize(n, 0);\n par.resize(n);\n mxs.resize(n, {0, 0});\n dfs(0, -1, g, a);\n maxb.resize(n, 0);\n for (int i = 1; i < n; i++) {\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\n else maxb[i] = mxs[par[i]].m1;\n }\n dfs2(0, 0, g);\n int q;\n cin >> q;\n //for (int i = 0; i < n; i++) cout << maxb[i] << \"\\n\";\n\n while (q--) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n int z = lca(x, y);\n if(z==x || z==y){\n if(z==y) swap(x,y);\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\"\\n\";\n continue;\n }\n int xx,yy;\n if(depth[x]-depth[z]==1) xx=-1;\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\n if(depth[y]-depth[z]==1) yy=-1;\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\n\n multiset<int,greater<>> otb;\n int getmax_x=0;\n int getmax_y=0;\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\n\n multiset<int,greater<>> mxs_s;\n mxs_s.insert(mxs[z].m1);\n mxs_s.insert(mxs[z].m2);\n mxs_s.insert(mxs[z].m3);\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\"\\n\";\n //cout<<*mxs_s.begin()<<' '<<getmax_x<<' '<<getmax_y<<' '<<mxs[y].m1<<' '<<mxs[x].m1<<' '<<FULL - p[lca(x, y)]<<\"\\n\";\n// cout << get_max_on_path(x, y) << ' ' << mxs[x].m1 << ' ' << mxs[y].m1 << ' ' << FULL - p[lca(x, y)]\n// << \"\\n\";\n// cout << max({get_max_on_path(x, y), mxs[x].m1, mxs[y].m1, FULL - p[lca(x, y)]}) << \"\\n\";\n\n }\n}","accuracy":0.48936170212765956,"time_ms":60,"memory_kb":22840,"score_of_the_acc":-0.0833,"final_rank":19},{"submission_id":"aoj_3037_7758981","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\ntemplate<typename Vertex, typename Cluster, size_t N>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node(){p=q=nullptr;rev=guard=false;}\n };\n\n inline static array<Vertex, 2*N> pool_vertex;\n inline static size_t ptr_vertex = 0;\n\n inline static array<Node, 4*N> pool_node;\n inline static size_t ptr_node = 0;\n\n Cluster id;\n\n template<typename ...Args>\n inline Vertex* create(Args ...args){\n auto t=&pool_vertex[ptr_vertex++];\n auto dummy=&pool_vertex[ptr_vertex++];\n *t=Vertex(forward<Args>(args)...);\n link(t,id,dummy);\n return t;\n }\n\n Node* recycle=nullptr;\n inline void dispose_node(Node* t){\n t->p=recycle;\n recycle=t;\n }\n\n inline Node* get_new_node(){\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\n return &(pool_node[ptr_node++]);\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=get_new_node();\n t->vs[0]=u;t->vs[1]=v;t->dat=w;\n t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;\n t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;\n t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);\n pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n dispose_node(ll->p);\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n dispose_node(rk);\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n assert(nnv);\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n\n assert(nnu);\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n assert(rr->ch[1]->type==Type::Edge);\n dispose_node(rr->ch[1]);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\n\n#undef call_from_test\n\nusing ll = long long;\nstruct Vertex{\n void* handle;\n ll val;\n Vertex(ll val=0):handle(nullptr),val(val){}\n};\n\nstruct Cluster{\n ll sm,md,chd,ma;\n Cluster():sm(0),md(0),chd(0),ma(0){}\n void toggle(){}\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster z;\n z.sm=x.sm+(v->val)+y.sm;\n z.md=max({x.md,x.chd,y.md});\n z.ma=x.sm+(v->val)+y.sm;\n return z;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.sm+=y.sm;\n x.chd=max({x.chd,y.chd,y.ma});\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl = '\\n';\n\n int n;\n cin>>n;\n vector<int> ws(n);\n for(int i=0;i<n;i++) cin>>ws[i];\n\n const size_t N = 1e5 + 10;\n TopTree<Vertex, Cluster, N> G;\n\n vector<Vertex*> vs(n);\n for(int i=0;i<n;i++) vs[i]=G.create(ws[i]);\n\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.link(vs[u],Cluster(),vs[v]);\n }\n\n Vertex* da=G.create(0);\n Vertex* db=G.create(0);\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n\n G.link(da,Cluster(),vs[a]);\n G.link(db,Cluster(),vs[b]);\n\n cout<<G.get_path(da,db).md<<newl;\n\n G.cut(da,vs[a]);\n G.cut(db,vs[b]);\n }\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":43296,"score_of_the_acc":-0.932,"final_rank":12},{"submission_id":"aoj_3037_7758975","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\ntemplate<typename Vertex, typename Cluster, size_t N>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node(){p=q=nullptr;rev=guard=false;}\n };\n\n inline static array<Vertex, 2*N> pool_vertex;\n inline static size_t ptr_vertex = 0;\n\n inline static array<Node, 4*N> pool_node;\n inline static size_t ptr_node = 0;\n\n Cluster id;\n\n template<typename ...Args>\n inline Vertex* create(Args ...args){\n auto t=&pool_vertex[ptr_vertex++];\n auto dummy=&pool_vertex[ptr_vertex++];\n *t=Vertex(forward<Args>(args)...);\n link(t,id,dummy);\n return t;\n }\n\n Node* recycle=nullptr;\n inline void dispose_node(Node* t){\n t->p=recycle;\n recycle=t;\n }\n\n inline Node* get_new_node(){\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\n return &(pool_node[ptr_node++]);\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=get_new_node();\n t->vs[0]=u;t->vs[1]=v;t->dat=w;\n t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;\n t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;\n t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);\n pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n dispose_node(ll->p);\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n dispose_node(rk);\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n assert(nnv);\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n\n assert(nnu);\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n assert(rr->ch[1]->type==Type::Edge);\n dispose_node(rr->ch[1]);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\n\n#undef call_from_test\n\nusing ll = long long;\nstruct Vertex{\n void* handle;\n ll val;\n Vertex(ll val=0):handle(nullptr),val(val){}\n};\n\nstruct Cluster{\n ll sm,md,chd,ma;\n Cluster():sm(0),md(0),chd(0),ma(0){}\n void toggle(){}\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster z;\n z.sm=x.sm+(v->val)+y.sm;\n z.md=max({x.md,x.chd,y.md});\n z.ma=x.sm+(v->val)+y.sm;\n return z;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.sm+=y.sm;\n x.chd=max({x.chd,y.chd,y.ma});\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl = '\\n';\n\n int n;\n cin>>n;\n vector<int> ws(n);\n for(int i=0;i<n;i++) cin>>ws[i];\n\n const size_t N = 1e5;\n TopTree<Vertex, Cluster, N> G;\n\n vector<Vertex*> vs(n);\n for(int i=0;i<n;i++) vs[i]=G.create(ws[i]);\n\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.link(vs[u],Cluster(),vs[v]);\n }\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n ll res=G.get_path(vs[a],vs[b]).md;\n auto ab=G.get_subtree(vs[a],vs[b]);\n auto ba=G.get_subtree(vs[b],vs[a]);\n chmax(res,max(ab.chd,ab.ma));\n chmax(res,max(ba.chd,ba.ma));\n cout<<res<<newl;\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":43240,"score_of_the_acc":-0.8896,"final_rank":11},{"submission_id":"aoj_3037_5782729","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\ntemplate<typename Vertex, typename Cluster, size_t N>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\n };\n\n inline static array<Vertex, 2*N> pool_vertex;\n inline static size_t ptr_vertex = 0;\n\n inline static array<Node, 4*N> pool_node;\n inline static size_t ptr_node = 0;\n\n Cluster id;\n\n inline Vertex* create(Vertex v=Vertex()){\n auto t=&pool_vertex[ptr_vertex++];\n auto dummy=&pool_vertex[ptr_vertex++];\n *t=v;\n link(t,id,dummy);\n return t;\n }\n\n Node* recycle=nullptr;\n inline void dispose_node(Node* t){\n t->p=recycle;\n recycle=t;\n }\n\n inline Node* get_new_node(){\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\n return &(pool_node[ptr_node++]);\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=get_new_node();\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=get_new_node();\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n dispose_node(ll->p);\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n propagate(rk);\n\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n assert(nnv);\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n\n assert(nnu);\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n dispose_node(rr->ch[1]);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\n\n#undef call_from_test\n\nusing ll = long long;\nstruct Vertex{\n void* handle;\n ll val;\n Vertex(ll val=0):handle(nullptr),val(val){}\n};\n\nstruct Cluster{\n ll sm,md,chd,ma;\n Cluster():sm(0),md(0),chd(0),ma(0){}\n void toggle(){}\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster z;\n z.sm=x.sm+(v->val)+y.sm;\n z.md=max({x.md,x.chd,y.md});\n z.ma=x.sm+(v->val)+y.sm;\n return z;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.sm+=y.sm;\n x.chd=max({x.chd,y.chd,y.ma});\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl = '\\n';\n\n int n;\n cin>>n;\n vector<int> ws(n);\n for(int i=0;i<n;i++) cin>>ws[i];\n\n const size_t LIM = 1e5;\n TopTree<Vertex, Cluster, LIM> G;\n\n vector<Vertex*> vs(n);\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\n\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.link(vs[u],Cluster(),vs[v]);\n }\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n ll res=G.get_path(vs[a],vs[b]).md;\n auto ab=G.get_subtree(vs[a],vs[b]);\n auto ba=G.get_subtree(vs[b],vs[a]);\n chmax(res,max(ab.chd,ab.ma));\n chmax(res,max(ba.chd,ba.ma));\n cout<<res<<newl;\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":43228,"score_of_the_acc":-0.8895,"final_rank":10},{"submission_id":"aoj_3037_4312886","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename Vertex, typename Cluster, size_t LIM>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\n };\n\n static array<Vertex, LIM> pool_v;\n static array<Node, LIM> pool_c;\n size_t ptr_v,ptr_c;\n\n Cluster id;\n TopTree(Cluster id=Cluster()):ptr_v(0),ptr_c(0),id(id){}\n\n inline Vertex* create(Vertex v=Vertex()){\n auto t=&pool_v[ptr_v++];\n auto dummy=&pool_v[ptr_v++];\n *t=v;\n link(t,id,dummy);\n return t;\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=&(pool_c[ptr_c++]);\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n propagate(rk);\n\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n if(!nnv) ll=ee;\n else{\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n }\n\n if(nnu){\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\nTopTree<Vertex, Cluster, LIM>::pool_c;\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nusing ll = long long;\nstruct Vertex{\n void* handle;\n ll val;\n Vertex(ll val=0):handle(nullptr),val(val){}\n};\n\nstruct Cluster{\n ll sm,md,chd,ma;\n Cluster():sm(0),md(0),chd(0),ma(0){}\n void toggle(){}\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster z;\n z.sm=x.sm+(v->val)+y.sm;\n z.md=max({x.md,x.chd,y.md});\n z.ma=x.sm+(v->val)+y.sm;\n return z;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.sm+=y.sm;\n x.chd=max({x.chd,y.chd,y.ma});\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl = '\\n';\n\n int n;\n cin>>n;\n vector<int> ws(n);\n for(int i=0;i<n;i++) cin>>ws[i];\n\n const size_t LIM = 1e6;\n TopTree<Vertex, Cluster, LIM> G;\n\n vector<Vertex*> vs(n);\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\n\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.link(vs[u],Cluster(),vs[v]);\n }\n\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n ll res=G.get_path(vs[a],vs[b]).md;\n auto ab=G.get_subtree(vs[a],vs[b]);\n auto ba=G.get_subtree(vs[b],vs[a]);\n chmax(res,max(ab.chd,ab.ma));\n chmax(res,max(ba.chd,ba.ma));\n cout<<res<<newl;\n }\n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":106520,"score_of_the_acc":-1.9792,"final_rank":18},{"submission_id":"aoj_3037_4312878","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename Vertex, typename Cluster, size_t LIM>\nstruct TopTree{\n enum Type { Compress, Rake, Edge };\n struct Node{\n Vertex* vs[2];\n Cluster dat;\n Node* p;\n Node* q;\n Node* ch[2];\n bool rev,guard;\n Type type;\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\n };\n\n static array<Vertex, LIM> pool_v;\n static array<Node, LIM> pool_c;\n size_t ptr_v,ptr_c;\n\n Cluster id;\n TopTree(Cluster id=Cluster()):ptr_v(0),ptr_c(0),id(id){}\n\n inline Vertex* create(Vertex v=Vertex()){\n auto t=&pool_v[ptr_v++];\n auto dummy=&pool_v[ptr_v++];\n *t=v;\n link(t,id,dummy);\n return t;\n }\n\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\n auto t=&(pool_c[ptr_c++]);\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\n return pushup(t);\n }\n\n inline Node* compress(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\n return pushup(t);\n }\n\n inline Node* rake(Node* l,Node* r){\n auto t=&(pool_c[ptr_c++]);\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\n return pushup(t);\n }\n\n int parent_dir(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->guard) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n int parent_dir_ignore_guard(Node* t){\n Node* p=t->p;\n if(!p) return -1;\n if(p->ch[0]==t) return 0;\n if(p->ch[1]==t) return 1;\n return -1;\n }\n\n inline Node* pushup(Node* const t){\n Node* const l=t->ch[0];\n Node* const r=t->ch[1];\n\n if(t->type==Type::Compress){\n assert(l->vs[1]==r->vs[0]);\n t->vs[0]=l->vs[0];\n t->vs[1]=r->vs[1];\n\n Cluster lf=l->dat;\n if(t->q){\n assert(l->vs[1]==t->q->vs[1]);\n lf=Cluster::rake(l->dat,t->q->dat);\n }\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\n\n l->vs[1]->handle=t;\n }\n\n if(t->type==Type::Rake){\n propagate(t);\n assert(l->vs[1]==r->vs[1]);\n t->vs[0]=l->vs[0];\n t->vs[1]=l->vs[1];\n t->dat=Cluster::rake(l->dat,r->dat);\n }else{\n if(!t->p){\n t->vs[0]->handle=t;\n t->vs[1]->handle=t;\n }else if(t->p->type==Type::Compress){\n if(parent_dir(t)==-1)\n t->vs[0]->handle=t;\n }else if(t->p->type==Type::Rake){\n t->vs[0]->handle=t;\n }\n }\n return t;\n }\n\n inline void toggle(Node* t){\n if(t->type==Type::Edge){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n }else if(t->type==Type::Compress){\n swap(t->vs[0],t->vs[1]);\n t->dat.toggle();\n t->rev^=true;\n }else if(t->type==Type::Rake){\n }else abort();\n }\n\n inline void propagate(Node* t){\n if(t->type==Type::Compress){\n if(t->rev){\n assert(t->ch[0] and t->ch[1]);\n swap(t->ch[0],t->ch[1]);\n toggle(t->ch[0]);\n toggle(t->ch[1]);\n t->rev=false;\n }\n }\n }\n\n void set_toggle(Node* v){\n toggle(v);propagate(v);\n }\n\n void pushdown(Node* t){\n if(!t) return;\n pushdown(t->p);\n propagate(t);\n }\n\n void rotate(Node* t,Node* x,size_t dir){\n Node* y=x->p;\n int par=parent_dir_ignore_guard(x);\n propagate(t->ch[dir]);\n x->ch[dir^1]=t->ch[dir];\n t->ch[dir]->p=x;\n t->ch[dir]=x;\n x->p=t;\n t->p=y;\n if(~par) y->ch[par]=t;\n else if(y and y->type==Type::Compress) y->q=t;\n pushup(x);pushup(t);\n if(y and !y->guard) pushup(y);\n }\n\n void splay(Node* t){\n assert(t->type!=Type::Edge);\n propagate(t);\n\n while(~parent_dir(t)){\n Node* q=t->p;\n if(q->type!=t->type) break;\n if(~parent_dir(q) and q->p and q->p->type==q->type){\n Node* r=q->p;\n if(r->p) propagate(r->p);\n propagate(r);propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n int rq_dir=parent_dir(q);\n if(rq_dir==qt_dir){\n rotate(q,r,rq_dir^1);\n rotate(t,q,qt_dir^1);\n }else{\n rotate(t,q,qt_dir^1);\n rotate(t,r,rq_dir^1);\n }\n }else{\n if(q->p) propagate(q->p);\n propagate(q);propagate(t);\n int qt_dir=parent_dir(t);\n rotate(t,q,qt_dir^1);\n }\n }\n }\n\n Node* expose(Node* t){\n pushdown(t);\n while(true){\n assert(t->type!=Type::Rake);\n if(t->type==Type::Compress) splay(t);\n Node* n=nullptr;\n {\n Node* p=t->p;\n if(!p) break;\n if(p->type==Type::Rake){\n propagate(p);\n splay(p);\n n=p->p;\n }\n if(p->type==Type::Compress){\n propagate(p);\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\n n=p;\n }\n }\n splay(n);\n int dir=parent_dir_ignore_guard(n);\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\n\n Node* const c=n->ch[dir];\n if(dir==1){\n set_toggle(c);\n set_toggle(t);\n }\n int n_dir=parent_dir(t);\n if(~n_dir){\n Node* const r=t->p;\n propagate(c);\n propagate(r);\n r->ch[n_dir]=c;\n c->p=r;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(r);pushup(t);pushup(n);\n splay(r);\n }else{\n propagate(c);\n n->q=c;\n c->p=n;\n n->ch[dir]=t;\n t->p=n;\n pushup(c);pushup(t);pushup(n);\n }\n if(t->type==Type::Edge) t=n;\n }\n return t;\n }\n\n Node* expose(Vertex* v){\n return expose((Node*)(v->handle));\n }\n\n void soft_expose(Vertex* u,Vertex* v){\n pushdown((Node*)u->handle);\n pushdown((Node*)v->handle);\n Node* rt=expose(u);\n\n if(u->handle==v->handle){\n if(rt->vs[1]==u or rt->vs[0]==v)\n set_toggle(rt);\n return;\n }\n\n rt->guard=true;\n Node* soft=expose(v);\n rt->guard=false;\n\n pushup(rt);\n if(parent_dir(soft)==0) set_toggle(rt);\n }\n\n void bring(Node* rt){\n Node* rk=rt->q;\n if(!rk){\n Node* ll=rt->ch[0];\n ll->p=nullptr;\n pushup(ll);\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\n propagate(rk);\n\n Node* nr=rk;\n set_toggle(nr);\n rt->ch[1]=nr;\n nr->p=rt;\n rt->q=nullptr;\n\n pushup(nr);pushup(rt);\n }else if(rk->type==Type::Rake){\n propagate(rk);\n while(rk->ch[1]->type==Type::Rake){\n propagate(rk->ch[1]);\n rk=rk->ch[1];\n }\n pushdown(rk);\n\n rt->guard=true;\n splay(rk);\n rt->guard=false;\n\n Node* ll=rk->ch[0];\n Node* rr=rk->ch[1];\n propagate(ll);\n set_toggle(rr);\n\n rt->ch[1]=rr;\n rr->p=rt;\n\n rt->q=ll;\n ll->p=rt;\n\n pushup(ll);pushup(rr);pushup(rt);\n }\n }\n\n Node* link(Vertex* u,Cluster w,Vertex* v){\n if(!u->handle and !v->handle) return edge(u,w,v);\n\n Node* nnu=(Node*)u->handle;\n Node* nnv=(Node*)v->handle;\n Node* ee=edge(u,w,v);\n Node* ll=nullptr;\n\n if(!nnv) ll=ee;\n else{\n Node* vv=expose(nnv);\n propagate(vv);\n if(vv->vs[1]==v) set_toggle(vv);\n if(vv->vs[0]==v){\n Node* nv=compress(ee,vv);\n ee->p=nv;\n pushup(ee);\n vv->p=nv;\n pushup(vv);pushup(nv);\n ll=nv;\n }else{\n Node* nv=vv;\n Node* ch=nv->ch[0];\n propagate(ch);\n nv->ch[0]=ee;\n ee->p=nv;\n pushup(ee);\n\n Node* bt=nv->q;\n Node* rk=nullptr;\n if(bt){\n propagate(bt);\n rk=rake(bt,ch);\n bt->p=rk;\n ch->p=rk;\n pushup(bt);pushup(ch);\n }else{\n rk=ch;\n }\n nv->q=rk;\n rk->p=nv;\n pushup(rk);pushup(nv);\n ll=nv;\n }\n }\n\n if(nnu){\n Node* uu=expose(nnu);\n propagate(uu);\n if(uu->vs[0]==u) set_toggle(uu);\n if(uu->vs[1]==u){\n Node* tp=compress(uu,ll);\n uu->p=tp;\n ll->p=tp;\n pushup(uu);pushup(ll);pushup(tp);\n }else{\n Node* nu=uu;\n Node* ch=nu->ch[1];\n toggle(ch);\n propagate(ch);\n\n nu->ch[1]=ll;\n ll->p=nu;\n pushup(ll);\n\n Node* al=nu->q;\n Node* rk=nullptr;\n if(al){\n propagate(al);\n rk=rake(al,ch);\n al->p=rk;\n ch->p=rk;\n pushup(al);pushup(ch);\n }else{\n rk=ch;\n }\n nu->q=rk;\n rk->p=nu;\n pushup(rk);pushup(nu);\n }\n }\n return ee;\n }\n\n void cut(Vertex* u,Vertex *v){\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n Node* rr=rt->ch[1];\n rr->p=nullptr;\n set_toggle(rr);\n bring(rr);bring(rt);\n }\n\n Node* path(Vertex* u,Vertex* v){\n assert(u!=v);\n soft_expose(u,v);\n Node* rt=(Node*)u->handle;\n propagate(rt);\n propagate(rt->ch[1]);\n return rt->ch[1]->ch[0];\n }\n\n void set_vertex(Vertex* u,Vertex v){\n auto t=expose(u);\n *u=v;\n pushup(t);\n }\n\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\n auto t=path(u,v);\n assert(t->type==Type::Edge);\n t->dat=w;\n while(t) pushup(t),t=t->p;\n }\n\n Cluster get_path(Vertex* u,Vertex* v){\n return path(u,v)->dat;\n }\n\n Cluster get_subtree(Vertex* v){\n return expose(v)->dat;\n }\n\n // subtree of v when p is root\n Cluster get_subtree(Vertex* p,Vertex* v){\n Node* t=path(p,v);\n Cluster res=t->p->ch[1]->dat;\n res.toggle();\n Node* rk=t->p->q;\n if(t->p->q){\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\n res=Cluster::rake(res,rk->dat);\n }\n return res;\n }\n};\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\ntemplate<typename Vertex, typename Cluster, size_t LIM>\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\nTopTree<Vertex, Cluster, LIM>::pool_c;\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nusing ll = long long;\nstruct Vertex{\n void* handle;\n ll val;\n Vertex(ll val=0):handle(nullptr),val(val){}\n};\n\nstruct Cluster{\n ll sm,md,chd,ma;\n Cluster():sm(0),md(0),chd(0),ma(0){}\n void toggle(){}\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\n Cluster z;\n z.sm=x.sm+(v->val)+y.sm;\n z.md=max({x.md,x.chd,y.md});\n z.ma=x.sm+(v->val)+y.sm;\n return z;\n }\n static Cluster rake(Cluster x,Cluster y){\n x.sm+=y.sm;\n x.chd=max({x.chd,y.chd,y.ma});\n return x;\n }\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n const char newl = '\\n';\n\n int n;\n cin>>n;\n vector<int> ws(n);\n for(int i=0;i<n;i++) cin>>ws[i];\n\n const size_t LIM = 1e6;\n TopTree<Vertex, Cluster, LIM> G;\n\n vector<Vertex*> vs(n);\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\n\n for(int i=1;i<n;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G.link(vs[u],Cluster(),vs[v]);\n }\n\n const int DEBUG = 0;\n int q;\n cin>>q;\n for(int i=0;i<q;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n if(a==b){\n if(DEBUG){\n cout<<\"sm:\"<<G.get_subtree(vs[a]).sm<<endl;\n cout<<\"md:\"<<G.get_subtree(vs[a]).md<<endl;\n cout<<\"ma:\"<<G.get_subtree(vs[a]).ma<<endl;\n }\n cout<<G.get_subtree(vs[a]).md<<newl;\n }else{\n ll res=G.get_path(vs[a],vs[b]).md;\n chmax(res,G.get_subtree(vs[a],vs[b]).ma);\n chmax(res,G.get_subtree(vs[b],vs[a]).ma);\n\n if(DEBUG){\n cout<<\"md:\"<<G.get_path(vs[a],vs[b]).md<<endl;\n cout<<\"ab:\"<<G.get_subtree(vs[a],vs[b]).ma<<endl;\n cout<<\"ba:\"<<G.get_subtree(vs[b],vs[a]).ma<<endl;\n }\n cout<<res<<newl;\n }\n }\n return 0;\n}","accuracy":0.06382978723404255,"time_ms":20,"memory_kb":104748,"score_of_the_acc":-0.9788,"final_rank":20},{"submission_id":"aoj_3037_3042315","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nconst Int DEBUG = 0;\n\nstruct HLDecomposition {\n Int n,pos;\n vector<vector<Int> > G;\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\n \n HLDecomposition(){}\n HLDecomposition(Int sz):\n n(sz),pos(0),G(n),\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\n par(n),dep(n),inv(n),type(n){}\n \n void add_edge(Int u, Int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n void build(vector<Int> rs={0}) {\n Int c=0;\n for(Int r:rs){\n dfs(r);\n bfs(r, c++);\n }\n }\n \n void dfs(Int rt) {\n using T = pair<Int, Int>;\n stack<T> st;\n par[rt]=-1;\n dep[rt]=0;\n st.emplace(rt,0);\n while(!st.empty()){\n Int v=st.top().first;\n Int &i=st.top().second;\n if(i<(Int)G[v].size()){\n\tInt u=G[v][i++];\n\tif(u==par[v]) continue;\n\tpar[u]=v;\n\tdep[u]=dep[v]+1;\n\tst.emplace(u,0);\n }else{\n\tst.pop();\n\tInt res=0;\n\tfor(Int u:G[v]){\n\t if(u==par[v]) continue;\n\t sub[v]+=sub[u];\n\t if(res<sub[u]) res=sub[u],hvy[v]=u;\n\t}\n }\n }\n }\n\n void bfs(Int r,Int c) {\n Int &k=pos;\n queue<Int> q({r});\n while(!q.empty()){\n Int h=q.front();q.pop();\n for(Int i=h;i!=-1;i=hvy[i]) {\n\ttype[i]=c;\n\tvid[i]=k++;\n\tinv[vid[i]]=i;\n\thead[i]=h;\n\tfor(Int j:G[i])\n\t if(j!=par[i]&&j!=hvy[i]) q.push(j);\n }\n }\n }\n \n // for_each(vertex)\n // [l,r] <- attention!!\n void for_each(Int u, Int v, const function<void(Int, Int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n f(max(vid[head[v]],vid[u]),vid[v]);\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n }\n \n // for_each(edge)\n // [l,r] <- attention!!\n void for_each_edge(Int u, Int v, const function<void(Int, Int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]){\n\tf(vid[head[v]],vid[v]);\n v=par[head[v]];\n } else{\n\tif(u!=v) f(vid[u]+1,vid[v]);\n\tbreak;\n }\n }\n }\n\n Int lca(Int u,Int v){\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v=par[head[v]];\n }\n }\n\n Int distance(Int u,Int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n};\n\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n typedef function<T(T,T)> F;\n typedef function<T(T,E)> G;\n Int n;\n F f;\n G g;\n T d1;\n E d0;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(Int n_,F f,G g,T d1,\n\t vector<T> v=vector<T>()):\n f(f),g(g),d1(d1){\n init(n_);\n if(n_==(Int)v.size()) build(n_,v);\n }\n void init(Int n_){\n n=1;\n while(n<n_) n*=2;\n dat.clear();\n dat.resize(2*n-1,d1);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\n for(Int i=n-2;i>=0;i--)\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\n }\n void update(Int k,E a){\n k+=n-1;\n dat[k]=g(dat[k],a);\n while(k>0){\n k=(k-1)/2;\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\n }\n }\n inline T query(Int a,Int b){\n T vl=d1,vr=d1;\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,dat[(l++)-1]);\n if(r&1) vr=f(dat[(--r)-1],vr);\n }\n return f(vl,vr);\n }\n\n Int find(Int a,Int b,function<bool(T)> &check,Int k,Int l,Int r){\n if(!check(dat[k])||r<=a||b<=l) return -1;\n if(k>=n-1) return k-(n-1);\n Int m=(l+r)>>1;\n Int vl=find(a,b,check,k*2+1,l,m);\n if(~vl) return vl;\n return find(a,b,check,k*2+2,m,r);\n }\n \n Int find(Int a,Int b,function<bool(T)> &check){\n return find(a,b,check,0,0,n);\n }\n \n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n cin>>n;\n vector<Int> w(n);\n for(Int i=0;i<n;i++) cin>>w[i];\n HLDecomposition hld(n);\n for(Int i=1;i<n;i++){\n Int u,v;\n cin>>u>>v;\n u--;v--;\n hld.add_edge(u,v);\n }\n hld.build();\n auto G=hld.G;\n auto head=hld.head;\n auto vid=hld.vid;\n auto inv=hld.inv;\n \n vector<Int> dp(n),dp2(n,-1),dp3(n,-1);\n using P = pair<Int, Int>;\n vector<set<P> > ps(n);\n function<Int(Int,Int)> dfs=[&](Int v,Int p){\n dp[v]=w[v];\n ps[v].emplace(-1,-1);\n for(Int u:G[v]){\n if(u==p) continue;\n Int k=dfs(u,v);\n dp[v]+=k;\n if(head[v]!=head[u]){\n\tchmax(dp2[v],k);\n\tps[v].emplace(k,u);\n\tif(DEBUG) cout<<v<<\"->\"<<u<<\":\"<<k<<endl;\n }else dp3[v]=k;\n }\n return dp[v];\n };\n dfs(0,-1);\n \n SegmentTree<Int, Int>::F f=[](Int a,Int b){return max(a,b);};\n SegmentTree<Int, Int>::G g=[](Int a,Int b){++a;return b;};\n SegmentTree<Int, Int> seg(n,f,g,-1);\n for(Int i=0;i<n;i++) seg.update(vid[i],dp2[i]);\n \n Int sum=accumulate(w.begin(),w.end(),Int(0));\n Int q;\n cin>>q;\n for(Int i=0;i<q;i++){\n Int u,v;\n cin>>u>>v;\n u--;v--;\n Int ans=sum-dp[hld.lca(u,v)];\n set<Int> s;\n hld.for_each(u,v,[&](Int l,Int r){\n\tif(l+1<r) chmax(ans,seg.query(l+1,r));\n\tif(DEBUG) cout<<inv[l]<<\" \"<<inv[r]<<endl;\n\ts.emplace(inv[l]);\n\ts.emplace(inv[r]);\n\tchmax(ans,dp3[inv[r]]);\n });\n if(DEBUG) cout<<ans<<endl;\n for(Int v:s){\n auto latte=--ps[v].end();\n while(s.count(latte->second)) --latte;\n if(DEBUG) cout<<v<<\" \"<<latte->second<<\":\"<<latte->first<<endl;\n chmax(ans,latte->first);\n }\n cout<<ans<<endl;\n }\n \n \n return 0;\n}","accuracy":1,"time_ms":500,"memory_kb":46304,"score_of_the_acc":-1.2804,"final_rank":17},{"submission_id":"aoj_3037_2772114","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\n#define INF 1e16\n#define mod 1000000007\n\nll n,q;\nll w[100001];\nvector<ll> g[100001];\nll d[100001];\nll p[20][100001];\nvector<ll> s[100001];\nll br[20][100001];\n\nvoid dfs(ll v,ll pre,ll dist){\n p[0][v]=pre;\n d[v]=dist;\n for(ll nv : g[v]){\n if(nv==pre)continue;\n dfs(nv,v,dist+1);\n w[v]+=w[nv];\n if(s[v].size()>=3&&s[v].back()<w[nv]){\n s[v].pop_back();\n s[v].push_back(w[nv]);\n sort(all(s[v]));\n reverse(all(s[v]));\n }else if(s[v].size()<=2){\n s[v].push_back(w[nv]);\n sort(all(s[v]));\n reverse(all(s[v]));\n }\n }\n}\n\nint lca(int u,int v){\n if(d[u]>d[v])swap(u,v);\n for(int k=0;k<20;k++){\n if((d[v]-d[u])>>k&1){\n v=p[k][v];\n }\n }\n if(u==v)return u;\n for(int k=20-1;k>=0;k--){\n if(p[k][u]!=p[k][v]){\n u=p[k][u];\n v=p[k][v];\n }\n }\n return p[0][u];\n}\n\nint main(){\n cin>>n;\n rep(i,n)cin>>w[i];\n rep(i,n-1){\n ll a,b;\n cin>>a>>b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n dfs(0,-1,0);\n\n rep(v,n){\n for(ll ch : g[v]){\n if(d[ch]<d[v])continue;\n if(w[ch]==s[v][0]){\n if(s[v].size()>=2)br[0][ch]=s[v][1];\n else br[0][ch]=-INF;\n }else{\n if(s[v].size()>=1)br[0][ch]=s[v][0];\n else br[0][ch]=-INF;\n }\n }\n }\n\n rep(k,19){\n rep(i,n){\n if(p[k][i]!=-1) p[k+1][i]=p[k][p[k][i]];\n else p[k+1][i]=-1;\n }\n }\n\n rep(k,19){\n rep(i,n){\n if(p[k][i]!=-1) br[k+1][i]=max(br[k][i],br[k][p[k][i]]);\n else br[k+1][i]=-INF;\n }\n }\n\n cin>>q;\n while(q--){\n ll a,b;\n cin>>a>>b;\n a--;b--;\n if(d[a]>d[b])swap(a,b);\n ll lc=lca(a,b);\n ll res=w[0]-w[lc];\n\n if(lc==a){\n ll nb=b,pb=b;\n while(p[0][pb]!=lc&&pb!=lc){\n ll i=0;\n while(p[i][pb]!=-1&&d[p[i][pb]]>d[lc])i++;\n i--;\n pb=p[i][pb];\n }\n while(nb!=lc){\n ll i=0;\n while(p[i][nb]!=-1&&d[p[i][nb]]>=d[lc])i++;\n i--;\n maxch(res,br[i][nb]);\n nb=p[i][nb];\n }\n\n if(s[b].size()>0)maxch(res,s[b][0]);\n\n multiset<ll> rest;\n rep(k,s[a].size())rest.insert(s[a][k]);\n if(rest.find(w[pb])!=rest.end())rest.erase(rest.find(w[pb]));\n if(rest.size()>0)maxch(res,*rest.rbegin());\n }else{\n ll na=a,pa=a;\n while(p[0][pa]!=lc){\n ll i=0;\n while(p[i][pa]!=-1&&d[p[i][pa]]>d[lc])i++;\n i--;\n pa=p[i][pa];\n }\n while(na!=pa){\n ll i=0;\n while(p[i][na]!=-1&&d[p[i][na]]>=d[pa])i++;\n i--;\n maxch(res,br[i][na]);\n na=p[i][na];\n }\n\n ll nb=b,pb=b;\n while(p[0][pb]!=lc){\n ll i=0;\n while(p[i][pb]!=-1&&d[p[i][pb]]>d[lc])i++;\n i--;\n pb=p[i][pb];\n }\n while(nb!=pb){\n ll i=0;\n while(p[i][nb]!=-1&&d[p[i][nb]]>=d[pb])i++;\n i--;\n maxch(res,br[i][nb]);\n nb=p[i][nb];\n }\n\n if(s[a].size()>0)maxch(res,s[a][0]);\n if(s[b].size()>0)maxch(res,s[b][0]);\n multiset<ll> rest;\n rep(k,s[lc].size())rest.insert(s[lc][k]);\n if(rest.find(w[pa])!=rest.end())rest.erase(rest.find(w[pa]));\n if(rest.find(w[pb])!=rest.end())rest.erase(rest.find(w[pb]));\n if(rest.size()>0)maxch(res,*rest.rbegin());\n }\n cout<<res<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":46092,"score_of_the_acc":-0.8404,"final_rank":9},{"submission_id":"aoj_3037_2760096","code_snippet":"#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\nll N, Q;\nll W[100000], U[100000], V[100000], A[100000], B[100000];\nvector<ll> E[100000];\nll x[100000][3], y[100000];\nll depth[100000], parent[20][100000], mx[20][100000];\n\nvoid dfs(ll v, ll p, ll d) {\n parent[0][v] = p;\n depth[v] = d;\n for(ll u : E[v]) if(u != p) dfs(u, v, d + 1);\n}\n\nll subtree_size(ll v, ll p) {\n vector<ll> child;\n for(ll u : E[v]) if(u != p) child.push_back(subtree_size(u, v));\n sort(child.begin(), child.end(), greater<ll>());\n REP(i, 0, 3) x[v][i] = i < child.size() ? child[i] : 0;\n for(ll u : E[v]) if(u != p) mx[0][u] = x[v][0] != y[u] ? x[v][0] : x[v][1];\n y[v] = W[v];\n REP(i, 0, child.size()) y[v] += child[i];\n return y[v];\n}\n\nll query(ll u, ll v) {\n if(depth[u] > depth[v]) swap(u, v);\n REP(i, 0, 20) if(((depth[v] - depth[u]) >> i) & 1) v = parent[i][v];\n if(u == v) return u;\n for(ll i = 19; i >= 0; i--) if(parent[i][u] != parent[i][v]) {\n u = parent[i][u];\n v = parent[i][v];\n }\n return parent[0][u];\n}\n\nint main(void) {\n cin >> N;\n REP(i, 0, N) cin >> W[i];\n REP(i, 0, N - 1) {\n cin >> U[i] >> V[i]; U[i]--; V[i]--;\n E[U[i]].push_back(V[i]);\n E[V[i]].push_back(U[i]);\n }\n cin >> Q;\n REP(i, 0, Q) { cin >> A[i] >> B[i]; A[i]--; B[i]--; }\n\n dfs(0, -1, 0);\n subtree_size(0, -1);\n REP(i, 0, 19) REP(j, 0, N) parent[i + 1][j] = parent[i][j] >= 0 ? parent[i][parent[i][j]] : -1;\n REP(i, 0, 19) REP(j, 0, N) if(parent[i][j] >= 0) mx[i + 1][j] = max(mx[i][j], mx[i][parent[i][j]]);\n\n REP(q, 0, Q) {\n ll a = A[q], b = B[q], lca = query(a, b);\n ll ans = 0;\n if(lca == a || lca == b) {\n if(lca == b) swap(a, b);\n ans = max(ans, x[b][0]);\n for(ll i = 19; i >= 0; i--) {\n if(parent[i][b] >= 0 && depth[parent[i][b]] >= depth[lca]) {\n ans = max(ans, mx[i][b]);\n b = parent[i][b];\n }\n }\n ans = max(ans, y[0] - y[lca]);\n } else {\n ans = max(ans, x[a][0]);\n ans = max(ans, x[b][0]);\n for(ll i = 19; i >= 0; i--) {\n if(parent[i][a] >= 0 && depth[parent[i][a]] > depth[lca]) {\n ans = max(ans, mx[i][a]);\n a = parent[i][a];\n }\n }\n for(ll i = 19; i >= 0; i--) {\n if(parent[i][b] >= 0 && depth[parent[i][b]] > depth[lca]) {\n ans = max(ans, mx[i][b]);\n b = parent[i][b];\n }\n }\n vector<ll> r;\n r.push_back(y[a]);\n r.push_back(y[b]);\n r.push_back(-1);\n sort(r.begin(), r.end(), greater<ll>());\n REP(i, 0, 3) if(r[i] != x[lca][i]) ans = max(ans, x[lca][i]);\n ans = max(ans, y[0] - y[lca]);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":320,"memory_kb":37312,"score_of_the_acc":-0.7979,"final_rank":8},{"submission_id":"aoj_3037_2755605","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n\nint N, W[100000], Q;\nvector< int > g[100000];\nint dep[100000];\nint64 sub[100000];\nint64 heavy[3][100000];\nconst int LOG = 18;\n\nint par[LOG][100000];\nint64 sz[LOG][100000];\n\nvoid predfs(int idx, int p, int d) {\n par[0][idx] = p;\n dep[idx] = d;\n sub[idx] += W[idx];\n for(auto &to : g[idx]) {\n if(to == p) continue;\n predfs(to, idx, d + 1);\n sub[idx] += sub[to];\n if(heavy[0][idx] < sub[to]) {\n heavy[2][idx] = heavy[1][idx];\n heavy[1][idx] = heavy[0][idx];\n heavy[0][idx] = sub[to];\n } else if(heavy[1][idx] < sub[to]) {\n heavy[2][idx] = heavy[1][idx];\n heavy[1][idx] = sub[to];\n } else if(heavy[2][idx] < sub[to]) {\n heavy[2][idx] = sub[to];\n }\n }\n}\n\nvoid dfs(int idx, int p) {\n for(auto &to : g[idx]) {\n if(to == p) continue;\n dfs(to, idx);\n sz[0][to] = heavy[heavy[0][idx] == sub[to]][idx];\n }\n}\n\nint lca(int x, int y) {\n if(dep[x] > dep[y]) swap(x, y);\n for(int i = LOG - 1; i >= 0; i--) {\n if((dep[y] - dep[x]) >> i & 1) y = par[i][y];\n }\n if(x == y) return x;\n for(int i = LOG - 1; i >= 0; i--) {\n if(par[i][x] != par[i][y]) {\n x = par[i][x];\n y = par[i][y];\n }\n }\n return par[0][x];\n}\n\nint main() {\n scanf(\"%d\", &N);\n for(int i = 0; i < N; i++) {\n scanf(\"%d\", &W[i]);\n }\n for(int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n }\n predfs(0, -1, 0);\n dfs(0, -1);\n for(int i = 0; i + 1 < LOG; i++) {\n for(int j = 0; j < N; j++) {\n if(par[i][j] == -1) par[i + 1][j] = -1;\n else par[i + 1][j] = par[i][par[i][j]];\n if(par[i + 1][j] == -1) continue;\n sz[i + 1][j] = max(sz[i][j], sz[i][par[i][j]]);\n }\n }\n\n int64 all = accumulate(W, W + N, 0LL);\n\n scanf(\"%d\", &Q);\n while(Q--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n --a, --b;\n if(dep[a] > dep[b]) swap(a, b);\n int p = lca(a, b);\n\n int64 ret = 0;\n if(p != a) {\n\n bool ng[3] = {};\n ret = max(ret, heavy[0][a]);\n ret = max(ret, heavy[0][b]);\n\n for(auto c : {a, b}) {\n int xx = dep[p] + 1;\n for(int i = LOG - 1; i >= 0; i--) {\n if(((dep[c] - xx) >> i) & 1) {\n ret = max(ret, sz[i][c]);\n c = par[i][c];\n }\n }\n for(int i = 0; i < 3; i++) {\n if(ng[i]) continue;\n if(sub[c] == heavy[i][p]) {\n ng[i] = true;\n break;\n }\n }\n }\n for(int i = 0; i < 3; i++) {\n if(ng[i]) continue;\n ret = max(ret, heavy[i][p]);\n }\n } else if(p != b) {\n ret = max(ret, heavy[0][b]);\n int c = b;\n int xx = dep[a] + 1;\n for(int i = LOG - 1; i >= 0; i--) {\n if(((dep[c] - xx) >> i) & 1) {\n ret = max(ret, sz[i][c]);\n c = par[i][c];\n }\n }\n ret = max(ret, sz[0][c]);\n } else {\n ret = max(ret, heavy[0][p]);\n }\n\n printf(\"%lld\\n\", max(ret, all - sub[p]));\n }\n}","accuracy":1,"time_ms":100,"memory_kb":23608,"score_of_the_acc":-0.1758,"final_rank":1},{"submission_id":"aoj_3037_2755604","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n\nint N, W[100000], Q;\nvector< int > g[100000];\nint dep[100000];\nint64 sub[100000];\nint64 heavy[3][100000];\nconst int LOG = 20;\n\nint par[LOG][100000];\nint64 sz[LOG][100000];\n\nvoid predfs(int idx, int p, int d) {\n par[0][idx] = p;\n dep[idx] = d;\n sub[idx] += W[idx];\n for(auto &to : g[idx]) {\n if(to == p) continue;\n predfs(to, idx, d + 1);\n sub[idx] += sub[to];\n if(heavy[0][idx] < sub[to]) {\n heavy[2][idx] = heavy[1][idx];\n heavy[1][idx] = heavy[0][idx];\n heavy[0][idx] = sub[to];\n } else if(heavy[1][idx] < sub[to]) {\n heavy[2][idx] = heavy[1][idx];\n heavy[1][idx] = sub[to];\n } else if(heavy[2][idx] < sub[to]) {\n heavy[2][idx] = sub[to];\n }\n }\n}\n\nvoid dfs(int idx, int p) {\n for(auto &to : g[idx]) {\n if(to == p) continue;\n dfs(to, idx);\n sz[0][to] = heavy[heavy[0][idx] == sub[to]][idx];\n }\n}\n\nint lca(int x, int y) {\n if(dep[x] > dep[y]) swap(x, y);\n for(int i = LOG - 1; i >= 0; i--) {\n if((dep[y] - dep[x]) >> i & 1) y = par[i][y];\n }\n if(x == y) return x;\n for(int i = LOG - 1; i >= 0; i--) {\n if(par[i][x] != par[i][y]) {\n x = par[i][x];\n y = par[i][y];\n }\n }\n return par[0][x];\n}\n\nint main() {\n scanf(\"%d\", &N);\n for(int i = 0; i < N; i++) {\n scanf(\"%d\", &W[i]);\n }\n for(int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n }\n predfs(0, -1, 0);\n dfs(0, -1);\n for(int i = 0; i + 1 < LOG; i++) {\n for(int j = 0; j < N; j++) {\n if(par[i][j] == -1) par[i + 1][j] = -1;\n else par[i + 1][j] = par[i][par[i][j]];\n if(par[i + 1][j] == -1) continue;\n sz[i + 1][j] = max(sz[i][j], sz[i][par[i][j]]);\n }\n }\n\n int64 all = accumulate(W, W + N, 0LL);\n\n scanf(\"%d\", &Q);\n while(Q--) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n --a, --b;\n if(dep[a] > dep[b]) swap(a, b);\n int p = lca(a, b);\n\n int64 ret = 0;\n if(p != a) {\n\n bool ng[3] = {};\n ret = max(ret, heavy[0][a]);\n ret = max(ret, heavy[0][b]);\n\n for(auto c : {a, b}) {\n int xx = dep[p] + 1;\n for(int i = LOG - 1; i >= 0; i--) {\n if(((dep[c] - xx) >> i) & 1) {\n ret = max(ret, sz[i][c]);\n c = par[i][c];\n }\n }\n for(int i = 0; i < 3; i++) {\n if(ng[i]) continue;\n if(sub[c] == heavy[i][p]) {\n ng[i] = true;\n break;\n }\n }\n }\n for(int i = 0; i < 3; i++) {\n if(ng[i]) continue;\n ret = max(ret, heavy[i][p]);\n }\n } else if(p != b) {\n ret = max(ret, heavy[0][b]);\n int c = b;\n int xx = dep[a] + 1;\n for(int i = LOG - 1; i >= 0; i--) {\n if(((dep[c] - xx) >> i) & 1) {\n ret = max(ret, sz[i][c]);\n c = par[i][c];\n }\n }\n ret = max(ret, sz[0][c]);\n } else {\n ret = max(ret, heavy[0][p]);\n }\n\n printf(\"%lld\\n\", max(ret, all - sub[p]));\n }\n}","accuracy":1,"time_ms":100,"memory_kb":24440,"score_of_the_acc":-0.1858,"final_rank":2},{"submission_id":"aoj_3037_2752638","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <map>\n#include <set>\n#include <string>\n#include <iostream>\n#include <cassert>\n#include <cmath>\nusing namespace std;\n\nstruct LCA {\n const int LOGM = 30;\n vector<int> depth;\n vector<vector<int>> parent;\n vector<pair<int, long long>> pare;\n vector<vector<long long>> parmax;\n LCA(int root, const vector<vector<int>> &g, const vector<pair<int, long long>> &pare) : pare(pare) {\n int n = g.size();\n depth.resize(n);\n parent.resize(LOGM);\n parmax.resize(LOGM);\n for (int i = 0; i < LOGM; i ++) { \n parent[i].resize(n);\n parmax[i].resize(n);\n }\n function<void (int, int, int)> dfs = [&](int u, int prev, int d) {\n parent[0][u] = prev;\n parmax[0][u] = pare[u].second;\n depth[u] = d;\n for (auto v : g[u]) if (v != prev) dfs(v, u, d + 1);\n };\n dfs(root, -1, 0);\n for (int k = 0; k < LOGM - 1; k ++) {\n for (int i = 0; i < n; i ++) {\n if (parent[k][i] < 0) { \n parent[k + 1][i] = -1;\n } else { \n parent[k + 1][i] = parent[k][parent[k][i]];\n if (parent[k + 1][i] >= 0) {\n parmax[k + 1][i] = max(parmax[k][i], parmax[k][parent[k][i]]);\n }\n }\n }\n }\n }\n int lca(int u, int v) { \n if (depth[u] > depth[v]) swap(u, v);\n for (int k = 0; k < LOGM; k ++) {\n if ((depth[v] - depth[u]) >> k & 1) { \n v = parent[k][v];\n }\n }\n if (u == v) return u;\n for (int k = LOGM - 1; k >= 0; k --) {\n if (parent[k][u] != parent[k][v]) {\n u = parent[k][u];\n v = parent[k][v];\n }\n }\n return parent[0][u];\n }\n pair<int, long long> get(int a, int l) {\n long long res = 0;\n int d = depth[a] - depth[l] - 1;\n if (d <= 0) return { a, 0 };\n for (int k = 0; k < LOGM; k ++) {\n if ((d >> k) & 1) {\n res = max(res, parmax[k][a]);\n a = parent[k][a];\n }\n }\n return {a, res};\n }\n int dist(int u, int v) {\n return depth[u] + depth[v] - 2 * depth[lca(u, v)];\n }\n};\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n vector<int> w(n);\n vector<vector<int>> g(n);\n long long tot = 0;\n for (int i = 0; i < n; i ++) {\n scanf(\"%d\", &w[i]);\n tot += w[i];\n }\n for (int i = 0; i < n - 1; i ++) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a --, b --;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n vector<long long> sum(n);\n vector<long long> maxx(n);\n vector<pair<int, long long>> pare(n);\n function<void (int, int)> dfs = [&](int u, int prev) {\n pare[u].first = prev;\n sum[u] = w[u];\n vector<pair<long long, int>> val;\n int cnt = 0;\n for (auto v : g[u]) if (v != prev) {\n dfs(v, u);\n sum[u] += sum[v];\n val.emplace_back(sum[v], v);\n maxx[u] = max(maxx[u], sum[v]);\n cnt ++;\n }\n sort(val.rbegin(), val.rend());\n if (cnt >= 2) {\n for (auto v : g[u]) if (v != prev) {\n if (val[0].second != v) {\n pare[v].second = val[0].first;\n } else {\n pare[v].second = val[1].first;\n }\n }\n }\n };\n dfs(0, -1);\n vector<vector<pair<long long, int>>> ma(n);\n for (int i = 0; i < n; i ++) {\n for (auto v : g[i]) if (v != pare[i].first) {\n ma[i].emplace_back(sum[v], v);\n }\n sort(ma[i].rbegin(), ma[i].rend());\n }\n LCA lca(0, g, pare);\n /*\n for (int i = 0; i < n; i ++) {\n for (int k = 0; k < 30; k ++) {\n cerr << lca.parmax[k][i] << ' ';\n }\n cerr << endl;\n }\n */\n int q;\n scanf(\"%d\", &q);\n while (q --) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a --, b --;\n int l = lca.lca(a, b);\n long long ans = tot - sum[l];\n\n if (a == l && b == l) { \n ans = max(ans, maxx[l]);\n printf(\"%lld\\n\", ans);\n continue;\n }\n\n if (a == l || b == l) {\n if (a == l) swap(a, b);\n ans = max(ans, maxx[a]);\n auto geta = lca.get(a, l);\n int va = geta.first;\n ans = max(ans, geta.second);\n ans = max(ans, pare[va].second);\n printf(\"%lld\\n\", ans);\n continue;\n }\n ans = max(ans, maxx[a]);\n ans = max(ans, maxx[b]);\n auto geta = lca.get(a, l);\n auto getb = lca.get(b, l);\n int va = geta.first;\n int vb = getb.first;\n ans = max(ans, geta.second);\n ans = max(ans, getb.second);\n int top1 = ma[l][0].second;\n int top2 = ma[l][1].second;\n if ((int) g[l].size() >= 4 || ((int) g[l].size() >= 3 && l == 0)) {\n if (top1 == va) {\n if (top2 == vb) {\n ans = max(ans, ma[l][2].first);\n } else {\n ans = max(ans, ma[l][1].first);\n }\n } else if (top1 == vb) {\n if (top2 == va) {\n ans = max(ans, ma[l][2].first);\n } else {\n ans = max(ans, ma[l][1].first);\n }\n } else {\n ans = max(ans, ma[l][0].first);\n }\n }\n printf(\"%lld\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":53980,"score_of_the_acc":-0.6221,"final_rank":4},{"submission_id":"aoj_3037_2752398","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nconst int MAX_N = 100010;\nconst int LOG_N = 22;\n\nusing Pi = pair<int, int>;\nusing vint = vector<int>;\n\nint N, Q;\nint w[MAX_N];\nvint graph[MAX_N];\n\nint subsz[MAX_N];\nint depth[MAX_N];\nvector<Pi> chdat[MAX_N];\n\nint par[LOG_N][MAX_N];\nint mxw[LOG_N][MAX_N];\n\nint getchw(int u, int ch1 = -1, int ch2 = -1) {\n for(Pi p : chdat[u]) {\n if(p.second != ch1 && p.second != ch2) return p.first;\n }\n return 0;\n}\n\nvoid init() {\n memset(par, -1, sizeof(par));\n function<void(int, int, int)> dfs = [&dfs](int u, int p, int d) {\n par[0][u] = p;\n depth[u] = d;\n subsz[u] = w[u];\n for(int v : graph[u]) {\n if(v == p) continue;\n dfs(v, u, d+1);\n subsz[u] += subsz[v];\n chdat[u].emplace_back(subsz[v], v);\n }\n sort(chdat[u].rbegin(), chdat[u].rend());\n };\n dfs(0, -1, 0);\n for(int i = 1; i < N; ++i) {\n int p = par[0][i];\n mxw[0][i] = getchw(p, i);\n }\n for(int i = 0; i+1 < LOG_N; ++i) {\n for(int v = 0; v < N; ++v) {\n if(par[i][v] == -1) {\n\tpar[i+1][v] = -1;\n\tmxw[i+1][v] = -1;\n } else {\n\tpar[i+1][v] = par[i][par[i][v]];\n\tmxw[i+1][v] = max(mxw[i][par[i][v]], mxw[i][v]);\n }\n }\n }\n}\n\nint ask(int u, int v) {\n if(depth[u] > depth[v]) swap(u, v);\n int res = getchw(v);\n for(int i = 0; i < LOG_N; ++i) {\n if(((depth[v]-depth[u])>>i)&1) {\n res = max(res, mxw[i][v]);\n v = par[i][v];\n }\n }\n if(u == v) return max(res, subsz[0]-subsz[u]);\n\n res = max(res, getchw(u));\n for(int i = LOG_N-1; i >= 0; --i) {\n if(par[i][u] != par[i][v]) {\n res = max(res, mxw[i][u]);\n res = max(res, mxw[i][v]);\n u = par[i][u];\n v = par[i][v];\n }\n }\n\n int lca = par[0][u];\n return max({res, subsz[0]-subsz[lca], getchw(lca, u, v)});\n}\n\nsigned main() {\n scanf(\"%lld\", &N);\n for(int i = 0; i < N; ++i) scanf(\"%lld\", &w[i]);\n for(int i = 0; i < N-1; ++i) {\n int u, v;\n scanf(\"%lld %lld\", &u, &v);\n --u, --v;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n init();\n scanf(\"%lld\", &Q);\n for(int i = 0; i < Q; ++i) {\n int a, b;\n scanf(\"%lld %lld\", &a, &b);\n --a, --b;\n printf(\"%lld\\n\", ask(a, b));\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":50996,"score_of_the_acc":-0.5865,"final_rank":3},{"submission_id":"aoj_3037_2751840","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp make_pair\n#define pb push_back\n#define all(x) begin(x),end(x)\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string){cerr<<endl;}\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\" = \"<<h<<\", \";_dbg(s.substr(l+1),t...);}\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nconst int N = 100005;\n\nvector<int> tree[N];\n\ntemplate<int SZ>\nclass HLDecomp {\npublic:\n int n;\n void dfs(const int root){\n stack<pair<int,bool> > st;\n par[root] = -1;\n dep[root] = 0;\n st.push({root,false});\n while(!st.empty()){\n int v = st.top().first;\n bool &b = st.top().second;\n if(!b){\n // initial visit of v\n b = true;\n for(int u : tree[v]) if(u != par[v]){\n par[u] = v;\n dep[u] = dep[v] + 1;\n st.push({u, false});\n }\n }\n else {\n // second visit\n st.pop();\n int cur_max = 0;\n for(int u : tree[v]) if(u != par[v]){\n sub_sz[v] += sub_sz[u];\n if(sub_sz[u] > cur_max){\n cur_max = sub_sz[u];\n heavy_child[v] = u;\n }\n }\n }\n }\n }\n void bfs(const int root){\n int cnt = 0;\n queue<int> q;\n q.push(root);\n while(!q.empty()){\n int h = q.front(); q.pop();\n for(int i=h; i!=-1; i = heavy_child[i]){\n vid[i] = cnt++;\n vid2idx[vid[i]] = i;\n chain_head[i] = h;\n for(int to : tree[i]) if(to!=par[i] && to!=heavy_child[i]) q.push(to);\n }\n }\n }\n\n int par[SZ], dep[SZ], sub_sz[SZ], heavy_child[SZ], vid[SZ], vid2idx[SZ], chain_head[SZ];\n HLDecomp(){}\n HLDecomp(const int _n) : n(_n) {\n assert(n<=SZ);\n fill(sub_sz, sub_sz+n, 1);\n fill(heavy_child, heavy_child+n, -1);\n }\n void add_edge(const int u, const int v){\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n void build(const int root = 0){\n dfs(root);\n bfs(root);\n }\n\n // 閉区間注意 SegTreeの区間 r+1 必要かも\n void for_each_vertex(int u, int v, const function<void(int,int)> &f) const {\n while(true){\n if(vid[u] > vid[v]) swap(u,v);\n f(max(vid[chain_head[v]], vid[u]), vid[v]);\n if(chain_head[u] != chain_head[v]) v = par[chain_head[v]];\n else break;\n }\n }\n int lca(int u, int v) const {\n while(true){\n if(vid[u] > vid[v]) swap(u,v);\n if(chain_head[u] == chain_head[v]) return u;\n v = par[chain_head[v]];\n }\n }\n};\n\nHLDecomp<N> hl;\nvector<pair<long,int>> lval[N];\nlong hval[N];\nlong w[N];\nlong ch_max[N];\nlong pa_max[N];\nlong tw;\n\nusing P = pair<long,int>;\n\nclass SegTree {\npublic:\n int n;\n vector<vector<P>> data;\n vector<P> op(const vector<P> &lh, const vector<P> &rh) const {\n vector<P> ret;\n for(auto p : lh) ret.pb(p);\n for(auto p : rh) ret.pb(p);\n sort(all(ret), greater<P>());\n if(ret.size()>=4) ret.resize(3);\n return ret;\n }\n SegTree(int m){\n n=1;\n while(n<m) n*=2;\n data.resize(2*n);\n rep(i,m) data[i+n] = lval[hl.vid2idx[i]];\n for(int i=n-1; i>0; i--) data[i] = op(data[i*2], data[i*2+1]);\n }\n vector<P> query(int l, int r) const {\n vector<P> v = {};\n for(l+=n, r+=n; l<r; l/=2, r/=2){\n if(l&1) v = op(v, data[l++]);\n if(r&1) v = op(data[--r], v);\n }\n return v;\n }\n};\n\nlong dfs(int v, int pre){\n ch_max[v] = 0;\n long ret = w[v];\n for(auto nx : tree[v]) if(nx != pre){\n long r = dfs(nx, v);\n ch_max[v] = max(ch_max[v], r);\n ret += r;\n if(nx == hl.heavy_child[v]) hval[v] = r;\n else lval[v].push_back({r, nx});\n }\n sort(all(lval[v]), greater<P>());\n if(lval[v].size()>=4) lval[v].resize(3);\n pa_max[v] = tw - ret;\n return ret;\n}\n\n\nint main(){\n int n;\n cin>>n;\n rep(i,n) scanf(\"%ld\", w+i);\n tw = accumulate(w, w+n, 0L);\n hl = HLDecomp<N>(n);\n\n rep(i,n-1){\n int a,b;\n scanf(\"%d %d\", &a, &b);\n a--;b--;\n hl.add_edge(a,b);\n }\n\n hl.build();\n dfs(0, -1);\n\n SegTree st(n);\n\n int q;\n scanf(\"%d\", &q);\n rep(_,q){\n int a,b;\n scanf(\"%d %d\", &a, &b);\n a--;b--;\n if(a==b){\n cout << max(ch_max[a], pa_max[a]) << \"\\n\";\n continue;\n }\n int cp = hl.lca(a,b);\n\n long cand;\n if(cp == a) cand = ch_max[b];\n else if(cp == b) cand = ch_max[a];\n else cand = max(ch_max[a], ch_max[b]);\n\n cand = max(cand, pa_max[cp]);\n\n hl.for_each_vertex(a, b, [&](auto l, auto r){\n cand = max(cand, hval[hl.vid2idx[r]]);\n auto v = st.query(l ,r+1);\n // dbg(cand, hl.vid2idx[l], hl.vid2idx[r], hval[hl.vid2idx[r]], pa_max[hl.vid2idx[l]], v);\n for(auto &p : v){\n if(hl.lca(p.second,a) != p.second && hl.lca(p.second,b) != p.second){\n cand = max(cand, p.first);\n return;\n }\n }\n });\n printf(\"%ld\\n\", cand);\n }\n\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":30108,"score_of_the_acc":-0.7327,"final_rank":5},{"submission_id":"aoj_3037_2751833","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nconst int INF=1001001001001001001ll;\n\nint par[20][111111];\nint A[111111];\n\nint N;\nvint G[111111];\n\nint dep[111111];\nint latte[111111];\nint dp[20][111111];\nvint lis[111111];\nvoid dfs(int v,int p,int d){\n dep[v]=d;\n par[0][v]=p;\n latte[v]=A[v];\n lis[v].pb(0);\n lis[v].pb(0);\n for(auto u:G[v]){\n if(u==p)continue;\n dfs(u,v,d+1);\n latte[v]+=latte[u];\n lis[v].pb(latte[u]);\n }\n}\n\nint lca(int a,int b){\n if(dep[a]<dep[b])swap(a,b);\n rep(i,20)if((dep[a]-dep[b])>>i&1)a=par[i][a];\n if(a==b)return a;\n for(int i=19;i>=0;i--)if(par[i][a]!=par[i][b])a=par[i][a],b=par[i][b];\n return par[0][a];\n}\n\nsigned main(){\n cin>>N;\n rep(i,N)cin>>A[i];\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G[a].pb(b);G[b].pb(a);\n }\n\n dfs(0,-1,0);\n\n rep(i,N){\n sort(all(lis[i]));\n reverse(all(lis[i]));\n }\n for(int i=1;i<N;i++){\n int p=par[0][i];\n if(lis[p][0]==latte[i]){\n dp[0][i]=lis[p][1];\n }\n else{\n dp[0][i]=lis[p][0];\n }\n }\n\n\n rep(i,19){\n rep(j,N){\n if(par[i][j]==-1){\n par[i+1][j]=-1;\n dp[i+1][j]=dp[i][j];\n }\n else{\n par[i+1][j]=par[i][par[i][j]];\n dp[i+1][j]=max(dp[i][par[i][j]],dp[i][j]);\n }\n }\n }\n\n\n int sumall=accumulate(A,A+N,0ll);\n\n\n int Q;cin>>Q;\n while(Q--){\n int a,b;\n cin>>a>>b;a--;b--;\n int p=lca(a,b);\n int ans=0;\n rep(lattemalta,2){\n swap(a,b);\n int x=a;\n if(a==p)continue;\n chmax(ans,lis[a][0]);\n int d=dep[x]-dep[p]-1;\n rep(i,20){\n if(d>>i&1){\n chmax(ans,dp[i][x]);\n x=par[i][x];\n }\n }\n a=x;\n\n\n\n }\n\n {\n bool flaga=false,flagb=false;\n for(auto x:lis[p]){\n if(!flaga&&x==latte[a]){\n flaga=true;\n continue;\n }\n if(!flagb&&x==latte[b]){\n flagb=true;\n continue;\n }\n chmax(ans,x);\n break;\n }\n }\n chmax(ans,sumall-latte[p]);\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":50168,"score_of_the_acc":-0.9724,"final_rank":14},{"submission_id":"aoj_3037_2751262","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=int64_t;\n//#define int ll\n\n#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)\n#define REP(i,b) FOR(i,0,b)\n#define MP make_pair\n#define PB push_back\n#define ALL(x) x.begin(),x.end()\n#ifdef MAROON_LOCAL\n#define cerr (cerr<<\"-- line \"<<__LINE__<<\" -- \")\n#else\nclass CerrDummy{}cerrDummy;\ntemplate<class T>\nCerrDummy& operator<<(CerrDummy&cd,const T&){\n\treturn cd;\n}\nusing charTDummy=char;\nusing traitsDummy=char_traits<charTDummy>;\nCerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){\n\treturn cd;\n}\n#define cerr cerrDummy\n#endif\n#define REACH cerr<<\"reached\"<<endl\n#define DMP(x) cerr<<#x<<\":\"<<x<<endl\n#define ZERO(x) memset(x,0,sizeof(x))\n#define ONE(x) memset(x,-1,sizeof(x))\n\nusing pi=pair<int,int>;\nusing vi=vector<int>;\nusing ld=long double;\n\ntemplate<class T,class U>\nostream& operator<<(ostream& os,const pair<T,U>& p){\n\tos<<\"(\"<<p.first<<\",\"<<p.second<<\")\";\n\treturn os;\n}\n\ntemplate<class T>\nostream& operator <<(ostream& os,const vector<T>& v){\n\tos<<\"[\";\n\tREP(i,(int)v.size()){\n\t\tif(i)os<<\",\";\n\t\tos<<v[i];\n\t}\n\tos<<\"]\";\n\treturn os;\n}\n\nll read(){\n\tll i;\n\tscanf(\"%\" SCNd64,&i);\n\treturn i;\n}\n\nvoid printSpace(){\n\tprintf(\" \");\n}\n\nvoid printEoln(){\n\tprintf(\"\\n\");\n}\n\nvoid print(ll x,int suc=1){\n\tprintf(\"%\" PRId64,x);\n\tif(suc==1)\n\t\tprintEoln();\n\tif(suc==2)\n\t\tprintSpace();\n}\n\nstring readString(){\n\tstatic char buf[3341000];\n\tscanf(\"%s\",buf);\n\treturn string(buf);\n}\n\nchar* readCharArray(){\n\tstatic char buf[3341000];\n\tstatic int bufUsed=0;\n\tchar* ret=buf+bufUsed;\n\tscanf(\"%s\",ret);\n\tbufUsed+=strlen(ret)+1;\n\treturn ret;\n}\n\ntemplate<class T,class U>\nvoid chmax(T& a,U b){\n\tif(a<b)\n\t\ta=b;\n}\n\ntemplate<class T,class U>\nvoid chmin(T& a,U b){\n\tif(b<a)\n\t\ta=b;\n}\n\ntemplate<class T>\nT Sq(const T& t){\n\treturn t*t;\n}\n\n#define CAPITAL\nvoid Yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<endl;\n\t#else\n\tcout<<\"Yes\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\nvoid No(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<endl;\n\t#else\n\tcout<<\"No\"<<endl;\n\t#endif\n\tif(ex)exit(0);\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nenum ClusterType{\n\tNONE,\n\tBASE,\n\tRAKE,\n\tCOMPRESS,\n\tHARDRAKE,\n\tSELECTRAKE\n};\ntemplate<class Info>\nstruct TopTree{\n\tstruct Cluster{\n\t\tTopTree* belongingTree;\n\t\tClusterType type;\n\t\tCluster *l,*r,*m,*p;\n\t\tInfo info,tmpInfo;\n\t\tint a,b;\n\t\tCluster(TopTree* tree):info(-1,-1),tmpInfo(-1,-1){\n\t\t\tbelongingTree=tree;\n\t\t\tClear();\n\t\t}\n\t\tvoid Clear(){\n\t\t\ttype=NONE;\n\t\t\tl=nullptr;\n\t\t\tr=nullptr;\n\t\t\tm=nullptr;\n\t\t\tp=nullptr;\n\t\t\tinfo=Info(-1,-1);\n\t\t\ttmpInfo=Info(-1,-1);\n\t\t\ta=-1;\n\t\t\tb=-1;\n\t\t}\n\t\tvoid UpdateHandles(){\n\t\t\tif(type==BASE){\n\t\t\t\tbelongingTree->handles[a]=this;\n\t\t\t\tbelongingTree->handles[b]=this;\n\t\t\t}else if(type==COMPRESS){\n\t\t\t\tbelongingTree->handles[l->a]=this;\n\t\t\t\tbelongingTree->handles[l->b]=this;\n\t\t\t\tbelongingTree->handles[r->a]=this;\n\t\t\t\tbelongingTree->handles[r->b]=this;\n\t\t\t}\n\t\t}\n\t\tvoid Update(){\n\t\t\tif(type==COMPRESS){\n\t\t\t\tif(m){\n\t\t\t\t\ttmpInfo=Info(l->a,l->b);\n\t\t\t\t\ttmpInfo.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\n\t\t\t\t}\n\t\t\t\ta=l->a;\n\t\t\t\tb=r->b;\n\t\t\t\tUpdateHandles();\n\t\t\t\tinfo=Info(a,b);\n\t\t\t\tinfo.Join(a,b,l->a,l->b,m?tmpInfo:l->info,r->a,r->b,r->info,COMPRESS);\n\t\t\t}else if(type==RAKE){\n\t\t\t\ta=r->a;\n\t\t\t\tb=r->b;\n\t\t\t\tinfo=Info(a,b);\n\t\t\t\tinfo.Join(a,b,l->a,l->b,l->info,r->a,r->b,r->info,RAKE);\n\t\t\t}else if(type==HARDRAKE){\n\t\t\t\tint la=l->a,lb=l->b;\n\t\t\t\tint ra=r->a,rb=r->b;\n\t\t\t\tif(la==ra||la==rb)swap(la,lb);\n\t\t\t\tif(lb==ra)swap(ra,rb);\n\t\t\t\ta=ra;\n\t\t\t\tb=rb;\n\t\t\t\tinfo=Info(a,b);\n\t\t\t\tinfo.Join(a,b,la,lb,l->info,ra,rb,r->info,RAKE);\n\t\t\t}\n\t\t}\n\t\tvoid Reverse(){\n\t\t\tswap(a,b);\n\t\t}\n\t\tvoid Normalize(){\n\t\t\tif(type==BASE){\n\t\t\t}else{\n\t\t\t\tif(type==COMPRESS){\n\t\t\t\t\tbool updMid=false;\n\t\t\t\t\tif(r->a==a||r->b==a){\n\t\t\t\t\t\tswap(l,r);\n\t\t\t\t\t\tupdMid=true;\n\t\t\t\t\t}\n\t\t\t\t\tif(l->a!=a)l->Reverse();\n\t\t\t\t\tif(r->b!=b)r->Reverse();\n\t\t\t\t\tif(m&&updMid){\n\t\t\t\t\t\ttmpInfo=Info(l->a,l->b);\n\t\t\t\t\t\ttmpInfo.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\n\t\t\t\t\t}\n\t\t\t\t\tinfo.Split(a,b,l->a,l->b,m?tmpInfo:l->info,r->a,r->b,r->info,COMPRESS);\n\t\t\t\t\tif(m)tmpInfo.Split(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\n\t\t\t\t}else if(type==RAKE){\n\t\t\t\t\tinfo.Split(a,b,l->a,l->b,l->info,r->a,r->b,r->info,RAKE);\n\t\t\t\t}else if(type==HARDRAKE){\n\t\t\t\t\tint la=l->a,lb=l->b;\n\t\t\t\t\tint ra=r->a,rb=r->b;\n\t\t\t\t\tif(la==ra||la==rb)swap(la,lb);\n\t\t\t\t\tif(lb==ra)swap(ra,rb);\n\t\t\t\t\tinfo.Split(a,b,la,lb,l->info,ra,rb,r->info,RAKE);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tCluster* Select(int&xa,int&xb,Info&x,int&ya,int&yb,Info&y){\n\t\t\tNormalize();\n\t\t\tif(type==BASE){\n\t\t\t\treturn this;\n\t\t\t}else{\n\t\t\t\tif(type==COMPRESS){\n\t\t\t\t\tInfo lTmp(l->b,l->a),rTmp(r->a,r->b);\n\t\t\t\t\tif(xa==xb)lTmp=l->info;\n\t\t\t\t\telse lTmp.Join(l->b,l->a,xa,xb,x,l->b,l->a,l->info,SELECTRAKE);\n\t\t\t\t\tif(ya==yb)rTmp=r->info;\n\t\t\t\t\telse rTmp.Join(r->a,r->b,yb,ya,y,r->a,r->b,r->info,SELECTRAKE);\n\t\t\t\t\tif(m){\n\t\t\t\t\t\tInfo mTmp(l->a,l->b);\n\t\t\t\t\t\tmTmp.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,lTmp,RAKE);\n\t\t\t\t\t\tbool s=Info::Select(l->a,l->b,mTmp,r->a,r->b,rTmp,COMPRESS);\n\t\t\t\t\t\tif(s){\n\t\t\t\t\t\t\txa=l->a,xb=l->b,x=mTmp;\n\t\t\t\t\t\t\treturn r;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tmTmp=Info(m->a,m->b);\n\t\t\t\t\t\t\tmTmp.Join(m->a,m->b,r->b,r->a,rTmp,m->a,m->b,m->info,RAKE);\n\t\t\t\t\t\t\ts=Info::Select(m->a,m->b,mTmp,l->a,l->b,lTmp,RAKE);\n\t\t\t\t\t\t\tif(s){\n\t\t\t\t\t\t\t\tya=m->b,yb=m->a,y=mTmp;\n\t\t\t\t\t\t\t\treturn l;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tInfo lrTmp(r->b,r->a);\n\t\t\t\t\t\t\t\tlrTmp.Join(r->b,r->a,l->a,l->b,lTmp,r->b,r->a,rTmp,RAKE);\n\t\t\t\t\t\t\t\txa=m->a,xb=m->a,x=Info(-1,-1),ya=r->a,yb=r->b,y=lrTmp;\n\t\t\t\t\t\t\t\treturn m;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tbool s=Info::Select(l->a,l->b,lTmp,r->a,r->b,rTmp,COMPRESS);\n\t\t\t\t\t\tif(s){\n\t\t\t\t\t\t\txa=l->a,xb=l->b,x=lTmp;\n\t\t\t\t\t\t\treturn r;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tya=r->a,yb=r->b,y=rTmp;\n\t\t\t\t\t\t\treturn l;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else if(type==RAKE){\n\t\t\t\t\tInfo w(l->a,l->b);\n\t\t\t\t\tif(ya==yb)w=l->info;\n\t\t\t\t\telse w.Join(l->a,l->b,yb,ya,y,l->a,l->b,l->info,SELECTRAKE);\n\t\t\t\t\tbool s=Info::Select(l->a,l->b,w,r->a,r->b,r->info,RAKE);\n\t\t\t\t\tif(s){\n\t\t\t\t\t\txa=r->a,xb=r->a,x=Info(-1,-1),ya=l->b,yb=l->a,y=w;\n\t\t\t\t\t\treturn r;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tw=Info(r->a,r->b);\n\t\t\t\t\t\tif(ya==yb)w=r->info;\n\t\t\t\t\t\telse w.Join(r->a,r->b,yb,ya,y,r->a,r->b,r->info,RAKE);\n\t\t\t\t\t\txa=l->a,xb=l->a,x=Info(-1,-1),ya=r->b,yb=r->a,y=w;\n\t\t\t\t\t\treturn l;\n\t\t\t\t\t}\n\t\t\t\t}else if(type==HARDRAKE){\n\t\t\t\t\tint la=l->a,lb=l->b;\n\t\t\t\t\tint ra=r->a,rb=r->b;\n\t\t\t\t\tif(la==ra||la==rb)swap(la,lb);\n\t\t\t\t\tif(lb==ra)swap(ra,rb);\n\t\t\t\t\tInfo lTmp(la,lb),rTmp(ra,rb);\n\t\t\t\t\tif(ya==yb)lTmp=l->info;\n\t\t\t\t\telse lTmp.Join(la,lb,yb,ya,y,la,lb,l->info,SELECTRAKE);\n\t\t\t\t\tif(xa==xb)rTmp=r->info;\n\t\t\t\t\telse rTmp.Join(rb,ra,xa,xb,x,rb,ra,r->info,SELECTRAKE);\n\t\t\t\t\tbool s=Info::Select(la,lb,lTmp,ra,rb,rTmp,RAKE);\n\t\t\t\t\tif(s){\n\t\t\t\t\t\tif(ra==r->a){\n\t\t\t\t\t\t\tya=lb,yb=la,y=lTmp;\n\t\t\t\t\t\t\treturn r;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tya=xb,yb=xa,y=x;\n\t\t\t\t\t\t\txa=la,xb=lb,x=lTmp;\n\t\t\t\t\t\t\treturn r;\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tlTmp=Info(ra,rb);\n\t\t\t\t\t\tif(ya==yb)lTmp=rTmp;\n\t\t\t\t\t\telse lTmp.Join(ra,rb,yb,ya,y,ra,rb,rTmp,RAKE);\n\t\t\t\t\t\tif(la==l->a){\n\t\t\t\t\t\t\txa=la,xb=la,x=Info(-1,-1),ya=rb,yb=ra,y=lTmp;\n\t\t\t\t\t\t\treturn l;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\txa=ra,xb=rb,x=lTmp,ya=la,yb=la,y=Info(-1,-1);\n\t\t\t\t\t\t\treturn l;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tassert(false);\n\t\t}\n\t\tint Pos(){\n\t\t\tCluster *x=p;\n\t\t\tif(!x)return 0;\n\t\t\telse if(x->l==this)return -1;\n\t\t\telse if(x->r==this)return 1;\n\t\t\telse if(x->m==this)return -2;\n\t\t\tassert(false);\n\t\t}\n\t\tbool LinkedToParent(){\n\t\t\treturn p&&(p->type!=type||p->m==this);\n\t\t}\n\t\tvoid Rotate(){\n\t\t\tCluster *q=p,*c;\n\t\t\tif(Pos()==1){\n\t\t\t\tc=l;\n\t\t\t\tl=q;\n\t\t\t\tq->r=c; \n\t\t\t}else{\n\t\t\t\tc=r;\n\t\t\t\tr=q;\n\t\t\t\tq->l=c;\n\t\t\t}\n\t\t\tif(c){\n\t\t\t\tif(c->p)c->p=q;\n\t\t\t}\n\t\t\tint w=p->Pos();\n\t\t\tp=p->p;\n\t\t\tq->p=this;\n\t\t\tCluster *x=p;\n\t\t\tif(x){\n\t\t\t\tif(w==1)x->r=this;\n\t\t\t\telse if(w==-1)x->l=this;\n\t\t\t\telse if(w==-2)x->m=this;\n\t\t\t}\n\t\t\tq->Update();\n\t\t}\n\t\tvoid Splay(Cluster* guard){\n\t\t\twhile(p&&p!=guard&&!LinkedToParent()){\n\t\t\t\tCluster *q=p->p;\n\t\t\t\tif(q&&q!=guard&&!p->LinkedToParent()){\n\t\t\t\t\tif(Pos()==p->Pos()){\n\t\t\t\t\t\tp->Rotate();\n\t\t\t\t\t}else{\n\t\t\t\t\t\tRotate();\n\t\t\t\t\t}\n\t\t\t\t\tRotate();\n\t\t\t\t}else{\n\t\t\t\t\tRotate();\n\t\t\t\t}\n\t\t\t}\n\t\t\tUpdate();\n\t\t}\n\t\tvoid Destroy(){\n\t\t\tinfo.Destroy(a,b);\n\t\t}\n\t};\n\tvector<Cluster*> handles;\n\tvector<Cluster> clusterBuf;\n\tvi ptrBuf;\n\tvi deg;\n\tvector<Cluster*> hardRakeClusters,needUpdateClusters;\n\tCluster* selectRoot;\n\tTopTree(){}\n\tTopTree(int n){\n\t\tInit(n);\n\t}\n\tint vertNum,edgeNum;\n\tvoid Init(int n){\n\t\tint s=n*2+10;\n\t\tclusterBuf=vector<Cluster>(s,Cluster(this));\n\t\tREP(i,s)ptrBuf.PB(i);\n\t\tdeg=vi(n,0);\n\t\thandles=vector<Cluster*>(n,nullptr);\n\t\tvertNum=n;\n\t\tedgeNum=0;\n\t\tselectRoot=nullptr;\n\t}\n\tCluster* GetNew(){\n\t\tCluster *res=clusterBuf.data()+ptrBuf.back();\n\t\tptrBuf.pop_back();\n\t\tres->Clear();\n\t\treturn res;\n\t}\n\tvoid Recycle(Cluster* ptr){\n\t\tptrBuf.PB(ptr-clusterBuf.data());\n\t}\n\tvoid ClearHardRakeClusters(){\n\t\twhile(!hardRakeClusters.empty()){\n\t\t\tCluster* x=hardRakeClusters.back();\n\t\t\thardRakeClusters.pop_back();\n\t\t\tx->Normalize();\n\t\t\tRecycle(x);\n\t\t}\n\t\twhile(!needUpdateClusters.empty()){\n\t\t\tCluster* x=needUpdateClusters.back();\n\t\t\tneedUpdateClusters.pop_back();\n\t\t\tx->Update();\n\t\t}\n\t}\n\tvoid Rectify(Cluster* x,Cluster* guard){\n\t\tCluster* p=x->p;\n\t\tif(p!=nullptr){\n\t\t\tRectify(p,guard);\n\t\t\tif(p==guard&&p->r==x){\n\t\t\t\tp->Reverse();\n\t\t\t\tp->Normalize();\n\t\t\t}\n\t\t}\n\t\tx->Normalize();\n\t}\n\tCluster* CreateCompressCluster(Cluster*l,Cluster*r,Cluster*m){\n\t\tauto p=GetNew();\n\t\tp->type=COMPRESS;\n\t\tp->l=l;\n\t\tl->p=p;\n\t\tp->r=r;\n\t\tr->p=p;\n\t\tp->m=m;\n\t\tif(m){\n\t\t\tm->p=p;\n\t\t}\n\t\tp->Update();\n\t\treturn p;\n\t}\n\tCluster* CreateRakeCluster(Cluster*l,Cluster*r){\n\t\tif(!l)return r;\n\t\tif(!r)return l;\n\t\tauto p=GetNew();\n\t\tp->type=RAKE;\n\t\tp->l=l;\n\t\tl->p=p;\n\t\tp->r=r;\n\t\tr->p=p;\n\t\tp->Update();\n\t\treturn p;\n\t}\n\tCluster* CreateHardRakeCluster(Cluster*l,Cluster*r){\n\t\tif(!l)return r;\n\t\tauto p=GetNew();\n\t\thardRakeClusters.PB(p);\n\t\tp->type=HARDRAKE;\n\t\tp->l=l;\n\t\tp->r=r;\n\t\tp->Update();\n\t\treturn p;\n\t}\n\tvoid SoftExpose(int v,Cluster* guard){\n\t\tif(handles[v]==guard)return;\n\t\tRectify(handles[v],guard);\n\t\tCluster *x=handles[v],*tmp=x;\n\t\tif(x->type==COMPRESS)x->Splay(guard);\n\t\twhile(x->LinkedToParent()){\n\t\t\tCluster* p=x->p;\n\t\t\tif(p->type==RAKE){\n\t\t\t\tp->Splay(nullptr);\n\t\t\t\tif(x->p!=p)\n\t\t\t\t\tx->p->Splay(p);\n\t\t\t\tx=p;\n\t\t\t}\n\t\t\tx=x->p;\n\t\t\tx->Splay(guard);\n\t\t}\n\t\tx=tmp;\n\t\twhile(x->LinkedToParent()){\n\t\t\tCluster* m=nullptr;\n\t\t\tCluster* y=x->p;\n\t\t\tif(y->type==RAKE){\n\t\t\t\tCluster*p=x->p;\n\t\t\t\tif(x->Pos()<0){\n\t\t\t\t\tm=p->r;\n\t\t\t\t}else{\n\t\t\t\t\tm=p->l;\n\t\t\t\t}\n\t\t\t\ty=p->p;\n\t\t\t\tif(y->type==RAKE){\n\t\t\t\t\tCluster*q=p->p;\n\t\t\t\t\tif(p->Pos()<0){\n\t\t\t\t\t\tm=CreateRakeCluster(m,q->r);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tm=CreateRakeCluster(m,q->l);\n\t\t\t\t\t}\n\t\t\t\t\ty=q->p;\n\t\t\t\t\tRecycle(q);\n\t\t\t\t}\n\t\t\t\tRecycle(p);\n\t\t\t}\n\t\t\tm=CreateRakeCluster(m,y->l);\n\t\t\ty->l->UpdateHandles();\n\t\t\ty->l=x;\n\t\t\tx->p=y;\n\t\t\ty->m=m;\n\t\t\tm->p=y;\n\t\t\ty->Update();\n\t\t\tx=y;\n\t\t}\n\t\tif(tmp->type==BASE)tmp=tmp->p;\n\t\tif(tmp){\n\t\t\ttmp->Splay(guard);\n\t\t}\n\t\tif(guard)guard->Update();\n\t}\n\tbool SoftExpose(int a,int b){\n\t\tif(deg[b]==0){\n\t\t\treturn false;\n\t\t}else if(deg[a]==0){\n\t\t\tSoftExpose(b,nullptr);\n\t\t\tif(handles[b]->a==b){\n\t\t\t\thandles[b]->Reverse();\n\t\t\t\thandles[b]->Normalize();\n\t\t\t}\n\t\t\treturn false;\n\t\t}else if(deg[b]==1){\n\t\t\tSoftExpose(b,nullptr);\n\t\t\tif(handles[b]->a==b){\n\t\t\t\thandles[b]->Reverse();\n\t\t\t\thandles[b]->Normalize();\n\t\t\t}\n\t\t\tSoftExpose(a,nullptr);\n\t\t\tif(handles[a]==handles[b]){\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\tif(handles[a]->a==a){\n\t\t\t\t\thandles[a]->Reverse();\n\t\t\t\t\thandles[a]->Normalize();\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}else{\n\t\t\tSoftExpose(b,nullptr);\n\t\t\tSoftExpose(a,handles[b]);\n\t\t\tif(handles[a]==handles[b]){\n\t\t\t\tif(handles[a]->b==a){\n\t\t\t\t\thandles[a]->Reverse();\n\t\t\t\t\thandles[a]->Normalize();\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}else if(handles[a]==handles[b]->l){\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\tif(handles[a]->a==a){\n\t\t\t\t\thandles[a]->Reverse();\n\t\t\t\t\thandles[a]->Normalize();\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\tvoid SoftExpose(int v){\n\t\tif(deg[v]==0){\n\t\t\t//do nothing\n\t\t}else{\n\t\t\tSoftExpose(v,nullptr);\n\t\t\tif(handles[v]->a==v){\n\t\t\t\thandles[v]->Reverse(); \n\t\t\t\thandles[v]->Normalize();\n\t\t\t}\n\t\t}\n\t}\n\tCluster* HardExpose(int a,int b){\n\t\tif(deg[b]==1){\n\t\t\treturn handles[a];\n\t\t}else if(deg[a]==1){\n\t\t\tneedUpdateClusters.PB(handles[b]);\n\t\t\tauto x=handles[b]->l;\n\t\t\tx=CreateHardRakeCluster(handles[b]->m,x);\n\t\t\tx=CreateHardRakeCluster(handles[b]->r,x);\n\t\t\treturn x;\n\t\t}else{\n\t\t\tneedUpdateClusters.PB(handles[b]);\n\t\t\tneedUpdateClusters.PB(handles[a]);\n\t\t\tauto x=handles[a]->r;\n\t\t\tx=CreateHardRakeCluster(handles[a]->l,x);\n\t\t\tx=CreateHardRakeCluster(handles[a]->m,x);\n\t\t\tx=CreateHardRakeCluster(handles[b]->m,x);\n\t\t\tx=CreateHardRakeCluster(handles[b]->r,x);\n\t\t\treturn x;\n\t\t}\n\t}\n\tCluster* HardExpose(int v){\n\t\treturn HardExpose(handles[v]->a,v);\n\t}\n\tCluster* ExposePath(int a,int b){\n\t\tassert(!selectRoot);\n\t\tClearHardRakeClusters();\n\t\tif(deg[a]>deg[b])swap(a,b);\n\t\tbool connected=SoftExpose(a,b);\n\t\tif(!connected)return nullptr;\n\t\treturn HardExpose(a,b);\n\t}\n\tInfo* Expose(int a,int b){\n\t\t//cerr<<\"expose \"<<a<<\" \"<<b<<endl;\n\t\tif(a==b)return Expose(a);\n\t\tCluster*x=ExposePath(a,b);\n\t\tif(x)return &(x->info);\n\t\telse return nullptr;\n\t}\n\tCluster* ExposeVertex(int v){\n\t\tassert(!selectRoot);\n\t\tClearHardRakeClusters();\n\t\tSoftExpose(v);\n\t\tif(deg[v]==0)return nullptr;\n\t\treturn HardExpose(v);\n\t}\n\tInfo* Expose(int v){\n\t\t//cerr<<\"expose \"<<v<<endl;\n\t\tCluster*x=ExposeVertex(v);\n\t\tif(x)return &(x->info);\n\t\telse return nullptr;\n\t}\n\tbool Connected(int a,int b){\n\t\t//cerr<<\"connected \"<<a<<\" \"<<b<<endl;\n\t\tassert(!selectRoot);\n\t\tClearHardRakeClusters();\n\t\tif(deg[a]>deg[b])swap(a,b);\n\t\treturn SoftExpose(a,b);\n\t}\n\ttemplate <class... Args>\n\tbool Link(int a,int b,Args... args){\n\t\tassert(!selectRoot);\n\t\tClearHardRakeClusters();\n\t\tif(deg[a]>deg[b])swap(a,b);\n\t\t//cerr<<\"link \"<<a<<\" \"<<b<<endl;\n\t\tbool connected=SoftExpose(a,b);\n\t\tif(connected)return false;\n\t\tCluster* u=handles[a],*v=handles[b];\n\t\tCluster* x=GetNew();\n\t\tx->type=BASE;\n\t\tx->a=a;\n\t\tx->b=b;\n\t\tx->info=Info(a,b);\n\t\tx->info.Create(a,b,args...);\n\t\tx->UpdateHandles();\n\t\tCluster* y=nullptr;\n\t\tif(deg[a]==0){\n\t\t\ty=x;\n\t\t}else if(deg[a]==1){\n\t\t\ty=CreateCompressCluster(u,x,nullptr);\n\t\t}else{\n\t\t\tu->r->Reverse();\n\t\t\tu->r->UpdateHandles();\n\t\t\ty=CreateCompressCluster(u->l,x,CreateRakeCluster(u->r,u->m));\n\t\t\tRecycle(u);\n\t\t}\n\t\tif(deg[b]==0){\n\t\t}else if(deg[b]==1){\n\t\t\tv->Reverse();\n\t\t\tv->Normalize();\n\t\t\tCreateCompressCluster(y,v,nullptr);\n\t\t}else{\n\t\t\tv->l->UpdateHandles();\n\t\t\tCreateCompressCluster(y,v->r,CreateRakeCluster(v->m,v->l));\n\t\t\tRecycle(v);\n\t\t}\n\t\tdeg[a]++;\n\t\tdeg[b]++;\n\t\tedgeNum++;\n\t\treturn true;\n\t}\n\tpair<Cluster*,Cluster*> SplitMiddleChild(Cluster*x){\n\t\tif(x->type!=RAKE)return MP(x,nullptr);\n\t\twhile(x->type==RAKE)x=x->l;\n\t\tx->p->Splay(nullptr);\n\t\tCluster* tmp=x->p;\n\t\tpair<Cluster*,Cluster*> res=MP(tmp->l,tmp->r);\n\t\tRecycle(tmp);\n\t\treturn res;\n\t}\n\tbool Cut(int a,int b){\n\t\tassert(!selectRoot);\n\t\tClearHardRakeClusters();\n\t\tif(deg[a]>deg[b])swap(a,b);\n\t\t//cerr<<\"cut \"<<a<<\" \"<<b<<endl;\n\t\tbool connected=SoftExpose(a,b);\n\t\tif(!connected)return false;\n\t\tCluster *u=handles[a],*v=handles[b];\n\t\tif(deg[b]==1){\n\t\t\tif(u->type!=BASE)return false;\n\t\t\tu->Destroy();\n\t\t\tRecycle(u);\n\t\t\thandles[a]=nullptr;\n\t\t\thandles[b]=nullptr;\n\t\t}else if(deg[a]==1){\n\t\t\tif(v->l->type!=BASE)return false;\n\t\t\tif(deg[b]==2){\n\t\t\t\tv->r->p=nullptr;\n\t\t\t\tv->r->UpdateHandles();\n\t\t\t}else{\n\t\t\t\tpair<Cluster*,Cluster*> z=SplitMiddleChild(v->m);\n\t\t\t\tCreateCompressCluster(z.first,v->r,z.second);\n\t\t\t}\n\t\t\tv->l->Destroy();\n\t\t\tRecycle(v->l);\n\t\t\tRecycle(v);\n\t\t\thandles[a]=nullptr;\n\t\t}else{\n\t\t\tif(u->r->type!=BASE)return false;\n\t\t\tif(deg[a]==2){\n\t\t\t\tu->l->p=nullptr;\n\t\t\t\tu->l->UpdateHandles();\n\t\t\t}else{\n\t\t\t\tpair<Cluster*,Cluster*> z=SplitMiddleChild(u->m);\n\t\t\t\tz.first->Reverse();\n\t\t\t\tCreateCompressCluster(u->l,z.first,z.second);\n\t\t\t}\n\t\t\tif(deg[b]==2){\n\t\t\t\tv->r->p=nullptr;\n\t\t\t\tv->r->UpdateHandles();\n\t\t\t}else{\n\t\t\t\tpair<Cluster*,Cluster*> z=SplitMiddleChild(v->m);\n\t\t\t\tCreateCompressCluster(z.first,v->r,z.second);\n\t\t\t}\n\t\t\tu->r->Destroy();\n\t\t\tRecycle(u->r);\n\t\t\tRecycle(u);\n\t\t\tRecycle(v);\n\t\t}\n\t\tdeg[a]--;\n\t\tdeg[b]--;\n\t\tedgeNum--;\n\t\treturn true;\n\t}\n\tInfo* PrepareForSelect(int a,int b){\n\t\t//cerr<<\"prepare \"<<a<<\" \"<<b<<endl;\n\t\tif(a==b)return PrepareForSelect(a);\n\t\tselectRoot=ExposePath(a,b);\n\t\tif(selectRoot==nullptr)return nullptr;\n\t\treturn &(selectRoot->info);\n\t}\n\tInfo* PrepareForSelect(int v){\n\t\t//cerr<<\"prepare \"<<v<<endl;\n\t\tselectRoot=ExposeVertex(v);\n\t\tif(selectRoot==nullptr)return nullptr;\n\t\treturn &(selectRoot->info);\n\t}\n\tInfo* Select(){\n\t\tassert(selectRoot);\n\t\tassert(!selectRoot->p);\n\t\tCluster* cur=selectRoot;\n\t\tint xa=cur->a,xb=xa,ya=cur->b,yb=ya;\n\t\tInfo x(-1,-1),y(-1,-1);\n\t\twhile(1){\n\t\t\tCluster*nx=cur->Select(xa,xb,x,ya,yb,y);\n\t\t\tif(nx==cur)break;\n\t\t\tcur=nx;\n\t\t}\n\t\tselectRoot=nullptr;\n\t\treturn Expose(cur->a,cur->b);\n\t}\n\tint NumofVertices(){\n\t\treturn vertNum;\n\t}\n\tint NumofEdges(){\n\t\treturn edgeNum;\n\t}\n};\n\nstruct InfoBase{\n\tprivate:\n\tint vert[2];\n\tvoid SetVertex(int a,int b){\n\t\tvert[0]=a;\n\t\tvert[1]=b;\n\t}\n\tpublic:\n\tInfoBase(int a,int b){\n\t\tSetVertex(a,b);\n\t}\n\tinline int idx(int v){\n\t\tif(vert[0]==v)return 0;\n\t\tif(vert[1]==v)return 1;\n\t\tassert(false);\n\t}\n\tinline int another(int v){\n\t\tif(vert[0]==v)return vert[1];\n\t\tif(vert[1]==v)return vert[0];\n\t\tassert(false);\n\t}\n\tinline int v0(){\n\t\treturn vert[0];\n\t}\n\tinline int v1(){\n\t\treturn vert[1];\n\t}\n};\n\nconst int Nmax=100010;\nll w[Nmax];\n\nstruct Info:InfoBase{\n\tll sum,_es[2],mx;\n\tll&es(int x){\n\t\treturn _es[idx(x)];\n\t}\n\tInfo(int a,int b):InfoBase(a,b){}\n\tvoid Join(int a,int b,int la,int lb,Info&l,int ra,int rb,Info&r,ClusterType type){\n\t\t//(another(a)==b);\n\t\t//(another(b)==a);\n\t\tif(type==RAKE){\n\t\t\t//(a==ra);\n\t\t\t//(b==rb);\n\t\t\t//(lb==rb);\n\t\t\tsum=l.sum+r.sum-w[b];\n\t\t\tes(a)=r.es(a);\n\t\t\tes(b)=r.es(b)+l.sum-w[b];\n\t\t\tmx=max({l.mx,r.mx,l.sum-w[b]-l.es(b)});\n\t\t}else if(type==SELECTRAKE){\n\t\t\t//(a==ra);\n\t\t\t//(b==rb);\n\t\t\t//(lb==rb);\n\t\t}else if(type==COMPRESS){\n\t\t\t//(a==la);\n\t\t\t//(lb==ra);\n\t\t\t//(rb==b);\n\t\t\tsum=l.sum+r.sum-w[lb];\n\t\t\tes(a)=l.es(a);\n\t\t\tes(b)=r.es(b);\n\t\t\tmx=max(l.mx,r.mx);\n\t\t}\n\t}\n\tvoid Create(int a,int b){\n\t\t//(another(a)==b);\n\t\t//(another(b)==a);\n\t\tsum=w[a]+w[b];\n\t\tes(a)=es(b)=0;\n\t\tmx=0;\n\t}\n\tvoid Split(int a,int b,int la,int lb,Info&l,int ra,int rb,Info&r,ClusterType type){\n\t\t//(another(a)==b);\n\t\t//(another(b)==a);\n\t\tif(type==RAKE){\n\t\t\t//(a==ra);\n\t\t\t//(b==rb);\n\t\t\t//(lb==rb);\n\t\t}else if(type==COMPRESS){\n\t\t\t//(a==la);\n\t\t\t//(lb==ra);\n\t\t\t//(rb==b);\n\t\t}\n\t}\n\tvoid Destroy(int a,int b){\n\t\t//(another(a)==b);\n\t\t//(another(b)==a);\n\t}\n\tstatic bool Select(int la,int lb,Info l,int ra,int rb,Info r,ClusterType type){\n\t\tif(type==RAKE){\n\t\t\t//(lb==rb);\n\t\t}else if(type==COMPRESS){\n\t\t\t//(lb==ra);\n\t\t}\n\t}\n};\n\nsigned main(){\n\tint n=read();\n\tREP(i,n)w[i]=read();\n\tTopTree<Info> tree(n);\n\tREP(i,n-1){\n\t\tint a=read()-1,b=read()-1;\n\t\ttree.Link(a,b);\n\t}\n\tint q=read();\n\tREP(i,q){\n\t\tint a=read()-1,b=read()-1;\n\t\tauto info=tree.Expose(a,b);\n\t\tprint(info->mx);\n\t}\n}","accuracy":1,"time_ms":460,"memory_kb":39788,"score_of_the_acc":-1.1192,"final_rank":16},{"submission_id":"aoj_3037_2744743","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define N 100005\nusing namespace std;\n\ntypedef pair<int,int> P;\n\nclass LCA{\npublic:\n int LOG_V=30; //log V (自分で決めて)\n int V; //言わずもがな頂点数\n vector<vector<int> > G; //グラフの隣接リストの表現\n int root; //根のノード番号\n vector<vector<int> > parent; //親を2^k回辿って到達する頂点(根を通りすぎる場合は-1とする)\n vector<int> depth; //根からの深さ\n int ok;\n \n LCA():V(-1){}\n LCA(int V,int root = 0):V(V),G(V),root(root),parent(LOG_V,vector<int>(V)),depth(V),ok(0){}\n \n void add_edge(int a, int b){\n assert(a < V && b < V);\n G[a].push_back(b);\n G[b].push_back(a);\n }\n \n void dfs(int v,int p,int d){\n assert(v < V);\n parent[0][v] = p;\n depth[v] = d;\n for(int to:G[v]) if(to != p) dfs(to,v,d+1);\n }\n \n //初期化\n void init(){\n ok = 1;\n //parent[0]とdepthを初期化する。\n dfs(root,-1,0);\n //parentを初期化する\n for(int k=0; k+1<LOG_V ;k++)\n for(int v=0; v<V ;v++)\n if(parent[k][v] < 0)parent[k+1][v] = -1;\n else parent[k+1][v] = parent[k][parent[k][v]];\n }\n \n //uとvのLCAを求める\n int lca(int u,int v){\n assert(ok);\n assert(u < V && v < V);\n //uとvの深さが同じになるまで親を辿る\n if(depth[u]>depth[v]) swap(u,v);\n \n for(int k=0; k<LOG_V ;k++)\n if((depth[v]-depth[u])>>k&1)v=parent[k][v];\n \n vector<int> res;\n \n if(u==v) return u;\n \n //二分探索でLCAを求める\n for(int k=LOG_V-1; k>=0 ;k--)\n if(parent[k][u] != parent[k][v]){\n u=parent[k][u];\n v=parent[k][v];\n }\n \n res.push_back(u);\n res.push_back(v);\n\t\n return parent[0][u];\n } \n \n};\n\nint n, w[N], W, cost[30][N];\nvector<int> G[N];\nvector<P> maxw[N];\n\nint dfs(int x, int pre){\n \n int res = 0;\n \n priority_queue<P> q;\n\n for(int i=0;i<G[x].size();i++){\n \n int nx = G[x][i];\n \n if( nx == pre ) continue;\n \n int v = dfs(nx ,x);\n \n q.push( P( v , nx ) );\n res += v;\n }\n \n res += w[x];\n \n if( x != 0 ) q.push( P( W - res , pre ) );\n \n for(int i=0;i<3;i++){\n \n if(q.empty()) break;\n \n maxw[x].push_back(q.top());\n \n q.pop();\n }\n \n for(int i=0;i<G[x].size();i++){\n \n int nx = G[x][i];\n \n if( nx == pre ) continue;\n \n for(int j=0;j<maxw[x].size();j++){\n\n int c = maxw[x][j].first;\n int node = maxw[x][j].second;\n \n if( node == pre || node == nx ) continue;\n \n cost[0][nx] = max( cost[0][nx] , c );\n }\n }\n \n return res;\n}\n\nLCA lca;\n\nint get_anc(int node, int x){\n\n for(int i=0;i<30;i++)\n \n if(x>>i&1)\n node = lca.parent[i][node];\n \n return node;\n}\n\nvoid solve(){\n \n for(int i=0;i<n;i++) W+=w[i];\n \n dfs(0, -1);\n \n for(int i=0;i<29;i++){\n \n for(int j=0;j<n;j++){\n \n int par = lca.parent[i][j];\n \n if( par >= 0 ) cost[i+1][j] = max( cost[i][j], cost[i][par] );\n \n }\n \n }\n \n int q;\n cin>>q;\n \n while(q--){\n \n int a, b;\n cin>>a>>b;\n a--, b--;\n \n int lca_ = lca.lca(a, b);\n \n int a1=-1, a2=-1, b1=-1, b2=-1;\n \n if( lca.depth[lca_] + 1 <= lca.depth[a] )\n a1 = get_anc( a, lca.depth[a]-lca.depth[lca_]-1 );\n \n if( lca.depth[lca_] + 2 <= lca.depth[a] )\n a2 = get_anc( a, lca.depth[a]-lca.depth[lca_]-2 );\n \n if( lca.depth[lca_] + 1 <= lca.depth[b] )\n b1 = get_anc( b, lca.depth[b]-lca.depth[lca_]-1 );\n \n if( lca.depth[lca_] + 2 <= lca.depth[b] )\n b2 = get_anc( b, lca.depth[b]-lca.depth[lca_]-2 );\n \n int ans = 0;\n \n for(int i=0;i<maxw[lca_].size();i++){\n \n int c = maxw[lca_][i].first;\n int node = maxw[lca_][i].second;\n \n if( node == a1 || node == b1 ) continue;\n \n ans = max( ans , c );\n }\n\n for(int i=0;i<maxw[a].size();i++){\n\n if(a==lca_) break;\n \n int c = maxw[a][i].first;\n int node = maxw[a][i].second;\n \n if( node == lca.parent[0][a] ) continue;\n \n ans = max( ans , c );\n }\n\n for(int i=0;i<maxw[b].size();i++){\n\n if(b==lca_) break;\n \n int c = maxw[b][i].first;\n int node = maxw[b][i].second;\n \n if( node == lca.parent[0][b] ) continue;\n \n ans = max( ans , c );\n }\n \n if( a2 != -1 ){\n \n int x = a, d = lca.depth[a] - lca.depth[a2];\n \n for(int i=0;i<30;i++){\n\t\n\tif(d>>i&1){\n\t ans = max( ans, cost[i][x] );\n\t x = lca.parent[i][x];\n\t}\n }\n \n ans = max( ans, cost[0][x] );\n }\n\n if( b2 != -1 ){\n \n int x = b, d = lca.depth[b] - lca.depth[b2];\n \n for(int i=0;i<30;i++){\n\t\n\tif(d>>i&1){\n\t ans = max( ans, cost[i][x] );\n\t x = lca.parent[i][x];\n\t}\n }\n \n ans = max( ans, cost[0][x] );\n }\n \n cout<<ans<<endl;\n }\n \n}\n\nsigned main(){\n \n cin>>n;\n \n for(int i=0;i<n;i++) cin>>w[i];\n \n lca = LCA(n);\n \n for(int i=0;i<n-1;i++){\n int u, v;\n cin>>u>>v;\n G[u-1].push_back(v-1);\n G[v-1].push_back(u-1);\n lca.add_edge(u-1, v-1);\n }\n \n lca.init();\n \n solve();\n \n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":51752,"score_of_the_acc":-1.0955,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_3037_10422763\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst long long LOG = 20;\\n\\nstruct Node {\\n long long m1, m2, m3;\\n};\\n\\nvector<vector<long long>> parent, max_up;\\nvector<long long> p, par, glub, maxb;\\nvector<Node> mxs;\\n\\nvoid dfs(long long v, long long PRED, vector<vector<long long>> &g, vector<long long> &a) {\\n par[v] = PRED;\\n p[v] += a[v];\\n multiset<long long> st;\\n for (auto i: g[v]) {\\n if (i != PRED) dfs(i, v, g, a);\\n if (i != PRED) p[v] += p[i];\\n if (i != PRED) st.insert(p[i]);\\n while (st.size() >= 4) st.erase(st.begin());\\n }\\n while (st.size() != 3) st.insert(0);\\n Node o;\\n o.m3 = *st.begin();\\n st.erase(st.begin());\\n o.m2 = *st.begin();\\n st.erase(st.begin());\\n o.m1 = *st.begin();\\n st.erase(st.begin());\\n mxs[v] = o;\\n}\\n\\nvoid dfs2(long long u, long long p, vector<vector<long long>> &g) {\\n parent[u][0] = p;\\n glub[u] = 0;\\n glub[u] = glub[p] + 1;\\n max_up[u][0] = max(maxb[u], maxb[p]);\\n for (long long i = 1; i < LOG; ++i) {\\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\\n }\\n for (long long v: g[u]) {\\n if (v != p) {\\n dfs2(v, u, g);\\n }\\n }\\n}\\n\\nlong long lca(long long u, long long v) {\\n if (glub[u] < glub[v]) swap(u, v);\\n for (long long i = LOG - 1; i >= 0; --i) {\\n if (glub[u] - (1 << i) >= glub[v]) {\\n u = parent[u][i];\\n }\\n }\\n if (u == v) return u;\\n for (long long i = LOG - 1; i >= 0; --i) {\\n if (parent[u][i] != parent[v][i]) {\\n u = parent[u][i];\\n v = parent[v][i];\\n }\\n }\\n return parent[u][0];\\n}\\n\\nlong long p_on_s(long long v, long long s) {\\n for (long long i = LOG; i >= 0; i--) {\\n if ((1 << i) <= s) {\\n v = parent[v][i];\\n s -= (1 << i);\\n }\\n }\\n return v;\\n}\\n\\nlong long GET(long long u, long long v) {\\n long long ancestor = lca(u, v);\\n long long max_val = 0;\\n for (long long i = LOG - 1; i >= 0; --i) {\\n if (glub[u] - (1 << i) >= glub[ancestor]) {\\n max_val = max(max_val, max_up[u][i]);\\n u = parent[u][i];\\n }\\n }\\n max_val = max(max_val, maxb[u]);\\n for (long long i = LOG - 1; i >= 0; --i) {\\n if (glub[v] - (1 << i) >= glub[ancestor]) {\\n max_val = max(max_val, max_up[v][i]);\\n v = parent[v][i];\\n }\\n }\\n max_val = max(max_val, maxb[v]);\\n return max_val;\\n}\\n\\nsigned main() {\\n long long n;\\n cin >> n;\\n vector<long long> a(n);\\n for (long long i = 0; i < n; i++) cin >> a[i];\\n long long FULL = 0;\\n for (auto i: a) FULL += i;\\n vector<vector<long long>> g(n);\\n for (long long i = 0; i < n - 1; i++) {\\n long long X, Y;\\n cin >> X >> Y;\\n X--;\\n Y--;\\n g[X].push_back(Y);\\n g[Y].push_back(X);\\n }\\n p.resize(n, 0);\\n par.resize(n, 0);\\n mxs.resize(n, {0, 0});\\n dfs(0, -1, g, a);\\n maxb.resize(n, 0);\\n parent.resize(n, vector<long long>(LOG));\\n max_up.resize(n, vector<long long>(LOG));\\n glub.resize(n, 0);\\n for (long long i = 1; i < n; i++) {\\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\\n else maxb[i] = mxs[par[i]].m1;\\n }\\n dfs2(0, 0, g);\\n long long q;\\n cin >> q;\\n while (q--) {\\n long long x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n long long z = lca(x, y);\\n if (z == x || z == y) {\\n if (z == y) swap(x, y);\\n cout << max({GET(x, y), FULL - p[z], mxs[y].m1}) << \\\"\\\\n\\\";\\n continue;\\n }\\n long long xx, yy;\\n if (glub[x] - glub[z] == 1) xx = -1;\\n else xx = p_on_s(x, glub[x] - glub[z] - 2);\\n if (glub[y] - glub[z] == 1) yy = -1;\\n else yy = p_on_s(y, glub[y] - glub[z] - 2);\\n long long xxx = p_on_s(x, glub[x] - glub[z] - 1);\\n long long yyy = p_on_s(y, glub[y] - glub[z] - 1);\\n multiset<long long, greater<>> otb;\\n long long getmax_x = 0;\\n long long getmax_y = 0;\\n if (xx != -1) getmax_x = GET(x, xx);\\n if (yy != -1) getmax_y = GET(y, yy);\\n multiset<long long, greater<>> mxs_s;\\n mxs_s.insert(mxs[z].m1);\\n mxs_s.insert(mxs[z].m2);\\n mxs_s.insert(mxs[z].m3);\\n if (mxs_s.find(p[xxx]) != mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\\n if (mxs_s.find(p[yyy]) != mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\\n cout << max({*mxs_s.begin(), getmax_x, getmax_y, mxs[y].m1, mxs[x].m1, FULL - p[lca(x, y)]}) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 54536,\n \"score_of_the_acc\": -0.9413,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3037_10422762\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\n\\nconst int MAXN = 1e5 + 5;\\nconst int LOG = 20;\\n\\nstruct Node {\\n int m1, m2, m3, m4;\\n};\\n\\nvector<int> maxb;\\nint parent[MAXN][LOG];\\nint depth[MAXN];\\nint max_up[MAXN][LOG];\\nvector<int> p, par;\\nvector<Node> mxs;\\n\\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\\n par[v] = PRED;\\n p[v] += a[v];\\n multiset<int> st;\\n for (auto i: g[v]) {\\n if (i != PRED) dfs(i, v, g, a);\\n if (i != PRED) p[v] += p[i];\\n if (i != PRED) st.insert(p[i]);\\n while (st.size() >= 4) st.erase(st.begin());\\n }\\n while (st.size() != 3) st.insert(0);\\n Node o;\\n o.m3 = *st.begin();\\n st.erase(st.begin());\\n o.m2 = *st.begin();\\n st.erase(st.begin());\\n o.m1 = *st.begin();\\n st.erase(st.begin());\\n mxs[v] = o;\\n}\\n\\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\\n parent[u][0] = p;\\n depth[u] = 0;\\n depth[u] = depth[p] + 1;\\n max_up[u][0] = max(maxb[u], maxb[p]);\\n for (int i = 1; i < LOG; ++i) {\\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\\n }\\n for (int v: g[u]) {\\n if (v != p) {\\n dfs2(v, u, g);\\n }\\n }\\n}\\n\\nint lca(int u, int v) {\\n if (depth[u] < depth[v]) swap(u, v);\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[v]) {\\n u = parent[u][i];\\n }\\n }\\n if (u == v) return u;\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (parent[u][i] != parent[v][i]) {\\n u = parent[u][i];\\n v = parent[v][i];\\n }\\n }\\n return parent[u][0];\\n}\\n\\nint p_on_s(int v, int s) {\\n for (int i = LOG; i >= 0; i--) {\\n if ((1 << i) <= s) {\\n v = parent[v][i];\\n s -= (1 << i);\\n }\\n }\\n return v;\\n}\\n\\nint get_max_on_path(int u, int v) {\\n int ancestor = lca(u, v);\\n int max_val = 0;\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[u][i]);\\n u = parent[u][i];\\n }\\n }\\n max_val = max(max_val, maxb[u]);\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[v] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[v][i]);\\n v = parent[v][i];\\n }\\n }\\n max_val = max(max_val, maxb[v]);\\n return max_val;\\n}\\n\\nsigned main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int FULL = 0;\\n for (auto i: a) FULL += i;\\n vector<vector<int>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int X, Y;\\n cin >> X >> Y;\\n X--;\\n Y--;\\n g[X].push_back(Y);\\n g[Y].push_back(X);\\n }\\n p.resize(n, 0);\\n par.resize(n);\\n mxs.resize(n, {0, 0});\\n dfs(0, -1, g, a);\\n maxb.resize(n, 0);\\n for (int i = 1; i < n; i++) {\\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\\n else maxb[i] = mxs[par[i]].m1;\\n }\\n dfs2(0, 0, g);\\n int q;\\n cin >> q;\\n while (q--) {\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n int z = lca(x, y);\\n if(z==x || z==y){\\n if(z==y) swap(x,y);\\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\\\"\\\\n\\\";\\n continue;\\n }\\n int xx,yy;\\n if(depth[x]-depth[z]==1) xx=-1;\\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\\n if(depth[y]-depth[z]==1) yy=-1;\\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\\n\\n multiset<int,greater<>> otb;\\n int getmax_x=0;\\n int getmax_y=0;\\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\\n\\n multiset<int,greater<>> mxs_s;\\n mxs_s.insert(mxs[z].m1);\\n mxs_s.insert(mxs[z].m2);\\n mxs_s.insert(mxs[z].m3);\\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 47612,\n \"score_of_the_acc\": -0.7752,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3037_10422760\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\n\\nconst int MAXN = 1e5 + 5;\\nconst int LOG = 20;\\n\\nstruct Node {\\n int m1, m2, m3, m4;\\n};\\n\\nvector<int> maxb;\\nint parent[MAXN][LOG];\\nint depth[MAXN];\\nint max_up[MAXN][LOG];\\n\\nvector<int> p, par;\\nvector<Node> mxs;\\n\\nNode merge(Node &n1, Node &n2) {\\n vector<int> y;\\n y = {n1.m1, n1.m2, n1.m3, n1.m4, n2.m1, n2.m2, n2.m3, n2.m4};\\n sort(y.rbegin(), y.rend());\\n Node ans;\\n ans.m1 = y[0];\\n ans.m2 = y[1];\\n ans.m3 = y[2];\\n ans.m4 = y[3];\\n return ans;\\n}\\n\\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\\n par[v] = PRED;\\n p[v] += a[v];\\n multiset<int> st;\\n for (auto i: g[v]) {\\n if (i != PRED) dfs(i, v, g, a);\\n if (i != PRED) p[v] += p[i];\\n if (i != PRED) st.insert(p[i]);\\n while (st.size() >= 5) st.erase(st.begin());\\n }\\n while (st.size() != 4) st.insert(0);\\n Node o;\\n o.m4 = *st.begin();\\n st.erase(st.begin());\\n o.m3 = *st.begin();\\n st.erase(st.begin());\\n o.m2 = *st.begin();\\n st.erase(st.begin());\\n o.m1 = *st.begin();\\n st.erase(st.begin());\\n mxs[v] = o;\\n}\\n\\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\\n parent[u][0] = p;\\n depth[u] = 0;\\n depth[u] = depth[p] + 1;\\n max_up[u][0] = max(maxb[u], maxb[p]); // Инициализация для первого предка\\n\\n for (int i = 1; i < LOG; ++i) {\\n //cout<<u<<' '<<i<<\\\"\\\\n\\\";\\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\\n }\\n\\n for (int v: g[u]) {\\n if (v != p) {\\n dfs2(v, u, g);\\n }\\n }\\n}\\n\\nint lca(int u, int v) {\\n if (depth[u] < depth[v]) swap(u, v);\\n\\n // Поднимаем u до уровня v\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[v]) {\\n u = parent[u][i];\\n }\\n }\\n\\n if (u == v) return u;\\n\\n // Поднимаем вместе до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (parent[u][i] != parent[v][i]) {\\n u = parent[u][i];\\n v = parent[v][i];\\n }\\n }\\n\\n return parent[u][0];\\n}\\n\\nint p_on_s(int v, int s) {\\n for (int i = LOG; i >= 0; i--) {\\n if ((1 << i) <= s) {\\n v = parent[v][i];\\n s -= (1 << i);\\n }\\n }\\n return v;\\n}\\n\\nint get_max_on_path(int u, int v) {\\n int ancestor = lca(u, v);\\n int max_val = 0;\\n\\n // Поднимаемся от u до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[u][i]);\\n u = parent[u][i];\\n }\\n }\\n max_val = max(max_val, maxb[u]);\\n\\n // Поднимаемся от v до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[v] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[v][i]);\\n v = parent[v][i];\\n }\\n }\\n max_val = max(max_val, maxb[v]);\\n\\n return max_val;\\n}\\n\\n\\nsigned main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int FULL = 0;\\n for (auto i: a) FULL += i;\\n vector<vector<int>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int X, Y;\\n cin >> X >> Y;\\n X--;\\n Y--;\\n g[X].push_back(Y);\\n g[Y].push_back(X);\\n }\\n p.resize(n, 0);\\n par.resize(n);\\n mxs.resize(n, {0, 0});\\n dfs(0, -1, g, a);\\n maxb.resize(n, 0);\\n for (int i = 1; i < n; i++) {\\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\\n else maxb[i] = mxs[par[i]].m1;\\n }\\n dfs2(0, 0, g);\\n int q;\\n cin >> q;\\n //for (int i = 0; i < n; i++) cout << maxb[i] << \\\"\\\\n\\\";\\n\\n while (q--) {\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n int z = lca(x, y);\\n if(z==x || z==y){\\n if(z==y) swap(x,y);\\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\\\"\\\\n\\\";\\n continue;\\n }\\n int xx,yy;\\n if(depth[x]-depth[z]==1) xx=-1;\\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\\n if(depth[y]-depth[z]==1) yy=-1;\\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\\n\\n multiset<int,greater<>> otb;\\n int getmax_x=0;\\n int getmax_y=0;\\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\\n\\n multiset<int,greater<>> mxs_s;\\n mxs_s.insert(mxs[z].m1);\\n mxs_s.insert(mxs[z].m2);\\n mxs_s.insert(mxs[z].m3);\\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\\\"\\\\n\\\";\\n //cout<<*mxs_s.begin()<<' '<<getmax_x<<' '<<getmax_y<<' '<<mxs[y].m1<<' '<<mxs[x].m1<<' '<<FULL - p[lca(x, y)]<<\\\"\\\\n\\\";\\n// cout << get_max_on_path(x, y) << ' ' << mxs[x].m1 << ' ' << mxs[y].m1 << ' ' << FULL - p[lca(x, y)]\\n// << \\\"\\\\n\\\";\\n// cout << max({get_max_on_path(x, y), mxs[x].m1, mxs[y].m1, FULL - p[lca(x, y)]}) << \\\"\\\\n\\\";\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 47440,\n \"score_of_the_acc\": -0.7731,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3037_10422759\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int MAXN = 1e5 + 5;\\nconst int LOG = 20;\\n\\nstruct Node {\\n int m1, m2, m3, m4;\\n};\\n\\nvector<int> maxb;\\nint parent[MAXN][LOG];\\nint depth[MAXN];\\nint max_up[MAXN][LOG];\\n\\nvector<int> p, par;\\nvector<Node> mxs;\\n\\nNode merge(Node &n1, Node &n2) {\\n vector<int> y;\\n y = {n1.m1, n1.m2, n1.m3, n1.m4, n2.m1, n2.m2, n2.m3, n2.m4};\\n sort(y.rbegin(), y.rend());\\n Node ans;\\n ans.m1 = y[0];\\n ans.m2 = y[1];\\n ans.m3 = y[2];\\n ans.m4 = y[3];\\n return ans;\\n}\\n\\nvoid dfs(int v, int PRED, vector<vector<int>> &g, vector<int> &a) {\\n par[v] = PRED;\\n p[v] += a[v];\\n multiset<int> st;\\n for (auto i: g[v]) {\\n if (i != PRED) dfs(i, v, g, a);\\n if (i != PRED) p[v] += p[i];\\n if (i != PRED) st.insert(p[i]);\\n while (st.size() >= 5) st.erase(st.begin());\\n }\\n while (st.size() != 4) st.insert(0);\\n Node o;\\n o.m4 = *st.begin();\\n st.erase(st.begin());\\n o.m3 = *st.begin();\\n st.erase(st.begin());\\n o.m2 = *st.begin();\\n st.erase(st.begin());\\n o.m1 = *st.begin();\\n st.erase(st.begin());\\n mxs[v] = o;\\n}\\n\\nvoid dfs2(int u, int p, vector<vector<int>> &g) {\\n parent[u][0] = p;\\n depth[u] = 0;\\n depth[u] = depth[p] + 1;\\n max_up[u][0] = max(maxb[u], maxb[p]); // Инициализация для первого предка\\n\\n for (int i = 1; i < LOG; ++i) {\\n //cout<<u<<' '<<i<<\\\"\\\\n\\\";\\n parent[u][i] = parent[parent[u][i - 1]][i - 1];\\n max_up[u][i] = max(max_up[u][i - 1], max_up[parent[u][i - 1]][i - 1]);\\n }\\n\\n for (int v: g[u]) {\\n if (v != p) {\\n dfs2(v, u, g);\\n }\\n }\\n}\\n\\nint lca(int u, int v) {\\n if (depth[u] < depth[v]) swap(u, v);\\n\\n // Поднимаем u до уровня v\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[v]) {\\n u = parent[u][i];\\n }\\n }\\n\\n if (u == v) return u;\\n\\n // Поднимаем вместе до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (parent[u][i] != parent[v][i]) {\\n u = parent[u][i];\\n v = parent[v][i];\\n }\\n }\\n\\n return parent[u][0];\\n}\\n\\nint p_on_s(int v, int s) {\\n for (int i = LOG; i >= 0; i--) {\\n if ((1 << i) <= s) {\\n v = parent[v][i];\\n s -= (1 << i);\\n }\\n }\\n return v;\\n}\\n\\nint get_max_on_path(int u, int v) {\\n int ancestor = lca(u, v);\\n int max_val = 0;\\n\\n // Поднимаемся от u до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[u] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[u][i]);\\n u = parent[u][i];\\n }\\n }\\n max_val = max(max_val, maxb[u]);\\n\\n // Поднимаемся от v до LCA\\n for (int i = LOG - 1; i >= 0; --i) {\\n if (depth[v] - (1 << i) >= depth[ancestor]) {\\n max_val = max(max_val, max_up[v][i]);\\n v = parent[v][i];\\n }\\n }\\n max_val = max(max_val, maxb[v]);\\n\\n return max_val;\\n}\\n\\n\\nsigned main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int FULL = 0;\\n for (auto i: a) FULL += i;\\n vector<vector<int>> g(n);\\n for (int i = 0; i < n - 1; i++) {\\n int X, Y;\\n cin >> X >> Y;\\n X--;\\n Y--;\\n g[X].push_back(Y);\\n g[Y].push_back(X);\\n }\\n p.resize(n, 0);\\n par.resize(n);\\n mxs.resize(n, {0, 0});\\n dfs(0, -1, g, a);\\n maxb.resize(n, 0);\\n for (int i = 1; i < n; i++) {\\n if (mxs[par[i]].m1 == p[i]) maxb[i] = mxs[par[i]].m2;\\n else maxb[i] = mxs[par[i]].m1;\\n }\\n dfs2(0, 0, g);\\n int q;\\n cin >> q;\\n //for (int i = 0; i < n; i++) cout << maxb[i] << \\\"\\\\n\\\";\\n\\n while (q--) {\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n int z = lca(x, y);\\n if(z==x || z==y){\\n if(z==y) swap(x,y);\\n cout<<max({get_max_on_path(x,y),FULL-p[z],mxs[y].m1})<<\\\"\\\\n\\\";\\n continue;\\n }\\n int xx,yy;\\n if(depth[x]-depth[z]==1) xx=-1;\\n else xx = p_on_s(x, depth[x] - depth[z] - 2);\\n if(depth[y]-depth[z]==1) yy=-1;\\n else yy = p_on_s(y, depth[y] - depth[z] - 2);\\n int xxx=p_on_s(x, depth[x] - depth[z] - 1);\\n int yyy=p_on_s(y, depth[y] - depth[z] - 1);\\n\\n multiset<int,greater<>> otb;\\n int getmax_x=0;\\n int getmax_y=0;\\n if(xx!=-1)getmax_x = get_max_on_path(x,xx);\\n if(yy!=-1)getmax_y = get_max_on_path(y,yy);\\n\\n multiset<int,greater<>> mxs_s;\\n mxs_s.insert(mxs[z].m1);\\n mxs_s.insert(mxs[z].m2);\\n mxs_s.insert(mxs[z].m3);\\n if(mxs_s.find(p[xxx])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[xxx]));\\n if(mxs_s.find(p[yyy])!=mxs_s.end()) mxs_s.erase(mxs_s.find(p[yyy]));\\n cout<<max({*mxs_s.begin(),getmax_x,getmax_y,mxs[y].m1,mxs[x].m1,FULL - p[lca(x, y)]})<<\\\"\\\\n\\\";\\n //cout<<*mxs_s.begin()<<' '<<getmax_x<<' '<<getmax_y<<' '<<mxs[y].m1<<' '<<mxs[x].m1<<' '<<FULL - p[lca(x, y)]<<\\\"\\\\n\\\";\\n// cout << get_max_on_path(x, y) << ' ' << mxs[x].m1 << ' ' << mxs[y].m1 << ' ' << FULL - p[lca(x, y)]\\n// << \\\"\\\\n\\\";\\n// cout << max({get_max_on_path(x, y), mxs[x].m1, mxs[y].m1, FULL - p[lca(x, y)]}) << \\\"\\\\n\\\";\\n\\n }\\n}\",\n \"accuracy\": 0.48936170212765956,\n \"time_ms\": 60,\n \"memory_kb\": 22840,\n \"score_of_the_acc\": -0.0833,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3037_7758981\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\ntemplate<typename Vertex, typename Cluster, size_t N>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node(){p=q=nullptr;rev=guard=false;}\\n };\\n\\n inline static array<Vertex, 2*N> pool_vertex;\\n inline static size_t ptr_vertex = 0;\\n\\n inline static array<Node, 4*N> pool_node;\\n inline static size_t ptr_node = 0;\\n\\n Cluster id;\\n\\n template<typename ...Args>\\n inline Vertex* create(Args ...args){\\n auto t=&pool_vertex[ptr_vertex++];\\n auto dummy=&pool_vertex[ptr_vertex++];\\n *t=Vertex(forward<Args>(args)...);\\n link(t,id,dummy);\\n return t;\\n }\\n\\n Node* recycle=nullptr;\\n inline void dispose_node(Node* t){\\n t->p=recycle;\\n recycle=t;\\n }\\n\\n inline Node* get_new_node(){\\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\\n return &(pool_node[ptr_node++]);\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=get_new_node();\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;\\n t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;\\n t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;\\n t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);\\n pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n dispose_node(ll->p);\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n dispose_node(rk);\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n assert(nnv);\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n\\n assert(nnu);\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n assert(rr->ch[1]->type==Type::Edge);\\n dispose_node(rr->ch[1]);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nstruct Vertex{\\n void* handle;\\n ll val;\\n Vertex(ll val=0):handle(nullptr),val(val){}\\n};\\n\\nstruct Cluster{\\n ll sm,md,chd,ma;\\n Cluster():sm(0),md(0),chd(0),ma(0){}\\n void toggle(){}\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster z;\\n z.sm=x.sm+(v->val)+y.sm;\\n z.md=max({x.md,x.chd,y.md});\\n z.ma=x.sm+(v->val)+y.sm;\\n return z;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.sm+=y.sm;\\n x.chd=max({x.chd,y.chd,y.ma});\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl = '\\\\n';\\n\\n int n;\\n cin>>n;\\n vector<int> ws(n);\\n for(int i=0;i<n;i++) cin>>ws[i];\\n\\n const size_t N = 1e5 + 10;\\n TopTree<Vertex, Cluster, N> G;\\n\\n vector<Vertex*> vs(n);\\n for(int i=0;i<n;i++) vs[i]=G.create(ws[i]);\\n\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.link(vs[u],Cluster(),vs[v]);\\n }\\n\\n Vertex* da=G.create(0);\\n Vertex* db=G.create(0);\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n\\n G.link(da,Cluster(),vs[a]);\\n G.link(db,Cluster(),vs[b]);\\n\\n cout<<G.get_path(da,db).md<<newl;\\n\\n G.cut(da,vs[a]);\\n G.cut(db,vs[b]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 43296,\n \"score_of_the_acc\": -0.932,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3037_7758975\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\ntemplate<typename Vertex, typename Cluster, size_t N>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node(){p=q=nullptr;rev=guard=false;}\\n };\\n\\n inline static array<Vertex, 2*N> pool_vertex;\\n inline static size_t ptr_vertex = 0;\\n\\n inline static array<Node, 4*N> pool_node;\\n inline static size_t ptr_node = 0;\\n\\n Cluster id;\\n\\n template<typename ...Args>\\n inline Vertex* create(Args ...args){\\n auto t=&pool_vertex[ptr_vertex++];\\n auto dummy=&pool_vertex[ptr_vertex++];\\n *t=Vertex(forward<Args>(args)...);\\n link(t,id,dummy);\\n return t;\\n }\\n\\n Node* recycle=nullptr;\\n inline void dispose_node(Node* t){\\n t->p=recycle;\\n recycle=t;\\n }\\n\\n inline Node* get_new_node(){\\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\\n return &(pool_node[ptr_node++]);\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=get_new_node();\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;\\n t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;\\n t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;\\n t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);\\n pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n dispose_node(ll->p);\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n dispose_node(rk);\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n assert(nnv);\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n\\n assert(nnu);\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n assert(rr->ch[1]->type==Type::Edge);\\n dispose_node(rr->ch[1]);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nstruct Vertex{\\n void* handle;\\n ll val;\\n Vertex(ll val=0):handle(nullptr),val(val){}\\n};\\n\\nstruct Cluster{\\n ll sm,md,chd,ma;\\n Cluster():sm(0),md(0),chd(0),ma(0){}\\n void toggle(){}\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster z;\\n z.sm=x.sm+(v->val)+y.sm;\\n z.md=max({x.md,x.chd,y.md});\\n z.ma=x.sm+(v->val)+y.sm;\\n return z;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.sm+=y.sm;\\n x.chd=max({x.chd,y.chd,y.ma});\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl = '\\\\n';\\n\\n int n;\\n cin>>n;\\n vector<int> ws(n);\\n for(int i=0;i<n;i++) cin>>ws[i];\\n\\n const size_t N = 1e5;\\n TopTree<Vertex, Cluster, N> G;\\n\\n vector<Vertex*> vs(n);\\n for(int i=0;i<n;i++) vs[i]=G.create(ws[i]);\\n\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.link(vs[u],Cluster(),vs[v]);\\n }\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n ll res=G.get_path(vs[a],vs[b]).md;\\n auto ab=G.get_subtree(vs[a],vs[b]);\\n auto ba=G.get_subtree(vs[b],vs[a]);\\n chmax(res,max(ab.chd,ab.ma));\\n chmax(res,max(ba.chd,ba.ma));\\n cout<<res<<newl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 43240,\n \"score_of_the_acc\": -0.8896,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3037_5782729\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\ntemplate<typename Vertex, typename Cluster, size_t N>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\\n };\\n\\n inline static array<Vertex, 2*N> pool_vertex;\\n inline static size_t ptr_vertex = 0;\\n\\n inline static array<Node, 4*N> pool_node;\\n inline static size_t ptr_node = 0;\\n\\n Cluster id;\\n\\n inline Vertex* create(Vertex v=Vertex()){\\n auto t=&pool_vertex[ptr_vertex++];\\n auto dummy=&pool_vertex[ptr_vertex++];\\n *t=v;\\n link(t,id,dummy);\\n return t;\\n }\\n\\n Node* recycle=nullptr;\\n inline void dispose_node(Node* t){\\n t->p=recycle;\\n recycle=t;\\n }\\n\\n inline Node* get_new_node(){\\n if(recycle) return new(exchange(recycle,recycle->p)) Node;\\n return &(pool_node[ptr_node++]);\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=get_new_node();\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=get_new_node();\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n dispose_node(ll->p);\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n propagate(rk);\\n\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n assert(nnv);\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n\\n assert(nnu);\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n dispose_node(rr->ch[1]);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nstruct Vertex{\\n void* handle;\\n ll val;\\n Vertex(ll val=0):handle(nullptr),val(val){}\\n};\\n\\nstruct Cluster{\\n ll sm,md,chd,ma;\\n Cluster():sm(0),md(0),chd(0),ma(0){}\\n void toggle(){}\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster z;\\n z.sm=x.sm+(v->val)+y.sm;\\n z.md=max({x.md,x.chd,y.md});\\n z.ma=x.sm+(v->val)+y.sm;\\n return z;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.sm+=y.sm;\\n x.chd=max({x.chd,y.chd,y.ma});\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl = '\\\\n';\\n\\n int n;\\n cin>>n;\\n vector<int> ws(n);\\n for(int i=0;i<n;i++) cin>>ws[i];\\n\\n const size_t LIM = 1e5;\\n TopTree<Vertex, Cluster, LIM> G;\\n\\n vector<Vertex*> vs(n);\\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\\n\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.link(vs[u],Cluster(),vs[v]);\\n }\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n ll res=G.get_path(vs[a],vs[b]).md;\\n auto ab=G.get_subtree(vs[a],vs[b]);\\n auto ba=G.get_subtree(vs[b],vs[a]);\\n chmax(res,max(ab.chd,ab.ma));\\n chmax(res,max(ba.chd,ba.ma));\\n cout<<res<<newl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 43228,\n \"score_of_the_acc\": -0.8895,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3037_4312886\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\\\"\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\\n };\\n\\n static array<Vertex, LIM> pool_v;\\n static array<Node, LIM> pool_c;\\n size_t ptr_v,ptr_c;\\n\\n Cluster id;\\n TopTree(Cluster id=Cluster()):ptr_v(0),ptr_c(0),id(id){}\\n\\n inline Vertex* create(Vertex v=Vertex()){\\n auto t=&pool_v[ptr_v++];\\n auto dummy=&pool_v[ptr_v++];\\n *t=v;\\n link(t,id,dummy);\\n return t;\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=&(pool_c[ptr_c++]);\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n propagate(rk);\\n\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n if(!nnv) ll=ee;\\n else{\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n }\\n\\n if(nnu){\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\\nTopTree<Vertex, Cluster, LIM>::pool_c;\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nstruct Vertex{\\n void* handle;\\n ll val;\\n Vertex(ll val=0):handle(nullptr),val(val){}\\n};\\n\\nstruct Cluster{\\n ll sm,md,chd,ma;\\n Cluster():sm(0),md(0),chd(0),ma(0){}\\n void toggle(){}\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster z;\\n z.sm=x.sm+(v->val)+y.sm;\\n z.md=max({x.md,x.chd,y.md});\\n z.ma=x.sm+(v->val)+y.sm;\\n return z;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.sm+=y.sm;\\n x.chd=max({x.chd,y.chd,y.ma});\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl = '\\\\n';\\n\\n int n;\\n cin>>n;\\n vector<int> ws(n);\\n for(int i=0;i<n;i++) cin>>ws[i];\\n\\n const size_t LIM = 1e6;\\n TopTree<Vertex, Cluster, LIM> G;\\n\\n vector<Vertex*> vs(n);\\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\\n\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.link(vs[u],Cluster(),vs[v]);\\n }\\n\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n ll res=G.get_path(vs[a],vs[b]).md;\\n auto ab=G.get_subtree(vs[a],vs[b]);\\n auto ba=G.get_subtree(vs[b],vs[a]);\\n chmax(res,max(ab.chd,ab.ma));\\n chmax(res,max(ba.chd,ba.ma));\\n cout<<res<<newl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 106520,\n \"score_of_the_acc\": -1.9792,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3037_4312878\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3037\\\"\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\nstruct TopTree{\\n enum Type { Compress, Rake, Edge };\\n struct Node{\\n Vertex* vs[2];\\n Cluster dat;\\n Node* p;\\n Node* q;\\n Node* ch[2];\\n bool rev,guard;\\n Type type;\\n Node():p(nullptr),q(nullptr),rev(false),guard(false){}\\n };\\n\\n static array<Vertex, LIM> pool_v;\\n static array<Node, LIM> pool_c;\\n size_t ptr_v,ptr_c;\\n\\n Cluster id;\\n TopTree(Cluster id=Cluster()):ptr_v(0),ptr_c(0),id(id){}\\n\\n inline Vertex* create(Vertex v=Vertex()){\\n auto t=&pool_v[ptr_v++];\\n auto dummy=&pool_v[ptr_v++];\\n *t=v;\\n link(t,id,dummy);\\n return t;\\n }\\n\\n inline Node* edge(Vertex* u,Cluster w,Vertex* v){\\n auto t=&(pool_c[ptr_c++]);\\n t->vs[0]=u;t->vs[1]=v;t->dat=w;t->type=Type::Edge;\\n return pushup(t);\\n }\\n\\n inline Node* compress(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Compress;\\n return pushup(t);\\n }\\n\\n inline Node* rake(Node* l,Node* r){\\n auto t=&(pool_c[ptr_c++]);\\n t->ch[0]=l;t->ch[1]=r;t->type=Type::Rake;\\n return pushup(t);\\n }\\n\\n int parent_dir(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->guard) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n int parent_dir_ignore_guard(Node* t){\\n Node* p=t->p;\\n if(!p) return -1;\\n if(p->ch[0]==t) return 0;\\n if(p->ch[1]==t) return 1;\\n return -1;\\n }\\n\\n inline Node* pushup(Node* const t){\\n Node* const l=t->ch[0];\\n Node* const r=t->ch[1];\\n\\n if(t->type==Type::Compress){\\n assert(l->vs[1]==r->vs[0]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=r->vs[1];\\n\\n Cluster lf=l->dat;\\n if(t->q){\\n assert(l->vs[1]==t->q->vs[1]);\\n lf=Cluster::rake(l->dat,t->q->dat);\\n }\\n t->dat=Cluster::compress(lf,r->vs[0],r->dat);\\n\\n l->vs[1]->handle=t;\\n }\\n\\n if(t->type==Type::Rake){\\n propagate(t);\\n assert(l->vs[1]==r->vs[1]);\\n t->vs[0]=l->vs[0];\\n t->vs[1]=l->vs[1];\\n t->dat=Cluster::rake(l->dat,r->dat);\\n }else{\\n if(!t->p){\\n t->vs[0]->handle=t;\\n t->vs[1]->handle=t;\\n }else if(t->p->type==Type::Compress){\\n if(parent_dir(t)==-1)\\n t->vs[0]->handle=t;\\n }else if(t->p->type==Type::Rake){\\n t->vs[0]->handle=t;\\n }\\n }\\n return t;\\n }\\n\\n inline void toggle(Node* t){\\n if(t->type==Type::Edge){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n }else if(t->type==Type::Compress){\\n swap(t->vs[0],t->vs[1]);\\n t->dat.toggle();\\n t->rev^=true;\\n }else if(t->type==Type::Rake){\\n }else abort();\\n }\\n\\n inline void propagate(Node* t){\\n if(t->type==Type::Compress){\\n if(t->rev){\\n assert(t->ch[0] and t->ch[1]);\\n swap(t->ch[0],t->ch[1]);\\n toggle(t->ch[0]);\\n toggle(t->ch[1]);\\n t->rev=false;\\n }\\n }\\n }\\n\\n void set_toggle(Node* v){\\n toggle(v);propagate(v);\\n }\\n\\n void pushdown(Node* t){\\n if(!t) return;\\n pushdown(t->p);\\n propagate(t);\\n }\\n\\n void rotate(Node* t,Node* x,size_t dir){\\n Node* y=x->p;\\n int par=parent_dir_ignore_guard(x);\\n propagate(t->ch[dir]);\\n x->ch[dir^1]=t->ch[dir];\\n t->ch[dir]->p=x;\\n t->ch[dir]=x;\\n x->p=t;\\n t->p=y;\\n if(~par) y->ch[par]=t;\\n else if(y and y->type==Type::Compress) y->q=t;\\n pushup(x);pushup(t);\\n if(y and !y->guard) pushup(y);\\n }\\n\\n void splay(Node* t){\\n assert(t->type!=Type::Edge);\\n propagate(t);\\n\\n while(~parent_dir(t)){\\n Node* q=t->p;\\n if(q->type!=t->type) break;\\n if(~parent_dir(q) and q->p and q->p->type==q->type){\\n Node* r=q->p;\\n if(r->p) propagate(r->p);\\n propagate(r);propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n int rq_dir=parent_dir(q);\\n if(rq_dir==qt_dir){\\n rotate(q,r,rq_dir^1);\\n rotate(t,q,qt_dir^1);\\n }else{\\n rotate(t,q,qt_dir^1);\\n rotate(t,r,rq_dir^1);\\n }\\n }else{\\n if(q->p) propagate(q->p);\\n propagate(q);propagate(t);\\n int qt_dir=parent_dir(t);\\n rotate(t,q,qt_dir^1);\\n }\\n }\\n }\\n\\n Node* expose(Node* t){\\n pushdown(t);\\n while(true){\\n assert(t->type!=Type::Rake);\\n if(t->type==Type::Compress) splay(t);\\n Node* n=nullptr;\\n {\\n Node* p=t->p;\\n if(!p) break;\\n if(p->type==Type::Rake){\\n propagate(p);\\n splay(p);\\n n=p->p;\\n }\\n if(p->type==Type::Compress){\\n propagate(p);\\n if(p->guard and ~parent_dir_ignore_guard(t)) break;\\n n=p;\\n }\\n }\\n splay(n);\\n int dir=parent_dir_ignore_guard(n);\\n if(dir==-1 or n->p->type==Type::Rake) dir=0;\\n\\n Node* const c=n->ch[dir];\\n if(dir==1){\\n set_toggle(c);\\n set_toggle(t);\\n }\\n int n_dir=parent_dir(t);\\n if(~n_dir){\\n Node* const r=t->p;\\n propagate(c);\\n propagate(r);\\n r->ch[n_dir]=c;\\n c->p=r;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(r);pushup(t);pushup(n);\\n splay(r);\\n }else{\\n propagate(c);\\n n->q=c;\\n c->p=n;\\n n->ch[dir]=t;\\n t->p=n;\\n pushup(c);pushup(t);pushup(n);\\n }\\n if(t->type==Type::Edge) t=n;\\n }\\n return t;\\n }\\n\\n Node* expose(Vertex* v){\\n return expose((Node*)(v->handle));\\n }\\n\\n void soft_expose(Vertex* u,Vertex* v){\\n pushdown((Node*)u->handle);\\n pushdown((Node*)v->handle);\\n Node* rt=expose(u);\\n\\n if(u->handle==v->handle){\\n if(rt->vs[1]==u or rt->vs[0]==v)\\n set_toggle(rt);\\n return;\\n }\\n\\n rt->guard=true;\\n Node* soft=expose(v);\\n rt->guard=false;\\n\\n pushup(rt);\\n if(parent_dir(soft)==0) set_toggle(rt);\\n }\\n\\n void bring(Node* rt){\\n Node* rk=rt->q;\\n if(!rk){\\n Node* ll=rt->ch[0];\\n ll->p=nullptr;\\n pushup(ll);\\n }else if(rk->type==Type::Compress or rk->type==Type::Edge){\\n propagate(rk);\\n\\n Node* nr=rk;\\n set_toggle(nr);\\n rt->ch[1]=nr;\\n nr->p=rt;\\n rt->q=nullptr;\\n\\n pushup(nr);pushup(rt);\\n }else if(rk->type==Type::Rake){\\n propagate(rk);\\n while(rk->ch[1]->type==Type::Rake){\\n propagate(rk->ch[1]);\\n rk=rk->ch[1];\\n }\\n pushdown(rk);\\n\\n rt->guard=true;\\n splay(rk);\\n rt->guard=false;\\n\\n Node* ll=rk->ch[0];\\n Node* rr=rk->ch[1];\\n propagate(ll);\\n set_toggle(rr);\\n\\n rt->ch[1]=rr;\\n rr->p=rt;\\n\\n rt->q=ll;\\n ll->p=rt;\\n\\n pushup(ll);pushup(rr);pushup(rt);\\n }\\n }\\n\\n Node* link(Vertex* u,Cluster w,Vertex* v){\\n if(!u->handle and !v->handle) return edge(u,w,v);\\n\\n Node* nnu=(Node*)u->handle;\\n Node* nnv=(Node*)v->handle;\\n Node* ee=edge(u,w,v);\\n Node* ll=nullptr;\\n\\n if(!nnv) ll=ee;\\n else{\\n Node* vv=expose(nnv);\\n propagate(vv);\\n if(vv->vs[1]==v) set_toggle(vv);\\n if(vv->vs[0]==v){\\n Node* nv=compress(ee,vv);\\n ee->p=nv;\\n pushup(ee);\\n vv->p=nv;\\n pushup(vv);pushup(nv);\\n ll=nv;\\n }else{\\n Node* nv=vv;\\n Node* ch=nv->ch[0];\\n propagate(ch);\\n nv->ch[0]=ee;\\n ee->p=nv;\\n pushup(ee);\\n\\n Node* bt=nv->q;\\n Node* rk=nullptr;\\n if(bt){\\n propagate(bt);\\n rk=rake(bt,ch);\\n bt->p=rk;\\n ch->p=rk;\\n pushup(bt);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nv->q=rk;\\n rk->p=nv;\\n pushup(rk);pushup(nv);\\n ll=nv;\\n }\\n }\\n\\n if(nnu){\\n Node* uu=expose(nnu);\\n propagate(uu);\\n if(uu->vs[0]==u) set_toggle(uu);\\n if(uu->vs[1]==u){\\n Node* tp=compress(uu,ll);\\n uu->p=tp;\\n ll->p=tp;\\n pushup(uu);pushup(ll);pushup(tp);\\n }else{\\n Node* nu=uu;\\n Node* ch=nu->ch[1];\\n toggle(ch);\\n propagate(ch);\\n\\n nu->ch[1]=ll;\\n ll->p=nu;\\n pushup(ll);\\n\\n Node* al=nu->q;\\n Node* rk=nullptr;\\n if(al){\\n propagate(al);\\n rk=rake(al,ch);\\n al->p=rk;\\n ch->p=rk;\\n pushup(al);pushup(ch);\\n }else{\\n rk=ch;\\n }\\n nu->q=rk;\\n rk->p=nu;\\n pushup(rk);pushup(nu);\\n }\\n }\\n return ee;\\n }\\n\\n void cut(Vertex* u,Vertex *v){\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n Node* rr=rt->ch[1];\\n rr->p=nullptr;\\n set_toggle(rr);\\n bring(rr);bring(rt);\\n }\\n\\n Node* path(Vertex* u,Vertex* v){\\n assert(u!=v);\\n soft_expose(u,v);\\n Node* rt=(Node*)u->handle;\\n propagate(rt);\\n propagate(rt->ch[1]);\\n return rt->ch[1]->ch[0];\\n }\\n\\n void set_vertex(Vertex* u,Vertex v){\\n auto t=expose(u);\\n *u=v;\\n pushup(t);\\n }\\n\\n void set_edge(Vertex* u,Vertex* v,const Cluster &w){\\n auto t=path(u,v);\\n assert(t->type==Type::Edge);\\n t->dat=w;\\n while(t) pushup(t),t=t->p;\\n }\\n\\n Cluster get_path(Vertex* u,Vertex* v){\\n return path(u,v)->dat;\\n }\\n\\n Cluster get_subtree(Vertex* v){\\n return expose(v)->dat;\\n }\\n\\n // subtree of v when p is root\\n Cluster get_subtree(Vertex* p,Vertex* v){\\n Node* t=path(p,v);\\n Cluster res=t->p->ch[1]->dat;\\n res.toggle();\\n Node* rk=t->p->q;\\n if(t->p->q){\\n assert(rk->vs[1]==t->p->ch[1]->vs[0]);\\n res=Cluster::rake(res,rk->dat);\\n }\\n return res;\\n }\\n};\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<Vertex, LIM> TopTree<Vertex, Cluster, LIM>::pool_v;\\ntemplate<typename Vertex, typename Cluster, size_t LIM>\\narray<typename TopTree<Vertex, Cluster, LIM>::Node, LIM>\\nTopTree<Vertex, Cluster, LIM>::pool_c;\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nstruct Vertex{\\n void* handle;\\n ll val;\\n Vertex(ll val=0):handle(nullptr),val(val){}\\n};\\n\\nstruct Cluster{\\n ll sm,md,chd,ma;\\n Cluster():sm(0),md(0),chd(0),ma(0){}\\n void toggle(){}\\n static Cluster compress(Cluster x,Vertex *v,Cluster y){\\n Cluster z;\\n z.sm=x.sm+(v->val)+y.sm;\\n z.md=max({x.md,x.chd,y.md});\\n z.ma=x.sm+(v->val)+y.sm;\\n return z;\\n }\\n static Cluster rake(Cluster x,Cluster y){\\n x.sm+=y.sm;\\n x.chd=max({x.chd,y.chd,y.ma});\\n return x;\\n }\\n};\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n const char newl = '\\\\n';\\n\\n int n;\\n cin>>n;\\n vector<int> ws(n);\\n for(int i=0;i<n;i++) cin>>ws[i];\\n\\n const size_t LIM = 1e6;\\n TopTree<Vertex, Cluster, LIM> G;\\n\\n vector<Vertex*> vs(n);\\n for(int i=0;i<n;i++) vs[i]=G.create(Vertex(ws[i]));\\n\\n for(int i=1;i<n;i++){\\n int u,v;\\n cin>>u>>v;\\n u--;v--;\\n G.link(vs[u],Cluster(),vs[v]);\\n }\\n\\n const int DEBUG = 0;\\n int q;\\n cin>>q;\\n for(int i=0;i<q;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n if(a==b){\\n if(DEBUG){\\n cout<<\\\"sm:\\\"<<G.get_subtree(vs[a]).sm<<endl;\\n cout<<\\\"md:\\\"<<G.get_subtree(vs[a]).md<<endl;\\n cout<<\\\"ma:\\\"<<G.get_subtree(vs[a]).ma<<endl;\\n }\\n cout<<G.get_subtree(vs[a]).md<<newl;\\n }else{\\n ll res=G.get_path(vs[a],vs[b]).md;\\n chmax(res,G.get_subtree(vs[a],vs[b]).ma);\\n chmax(res,G.get_subtree(vs[b],vs[a]).ma);\\n\\n if(DEBUG){\\n cout<<\\\"md:\\\"<<G.get_path(vs[a],vs[b]).md<<endl;\\n cout<<\\\"ab:\\\"<<G.get_subtree(vs[a],vs[b]).ma<<endl;\\n cout<<\\\"ba:\\\"<<G.get_subtree(vs[b],vs[a]).ma<<endl;\\n }\\n cout<<res<<newl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.06382978723404255,\n \"time_ms\": 20,\n \"memory_kb\": 104748,\n \"score_of_the_acc\": -0.9788,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3037_3042315\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nconst Int DEBUG = 0;\\n\\nstruct HLDecomposition {\\n Int n,pos;\\n vector<vector<Int> > G;\\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\\n \\n HLDecomposition(){}\\n HLDecomposition(Int sz):\\n n(sz),pos(0),G(n),\\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\\n par(n),dep(n),inv(n),type(n){}\\n \\n void add_edge(Int u, Int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n void build(vector<Int> rs={0}) {\\n Int c=0;\\n for(Int r:rs){\\n dfs(r);\\n bfs(r, c++);\\n }\\n }\\n \\n void dfs(Int rt) {\\n using T = pair<Int, Int>;\\n stack<T> st;\\n par[rt]=-1;\\n dep[rt]=0;\\n st.emplace(rt,0);\\n while(!st.empty()){\\n Int v=st.top().first;\\n Int &i=st.top().second;\\n if(i<(Int)G[v].size()){\\n\\tInt u=G[v][i++];\\n\\tif(u==par[v]) continue;\\n\\tpar[u]=v;\\n\\tdep[u]=dep[v]+1;\\n\\tst.emplace(u,0);\\n }else{\\n\\tst.pop();\\n\\tInt res=0;\\n\\tfor(Int u:G[v]){\\n\\t if(u==par[v]) continue;\\n\\t sub[v]+=sub[u];\\n\\t if(res<sub[u]) res=sub[u],hvy[v]=u;\\n\\t}\\n }\\n }\\n }\\n\\n void bfs(Int r,Int c) {\\n Int &k=pos;\\n queue<Int> q({r});\\n while(!q.empty()){\\n Int h=q.front();q.pop();\\n for(Int i=h;i!=-1;i=hvy[i]) {\\n\\ttype[i]=c;\\n\\tvid[i]=k++;\\n\\tinv[vid[i]]=i;\\n\\thead[i]=h;\\n\\tfor(Int j:G[i])\\n\\t if(j!=par[i]&&j!=hvy[i]) q.push(j);\\n }\\n }\\n }\\n \\n // for_each(vertex)\\n // [l,r] <- attention!!\\n void for_each(Int u, Int v, const function<void(Int, Int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n f(max(vid[head[v]],vid[u]),vid[v]);\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n }\\n \\n // for_each(edge)\\n // [l,r] <- attention!!\\n void for_each_edge(Int u, Int v, const function<void(Int, Int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]){\\n\\tf(vid[head[v]],vid[v]);\\n v=par[head[v]];\\n } else{\\n\\tif(u!=v) f(vid[u]+1,vid[v]);\\n\\tbreak;\\n }\\n }\\n }\\n\\n Int lca(Int u,Int v){\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v=par[head[v]];\\n }\\n }\\n\\n Int distance(Int u,Int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n};\\n\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n typedef function<T(T,T)> F;\\n typedef function<T(T,E)> G;\\n Int n;\\n F f;\\n G g;\\n T d1;\\n E d0;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(Int n_,F f,G g,T d1,\\n\\t vector<T> v=vector<T>()):\\n f(f),g(g),d1(d1){\\n init(n_);\\n if(n_==(Int)v.size()) build(n_,v);\\n }\\n void init(Int n_){\\n n=1;\\n while(n<n_) n*=2;\\n dat.clear();\\n dat.resize(2*n-1,d1);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\\n for(Int i=n-2;i>=0;i--)\\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\\n }\\n void update(Int k,E a){\\n k+=n-1;\\n dat[k]=g(dat[k],a);\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n inline T query(Int a,Int b){\\n T vl=d1,vr=d1;\\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,dat[(l++)-1]);\\n if(r&1) vr=f(dat[(--r)-1],vr);\\n }\\n return f(vl,vr);\\n }\\n\\n Int find(Int a,Int b,function<bool(T)> &check,Int k,Int l,Int r){\\n if(!check(dat[k])||r<=a||b<=l) return -1;\\n if(k>=n-1) return k-(n-1);\\n Int m=(l+r)>>1;\\n Int vl=find(a,b,check,k*2+1,l,m);\\n if(~vl) return vl;\\n return find(a,b,check,k*2+2,m,r);\\n }\\n \\n Int find(Int a,Int b,function<bool(T)> &check){\\n return find(a,b,check,0,0,n);\\n }\\n \\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n;\\n cin>>n;\\n vector<Int> w(n);\\n for(Int i=0;i<n;i++) cin>>w[i];\\n HLDecomposition hld(n);\\n for(Int i=1;i<n;i++){\\n Int u,v;\\n cin>>u>>v;\\n u--;v--;\\n hld.add_edge(u,v);\\n }\\n hld.build();\\n auto G=hld.G;\\n auto head=hld.head;\\n auto vid=hld.vid;\\n auto inv=hld.inv;\\n \\n vector<Int> dp(n),dp2(n,-1),dp3(n,-1);\\n using P = pair<Int, Int>;\\n vector<set<P> > ps(n);\\n function<Int(Int,Int)> dfs=[&](Int v,Int p){\\n dp[v]=w[v];\\n ps[v].emplace(-1,-1);\\n for(Int u:G[v]){\\n if(u==p) continue;\\n Int k=dfs(u,v);\\n dp[v]+=k;\\n if(head[v]!=head[u]){\\n\\tchmax(dp2[v],k);\\n\\tps[v].emplace(k,u);\\n\\tif(DEBUG) cout<<v<<\\\"->\\\"<<u<<\\\":\\\"<<k<<endl;\\n }else dp3[v]=k;\\n }\\n return dp[v];\\n };\\n dfs(0,-1);\\n \\n SegmentTree<Int, Int>::F f=[](Int a,Int b){return max(a,b);};\\n SegmentTree<Int, Int>::G g=[](Int a,Int b){++a;return b;};\\n SegmentTree<Int, Int> seg(n,f,g,-1);\\n for(Int i=0;i<n;i++) seg.update(vid[i],dp2[i]);\\n \\n Int sum=accumulate(w.begin(),w.end(),Int(0));\\n Int q;\\n cin>>q;\\n for(Int i=0;i<q;i++){\\n Int u,v;\\n cin>>u>>v;\\n u--;v--;\\n Int ans=sum-dp[hld.lca(u,v)];\\n set<Int> s;\\n hld.for_each(u,v,[&](Int l,Int r){\\n\\tif(l+1<r) chmax(ans,seg.query(l+1,r));\\n\\tif(DEBUG) cout<<inv[l]<<\\\" \\\"<<inv[r]<<endl;\\n\\ts.emplace(inv[l]);\\n\\ts.emplace(inv[r]);\\n\\tchmax(ans,dp3[inv[r]]);\\n });\\n if(DEBUG) cout<<ans<<endl;\\n for(Int v:s){\\n auto latte=--ps[v].end();\\n while(s.count(latte->second)) --latte;\\n if(DEBUG) cout<<v<<\\\" \\\"<<latte->second<<\\\":\\\"<<latte->first<<endl;\\n chmax(ans,latte->first);\\n }\\n cout<<ans<<endl;\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 46304,\n \"score_of_the_acc\": -1.2804,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3037_2772114\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nll n,q;\\nll w[100001];\\nvector<ll> g[100001];\\nll d[100001];\\nll p[20][100001];\\nvector<ll> s[100001];\\nll br[20][100001];\\n\\nvoid dfs(ll v,ll pre,ll dist){\\n p[0][v]=pre;\\n d[v]=dist;\\n for(ll nv : g[v]){\\n if(nv==pre)continue;\\n dfs(nv,v,dist+1);\\n w[v]+=w[nv];\\n if(s[v].size()>=3&&s[v].back()<w[nv]){\\n s[v].pop_back();\\n s[v].push_back(w[nv]);\\n sort(all(s[v]));\\n reverse(all(s[v]));\\n }else if(s[v].size()<=2){\\n s[v].push_back(w[nv]);\\n sort(all(s[v]));\\n reverse(all(s[v]));\\n }\\n }\\n}\\n\\nint lca(int u,int v){\\n if(d[u]>d[v])swap(u,v);\\n for(int k=0;k<20;k++){\\n if((d[v]-d[u])>>k&1){\\n v=p[k][v];\\n }\\n }\\n if(u==v)return u;\\n for(int k=20-1;k>=0;k--){\\n if(p[k][u]!=p[k][v]){\\n u=p[k][u];\\n v=p[k][v];\\n }\\n }\\n return p[0][u];\\n}\\n\\nint main(){\\n cin>>n;\\n rep(i,n)cin>>w[i];\\n rep(i,n-1){\\n ll a,b;\\n cin>>a>>b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n dfs(0,-1,0);\\n\\n rep(v,n){\\n for(ll ch : g[v]){\\n if(d[ch]<d[v])continue;\\n if(w[ch]==s[v][0]){\\n if(s[v].size()>=2)br[0][ch]=s[v][1];\\n else br[0][ch]=-INF;\\n }else{\\n if(s[v].size()>=1)br[0][ch]=s[v][0];\\n else br[0][ch]=-INF;\\n }\\n }\\n }\\n\\n rep(k,19){\\n rep(i,n){\\n if(p[k][i]!=-1) p[k+1][i]=p[k][p[k][i]];\\n else p[k+1][i]=-1;\\n }\\n }\\n\\n rep(k,19){\\n rep(i,n){\\n if(p[k][i]!=-1) br[k+1][i]=max(br[k][i],br[k][p[k][i]]);\\n else br[k+1][i]=-INF;\\n }\\n }\\n\\n cin>>q;\\n while(q--){\\n ll a,b;\\n cin>>a>>b;\\n a--;b--;\\n if(d[a]>d[b])swap(a,b);\\n ll lc=lca(a,b);\\n ll res=w[0]-w[lc];\\n\\n if(lc==a){\\n ll nb=b,pb=b;\\n while(p[0][pb]!=lc&&pb!=lc){\\n ll i=0;\\n while(p[i][pb]!=-1&&d[p[i][pb]]>d[lc])i++;\\n i--;\\n pb=p[i][pb];\\n }\\n while(nb!=lc){\\n ll i=0;\\n while(p[i][nb]!=-1&&d[p[i][nb]]>=d[lc])i++;\\n i--;\\n maxch(res,br[i][nb]);\\n nb=p[i][nb];\\n }\\n\\n if(s[b].size()>0)maxch(res,s[b][0]);\\n\\n multiset<ll> rest;\\n rep(k,s[a].size())rest.insert(s[a][k]);\\n if(rest.find(w[pb])!=rest.end())rest.erase(rest.find(w[pb]));\\n if(rest.size()>0)maxch(res,*rest.rbegin());\\n }else{\\n ll na=a,pa=a;\\n while(p[0][pa]!=lc){\\n ll i=0;\\n while(p[i][pa]!=-1&&d[p[i][pa]]>d[lc])i++;\\n i--;\\n pa=p[i][pa];\\n }\\n while(na!=pa){\\n ll i=0;\\n while(p[i][na]!=-1&&d[p[i][na]]>=d[pa])i++;\\n i--;\\n maxch(res,br[i][na]);\\n na=p[i][na];\\n }\\n\\n ll nb=b,pb=b;\\n while(p[0][pb]!=lc){\\n ll i=0;\\n while(p[i][pb]!=-1&&d[p[i][pb]]>d[lc])i++;\\n i--;\\n pb=p[i][pb];\\n }\\n while(nb!=pb){\\n ll i=0;\\n while(p[i][nb]!=-1&&d[p[i][nb]]>=d[pb])i++;\\n i--;\\n maxch(res,br[i][nb]);\\n nb=p[i][nb];\\n }\\n\\n if(s[a].size()>0)maxch(res,s[a][0]);\\n if(s[b].size()>0)maxch(res,s[b][0]);\\n multiset<ll> rest;\\n rep(k,s[lc].size())rest.insert(s[lc][k]);\\n if(rest.find(w[pa])!=rest.end())rest.erase(rest.find(w[pa]));\\n if(rest.find(w[pb])!=rest.end())rest.erase(rest.find(w[pb]));\\n if(rest.size()>0)maxch(res,*rest.rbegin());\\n }\\n cout<<res<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 46092,\n \"score_of_the_acc\": -0.8404,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3037_2760096\",\n \"code_snippet\": \"#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\\nll N, Q;\\nll W[100000], U[100000], V[100000], A[100000], B[100000];\\nvector<ll> E[100000];\\nll x[100000][3], y[100000];\\nll depth[100000], parent[20][100000], mx[20][100000];\\n\\nvoid dfs(ll v, ll p, ll d) {\\n parent[0][v] = p;\\n depth[v] = d;\\n for(ll u : E[v]) if(u != p) dfs(u, v, d + 1);\\n}\\n\\nll subtree_size(ll v, ll p) {\\n vector<ll> child;\\n for(ll u : E[v]) if(u != p) child.push_back(subtree_size(u, v));\\n sort(child.begin(), child.end(), greater<ll>());\\n REP(i, 0, 3) x[v][i] = i < child.size() ? child[i] : 0;\\n for(ll u : E[v]) if(u != p) mx[0][u] = x[v][0] != y[u] ? x[v][0] : x[v][1];\\n y[v] = W[v];\\n REP(i, 0, child.size()) y[v] += child[i];\\n return y[v];\\n}\\n\\nll query(ll u, ll v) {\\n if(depth[u] > depth[v]) swap(u, v);\\n REP(i, 0, 20) if(((depth[v] - depth[u]) >> i) & 1) v = parent[i][v];\\n if(u == v) return u;\\n for(ll i = 19; i >= 0; i--) if(parent[i][u] != parent[i][v]) {\\n u = parent[i][u];\\n v = parent[i][v];\\n }\\n return parent[0][u];\\n}\\n\\nint main(void) {\\n cin >> N;\\n REP(i, 0, N) cin >> W[i];\\n REP(i, 0, N - 1) {\\n cin >> U[i] >> V[i]; U[i]--; V[i]--;\\n E[U[i]].push_back(V[i]);\\n E[V[i]].push_back(U[i]);\\n }\\n cin >> Q;\\n REP(i, 0, Q) { cin >> A[i] >> B[i]; A[i]--; B[i]--; }\\n\\n dfs(0, -1, 0);\\n subtree_size(0, -1);\\n REP(i, 0, 19) REP(j, 0, N) parent[i + 1][j] = parent[i][j] >= 0 ? parent[i][parent[i][j]] : -1;\\n REP(i, 0, 19) REP(j, 0, N) if(parent[i][j] >= 0) mx[i + 1][j] = max(mx[i][j], mx[i][parent[i][j]]);\\n\\n REP(q, 0, Q) {\\n ll a = A[q], b = B[q], lca = query(a, b);\\n ll ans = 0;\\n if(lca == a || lca == b) {\\n if(lca == b) swap(a, b);\\n ans = max(ans, x[b][0]);\\n for(ll i = 19; i >= 0; i--) {\\n if(parent[i][b] >= 0 && depth[parent[i][b]] >= depth[lca]) {\\n ans = max(ans, mx[i][b]);\\n b = parent[i][b];\\n }\\n }\\n ans = max(ans, y[0] - y[lca]);\\n } else {\\n ans = max(ans, x[a][0]);\\n ans = max(ans, x[b][0]);\\n for(ll i = 19; i >= 0; i--) {\\n if(parent[i][a] >= 0 && depth[parent[i][a]] > depth[lca]) {\\n ans = max(ans, mx[i][a]);\\n a = parent[i][a];\\n }\\n }\\n for(ll i = 19; i >= 0; i--) {\\n if(parent[i][b] >= 0 && depth[parent[i][b]] > depth[lca]) {\\n ans = max(ans, mx[i][b]);\\n b = parent[i][b];\\n }\\n }\\n vector<ll> r;\\n r.push_back(y[a]);\\n r.push_back(y[b]);\\n r.push_back(-1);\\n sort(r.begin(), r.end(), greater<ll>());\\n REP(i, 0, 3) if(r[i] != x[lca][i]) ans = max(ans, x[lca][i]);\\n ans = max(ans, y[0] - y[lca]);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 37312,\n \"score_of_the_acc\": -0.7979,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3037_2755605\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\n\\nint N, W[100000], Q;\\nvector< int > g[100000];\\nint dep[100000];\\nint64 sub[100000];\\nint64 heavy[3][100000];\\nconst int LOG = 18;\\n\\nint par[LOG][100000];\\nint64 sz[LOG][100000];\\n\\nvoid predfs(int idx, int p, int d) {\\n par[0][idx] = p;\\n dep[idx] = d;\\n sub[idx] += W[idx];\\n for(auto &to : g[idx]) {\\n if(to == p) continue;\\n predfs(to, idx, d + 1);\\n sub[idx] += sub[to];\\n if(heavy[0][idx] < sub[to]) {\\n heavy[2][idx] = heavy[1][idx];\\n heavy[1][idx] = heavy[0][idx];\\n heavy[0][idx] = sub[to];\\n } else if(heavy[1][idx] < sub[to]) {\\n heavy[2][idx] = heavy[1][idx];\\n heavy[1][idx] = sub[to];\\n } else if(heavy[2][idx] < sub[to]) {\\n heavy[2][idx] = sub[to];\\n }\\n }\\n}\\n\\nvoid dfs(int idx, int p) {\\n for(auto &to : g[idx]) {\\n if(to == p) continue;\\n dfs(to, idx);\\n sz[0][to] = heavy[heavy[0][idx] == sub[to]][idx];\\n }\\n}\\n\\nint lca(int x, int y) {\\n if(dep[x] > dep[y]) swap(x, y);\\n for(int i = LOG - 1; i >= 0; i--) {\\n if((dep[y] - dep[x]) >> i & 1) y = par[i][y];\\n }\\n if(x == y) return x;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(par[i][x] != par[i][y]) {\\n x = par[i][x];\\n y = par[i][y];\\n }\\n }\\n return par[0][x];\\n}\\n\\nint main() {\\n scanf(\\\"%d\\\", &N);\\n for(int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &W[i]);\\n }\\n for(int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n }\\n predfs(0, -1, 0);\\n dfs(0, -1);\\n for(int i = 0; i + 1 < LOG; i++) {\\n for(int j = 0; j < N; j++) {\\n if(par[i][j] == -1) par[i + 1][j] = -1;\\n else par[i + 1][j] = par[i][par[i][j]];\\n if(par[i + 1][j] == -1) continue;\\n sz[i + 1][j] = max(sz[i][j], sz[i][par[i][j]]);\\n }\\n }\\n\\n int64 all = accumulate(W, W + N, 0LL);\\n\\n scanf(\\\"%d\\\", &Q);\\n while(Q--) {\\n int a, b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n --a, --b;\\n if(dep[a] > dep[b]) swap(a, b);\\n int p = lca(a, b);\\n\\n int64 ret = 0;\\n if(p != a) {\\n\\n bool ng[3] = {};\\n ret = max(ret, heavy[0][a]);\\n ret = max(ret, heavy[0][b]);\\n\\n for(auto c : {a, b}) {\\n int xx = dep[p] + 1;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(((dep[c] - xx) >> i) & 1) {\\n ret = max(ret, sz[i][c]);\\n c = par[i][c];\\n }\\n }\\n for(int i = 0; i < 3; i++) {\\n if(ng[i]) continue;\\n if(sub[c] == heavy[i][p]) {\\n ng[i] = true;\\n break;\\n }\\n }\\n }\\n for(int i = 0; i < 3; i++) {\\n if(ng[i]) continue;\\n ret = max(ret, heavy[i][p]);\\n }\\n } else if(p != b) {\\n ret = max(ret, heavy[0][b]);\\n int c = b;\\n int xx = dep[a] + 1;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(((dep[c] - xx) >> i) & 1) {\\n ret = max(ret, sz[i][c]);\\n c = par[i][c];\\n }\\n }\\n ret = max(ret, sz[0][c]);\\n } else {\\n ret = max(ret, heavy[0][p]);\\n }\\n\\n printf(\\\"%lld\\\\n\\\", max(ret, all - sub[p]));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 23608,\n \"score_of_the_acc\": -0.1758,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3037_2755604\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\n\\nint N, W[100000], Q;\\nvector< int > g[100000];\\nint dep[100000];\\nint64 sub[100000];\\nint64 heavy[3][100000];\\nconst int LOG = 20;\\n\\nint par[LOG][100000];\\nint64 sz[LOG][100000];\\n\\nvoid predfs(int idx, int p, int d) {\\n par[0][idx] = p;\\n dep[idx] = d;\\n sub[idx] += W[idx];\\n for(auto &to : g[idx]) {\\n if(to == p) continue;\\n predfs(to, idx, d + 1);\\n sub[idx] += sub[to];\\n if(heavy[0][idx] < sub[to]) {\\n heavy[2][idx] = heavy[1][idx];\\n heavy[1][idx] = heavy[0][idx];\\n heavy[0][idx] = sub[to];\\n } else if(heavy[1][idx] < sub[to]) {\\n heavy[2][idx] = heavy[1][idx];\\n heavy[1][idx] = sub[to];\\n } else if(heavy[2][idx] < sub[to]) {\\n heavy[2][idx] = sub[to];\\n }\\n }\\n}\\n\\nvoid dfs(int idx, int p) {\\n for(auto &to : g[idx]) {\\n if(to == p) continue;\\n dfs(to, idx);\\n sz[0][to] = heavy[heavy[0][idx] == sub[to]][idx];\\n }\\n}\\n\\nint lca(int x, int y) {\\n if(dep[x] > dep[y]) swap(x, y);\\n for(int i = LOG - 1; i >= 0; i--) {\\n if((dep[y] - dep[x]) >> i & 1) y = par[i][y];\\n }\\n if(x == y) return x;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(par[i][x] != par[i][y]) {\\n x = par[i][x];\\n y = par[i][y];\\n }\\n }\\n return par[0][x];\\n}\\n\\nint main() {\\n scanf(\\\"%d\\\", &N);\\n for(int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &W[i]);\\n }\\n for(int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n }\\n predfs(0, -1, 0);\\n dfs(0, -1);\\n for(int i = 0; i + 1 < LOG; i++) {\\n for(int j = 0; j < N; j++) {\\n if(par[i][j] == -1) par[i + 1][j] = -1;\\n else par[i + 1][j] = par[i][par[i][j]];\\n if(par[i + 1][j] == -1) continue;\\n sz[i + 1][j] = max(sz[i][j], sz[i][par[i][j]]);\\n }\\n }\\n\\n int64 all = accumulate(W, W + N, 0LL);\\n\\n scanf(\\\"%d\\\", &Q);\\n while(Q--) {\\n int a, b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n --a, --b;\\n if(dep[a] > dep[b]) swap(a, b);\\n int p = lca(a, b);\\n\\n int64 ret = 0;\\n if(p != a) {\\n\\n bool ng[3] = {};\\n ret = max(ret, heavy[0][a]);\\n ret = max(ret, heavy[0][b]);\\n\\n for(auto c : {a, b}) {\\n int xx = dep[p] + 1;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(((dep[c] - xx) >> i) & 1) {\\n ret = max(ret, sz[i][c]);\\n c = par[i][c];\\n }\\n }\\n for(int i = 0; i < 3; i++) {\\n if(ng[i]) continue;\\n if(sub[c] == heavy[i][p]) {\\n ng[i] = true;\\n break;\\n }\\n }\\n }\\n for(int i = 0; i < 3; i++) {\\n if(ng[i]) continue;\\n ret = max(ret, heavy[i][p]);\\n }\\n } else if(p != b) {\\n ret = max(ret, heavy[0][b]);\\n int c = b;\\n int xx = dep[a] + 1;\\n for(int i = LOG - 1; i >= 0; i--) {\\n if(((dep[c] - xx) >> i) & 1) {\\n ret = max(ret, sz[i][c]);\\n c = par[i][c];\\n }\\n }\\n ret = max(ret, sz[0][c]);\\n } else {\\n ret = max(ret, heavy[0][p]);\\n }\\n\\n printf(\\\"%lld\\\\n\\\", max(ret, all - sub[p]));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 24440,\n \"score_of_the_acc\": -0.1858,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3037_2752638\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <functional>\\n#include <map>\\n#include <set>\\n#include <string>\\n#include <iostream>\\n#include <cassert>\\n#include <cmath>\\nusing namespace std;\\n\\nstruct LCA {\\n const int LOGM = 30;\\n vector<int> depth;\\n vector<vector<int>> parent;\\n vector<pair<int, long long>> pare;\\n vector<vector<long long>> parmax;\\n LCA(int root, const vector<vector<int>> &g, const vector<pair<int, long long>> &pare) : pare(pare) {\\n int n = g.size();\\n depth.resize(n);\\n parent.resize(LOGM);\\n parmax.resize(LOGM);\\n for (int i = 0; i < LOGM; i ++) { \\n parent[i].resize(n);\\n parmax[i].resize(n);\\n }\\n function<void (int, int, int)> dfs = [&](int u, int prev, int d) {\\n parent[0][u] = prev;\\n parmax[0][u] = pare[u].second;\\n depth[u] = d;\\n for (auto v : g[u]) if (v != prev) dfs(v, u, d + 1);\\n };\\n dfs(root, -1, 0);\\n for (int k = 0; k < LOGM - 1; k ++) {\\n for (int i = 0; i < n; i ++) {\\n if (parent[k][i] < 0) { \\n parent[k + 1][i] = -1;\\n } else { \\n parent[k + 1][i] = parent[k][parent[k][i]];\\n if (parent[k + 1][i] >= 0) {\\n parmax[k + 1][i] = max(parmax[k][i], parmax[k][parent[k][i]]);\\n }\\n }\\n }\\n }\\n }\\n int lca(int u, int v) { \\n if (depth[u] > depth[v]) swap(u, v);\\n for (int k = 0; k < LOGM; k ++) {\\n if ((depth[v] - depth[u]) >> k & 1) { \\n v = parent[k][v];\\n }\\n }\\n if (u == v) return u;\\n for (int k = LOGM - 1; k >= 0; k --) {\\n if (parent[k][u] != parent[k][v]) {\\n u = parent[k][u];\\n v = parent[k][v];\\n }\\n }\\n return parent[0][u];\\n }\\n pair<int, long long> get(int a, int l) {\\n long long res = 0;\\n int d = depth[a] - depth[l] - 1;\\n if (d <= 0) return { a, 0 };\\n for (int k = 0; k < LOGM; k ++) {\\n if ((d >> k) & 1) {\\n res = max(res, parmax[k][a]);\\n a = parent[k][a];\\n }\\n }\\n return {a, res};\\n }\\n int dist(int u, int v) {\\n return depth[u] + depth[v] - 2 * depth[lca(u, v)];\\n }\\n};\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n vector<int> w(n);\\n vector<vector<int>> g(n);\\n long long tot = 0;\\n for (int i = 0; i < n; i ++) {\\n scanf(\\\"%d\\\", &w[i]);\\n tot += w[i];\\n }\\n for (int i = 0; i < n - 1; i ++) {\\n int a, b;\\n scanf(\\\"%d%d\\\", &a, &b);\\n a --, b --;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n vector<long long> sum(n);\\n vector<long long> maxx(n);\\n vector<pair<int, long long>> pare(n);\\n function<void (int, int)> dfs = [&](int u, int prev) {\\n pare[u].first = prev;\\n sum[u] = w[u];\\n vector<pair<long long, int>> val;\\n int cnt = 0;\\n for (auto v : g[u]) if (v != prev) {\\n dfs(v, u);\\n sum[u] += sum[v];\\n val.emplace_back(sum[v], v);\\n maxx[u] = max(maxx[u], sum[v]);\\n cnt ++;\\n }\\n sort(val.rbegin(), val.rend());\\n if (cnt >= 2) {\\n for (auto v : g[u]) if (v != prev) {\\n if (val[0].second != v) {\\n pare[v].second = val[0].first;\\n } else {\\n pare[v].second = val[1].first;\\n }\\n }\\n }\\n };\\n dfs(0, -1);\\n vector<vector<pair<long long, int>>> ma(n);\\n for (int i = 0; i < n; i ++) {\\n for (auto v : g[i]) if (v != pare[i].first) {\\n ma[i].emplace_back(sum[v], v);\\n }\\n sort(ma[i].rbegin(), ma[i].rend());\\n }\\n LCA lca(0, g, pare);\\n /*\\n for (int i = 0; i < n; i ++) {\\n for (int k = 0; k < 30; k ++) {\\n cerr << lca.parmax[k][i] << ' ';\\n }\\n cerr << endl;\\n }\\n */\\n int q;\\n scanf(\\\"%d\\\", &q);\\n while (q --) {\\n int a, b;\\n scanf(\\\"%d%d\\\", &a, &b);\\n a --, b --;\\n int l = lca.lca(a, b);\\n long long ans = tot - sum[l];\\n\\n if (a == l && b == l) { \\n ans = max(ans, maxx[l]);\\n printf(\\\"%lld\\\\n\\\", ans);\\n continue;\\n }\\n\\n if (a == l || b == l) {\\n if (a == l) swap(a, b);\\n ans = max(ans, maxx[a]);\\n auto geta = lca.get(a, l);\\n int va = geta.first;\\n ans = max(ans, geta.second);\\n ans = max(ans, pare[va].second);\\n printf(\\\"%lld\\\\n\\\", ans);\\n continue;\\n }\\n ans = max(ans, maxx[a]);\\n ans = max(ans, maxx[b]);\\n auto geta = lca.get(a, l);\\n auto getb = lca.get(b, l);\\n int va = geta.first;\\n int vb = getb.first;\\n ans = max(ans, geta.second);\\n ans = max(ans, getb.second);\\n int top1 = ma[l][0].second;\\n int top2 = ma[l][1].second;\\n if ((int) g[l].size() >= 4 || ((int) g[l].size() >= 3 && l == 0)) {\\n if (top1 == va) {\\n if (top2 == vb) {\\n ans = max(ans, ma[l][2].first);\\n } else {\\n ans = max(ans, ma[l][1].first);\\n }\\n } else if (top1 == vb) {\\n if (top2 == va) {\\n ans = max(ans, ma[l][2].first);\\n } else {\\n ans = max(ans, ma[l][1].first);\\n }\\n } else {\\n ans = max(ans, ma[l][0].first);\\n }\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 53980,\n \"score_of_the_acc\": -0.6221,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3037_2752398\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n\\nconst int MAX_N = 100010;\\nconst int LOG_N = 22;\\n\\nusing Pi = pair<int, int>;\\nusing vint = vector<int>;\\n\\nint N, Q;\\nint w[MAX_N];\\nvint graph[MAX_N];\\n\\nint subsz[MAX_N];\\nint depth[MAX_N];\\nvector<Pi> chdat[MAX_N];\\n\\nint par[LOG_N][MAX_N];\\nint mxw[LOG_N][MAX_N];\\n\\nint getchw(int u, int ch1 = -1, int ch2 = -1) {\\n for(Pi p : chdat[u]) {\\n if(p.second != ch1 && p.second != ch2) return p.first;\\n }\\n return 0;\\n}\\n\\nvoid init() {\\n memset(par, -1, sizeof(par));\\n function<void(int, int, int)> dfs = [&dfs](int u, int p, int d) {\\n par[0][u] = p;\\n depth[u] = d;\\n subsz[u] = w[u];\\n for(int v : graph[u]) {\\n if(v == p) continue;\\n dfs(v, u, d+1);\\n subsz[u] += subsz[v];\\n chdat[u].emplace_back(subsz[v], v);\\n }\\n sort(chdat[u].rbegin(), chdat[u].rend());\\n };\\n dfs(0, -1, 0);\\n for(int i = 1; i < N; ++i) {\\n int p = par[0][i];\\n mxw[0][i] = getchw(p, i);\\n }\\n for(int i = 0; i+1 < LOG_N; ++i) {\\n for(int v = 0; v < N; ++v) {\\n if(par[i][v] == -1) {\\n\\tpar[i+1][v] = -1;\\n\\tmxw[i+1][v] = -1;\\n } else {\\n\\tpar[i+1][v] = par[i][par[i][v]];\\n\\tmxw[i+1][v] = max(mxw[i][par[i][v]], mxw[i][v]);\\n }\\n }\\n }\\n}\\n\\nint ask(int u, int v) {\\n if(depth[u] > depth[v]) swap(u, v);\\n int res = getchw(v);\\n for(int i = 0; i < LOG_N; ++i) {\\n if(((depth[v]-depth[u])>>i)&1) {\\n res = max(res, mxw[i][v]);\\n v = par[i][v];\\n }\\n }\\n if(u == v) return max(res, subsz[0]-subsz[u]);\\n\\n res = max(res, getchw(u));\\n for(int i = LOG_N-1; i >= 0; --i) {\\n if(par[i][u] != par[i][v]) {\\n res = max(res, mxw[i][u]);\\n res = max(res, mxw[i][v]);\\n u = par[i][u];\\n v = par[i][v];\\n }\\n }\\n\\n int lca = par[0][u];\\n return max({res, subsz[0]-subsz[lca], getchw(lca, u, v)});\\n}\\n\\nsigned main() {\\n scanf(\\\"%lld\\\", &N);\\n for(int i = 0; i < N; ++i) scanf(\\\"%lld\\\", &w[i]);\\n for(int i = 0; i < N-1; ++i) {\\n int u, v;\\n scanf(\\\"%lld %lld\\\", &u, &v);\\n --u, --v;\\n graph[u].push_back(v);\\n graph[v].push_back(u);\\n }\\n init();\\n scanf(\\\"%lld\\\", &Q);\\n for(int i = 0; i < Q; ++i) {\\n int a, b;\\n scanf(\\\"%lld %lld\\\", &a, &b);\\n --a, --b;\\n printf(\\\"%lld\\\\n\\\", ask(a, b));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 50996,\n \"score_of_the_acc\": -0.5865,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3037_2751840\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define _rep(i,n) _repl(i,0,n)\\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\\n#define mp make_pair\\n#define pb push_back\\n#define all(x) begin(x),end(x)\\n#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))\\n#define fi first\\n#define se second\\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\\nvoid _dbg(string){cerr<<endl;}\\ntemplate<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<\\\" = \\\"<<h<<\\\", \\\";_dbg(s.substr(l+1),t...);}\\ntemplate<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nconst int N = 100005;\\n\\nvector<int> tree[N];\\n\\ntemplate<int SZ>\\nclass HLDecomp {\\npublic:\\n int n;\\n void dfs(const int root){\\n stack<pair<int,bool> > st;\\n par[root] = -1;\\n dep[root] = 0;\\n st.push({root,false});\\n while(!st.empty()){\\n int v = st.top().first;\\n bool &b = st.top().second;\\n if(!b){\\n // initial visit of v\\n b = true;\\n for(int u : tree[v]) if(u != par[v]){\\n par[u] = v;\\n dep[u] = dep[v] + 1;\\n st.push({u, false});\\n }\\n }\\n else {\\n // second visit\\n st.pop();\\n int cur_max = 0;\\n for(int u : tree[v]) if(u != par[v]){\\n sub_sz[v] += sub_sz[u];\\n if(sub_sz[u] > cur_max){\\n cur_max = sub_sz[u];\\n heavy_child[v] = u;\\n }\\n }\\n }\\n }\\n }\\n void bfs(const int root){\\n int cnt = 0;\\n queue<int> q;\\n q.push(root);\\n while(!q.empty()){\\n int h = q.front(); q.pop();\\n for(int i=h; i!=-1; i = heavy_child[i]){\\n vid[i] = cnt++;\\n vid2idx[vid[i]] = i;\\n chain_head[i] = h;\\n for(int to : tree[i]) if(to!=par[i] && to!=heavy_child[i]) q.push(to);\\n }\\n }\\n }\\n\\n int par[SZ], dep[SZ], sub_sz[SZ], heavy_child[SZ], vid[SZ], vid2idx[SZ], chain_head[SZ];\\n HLDecomp(){}\\n HLDecomp(const int _n) : n(_n) {\\n assert(n<=SZ);\\n fill(sub_sz, sub_sz+n, 1);\\n fill(heavy_child, heavy_child+n, -1);\\n }\\n void add_edge(const int u, const int v){\\n tree[u].push_back(v);\\n tree[v].push_back(u);\\n }\\n void build(const int root = 0){\\n dfs(root);\\n bfs(root);\\n }\\n\\n // 閉区間注意 SegTreeの区間 r+1 必要かも\\n void for_each_vertex(int u, int v, const function<void(int,int)> &f) const {\\n while(true){\\n if(vid[u] > vid[v]) swap(u,v);\\n f(max(vid[chain_head[v]], vid[u]), vid[v]);\\n if(chain_head[u] != chain_head[v]) v = par[chain_head[v]];\\n else break;\\n }\\n }\\n int lca(int u, int v) const {\\n while(true){\\n if(vid[u] > vid[v]) swap(u,v);\\n if(chain_head[u] == chain_head[v]) return u;\\n v = par[chain_head[v]];\\n }\\n }\\n};\\n\\nHLDecomp<N> hl;\\nvector<pair<long,int>> lval[N];\\nlong hval[N];\\nlong w[N];\\nlong ch_max[N];\\nlong pa_max[N];\\nlong tw;\\n\\nusing P = pair<long,int>;\\n\\nclass SegTree {\\npublic:\\n int n;\\n vector<vector<P>> data;\\n vector<P> op(const vector<P> &lh, const vector<P> &rh) const {\\n vector<P> ret;\\n for(auto p : lh) ret.pb(p);\\n for(auto p : rh) ret.pb(p);\\n sort(all(ret), greater<P>());\\n if(ret.size()>=4) ret.resize(3);\\n return ret;\\n }\\n SegTree(int m){\\n n=1;\\n while(n<m) n*=2;\\n data.resize(2*n);\\n rep(i,m) data[i+n] = lval[hl.vid2idx[i]];\\n for(int i=n-1; i>0; i--) data[i] = op(data[i*2], data[i*2+1]);\\n }\\n vector<P> query(int l, int r) const {\\n vector<P> v = {};\\n for(l+=n, r+=n; l<r; l/=2, r/=2){\\n if(l&1) v = op(v, data[l++]);\\n if(r&1) v = op(data[--r], v);\\n }\\n return v;\\n }\\n};\\n\\nlong dfs(int v, int pre){\\n ch_max[v] = 0;\\n long ret = w[v];\\n for(auto nx : tree[v]) if(nx != pre){\\n long r = dfs(nx, v);\\n ch_max[v] = max(ch_max[v], r);\\n ret += r;\\n if(nx == hl.heavy_child[v]) hval[v] = r;\\n else lval[v].push_back({r, nx});\\n }\\n sort(all(lval[v]), greater<P>());\\n if(lval[v].size()>=4) lval[v].resize(3);\\n pa_max[v] = tw - ret;\\n return ret;\\n}\\n\\n\\nint main(){\\n int n;\\n cin>>n;\\n rep(i,n) scanf(\\\"%ld\\\", w+i);\\n tw = accumulate(w, w+n, 0L);\\n hl = HLDecomp<N>(n);\\n\\n rep(i,n-1){\\n int a,b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n a--;b--;\\n hl.add_edge(a,b);\\n }\\n\\n hl.build();\\n dfs(0, -1);\\n\\n SegTree st(n);\\n\\n int q;\\n scanf(\\\"%d\\\", &q);\\n rep(_,q){\\n int a,b;\\n scanf(\\\"%d %d\\\", &a, &b);\\n a--;b--;\\n if(a==b){\\n cout << max(ch_max[a], pa_max[a]) << \\\"\\\\n\\\";\\n continue;\\n }\\n int cp = hl.lca(a,b);\\n\\n long cand;\\n if(cp == a) cand = ch_max[b];\\n else if(cp == b) cand = ch_max[a];\\n else cand = max(ch_max[a], ch_max[b]);\\n\\n cand = max(cand, pa_max[cp]);\\n\\n hl.for_each_vertex(a, b, [&](auto l, auto r){\\n cand = max(cand, hval[hl.vid2idx[r]]);\\n auto v = st.query(l ,r+1);\\n // dbg(cand, hl.vid2idx[l], hl.vid2idx[r], hval[hl.vid2idx[r]], pa_max[hl.vid2idx[l]], v);\\n for(auto &p : v){\\n if(hl.lca(p.second,a) != p.second && hl.lca(p.second,b) != p.second){\\n cand = max(cand, p.first);\\n return;\\n }\\n }\\n });\\n printf(\\\"%ld\\\\n\\\", cand);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 30108,\n \"score_of_the_acc\": -0.7327,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3037_2751833\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb push_back\\n#define all(v) (v).begin(),(v).end()\\n#define fi first\\n#define se second\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nconst int INF=1001001001001001001ll;\\n\\nint par[20][111111];\\nint A[111111];\\n\\nint N;\\nvint G[111111];\\n\\nint dep[111111];\\nint latte[111111];\\nint dp[20][111111];\\nvint lis[111111];\\nvoid dfs(int v,int p,int d){\\n dep[v]=d;\\n par[0][v]=p;\\n latte[v]=A[v];\\n lis[v].pb(0);\\n lis[v].pb(0);\\n for(auto u:G[v]){\\n if(u==p)continue;\\n dfs(u,v,d+1);\\n latte[v]+=latte[u];\\n lis[v].pb(latte[u]);\\n }\\n}\\n\\nint lca(int a,int b){\\n if(dep[a]<dep[b])swap(a,b);\\n rep(i,20)if((dep[a]-dep[b])>>i&1)a=par[i][a];\\n if(a==b)return a;\\n for(int i=19;i>=0;i--)if(par[i][a]!=par[i][b])a=par[i][a],b=par[i][b];\\n return par[0][a];\\n}\\n\\nsigned main(){\\n cin>>N;\\n rep(i,N)cin>>A[i];\\n rep(i,N-1){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n G[a].pb(b);G[b].pb(a);\\n }\\n\\n dfs(0,-1,0);\\n\\n rep(i,N){\\n sort(all(lis[i]));\\n reverse(all(lis[i]));\\n }\\n for(int i=1;i<N;i++){\\n int p=par[0][i];\\n if(lis[p][0]==latte[i]){\\n dp[0][i]=lis[p][1];\\n }\\n else{\\n dp[0][i]=lis[p][0];\\n }\\n }\\n\\n\\n rep(i,19){\\n rep(j,N){\\n if(par[i][j]==-1){\\n par[i+1][j]=-1;\\n dp[i+1][j]=dp[i][j];\\n }\\n else{\\n par[i+1][j]=par[i][par[i][j]];\\n dp[i+1][j]=max(dp[i][par[i][j]],dp[i][j]);\\n }\\n }\\n }\\n\\n\\n int sumall=accumulate(A,A+N,0ll);\\n\\n\\n int Q;cin>>Q;\\n while(Q--){\\n int a,b;\\n cin>>a>>b;a--;b--;\\n int p=lca(a,b);\\n int ans=0;\\n rep(lattemalta,2){\\n swap(a,b);\\n int x=a;\\n if(a==p)continue;\\n chmax(ans,lis[a][0]);\\n int d=dep[x]-dep[p]-1;\\n rep(i,20){\\n if(d>>i&1){\\n chmax(ans,dp[i][x]);\\n x=par[i][x];\\n }\\n }\\n a=x;\\n\\n\\n\\n }\\n\\n {\\n bool flaga=false,flagb=false;\\n for(auto x:lis[p]){\\n if(!flaga&&x==latte[a]){\\n flaga=true;\\n continue;\\n }\\n if(!flagb&&x==latte[b]){\\n flagb=true;\\n continue;\\n }\\n chmax(ans,x);\\n break;\\n }\\n }\\n chmax(ans,sumall-latte[p]);\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 50168,\n \"score_of_the_acc\": -0.9724,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3037_2751262\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=int64_t;\\n//#define int ll\\n\\n#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define REP(i,b) FOR(i,0,b)\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(x) x.begin(),x.end()\\n#ifdef MAROON_LOCAL\\n#define cerr (cerr<<\\\"-- line \\\"<<__LINE__<<\\\" -- \\\")\\n#else\\nclass CerrDummy{}cerrDummy;\\ntemplate<class T>\\nCerrDummy& operator<<(CerrDummy&cd,const T&){\\n\\treturn cd;\\n}\\nusing charTDummy=char;\\nusing traitsDummy=char_traits<charTDummy>;\\nCerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){\\n\\treturn cd;\\n}\\n#define cerr cerrDummy\\n#endif\\n#define REACH cerr<<\\\"reached\\\"<<endl\\n#define DMP(x) cerr<<#x<<\\\":\\\"<<x<<endl\\n#define ZERO(x) memset(x,0,sizeof(x))\\n#define ONE(x) memset(x,-1,sizeof(x))\\n\\nusing pi=pair<int,int>;\\nusing vi=vector<int>;\\nusing ld=long double;\\n\\ntemplate<class T,class U>\\nostream& operator<<(ostream& os,const pair<T,U>& p){\\n\\tos<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";\\n\\treturn os;\\n}\\n\\ntemplate<class T>\\nostream& operator <<(ostream& os,const vector<T>& v){\\n\\tos<<\\\"[\\\";\\n\\tREP(i,(int)v.size()){\\n\\t\\tif(i)os<<\\\",\\\";\\n\\t\\tos<<v[i];\\n\\t}\\n\\tos<<\\\"]\\\";\\n\\treturn os;\\n}\\n\\nll read(){\\n\\tll i;\\n\\tscanf(\\\"%\\\" SCNd64,&i);\\n\\treturn i;\\n}\\n\\nvoid printSpace(){\\n\\tprintf(\\\" \\\");\\n}\\n\\nvoid printEoln(){\\n\\tprintf(\\\"\\\\n\\\");\\n}\\n\\nvoid print(ll x,int suc=1){\\n\\tprintf(\\\"%\\\" PRId64,x);\\n\\tif(suc==1)\\n\\t\\tprintEoln();\\n\\tif(suc==2)\\n\\t\\tprintSpace();\\n}\\n\\nstring readString(){\\n\\tstatic char buf[3341000];\\n\\tscanf(\\\"%s\\\",buf);\\n\\treturn string(buf);\\n}\\n\\nchar* readCharArray(){\\n\\tstatic char buf[3341000];\\n\\tstatic int bufUsed=0;\\n\\tchar* ret=buf+bufUsed;\\n\\tscanf(\\\"%s\\\",ret);\\n\\tbufUsed+=strlen(ret)+1;\\n\\treturn ret;\\n}\\n\\ntemplate<class T,class U>\\nvoid chmax(T& a,U b){\\n\\tif(a<b)\\n\\t\\ta=b;\\n}\\n\\ntemplate<class T,class U>\\nvoid chmin(T& a,U b){\\n\\tif(b<a)\\n\\t\\ta=b;\\n}\\n\\ntemplate<class T>\\nT Sq(const T& t){\\n\\treturn t*t;\\n}\\n\\n#define CAPITAL\\nvoid Yes(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"YES\\\"<<endl;\\n\\t#else\\n\\tcout<<\\\"Yes\\\"<<endl;\\n\\t#endif\\n\\tif(ex)exit(0);\\n}\\nvoid No(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"NO\\\"<<endl;\\n\\t#else\\n\\tcout<<\\\"No\\\"<<endl;\\n\\t#endif\\n\\tif(ex)exit(0);\\n}\\n\\nconst ll infLL=LLONG_MAX/3;\\n\\n#ifdef int\\nconst int inf=infLL;\\n#else\\nconst int inf=INT_MAX/2-100;\\n#endif\\n\\nenum ClusterType{\\n\\tNONE,\\n\\tBASE,\\n\\tRAKE,\\n\\tCOMPRESS,\\n\\tHARDRAKE,\\n\\tSELECTRAKE\\n};\\ntemplate<class Info>\\nstruct TopTree{\\n\\tstruct Cluster{\\n\\t\\tTopTree* belongingTree;\\n\\t\\tClusterType type;\\n\\t\\tCluster *l,*r,*m,*p;\\n\\t\\tInfo info,tmpInfo;\\n\\t\\tint a,b;\\n\\t\\tCluster(TopTree* tree):info(-1,-1),tmpInfo(-1,-1){\\n\\t\\t\\tbelongingTree=tree;\\n\\t\\t\\tClear();\\n\\t\\t}\\n\\t\\tvoid Clear(){\\n\\t\\t\\ttype=NONE;\\n\\t\\t\\tl=nullptr;\\n\\t\\t\\tr=nullptr;\\n\\t\\t\\tm=nullptr;\\n\\t\\t\\tp=nullptr;\\n\\t\\t\\tinfo=Info(-1,-1);\\n\\t\\t\\ttmpInfo=Info(-1,-1);\\n\\t\\t\\ta=-1;\\n\\t\\t\\tb=-1;\\n\\t\\t}\\n\\t\\tvoid UpdateHandles(){\\n\\t\\t\\tif(type==BASE){\\n\\t\\t\\t\\tbelongingTree->handles[a]=this;\\n\\t\\t\\t\\tbelongingTree->handles[b]=this;\\n\\t\\t\\t}else if(type==COMPRESS){\\n\\t\\t\\t\\tbelongingTree->handles[l->a]=this;\\n\\t\\t\\t\\tbelongingTree->handles[l->b]=this;\\n\\t\\t\\t\\tbelongingTree->handles[r->a]=this;\\n\\t\\t\\t\\tbelongingTree->handles[r->b]=this;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvoid Update(){\\n\\t\\t\\tif(type==COMPRESS){\\n\\t\\t\\t\\tif(m){\\n\\t\\t\\t\\t\\ttmpInfo=Info(l->a,l->b);\\n\\t\\t\\t\\t\\ttmpInfo.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ta=l->a;\\n\\t\\t\\t\\tb=r->b;\\n\\t\\t\\t\\tUpdateHandles();\\n\\t\\t\\t\\tinfo=Info(a,b);\\n\\t\\t\\t\\tinfo.Join(a,b,l->a,l->b,m?tmpInfo:l->info,r->a,r->b,r->info,COMPRESS);\\n\\t\\t\\t}else if(type==RAKE){\\n\\t\\t\\t\\ta=r->a;\\n\\t\\t\\t\\tb=r->b;\\n\\t\\t\\t\\tinfo=Info(a,b);\\n\\t\\t\\t\\tinfo.Join(a,b,l->a,l->b,l->info,r->a,r->b,r->info,RAKE);\\n\\t\\t\\t}else if(type==HARDRAKE){\\n\\t\\t\\t\\tint la=l->a,lb=l->b;\\n\\t\\t\\t\\tint ra=r->a,rb=r->b;\\n\\t\\t\\t\\tif(la==ra||la==rb)swap(la,lb);\\n\\t\\t\\t\\tif(lb==ra)swap(ra,rb);\\n\\t\\t\\t\\ta=ra;\\n\\t\\t\\t\\tb=rb;\\n\\t\\t\\t\\tinfo=Info(a,b);\\n\\t\\t\\t\\tinfo.Join(a,b,la,lb,l->info,ra,rb,r->info,RAKE);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvoid Reverse(){\\n\\t\\t\\tswap(a,b);\\n\\t\\t}\\n\\t\\tvoid Normalize(){\\n\\t\\t\\tif(type==BASE){\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(type==COMPRESS){\\n\\t\\t\\t\\t\\tbool updMid=false;\\n\\t\\t\\t\\t\\tif(r->a==a||r->b==a){\\n\\t\\t\\t\\t\\t\\tswap(l,r);\\n\\t\\t\\t\\t\\t\\tupdMid=true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(l->a!=a)l->Reverse();\\n\\t\\t\\t\\t\\tif(r->b!=b)r->Reverse();\\n\\t\\t\\t\\t\\tif(m&&updMid){\\n\\t\\t\\t\\t\\t\\ttmpInfo=Info(l->a,l->b);\\n\\t\\t\\t\\t\\t\\ttmpInfo.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tinfo.Split(a,b,l->a,l->b,m?tmpInfo:l->info,r->a,r->b,r->info,COMPRESS);\\n\\t\\t\\t\\t\\tif(m)tmpInfo.Split(l->a,l->b,m->a,m->b,m->info,l->a,l->b,l->info,RAKE);\\n\\t\\t\\t\\t}else if(type==RAKE){\\n\\t\\t\\t\\t\\tinfo.Split(a,b,l->a,l->b,l->info,r->a,r->b,r->info,RAKE);\\n\\t\\t\\t\\t}else if(type==HARDRAKE){\\n\\t\\t\\t\\t\\tint la=l->a,lb=l->b;\\n\\t\\t\\t\\t\\tint ra=r->a,rb=r->b;\\n\\t\\t\\t\\t\\tif(la==ra||la==rb)swap(la,lb);\\n\\t\\t\\t\\t\\tif(lb==ra)swap(ra,rb);\\n\\t\\t\\t\\t\\tinfo.Split(a,b,la,lb,l->info,ra,rb,r->info,RAKE);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tCluster* Select(int&xa,int&xb,Info&x,int&ya,int&yb,Info&y){\\n\\t\\t\\tNormalize();\\n\\t\\t\\tif(type==BASE){\\n\\t\\t\\t\\treturn this;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(type==COMPRESS){\\n\\t\\t\\t\\t\\tInfo lTmp(l->b,l->a),rTmp(r->a,r->b);\\n\\t\\t\\t\\t\\tif(xa==xb)lTmp=l->info;\\n\\t\\t\\t\\t\\telse lTmp.Join(l->b,l->a,xa,xb,x,l->b,l->a,l->info,SELECTRAKE);\\n\\t\\t\\t\\t\\tif(ya==yb)rTmp=r->info;\\n\\t\\t\\t\\t\\telse rTmp.Join(r->a,r->b,yb,ya,y,r->a,r->b,r->info,SELECTRAKE);\\n\\t\\t\\t\\t\\tif(m){\\n\\t\\t\\t\\t\\t\\tInfo mTmp(l->a,l->b);\\n\\t\\t\\t\\t\\t\\tmTmp.Join(l->a,l->b,m->a,m->b,m->info,l->a,l->b,lTmp,RAKE);\\n\\t\\t\\t\\t\\t\\tbool s=Info::Select(l->a,l->b,mTmp,r->a,r->b,rTmp,COMPRESS);\\n\\t\\t\\t\\t\\t\\tif(s){\\n\\t\\t\\t\\t\\t\\t\\txa=l->a,xb=l->b,x=mTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn r;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tmTmp=Info(m->a,m->b);\\n\\t\\t\\t\\t\\t\\t\\tmTmp.Join(m->a,m->b,r->b,r->a,rTmp,m->a,m->b,m->info,RAKE);\\n\\t\\t\\t\\t\\t\\t\\ts=Info::Select(m->a,m->b,mTmp,l->a,l->b,lTmp,RAKE);\\n\\t\\t\\t\\t\\t\\t\\tif(s){\\n\\t\\t\\t\\t\\t\\t\\t\\tya=m->b,yb=m->a,y=mTmp;\\n\\t\\t\\t\\t\\t\\t\\t\\treturn l;\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t\\tInfo lrTmp(r->b,r->a);\\n\\t\\t\\t\\t\\t\\t\\t\\tlrTmp.Join(r->b,r->a,l->a,l->b,lTmp,r->b,r->a,rTmp,RAKE);\\n\\t\\t\\t\\t\\t\\t\\t\\txa=m->a,xb=m->a,x=Info(-1,-1),ya=r->a,yb=r->b,y=lrTmp;\\n\\t\\t\\t\\t\\t\\t\\t\\treturn m;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tbool s=Info::Select(l->a,l->b,lTmp,r->a,r->b,rTmp,COMPRESS);\\n\\t\\t\\t\\t\\t\\tif(s){\\n\\t\\t\\t\\t\\t\\t\\txa=l->a,xb=l->b,x=lTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn r;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\tya=r->a,yb=r->b,y=rTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn l;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else if(type==RAKE){\\n\\t\\t\\t\\t\\tInfo w(l->a,l->b);\\n\\t\\t\\t\\t\\tif(ya==yb)w=l->info;\\n\\t\\t\\t\\t\\telse w.Join(l->a,l->b,yb,ya,y,l->a,l->b,l->info,SELECTRAKE);\\n\\t\\t\\t\\t\\tbool s=Info::Select(l->a,l->b,w,r->a,r->b,r->info,RAKE);\\n\\t\\t\\t\\t\\tif(s){\\n\\t\\t\\t\\t\\t\\txa=r->a,xb=r->a,x=Info(-1,-1),ya=l->b,yb=l->a,y=w;\\n\\t\\t\\t\\t\\t\\treturn r;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tw=Info(r->a,r->b);\\n\\t\\t\\t\\t\\t\\tif(ya==yb)w=r->info;\\n\\t\\t\\t\\t\\t\\telse w.Join(r->a,r->b,yb,ya,y,r->a,r->b,r->info,RAKE);\\n\\t\\t\\t\\t\\t\\txa=l->a,xb=l->a,x=Info(-1,-1),ya=r->b,yb=r->a,y=w;\\n\\t\\t\\t\\t\\t\\treturn l;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else if(type==HARDRAKE){\\n\\t\\t\\t\\t\\tint la=l->a,lb=l->b;\\n\\t\\t\\t\\t\\tint ra=r->a,rb=r->b;\\n\\t\\t\\t\\t\\tif(la==ra||la==rb)swap(la,lb);\\n\\t\\t\\t\\t\\tif(lb==ra)swap(ra,rb);\\n\\t\\t\\t\\t\\tInfo lTmp(la,lb),rTmp(ra,rb);\\n\\t\\t\\t\\t\\tif(ya==yb)lTmp=l->info;\\n\\t\\t\\t\\t\\telse lTmp.Join(la,lb,yb,ya,y,la,lb,l->info,SELECTRAKE);\\n\\t\\t\\t\\t\\tif(xa==xb)rTmp=r->info;\\n\\t\\t\\t\\t\\telse rTmp.Join(rb,ra,xa,xb,x,rb,ra,r->info,SELECTRAKE);\\n\\t\\t\\t\\t\\tbool s=Info::Select(la,lb,lTmp,ra,rb,rTmp,RAKE);\\n\\t\\t\\t\\t\\tif(s){\\n\\t\\t\\t\\t\\t\\tif(ra==r->a){\\n\\t\\t\\t\\t\\t\\t\\tya=lb,yb=la,y=lTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn r;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tya=xb,yb=xa,y=x;\\n\\t\\t\\t\\t\\t\\t\\txa=la,xb=lb,x=lTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn r;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tlTmp=Info(ra,rb);\\n\\t\\t\\t\\t\\t\\tif(ya==yb)lTmp=rTmp;\\n\\t\\t\\t\\t\\t\\telse lTmp.Join(ra,rb,yb,ya,y,ra,rb,rTmp,RAKE);\\n\\t\\t\\t\\t\\t\\tif(la==l->a){\\n\\t\\t\\t\\t\\t\\t\\txa=la,xb=la,x=Info(-1,-1),ya=rb,yb=ra,y=lTmp;\\n\\t\\t\\t\\t\\t\\t\\treturn l;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\txa=ra,xb=rb,x=lTmp,ya=la,yb=la,y=Info(-1,-1);\\n\\t\\t\\t\\t\\t\\t\\treturn l;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t\\tint Pos(){\\n\\t\\t\\tCluster *x=p;\\n\\t\\t\\tif(!x)return 0;\\n\\t\\t\\telse if(x->l==this)return -1;\\n\\t\\t\\telse if(x->r==this)return 1;\\n\\t\\t\\telse if(x->m==this)return -2;\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t\\tbool LinkedToParent(){\\n\\t\\t\\treturn p&&(p->type!=type||p->m==this);\\n\\t\\t}\\n\\t\\tvoid Rotate(){\\n\\t\\t\\tCluster *q=p,*c;\\n\\t\\t\\tif(Pos()==1){\\n\\t\\t\\t\\tc=l;\\n\\t\\t\\t\\tl=q;\\n\\t\\t\\t\\tq->r=c; \\n\\t\\t\\t}else{\\n\\t\\t\\t\\tc=r;\\n\\t\\t\\t\\tr=q;\\n\\t\\t\\t\\tq->l=c;\\n\\t\\t\\t}\\n\\t\\t\\tif(c){\\n\\t\\t\\t\\tif(c->p)c->p=q;\\n\\t\\t\\t}\\n\\t\\t\\tint w=p->Pos();\\n\\t\\t\\tp=p->p;\\n\\t\\t\\tq->p=this;\\n\\t\\t\\tCluster *x=p;\\n\\t\\t\\tif(x){\\n\\t\\t\\t\\tif(w==1)x->r=this;\\n\\t\\t\\t\\telse if(w==-1)x->l=this;\\n\\t\\t\\t\\telse if(w==-2)x->m=this;\\n\\t\\t\\t}\\n\\t\\t\\tq->Update();\\n\\t\\t}\\n\\t\\tvoid Splay(Cluster* guard){\\n\\t\\t\\twhile(p&&p!=guard&&!LinkedToParent()){\\n\\t\\t\\t\\tCluster *q=p->p;\\n\\t\\t\\t\\tif(q&&q!=guard&&!p->LinkedToParent()){\\n\\t\\t\\t\\t\\tif(Pos()==p->Pos()){\\n\\t\\t\\t\\t\\t\\tp->Rotate();\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tRotate();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tRotate();\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tRotate();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tUpdate();\\n\\t\\t}\\n\\t\\tvoid Destroy(){\\n\\t\\t\\tinfo.Destroy(a,b);\\n\\t\\t}\\n\\t};\\n\\tvector<Cluster*> handles;\\n\\tvector<Cluster> clusterBuf;\\n\\tvi ptrBuf;\\n\\tvi deg;\\n\\tvector<Cluster*> hardRakeClusters,needUpdateClusters;\\n\\tCluster* selectRoot;\\n\\tTopTree(){}\\n\\tTopTree(int n){\\n\\t\\tInit(n);\\n\\t}\\n\\tint vertNum,edgeNum;\\n\\tvoid Init(int n){\\n\\t\\tint s=n*2+10;\\n\\t\\tclusterBuf=vector<Cluster>(s,Cluster(this));\\n\\t\\tREP(i,s)ptrBuf.PB(i);\\n\\t\\tdeg=vi(n,0);\\n\\t\\thandles=vector<Cluster*>(n,nullptr);\\n\\t\\tvertNum=n;\\n\\t\\tedgeNum=0;\\n\\t\\tselectRoot=nullptr;\\n\\t}\\n\\tCluster* GetNew(){\\n\\t\\tCluster *res=clusterBuf.data()+ptrBuf.back();\\n\\t\\tptrBuf.pop_back();\\n\\t\\tres->Clear();\\n\\t\\treturn res;\\n\\t}\\n\\tvoid Recycle(Cluster* ptr){\\n\\t\\tptrBuf.PB(ptr-clusterBuf.data());\\n\\t}\\n\\tvoid ClearHardRakeClusters(){\\n\\t\\twhile(!hardRakeClusters.empty()){\\n\\t\\t\\tCluster* x=hardRakeClusters.back();\\n\\t\\t\\thardRakeClusters.pop_back();\\n\\t\\t\\tx->Normalize();\\n\\t\\t\\tRecycle(x);\\n\\t\\t}\\n\\t\\twhile(!needUpdateClusters.empty()){\\n\\t\\t\\tCluster* x=needUpdateClusters.back();\\n\\t\\t\\tneedUpdateClusters.pop_back();\\n\\t\\t\\tx->Update();\\n\\t\\t}\\n\\t}\\n\\tvoid Rectify(Cluster* x,Cluster* guard){\\n\\t\\tCluster* p=x->p;\\n\\t\\tif(p!=nullptr){\\n\\t\\t\\tRectify(p,guard);\\n\\t\\t\\tif(p==guard&&p->r==x){\\n\\t\\t\\t\\tp->Reverse();\\n\\t\\t\\t\\tp->Normalize();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tx->Normalize();\\n\\t}\\n\\tCluster* CreateCompressCluster(Cluster*l,Cluster*r,Cluster*m){\\n\\t\\tauto p=GetNew();\\n\\t\\tp->type=COMPRESS;\\n\\t\\tp->l=l;\\n\\t\\tl->p=p;\\n\\t\\tp->r=r;\\n\\t\\tr->p=p;\\n\\t\\tp->m=m;\\n\\t\\tif(m){\\n\\t\\t\\tm->p=p;\\n\\t\\t}\\n\\t\\tp->Update();\\n\\t\\treturn p;\\n\\t}\\n\\tCluster* CreateRakeCluster(Cluster*l,Cluster*r){\\n\\t\\tif(!l)return r;\\n\\t\\tif(!r)return l;\\n\\t\\tauto p=GetNew();\\n\\t\\tp->type=RAKE;\\n\\t\\tp->l=l;\\n\\t\\tl->p=p;\\n\\t\\tp->r=r;\\n\\t\\tr->p=p;\\n\\t\\tp->Update();\\n\\t\\treturn p;\\n\\t}\\n\\tCluster* CreateHardRakeCluster(Cluster*l,Cluster*r){\\n\\t\\tif(!l)return r;\\n\\t\\tauto p=GetNew();\\n\\t\\thardRakeClusters.PB(p);\\n\\t\\tp->type=HARDRAKE;\\n\\t\\tp->l=l;\\n\\t\\tp->r=r;\\n\\t\\tp->Update();\\n\\t\\treturn p;\\n\\t}\\n\\tvoid SoftExpose(int v,Cluster* guard){\\n\\t\\tif(handles[v]==guard)return;\\n\\t\\tRectify(handles[v],guard);\\n\\t\\tCluster *x=handles[v],*tmp=x;\\n\\t\\tif(x->type==COMPRESS)x->Splay(guard);\\n\\t\\twhile(x->LinkedToParent()){\\n\\t\\t\\tCluster* p=x->p;\\n\\t\\t\\tif(p->type==RAKE){\\n\\t\\t\\t\\tp->Splay(nullptr);\\n\\t\\t\\t\\tif(x->p!=p)\\n\\t\\t\\t\\t\\tx->p->Splay(p);\\n\\t\\t\\t\\tx=p;\\n\\t\\t\\t}\\n\\t\\t\\tx=x->p;\\n\\t\\t\\tx->Splay(guard);\\n\\t\\t}\\n\\t\\tx=tmp;\\n\\t\\twhile(x->LinkedToParent()){\\n\\t\\t\\tCluster* m=nullptr;\\n\\t\\t\\tCluster* y=x->p;\\n\\t\\t\\tif(y->type==RAKE){\\n\\t\\t\\t\\tCluster*p=x->p;\\n\\t\\t\\t\\tif(x->Pos()<0){\\n\\t\\t\\t\\t\\tm=p->r;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tm=p->l;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ty=p->p;\\n\\t\\t\\t\\tif(y->type==RAKE){\\n\\t\\t\\t\\t\\tCluster*q=p->p;\\n\\t\\t\\t\\t\\tif(p->Pos()<0){\\n\\t\\t\\t\\t\\t\\tm=CreateRakeCluster(m,q->r);\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tm=CreateRakeCluster(m,q->l);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ty=q->p;\\n\\t\\t\\t\\t\\tRecycle(q);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tRecycle(p);\\n\\t\\t\\t}\\n\\t\\t\\tm=CreateRakeCluster(m,y->l);\\n\\t\\t\\ty->l->UpdateHandles();\\n\\t\\t\\ty->l=x;\\n\\t\\t\\tx->p=y;\\n\\t\\t\\ty->m=m;\\n\\t\\t\\tm->p=y;\\n\\t\\t\\ty->Update();\\n\\t\\t\\tx=y;\\n\\t\\t}\\n\\t\\tif(tmp->type==BASE)tmp=tmp->p;\\n\\t\\tif(tmp){\\n\\t\\t\\ttmp->Splay(guard);\\n\\t\\t}\\n\\t\\tif(guard)guard->Update();\\n\\t}\\n\\tbool SoftExpose(int a,int b){\\n\\t\\tif(deg[b]==0){\\n\\t\\t\\treturn false;\\n\\t\\t}else if(deg[a]==0){\\n\\t\\t\\tSoftExpose(b,nullptr);\\n\\t\\t\\tif(handles[b]->a==b){\\n\\t\\t\\t\\thandles[b]->Reverse();\\n\\t\\t\\t\\thandles[b]->Normalize();\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}else if(deg[b]==1){\\n\\t\\t\\tSoftExpose(b,nullptr);\\n\\t\\t\\tif(handles[b]->a==b){\\n\\t\\t\\t\\thandles[b]->Reverse();\\n\\t\\t\\t\\thandles[b]->Normalize();\\n\\t\\t\\t}\\n\\t\\t\\tSoftExpose(a,nullptr);\\n\\t\\t\\tif(handles[a]==handles[b]){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(handles[a]->a==a){\\n\\t\\t\\t\\t\\thandles[a]->Reverse();\\n\\t\\t\\t\\t\\thandles[a]->Normalize();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tSoftExpose(b,nullptr);\\n\\t\\t\\tSoftExpose(a,handles[b]);\\n\\t\\t\\tif(handles[a]==handles[b]){\\n\\t\\t\\t\\tif(handles[a]->b==a){\\n\\t\\t\\t\\t\\thandles[a]->Reverse();\\n\\t\\t\\t\\t\\thandles[a]->Normalize();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else if(handles[a]==handles[b]->l){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(handles[a]->a==a){\\n\\t\\t\\t\\t\\thandles[a]->Reverse();\\n\\t\\t\\t\\t\\thandles[a]->Normalize();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid SoftExpose(int v){\\n\\t\\tif(deg[v]==0){\\n\\t\\t\\t//do nothing\\n\\t\\t}else{\\n\\t\\t\\tSoftExpose(v,nullptr);\\n\\t\\t\\tif(handles[v]->a==v){\\n\\t\\t\\t\\thandles[v]->Reverse(); \\n\\t\\t\\t\\thandles[v]->Normalize();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tCluster* HardExpose(int a,int b){\\n\\t\\tif(deg[b]==1){\\n\\t\\t\\treturn handles[a];\\n\\t\\t}else if(deg[a]==1){\\n\\t\\t\\tneedUpdateClusters.PB(handles[b]);\\n\\t\\t\\tauto x=handles[b]->l;\\n\\t\\t\\tx=CreateHardRakeCluster(handles[b]->m,x);\\n\\t\\t\\tx=CreateHardRakeCluster(handles[b]->r,x);\\n\\t\\t\\treturn x;\\n\\t\\t}else{\\n\\t\\t\\tneedUpdateClusters.PB(handles[b]);\\n\\t\\t\\tneedUpdateClusters.PB(handles[a]);\\n\\t\\t\\tauto x=handles[a]->r;\\n\\t\\t\\tx=CreateHardRakeCluster(handles[a]->l,x);\\n\\t\\t\\tx=CreateHardRakeCluster(handles[a]->m,x);\\n\\t\\t\\tx=CreateHardRakeCluster(handles[b]->m,x);\\n\\t\\t\\tx=CreateHardRakeCluster(handles[b]->r,x);\\n\\t\\t\\treturn x;\\n\\t\\t}\\n\\t}\\n\\tCluster* HardExpose(int v){\\n\\t\\treturn HardExpose(handles[v]->a,v);\\n\\t}\\n\\tCluster* ExposePath(int a,int b){\\n\\t\\tassert(!selectRoot);\\n\\t\\tClearHardRakeClusters();\\n\\t\\tif(deg[a]>deg[b])swap(a,b);\\n\\t\\tbool connected=SoftExpose(a,b);\\n\\t\\tif(!connected)return nullptr;\\n\\t\\treturn HardExpose(a,b);\\n\\t}\\n\\tInfo* Expose(int a,int b){\\n\\t\\t//cerr<<\\\"expose \\\"<<a<<\\\" \\\"<<b<<endl;\\n\\t\\tif(a==b)return Expose(a);\\n\\t\\tCluster*x=ExposePath(a,b);\\n\\t\\tif(x)return &(x->info);\\n\\t\\telse return nullptr;\\n\\t}\\n\\tCluster* ExposeVertex(int v){\\n\\t\\tassert(!selectRoot);\\n\\t\\tClearHardRakeClusters();\\n\\t\\tSoftExpose(v);\\n\\t\\tif(deg[v]==0)return nullptr;\\n\\t\\treturn HardExpose(v);\\n\\t}\\n\\tInfo* Expose(int v){\\n\\t\\t//cerr<<\\\"expose \\\"<<v<<endl;\\n\\t\\tCluster*x=ExposeVertex(v);\\n\\t\\tif(x)return &(x->info);\\n\\t\\telse return nullptr;\\n\\t}\\n\\tbool Connected(int a,int b){\\n\\t\\t//cerr<<\\\"connected \\\"<<a<<\\\" \\\"<<b<<endl;\\n\\t\\tassert(!selectRoot);\\n\\t\\tClearHardRakeClusters();\\n\\t\\tif(deg[a]>deg[b])swap(a,b);\\n\\t\\treturn SoftExpose(a,b);\\n\\t}\\n\\ttemplate <class... Args>\\n\\tbool Link(int a,int b,Args... args){\\n\\t\\tassert(!selectRoot);\\n\\t\\tClearHardRakeClusters();\\n\\t\\tif(deg[a]>deg[b])swap(a,b);\\n\\t\\t//cerr<<\\\"link \\\"<<a<<\\\" \\\"<<b<<endl;\\n\\t\\tbool connected=SoftExpose(a,b);\\n\\t\\tif(connected)return false;\\n\\t\\tCluster* u=handles[a],*v=handles[b];\\n\\t\\tCluster* x=GetNew();\\n\\t\\tx->type=BASE;\\n\\t\\tx->a=a;\\n\\t\\tx->b=b;\\n\\t\\tx->info=Info(a,b);\\n\\t\\tx->info.Create(a,b,args...);\\n\\t\\tx->UpdateHandles();\\n\\t\\tCluster* y=nullptr;\\n\\t\\tif(deg[a]==0){\\n\\t\\t\\ty=x;\\n\\t\\t}else if(deg[a]==1){\\n\\t\\t\\ty=CreateCompressCluster(u,x,nullptr);\\n\\t\\t}else{\\n\\t\\t\\tu->r->Reverse();\\n\\t\\t\\tu->r->UpdateHandles();\\n\\t\\t\\ty=CreateCompressCluster(u->l,x,CreateRakeCluster(u->r,u->m));\\n\\t\\t\\tRecycle(u);\\n\\t\\t}\\n\\t\\tif(deg[b]==0){\\n\\t\\t}else if(deg[b]==1){\\n\\t\\t\\tv->Reverse();\\n\\t\\t\\tv->Normalize();\\n\\t\\t\\tCreateCompressCluster(y,v,nullptr);\\n\\t\\t}else{\\n\\t\\t\\tv->l->UpdateHandles();\\n\\t\\t\\tCreateCompressCluster(y,v->r,CreateRakeCluster(v->m,v->l));\\n\\t\\t\\tRecycle(v);\\n\\t\\t}\\n\\t\\tdeg[a]++;\\n\\t\\tdeg[b]++;\\n\\t\\tedgeNum++;\\n\\t\\treturn true;\\n\\t}\\n\\tpair<Cluster*,Cluster*> SplitMiddleChild(Cluster*x){\\n\\t\\tif(x->type!=RAKE)return MP(x,nullptr);\\n\\t\\twhile(x->type==RAKE)x=x->l;\\n\\t\\tx->p->Splay(nullptr);\\n\\t\\tCluster* tmp=x->p;\\n\\t\\tpair<Cluster*,Cluster*> res=MP(tmp->l,tmp->r);\\n\\t\\tRecycle(tmp);\\n\\t\\treturn res;\\n\\t}\\n\\tbool Cut(int a,int b){\\n\\t\\tassert(!selectRoot);\\n\\t\\tClearHardRakeClusters();\\n\\t\\tif(deg[a]>deg[b])swap(a,b);\\n\\t\\t//cerr<<\\\"cut \\\"<<a<<\\\" \\\"<<b<<endl;\\n\\t\\tbool connected=SoftExpose(a,b);\\n\\t\\tif(!connected)return false;\\n\\t\\tCluster *u=handles[a],*v=handles[b];\\n\\t\\tif(deg[b]==1){\\n\\t\\t\\tif(u->type!=BASE)return false;\\n\\t\\t\\tu->Destroy();\\n\\t\\t\\tRecycle(u);\\n\\t\\t\\thandles[a]=nullptr;\\n\\t\\t\\thandles[b]=nullptr;\\n\\t\\t}else if(deg[a]==1){\\n\\t\\t\\tif(v->l->type!=BASE)return false;\\n\\t\\t\\tif(deg[b]==2){\\n\\t\\t\\t\\tv->r->p=nullptr;\\n\\t\\t\\t\\tv->r->UpdateHandles();\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpair<Cluster*,Cluster*> z=SplitMiddleChild(v->m);\\n\\t\\t\\t\\tCreateCompressCluster(z.first,v->r,z.second);\\n\\t\\t\\t}\\n\\t\\t\\tv->l->Destroy();\\n\\t\\t\\tRecycle(v->l);\\n\\t\\t\\tRecycle(v);\\n\\t\\t\\thandles[a]=nullptr;\\n\\t\\t}else{\\n\\t\\t\\tif(u->r->type!=BASE)return false;\\n\\t\\t\\tif(deg[a]==2){\\n\\t\\t\\t\\tu->l->p=nullptr;\\n\\t\\t\\t\\tu->l->UpdateHandles();\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpair<Cluster*,Cluster*> z=SplitMiddleChild(u->m);\\n\\t\\t\\t\\tz.first->Reverse();\\n\\t\\t\\t\\tCreateCompressCluster(u->l,z.first,z.second);\\n\\t\\t\\t}\\n\\t\\t\\tif(deg[b]==2){\\n\\t\\t\\t\\tv->r->p=nullptr;\\n\\t\\t\\t\\tv->r->UpdateHandles();\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpair<Cluster*,Cluster*> z=SplitMiddleChild(v->m);\\n\\t\\t\\t\\tCreateCompressCluster(z.first,v->r,z.second);\\n\\t\\t\\t}\\n\\t\\t\\tu->r->Destroy();\\n\\t\\t\\tRecycle(u->r);\\n\\t\\t\\tRecycle(u);\\n\\t\\t\\tRecycle(v);\\n\\t\\t}\\n\\t\\tdeg[a]--;\\n\\t\\tdeg[b]--;\\n\\t\\tedgeNum--;\\n\\t\\treturn true;\\n\\t}\\n\\tInfo* PrepareForSelect(int a,int b){\\n\\t\\t//cerr<<\\\"prepare \\\"<<a<<\\\" \\\"<<b<<endl;\\n\\t\\tif(a==b)return PrepareForSelect(a);\\n\\t\\tselectRoot=ExposePath(a,b);\\n\\t\\tif(selectRoot==nullptr)return nullptr;\\n\\t\\treturn &(selectRoot->info);\\n\\t}\\n\\tInfo* PrepareForSelect(int v){\\n\\t\\t//cerr<<\\\"prepare \\\"<<v<<endl;\\n\\t\\tselectRoot=ExposeVertex(v);\\n\\t\\tif(selectRoot==nullptr)return nullptr;\\n\\t\\treturn &(selectRoot->info);\\n\\t}\\n\\tInfo* Select(){\\n\\t\\tassert(selectRoot);\\n\\t\\tassert(!selectRoot->p);\\n\\t\\tCluster* cur=selectRoot;\\n\\t\\tint xa=cur->a,xb=xa,ya=cur->b,yb=ya;\\n\\t\\tInfo x(-1,-1),y(-1,-1);\\n\\t\\twhile(1){\\n\\t\\t\\tCluster*nx=cur->Select(xa,xb,x,ya,yb,y);\\n\\t\\t\\tif(nx==cur)break;\\n\\t\\t\\tcur=nx;\\n\\t\\t}\\n\\t\\tselectRoot=nullptr;\\n\\t\\treturn Expose(cur->a,cur->b);\\n\\t}\\n\\tint NumofVertices(){\\n\\t\\treturn vertNum;\\n\\t}\\n\\tint NumofEdges(){\\n\\t\\treturn edgeNum;\\n\\t}\\n};\\n\\nstruct InfoBase{\\n\\tprivate:\\n\\tint vert[2];\\n\\tvoid SetVertex(int a,int b){\\n\\t\\tvert[0]=a;\\n\\t\\tvert[1]=b;\\n\\t}\\n\\tpublic:\\n\\tInfoBase(int a,int b){\\n\\t\\tSetVertex(a,b);\\n\\t}\\n\\tinline int idx(int v){\\n\\t\\tif(vert[0]==v)return 0;\\n\\t\\tif(vert[1]==v)return 1;\\n\\t\\tassert(false);\\n\\t}\\n\\tinline int another(int v){\\n\\t\\tif(vert[0]==v)return vert[1];\\n\\t\\tif(vert[1]==v)return vert[0];\\n\\t\\tassert(false);\\n\\t}\\n\\tinline int v0(){\\n\\t\\treturn vert[0];\\n\\t}\\n\\tinline int v1(){\\n\\t\\treturn vert[1];\\n\\t}\\n};\\n\\nconst int Nmax=100010;\\nll w[Nmax];\\n\\nstruct Info:InfoBase{\\n\\tll sum,_es[2],mx;\\n\\tll&es(int x){\\n\\t\\treturn _es[idx(x)];\\n\\t}\\n\\tInfo(int a,int b):InfoBase(a,b){}\\n\\tvoid Join(int a,int b,int la,int lb,Info&l,int ra,int rb,Info&r,ClusterType type){\\n\\t\\t//(another(a)==b);\\n\\t\\t//(another(b)==a);\\n\\t\\tif(type==RAKE){\\n\\t\\t\\t//(a==ra);\\n\\t\\t\\t//(b==rb);\\n\\t\\t\\t//(lb==rb);\\n\\t\\t\\tsum=l.sum+r.sum-w[b];\\n\\t\\t\\tes(a)=r.es(a);\\n\\t\\t\\tes(b)=r.es(b)+l.sum-w[b];\\n\\t\\t\\tmx=max({l.mx,r.mx,l.sum-w[b]-l.es(b)});\\n\\t\\t}else if(type==SELECTRAKE){\\n\\t\\t\\t//(a==ra);\\n\\t\\t\\t//(b==rb);\\n\\t\\t\\t//(lb==rb);\\n\\t\\t}else if(type==COMPRESS){\\n\\t\\t\\t//(a==la);\\n\\t\\t\\t//(lb==ra);\\n\\t\\t\\t//(rb==b);\\n\\t\\t\\tsum=l.sum+r.sum-w[lb];\\n\\t\\t\\tes(a)=l.es(a);\\n\\t\\t\\tes(b)=r.es(b);\\n\\t\\t\\tmx=max(l.mx,r.mx);\\n\\t\\t}\\n\\t}\\n\\tvoid Create(int a,int b){\\n\\t\\t//(another(a)==b);\\n\\t\\t//(another(b)==a);\\n\\t\\tsum=w[a]+w[b];\\n\\t\\tes(a)=es(b)=0;\\n\\t\\tmx=0;\\n\\t}\\n\\tvoid Split(int a,int b,int la,int lb,Info&l,int ra,int rb,Info&r,ClusterType type){\\n\\t\\t//(another(a)==b);\\n\\t\\t//(another(b)==a);\\n\\t\\tif(type==RAKE){\\n\\t\\t\\t//(a==ra);\\n\\t\\t\\t//(b==rb);\\n\\t\\t\\t//(lb==rb);\\n\\t\\t}else if(type==COMPRESS){\\n\\t\\t\\t//(a==la);\\n\\t\\t\\t//(lb==ra);\\n\\t\\t\\t//(rb==b);\\n\\t\\t}\\n\\t}\\n\\tvoid Destroy(int a,int b){\\n\\t\\t//(another(a)==b);\\n\\t\\t//(another(b)==a);\\n\\t}\\n\\tstatic bool Select(int la,int lb,Info l,int ra,int rb,Info r,ClusterType type){\\n\\t\\tif(type==RAKE){\\n\\t\\t\\t//(lb==rb);\\n\\t\\t}else if(type==COMPRESS){\\n\\t\\t\\t//(lb==ra);\\n\\t\\t}\\n\\t}\\n};\\n\\nsigned main(){\\n\\tint n=read();\\n\\tREP(i,n)w[i]=read();\\n\\tTopTree<Info> tree(n);\\n\\tREP(i,n-1){\\n\\t\\tint a=read()-1,b=read()-1;\\n\\t\\ttree.Link(a,b);\\n\\t}\\n\\tint q=read();\\n\\tREP(i,q){\\n\\t\\tint a=read()-1,b=read()-1;\\n\\t\\tauto info=tree.Expose(a,b);\\n\\t\\tprint(info->mx);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 39788,\n \"score_of_the_acc\": -1.1192,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3037_2744743\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define N 100005\\nusing namespace std;\\n\\ntypedef pair<int,int> P;\\n\\nclass LCA{\\npublic:\\n int LOG_V=30; //log V (自分で決めて)\\n int V; //言わずもがな頂点数\\n vector<vector<int> > G; //グラフの隣接リストの表現\\n int root; //根のノード番号\\n vector<vector<int> > parent; //親を2^k回辿って到達する頂点(根を通りすぎる場合は-1とする)\\n vector<int> depth; //根からの深さ\\n int ok;\\n \\n LCA():V(-1){}\\n LCA(int V,int root = 0):V(V),G(V),root(root),parent(LOG_V,vector<int>(V)),depth(V),ok(0){}\\n \\n void add_edge(int a, int b){\\n assert(a < V && b < V);\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n \\n void dfs(int v,int p,int d){\\n assert(v < V);\\n parent[0][v] = p;\\n depth[v] = d;\\n for(int to:G[v]) if(to != p) dfs(to,v,d+1);\\n }\\n \\n //初期化\\n void init(){\\n ok = 1;\\n //parent[0]とdepthを初期化する。\\n dfs(root,-1,0);\\n //parentを初期化する\\n for(int k=0; k+1<LOG_V ;k++)\\n for(int v=0; v<V ;v++)\\n if(parent[k][v] < 0)parent[k+1][v] = -1;\\n else parent[k+1][v] = parent[k][parent[k][v]];\\n }\\n \\n //uとvのLCAを求める\\n int lca(int u,int v){\\n assert(ok);\\n assert(u < V && v < V);\\n //uとvの深さが同じになるまで親を辿る\\n if(depth[u]>depth[v]) swap(u,v);\\n \\n for(int k=0; k<LOG_V ;k++)\\n if((depth[v]-depth[u])>>k&1)v=parent[k][v];\\n \\n vector<int> res;\\n \\n if(u==v) return u;\\n \\n //二分探索でLCAを求める\\n for(int k=LOG_V-1; k>=0 ;k--)\\n if(parent[k][u] != parent[k][v]){\\n u=parent[k][u];\\n v=parent[k][v];\\n }\\n \\n res.push_back(u);\\n res.push_back(v);\\n\\t\\n return parent[0][u];\\n } \\n \\n};\\n\\nint n, w[N], W, cost[30][N];\\nvector<int> G[N];\\nvector<P> maxw[N];\\n\\nint dfs(int x, int pre){\\n \\n int res = 0;\\n \\n priority_queue<P> q;\\n\\n for(int i=0;i<G[x].size();i++){\\n \\n int nx = G[x][i];\\n \\n if( nx == pre ) continue;\\n \\n int v = dfs(nx ,x);\\n \\n q.push( P( v , nx ) );\\n res += v;\\n }\\n \\n res += w[x];\\n \\n if( x != 0 ) q.push( P( W - res , pre ) );\\n \\n for(int i=0;i<3;i++){\\n \\n if(q.empty()) break;\\n \\n maxw[x].push_back(q.top());\\n \\n q.pop();\\n }\\n \\n for(int i=0;i<G[x].size();i++){\\n \\n int nx = G[x][i];\\n \\n if( nx == pre ) continue;\\n \\n for(int j=0;j<maxw[x].size();j++){\\n\\n int c = maxw[x][j].first;\\n int node = maxw[x][j].second;\\n \\n if( node == pre || node == nx ) continue;\\n \\n cost[0][nx] = max( cost[0][nx] , c );\\n }\\n }\\n \\n return res;\\n}\\n\\nLCA lca;\\n\\nint get_anc(int node, int x){\\n\\n for(int i=0;i<30;i++)\\n \\n if(x>>i&1)\\n node = lca.parent[i][node];\\n \\n return node;\\n}\\n\\nvoid solve(){\\n \\n for(int i=0;i<n;i++) W+=w[i];\\n \\n dfs(0, -1);\\n \\n for(int i=0;i<29;i++){\\n \\n for(int j=0;j<n;j++){\\n \\n int par = lca.parent[i][j];\\n \\n if( par >= 0 ) cost[i+1][j] = max( cost[i][j], cost[i][par] );\\n \\n }\\n \\n }\\n \\n int q;\\n cin>>q;\\n \\n while(q--){\\n \\n int a, b;\\n cin>>a>>b;\\n a--, b--;\\n \\n int lca_ = lca.lca(a, b);\\n \\n int a1=-1, a2=-1, b1=-1, b2=-1;\\n \\n if( lca.depth[lca_] + 1 <= lca.depth[a] )\\n a1 = get_anc( a, lca.depth[a]-lca.depth[lca_]-1 );\\n \\n if( lca.depth[lca_] + 2 <= lca.depth[a] )\\n a2 = get_anc( a, lca.depth[a]-lca.depth[lca_]-2 );\\n \\n if( lca.depth[lca_] + 1 <= lca.depth[b] )\\n b1 = get_anc( b, lca.depth[b]-lca.depth[lca_]-1 );\\n \\n if( lca.depth[lca_] + 2 <= lca.depth[b] )\\n b2 = get_anc( b, lca.depth[b]-lca.depth[lca_]-2 );\\n \\n int ans = 0;\\n \\n for(int i=0;i<maxw[lca_].size();i++){\\n \\n int c = maxw[lca_][i].first;\\n int node = maxw[lca_][i].second;\\n \\n if( node == a1 || node == b1 ) continue;\\n \\n ans = max( ans , c );\\n }\\n\\n for(int i=0;i<maxw[a].size();i++){\\n\\n if(a==lca_) break;\\n \\n int c = maxw[a][i].first;\\n int node = maxw[a][i].second;\\n \\n if( node == lca.parent[0][a] ) continue;\\n \\n ans = max( ans , c );\\n }\\n\\n for(int i=0;i<maxw[b].size();i++){\\n\\n if(b==lca_) break;\\n \\n int c = maxw[b][i].first;\\n int node = maxw[b][i].second;\\n \\n if( node == lca.parent[0][b] ) continue;\\n \\n ans = max( ans , c );\\n }\\n \\n if( a2 != -1 ){\\n \\n int x = a, d = lca.depth[a] - lca.depth[a2];\\n \\n for(int i=0;i<30;i++){\\n\\t\\n\\tif(d>>i&1){\\n\\t ans = max( ans, cost[i][x] );\\n\\t x = lca.parent[i][x];\\n\\t}\\n }\\n \\n ans = max( ans, cost[0][x] );\\n }\\n\\n if( b2 != -1 ){\\n \\n int x = b, d = lca.depth[b] - lca.depth[b2];\\n \\n for(int i=0;i<30;i++){\\n\\t\\n\\tif(d>>i&1){\\n\\t ans = max( ans, cost[i][x] );\\n\\t x = lca.parent[i][x];\\n\\t}\\n }\\n \\n ans = max( ans, cost[0][x] );\\n }\\n \\n cout<<ans<<endl;\\n }\\n \\n}\\n\\nsigned main(){\\n \\n cin>>n;\\n \\n for(int i=0;i<n;i++) cin>>w[i];\\n \\n lca = LCA(n);\\n \\n for(int i=0;i<n-1;i++){\\n int u, v;\\n cin>>u>>v;\\n G[u-1].push_back(v-1);\\n G[v-1].push_back(u-1);\\n lca.add_edge(u-1, v-1);\\n }\\n \\n lca.init();\\n \\n solve();\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 51752,\n \"score_of_the_acc\": -1.0955,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1883,"cells":{"group_id":{"kind":"string","value":"aoj_3041_cpp"},"problem_description":{"kind":"string","value":"Problem C: Round And Round\nProblem\n長さ$N$の数列$A=${$a_{1},a_{2},a_{3},...,a_{n}$}が与えられる。\n$a_{i}$ ($i=1,2,3,...,n$)は、$i$で初期化されているものとする。\n以下の二種類のクエリを合計$Q$回処理せよ。\n数列$A$の先頭から$k$番目の要素の値を出力する。\n数列$A$の先頭から$k$と$k+1$番目を境界に二つの数列をスワップする。\n詳しくはサンプル入出力を参考にせよ。\nInput\n入力は以下の形式で与えられる。\n$N$ $Q$\n$query_1$\n$query_2$\n...\n$query_Q$\n各クエリは以下の二種類のいずれかの形式で与えられる。\nクエリ$0$\n$0$ $k$\n数列$A$の先頭から$k$番目の要素の値を出力する。\nクエリ$1$\n$1$ $k$\n数列$A$の先頭から$k$と$k+1$番目を境界に二つの数列をスワップする。\n入力はすべて整数で与えられる。\n$1$行目に$N$, $Q$が空白区切りで与えられる。\n$2$行目以降の$Q$行にクエリが改行区切りで与えられる。\n各クエリ内の数値は全て空白区切りである。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq N \\leq 10^9 $\n$1 \\leq Q \\leq 10^5 $\n各クエリについて、入力は以下の条件を満たす。\nクエリ$0$\n$1 \\leq k \\leq N $\nクエリ$1$\n$1 \\leq k \\leq N-1 $\nOutput\n各クエリ$1$に対し値を一行に出力せよ。\nSample Input 1\n5 4\n1 2\n0 2\n1 1\n0 3\nSample Output 1\n4\n1\n長さ$5$の数列$A=[1,2,3,4,5]$が与えられる\n$1$番目のクエリで $[1,2,3,4,5]$ -> $[1,2] [3,4,5]$ -> $[3,4,5] [1,2]$ -> $[3,4,5,1,2]$ と数列が変化する。\n$2$番目のクエリで先頭から$2$番目の要素の値である$4$を出力する。\n$3$番目のクエリで $[3,4,5,1,2]$ -> $[3] [4,5,1,2]$ -> $[4,5,1,2] [3]$ -> $[4,5,1,2,3]$ と数列が変化する。\n$4$番目のクエリで先頭から$3$番目の要素の値である$1$を出力する。\nSample Input 2\n4 4\n1 2\n1 1\n0 1\n0 4\nSample Output 2\n4\n3\nSample Input 3\n10 6\n1 1\n0 1\n1 9\n0 5\n1 1\n0 10\nSample Output 3\n2\n5\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3041_10322854","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tll N,Q;\n\tcin>>N>>Q;\n\tll x=0;\n\tfor(int q=0;q<Q;q++){\n\t\tint t,k;\n\t\tcin>>t>>k;\n\t\tif(t==1){\n\t\t\tx+=k;\n\t\t\tx%=N;\n\t\t}\n\t\telse{\n\t\t\tcout<<(x+k-1)%N+1<<endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":3584,"score_of_the_acc":-0.0613,"final_rank":7},{"submission_id":"aoj_3041_9862291","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 100;\n//static int vect[MAX_N];\n\n//------------------------------------------------------------------------------\nint solve(int N)\n{\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n //sort(vect, vect+N);\n //memset(S0, 0L, sizeof(S0));\n //--------------------------------------------------------------------------\n // compute:\n \n\n //--------------------------------------------------------------------------\n \n //--------------------------------------------------------------------------\n // report:\n return -1;\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, Q, type, k, num;\n num = scanf(\"%d %d \", &N, &Q);\n int first = 0;\n for (int q=0; q<Q; ++q)\n {\n num = scanf(\"%d %d \", &type, &k);\n if (type == 0) printf(\"%d\\n\", (first+k-1)%N + 1);\n else if (type == 1) first = (first+k)%N;\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":10,"memory_kb":3612,"score_of_the_acc":-0.0026,"final_rank":6},{"submission_id":"aoj_3041_9099656","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, q;\n cin >> n >> q;\n int o = 0;\n while (q--) {\n int t, x;\n cin >> t >> x;\n if (t == 0) {\n x -= 1;\n cout << (o + x) % n + 1 << \"\\n\";\n } else {\n o += x;\n o %= n;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0021,"final_rank":5},{"submission_id":"aoj_3041_7757442","code_snippet":"#include <iostream>\n#include <map>\nusing namespace std;\n\nint main() {\n\tint top=1;\n\tint n,q;\n\tcin>>n>>q;\n\tfor(int i=0;i<q;i++){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\tif(a==0){\n\t\t\tint t=n-top+1;\n\t\t\tif(t>=b){\n\t\t\t\tcout<<top+b-1<<endl;\n\t\t\t}else{\n\t\t\t\tcout<<b-t<<endl;\n\t\t\t}\n\t\t}else if(a==1){\n\t\t\tint t=n-top+1;\n\t\t\tif(t>b){\n\t\t\t\ttop=top+b;\n\t\t\t}else{\n\t\t\t\ttop=b-t+1;\n\t\t\t}\n\t\t}\n\t//\tcout<<\"top=\"<<top<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3104,"score_of_the_acc":-0.4128,"final_rank":10},{"submission_id":"aoj_3041_6219376","code_snippet":"#include <iostream>\nusing namespace std;\n\nint main(){\n int n, q;\n cin >> n >> q;\n int top = 0;\n while(q--){\n int op, k;\n cin >> op >> k;\n if(op == 0){\n cout << (top+k-1)%n + 1 << '\\n';\n }else{\n top += k;\n top %= n;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3472,"score_of_the_acc":-0.2963,"final_rank":8},{"submission_id":"aoj_3041_6001953","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<ll,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\n\nconst int MX = 1000010;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nvoid Init() {\n\n}\n\nvoid solve() {\n\n}\nint main() {\n //freopen(\"data.in\", \"r\", stdin);\n //freopen(\"data.out\", \"w\", stdout);\n ll n=_r(),q=_r();\n ll head=0;\n while(q--){\n ll ope=_r(),k=_r();\n if(ope)\n head=(head+k)%n;\n else\n printf(\"%lld\\n\",(head+(k-1))%n+1);\n }\n\n#ifdef VSC\n getchar();\n#endif\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.0014,"final_rank":4},{"submission_id":"aoj_3041_4321404","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int n, q; cin >> n >> q;\n int ofs = 0;\n while (q--) {\n int op, k; cin >> op >> k;\n if (op == 0) cout << (ofs + k - 1) % n + 1 << endl;\n if (op == 1) ofs = (ofs + k) % n;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3132,"score_of_the_acc":-0.4129,"final_rank":17},{"submission_id":"aoj_3041_4235569","code_snippet":"/* _/ _/ _/_/_/ _/\n _/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/\n _/ _/ _/ _/ _/ _/ _/_/_/ _/\n _/ _/ _/ _/ _/ _/ _/ _/ _/\n _/_/ _/_/ _/_/ _/_/ _/_/ _/ */\n#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<iomanip>\n#include<set>\n#include<map>\n#include<queue>\n#include<vector>\nusing namespace std;\nusing ll=long long;\nconst int MOD=1e9+7;\nconst double pi=3.14159265358979323846;\nconst int inf=2e9;\nconst ll INF=1e18;\nusing P=pair<int,int>;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nint main() {\n cin.tie(0),cout.tie(0);\n ios::sync_with_stdio(false);\n int n,q,a,b,now=1;\n cin >> n >> q;\n while(q--) {\n cin >> a >> b;\n if(!a) {\n if(now+b-1>n) {\n cout << now+b-1-n << \"\\n\";\n }\n else {\n cout << now+b-1 << \"\\n\";\n }\n }\n else {\n if(now+b>n) {\n now=now+b-n;\n }\n else {\n now=now+b;\n }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3224,"score_of_the_acc":-0.0014,"final_rank":2},{"submission_id":"aoj_3041_4011317","code_snippet":"#include <iostream>\n\nusing namespace std;\n\nint main()\n{\n int N, Q;\n int op, k;\n int index = 0;\n \n cin >> N >> Q;\n while (Q--) {\n cin >> op >> k;\n if (op == 0) {\n int element = (index + k) % N;\n element ? cout << element << endl : cout << N << endl;\n } else if (op == 1) {\n index = (index + k) % N;\n }\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3116,"score_of_the_acc":-0.4128,"final_rank":15},{"submission_id":"aoj_3041_3892258","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3041.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\n/* typedef */\n\n/* global variables */\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, q;\n scanf(\"%d%d\", &n, &q);\n\n int h = 0;\n while (q--) {\n int op, k;\n scanf(\"%d%d\", &op, &k);\n\n if (op == 0) {\n k--;\n printf(\"%d\\n\", (h + k) % n + 1);\n }\n else\n h = (h + k) % n;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3224,"score_of_the_acc":-0.0014,"final_rank":2},{"submission_id":"aoj_3041_3668301","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define REP(i,n) for(ll i =0;i<n;++i)\n\nint main(){\n int n,q;\n cin>>n>>q;\n int pos=1;\n REP(i,q){\n int t;cin>>t;\n int k;cin>>k;\n \n if(t==0){\n int tar;\n if(pos+k-1>n)tar=pos+k-1-n;\n else tar=pos+k-1;\n cout<<tar<<endl;\n }else{\n k++;\n int tar;\n if(pos+k-1>n)tar=pos+k-1-n;\n else tar=pos+k-1;\n pos=tar;\n }\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3104,"score_of_the_acc":-0.4128,"final_rank":10},{"submission_id":"aoj_3041_3544344","code_snippet":"#include <iostream>\nusing namespace std;\nint main() {\n\tint n,q,p=1,c,x;\n\tcin>>n>>q;\n\tfor(int i=0;i<q;i++){\n\t\tcin>>c>>x;\n\t\tif(!c)cout<<((p+x-1)%n==0? n:(p+x-1)%n)<<endl;\n\t\telse {p=(p+x)%n; if(p==0)p=n;}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3120,"score_of_the_acc":-0.4128,"final_rank":16},{"submission_id":"aoj_3041_3542129","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define repi(n) for(int i=0; i<(n); ++i)\n#define repj(n) for(int j=0; j<(n); ++j)\n#define repk(n) for(int k=0; k<(n); ++k)\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\n#define sz(x) ((int)(x).size())\n#define all(x) (x).begin(),(x).end()\n#define mp make_pair\n#define pb push_back\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define qp(f) [](auto i){return f;}\nusing LL=long long;\nusing VI=vector<int>;\nusing VL=vector<LL>;\nusing VS=vector<string>;\nusing VVI=vector<vector<int>>;\nusing PII=pair<int, int>;\nconst int inf = (int)1e9;\nconst LL MOD = 1000000007;\nconst double pi = acos(-1.0);\ntemplate<class T>T Sort(T & a) { sort(a.begin(), a.end()); return a; }\ntemplate<class T>T ReSort(T& a) { sort(a.rbegin(), a.rend()); return a; }\ntemplate<class T>T Reverse(T& a) { reverse(a.begin(), a.end()); return a; }\ntemplate<class T>void Unique(T& a) { a.erase(unique(a.begin(), a.end()), a.end()); }\ntemplate<class T>auto Max(T a) { return *max_element(a.begin(), a.end()); }\ntemplate<class T>auto Min(T a) { return *min_element(a.begin(), a.end()); }\ntemplate<class T, class U>int Count(T a, U c) { return count(a.begin(), a.end(), c); }\ntemplate<class T, class U>U Sum(T a, U init = 0) { return accumulate(a.begin(), a.end(), init); }\ntemplate<class T>T Age(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T>T gcd(T n, T m) { return m == 0 ? n : gcd(m, n % m); }\ntemplate<class T>T lcm(T n, T m) { return n / gcd(n, m) * m; }\nstruct SORT {}SOrt;\ntemplate<class T> T operator |(T v, SORT s) {\n\treturn Sort(v);\n}\nchar Snum[] = \"0123456789\";\n\n\n/* MOD */\nLL modpow(LL a, LL n, LL _MOD = MOD) {\n\tLL re = 1;\n\twhile (n > 0) {\n\t\tif (n & 1)re = re * a % _MOD;\n\t\ta = a * a % _MOD; n >>= 1;\n\t}\n\treturn re;\n}\nLL modinv(LL n, LL _MOD = MOD) {\n\treturn modpow(n, _MOD - 2, _MOD);\n}\nstruct Modl {\n\tLL val = 0;\n\tModl(LL v = 0)noexcept :val(v% MOD) { if (val < 0)v += MOD; }\n\toperator LL() { return val; }\n};\nModl operator-(const Modl & a) { Modl r; r.val = a.val ? MOD - a.val : 0; return r; }\nModl operator+(const Modl & a, const Modl & b) { Modl r(a.val + b.val); return r; }\nModl operator-(const Modl & a, const Modl & b) { Modl r(a.val - b.val); return r; }\nModl operator*(const Modl & a, const Modl & b) { Modl r(a.val * b.val); return r; }\nModl operator/(const Modl & a, const Modl & b) { Modl r(a.val * modinv(b.val, MOD)); return r; }\n\nModl operator+(const Modl & a, const int& b) { Modl r(a.val + LL(b)); return r; }\nModl operator-(const Modl & a, const int& b) { Modl r(a.val - LL(b)); return r; }\nModl operator*(const Modl & a, const int& b) { Modl r(a.val * LL(b)); return r; }\nModl operator/(const Modl & a, const int& b) { Modl r(a.val * modinv(LL(b), MOD)); return r; }\n\nModl operator+(const Modl & a, const LL & b) { Modl r(a.val + b); return r; }\nModl operator-(const Modl & a, const LL & b) { Modl r(a.val - b); return r; }\nModl operator*(const Modl & a, const LL & b) { Modl r(a.val * b); return r; }\nModl operator/(const Modl & a, const LL & b) { Modl r(a.val * modinv(b, MOD)); return r; }\n\nModl operator+(const int& a, const Modl & b) { Modl r(LL(a) + b.val); return r; }\nModl operator-(const int& a, const Modl & b) { Modl r(LL(a) - b.val); return r; }\nModl operator*(const int& a, const Modl & b) { Modl r(LL(a) * b.val); return r; }\nModl operator/(const int& a, const Modl & b) { Modl r(LL(a) * modinv(b.val, MOD)); return r; }\n\nModl operator+(const LL & a, const Modl & b) { Modl r(a + b.val); return r; }\nModl operator-(const LL & a, const Modl & b) { Modl r(a - b.val); return r; }\nModl operator*(const LL & a, const Modl & b) { Modl r(a * b.val); return r; }\nModl operator/(const LL & a, const Modl & b) { Modl r(a * modinv(b.val, MOD)); return r; }\nModl pow(Modl a, int n) { Modl r(modpow(a, n)); return r; }\nModl pow(Modl a, LL n) { Modl r(modpow(a, n)); return r; }\n\n/* RANGE */\nnamespace RangeNS {\n\ttemplate<typename T>class Range {\n\t\tconst T start_, stop_, step_;\n\tpublic:\n\t\tRange(const T& start, const T& stop, const T& step) : start_{ start }, stop_{ stop }, step_{ step } {assert(!(step_ == 0 || (start_ > stop_ && step_ > 0) || (start_ < stop_ && step_ < 0))); }\n\t\tclass iterator {\n\t\t\tT value_; const T start_, stop_, step_;\n\t\tpublic:\n\t\t\titerator(T value, T step, T start, T stop) : value_{ value }, step_{ step }, start_{ start }, stop_{ stop } {}\n\t\t\titerator operator++() { value_ = std::min(std::max(start_, stop_), std::max(std::min(start_, stop_), value_ + step_)); return *this; }\n\t\t\tT & operator*() { return value_; }\n\t\t\tconst T* operator->() { return &value_; }\n\t\t\tbool operator==(const iterator & rhs) { return value_ == rhs.value_; }\n\t\t\tbool operator!=(const iterator & rhs) { return value_ != rhs.value_; }\n\t\t};\n\t\titerator begin() const { return iterator(start_, step_, start_, stop_); }\n\t\titerator end() const { return iterator(stop_, step_, start_, stop_); }\n\t\texplicit operator vector<T>() const { vector<T>t; for (T i = start_; i < stop_; i += step_)t.push_back(i); return t; }\n\t};\n\ttemplate <typename T, typename Func, typename FuncType> class Range2 {\n\t\tusing Itr = typename T::iterator; Itr begin_, end_; Func f_;\n\tpublic:\n\t\tRange2(T& v, Func f) : begin_{ v.begin() }, end_{ v.end() }, f_{ f } {}\n\t\tclass iterator {\n\t\tpublic:\n\t\t\t//typedef std::forward_iterator_tag iterator_category;\n\t\t\titerator(Itr itr, Func f) : itr_{ itr }, f_{ f } {}\n\t\t\titerator operator++() { ++itr_; return *this; }\n\t\t\tFuncType operator*() { return f_(*itr_); }\n\t\t\tbool operator==(iterator rhs) { return rhs.itr_ == itr_; }\n\t\t\tbool operator!=(iterator rhs) { return rhs.itr_ != itr_; }\n\t\tprivate:\n\t\t\tItr itr_; Func f_;\n\t\t};\n\t\titerator begin() const { return iterator(begin_, f_); }\n\t\titerator end() const { return iterator(end_, f_); }\n\t\toperator vector<FuncType>() const { vector<FuncType>t; for (Itr i = begin_; i != end_; ++i)t.push_back(f_(*i)); return t; }\n\t};\n}\ntemplate<typename T> RangeNS::Range<T> range(const T & stop) { return RangeNS::Range<T>(T{ 0 }, stop, T{ 1 }); }\ntemplate<typename T> RangeNS::Range<T> range(const T & start, const T & stop) { return RangeNS::Range<T>(start, stop, T{ 1 }); }\ntemplate<typename T> RangeNS::Range<T> range(const T & start, const T & stop, const T & step) { return RangeNS::Range<T>(start, stop, step); }\ntemplate<typename _T> ostream& operator << (ostream & ostr, const vector<_T> & v) {\n\tif (v.size() == 0) { ostr << \"\"; return ostr; }ostr << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++)ostr << \" \" << *itr; return ostr;\n}\ntemplate<typename T> ostream& operator << (ostream & ostr, const RangeNS::Range<T> & r) { ostr << vector<T>(r); return ostr; }\ntemplate<typename T, typename Func, typename FuncType> ostream& operator << (ostream & ostr, const RangeNS::Range2<T, Func, FuncType> & r) { ostr << vector<FuncType>(r); return ostr; }\ntemplate<class T, class Func> auto operator | (T & v, Func f) { RangeNS::Range2<T, Func, decltype(f(*v.begin()))>r(v, f); return r; }\ntemplate<class T, class Func> auto operator | (T && v, Func f) { RangeNS::Range2<T, Func, decltype(f(*v.begin()))>r(v, f); return r; }\n\n/* INPUT */\nstruct inputter_Str {\n\tvector<string> inputbuffer;\n\tstring operator [](int n) { while (inputbuffer.size() <= n) { string s; cin >> s; inputbuffer.push_back(s); }return inputbuffer[n]; }\n\toperator string() { return this[inputbuffer.size()]; }\n}; inputter_Str in;\nstruct inputter_Int {\n\tint operator [](int n) { return stoi(in[n]); }\n\toperator int() { return stoi(string(in)); }\n}; inputter_Int ini;\nstruct inputter_LL {\n\tLL operator [](int n) { return stoll(in[n]); }\n\toperator int() { return stoll(string(in)); }\n}; inputter_LL inl;\nstruct inputter_Double {\n\tdouble operator [](int n) { return stod(in[n]); }\n\toperator int() { return stold(string(in)); }\n}; inputter_Double ind;\nVI invi(int n, int m) { VI v(m); for (int i = 0; i < m; ++i)v[i] = ini[n + i]; return v; }\nVL invl(int n, int m) { VL v(m); for (int i = 0; i < m; ++i)v[i] = inl[n + i]; return v; }\nint Suminvi(int n, int m) { return Sum(invi(n, m), 0); }LL Suminvl(int n, int m) { return Sum(invl(n, m), 0LL); }\nint Maxinvi(int n, int m) { return Max(invi(n, m)); }LL Maxinvl(int n, int m) { return Max(invl(n, m)); }\nint Mininvi(int n, int m) { return Min(invi(n, m)); }LL Mininvl(int n, int m) { return Min(invl(n, m)); }\n\n/* OUTPUT */\nstruct boolswitch { string t, f; boolswitch(string tr, string fa) :t(tr), f(fa) {} }yes(\"yes\", \"no\"), Yes(\"Yes\", \"No\"), YES(\"YES\", \"NO\"), Yay(\"Yay!\", \":(\");\nstruct divizer { string s; divizer(string s_) :s(s_) {} }spc(\" \"), nosp(\"\");\nstruct outputter {\n\tbool flag = false; boolswitch bs; divizer di;\n\toutputter(bool f, boolswitch b, divizer d) :flag(f), bs(b), di(d) {}\n\ttemplate<class T>outputter operator ,(T o) {\n\t\tif (flag)cout << di.s; cout << o;\n\t\toutputter t(true, bs, di); return t;\n\t}\n\toutputter operator ,(double o) {\n\t\tif (flag)cout << di.s; printf(\"%.20f\", o);\n\t\toutputter t(true, bs, di); return t;\n\t}\n\toutputter operator ,(bool o) {\n\t\tif (flag)cout << di.s; cout << (o ? bs.t : bs.f);\n\t\toutputter t(true, bs, di); return t;\n\t}\n\ttemplate<class T> outputter operator ,(vector<T> o) {\n\t\tif (flag)cout << di.s;\n\t\tfor (int i = 0; i < (int)o.size(); ++i)cout << o[i] << (i == (int)o.size() - 1 ? \"\" : di.s);\n\t\toutputter t(true, bs, di); return t;\n\t}\n\ttemplate<class T, class U> outputter operator ,(pair<T, U> o) {\n\t\tif (flag)cout << di.s;\n\t\tcout << \"[\" << o.first, \", \" << o.second << \"]\";\n\t\toutputter t(true, bs, di); return t;\n\t}\n\toutputter operator ,(outputter o) { cout << '\\n'; return o; }\n\toutputter operator ,(boolswitch b) { outputter t(flag, b, di); return t; }\n\toutputter operator ,(divizer d) { outputter t(flag, bs, d); return t; }\n}out(false, Yes, spc);\n\n/* ANSWER */\nstruct Answer {\n\tint mini = INT_MAX, maxi = INT_MIN, sumi = 0;\n\tLL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0LL;\n\tdouble mind = DBL_MAX, maxd = DBL_MIN, sumd = 0.;\n\tint count = 0;\n\tvoid operator =(int n) { mini = min(mini, n); maxi = max(maxi, n); sumi += n; count++; }\n\tvoid operator =(LL n) { minl = min(minl, n); maxl = max(maxl, n); suml += n; count++; }\n\tvoid operator =(double n) { mind = min(mind, n); maxd = max(maxd, n); sumd += n; count++; }\n}ans;\n\nint re(int n, int f, int k) {\n\treturn (f + k > n) ? f + k - n : f + k;\n}\n\nint main() {\n\tint n = ini[0], Q = ini[1];\n\tint first = 1;\n\trep(i, Q) {\n\t\tint q; cin >> q;\n\t\tif (q == 0) {\n\t\t\tint k; cin >> k;\n\t\t\tout, re(n, first, k - 1), out;\n\t\t}\n\t\telse {\n\t\t\tint k; cin >> k;\n\t\t\tfirst = re(n, first, k);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":3236,"score_of_the_acc":-0.4132,"final_rank":18},{"submission_id":"aoj_3041_3392232","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, n) for (int i = 0; i < n; i++)\n\nint main() {\n int n, q, sum=0;\n cin >> n >> q;\n REP(i,q){\n int c, k;\n cin >> c >> k;\n if(c==0){\n cout << (sum+k-1)%n+1 << endl;\n }\n else {\n sum = (sum+k)%n;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3104,"score_of_the_acc":-0.4128,"final_rank":10},{"submission_id":"aoj_3041_3390031","code_snippet":"#include <cstdio>\n\nint main() {\n int N, Q;\n scanf(\"%d %d\", &N, &Q);\n\n int ofs = 0;\n for (int i = 0; i < Q; ++i) {\n int q, k;\n scanf(\"%d %d\", &q, &k);\n if (q == 0) {\n int res = (ofs+k) % N;\n if (res == 0) res = N;\n printf(\"%d\\n\", res);\n } else if (q == 1) {\n ofs += k;\n if (ofs >= N) ofs -= N;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":2760,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3041_3390018","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\n\n\nsigned main(void) {\n int n,q;\n cin >> n >> q;\n int ind = 0;\n rep(_,q){\n int a,b;\n cin >> a >> b;\n if(a){//swap\n ind = (ind+b)%n;\n }else{//cout\n b--;\n cout << (ind+b)%n+1 << endl;\n }\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3100,"score_of_the_acc":-0.4128,"final_rank":9},{"submission_id":"aoj_3041_3385896","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double Double;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint main() {\n long long N, Q;\n cin >> N >> Q;\n long long sum = 0;\n for (int i = 0; i < Q; i++) {\n int t, k;\n cin >> t >> k;\n if (t == 1) {\n sum += k;\n sum %= N;\n } else {\n cout << (sum + k - 1) % N + 1 << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3104,"score_of_the_acc":-0.4128,"final_rank":10},{"submission_id":"aoj_3041_3383047","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvoid swap( int* a, int k, int n )\n{\n int* b = new int[k];\n int* c = new int[n-k];\n\n for( int i = 0; i < k; i++ )\n b[i] = a[i+1];\n for( int i = 0; i < n - k; i++ )\n c[i] = a[i+k+1];\n for( int i = 1; i <= n - k; i++ )\n a[i] = c[i-1];\n for( int i = n - k + 1; i <= n; i++ )\n a[i] = b[i-n+k-1];\n delete b, c;\n}\n\nint main()\n{\n int n, q, k, query;\n\n cin >> n >> q;\n\n int a[n+1];\n for( int i = 1; i <= n; i++ )\n a[i] = i;\n\n for( int i = 0; i < q; i++ )\n {\n cin >> query >> k;\n if( query )\n swap( a, k, n );\n if( !query )\n cout << a[k] << endl;\n }\n\n return 0;\n}","accuracy":0.6774193548387096,"time_ms":180,"memory_kb":334760,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_3041_3383035","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\n\nvoid swap( int* a, int k, int n )\n{\n int b[k], c[n-k];\n for( int i = 0; i < k; i++ )\n b[i] = a[i+1];\n for( int i = 0; i < n - k; i++ )\n c[i] = a[i+k+1];\n for( int i = 1; i <= n - k; i++ )\n a[i] = c[i-1];\n for( int i = n - k + 1; i <= n; i++ )\n a[i] = b[i-n+k-1];\n}\n\nint main()\n{\n int n, q, k, query;\n\n cin >> n >> q;\n\n int a[n+1];\n for( int i = 1; i <= n; i++ )\n a[i] = i;\n\n for( int i = 0; i < q; i++ )\n {\n cin >> query >> k;\n if( query )\n swap( a, k, n );\n if( !query )\n cout << a[k] << endl;\n }\n\n return 0;\n}","accuracy":0.6774193548387096,"time_ms":120,"memory_kb":3196,"score_of_the_acc":-0.6484,"final_rank":19},{"submission_id":"aoj_3041_3325634","code_snippet":"#include<iostream>\nusing namespace std;\n\nint main(){\n int n, q;\n cin >> n >> q;\n\n int cur = 0;\n int op, k;\n\n while(q-- > 0){\n cin >> op >> k;\n if(op == 0){\n cout << (cur+k-1)%n+1 << endl;\n }else{\n cur = (cur+k)%n;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3112,"score_of_the_acc":-0.4128,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_3041_10322854\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long;\\n\\nint main(){\\n\\t\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tll N,Q;\\n\\tcin>>N>>Q;\\n\\tll x=0;\\n\\tfor(int q=0;q<Q;q++){\\n\\t\\tint t,k;\\n\\t\\tcin>>t>>k;\\n\\t\\tif(t==1){\\n\\t\\t\\tx+=k;\\n\\t\\t\\tx%=N;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tcout<<(x+k-1)%N+1<<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0613,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3041_9862291\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 100;\\n//static int vect[MAX_N];\\n\\n//------------------------------------------------------------------------------\\nint solve(int N)\\n{\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n //sort(vect, vect+N);\\n //memset(S0, 0L, sizeof(S0));\\n //--------------------------------------------------------------------------\\n // compute:\\n \\n\\n //--------------------------------------------------------------------------\\n \\n //--------------------------------------------------------------------------\\n // report:\\n return -1;\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, Q, type, k, num;\\n num = scanf(\\\"%d %d \\\", &N, &Q);\\n int first = 0;\\n for (int q=0; q<Q; ++q)\\n {\\n num = scanf(\\\"%d %d \\\", &type, &k);\\n if (type == 0) printf(\\\"%d\\\\n\\\", (first+k-1)%N + 1);\\n else if (type == 1) first = (first+k)%N;\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.0026,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3041_9099656\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) { return (ull)rng() % B; }\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n, q;\\n cin >> n >> q;\\n int o = 0;\\n while (q--) {\\n int t, x;\\n cin >> t >> x;\\n if (t == 0) {\\n x -= 1;\\n cout << (o + x) % n + 1 << \\\"\\\\n\\\";\\n } else {\\n o += x;\\n o %= n;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0021,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3041_7757442\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\nusing namespace std;\\n\\nint main() {\\n\\tint top=1;\\n\\tint n,q;\\n\\tcin>>n>>q;\\n\\tfor(int i=0;i<q;i++){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\tif(a==0){\\n\\t\\t\\tint t=n-top+1;\\n\\t\\t\\tif(t>=b){\\n\\t\\t\\t\\tcout<<top+b-1<<endl;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tcout<<b-t<<endl;\\n\\t\\t\\t}\\n\\t\\t}else if(a==1){\\n\\t\\t\\tint t=n-top+1;\\n\\t\\t\\tif(t>b){\\n\\t\\t\\t\\ttop=top+b;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ttop=b-t+1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tcout<<\\\"top=\\\"<<top<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3041_6219376\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\nint main(){\\n int n, q;\\n cin >> n >> q;\\n int top = 0;\\n while(q--){\\n int op, k;\\n cin >> op >> k;\\n if(op == 0){\\n cout << (top+k-1)%n + 1 << '\\\\n';\\n }else{\\n top += k;\\n top %= n;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.2963,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3041_6001953\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<ll,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\n\\nconst int MX = 1000010;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nvoid Init() {\\n\\n}\\n\\nvoid solve() {\\n\\n}\\nint main() {\\n //freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n //freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n ll n=_r(),q=_r();\\n ll head=0;\\n while(q--){\\n ll ope=_r(),k=_r();\\n if(ope)\\n head=(head+k)%n;\\n else\\n printf(\\\"%lld\\\\n\\\",(head+(k-1))%n+1);\\n }\\n\\n#ifdef VSC\\n getchar();\\n#endif\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3041_4321404\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n int n, q; cin >> n >> q;\\n int ofs = 0;\\n while (q--) {\\n int op, k; cin >> op >> k;\\n if (op == 0) cout << (ofs + k - 1) % n + 1 << endl;\\n if (op == 1) ofs = (ofs + k) % n;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.4129,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3041_4235569\",\n \"code_snippet\": \"/* _/ _/ _/_/_/ _/\\n _/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/\\n _/ _/ _/ _/ _/ _/ _/_/_/ _/\\n _/ _/ _/ _/ _/ _/ _/ _/ _/\\n _/_/ _/_/ _/_/ _/_/ _/_/ _/ */\\n#include<iostream>\\n#include<algorithm>\\n#include<cmath>\\n#include<iomanip>\\n#include<set>\\n#include<map>\\n#include<queue>\\n#include<vector>\\nusing namespace std;\\nusing ll=long long;\\nconst int MOD=1e9+7;\\nconst double pi=3.14159265358979323846;\\nconst int inf=2e9;\\nconst ll INF=1e18;\\nusing P=pair<int,int>;\\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\nint main() {\\n cin.tie(0),cout.tie(0);\\n ios::sync_with_stdio(false);\\n int n,q,a,b,now=1;\\n cin >> n >> q;\\n while(q--) {\\n cin >> a >> b;\\n if(!a) {\\n if(now+b-1>n) {\\n cout << now+b-1-n << \\\"\\\\n\\\";\\n }\\n else {\\n cout << now+b-1 << \\\"\\\\n\\\";\\n }\\n }\\n else {\\n if(now+b>n) {\\n now=now+b-n;\\n }\\n else {\\n now=now+b;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3041_4011317\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int N, Q;\\n int op, k;\\n int index = 0;\\n \\n cin >> N >> Q;\\n while (Q--) {\\n cin >> op >> k;\\n if (op == 0) {\\n int element = (index + k) % N;\\n element ? cout << element << endl : cout << N << endl;\\n } else if (op == 1) {\\n index = (index + k) % N;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3041_3892258\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3041.cc: \\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\n/* typedef */\\n\\n/* global variables */\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, q;\\n scanf(\\\"%d%d\\\", &n, &q);\\n\\n int h = 0;\\n while (q--) {\\n int op, k;\\n scanf(\\\"%d%d\\\", &op, &k);\\n\\n if (op == 0) {\\n k--;\\n printf(\\\"%d\\\\n\\\", (h + k) % n + 1);\\n }\\n else\\n h = (h + k) % n;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3041_3668301\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define REP(i,n) for(ll i =0;i<n;++i)\\n\\nint main(){\\n int n,q;\\n cin>>n>>q;\\n int pos=1;\\n REP(i,q){\\n int t;cin>>t;\\n int k;cin>>k;\\n \\n if(t==0){\\n int tar;\\n if(pos+k-1>n)tar=pos+k-1-n;\\n else tar=pos+k-1;\\n cout<<tar<<endl;\\n }else{\\n k++;\\n int tar;\\n if(pos+k-1>n)tar=pos+k-1-n;\\n else tar=pos+k-1;\\n pos=tar;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3041_3544344\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint main() {\\n\\tint n,q,p=1,c,x;\\n\\tcin>>n>>q;\\n\\tfor(int i=0;i<q;i++){\\n\\t\\tcin>>c>>x;\\n\\t\\tif(!c)cout<<((p+x-1)%n==0? n:(p+x-1)%n)<<endl;\\n\\t\\telse {p=(p+x)%n; if(p==0)p=n;}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3041_3542129\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define rep(i, n) for(int i=0; i<(n); ++i)\\n#define repi(n) for(int i=0; i<(n); ++i)\\n#define repj(n) for(int j=0; j<(n); ++j)\\n#define repk(n) for(int k=0; k<(n); ++k)\\n#define FOR(i, m, n) for(int i=(m); i<(n); ++i)\\n#define sz(x) ((int)(x).size())\\n#define all(x) (x).begin(),(x).end()\\n#define mp make_pair\\n#define pb push_back\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define qp(f) [](auto i){return f;}\\nusing LL=long long;\\nusing VI=vector<int>;\\nusing VL=vector<LL>;\\nusing VS=vector<string>;\\nusing VVI=vector<vector<int>>;\\nusing PII=pair<int, int>;\\nconst int inf = (int)1e9;\\nconst LL MOD = 1000000007;\\nconst double pi = acos(-1.0);\\ntemplate<class T>T Sort(T & a) { sort(a.begin(), a.end()); return a; }\\ntemplate<class T>T ReSort(T& a) { sort(a.rbegin(), a.rend()); return a; }\\ntemplate<class T>T Reverse(T& a) { reverse(a.begin(), a.end()); return a; }\\ntemplate<class T>void Unique(T& a) { a.erase(unique(a.begin(), a.end()), a.end()); }\\ntemplate<class T>auto Max(T a) { return *max_element(a.begin(), a.end()); }\\ntemplate<class T>auto Min(T a) { return *min_element(a.begin(), a.end()); }\\ntemplate<class T, class U>int Count(T a, U c) { return count(a.begin(), a.end(), c); }\\ntemplate<class T, class U>U Sum(T a, U init = 0) { return accumulate(a.begin(), a.end(), init); }\\ntemplate<class T>T Age(T a, T b) { return (a + b - 1) / b; }\\ntemplate<class T>T gcd(T n, T m) { return m == 0 ? n : gcd(m, n % m); }\\ntemplate<class T>T lcm(T n, T m) { return n / gcd(n, m) * m; }\\nstruct SORT {}SOrt;\\ntemplate<class T> T operator |(T v, SORT s) {\\n\\treturn Sort(v);\\n}\\nchar Snum[] = \\\"0123456789\\\";\\n\\n\\n/* MOD */\\nLL modpow(LL a, LL n, LL _MOD = MOD) {\\n\\tLL re = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1)re = re * a % _MOD;\\n\\t\\ta = a * a % _MOD; n >>= 1;\\n\\t}\\n\\treturn re;\\n}\\nLL modinv(LL n, LL _MOD = MOD) {\\n\\treturn modpow(n, _MOD - 2, _MOD);\\n}\\nstruct Modl {\\n\\tLL val = 0;\\n\\tModl(LL v = 0)noexcept :val(v% MOD) { if (val < 0)v += MOD; }\\n\\toperator LL() { return val; }\\n};\\nModl operator-(const Modl & a) { Modl r; r.val = a.val ? MOD - a.val : 0; return r; }\\nModl operator+(const Modl & a, const Modl & b) { Modl r(a.val + b.val); return r; }\\nModl operator-(const Modl & a, const Modl & b) { Modl r(a.val - b.val); return r; }\\nModl operator*(const Modl & a, const Modl & b) { Modl r(a.val * b.val); return r; }\\nModl operator/(const Modl & a, const Modl & b) { Modl r(a.val * modinv(b.val, MOD)); return r; }\\n\\nModl operator+(const Modl & a, const int& b) { Modl r(a.val + LL(b)); return r; }\\nModl operator-(const Modl & a, const int& b) { Modl r(a.val - LL(b)); return r; }\\nModl operator*(const Modl & a, const int& b) { Modl r(a.val * LL(b)); return r; }\\nModl operator/(const Modl & a, const int& b) { Modl r(a.val * modinv(LL(b), MOD)); return r; }\\n\\nModl operator+(const Modl & a, const LL & b) { Modl r(a.val + b); return r; }\\nModl operator-(const Modl & a, const LL & b) { Modl r(a.val - b); return r; }\\nModl operator*(const Modl & a, const LL & b) { Modl r(a.val * b); return r; }\\nModl operator/(const Modl & a, const LL & b) { Modl r(a.val * modinv(b, MOD)); return r; }\\n\\nModl operator+(const int& a, const Modl & b) { Modl r(LL(a) + b.val); return r; }\\nModl operator-(const int& a, const Modl & b) { Modl r(LL(a) - b.val); return r; }\\nModl operator*(const int& a, const Modl & b) { Modl r(LL(a) * b.val); return r; }\\nModl operator/(const int& a, const Modl & b) { Modl r(LL(a) * modinv(b.val, MOD)); return r; }\\n\\nModl operator+(const LL & a, const Modl & b) { Modl r(a + b.val); return r; }\\nModl operator-(const LL & a, const Modl & b) { Modl r(a - b.val); return r; }\\nModl operator*(const LL & a, const Modl & b) { Modl r(a * b.val); return r; }\\nModl operator/(const LL & a, const Modl & b) { Modl r(a * modinv(b.val, MOD)); return r; }\\nModl pow(Modl a, int n) { Modl r(modpow(a, n)); return r; }\\nModl pow(Modl a, LL n) { Modl r(modpow(a, n)); return r; }\\n\\n/* RANGE */\\nnamespace RangeNS {\\n\\ttemplate<typename T>class Range {\\n\\t\\tconst T start_, stop_, step_;\\n\\tpublic:\\n\\t\\tRange(const T& start, const T& stop, const T& step) : start_{ start }, stop_{ stop }, step_{ step } {assert(!(step_ == 0 || (start_ > stop_ && step_ > 0) || (start_ < stop_ && step_ < 0))); }\\n\\t\\tclass iterator {\\n\\t\\t\\tT value_; const T start_, stop_, step_;\\n\\t\\tpublic:\\n\\t\\t\\titerator(T value, T step, T start, T stop) : value_{ value }, step_{ step }, start_{ start }, stop_{ stop } {}\\n\\t\\t\\titerator operator++() { value_ = std::min(std::max(start_, stop_), std::max(std::min(start_, stop_), value_ + step_)); return *this; }\\n\\t\\t\\tT & operator*() { return value_; }\\n\\t\\t\\tconst T* operator->() { return &value_; }\\n\\t\\t\\tbool operator==(const iterator & rhs) { return value_ == rhs.value_; }\\n\\t\\t\\tbool operator!=(const iterator & rhs) { return value_ != rhs.value_; }\\n\\t\\t};\\n\\t\\titerator begin() const { return iterator(start_, step_, start_, stop_); }\\n\\t\\titerator end() const { return iterator(stop_, step_, start_, stop_); }\\n\\t\\texplicit operator vector<T>() const { vector<T>t; for (T i = start_; i < stop_; i += step_)t.push_back(i); return t; }\\n\\t};\\n\\ttemplate <typename T, typename Func, typename FuncType> class Range2 {\\n\\t\\tusing Itr = typename T::iterator; Itr begin_, end_; Func f_;\\n\\tpublic:\\n\\t\\tRange2(T& v, Func f) : begin_{ v.begin() }, end_{ v.end() }, f_{ f } {}\\n\\t\\tclass iterator {\\n\\t\\tpublic:\\n\\t\\t\\t//typedef std::forward_iterator_tag iterator_category;\\n\\t\\t\\titerator(Itr itr, Func f) : itr_{ itr }, f_{ f } {}\\n\\t\\t\\titerator operator++() { ++itr_; return *this; }\\n\\t\\t\\tFuncType operator*() { return f_(*itr_); }\\n\\t\\t\\tbool operator==(iterator rhs) { return rhs.itr_ == itr_; }\\n\\t\\t\\tbool operator!=(iterator rhs) { return rhs.itr_ != itr_; }\\n\\t\\tprivate:\\n\\t\\t\\tItr itr_; Func f_;\\n\\t\\t};\\n\\t\\titerator begin() const { return iterator(begin_, f_); }\\n\\t\\titerator end() const { return iterator(end_, f_); }\\n\\t\\toperator vector<FuncType>() const { vector<FuncType>t; for (Itr i = begin_; i != end_; ++i)t.push_back(f_(*i)); return t; }\\n\\t};\\n}\\ntemplate<typename T> RangeNS::Range<T> range(const T & stop) { return RangeNS::Range<T>(T{ 0 }, stop, T{ 1 }); }\\ntemplate<typename T> RangeNS::Range<T> range(const T & start, const T & stop) { return RangeNS::Range<T>(start, stop, T{ 1 }); }\\ntemplate<typename T> RangeNS::Range<T> range(const T & start, const T & stop, const T & step) { return RangeNS::Range<T>(start, stop, step); }\\ntemplate<typename _T> ostream& operator << (ostream & ostr, const vector<_T> & v) {\\n\\tif (v.size() == 0) { ostr << \\\"\\\"; return ostr; }ostr << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++)ostr << \\\" \\\" << *itr; return ostr;\\n}\\ntemplate<typename T> ostream& operator << (ostream & ostr, const RangeNS::Range<T> & r) { ostr << vector<T>(r); return ostr; }\\ntemplate<typename T, typename Func, typename FuncType> ostream& operator << (ostream & ostr, const RangeNS::Range2<T, Func, FuncType> & r) { ostr << vector<FuncType>(r); return ostr; }\\ntemplate<class T, class Func> auto operator | (T & v, Func f) { RangeNS::Range2<T, Func, decltype(f(*v.begin()))>r(v, f); return r; }\\ntemplate<class T, class Func> auto operator | (T && v, Func f) { RangeNS::Range2<T, Func, decltype(f(*v.begin()))>r(v, f); return r; }\\n\\n/* INPUT */\\nstruct inputter_Str {\\n\\tvector<string> inputbuffer;\\n\\tstring operator [](int n) { while (inputbuffer.size() <= n) { string s; cin >> s; inputbuffer.push_back(s); }return inputbuffer[n]; }\\n\\toperator string() { return this[inputbuffer.size()]; }\\n}; inputter_Str in;\\nstruct inputter_Int {\\n\\tint operator [](int n) { return stoi(in[n]); }\\n\\toperator int() { return stoi(string(in)); }\\n}; inputter_Int ini;\\nstruct inputter_LL {\\n\\tLL operator [](int n) { return stoll(in[n]); }\\n\\toperator int() { return stoll(string(in)); }\\n}; inputter_LL inl;\\nstruct inputter_Double {\\n\\tdouble operator [](int n) { return stod(in[n]); }\\n\\toperator int() { return stold(string(in)); }\\n}; inputter_Double ind;\\nVI invi(int n, int m) { VI v(m); for (int i = 0; i < m; ++i)v[i] = ini[n + i]; return v; }\\nVL invl(int n, int m) { VL v(m); for (int i = 0; i < m; ++i)v[i] = inl[n + i]; return v; }\\nint Suminvi(int n, int m) { return Sum(invi(n, m), 0); }LL Suminvl(int n, int m) { return Sum(invl(n, m), 0LL); }\\nint Maxinvi(int n, int m) { return Max(invi(n, m)); }LL Maxinvl(int n, int m) { return Max(invl(n, m)); }\\nint Mininvi(int n, int m) { return Min(invi(n, m)); }LL Mininvl(int n, int m) { return Min(invl(n, m)); }\\n\\n/* OUTPUT */\\nstruct boolswitch { string t, f; boolswitch(string tr, string fa) :t(tr), f(fa) {} }yes(\\\"yes\\\", \\\"no\\\"), Yes(\\\"Yes\\\", \\\"No\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Yay(\\\"Yay!\\\", \\\":(\\\");\\nstruct divizer { string s; divizer(string s_) :s(s_) {} }spc(\\\" \\\"), nosp(\\\"\\\");\\nstruct outputter {\\n\\tbool flag = false; boolswitch bs; divizer di;\\n\\toutputter(bool f, boolswitch b, divizer d) :flag(f), bs(b), di(d) {}\\n\\ttemplate<class T>outputter operator ,(T o) {\\n\\t\\tif (flag)cout << di.s; cout << o;\\n\\t\\toutputter t(true, bs, di); return t;\\n\\t}\\n\\toutputter operator ,(double o) {\\n\\t\\tif (flag)cout << di.s; printf(\\\"%.20f\\\", o);\\n\\t\\toutputter t(true, bs, di); return t;\\n\\t}\\n\\toutputter operator ,(bool o) {\\n\\t\\tif (flag)cout << di.s; cout << (o ? bs.t : bs.f);\\n\\t\\toutputter t(true, bs, di); return t;\\n\\t}\\n\\ttemplate<class T> outputter operator ,(vector<T> o) {\\n\\t\\tif (flag)cout << di.s;\\n\\t\\tfor (int i = 0; i < (int)o.size(); ++i)cout << o[i] << (i == (int)o.size() - 1 ? \\\"\\\" : di.s);\\n\\t\\toutputter t(true, bs, di); return t;\\n\\t}\\n\\ttemplate<class T, class U> outputter operator ,(pair<T, U> o) {\\n\\t\\tif (flag)cout << di.s;\\n\\t\\tcout << \\\"[\\\" << o.first, \\\", \\\" << o.second << \\\"]\\\";\\n\\t\\toutputter t(true, bs, di); return t;\\n\\t}\\n\\toutputter operator ,(outputter o) { cout << '\\\\n'; return o; }\\n\\toutputter operator ,(boolswitch b) { outputter t(flag, b, di); return t; }\\n\\toutputter operator ,(divizer d) { outputter t(flag, bs, d); return t; }\\n}out(false, Yes, spc);\\n\\n/* ANSWER */\\nstruct Answer {\\n\\tint mini = INT_MAX, maxi = INT_MIN, sumi = 0;\\n\\tLL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0LL;\\n\\tdouble mind = DBL_MAX, maxd = DBL_MIN, sumd = 0.;\\n\\tint count = 0;\\n\\tvoid operator =(int n) { mini = min(mini, n); maxi = max(maxi, n); sumi += n; count++; }\\n\\tvoid operator =(LL n) { minl = min(minl, n); maxl = max(maxl, n); suml += n; count++; }\\n\\tvoid operator =(double n) { mind = min(mind, n); maxd = max(maxd, n); sumd += n; count++; }\\n}ans;\\n\\nint re(int n, int f, int k) {\\n\\treturn (f + k > n) ? f + k - n : f + k;\\n}\\n\\nint main() {\\n\\tint n = ini[0], Q = ini[1];\\n\\tint first = 1;\\n\\trep(i, Q) {\\n\\t\\tint q; cin >> q;\\n\\t\\tif (q == 0) {\\n\\t\\t\\tint k; cin >> k;\\n\\t\\t\\tout, re(n, first, k - 1), out;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint k; cin >> k;\\n\\t\\t\\tfirst = re(n, first, k);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.4132,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3041_3392232\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i, n) for (int i = 0; i < n; i++)\\n\\nint main() {\\n int n, q, sum=0;\\n cin >> n >> q;\\n REP(i,q){\\n int c, k;\\n cin >> c >> k;\\n if(c==0){\\n cout << (sum+k-1)%n+1 << endl;\\n }\\n else {\\n sum = (sum+k)%n;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3041_3390031\",\n \"code_snippet\": \"#include <cstdio>\\n\\nint main() {\\n int N, Q;\\n scanf(\\\"%d %d\\\", &N, &Q);\\n\\n int ofs = 0;\\n for (int i = 0; i < Q; ++i) {\\n int q, k;\\n scanf(\\\"%d %d\\\", &q, &k);\\n if (q == 0) {\\n int res = (ofs+k) % N;\\n if (res == 0) res = N;\\n printf(\\\"%d\\\\n\\\", res);\\n } else if (q == 1) {\\n ofs += k;\\n if (ofs >= N) ofs -= N;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2760,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3041_3390018\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<cctype>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define LINF (ll)INF*INF\\n#define MOD 1000000007\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define loop(i,a,n) for(int i=a;i<(n);i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\n\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vp;\\n\\nint gcd(int a, int b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\nint lcm(int a, int b){\\n return a/gcd(a,b)*b;\\n}\\n\\n\\nsigned main(void) {\\n int n,q;\\n cin >> n >> q;\\n int ind = 0;\\n rep(_,q){\\n int a,b;\\n cin >> a >> b;\\n if(a){//swap\\n ind = (ind+b)%n;\\n }else{//cout\\n b--;\\n cout << (ind+b)%n+1 << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3041_3385896\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double Double;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n\\nint main() {\\n long long N, Q;\\n cin >> N >> Q;\\n long long sum = 0;\\n for (int i = 0; i < Q; i++) {\\n int t, k;\\n cin >> t >> k;\\n if (t == 1) {\\n sum += k;\\n sum %= N;\\n } else {\\n cout << (sum + k - 1) % N + 1 << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3104,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3041_3383047\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\n\\nvoid swap( int* a, int k, int n )\\n{\\n int* b = new int[k];\\n int* c = new int[n-k];\\n\\n for( int i = 0; i < k; i++ )\\n b[i] = a[i+1];\\n for( int i = 0; i < n - k; i++ )\\n c[i] = a[i+k+1];\\n for( int i = 1; i <= n - k; i++ )\\n a[i] = c[i-1];\\n for( int i = n - k + 1; i <= n; i++ )\\n a[i] = b[i-n+k-1];\\n delete b, c;\\n}\\n\\nint main()\\n{\\n int n, q, k, query;\\n\\n cin >> n >> q;\\n\\n int a[n+1];\\n for( int i = 1; i <= n; i++ )\\n a[i] = i;\\n\\n for( int i = 0; i < q; i++ )\\n {\\n cin >> query >> k;\\n if( query )\\n swap( a, k, n );\\n if( !query )\\n cout << a[k] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.6774193548387096,\n \"time_ms\": 180,\n \"memory_kb\": 334760,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3041_3383035\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\n\\nvoid swap( int* a, int k, int n )\\n{\\n int b[k], c[n-k];\\n for( int i = 0; i < k; i++ )\\n b[i] = a[i+1];\\n for( int i = 0; i < n - k; i++ )\\n c[i] = a[i+k+1];\\n for( int i = 1; i <= n - k; i++ )\\n a[i] = c[i-1];\\n for( int i = n - k + 1; i <= n; i++ )\\n a[i] = b[i-n+k-1];\\n}\\n\\nint main()\\n{\\n int n, q, k, query;\\n\\n cin >> n >> q;\\n\\n int a[n+1];\\n for( int i = 1; i <= n; i++ )\\n a[i] = i;\\n\\n for( int i = 0; i < q; i++ )\\n {\\n cin >> query >> k;\\n if( query )\\n swap( a, k, n );\\n if( !query )\\n cout << a[k] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.6774193548387096,\n \"time_ms\": 120,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.6484,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3041_3325634\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint main(){\\n int n, q;\\n cin >> n >> q;\\n\\n int cur = 0;\\n int op, k;\\n\\n while(q-- > 0){\\n cin >> op >> k;\\n if(op == 0){\\n cout << (cur+k-1)%n+1 << endl;\\n }else{\\n cur = (cur+k)%n;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.4128,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1884,"cells":{"group_id":{"kind":"string","value":"aoj_3038_cpp"},"problem_description":{"kind":"string","value":"Problem M: Manhattan Bomb\nProblem\n2次元平面上に$n$個の爆弾がある。爆弾にはそれぞれ1から$n$までの番号が割り振られており、$i$番目の爆弾は座標$(x_i,y_i)$に存在している。\nなお、どの爆弾も原点からのマンハッタン距離が等しいことが分かっている。\n$i$番目の爆弾が爆発したとき、座標$(x_i,y_i)$からのマンハッタン距離が$r_i$以内の座標に存在している爆弾も連鎖的に爆発する。\n$n$個の爆弾それぞれについて、その爆弾のみに着火した場合に、爆発せずに残る爆弾の個数を求めよ。\nInput\n$n$\n$x_1$ $y_1$ $r_1$\n$x_2$ $y_2$ $r_2$\n...\n$x_n$ $y_n$ $r_n$\n入力はすべて整数で与えられる。\n1行目に爆弾の個数$n$が与えられる。\n続く$n$行のうち$i$行目には$i$番目の爆弾の情報を表す$x_i,y_i,r_i$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$2$ ≤ $n$ ≤ $2 \\times 10^5$\n$-10^9$ ≤ $x_i,y_i$ ≤ $10^9$\n$1$ ≤ $r_i$ ≤ $10^9$\n$|x_i|+|y_i| = |x_j|+|y_j|$ $( 1 ≤ i , j ≤ n )$\n同じ座標に複数の爆弾が存在することはない\nOutput\n$i$行目には$i$番目の爆弾のみに着火した場合に、爆発せずに残る爆弾の個数を出力せよ。\nSample Input 1\n2\n-1 -1 10\n1 1 1\nSample Output 1\n0\n1\nSample Input 2\n3\n3 2 2\n4 -1 4\n1 -4 7\nSample Output 2\n2\n1\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3038_3042316","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n Int n;\n F f;\n G g;\n T ti;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(Int n_,F f,G g,T ti):\n f(f),g(g),ti(ti){\n init(n_);\n }\n void init(Int n_){\n n=1;\n while(n<n_) n*=2;\n dat.assign(2*n-1,ti);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\n for(Int i=n-2;i>=0;i--)\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\n }\n void update(Int k,E a){\n k+=n-1;\n dat[k]=g(dat[k],a);\n while(k>0){\n k=(k-1)/2;\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\n }\n }\n inline T query(Int a,Int b){\n T vl=ti,vr=ti;\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,dat[(l++)-1]);\n if(r&1) vr=f(dat[(--r)-1],vr);\n }\n return f(vl,vr);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n cin>>n;\n using T = tuple<Int, Int, Int>;\n vector<T> v(n);\n map<T, Int> m;\n for(Int i=0;i<n;i++){\n Int x,y,r;\n cin>>x>>y>>r;\n v[i]=T(x+y,x-y,r);\n m[v[i]]=i;\n }\n \n sort(v.begin(),v.end(),[&](T a,T b){\n Int au,av,ar;\n tie(au,av,ar)=a;\n Int bu,bv,br;\n tie(bu,bv,br)=b;\n return atan2(av,au)<atan2(bv,bu);\n });\n\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\n\n using P = pair<Int, Int>;\n SegmentTree<P, P>::F f=[&](P a,P b){\n return P(min(a.first,b.first),max(a.second,b.second));};\n\n Int N=n*3;\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\n for(Int i=0;i<N;i++) seg.update(i,P(i,i));\n\n auto check=[&](Int a,Int b){\n return max(abs(get<0>(v[a])-get<0>(v[b])),\n\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\n };\n \n vector<Int> dp(N,N);\n for(Int i=0;i<N;i++){\n dp[i]=i;\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\n seg.update(i,P(dp[i],dp[i]));\n }\n fill(dp.begin(),dp.end(),-1);\n for(Int i=N-1;i>=0;i--){\n dp[i]=i;\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\n seg.update(i,P(dp[i],dp[i]));\n }\n \n Int flg=1;\n while(flg){\n flg=0;\n for(Int i=0;i<N;i++){\n auto a=seg.query(i,i+1);\n auto b=seg.query(a.first,a.second+1);\n flg|=(a!=b);\n seg.update(i,b);\n }\n }\n\n vector<Int> ans(n);\n for(Int i=0;i<n;i++){\n Int idx=m[v[i]];\n auto a=seg.query(n+i,n+i+1);\n Int k=(i-a.first+1)+(a.second-i+1)-1;\n ans[idx]=min(k,n);\n }\n \n for(Int i=0;i<n;i++) cout<<n-ans[i]<<endl;\n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":71832,"score_of_the_acc":-0.4712,"final_rank":3},{"submission_id":"aoj_3038_2752069","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\n\n\nint L;\n\ninline int T(pint p){\n if(p.fi==L)return 0;\n if(p.fi==-L)return 2;\n if(p.se==L)return 1;\n return 3;\n}\n\nbool comp(const pint &a,const pint &b){\n if(T(a)!=T(b))return T(a)<T(b);\n if(T(a)==0){\n return a.se<b.se;\n }\n else if(T(a)==1){\n return a.fi<b.fi;\n }\n else if(T(a)==2){\n return a.se>b.se;\n }\n else{\n return a.fi>b.fi;\n }\n}\n\nint dist(pint p,pint q){\n return max(abs(p.fi-q.fi),abs(p.se-q.se));\n}\n\n\nvpint ps;\n\nint N;\nint X[222222],Y[222222],R[222222];\nint l[222222],r[222222];\n\nint id(int k){\n int lb=-1,ub=N;\n while(ub-lb>1){\n int mid=(ub+lb)/2;\n if(comp(ps[mid],pint(Y[k],X[k])))lb=mid;\n else ub=mid;\n }\n return ub;\n}\n\nconst int SEG=1<<18;\nvector<vint>G(SEG*2);\nvoid addEdge(int a,int b,int x,int k=0,int l=0,int r=SEG){\n if(r<=a||b<=l)return;\n if(a<=l&&r<=b){\n G[x].pb(k);\n return;\n }\n addEdge(a,b,x,k*2+1,l,(l+r)/2);\n addEdge(a,b,x,k*2+2,(l+r)/2,r);\n}\n\n\nnamespace SCC{\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\n used[v]=true;\n for(auto u:G[v]){\n if(!used[u])visit(G,vs,used,u);\n }\n vs.push_back(v);\n }\n\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\n comp[v]=k;\n used[v]=true;\n vec.push_back(v);\n\n for(auto u:T[v]){\n if(!used[u])visit2(T,used,comp,vec,k,u);\n }\n }\n\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\n vector<vector<int>>T(G.size());\n for(int i=0;i<G.size();i++){\n for(auto v:G[i]){\n T[v].push_back(i);\n }\n }\n comp.resize(G.size());\n\n vector<int>vs(G.size());\n vector<int>used(G.size());\n for(int i=0;i<G.size();i++){\n if(!used[i])visit(G,vs,used,i);\n }\n reverse(vs.begin(),vs.end());\n fill(used.begin(),used.end(),0);\n\n int K=0;\n vector<vector<int>>S;\n for(auto v:vs){\n if(!used[v]){\n S.push_back(vector<int>());\n visit2(T,used,comp,S.back(),K++,v);\n }\n }\n\n H.resize(K);\n fill(used.begin(),used.end(),0);\n for(int i=0;i<K;i++){\n for(auto v:S[i]){\n for(auto u:G[v]){\n if(used[comp[u]]||comp[v]==comp[u])continue;\n used[comp[u]]=true;\n H[comp[v]].push_back(comp[u]);\n }\n }\n for(auto v:H[i])used[v]=false;\n }\n\n }\n}\n\nvpint add(vpint x,vpint y){\n vpint z;\n rep(i,x.size())z.pb(x[i]);\n rep(i,y.size())z.pb(y[i]);\n sort(all(z));\n vpint w;\n for(auto p:z){\n if(w.size()==0||w.back().se+1<p.fi)w.pb(p);\n else w.back().se=p.se;\n }\n return w;\n}\n\nsigned main(){\n cin>>N;\n rep(i,N){\n cin>>X[i]>>Y[i]>>R[i];\n L=abs(X[i])+abs(Y[i]);\n int x=X[i]+Y[i];\n int y=X[i]-Y[i];\n X[i]=x;\n Y[i]=y;\n }\n\n\n rep(i,N)ps.pb({Y[i],X[i]});\n sort(all(ps),comp);\n\n vint rrr(N);\n rep(i,N)rrr[id(i)]=R[i];\n rep(i,N)R[i]=rrr[i];\n\n rep(i,N)ps.pb(ps[i]);\n\n\n rep(i,N){\n if(R[i]>=2*L){\n r[i]=(i-1+N)%N;\n continue;\n }\n int lb=0,ub=N;\n while(ub-lb>1){\n int mid=(ub+lb)/2;\n bool flag;\n if(T(ps[i])==T(ps[i+mid]))flag=comp(ps[i],ps[i+mid])&&dist(ps[i],ps[i+mid])<=R[i];\n else if((T(ps[i])+1)%4==T(ps[i+mid]))flag=dist(ps[i],ps[i+mid])<=R[i];\n else flag=false;\n\n if(flag)lb=mid;\n else ub=mid;\n }\n r[i]=(i+lb)%N;\n }\n\n rep(i,N){\n if(R[i]>2*L){\n l[i]=i;\n continue;\n }\n int lb=0,ub=N;\n while(ub-lb>1){\n int mid=(ub+lb)/2;\n bool flag;\n if(T(ps[i+N])==T(ps[i+N-mid]))flag=comp(ps[i+N-mid],ps[i+N])&&dist(ps[i+N-mid],ps[i+N])<=R[i];\n else if((T(ps[i+N])+3)%4==T(ps[i+N-mid]))flag=dist(ps[i+N-mid],ps[i+N])<=R[i];\n else flag=false;\n\n if(flag)lb=mid;\n else ub=mid;\n }\n l[i]=(i+N-lb)%N;\n }\n\n\n rep(i,SEG-1){\n G[i].pb(i*2+1);G[i].pb(i*2+2);\n }\n\n rep(i,N){\n if(l[i]<=r[i]){\n addEdge(l[i],r[i]+1,i+SEG-1);\n }\n else{\n addEdge(l[i],N,i+SEG-1);\n addEdge(0,r[i]+1,i+SEG-1);\n }\n }\n\n vector<vint>H;\n vint ra;\n SCC::decompose(G,H,ra);\n vector<vpint>dp(H.size());\n rep(i,N){\n int k=ra[i+SEG-1];\n\n vpint hoge;\n if(l[i]<=r[i])hoge.pb({l[i],r[i]});\n else{\n hoge.pb({0,r[i]});\n hoge.pb({l[i],N-1});\n }\n dp[k]=add(dp[k],hoge);\n\n }\n\n\n /*\n rep(i,N){\n int k=ra[id(i)+SEG-1];\n cout<<k<<endl;\n for(auto p:dp[k])cout<<p.fi<<\" \"<<p.se<<endl;\n cout<<\"---------\"<<endl;\n }*/\n\n\n for(int i=H.size()-1;i>=0;i--){\n for(auto u:H[i]){\n dp[i]=add(dp[i],dp[u]);\n }\n }\n\n rep(i,N){\n int k=ra[id(i)+SEG-1];\n int ans=0;\n for(auto p:dp[k])ans+=p.se-p.fi+1;\n cout<<N-ans<<endl;\n }\n return 0;\n}","accuracy":0.13333333333333333,"time_ms":730,"memory_kb":139296,"score_of_the_acc":-0.5956,"final_rank":12},{"submission_id":"aoj_3038_2751481","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n#include <numeric>\n#include <random>\n#include <vector>\n#include <array>\n#include <bitset>\n#include <queue>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n\nusing namespace std;\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\nconstexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }\ntemplate<class T> using V = vector<T>;\ntemplate<class T> using VV = V<V<T>>;\n\nstruct E {\n int to;\n};\n\nstruct SCC {\n V<int> id;\n VV<int> groups;\n};\n\ntemplate<class E>\nstruct SCC_EXEC {\n const VV<E> &g;\n int tm = 0;\n V<bool> inS;\n V<int> id, low, ord, st;\n VV<int> groups;\n void dfs(int v) {\n low[v] = ord[v] = tm++;\n st.push_back(v);\n inS[v] = true;\n for (auto e: g[v]) {\n if (ord[e.to] == -1) {\n dfs(e.to);\n low[v] = min(low[v], low[e.to]);\n } else if (inS[e.to]) {\n low[v] = min(low[v], ord[e.to]);\n }\n }\n if (low[v] == ord[v]) {\n V<int> gr;\n while (true) {\n int u = st.back(); st.pop_back();\n gr.push_back(u);\n if (u == v) break;\n }\n for (int x: gr) inS[x] = false;\n groups.push_back(gr);\n }\n }\n SCC info;\n SCC_EXEC(const VV<E> &g) : g(g) {\n int n = int(g.size());\n inS = V<bool>(n); low = V<int>(n); ord = V<int>(n, -1);\n for (int i = 0; i < n; i++) {\n if (ord[i] == -1) dfs(i);\n }\n reverse(begin(groups), end(groups));\n V<int> id(n);\n for (int i = 0; i < int(groups.size()); i++) {\n for (int x: groups[i]) {\n id[x] = i;\n }\n }\n info = SCC{id, groups};\n }\n};\ntemplate<class E> SCC scc(const VV<E> &g) { return SCC_EXEC<E>(g).info; }\n\nint n, N;\nVV<E> g;\n\nvoid adde(int i, int j) {\n// cout << \"adde \" << i << \" -> \" << j << endl;\n g[i].push_back(E{j});\n}\n\nstruct Node {\n using NP = Node*;\n int sz;\n NP l, r;\n\n int id;\n\n Node(int sz, int off) : sz(sz) {\n id = N; N++;\n g.push_back(V<E>{});\n\n if (sz == 1) {\n adde(id, off);\n return;\n }\n l = new Node(sz/2, off);\n r = new Node(sz-sz/2, off+sz/2);\n adde(id, l->id);\n adde(id, r->id);\n }\n\n void add(int a, int b, int x) {\n if (b <= 0 || sz <= a) return;\n if (a <= 0 && sz <= b) {\n adde(x, id);\n return;\n }\n l->add(a, b, x);\n r->add(a-sz/2, b-sz/2, x);\n }\n};\n\nV<int> solve(const V<int> &le, const V<int> &ri) {\n N = 2*n;\n g = VV<E>(2*n);\n auto tr = new Node(2*n, 0);\n for (int i = 0; i < n; i++) {\n int l = le[i], r = ri[i];\n if (l < r) {\n tr->add(l, r, i);\n tr->add(l+n, r+n, i+n);\n } else {\n if (i < r) {\n tr->add(0, r, i);\n tr->add(l, n+r, n+i);\n } else {\n tr->add(l, n+r, i);\n tr->add(n+l, 2*n, n+i); \n }\n }\n }\n auto scci = scc(g);\n int m = int(scci.groups.size());\n V<int> dpmi(m, TEN(9)), dpma(m, -TEN(9));\n\n for (int i = m-1; i >= 0; i--) {\n for (int p: scci.groups[i]) {\n if (p < 2*n) {\n dpmi[i] = min(dpmi[i], p);\n dpma[i] = max(dpma[i], p);\n }\n assert(0 <= p && p < g.size());\n for (auto e: g[p]) {\n int q = e.to;\n //p -> q\n int j = scci.id[q];\n dpmi[i] = min(dpmi[i], dpmi[j]);\n dpma[i] = max(dpma[i], dpma[j]);\n }\n }\n }\n\n V<int> v(n);\n for (int p = 0; p < n; p++) {\n int i = scci.id[p];\n int ni = scci.id[n+p];\n// int l = dpmi[ni] - n, r = dpma[i];\n int l = min(dpmi[i], dpmi[ni] - n);\n int r = max(dpma[i], dpma[ni] - n);\n// cout << p << \" \" << l << \" \" << r << endl;\n v[p] = n-min(n, r-l+1);\n }\n return v;\n}\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << setprecision(20);\n\n cin >> n;\n using P = pair<ll, ll>;\n using T = tuple<ll, P, ll>; // pid, pos, rad\n V<T> v(n);\n\n ll R;\n for (int i = 0; i < n; i++) {\n ll x, y, r, pid;\n cin >> x >> y >> r;\n R = abs(x) + abs(y);\n\n if (x >= 0 && y >= 0) {\n pid = y;\n } else if (x <= 0 && y >= 0) {\n pid = R - x;\n } else if (x <= 0 && y <= 0) {\n pid = 2*R - y;\n } else {\n pid = 3*R + x;\n }\n v[i] = T(pid, P(x, y), r);\n }\n\n V<int> idx(n);\n iota(begin(idx), end(idx), 0);\n sort(begin(idx), end(idx), [&](int a, int b){\n return v[a] < v[b];\n });\n\n V<P> p(2*n);\n V<ll> pid(2*n), r(2*n);\n\n for (int i = 0; i < n; i++) {\n tie(pid[i], p[i], r[i]) = v[idx[i]];\n tie(pid[n+i], p[n+i], r[n+i]) = v[idx[i]];\n pid[n+i] += 4*R;\n }\n\n auto hit = [&](int i, int j) {\n int di = 0;\n di += abs(p[i].first - p[j].first);\n di += abs(p[i].second - p[j].second);\n return di <= r[i];\n };\n\n V<int> le(n), ri(n);\n //left\n for (int i = 0; i < n; i++) { \n int l, r = n+i;\n l = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid) - 1;\n while (r-l > 1) {\n int md = (l+r)/2;\n if (!hit(n+i, md)) {\n l = md;\n } else {\n r = md;\n }\n }\n le[i] = r;\n }\n\n //right\n for (int i = 0; i < n; i++) { \n int l = i, r;\n r = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid);\n while (r-l > 1) {\n int md = (l+r)/2;\n if (hit(i, md)) {\n l = md;\n } else {\n r = md;\n }\n }\n ri[i] = n+r;\n }\n\n for (int i = 0; i < n; i++) {\n if (ri[i] - le[i] >= n) {\n le[i] = 0; ri[i] = n;\n } else {\n le[i] %= n; ri[i] %= n;\n }\n }\n/* for (int i = 0; i < n; i++) {\n cout << idx[i] << \", \";\n }\n cout << endl;\n for (int i = 0; i < n; i++) {\n cout << p[i].first << \" \" << p[i].second << \" \" << le[i] << \" \" << ri[i] << endl;\n }*/\n\n V<int> ans = solve(le, ri);\n V<int> lst(n);\n for (int i = 0; i < n; i++) {\n lst[idx[i]] = ans[i];\n }\n\n for (int d: lst) {\n cout << d << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":233488,"score_of_the_acc":-1,"final_rank":8},{"submission_id":"aoj_3038_2751466","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n#include <numeric>\n#include <random>\n#include <vector>\n#include <array>\n#include <bitset>\n#include <queue>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n\nusing namespace std;\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\nconstexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }\ntemplate<class T> using V = vector<T>;\ntemplate<class T> using VV = V<V<T>>;\n\nstruct E {\n int to;\n};\n\nstruct SCC {\n V<int> id;\n VV<int> groups;\n};\n\ntemplate<class E>\nstruct SCC_EXEC {\n const VV<E> &g;\n int tm = 0;\n V<bool> inS;\n V<int> id, low, ord, st;\n VV<int> groups;\n void dfs(int v) {\n low[v] = ord[v] = tm++;\n st.push_back(v);\n inS[v] = true;\n for (auto e: g[v]) {\n if (ord[e.to] == -1) {\n dfs(e.to);\n low[v] = min(low[v], low[e.to]);\n } else if (inS[e.to]) {\n low[v] = min(low[v], ord[e.to]);\n }\n }\n if (low[v] == ord[v]) {\n V<int> gr;\n while (true) {\n int u = st.back(); st.pop_back();\n gr.push_back(u);\n if (u == v) break;\n }\n for (int x: gr) inS[x] = false;\n groups.push_back(gr);\n }\n }\n SCC info;\n SCC_EXEC(const VV<E> &g) : g(g) {\n int n = int(g.size());\n inS = V<bool>(n); low = V<int>(n); ord = V<int>(n, -1);\n for (int i = 0; i < n; i++) {\n if (ord[i] == -1) dfs(i);\n }\n reverse(begin(groups), end(groups));\n V<int> id(n);\n for (int i = 0; i < int(groups.size()); i++) {\n for (int x: groups[i]) {\n id[x] = i;\n }\n }\n info = SCC{id, groups};\n }\n};\ntemplate<class E> SCC scc(const VV<E> &g) { return SCC_EXEC<E>(g).info; }\n\nint n, N;\nVV<E> g;\n\nvoid adde(int i, int j) {\n// cout << \"adde \" << i << \" -> \" << j << endl;\n g[i].push_back(E{j});\n}\n\nstruct Node {\n using NP = Node*;\n int sz;\n NP l, r;\n\n int id;\n\n Node(int sz, int off) : sz(sz) {\n id = N; N++;\n g.push_back(V<E>{});\n\n if (sz == 1) {\n adde(id, off);\n return;\n }\n l = new Node(sz/2, off);\n r = new Node(sz-sz/2, off+sz/2);\n adde(id, l->id);\n adde(id, r->id);\n }\n\n void add(int a, int b, int x) {\n if (b <= 0 || sz <= a) return;\n if (a <= 0 && sz <= b) {\n adde(x, id);\n return;\n }\n l->add(a, b, x);\n r->add(a-sz/2, b-sz/2, x);\n }\n};\n\nV<int> solve(const V<int> &le, const V<int> &ri) {\n N = 2*n;\n g = VV<E>(2*n);\n auto tr = new Node(2*n, 0);\n for (int i = 0; i < n; i++) {\n int l = le[i], r = ri[i];\n if (l < r) {\n tr->add(l, r, i);\n tr->add(l+n, r+n, i+n);\n } else {\n if (i < r) {\n tr->add(0, r, i);\n tr->add(l, n+r, n+i);\n } else {\n tr->add(l, n+r, i);\n tr->add(n+l, 2*n, n+i); \n }\n }\n }\n auto scci = scc(g);\n int m = int(scci.groups.size());\n V<int> dpmi(m, TEN(9)), dpma(m, -TEN(9));\n\n for (int i = m-1; i >= 0; i--) {\n for (int p: scci.groups[i]) {\n if (p < 2*n) {\n dpmi[i] = min(dpmi[i], p);\n dpma[i] = max(dpma[i], p);\n }\n assert(0 <= p && p < g.size());\n for (auto e: g[p]) {\n int q = e.to;\n //p -> q\n int j = scci.id[q];\n dpmi[i] = min(dpmi[i], dpmi[j]);\n dpma[i] = max(dpma[i], dpma[j]);\n }\n }\n }\n\n V<int> v(n);\n for (int p = 0; p < n; p++) {\n int i = scci.id[p];\n int ni = scci.id[n+p];\n int l = dpmi[ni] - n, r = dpma[i];\n// cout << p << \" \" << l << \" \" << r << endl;\n v[p] = n-min(n, r-l+1);\n }\n return v;\n}\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << setprecision(20);\n\n cin >> n;\n using P = pair<ll, ll>;\n using T = tuple<ll, P, ll>; // pid, pos, rad\n V<T> v(n);\n\n ll R;\n for (int i = 0; i < n; i++) {\n ll x, y, r, pid;\n cin >> x >> y >> r;\n R = abs(x) + abs(y);\n\n if (x >= 0 && y >= 0) {\n pid = y;\n } else if (x <= 0 && y >= 0) {\n pid = R - x;\n } else if (x <= 0 && y <= 0) {\n pid = 2*R - y;\n } else {\n pid = 3*R + x;\n }\n v[i] = T(pid, P(x, y), r);\n }\n\n V<int> idx(n);\n iota(begin(idx), end(idx), 0);\n sort(begin(idx), end(idx), [&](int a, int b){\n return v[a] < v[b];\n });\n\n V<P> p(2*n);\n V<ll> pid(2*n), r(2*n);\n\n for (int i = 0; i < n; i++) {\n tie(pid[i], p[i], r[i]) = v[idx[i]];\n tie(pid[n+i], p[n+i], r[n+i]) = v[idx[i]];\n pid[n+i] += 4*R;\n }\n\n auto hit = [&](int i, int j) {\n int di = 0;\n di += abs(p[i].first - p[j].first);\n di += abs(p[i].second - p[j].second);\n return di <= r[i];\n };\n\n V<int> le(n), ri(n);\n //left\n for (int i = 0; i < n; i++) { \n int l, r = n+i;\n l = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid) - 1;\n while (r-l > 1) {\n int md = (l+r)/2;\n if (!hit(n+i, md)) {\n l = md;\n } else {\n r = md;\n }\n }\n le[i] = r;\n }\n\n //right\n for (int i = 0; i < n; i++) { \n int l = i, r;\n r = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid);\n while (r-l > 1) {\n int md = (l+r)/2;\n if (hit(i, md)) {\n l = md;\n } else {\n r = md;\n }\n }\n ri[i] = n+r;\n }\n\n for (int i = 0; i < n; i++) {\n if (ri[i] - le[i] >= n) {\n le[i] = 0; ri[i] = n;\n } else {\n le[i] %= n; ri[i] %= n;\n }\n }\n/* for (int i = 0; i < n; i++) {\n cout << idx[i] << \", \";\n }\n cout << endl;\n for (int i = 0; i < n; i++) {\n cout << p[i].first << \" \" << p[i].second << \" \" << le[i] << \" \" << ri[i] << endl;\n }*/\n\n V<int> ans = solve(le, ri);\n V<int> lst(n);\n for (int i = 0; i < n; i++) {\n lst[idx[i]] = ans[i];\n }\n\n for (int d: lst) {\n cout << d << endl;\n }\n return 0;\n}","accuracy":0.36666666666666664,"time_ms":590,"memory_kb":233384,"score_of_the_acc":-1.0053,"final_rank":11},{"submission_id":"aoj_3038_2747372","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define MAX 200005\ntypedef pair<int,int> Data;\ntypedef complex<int> Point;\ntypedef pair<double,int> Pair;\nconst double PI = acos(-1);\n\nData merge(Data a,Data b){\n return Data( min(a.first,b.first) , max(a.second,b.second) );\n}\n\nconst int segN=(1<<20);\nstruct segtree{\n Data t[ segN*2 ];\n \n void Update(int i,Data d){\n i+=(segN-1);\n t[i]=d;\n while(i){\n i=(i-1)/2;\n t[i]=merge(t[i*2+1],t[i*2+2]);\n }\n }\n \n Data Get(int a,int b,int k=0,int l=0,int r=segN){\n if( b<=l || r<=a ){\n return Data(a,b);\n }\n if( a<=l && r<=b ){\n return t[k];\n }\n int m=(l+r)/2;\n Data lv=Get(a,b,k*2+1,l,m);\n Data rv=Get(a,b,k*2+2,m,r);\n return merge(lv,rv);\n }\n};\n\nint calc(Point a){\n return abs( a.real() ) + abs( a.imag() );\n}\n\nint calc(Point a,Point b){\n return calc(a-b);\n}\n\ndouble Arg(Point a){\n complex<double> b( a.real(), a.imag() );\n return arg(b);\n}\n\nint n;\nint x[MAX];\nint y[MAX];\nPoint p[MAX];\nint r[MAX];\n\n\nsegtree T;\n\nint main(){\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i]>>r[i];\n p[i]=Point(x[i],y[i]);\n }\n \n vector<Pair> v(n*3);\n for(int i=0;i<n;i++){\n v[i]=Pair( Arg(p[i]) , i );\n v[i+n]=Pair( Arg(p[i])+2.0*PI , i );\n v[i+n+n]=Pair( Arg(p[i])+4.0*PI , i );\n }\n sort(v.begin(),v.end());\n vector<Point> w(n*3);\n vector<int> R(n*3);\n for(int i=0;i<n*3;i++){\n w[i]=p[ v[i].second%n ];\n R[i]=r[ v[i].second%n ];\n }\n\n vector<int> lv(n*3),rv(n*3);\n for(int i=n;i<n*2;i++){\n if( R[i] >= calc(w[i])*2 ){\n lv[i]=0;\n rv[i]=n*3;\n continue;\n }\n \n vector<Pair> :: iterator it;\n int right,left,mid;\n \n it = lower_bound( v.begin(), v.end(), Pair( v[i].first-PI , -1 ) );\n left=it-v.begin();\n right=i;\n while(left<right){\n mid=(left+right)/2;\n if( calc(w[i],w[mid]) <= R[i] ){\n right=mid;\n }else{\n left=mid+1;\n }\n }\n lv[i]=left;\n \n it = lower_bound( v.begin(), v.end(), Pair( v[i].first+PI , -1 ) );\n right=it-v.begin();\n\n left=i;\n \n while( left<right ){\n mid=(left+right)/2;\n if( calc(w[i],w[mid]) <= R[i] ){\n left=mid+1;\n }else{\n right=mid;\n }\n }\n rv[i]=left;\n }\n\n // for(int i=0;i<3*n;i++)cout<<i<<' '<<w[i]<<' '<<R[i]<<endl;\n \n for(int i=0;i<3*n;i++){\n T.Update(i, Data(i,i+1) );\n }\n \n for(int i=n;i<n*2;i++){\n T.Update(i, Data( lv[i], rv[i] ) );\n }\n \n for(int tc=0;tc<20;tc++){\n \n for(int i=0;i<n;i++){\n Data tmp=T.Get(i+n,i+n+1);\n Data base=tmp;\n base.first-=n;\n base.second-=n;\n if(base.first<0)base.first=0;\n if(base.second>n*3)base.second=n*3;\n T.Update(i, base);\n base=tmp;\n base.first+=n;\n base.second+=n;\n if(base.first<0)base.first=0;\n if(base.second>n*3)base.second=n*3;\n T.Update(i+n*2,base);\n }\n\n for(int i=n;i<n*2;i++){\n Data base=T.Get(i,i+1);\n Data A=T.Get( base.first , base.second );\n T.Update( i, A );\n }\n }\n\n map<int,int> mp;\n for(int i=n;i<n*2;i++){\n Data tmp=T.Get(i,i+1);\n int len=tmp.second-tmp.first;\n mp[ v[i].second%n ]=max(0, n-len);\n }\n for(int i=0;i<n;i++){\n cout<<mp[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2070,"memory_kb":53788,"score_of_the_acc":-0.9324,"final_rank":5},{"submission_id":"aoj_3038_2747367","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\n//const int INF = 1e9;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\nostream& operator<<(ostream& o,T &a){\n return o <<\"( x=\"<<get<0>(a)<<\", y=\"<<get<1>(a)<<\", r=\"<<get<2>(a)<<\", idx=\"<<get<3>(a)<<\")\";\n}\n\nclass RMQ{\npublic:\n //int INF = 1e9;\n int INF = 1LL<<55;\n int n;\n vector<int> dat;\n int flag; // Range Max Queryにしたいときはflag=1にする。\n \n //初期化\n RMQ(){n=-1;}\n RMQ(int n_,int flag = 0){\n this->flag = flag;\n n=1;\n while(n<n_)n*=2;\n dat.resize(2*n-1,INF);\n }\n \n //k番目の値をaに変更\n void update(int k,int a){\n assert(a >= 0);\n if(flag) a *= -1;\n k+=n-1;\n assert(dat[k] >= a);\n \n dat[k]=a;\n while(k>0){\n k=(k-1)/2;\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\n }\n }\n\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\n \n //[a,b)の最小値を求める query(a,b,0,0,n)\n int query(int a,int b,int k=0,int l=0,int r=-1){\n if(r == -1) r = n, assert(a < n && b <= n);\n if(r<=a||b<=l)return INF;\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\n int vl=query(a,b,k*2+1,l,(l+r)/2);\n int vr=query(a,b,k*2+2,(l+r)/2,r);\n int res = min(vl,vr);\n if(k == 0 && flag) res *= -1;\n return res;\n }\n\n};\n\n\n//rが小さい順に処理する。\nRMQ initTo(const vector<T> &A){\n\n auto getDisT=[&](const T &a,const T &b){\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\n return abs(x1 - x2) + abs(y1 - y2);\n };\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\n \n int n = A.size();\n RMQ res(n,1);\n vector<int> Idx(n);\n for(int i=0;i<n;i++) Idx[i] = i;\n\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\n int r1 = get<2>(A[a]);\n int r2 = get<2>(A[b]);\n return r1 < r2;\n });\n \n RMQ mem(n,1);\n function<int(int,int)> search=[&](int pos,int start){\n const int r = get<2>(A[start]);\n if(getDis(start,pos) > r) return pos;\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\n int nx = mem.value(pos);\n if(nx == -INF || nx == pos) nx = pos+1;\n int to = search(nx,start);\n mem.update(pos,to);\n return to;\n };\n \n for(int i=0;i<n;i++) {\n int to=search(Idx[i],Idx[i]);\n res.update(Idx[i],to);\n mem.update(Idx[i],to);\n }\n return res;\n}\n\nint dfs(int pos,RMQ &To){\n int l = pos, r = To.value(pos);\n int to = To.query(l,r+1);\n if(to == pos) return pos;\n int res = dfs(to,To);\n To.update(pos,res);\n return res;\n}\n\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\n int rpos = 2 * n - 1 - pos%n;\n int lmax = dfs(rpos,rTo) - rpos;\n int lto = dfs( To.query(max(0LL,pos - lmax),pos+1), To );\n int rto = dfs(pos,To);\n int to = max(lto,rto);\n if(lto > rto) to = dfs2(lto,To,rTo,n);\n To.update(pos,to);\n return to;\n}\n\nsigned main(){\n int n;\n cin>>n;\n vector<T> A(n),rA;\n \n set<P> used;\n for(int i=0;i<n;i++){\n int x,y,r;\n scanf(\"%lld%lld%lld\",&x,&y,&r);\n assert(used.count(P(x,y)) == 0);\n used.insert(P(x,y));\n A[i] = T(x,y,r,i);\n }\n\n sort(A.begin(),A.end(),[&](T &a,T &b){\n typedef complex<double> P;\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\n return arg(P(x1,y1)) < arg(P(x2,y2));\n });\n \n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\n rA = A; reverse(rA.begin(),rA.end());\n\n RMQ To = initTo(A);\n RMQ rTo = initTo(rA);\n \n vector<int> ans(n);\n int update = 1;\n while(update){\n update = 0;\n for(int i=n;i<2*n;i++){\n int ri = (2 * n - 1) - i%n;\n int idx = get<3>(A[i]);\n int to = dfs2(i,To,rTo,n);\n int rto = dfs2(ri,rTo,To,n);\n int num = to - i + 1;\n int rnum = rto - ri + 1;\n assert(A[i] == rA[ri]);\n int score = min(n,num+rnum-1);\n update |= ans[idx] < score;\n ans[idx] = score;\n }\n } \n for(int a:ans) printf(\"%lld\\n\",n - a);\n return 0;\n}","accuracy":1,"time_ms":2290,"memory_kb":125716,"score_of_the_acc":-1.4369,"final_rank":10},{"submission_id":"aoj_3038_2744631","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n Int n;\n F f;\n G g;\n T ti;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(Int n_,F f,G g,T ti):\n f(f),g(g),ti(ti){\n init(n_);\n }\n void init(Int n_){\n n=1;\n while(n<n_) n*=2;\n dat.assign(2*n-1,ti);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\n for(Int i=n-2;i>=0;i--)\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\n }\n void update(Int k,E a){\n k+=n-1;\n dat[k]=g(dat[k],a);\n while(k>0){\n k=(k-1)/2;\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\n }\n }\n inline T query(Int a,Int b){\n T vl=ti,vr=ti;\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,dat[(l++)-1]);\n if(r&1) vr=f(dat[(--r)-1],vr);\n }\n return f(vl,vr);\n }\n\n Int find(Int a,Int b,function<bool(T)> &check,Int k,Int l,Int r){\n if(!check(dat[k])||r<=a||b<=l) return -1;\n if(k>=n-1) return k-(n-1);\n Int m=(l+r)>>1;\n Int vl=find(a,b,check,k*2+1,l,m);\n if(~vl) return vl;\n return find(a,b,check,k*2+2,m,r);\n }\n \n Int find(Int a,Int b,function<bool(T)> &check){\n return find(a,b,check,0,0,n);\n }\n \n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n cin>>n;\n using T = tuple<Int, Int, Int>;\n vector<T> v(n);\n map<T, Int> m;\n for(Int i=0;i<n;i++){\n Int x,y,r;\n cin>>x>>y>>r;\n v[i]=T(x+y,x-y,r);\n m[v[i]]=i;\n }\n \n sort(v.begin(),v.end(),[&](T a,T b){\n Int au,av,ar;\n tie(au,av,ar)=a;\n Int bu,bv,br;\n tie(bu,bv,br)=b;\n return atan2(av,au)<atan2(bv,bu);\n });\n\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\n\n using P = pair<Int, Int>;\n SegmentTree<P, P>::F f=[&](P a,P b){\n return P(min(a.first,b.first),max(a.second,b.second));};\n\n\n Int N=n*3;\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\n for(Int i=0;i<N;i++) seg.update(i,P(i,i));\n\n auto check=[&](Int a,Int b){\n return max(abs(get<0>(v[a])-get<0>(v[b])),\n\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\n };\n \n vector<Int> dp(N,N);\n for(Int i=0;i<N;i++){\n dp[i]=i;\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\n seg.update(i,P(dp[i],dp[i]));\n }\n fill(dp.begin(),dp.end(),-1);\n for(Int i=N-1;i>=0;i--){\n dp[i]=i;\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\n seg.update(i,P(dp[i],dp[i]));\n }\n \n Int flg=1;\n while(flg){\n flg=0;\n for(Int i=0;i<N;i++){\n auto a=seg.query(i,i+1);\n auto b=seg.query(a.first,a.second+1);\n flg|=(a!=b);\n seg.update(i,b);\n }\n }\n\n vector<Int> ans(n);\n for(Int i=0;i<n;i++){\n Int idx=m[v[i]];\n auto a=seg.query(n+i,n+i+1);\n Int k=(i-a.first+1)+(a.second-i+1)-1;\n ans[idx]=min(k,n);\n }\n \n for(Int i=0;i<n;i++) cout<<n-ans[i]<<endl;\n return 0;\n}","accuracy":1,"time_ms":1220,"memory_kb":71820,"score_of_the_acc":-0.5296,"final_rank":4},{"submission_id":"aoj_3038_2744614","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n int n;\n F f;\n G g;\n T ti;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(int n_,F f,G g,T ti):\n f(f),g(g),ti(ti){\n init(n_);\n }\n void init(int n_){\n n=1;\n while(n<n_) n*=2;\n dat.assign(2*n-1,ti);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[i+n-1]=v[i];\n for(int i=n-2;i>=0;i--)\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\n }\n void update(int k,E a){\n k+=n-1;\n dat[k]=g(dat[k],a);\n while(k>0){\n k=(k-1)/2;\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\n }\n }\n inline T query(int a,int b){\n T vl=ti,vr=ti;\n for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,dat[(l++)-1]);\n if(r&1) vr=f(dat[(--r)-1],vr);\n }\n return f(vl,vr);\n }\n\n int find(int a,int b,function<bool(T)> &check,int k,int l,int r){\n if(!check(dat[k])||r<=a||b<=l) return -1;\n if(k>=n-1) return k-(n-1);\n int m=(l+r)>>1;\n int vl=find(a,b,check,k*2+1,l,m);\n if(~vl) return vl;\n return find(a,b,check,k*2+2,m,r);\n }\n \n int find(int a,int b,function<bool(T)> &check){\n return find(a,b,check,0,0,n);\n }\n \n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n cin>>n;\n using T = tuple<int, int, int>;\n vector<T> v(n);\n map<T, int> m;\n for(int i=0;i<n;i++){\n int x,y,r;\n cin>>x>>y>>r;\n v[i]=T(x+y,x-y,r);\n m[v[i]]=i;\n }\n \n sort(v.begin(),v.end(),[&](T a,T b){\n int au,av,ar;\n tie(au,av,ar)=a;\n int bu,bv,br;\n tie(bu,bv,br)=b;\n return atan2(av,au)<atan2(bv,bu);\n });\n\n for(int i=0;i<n;i++) v.emplace_back(T(v[i]));\n for(int i=0;i<n;i++) v.emplace_back(T(v[i]));\n\n using P = pair<int, int>;\n SegmentTree<P, P>::F f=[&](P a,P b){\n return P(min(a.first,b.first),max(a.second,b.second));};\n\n\n int N=n*3;\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\n for(int i=0;i<N;i++) seg.update(i,P(i,i));\n\n auto check=[&](int a,int b){\n return max(abs(get<0>(v[a])-get<0>(v[b])),\n\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\n };\n \n vector<int> dp(N,N);\n for(int i=0;i<N;i++){\n dp[i]=i;\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\n //cout<<i<<\":\"<<dp[i]<<endl;\n seg.update(i,P(dp[i],dp[i]));\n }\n fill(dp.begin(),dp.end(),-1);\n for(int i=N-1;i>=0;i--){\n dp[i]=i;\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\n //cout<<i<<\":\"<<dp[i]<<endl;\n seg.update(i,P(dp[i],dp[i]));\n }\n \n int flg=1;\n while(flg){\n flg=0;\n for(int i=0;i<N;i++){\n auto a=seg.query(i,i+1);\n auto b=seg.query(a.first,a.second+1);\n flg|=(a!=b);\n //if(a!=b) cout<<a.first<<\" \"<<a.second<<\":\"<<b.first<<\" \"<<b.second<<endl;\n seg.update(i,b);\n }\n }\n\n vector<int> ans(n);\n for(int i=0;i<n;i++){\n int idx=m[v[i]];\n auto a=seg.query(n+i,n+i+1);\n int k=(i-a.first+1)+(a.second-i+1)-1;\n ans[idx]=min(k,n);\n }\n \n for(int i=0;i<n;i++) cout<<n-ans[i]<<endl;\n return 0;\n}","accuracy":1,"time_ms":1250,"memory_kb":42096,"score_of_the_acc":-0.3918,"final_rank":2},{"submission_id":"aoj_3038_2744609","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\nconst int INF = 1LL<<55;\n//const int INF = 1e9;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\nostream& operator<<(ostream& o,T &a){\n return o <<\"( x=\"<<get<0>(a)<<\", y=\"<<get<1>(a)<<\", r=\"<<get<2>(a)<<\", idx=\"<<get<3>(a)<<\")\";\n}\n\nclass RMQ{\npublic:\n //int INF = 1e9;\n int INF = 1LL<<55;\n int n;\n vector<int> dat;\n int flag; // Range Max Queryにしたいときはflag=1にする。\n \n //初期化\n RMQ(){n=-1;}\n RMQ(int n_,int flag = 0){\n this->flag = flag;\n n=1;\n while(n<n_)n*=2;\n dat.resize(2*n-1,INF);\n }\n \n //k番目の値をaに変更\n void update(int k,int a){\n assert(a >= 0);\n if(flag) a *= -1;\n k+=n-1;\n assert(dat[k] >= a);\n \n dat[k]=a;\n while(k>0){\n k=(k-1)/2;\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\n }\n }\n\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\n \n //[a,b)の最小値を求める query(a,b,0,0,n)\n int query(int a,int b,int k=0,int l=0,int r=-1){\n if(r == -1) r = n, assert(a < n && b <= n);\n if(r<=a||b<=l)return INF;\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\n int vl=query(a,b,k*2+1,l,(l+r)/2);\n int vr=query(a,b,k*2+2,(l+r)/2,r);\n int res = min(vl,vr);\n if(k == 0 && flag) res *= -1;\n return res;\n }\n\n};\n\n\n//rが小さい順に処理する。\nRMQ initTo(const vector<T> &A){\n\n auto getDisT=[&](const T &a,const T &b){\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\n return abs(x1 - x2) + abs(y1 - y2);\n };\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\n \n int n = A.size();\n RMQ res(n,1);\n vector<int> Idx(n);\n for(int i=0;i<n;i++) Idx[i] = i;\n\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\n int r1 = get<2>(A[a]);\n int r2 = get<2>(A[b]);\n return r1 < r2;\n });\n \n RMQ mem(n,1);\n function<int(int,int)> search=[&](int pos,int start){\n const int r = get<2>(A[start]);\n if(getDis(start,pos) > r) return pos;\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\n int nx = mem.value(pos);\n if(nx == -INF || nx == pos) nx = pos+1;\n int to = search(nx,start);\n mem.update(pos,to);\n return to;\n };\n \n for(int i=0;i<n;i++) {\n int to=search(Idx[i],Idx[i]);\n res.update(Idx[i],to);\n mem.update(Idx[i],to);\n }\n return res;\n}\n\nint dfs(int pos,RMQ &To){\n int l = pos, r = To.value(pos);\n int to = To.query(l,r+1);\n if(to == pos) return pos;\n int res = dfs(to,To);\n To.update(pos,res);\n return res;\n}\n\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\n int rpos = 2 * n - 1 - pos%n;\n int lmax = dfs(rpos,rTo) - rpos;\n int lto = dfs( To.query(max(0LL,pos - lmax),pos+1), To );\n int rto = dfs(pos,To);\n int to = max(lto,rto);\n if(lto > rto) to = dfs2(lto,To,rTo,n);\n To.update(pos,to);\n return to;\n}\n\nsigned main(){\n int n;\n cin>>n;\n vector<T> A(n),rA;\n \n for(int i=0;i<n;i++){\n int x,y,r;\n scanf(\"%lld%lld%lld\",&x,&y,&r);\n A[i] = T(x,y,r,i);\n }\n\n sort(A.begin(),A.end(),[&](T &a,T &b){\n typedef complex<double> P;\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\n return arg(P(x1,y1)) < arg(P(x2,y2));\n });\n \n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\n rA = A; reverse(rA.begin(),rA.end());\n\n RMQ To = initTo(A);\n RMQ rTo = initTo(rA);\n \n vector<int> ans(n);\n int update = 1;\n while(update){\n update = 0;\n for(int i=n;i<2*n;i++){\n int ri = (2 * n - 1) - i%n;\n int idx = get<3>(A[i]);\n int to = dfs2(i,To,rTo,n);\n int rto = dfs2(ri,rTo,To,n);\n int num = to - i + 1;\n int rnum = rto - ri + 1;\n assert(A[i] == rA[ri]);\n int score = min(n,num+rnum-1);\n update |= ans[idx] < score;\n ans[idx] = score;\n }\n } \n for(int a:ans) printf(\"%lld\\n\",n - a);\n return 0;\n}","accuracy":1,"time_ms":2250,"memory_kb":113216,"score_of_the_acc":-1.3482,"final_rank":9},{"submission_id":"aoj_3038_2744586","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n//#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\n//const int INF = 1LL<<55;\nconst int INF = 1e9;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\nostream& operator<<(ostream& o,T &a){\n return o <<\"( x=\"<<get<0>(a)<<\", y=\"<<get<1>(a)<<\", r=\"<<get<2>(a)<<\", idx=\"<<get<3>(a)<<\")\";\n}\n\nclass RMQ{\npublic:\n int INF = 1e9;\n int n;\n vector<int> dat;\n int flag; // Range Max Queryにしたいときはflag=1にする。\n \n //初期化\n RMQ(){n=-1;}\n RMQ(int n_,int flag = 0){\n this->flag = flag;\n n=1;\n while(n<n_)n*=2;\n dat.resize(2*n-1,INF);\n }\n \n //k番目の値をaに変更\n void update(int k,int a){\n assert(a >= 0);\n if(flag) a *= -1;\n k+=n-1;\n assert(dat[k] >= a);\n \n dat[k]=a;\n while(k>0){\n k=(k-1)/2;\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\n }\n }\n\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\n \n //[a,b)の最小値を求める query(a,b,0,0,n)\n int query(int a,int b,int k=0,int l=0,int r=-1){\n if(r == -1) r = n, assert(a < n && b <= n);\n if(r<=a||b<=l)return INF;\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\n int vl=query(a,b,k*2+1,l,(l+r)/2);\n int vr=query(a,b,k*2+2,(l+r)/2,r);\n int res = min(vl,vr);\n if(k == 0 && flag) res *= -1;\n return res;\n }\n\n};\n\n\n//rが小さい順に処理する。\nRMQ initTo(const vector<T> &A){\n\n auto getDisT=[&](const T &a,const T &b){\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\n return abs(x1 - x2) + abs(y1 - y2);\n };\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\n \n int n = A.size();\n RMQ res(n,1);\n vector<int> Idx(n);\n for(int i=0;i<n;i++) Idx[i] = i;\n\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\n int r1 = get<2>(A[a]);\n int r2 = get<2>(A[b]);\n return r1 < r2;\n });\n \n RMQ mem(n,1);\n function<int(int,int)> search=[&](int pos,int start){\n const int r = get<2>(A[start]);\n if(getDis(start,pos) > r) return pos;\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\n int nx = mem.value(pos);\n if(nx == -INF || nx == pos) nx = pos+1;\n int to = search(nx,start);\n mem.update(pos,to);\n return to;\n };\n \n for(int i=0;i<n;i++) {\n int to=search(Idx[i],Idx[i]);\n res.update(Idx[i],to);\n mem.update(Idx[i],to);\n }\n return res;\n}\n\nint dfs(int pos,RMQ &To){\n int l = pos, r = To.value(pos);\n int to = To.query(l,r+1);\n if(to == pos) return pos;\n int res = dfs(to,To);\n To.update(pos,res);\n return res;\n}\n\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\n int rpos = 2 * n - 1 - pos%n;\n int lmax = dfs(rpos,rTo) - rpos;\n int lto = dfs( To.query(max(0,pos - lmax),pos+1), To );\n int rto = dfs(pos,To);\n int to = max(lto,rto);\n if(lto > rto) to = dfs2(lto,To,rTo,n);\n To.update(pos,to);\n return to;\n}\n\nsigned main(){\n int n;\n cin>>n;\n vector<T> A(n),rA;\n \n for(int i=0;i<n;i++){\n int x,y,r;\n scanf(\"%d%d%d\",&x,&y,&r);\n A[i] = T(x,y,r,i);\n }\n\n sort(A.begin(),A.end(),[&](T &a,T &b){\n typedef complex<double> P;\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\n return arg(P(x1,y1)) < arg(P(x2,y2));\n });\n \n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\n rA = A; reverse(rA.begin(),rA.end());\n\n RMQ To = initTo(A);\n RMQ rTo = initTo(rA);\n \n vector<int> ans(n);\n int update = 1;\n while(update){\n update = 0;\n for(int i=n;i<2*n;i++){\n int ri = (2 * n - 1) - i%n;\n int idx = get<3>(A[i]);\n int to = dfs2(i,To,rTo,n);\n int rto = dfs2(ri,rTo,To,n);\n int num = to - i + 1;\n int rnum = rto - ri + 1;\n assert(A[i] == rA[ri]);\n int score = min(n,num+rnum-1);\n update |= ans[idx] < score;\n ans[idx] = score;\n }\n } \n for(int a:ans) printf(\"%d\\n\",n - a);\n return 0;\n}","accuracy":1,"time_ms":1980,"memory_kb":67412,"score_of_the_acc":-0.951,"final_rank":7},{"submission_id":"aoj_3038_2744349","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\", \"<<pr1(c)\n#define pr4(a,b,c,d) pr3(a,b,c)<<\", \"<<pr1(d)\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\", \"<<pr1(e)\n//#define int long long\n#define double long double\nusing namespace std;\nconst int N = 100010;\n//const int INF = 1LL<<55;\nconst int INF = 1e9;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nostream& operator<<(ostream& o,P p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\nostream& operator<<(ostream& o,T &a){\n return o <<\"( x=\"<<get<0>(a)<<\", y=\"<<get<1>(a)<<\", r=\"<<get<2>(a)<<\", idx=\"<<get<3>(a)<<\")\";\n}\n\nclass RMQ{\npublic:\n int INF = 1e9;\n int n;\n vector<int> dat;\n int flag; // Range Max Queryにしたいときはflag=1にする。\n \n //初期化\n RMQ(){n=-1;}\n RMQ(int n_,int flag = 0){\n this->flag = flag;\n n=1;\n while(n<n_)n*=2;\n dat.resize(2*n-1,INF);\n }\n \n //k番目の値をaに変更\n void update(int k,int a){\n assert(a >= 0);\n if(flag) a *= -1;\n k+=n-1;\n assert(dat[k] >= a);\n \n dat[k]=a;\n while(k>0){\n k=(k-1)/2;\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\n }\n }\n\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\n \n //[a,b)の最小値を求める query(a,b,0,0,n)\n int query(int a,int b,int k=0,int l=0,int r=-1){\n if(r == -1) r = n, assert(a < n && b <= n);\n if(r<=a||b<=l)return INF;\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\n int vl=query(a,b,k*2+1,l,(l+r)/2);\n int vr=query(a,b,k*2+2,(l+r)/2,r);\n int res = min(vl,vr);\n if(k == 0 && flag) res *= -1;\n return res;\n }\n\n};\n\n\n//rが小さい順に処理する。\nRMQ initTo(const vector<T> &A){\n\n auto getDisT=[&](const T &a,const T &b){\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\n return abs(x1 - x2) + abs(y1 - y2);\n };\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\n \n int n = A.size();\n RMQ res(n,1);\n vector<int> Idx(n);\n for(int i=0;i<n;i++) Idx[i] = i;\n\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\n int r1 = get<2>(A[a]);\n int r2 = get<2>(A[b]);\n return r1 < r2;\n });\n \n RMQ mem(n,1);\n function<int(int,int)> search=[&](int pos,int start){\n const int r = get<2>(A[start]);\n if(pos - start > 200000) return pos;\n if(getDis(start,pos) > r) return pos;\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\n int nx = mem.value(pos);\n if(nx == -INF || nx == pos) nx = pos+1;\n int to = search(nx,start);\n mem.update(pos,to);\n return to;\n };\n \n for(int i=0;i<n;i++) {\n int to=search(Idx[i],Idx[i]);\n res.update(Idx[i],to);\n mem.update(Idx[i],to);\n }\n return res;\n}\n\nint dfs(int pos,RMQ &To){\n int l = pos, r = To.value(pos);\n int to = To.query(l,r+1);\n if(to == pos) return pos;\n int res = dfs(to,To);\n To.update(pos,res);\n return res;\n}\n\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\n int rpos = 2 * n - 1 - pos%n;\n int lmax = dfs(rpos,rTo) - rpos;\n int lto = dfs( To.query(max(0,pos - lmax),pos+1), To );\n int rto = dfs(pos,To);\n int to = max(lto,rto);\n if(lto > rto) to = dfs2(lto,To,rTo,n);\n To.update(pos,to);\n return to;\n}\n\nsigned main(){\n int n;\n cin>>n;\n vector<T> A(n),rA;\n \n for(int i=0;i<n;i++){\n int x,y,r;\n scanf(\"%d%d%d\",&x,&y,&r);\n A[i] = T(x,y,r,i);\n }\n\n sort(A.begin(),A.end(),[&](T &a,T &b){\n typedef complex<double> P;\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\n return arg(P(x1,y1)) < arg(P(x2,y2));\n });\n \n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\n rA = A; reverse(rA.begin(),rA.end());\n\n RMQ To = initTo(A);\n RMQ rTo = initTo(rA);\n \n vector<int> ans(n);\n int update = 1;\n while(update){\n update = 0;\n for(int i=n;i<2*n;i++){\n int ri = (2 * n - 1) - i%n;\n int idx = get<3>(A[i]);\n int to = dfs2(i,To,rTo,n);\n int rto = dfs2(ri,rTo,To,n);\n int num = to - i + 1;\n int rnum = rto - ri + 1;\n assert(A[i] == rA[ri]);\n int score = min(n,num+rnum-1);\n update |= ans[idx] < score;\n ans[idx] = score;\n }\n } \n for(int a:ans) printf(\"%d\\n\",n - a);\n return 0;\n}","accuracy":1,"time_ms":2040,"memory_kb":58180,"score_of_the_acc":-0.9378,"final_rank":6},{"submission_id":"aoj_3038_2744341","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n\nusing Pi = pair<int, int>;\n\nconst int inf = 1LL<<55;\n\nstruct SegmentTree {\n vector<Pi> data;\n int sz;\n SegmentTree(int _sz) {\n sz = 1; while(sz < _sz) sz <<= 1;\n data.resize(2*sz-1);\n }\n void set(int k, Pi p) {\n k += sz-1;\n data[k] = p;\n while(k > 0) {\n k = (k-1)/2;\n data[k] = Pi(min(data[2*k+1].first, data[2*k+2].first),\n\t\t max(data[2*k+1].second, data[2*k+2].second));\n }\n }\n Pi query(int a, int b, int k, int l, int r) {\n if(r <= a || b <= l) return Pi(inf, -inf);\n if(a <= l && r <= b) return data[k];\n Pi vl = query(a, b, 2*k+1, l, (l+r)/2);\n Pi vr = query(a, b, 2*k+2, (l+r)/2, r);\n return Pi(min(vl.first, vr.first),\n\t max(vl.second, vr.second));\n }\n Pi query(int a, int b) {\n return query(a, b, 0, 0, sz);\n }\n};\n\nconst int MAX_N = 200020;\n\nint n;\nint x[MAX_N], y[MAX_N], r[MAX_N];\n\nint dist(int i, int j) {\n return llabs(x[i]-x[j])+llabs(y[i]-y[j]);\n}\n\nsigned main() {\n cin >> n;\n for(int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i] >> r[i];\n }\n vector<pair<double, int> > vec;\n const double PI = acos(-1);\n for(int i = 0; i < n; ++i) {\n double arg = atan2(y[i], x[i]);\n vec.emplace_back(arg, i);\n vec.emplace_back(arg+2*PI, i);\n vec.emplace_back(arg+4*PI, i);\n }\n sort(begin(vec), end(vec));\n vector<int> L(n), R(n);\n for(int i = n; i < 2*n; ++i) {\n double arg = vec[i].first;\n int idx = vec[i].second;\n //cout<<idx<<\" \"<<arg<<endl;\n {\n int fail = lower_bound(begin(vec), end(vec),\n\t\t\t pair<double, int>(arg-PI, -1))-begin(vec)-1;\n int pass = i;\n //cout<<pass<<\" \"<<fail<<endl;\n while(fail+1 < pass) {\n\tint test = (fail+pass)/2;\n\tif(dist(idx, vec[test].second) <= r[idx]) pass = test;\n\telse fail = test;\n }\n L[i-n] = pass;\n }\n {\n int pass = i;\n int fail = lower_bound(begin(vec), end(vec),\n\t\t\t pair<double, int>(arg+PI, -1))-begin(vec);\n //cout<<pass<<\" \"<<fail<<endl;\n while(pass+1 < fail) {\n\tint test = (pass+fail)/2;\n\tif(dist(idx, vec[test].second) <= r[idx]) pass = test;\n\telse fail = test;\n }\n R[i-n] = fail;\n }\n //cout<<idx<<\" \"<<L[i-n]<<\" \"<<R[i-n]<<endl;\n }\n SegmentTree seg(3*n);\n bool update = true;\n while(update) {\n update = false;\n for(int i = 0; i < 3*n; ++i) {\n int l = L[i%n], r = R[i%n];\n if(i < n) l -= n, r -= n;\n else if(i >= 2*n) l += n, r += n;\n seg.set(i, Pi(max(0ll, l), min(3*n, r)));\n }\n for(int i = n; i < 2*n; ++i) {\n Pi tmp = seg.query(L[i-n], R[i-n]);\n seg.set(i, Pi(tmp.first, tmp.second));\n if(L[i-n] != tmp.first || R[i-n] != tmp.second) update = true;\n L[i-n] = tmp.first;\n R[i-n] = tmp.second;\n }\n }\n vector<int> ans(n);\n for(int i = n; i < 2*n; ++i) {\n int idx = vec[i].second;\n ans[idx] = max(0ll, n-(R[i-n]-L[i-n]));\n }\n for(int i = 0; i < n; ++i) {\n cout << ans[i] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":1080,"memory_kb":54560,"score_of_the_acc":-0.3575,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_3038_3042316\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n Int n;\\n F f;\\n G g;\\n T ti;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(Int n_,F f,G g,T ti):\\n f(f),g(g),ti(ti){\\n init(n_);\\n }\\n void init(Int n_){\\n n=1;\\n while(n<n_) n*=2;\\n dat.assign(2*n-1,ti);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\\n for(Int i=n-2;i>=0;i--)\\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\\n }\\n void update(Int k,E a){\\n k+=n-1;\\n dat[k]=g(dat[k],a);\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n inline T query(Int a,Int b){\\n T vl=ti,vr=ti;\\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,dat[(l++)-1]);\\n if(r&1) vr=f(dat[(--r)-1],vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n;\\n cin>>n;\\n using T = tuple<Int, Int, Int>;\\n vector<T> v(n);\\n map<T, Int> m;\\n for(Int i=0;i<n;i++){\\n Int x,y,r;\\n cin>>x>>y>>r;\\n v[i]=T(x+y,x-y,r);\\n m[v[i]]=i;\\n }\\n \\n sort(v.begin(),v.end(),[&](T a,T b){\\n Int au,av,ar;\\n tie(au,av,ar)=a;\\n Int bu,bv,br;\\n tie(bu,bv,br)=b;\\n return atan2(av,au)<atan2(bv,bu);\\n });\\n\\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n\\n using P = pair<Int, Int>;\\n SegmentTree<P, P>::F f=[&](P a,P b){\\n return P(min(a.first,b.first),max(a.second,b.second));};\\n\\n Int N=n*3;\\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\\n for(Int i=0;i<N;i++) seg.update(i,P(i,i));\\n\\n auto check=[&](Int a,Int b){\\n return max(abs(get<0>(v[a])-get<0>(v[b])),\\n\\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\\n };\\n \\n vector<Int> dp(N,N);\\n for(Int i=0;i<N;i++){\\n dp[i]=i;\\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n fill(dp.begin(),dp.end(),-1);\\n for(Int i=N-1;i>=0;i--){\\n dp[i]=i;\\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n \\n Int flg=1;\\n while(flg){\\n flg=0;\\n for(Int i=0;i<N;i++){\\n auto a=seg.query(i,i+1);\\n auto b=seg.query(a.first,a.second+1);\\n flg|=(a!=b);\\n seg.update(i,b);\\n }\\n }\\n\\n vector<Int> ans(n);\\n for(Int i=0;i<n;i++){\\n Int idx=m[v[i]];\\n auto a=seg.query(n+i,n+i+1);\\n Int k=(i-a.first+1)+(a.second-i+1)-1;\\n ans[idx]=min(k,n);\\n }\\n \\n for(Int i=0;i<n;i++) cout<<n-ans[i]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 71832,\n \"score_of_the_acc\": -0.4712,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3038_2752069\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb push_back\\n#define all(v) (v).begin(),(v).end()\\n#define fi first\\n#define se second\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\n\\n\\nint L;\\n\\ninline int T(pint p){\\n if(p.fi==L)return 0;\\n if(p.fi==-L)return 2;\\n if(p.se==L)return 1;\\n return 3;\\n}\\n\\nbool comp(const pint &a,const pint &b){\\n if(T(a)!=T(b))return T(a)<T(b);\\n if(T(a)==0){\\n return a.se<b.se;\\n }\\n else if(T(a)==1){\\n return a.fi<b.fi;\\n }\\n else if(T(a)==2){\\n return a.se>b.se;\\n }\\n else{\\n return a.fi>b.fi;\\n }\\n}\\n\\nint dist(pint p,pint q){\\n return max(abs(p.fi-q.fi),abs(p.se-q.se));\\n}\\n\\n\\nvpint ps;\\n\\nint N;\\nint X[222222],Y[222222],R[222222];\\nint l[222222],r[222222];\\n\\nint id(int k){\\n int lb=-1,ub=N;\\n while(ub-lb>1){\\n int mid=(ub+lb)/2;\\n if(comp(ps[mid],pint(Y[k],X[k])))lb=mid;\\n else ub=mid;\\n }\\n return ub;\\n}\\n\\nconst int SEG=1<<18;\\nvector<vint>G(SEG*2);\\nvoid addEdge(int a,int b,int x,int k=0,int l=0,int r=SEG){\\n if(r<=a||b<=l)return;\\n if(a<=l&&r<=b){\\n G[x].pb(k);\\n return;\\n }\\n addEdge(a,b,x,k*2+1,l,(l+r)/2);\\n addEdge(a,b,x,k*2+2,(l+r)/2,r);\\n}\\n\\n\\nnamespace SCC{\\n void visit(const vector<vector<int>>&G,vector<int>&vs,vector<int>&used,int v){\\n used[v]=true;\\n for(auto u:G[v]){\\n if(!used[u])visit(G,vs,used,u);\\n }\\n vs.push_back(v);\\n }\\n\\n void visit2(const vector<vector<int>>&T,vector<int>&used,vector<int>&comp,vector<int>&vec,int k,int v){\\n comp[v]=k;\\n used[v]=true;\\n vec.push_back(v);\\n\\n for(auto u:T[v]){\\n if(!used[u])visit2(T,used,comp,vec,k,u);\\n }\\n }\\n\\n void decompose(const vector<vector<int>>&G,vector<vector<int>>&H,vector<int>&comp){\\n vector<vector<int>>T(G.size());\\n for(int i=0;i<G.size();i++){\\n for(auto v:G[i]){\\n T[v].push_back(i);\\n }\\n }\\n comp.resize(G.size());\\n\\n vector<int>vs(G.size());\\n vector<int>used(G.size());\\n for(int i=0;i<G.size();i++){\\n if(!used[i])visit(G,vs,used,i);\\n }\\n reverse(vs.begin(),vs.end());\\n fill(used.begin(),used.end(),0);\\n\\n int K=0;\\n vector<vector<int>>S;\\n for(auto v:vs){\\n if(!used[v]){\\n S.push_back(vector<int>());\\n visit2(T,used,comp,S.back(),K++,v);\\n }\\n }\\n\\n H.resize(K);\\n fill(used.begin(),used.end(),0);\\n for(int i=0;i<K;i++){\\n for(auto v:S[i]){\\n for(auto u:G[v]){\\n if(used[comp[u]]||comp[v]==comp[u])continue;\\n used[comp[u]]=true;\\n H[comp[v]].push_back(comp[u]);\\n }\\n }\\n for(auto v:H[i])used[v]=false;\\n }\\n\\n }\\n}\\n\\nvpint add(vpint x,vpint y){\\n vpint z;\\n rep(i,x.size())z.pb(x[i]);\\n rep(i,y.size())z.pb(y[i]);\\n sort(all(z));\\n vpint w;\\n for(auto p:z){\\n if(w.size()==0||w.back().se+1<p.fi)w.pb(p);\\n else w.back().se=p.se;\\n }\\n return w;\\n}\\n\\nsigned main(){\\n cin>>N;\\n rep(i,N){\\n cin>>X[i]>>Y[i]>>R[i];\\n L=abs(X[i])+abs(Y[i]);\\n int x=X[i]+Y[i];\\n int y=X[i]-Y[i];\\n X[i]=x;\\n Y[i]=y;\\n }\\n\\n\\n rep(i,N)ps.pb({Y[i],X[i]});\\n sort(all(ps),comp);\\n\\n vint rrr(N);\\n rep(i,N)rrr[id(i)]=R[i];\\n rep(i,N)R[i]=rrr[i];\\n\\n rep(i,N)ps.pb(ps[i]);\\n\\n\\n rep(i,N){\\n if(R[i]>=2*L){\\n r[i]=(i-1+N)%N;\\n continue;\\n }\\n int lb=0,ub=N;\\n while(ub-lb>1){\\n int mid=(ub+lb)/2;\\n bool flag;\\n if(T(ps[i])==T(ps[i+mid]))flag=comp(ps[i],ps[i+mid])&&dist(ps[i],ps[i+mid])<=R[i];\\n else if((T(ps[i])+1)%4==T(ps[i+mid]))flag=dist(ps[i],ps[i+mid])<=R[i];\\n else flag=false;\\n\\n if(flag)lb=mid;\\n else ub=mid;\\n }\\n r[i]=(i+lb)%N;\\n }\\n\\n rep(i,N){\\n if(R[i]>2*L){\\n l[i]=i;\\n continue;\\n }\\n int lb=0,ub=N;\\n while(ub-lb>1){\\n int mid=(ub+lb)/2;\\n bool flag;\\n if(T(ps[i+N])==T(ps[i+N-mid]))flag=comp(ps[i+N-mid],ps[i+N])&&dist(ps[i+N-mid],ps[i+N])<=R[i];\\n else if((T(ps[i+N])+3)%4==T(ps[i+N-mid]))flag=dist(ps[i+N-mid],ps[i+N])<=R[i];\\n else flag=false;\\n\\n if(flag)lb=mid;\\n else ub=mid;\\n }\\n l[i]=(i+N-lb)%N;\\n }\\n\\n\\n rep(i,SEG-1){\\n G[i].pb(i*2+1);G[i].pb(i*2+2);\\n }\\n\\n rep(i,N){\\n if(l[i]<=r[i]){\\n addEdge(l[i],r[i]+1,i+SEG-1);\\n }\\n else{\\n addEdge(l[i],N,i+SEG-1);\\n addEdge(0,r[i]+1,i+SEG-1);\\n }\\n }\\n\\n vector<vint>H;\\n vint ra;\\n SCC::decompose(G,H,ra);\\n vector<vpint>dp(H.size());\\n rep(i,N){\\n int k=ra[i+SEG-1];\\n\\n vpint hoge;\\n if(l[i]<=r[i])hoge.pb({l[i],r[i]});\\n else{\\n hoge.pb({0,r[i]});\\n hoge.pb({l[i],N-1});\\n }\\n dp[k]=add(dp[k],hoge);\\n\\n }\\n\\n\\n /*\\n rep(i,N){\\n int k=ra[id(i)+SEG-1];\\n cout<<k<<endl;\\n for(auto p:dp[k])cout<<p.fi<<\\\" \\\"<<p.se<<endl;\\n cout<<\\\"---------\\\"<<endl;\\n }*/\\n\\n\\n for(int i=H.size()-1;i>=0;i--){\\n for(auto u:H[i]){\\n dp[i]=add(dp[i],dp[u]);\\n }\\n }\\n\\n rep(i,N){\\n int k=ra[id(i)+SEG-1];\\n int ans=0;\\n for(auto p:dp[k])ans+=p.se-p.fi+1;\\n cout<<N-ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.13333333333333333,\n \"time_ms\": 730,\n \"memory_kb\": 139296,\n \"score_of_the_acc\": -0.5956,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3038_2751481\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cassert>\\n#include <algorithm>\\n#include <numeric>\\n#include <random>\\n#include <vector>\\n#include <array>\\n#include <bitset>\\n#include <queue>\\n#include <set>\\n#include <unordered_set>\\n#include <map>\\n#include <unordered_map>\\n\\nusing namespace std;\\nusing uint = unsigned int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nconstexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T> using VV = V<V<T>>;\\n\\nstruct E {\\n int to;\\n};\\n\\nstruct SCC {\\n V<int> id;\\n VV<int> groups;\\n};\\n\\ntemplate<class E>\\nstruct SCC_EXEC {\\n const VV<E> &g;\\n int tm = 0;\\n V<bool> inS;\\n V<int> id, low, ord, st;\\n VV<int> groups;\\n void dfs(int v) {\\n low[v] = ord[v] = tm++;\\n st.push_back(v);\\n inS[v] = true;\\n for (auto e: g[v]) {\\n if (ord[e.to] == -1) {\\n dfs(e.to);\\n low[v] = min(low[v], low[e.to]);\\n } else if (inS[e.to]) {\\n low[v] = min(low[v], ord[e.to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n V<int> gr;\\n while (true) {\\n int u = st.back(); st.pop_back();\\n gr.push_back(u);\\n if (u == v) break;\\n }\\n for (int x: gr) inS[x] = false;\\n groups.push_back(gr);\\n }\\n }\\n SCC info;\\n SCC_EXEC(const VV<E> &g) : g(g) {\\n int n = int(g.size());\\n inS = V<bool>(n); low = V<int>(n); ord = V<int>(n, -1);\\n for (int i = 0; i < n; i++) {\\n if (ord[i] == -1) dfs(i);\\n }\\n reverse(begin(groups), end(groups));\\n V<int> id(n);\\n for (int i = 0; i < int(groups.size()); i++) {\\n for (int x: groups[i]) {\\n id[x] = i;\\n }\\n }\\n info = SCC{id, groups};\\n }\\n};\\ntemplate<class E> SCC scc(const VV<E> &g) { return SCC_EXEC<E>(g).info; }\\n\\nint n, N;\\nVV<E> g;\\n\\nvoid adde(int i, int j) {\\n// cout << \\\"adde \\\" << i << \\\" -> \\\" << j << endl;\\n g[i].push_back(E{j});\\n}\\n\\nstruct Node {\\n using NP = Node*;\\n int sz;\\n NP l, r;\\n\\n int id;\\n\\n Node(int sz, int off) : sz(sz) {\\n id = N; N++;\\n g.push_back(V<E>{});\\n\\n if (sz == 1) {\\n adde(id, off);\\n return;\\n }\\n l = new Node(sz/2, off);\\n r = new Node(sz-sz/2, off+sz/2);\\n adde(id, l->id);\\n adde(id, r->id);\\n }\\n\\n void add(int a, int b, int x) {\\n if (b <= 0 || sz <= a) return;\\n if (a <= 0 && sz <= b) {\\n adde(x, id);\\n return;\\n }\\n l->add(a, b, x);\\n r->add(a-sz/2, b-sz/2, x);\\n }\\n};\\n\\nV<int> solve(const V<int> &le, const V<int> &ri) {\\n N = 2*n;\\n g = VV<E>(2*n);\\n auto tr = new Node(2*n, 0);\\n for (int i = 0; i < n; i++) {\\n int l = le[i], r = ri[i];\\n if (l < r) {\\n tr->add(l, r, i);\\n tr->add(l+n, r+n, i+n);\\n } else {\\n if (i < r) {\\n tr->add(0, r, i);\\n tr->add(l, n+r, n+i);\\n } else {\\n tr->add(l, n+r, i);\\n tr->add(n+l, 2*n, n+i); \\n }\\n }\\n }\\n auto scci = scc(g);\\n int m = int(scci.groups.size());\\n V<int> dpmi(m, TEN(9)), dpma(m, -TEN(9));\\n\\n for (int i = m-1; i >= 0; i--) {\\n for (int p: scci.groups[i]) {\\n if (p < 2*n) {\\n dpmi[i] = min(dpmi[i], p);\\n dpma[i] = max(dpma[i], p);\\n }\\n assert(0 <= p && p < g.size());\\n for (auto e: g[p]) {\\n int q = e.to;\\n //p -> q\\n int j = scci.id[q];\\n dpmi[i] = min(dpmi[i], dpmi[j]);\\n dpma[i] = max(dpma[i], dpma[j]);\\n }\\n }\\n }\\n\\n V<int> v(n);\\n for (int p = 0; p < n; p++) {\\n int i = scci.id[p];\\n int ni = scci.id[n+p];\\n// int l = dpmi[ni] - n, r = dpma[i];\\n int l = min(dpmi[i], dpmi[ni] - n);\\n int r = max(dpma[i], dpma[ni] - n);\\n// cout << p << \\\" \\\" << l << \\\" \\\" << r << endl;\\n v[p] = n-min(n, r-l+1);\\n }\\n return v;\\n}\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << setprecision(20);\\n\\n cin >> n;\\n using P = pair<ll, ll>;\\n using T = tuple<ll, P, ll>; // pid, pos, rad\\n V<T> v(n);\\n\\n ll R;\\n for (int i = 0; i < n; i++) {\\n ll x, y, r, pid;\\n cin >> x >> y >> r;\\n R = abs(x) + abs(y);\\n\\n if (x >= 0 && y >= 0) {\\n pid = y;\\n } else if (x <= 0 && y >= 0) {\\n pid = R - x;\\n } else if (x <= 0 && y <= 0) {\\n pid = 2*R - y;\\n } else {\\n pid = 3*R + x;\\n }\\n v[i] = T(pid, P(x, y), r);\\n }\\n\\n V<int> idx(n);\\n iota(begin(idx), end(idx), 0);\\n sort(begin(idx), end(idx), [&](int a, int b){\\n return v[a] < v[b];\\n });\\n\\n V<P> p(2*n);\\n V<ll> pid(2*n), r(2*n);\\n\\n for (int i = 0; i < n; i++) {\\n tie(pid[i], p[i], r[i]) = v[idx[i]];\\n tie(pid[n+i], p[n+i], r[n+i]) = v[idx[i]];\\n pid[n+i] += 4*R;\\n }\\n\\n auto hit = [&](int i, int j) {\\n int di = 0;\\n di += abs(p[i].first - p[j].first);\\n di += abs(p[i].second - p[j].second);\\n return di <= r[i];\\n };\\n\\n V<int> le(n), ri(n);\\n //left\\n for (int i = 0; i < n; i++) { \\n int l, r = n+i;\\n l = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid) - 1;\\n while (r-l > 1) {\\n int md = (l+r)/2;\\n if (!hit(n+i, md)) {\\n l = md;\\n } else {\\n r = md;\\n }\\n }\\n le[i] = r;\\n }\\n\\n //right\\n for (int i = 0; i < n; i++) { \\n int l = i, r;\\n r = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid);\\n while (r-l > 1) {\\n int md = (l+r)/2;\\n if (hit(i, md)) {\\n l = md;\\n } else {\\n r = md;\\n }\\n }\\n ri[i] = n+r;\\n }\\n\\n for (int i = 0; i < n; i++) {\\n if (ri[i] - le[i] >= n) {\\n le[i] = 0; ri[i] = n;\\n } else {\\n le[i] %= n; ri[i] %= n;\\n }\\n }\\n/* for (int i = 0; i < n; i++) {\\n cout << idx[i] << \\\", \\\";\\n }\\n cout << endl;\\n for (int i = 0; i < n; i++) {\\n cout << p[i].first << \\\" \\\" << p[i].second << \\\" \\\" << le[i] << \\\" \\\" << ri[i] << endl;\\n }*/\\n\\n V<int> ans = solve(le, ri);\\n V<int> lst(n);\\n for (int i = 0; i < n; i++) {\\n lst[idx[i]] = ans[i];\\n }\\n\\n for (int d: lst) {\\n cout << d << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 233488,\n \"score_of_the_acc\": -1,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3038_2751466\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cassert>\\n#include <algorithm>\\n#include <numeric>\\n#include <random>\\n#include <vector>\\n#include <array>\\n#include <bitset>\\n#include <queue>\\n#include <set>\\n#include <unordered_set>\\n#include <map>\\n#include <unordered_map>\\n\\nusing namespace std;\\nusing uint = unsigned int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nconstexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T> using VV = V<V<T>>;\\n\\nstruct E {\\n int to;\\n};\\n\\nstruct SCC {\\n V<int> id;\\n VV<int> groups;\\n};\\n\\ntemplate<class E>\\nstruct SCC_EXEC {\\n const VV<E> &g;\\n int tm = 0;\\n V<bool> inS;\\n V<int> id, low, ord, st;\\n VV<int> groups;\\n void dfs(int v) {\\n low[v] = ord[v] = tm++;\\n st.push_back(v);\\n inS[v] = true;\\n for (auto e: g[v]) {\\n if (ord[e.to] == -1) {\\n dfs(e.to);\\n low[v] = min(low[v], low[e.to]);\\n } else if (inS[e.to]) {\\n low[v] = min(low[v], ord[e.to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n V<int> gr;\\n while (true) {\\n int u = st.back(); st.pop_back();\\n gr.push_back(u);\\n if (u == v) break;\\n }\\n for (int x: gr) inS[x] = false;\\n groups.push_back(gr);\\n }\\n }\\n SCC info;\\n SCC_EXEC(const VV<E> &g) : g(g) {\\n int n = int(g.size());\\n inS = V<bool>(n); low = V<int>(n); ord = V<int>(n, -1);\\n for (int i = 0; i < n; i++) {\\n if (ord[i] == -1) dfs(i);\\n }\\n reverse(begin(groups), end(groups));\\n V<int> id(n);\\n for (int i = 0; i < int(groups.size()); i++) {\\n for (int x: groups[i]) {\\n id[x] = i;\\n }\\n }\\n info = SCC{id, groups};\\n }\\n};\\ntemplate<class E> SCC scc(const VV<E> &g) { return SCC_EXEC<E>(g).info; }\\n\\nint n, N;\\nVV<E> g;\\n\\nvoid adde(int i, int j) {\\n// cout << \\\"adde \\\" << i << \\\" -> \\\" << j << endl;\\n g[i].push_back(E{j});\\n}\\n\\nstruct Node {\\n using NP = Node*;\\n int sz;\\n NP l, r;\\n\\n int id;\\n\\n Node(int sz, int off) : sz(sz) {\\n id = N; N++;\\n g.push_back(V<E>{});\\n\\n if (sz == 1) {\\n adde(id, off);\\n return;\\n }\\n l = new Node(sz/2, off);\\n r = new Node(sz-sz/2, off+sz/2);\\n adde(id, l->id);\\n adde(id, r->id);\\n }\\n\\n void add(int a, int b, int x) {\\n if (b <= 0 || sz <= a) return;\\n if (a <= 0 && sz <= b) {\\n adde(x, id);\\n return;\\n }\\n l->add(a, b, x);\\n r->add(a-sz/2, b-sz/2, x);\\n }\\n};\\n\\nV<int> solve(const V<int> &le, const V<int> &ri) {\\n N = 2*n;\\n g = VV<E>(2*n);\\n auto tr = new Node(2*n, 0);\\n for (int i = 0; i < n; i++) {\\n int l = le[i], r = ri[i];\\n if (l < r) {\\n tr->add(l, r, i);\\n tr->add(l+n, r+n, i+n);\\n } else {\\n if (i < r) {\\n tr->add(0, r, i);\\n tr->add(l, n+r, n+i);\\n } else {\\n tr->add(l, n+r, i);\\n tr->add(n+l, 2*n, n+i); \\n }\\n }\\n }\\n auto scci = scc(g);\\n int m = int(scci.groups.size());\\n V<int> dpmi(m, TEN(9)), dpma(m, -TEN(9));\\n\\n for (int i = m-1; i >= 0; i--) {\\n for (int p: scci.groups[i]) {\\n if (p < 2*n) {\\n dpmi[i] = min(dpmi[i], p);\\n dpma[i] = max(dpma[i], p);\\n }\\n assert(0 <= p && p < g.size());\\n for (auto e: g[p]) {\\n int q = e.to;\\n //p -> q\\n int j = scci.id[q];\\n dpmi[i] = min(dpmi[i], dpmi[j]);\\n dpma[i] = max(dpma[i], dpma[j]);\\n }\\n }\\n }\\n\\n V<int> v(n);\\n for (int p = 0; p < n; p++) {\\n int i = scci.id[p];\\n int ni = scci.id[n+p];\\n int l = dpmi[ni] - n, r = dpma[i];\\n// cout << p << \\\" \\\" << l << \\\" \\\" << r << endl;\\n v[p] = n-min(n, r-l+1);\\n }\\n return v;\\n}\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << setprecision(20);\\n\\n cin >> n;\\n using P = pair<ll, ll>;\\n using T = tuple<ll, P, ll>; // pid, pos, rad\\n V<T> v(n);\\n\\n ll R;\\n for (int i = 0; i < n; i++) {\\n ll x, y, r, pid;\\n cin >> x >> y >> r;\\n R = abs(x) + abs(y);\\n\\n if (x >= 0 && y >= 0) {\\n pid = y;\\n } else if (x <= 0 && y >= 0) {\\n pid = R - x;\\n } else if (x <= 0 && y <= 0) {\\n pid = 2*R - y;\\n } else {\\n pid = 3*R + x;\\n }\\n v[i] = T(pid, P(x, y), r);\\n }\\n\\n V<int> idx(n);\\n iota(begin(idx), end(idx), 0);\\n sort(begin(idx), end(idx), [&](int a, int b){\\n return v[a] < v[b];\\n });\\n\\n V<P> p(2*n);\\n V<ll> pid(2*n), r(2*n);\\n\\n for (int i = 0; i < n; i++) {\\n tie(pid[i], p[i], r[i]) = v[idx[i]];\\n tie(pid[n+i], p[n+i], r[n+i]) = v[idx[i]];\\n pid[n+i] += 4*R;\\n }\\n\\n auto hit = [&](int i, int j) {\\n int di = 0;\\n di += abs(p[i].first - p[j].first);\\n di += abs(p[i].second - p[j].second);\\n return di <= r[i];\\n };\\n\\n V<int> le(n), ri(n);\\n //left\\n for (int i = 0; i < n; i++) { \\n int l, r = n+i;\\n l = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid) - 1;\\n while (r-l > 1) {\\n int md = (l+r)/2;\\n if (!hit(n+i, md)) {\\n l = md;\\n } else {\\n r = md;\\n }\\n }\\n le[i] = r;\\n }\\n\\n //right\\n for (int i = 0; i < n; i++) { \\n int l = i, r;\\n r = lower_bound(begin(pid), end(pid), pid[i] + 2*R) - begin(pid);\\n while (r-l > 1) {\\n int md = (l+r)/2;\\n if (hit(i, md)) {\\n l = md;\\n } else {\\n r = md;\\n }\\n }\\n ri[i] = n+r;\\n }\\n\\n for (int i = 0; i < n; i++) {\\n if (ri[i] - le[i] >= n) {\\n le[i] = 0; ri[i] = n;\\n } else {\\n le[i] %= n; ri[i] %= n;\\n }\\n }\\n/* for (int i = 0; i < n; i++) {\\n cout << idx[i] << \\\", \\\";\\n }\\n cout << endl;\\n for (int i = 0; i < n; i++) {\\n cout << p[i].first << \\\" \\\" << p[i].second << \\\" \\\" << le[i] << \\\" \\\" << ri[i] << endl;\\n }*/\\n\\n V<int> ans = solve(le, ri);\\n V<int> lst(n);\\n for (int i = 0; i < n; i++) {\\n lst[idx[i]] = ans[i];\\n }\\n\\n for (int d: lst) {\\n cout << d << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.36666666666666664,\n \"time_ms\": 590,\n \"memory_kb\": 233384,\n \"score_of_the_acc\": -1.0053,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3038_2747372\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define MAX 200005\\ntypedef pair<int,int> Data;\\ntypedef complex<int> Point;\\ntypedef pair<double,int> Pair;\\nconst double PI = acos(-1);\\n\\nData merge(Data a,Data b){\\n return Data( min(a.first,b.first) , max(a.second,b.second) );\\n}\\n\\nconst int segN=(1<<20);\\nstruct segtree{\\n Data t[ segN*2 ];\\n \\n void Update(int i,Data d){\\n i+=(segN-1);\\n t[i]=d;\\n while(i){\\n i=(i-1)/2;\\n t[i]=merge(t[i*2+1],t[i*2+2]);\\n }\\n }\\n \\n Data Get(int a,int b,int k=0,int l=0,int r=segN){\\n if( b<=l || r<=a ){\\n return Data(a,b);\\n }\\n if( a<=l && r<=b ){\\n return t[k];\\n }\\n int m=(l+r)/2;\\n Data lv=Get(a,b,k*2+1,l,m);\\n Data rv=Get(a,b,k*2+2,m,r);\\n return merge(lv,rv);\\n }\\n};\\n\\nint calc(Point a){\\n return abs( a.real() ) + abs( a.imag() );\\n}\\n\\nint calc(Point a,Point b){\\n return calc(a-b);\\n}\\n\\ndouble Arg(Point a){\\n complex<double> b( a.real(), a.imag() );\\n return arg(b);\\n}\\n\\nint n;\\nint x[MAX];\\nint y[MAX];\\nPoint p[MAX];\\nint r[MAX];\\n\\n\\nsegtree T;\\n\\nint main(){\\n cin>>n;\\n for(int i=0;i<n;i++){\\n cin>>x[i]>>y[i]>>r[i];\\n p[i]=Point(x[i],y[i]);\\n }\\n \\n vector<Pair> v(n*3);\\n for(int i=0;i<n;i++){\\n v[i]=Pair( Arg(p[i]) , i );\\n v[i+n]=Pair( Arg(p[i])+2.0*PI , i );\\n v[i+n+n]=Pair( Arg(p[i])+4.0*PI , i );\\n }\\n sort(v.begin(),v.end());\\n vector<Point> w(n*3);\\n vector<int> R(n*3);\\n for(int i=0;i<n*3;i++){\\n w[i]=p[ v[i].second%n ];\\n R[i]=r[ v[i].second%n ];\\n }\\n\\n vector<int> lv(n*3),rv(n*3);\\n for(int i=n;i<n*2;i++){\\n if( R[i] >= calc(w[i])*2 ){\\n lv[i]=0;\\n rv[i]=n*3;\\n continue;\\n }\\n \\n vector<Pair> :: iterator it;\\n int right,left,mid;\\n \\n it = lower_bound( v.begin(), v.end(), Pair( v[i].first-PI , -1 ) );\\n left=it-v.begin();\\n right=i;\\n while(left<right){\\n mid=(left+right)/2;\\n if( calc(w[i],w[mid]) <= R[i] ){\\n right=mid;\\n }else{\\n left=mid+1;\\n }\\n }\\n lv[i]=left;\\n \\n it = lower_bound( v.begin(), v.end(), Pair( v[i].first+PI , -1 ) );\\n right=it-v.begin();\\n\\n left=i;\\n \\n while( left<right ){\\n mid=(left+right)/2;\\n if( calc(w[i],w[mid]) <= R[i] ){\\n left=mid+1;\\n }else{\\n right=mid;\\n }\\n }\\n rv[i]=left;\\n }\\n\\n // for(int i=0;i<3*n;i++)cout<<i<<' '<<w[i]<<' '<<R[i]<<endl;\\n \\n for(int i=0;i<3*n;i++){\\n T.Update(i, Data(i,i+1) );\\n }\\n \\n for(int i=n;i<n*2;i++){\\n T.Update(i, Data( lv[i], rv[i] ) );\\n }\\n \\n for(int tc=0;tc<20;tc++){\\n \\n for(int i=0;i<n;i++){\\n Data tmp=T.Get(i+n,i+n+1);\\n Data base=tmp;\\n base.first-=n;\\n base.second-=n;\\n if(base.first<0)base.first=0;\\n if(base.second>n*3)base.second=n*3;\\n T.Update(i, base);\\n base=tmp;\\n base.first+=n;\\n base.second+=n;\\n if(base.first<0)base.first=0;\\n if(base.second>n*3)base.second=n*3;\\n T.Update(i+n*2,base);\\n }\\n\\n for(int i=n;i<n*2;i++){\\n Data base=T.Get(i,i+1);\\n Data A=T.Get( base.first , base.second );\\n T.Update( i, A );\\n }\\n }\\n\\n map<int,int> mp;\\n for(int i=n;i<n*2;i++){\\n Data tmp=T.Get(i,i+1);\\n int len=tmp.second-tmp.first;\\n mp[ v[i].second%n ]=max(0, n-len);\\n }\\n for(int i=0;i<n;i++){\\n cout<<mp[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2070,\n \"memory_kb\": 53788,\n \"score_of_the_acc\": -0.9324,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3038_2747367\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\n//const int INF = 1e9;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\\nostream& operator<<(ostream& o,T &a){\\n return o <<\\\"( x=\\\"<<get<0>(a)<<\\\", y=\\\"<<get<1>(a)<<\\\", r=\\\"<<get<2>(a)<<\\\", idx=\\\"<<get<3>(a)<<\\\")\\\";\\n}\\n\\nclass RMQ{\\npublic:\\n //int INF = 1e9;\\n int INF = 1LL<<55;\\n int n;\\n vector<int> dat;\\n int flag; // Range Max Queryにしたいときはflag=1にする。\\n \\n //初期化\\n RMQ(){n=-1;}\\n RMQ(int n_,int flag = 0){\\n this->flag = flag;\\n n=1;\\n while(n<n_)n*=2;\\n dat.resize(2*n-1,INF);\\n }\\n \\n //k番目の値をaに変更\\n void update(int k,int a){\\n assert(a >= 0);\\n if(flag) a *= -1;\\n k+=n-1;\\n assert(dat[k] >= a);\\n \\n dat[k]=a;\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n\\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\\n \\n //[a,b)の最小値を求める query(a,b,0,0,n)\\n int query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r == -1) r = n, assert(a < n && b <= n);\\n if(r<=a||b<=l)return INF;\\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\\n int vl=query(a,b,k*2+1,l,(l+r)/2);\\n int vr=query(a,b,k*2+2,(l+r)/2,r);\\n int res = min(vl,vr);\\n if(k == 0 && flag) res *= -1;\\n return res;\\n }\\n\\n};\\n\\n\\n//rが小さい順に処理する。\\nRMQ initTo(const vector<T> &A){\\n\\n auto getDisT=[&](const T &a,const T &b){\\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return abs(x1 - x2) + abs(y1 - y2);\\n };\\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\\n \\n int n = A.size();\\n RMQ res(n,1);\\n vector<int> Idx(n);\\n for(int i=0;i<n;i++) Idx[i] = i;\\n\\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\\n int r1 = get<2>(A[a]);\\n int r2 = get<2>(A[b]);\\n return r1 < r2;\\n });\\n \\n RMQ mem(n,1);\\n function<int(int,int)> search=[&](int pos,int start){\\n const int r = get<2>(A[start]);\\n if(getDis(start,pos) > r) return pos;\\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\\n int nx = mem.value(pos);\\n if(nx == -INF || nx == pos) nx = pos+1;\\n int to = search(nx,start);\\n mem.update(pos,to);\\n return to;\\n };\\n \\n for(int i=0;i<n;i++) {\\n int to=search(Idx[i],Idx[i]);\\n res.update(Idx[i],to);\\n mem.update(Idx[i],to);\\n }\\n return res;\\n}\\n\\nint dfs(int pos,RMQ &To){\\n int l = pos, r = To.value(pos);\\n int to = To.query(l,r+1);\\n if(to == pos) return pos;\\n int res = dfs(to,To);\\n To.update(pos,res);\\n return res;\\n}\\n\\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\\n int rpos = 2 * n - 1 - pos%n;\\n int lmax = dfs(rpos,rTo) - rpos;\\n int lto = dfs( To.query(max(0LL,pos - lmax),pos+1), To );\\n int rto = dfs(pos,To);\\n int to = max(lto,rto);\\n if(lto > rto) to = dfs2(lto,To,rTo,n);\\n To.update(pos,to);\\n return to;\\n}\\n\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<T> A(n),rA;\\n \\n set<P> used;\\n for(int i=0;i<n;i++){\\n int x,y,r;\\n scanf(\\\"%lld%lld%lld\\\",&x,&y,&r);\\n assert(used.count(P(x,y)) == 0);\\n used.insert(P(x,y));\\n A[i] = T(x,y,r,i);\\n }\\n\\n sort(A.begin(),A.end(),[&](T &a,T &b){\\n typedef complex<double> P;\\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return arg(P(x1,y1)) < arg(P(x2,y2));\\n });\\n \\n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\\n rA = A; reverse(rA.begin(),rA.end());\\n\\n RMQ To = initTo(A);\\n RMQ rTo = initTo(rA);\\n \\n vector<int> ans(n);\\n int update = 1;\\n while(update){\\n update = 0;\\n for(int i=n;i<2*n;i++){\\n int ri = (2 * n - 1) - i%n;\\n int idx = get<3>(A[i]);\\n int to = dfs2(i,To,rTo,n);\\n int rto = dfs2(ri,rTo,To,n);\\n int num = to - i + 1;\\n int rnum = rto - ri + 1;\\n assert(A[i] == rA[ri]);\\n int score = min(n,num+rnum-1);\\n update |= ans[idx] < score;\\n ans[idx] = score;\\n }\\n } \\n for(int a:ans) printf(\\\"%lld\\\\n\\\",n - a);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2290,\n \"memory_kb\": 125716,\n \"score_of_the_acc\": -1.4369,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3038_2744631\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n Int n;\\n F f;\\n G g;\\n T ti;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(Int n_,F f,G g,T ti):\\n f(f),g(g),ti(ti){\\n init(n_);\\n }\\n void init(Int n_){\\n n=1;\\n while(n<n_) n*=2;\\n dat.assign(2*n-1,ti);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\\n for(Int i=n-2;i>=0;i--)\\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\\n }\\n void update(Int k,E a){\\n k+=n-1;\\n dat[k]=g(dat[k],a);\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n inline T query(Int a,Int b){\\n T vl=ti,vr=ti;\\n for(Int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,dat[(l++)-1]);\\n if(r&1) vr=f(dat[(--r)-1],vr);\\n }\\n return f(vl,vr);\\n }\\n\\n Int find(Int a,Int b,function<bool(T)> &check,Int k,Int l,Int r){\\n if(!check(dat[k])||r<=a||b<=l) return -1;\\n if(k>=n-1) return k-(n-1);\\n Int m=(l+r)>>1;\\n Int vl=find(a,b,check,k*2+1,l,m);\\n if(~vl) return vl;\\n return find(a,b,check,k*2+2,m,r);\\n }\\n \\n Int find(Int a,Int b,function<bool(T)> &check){\\n return find(a,b,check,0,0,n);\\n }\\n \\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n;\\n cin>>n;\\n using T = tuple<Int, Int, Int>;\\n vector<T> v(n);\\n map<T, Int> m;\\n for(Int i=0;i<n;i++){\\n Int x,y,r;\\n cin>>x>>y>>r;\\n v[i]=T(x+y,x-y,r);\\n m[v[i]]=i;\\n }\\n \\n sort(v.begin(),v.end(),[&](T a,T b){\\n Int au,av,ar;\\n tie(au,av,ar)=a;\\n Int bu,bv,br;\\n tie(bu,bv,br)=b;\\n return atan2(av,au)<atan2(bv,bu);\\n });\\n\\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n for(Int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n\\n using P = pair<Int, Int>;\\n SegmentTree<P, P>::F f=[&](P a,P b){\\n return P(min(a.first,b.first),max(a.second,b.second));};\\n\\n\\n Int N=n*3;\\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\\n for(Int i=0;i<N;i++) seg.update(i,P(i,i));\\n\\n auto check=[&](Int a,Int b){\\n return max(abs(get<0>(v[a])-get<0>(v[b])),\\n\\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\\n };\\n \\n vector<Int> dp(N,N);\\n for(Int i=0;i<N;i++){\\n dp[i]=i;\\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n fill(dp.begin(),dp.end(),-1);\\n for(Int i=N-1;i>=0;i--){\\n dp[i]=i;\\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n \\n Int flg=1;\\n while(flg){\\n flg=0;\\n for(Int i=0;i<N;i++){\\n auto a=seg.query(i,i+1);\\n auto b=seg.query(a.first,a.second+1);\\n flg|=(a!=b);\\n seg.update(i,b);\\n }\\n }\\n\\n vector<Int> ans(n);\\n for(Int i=0;i<n;i++){\\n Int idx=m[v[i]];\\n auto a=seg.query(n+i,n+i+1);\\n Int k=(i-a.first+1)+(a.second-i+1)-1;\\n ans[idx]=min(k,n);\\n }\\n \\n for(Int i=0;i<n;i++) cout<<n-ans[i]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1220,\n \"memory_kb\": 71820,\n \"score_of_the_acc\": -0.5296,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3038_2744614\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n int n;\\n F f;\\n G g;\\n T ti;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(int n_,F f,G g,T ti):\\n f(f),g(g),ti(ti){\\n init(n_);\\n }\\n void init(int n_){\\n n=1;\\n while(n<n_) n*=2;\\n dat.assign(2*n-1,ti);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[i+n-1]=v[i];\\n for(int i=n-2;i>=0;i--)\\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\\n }\\n void update(int k,E a){\\n k+=n-1;\\n dat[k]=g(dat[k],a);\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n inline T query(int a,int b){\\n T vl=ti,vr=ti;\\n for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,dat[(l++)-1]);\\n if(r&1) vr=f(dat[(--r)-1],vr);\\n }\\n return f(vl,vr);\\n }\\n\\n int find(int a,int b,function<bool(T)> &check,int k,int l,int r){\\n if(!check(dat[k])||r<=a||b<=l) return -1;\\n if(k>=n-1) return k-(n-1);\\n int m=(l+r)>>1;\\n int vl=find(a,b,check,k*2+1,l,m);\\n if(~vl) return vl;\\n return find(a,b,check,k*2+2,m,r);\\n }\\n \\n int find(int a,int b,function<bool(T)> &check){\\n return find(a,b,check,0,0,n);\\n }\\n \\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n cin>>n;\\n using T = tuple<int, int, int>;\\n vector<T> v(n);\\n map<T, int> m;\\n for(int i=0;i<n;i++){\\n int x,y,r;\\n cin>>x>>y>>r;\\n v[i]=T(x+y,x-y,r);\\n m[v[i]]=i;\\n }\\n \\n sort(v.begin(),v.end(),[&](T a,T b){\\n int au,av,ar;\\n tie(au,av,ar)=a;\\n int bu,bv,br;\\n tie(bu,bv,br)=b;\\n return atan2(av,au)<atan2(bv,bu);\\n });\\n\\n for(int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n for(int i=0;i<n;i++) v.emplace_back(T(v[i]));\\n\\n using P = pair<int, int>;\\n SegmentTree<P, P>::F f=[&](P a,P b){\\n return P(min(a.first,b.first),max(a.second,b.second));};\\n\\n\\n int N=n*3;\\n SegmentTree<P, P> seg(N,f,f,P(N,-1));\\n for(int i=0;i<N;i++) seg.update(i,P(i,i));\\n\\n auto check=[&](int a,int b){\\n return max(abs(get<0>(v[a])-get<0>(v[b])),\\n\\t abs(get<1>(v[a])-get<1>(v[b])))<=(get<2>(v[b]));\\n };\\n \\n vector<int> dp(N,N);\\n for(int i=0;i<N;i++){\\n dp[i]=i;\\n while(0<dp[i]&&check(dp[i]-1,i)) dp[i]=dp[dp[i]-1];\\n //cout<<i<<\\\":\\\"<<dp[i]<<endl;\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n fill(dp.begin(),dp.end(),-1);\\n for(int i=N-1;i>=0;i--){\\n dp[i]=i;\\n while(dp[i]+1<N&&check(dp[i]+1,i)) dp[i]=dp[dp[i]+1];\\n //cout<<i<<\\\":\\\"<<dp[i]<<endl;\\n seg.update(i,P(dp[i],dp[i]));\\n }\\n \\n int flg=1;\\n while(flg){\\n flg=0;\\n for(int i=0;i<N;i++){\\n auto a=seg.query(i,i+1);\\n auto b=seg.query(a.first,a.second+1);\\n flg|=(a!=b);\\n //if(a!=b) cout<<a.first<<\\\" \\\"<<a.second<<\\\":\\\"<<b.first<<\\\" \\\"<<b.second<<endl;\\n seg.update(i,b);\\n }\\n }\\n\\n vector<int> ans(n);\\n for(int i=0;i<n;i++){\\n int idx=m[v[i]];\\n auto a=seg.query(n+i,n+i+1);\\n int k=(i-a.first+1)+(a.second-i+1)-1;\\n ans[idx]=min(k,n);\\n }\\n \\n for(int i=0;i<n;i++) cout<<n-ans[i]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1250,\n \"memory_kb\": 42096,\n \"score_of_the_acc\": -0.3918,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3038_2744609\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\nconst int INF = 1LL<<55;\\n//const int INF = 1e9;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\\nostream& operator<<(ostream& o,T &a){\\n return o <<\\\"( x=\\\"<<get<0>(a)<<\\\", y=\\\"<<get<1>(a)<<\\\", r=\\\"<<get<2>(a)<<\\\", idx=\\\"<<get<3>(a)<<\\\")\\\";\\n}\\n\\nclass RMQ{\\npublic:\\n //int INF = 1e9;\\n int INF = 1LL<<55;\\n int n;\\n vector<int> dat;\\n int flag; // Range Max Queryにしたいときはflag=1にする。\\n \\n //初期化\\n RMQ(){n=-1;}\\n RMQ(int n_,int flag = 0){\\n this->flag = flag;\\n n=1;\\n while(n<n_)n*=2;\\n dat.resize(2*n-1,INF);\\n }\\n \\n //k番目の値をaに変更\\n void update(int k,int a){\\n assert(a >= 0);\\n if(flag) a *= -1;\\n k+=n-1;\\n assert(dat[k] >= a);\\n \\n dat[k]=a;\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n\\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\\n \\n //[a,b)の最小値を求める query(a,b,0,0,n)\\n int query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r == -1) r = n, assert(a < n && b <= n);\\n if(r<=a||b<=l)return INF;\\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\\n int vl=query(a,b,k*2+1,l,(l+r)/2);\\n int vr=query(a,b,k*2+2,(l+r)/2,r);\\n int res = min(vl,vr);\\n if(k == 0 && flag) res *= -1;\\n return res;\\n }\\n\\n};\\n\\n\\n//rが小さい順に処理する。\\nRMQ initTo(const vector<T> &A){\\n\\n auto getDisT=[&](const T &a,const T &b){\\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return abs(x1 - x2) + abs(y1 - y2);\\n };\\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\\n \\n int n = A.size();\\n RMQ res(n,1);\\n vector<int> Idx(n);\\n for(int i=0;i<n;i++) Idx[i] = i;\\n\\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\\n int r1 = get<2>(A[a]);\\n int r2 = get<2>(A[b]);\\n return r1 < r2;\\n });\\n \\n RMQ mem(n,1);\\n function<int(int,int)> search=[&](int pos,int start){\\n const int r = get<2>(A[start]);\\n if(getDis(start,pos) > r) return pos;\\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\\n int nx = mem.value(pos);\\n if(nx == -INF || nx == pos) nx = pos+1;\\n int to = search(nx,start);\\n mem.update(pos,to);\\n return to;\\n };\\n \\n for(int i=0;i<n;i++) {\\n int to=search(Idx[i],Idx[i]);\\n res.update(Idx[i],to);\\n mem.update(Idx[i],to);\\n }\\n return res;\\n}\\n\\nint dfs(int pos,RMQ &To){\\n int l = pos, r = To.value(pos);\\n int to = To.query(l,r+1);\\n if(to == pos) return pos;\\n int res = dfs(to,To);\\n To.update(pos,res);\\n return res;\\n}\\n\\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\\n int rpos = 2 * n - 1 - pos%n;\\n int lmax = dfs(rpos,rTo) - rpos;\\n int lto = dfs( To.query(max(0LL,pos - lmax),pos+1), To );\\n int rto = dfs(pos,To);\\n int to = max(lto,rto);\\n if(lto > rto) to = dfs2(lto,To,rTo,n);\\n To.update(pos,to);\\n return to;\\n}\\n\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<T> A(n),rA;\\n \\n for(int i=0;i<n;i++){\\n int x,y,r;\\n scanf(\\\"%lld%lld%lld\\\",&x,&y,&r);\\n A[i] = T(x,y,r,i);\\n }\\n\\n sort(A.begin(),A.end(),[&](T &a,T &b){\\n typedef complex<double> P;\\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return arg(P(x1,y1)) < arg(P(x2,y2));\\n });\\n \\n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\\n rA = A; reverse(rA.begin(),rA.end());\\n\\n RMQ To = initTo(A);\\n RMQ rTo = initTo(rA);\\n \\n vector<int> ans(n);\\n int update = 1;\\n while(update){\\n update = 0;\\n for(int i=n;i<2*n;i++){\\n int ri = (2 * n - 1) - i%n;\\n int idx = get<3>(A[i]);\\n int to = dfs2(i,To,rTo,n);\\n int rto = dfs2(ri,rTo,To,n);\\n int num = to - i + 1;\\n int rnum = rto - ri + 1;\\n assert(A[i] == rA[ri]);\\n int score = min(n,num+rnum-1);\\n update |= ans[idx] < score;\\n ans[idx] = score;\\n }\\n } \\n for(int a:ans) printf(\\\"%lld\\\\n\\\",n - a);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2250,\n \"memory_kb\": 113216,\n \"score_of_the_acc\": -1.3482,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3038_2744586\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n//#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\n//const int INF = 1LL<<55;\\nconst int INF = 1e9;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\\nostream& operator<<(ostream& o,T &a){\\n return o <<\\\"( x=\\\"<<get<0>(a)<<\\\", y=\\\"<<get<1>(a)<<\\\", r=\\\"<<get<2>(a)<<\\\", idx=\\\"<<get<3>(a)<<\\\")\\\";\\n}\\n\\nclass RMQ{\\npublic:\\n int INF = 1e9;\\n int n;\\n vector<int> dat;\\n int flag; // Range Max Queryにしたいときはflag=1にする。\\n \\n //初期化\\n RMQ(){n=-1;}\\n RMQ(int n_,int flag = 0){\\n this->flag = flag;\\n n=1;\\n while(n<n_)n*=2;\\n dat.resize(2*n-1,INF);\\n }\\n \\n //k番目の値をaに変更\\n void update(int k,int a){\\n assert(a >= 0);\\n if(flag) a *= -1;\\n k+=n-1;\\n assert(dat[k] >= a);\\n \\n dat[k]=a;\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n\\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\\n \\n //[a,b)の最小値を求める query(a,b,0,0,n)\\n int query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r == -1) r = n, assert(a < n && b <= n);\\n if(r<=a||b<=l)return INF;\\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\\n int vl=query(a,b,k*2+1,l,(l+r)/2);\\n int vr=query(a,b,k*2+2,(l+r)/2,r);\\n int res = min(vl,vr);\\n if(k == 0 && flag) res *= -1;\\n return res;\\n }\\n\\n};\\n\\n\\n//rが小さい順に処理する。\\nRMQ initTo(const vector<T> &A){\\n\\n auto getDisT=[&](const T &a,const T &b){\\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return abs(x1 - x2) + abs(y1 - y2);\\n };\\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\\n \\n int n = A.size();\\n RMQ res(n,1);\\n vector<int> Idx(n);\\n for(int i=0;i<n;i++) Idx[i] = i;\\n\\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\\n int r1 = get<2>(A[a]);\\n int r2 = get<2>(A[b]);\\n return r1 < r2;\\n });\\n \\n RMQ mem(n,1);\\n function<int(int,int)> search=[&](int pos,int start){\\n const int r = get<2>(A[start]);\\n if(getDis(start,pos) > r) return pos;\\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\\n int nx = mem.value(pos);\\n if(nx == -INF || nx == pos) nx = pos+1;\\n int to = search(nx,start);\\n mem.update(pos,to);\\n return to;\\n };\\n \\n for(int i=0;i<n;i++) {\\n int to=search(Idx[i],Idx[i]);\\n res.update(Idx[i],to);\\n mem.update(Idx[i],to);\\n }\\n return res;\\n}\\n\\nint dfs(int pos,RMQ &To){\\n int l = pos, r = To.value(pos);\\n int to = To.query(l,r+1);\\n if(to == pos) return pos;\\n int res = dfs(to,To);\\n To.update(pos,res);\\n return res;\\n}\\n\\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\\n int rpos = 2 * n - 1 - pos%n;\\n int lmax = dfs(rpos,rTo) - rpos;\\n int lto = dfs( To.query(max(0,pos - lmax),pos+1), To );\\n int rto = dfs(pos,To);\\n int to = max(lto,rto);\\n if(lto > rto) to = dfs2(lto,To,rTo,n);\\n To.update(pos,to);\\n return to;\\n}\\n\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<T> A(n),rA;\\n \\n for(int i=0;i<n;i++){\\n int x,y,r;\\n scanf(\\\"%d%d%d\\\",&x,&y,&r);\\n A[i] = T(x,y,r,i);\\n }\\n\\n sort(A.begin(),A.end(),[&](T &a,T &b){\\n typedef complex<double> P;\\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return arg(P(x1,y1)) < arg(P(x2,y2));\\n });\\n \\n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\\n rA = A; reverse(rA.begin(),rA.end());\\n\\n RMQ To = initTo(A);\\n RMQ rTo = initTo(rA);\\n \\n vector<int> ans(n);\\n int update = 1;\\n while(update){\\n update = 0;\\n for(int i=n;i<2*n;i++){\\n int ri = (2 * n - 1) - i%n;\\n int idx = get<3>(A[i]);\\n int to = dfs2(i,To,rTo,n);\\n int rto = dfs2(ri,rTo,To,n);\\n int num = to - i + 1;\\n int rnum = rto - ri + 1;\\n assert(A[i] == rA[ri]);\\n int score = min(n,num+rnum-1);\\n update |= ans[idx] < score;\\n ans[idx] = score;\\n }\\n } \\n for(int a:ans) printf(\\\"%d\\\\n\\\",n - a);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1980,\n \"memory_kb\": 67412,\n \"score_of_the_acc\": -0.951,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3038_2744349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)\\n#define pr2(a,b) pr1(a)<<\\\", \\\"<<pr1(b)\\n#define pr3(a,b,c) pr2(a,b)<<\\\", \\\"<<pr1(c)\\n#define pr4(a,b,c,d) pr3(a,b,c)<<\\\", \\\"<<pr1(d)\\n#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<\\\", \\\"<<pr1(e)\\n//#define int long long\\n#define double long double\\nusing namespace std;\\nconst int N = 100010;\\n//const int INF = 1LL<<55;\\nconst int INF = 1e9;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nostream& operator<<(ostream& o,P p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\nistream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}\\ntypedef tuple<int,int,int,int> T; //x,y,r,idx;\\nostream& operator<<(ostream& o,T &a){\\n return o <<\\\"( x=\\\"<<get<0>(a)<<\\\", y=\\\"<<get<1>(a)<<\\\", r=\\\"<<get<2>(a)<<\\\", idx=\\\"<<get<3>(a)<<\\\")\\\";\\n}\\n\\nclass RMQ{\\npublic:\\n int INF = 1e9;\\n int n;\\n vector<int> dat;\\n int flag; // Range Max Queryにしたいときはflag=1にする。\\n \\n //初期化\\n RMQ(){n=-1;}\\n RMQ(int n_,int flag = 0){\\n this->flag = flag;\\n n=1;\\n while(n<n_)n*=2;\\n dat.resize(2*n-1,INF);\\n }\\n \\n //k番目の値をaに変更\\n void update(int k,int a){\\n assert(a >= 0);\\n if(flag) a *= -1;\\n k+=n-1;\\n assert(dat[k] >= a);\\n \\n dat[k]=a;\\n while(k>0){\\n k=(k-1)/2;\\n dat[k]=min(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n\\n int value(int k){return (flag?-1:1) * dat[k+n-1];}\\n \\n //[a,b)の最小値を求める query(a,b,0,0,n)\\n int query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r == -1) r = n, assert(a < n && b <= n);\\n if(r<=a||b<=l)return INF;\\n if(a<=l&&r<=b)return k == 0 && flag? -dat[k]:dat[k];\\n int vl=query(a,b,k*2+1,l,(l+r)/2);\\n int vr=query(a,b,k*2+2,(l+r)/2,r);\\n int res = min(vl,vr);\\n if(k == 0 && flag) res *= -1;\\n return res;\\n }\\n\\n};\\n\\n\\n//rが小さい順に処理する。\\nRMQ initTo(const vector<T> &A){\\n\\n auto getDisT=[&](const T &a,const T &b){\\n int x1,y1; tie(x1,y1,ignore,ignore) = a;\\n int x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return abs(x1 - x2) + abs(y1 - y2);\\n };\\n auto getDis=[&](int i,int j){return getDisT(A[i],A[j]);};\\n \\n int n = A.size();\\n RMQ res(n,1);\\n vector<int> Idx(n);\\n for(int i=0;i<n;i++) Idx[i] = i;\\n\\n sort(Idx.begin(),Idx.end(),[&](int a,int b){\\n int r1 = get<2>(A[a]);\\n int r2 = get<2>(A[b]);\\n return r1 < r2;\\n });\\n \\n RMQ mem(n,1);\\n function<int(int,int)> search=[&](int pos,int start){\\n const int r = get<2>(A[start]);\\n if(pos - start > 200000) return pos;\\n if(getDis(start,pos) > r) return pos;\\n if(pos + 1 >=n || getDis(start,pos+1) > r) return pos;\\n int nx = mem.value(pos);\\n if(nx == -INF || nx == pos) nx = pos+1;\\n int to = search(nx,start);\\n mem.update(pos,to);\\n return to;\\n };\\n \\n for(int i=0;i<n;i++) {\\n int to=search(Idx[i],Idx[i]);\\n res.update(Idx[i],to);\\n mem.update(Idx[i],to);\\n }\\n return res;\\n}\\n\\nint dfs(int pos,RMQ &To){\\n int l = pos, r = To.value(pos);\\n int to = To.query(l,r+1);\\n if(to == pos) return pos;\\n int res = dfs(to,To);\\n To.update(pos,res);\\n return res;\\n}\\n\\nint dfs2(int pos,RMQ &To,RMQ &rTo,int n){\\n int rpos = 2 * n - 1 - pos%n;\\n int lmax = dfs(rpos,rTo) - rpos;\\n int lto = dfs( To.query(max(0,pos - lmax),pos+1), To );\\n int rto = dfs(pos,To);\\n int to = max(lto,rto);\\n if(lto > rto) to = dfs2(lto,To,rTo,n);\\n To.update(pos,to);\\n return to;\\n}\\n\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<T> A(n),rA;\\n \\n for(int i=0;i<n;i++){\\n int x,y,r;\\n scanf(\\\"%d%d%d\\\",&x,&y,&r);\\n A[i] = T(x,y,r,i);\\n }\\n\\n sort(A.begin(),A.end(),[&](T &a,T &b){\\n typedef complex<double> P;\\n double x1,y1; tie(x1,y1,ignore,ignore) = a;\\n double x2,y2; tie(x2,y2,ignore,ignore) = b;\\n return arg(P(x1,y1)) < arg(P(x2,y2));\\n });\\n \\n for(int i=0;i<2*n;i++) A.push_back(A[i%n]);\\n rA = A; reverse(rA.begin(),rA.end());\\n\\n RMQ To = initTo(A);\\n RMQ rTo = initTo(rA);\\n \\n vector<int> ans(n);\\n int update = 1;\\n while(update){\\n update = 0;\\n for(int i=n;i<2*n;i++){\\n int ri = (2 * n - 1) - i%n;\\n int idx = get<3>(A[i]);\\n int to = dfs2(i,To,rTo,n);\\n int rto = dfs2(ri,rTo,To,n);\\n int num = to - i + 1;\\n int rnum = rto - ri + 1;\\n assert(A[i] == rA[ri]);\\n int score = min(n,num+rnum-1);\\n update |= ans[idx] < score;\\n ans[idx] = score;\\n }\\n } \\n for(int a:ans) printf(\\\"%d\\\\n\\\",n - a);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2040,\n \"memory_kb\": 58180,\n \"score_of_the_acc\": -0.9378,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3038_2744341\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n\\nusing Pi = pair<int, int>;\\n\\nconst int inf = 1LL<<55;\\n\\nstruct SegmentTree {\\n vector<Pi> data;\\n int sz;\\n SegmentTree(int _sz) {\\n sz = 1; while(sz < _sz) sz <<= 1;\\n data.resize(2*sz-1);\\n }\\n void set(int k, Pi p) {\\n k += sz-1;\\n data[k] = p;\\n while(k > 0) {\\n k = (k-1)/2;\\n data[k] = Pi(min(data[2*k+1].first, data[2*k+2].first),\\n\\t\\t max(data[2*k+1].second, data[2*k+2].second));\\n }\\n }\\n Pi query(int a, int b, int k, int l, int r) {\\n if(r <= a || b <= l) return Pi(inf, -inf);\\n if(a <= l && r <= b) return data[k];\\n Pi vl = query(a, b, 2*k+1, l, (l+r)/2);\\n Pi vr = query(a, b, 2*k+2, (l+r)/2, r);\\n return Pi(min(vl.first, vr.first),\\n\\t max(vl.second, vr.second));\\n }\\n Pi query(int a, int b) {\\n return query(a, b, 0, 0, sz);\\n }\\n};\\n\\nconst int MAX_N = 200020;\\n\\nint n;\\nint x[MAX_N], y[MAX_N], r[MAX_N];\\n\\nint dist(int i, int j) {\\n return llabs(x[i]-x[j])+llabs(y[i]-y[j]);\\n}\\n\\nsigned main() {\\n cin >> n;\\n for(int i = 0; i < n; ++i) {\\n cin >> x[i] >> y[i] >> r[i];\\n }\\n vector<pair<double, int> > vec;\\n const double PI = acos(-1);\\n for(int i = 0; i < n; ++i) {\\n double arg = atan2(y[i], x[i]);\\n vec.emplace_back(arg, i);\\n vec.emplace_back(arg+2*PI, i);\\n vec.emplace_back(arg+4*PI, i);\\n }\\n sort(begin(vec), end(vec));\\n vector<int> L(n), R(n);\\n for(int i = n; i < 2*n; ++i) {\\n double arg = vec[i].first;\\n int idx = vec[i].second;\\n //cout<<idx<<\\\" \\\"<<arg<<endl;\\n {\\n int fail = lower_bound(begin(vec), end(vec),\\n\\t\\t\\t pair<double, int>(arg-PI, -1))-begin(vec)-1;\\n int pass = i;\\n //cout<<pass<<\\\" \\\"<<fail<<endl;\\n while(fail+1 < pass) {\\n\\tint test = (fail+pass)/2;\\n\\tif(dist(idx, vec[test].second) <= r[idx]) pass = test;\\n\\telse fail = test;\\n }\\n L[i-n] = pass;\\n }\\n {\\n int pass = i;\\n int fail = lower_bound(begin(vec), end(vec),\\n\\t\\t\\t pair<double, int>(arg+PI, -1))-begin(vec);\\n //cout<<pass<<\\\" \\\"<<fail<<endl;\\n while(pass+1 < fail) {\\n\\tint test = (pass+fail)/2;\\n\\tif(dist(idx, vec[test].second) <= r[idx]) pass = test;\\n\\telse fail = test;\\n }\\n R[i-n] = fail;\\n }\\n //cout<<idx<<\\\" \\\"<<L[i-n]<<\\\" \\\"<<R[i-n]<<endl;\\n }\\n SegmentTree seg(3*n);\\n bool update = true;\\n while(update) {\\n update = false;\\n for(int i = 0; i < 3*n; ++i) {\\n int l = L[i%n], r = R[i%n];\\n if(i < n) l -= n, r -= n;\\n else if(i >= 2*n) l += n, r += n;\\n seg.set(i, Pi(max(0ll, l), min(3*n, r)));\\n }\\n for(int i = n; i < 2*n; ++i) {\\n Pi tmp = seg.query(L[i-n], R[i-n]);\\n seg.set(i, Pi(tmp.first, tmp.second));\\n if(L[i-n] != tmp.first || R[i-n] != tmp.second) update = true;\\n L[i-n] = tmp.first;\\n R[i-n] = tmp.second;\\n }\\n }\\n vector<int> ans(n);\\n for(int i = n; i < 2*n; ++i) {\\n int idx = vec[i].second;\\n ans[idx] = max(0ll, n-(R[i-n]-L[i-n]));\\n }\\n for(int i = 0; i < n; ++i) {\\n cout << ans[i] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1080,\n \"memory_kb\": 54560,\n \"score_of_the_acc\": -0.3575,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1885,"cells":{"group_id":{"kind":"string","value":"aoj_3042_cpp"},"problem_description":{"kind":"string","value":"Problem D: Gridgedge\nProblem\n左上が$(0, 0)$、 右下が$(R-1, C-1)$である$R \\times C$マスのグリッドがある。あるマス($e$, $f$)にいるとき、そこから$(e+1, f)$, $(e-1, f)$, $(e, f+1)$, $(e, f-1)$, $(e, 0)$, $(e, C-1)$, $(0, f)$, $(R-1, f)$にはコスト$1$で移動できる。ただしグリッドの外に出ることはできない。マス$(a_i, a_j)$から$(b_i, b_j)$へ移動するとき、最短経路のコストと、最短経路の組み合わせの総数を$10^9 + 7$で割った余りを計算せよ。\nただし、経路の組み合わせは移動の方法によって区別するものとする。たとえば、現在地が$(100, 1)$ のとき、 $(100, 0)$に最短コストで行くには上記$(e, f-1)$か$(e, 0)$で行くことができるので、$2$通りと数える。\nInput\n入力は以下の形式で与えられる。\n$R$ $C$ $a_i$ $a_j$ $b_i$ $b_j$\nConstraints\n入力は以下の条件を満たす。\n$1 \\le R, C \\le 500$\n$0 \\le a_i, b_i \\le R - 1$\n$0 \\le a_j, b_j \\le C - 1$\n与えられる入力は全て整数である。\nOutput\nマス$(a_i, a_j)$から$(b_i, b_j)$へ移動するとき、最短経路のコストと、最短経路の組み合わせの総数を$10^9+7$で割った余りを空白区切りで$1$行に出力せよ。\nSample Input 1\n2 2 0 0 1 1\nSample Output 1\n2 8\nSample Input 2\n1 1 0 0 0 0\nSample Output 2\n0 1\nSample Input 3\n1 10 0 0 0 9\nSample Output 3\n1 1\nSample Input 4\n5 5 0 0 4 4\nSample Output 4\n2 2\nSample Input 5\n421 435 196 169 388 9\nSample Output 5\n43 917334776"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3042_9616360","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 501;\nconst int P = N * N;\nconst int INF = 1e9 + 128;\nconst int MOD = 1e9 + 7;\n\nint d[P], cnt[P];\nvector<int> g[P];\n\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1};\n\nint r, c;\n\nint get(int x, int y) {\n return x * c + y;\n}\n\nbool ok(int x, int y) {\n return 0 <= x && x < r && 0 <= y && y < c;\n}\n\nint main() {\n cin >> r >> c;\n\n for (int i = 0; i < r; i++)\n for (int j = 0; j < c; j++) {\n int cnode = get(i, j);\n d[cnode] = INF;\n for (int x = 0; x < 4; x++) {\n int ni = i + dx[x], nj = j + dy[x];\n if (ok(ni, nj))\n g[cnode].push_back(get(ni, nj));\n }\n for (int x : {0, r - 1})\n g[cnode].push_back(get(x, j));\n for (int y : {0, c - 1})\n g[cnode].push_back(get(i, y));\n }\n\n int a, b;\n cin >> a >> b;\n int snode = get(a, b);\n\n cin >> a >> b;\n int dnode = get(a, b);\n\n d[snode] = 0;\n cnt[snode] = 1;\n\n queue <int> q;\n q.push(snode);\n\n while (!q.empty()) {\n int node = q.front(); q.pop();\n\n for (int i = 0; i < (int)g[node].size(); ) {\n int j = i;\n while (j < (int)g[node].size() && g[node][i] == g[node][j])\n ++j;\n int to = g[node][i];\n int cc = j - i;\n if (d[to] > d[node] + 1)\n d[to] = d[node] + 1, cnt[to] = (cc * cnt[node]) % MOD, q.push(to);\n else if (d[to] == d[node] + 1)\n cnt[to] = (cnt[to] + cc * cnt[node]) % MOD;\n i = j;\n }\n }\n\n cout << d[dnode] << ' ' << cnt[dnode] << '\\n';\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":19344,"score_of_the_acc":-0.0715,"final_rank":12},{"submission_id":"aoj_3042_6060184","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string.h>\n#include <stdio.h>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <vector>\n#include <set>\nusing namespace std;\ntypedef long long ll;\nint mov[4][2]={{1,0},{0,1},{0,-1},{-1,0}};\nint dis[505][505];\nll ans[505][505];\nint vis[505][505];\nconst int inf=1000000007;\nint main()\n{\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n int r,c,a,b,xxx,yyy;\n cin>>r>>c>>a>>b>>xxx>>yyy;\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++)\n dis[i][j]=1000;\n }\n dis[a][b]=0;\n queue<pair<int,int> > q;\n q.push(make_pair(a,b));\n while(!q.empty()){\n int x=q.front().first,y=q.front().second;\n q.pop();\n for(int i=0;i<4;i++){\n int xx=x+mov[i][0],yy=y+mov[i][1];\n if(xx>=0&&yy>=0&&xx<r&&yy<c){\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n }\n }\n int xx=x,yy=y;\n xx=0;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n xx=r-1;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n xx=x,yy=0;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n yy=c-1;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n }\n cout<<dis[xxx][yyy]<<\" \";\n vis[a][b]=1;\n ans[a][b]=1;\n while(!q.empty()) q.pop();\n q.push(make_pair(a,b));\n while(!q.empty()){\n int x=q.front().first,y=q.front().second;\n q.pop();\n int xx,yy;\n for(int i=0;i<4;i++){\n xx=x+mov[i][0],yy=y+mov[i][1];\n if(xx>=0&&yy>=0&&xx<r&&y<c){\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n }\n }\n xx=0,yy=y;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n xx=r-1;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n xx=x,yy=0;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n yy=c-1;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n }\n cout<<ans[xxx][yyy]<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6948,"score_of_the_acc":-0.0039,"final_rank":3},{"submission_id":"aoj_3042_6060175","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string.h>\n#include <stdio.h>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <vector>\n#include <set>\nusing namespace std;\ntypedef long long ll;\nint mov[4][2]={{1,0},{0,1},{0,-1},{-1,0}};\nint dis[505][505];\nll ans[505][505];\nint vis[505][505];\nint main()\n{\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n int r,c,a,b,xxx,yyy;\n cin>>r>>c>>a>>b>>xxx>>yyy;\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++)\n dis[i][j]=1000;\n }\n dis[a][b]=0;\n queue<pair<int,int> > q;\n q.push(make_pair(a,b));\n while(!q.empty()){\n int x=q.front().first,y=q.front().second;\n q.pop();\n for(int i=0;i<4;i++){\n int xx=x+mov[i][0],yy=y+mov[i][1];\n if(xx>=0&&yy>=0&&xx<r&&yy<c){\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n }\n }\n int xx=x,yy=y;\n xx=0;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n xx=r-1;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n xx=x,yy=0;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n yy=c-1;\n if(dis[xx][yy]>dis[x][y]+1){\n dis[xx][yy]=dis[x][y]+1;\n q.push(make_pair(xx,yy));\n }\n }\n cout<<dis[xxx][yyy]<<\" \";\n vis[a][b]=1;\n ans[a][b]=1;\n while(!q.empty()) q.pop();\n q.push(make_pair(a,b));\n while(!q.empty()){\n int x=q.front().first,y=q.front().second;\n q.pop();\n int xx,yy;\n for(int i=0;i<4;i++){\n xx=x+mov[i][0],yy=y+mov[i][1];\n if(xx>=0&&yy>=0&&xx<r&&y<c){\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]+=ans[x][y];\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n }\n }\n xx=0,yy=y;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]+=ans[x][y];\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n xx=r-1;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]+=ans[x][y];\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n xx=x,yy=0;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]+=ans[x][y];\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n yy=c-1;\n if(dis[xx][yy]>dis[x][y]){\n ans[xx][yy]+=ans[x][y];\n }\n if(!vis[xx][yy]){\n vis[xx][yy]=1;\n q.push(make_pair(xx,yy));\n }\n }\n cout<<ans[xxx][yyy]%1000000007<<endl;\n return 0;\n}","accuracy":0.2982456140350877,"time_ms":10,"memory_kb":6904,"score_of_the_acc":-0.0038,"final_rank":20},{"submission_id":"aoj_3042_4496493","code_snippet":"#include <bits/stdc++.h>\n#include <algorithm>\n#include <cmath>\n#include <set>\n#include <cstdio>\n#include <vector>\n#include <iostream>\n#include <utility>\n#include <queue>\n#include <map>\n#include <complex>\n#define fir first\n#define sec second\n#define sz(s) (s).size()\n#define pb push_back\n#define get(n) scanf(\"%d\",&n);\n#define gets(s) string s;cin >> (s);\n#define prfi(n) printf(\"%d\", &n);\n#define prfd(n) printf(\"%lf\", &n);\n#define All(s) (s).begin(), (s).end()\n#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)\n#define For(i,j,k) for(int (i)=(j);(i)<(k);(i)++)\n#define drep(i,j) for(int (i)=(j);(i)>=0;(i)--)\n#define Ford(i,j,k) for(int (i)=(j);i>=(k);i--)\n#define fore(c,v) for(auto (c): (v))\n#define lp for(int __=0;__<n;i++)\n#define mem(a,b) memset(a,b,sizeof(a));\n#define dump(x) std::cout << #x << \" = \" << (x) << std::endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\nusing ull = unsigned long long int;\nusing ll = long long;\nusing ld = long double;\nusing pii = std::pair<int,int>;\nusing pll = std::pair<ll, ll>;\nusing vi = std::vector<int> ;\nusing vvi = std::vector<vi> ;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vd = std::vector<double> ;\nusing vvd = std::vector<vd> ;\nusing qi = std::queue<int> ;\nusing vpii = std::vector<std::pair<int, int> >;\nusing vpll = std::vector<pll>;\nusing namespace std;\n\nconst int Mod = (1e9) + 7;\nconst int INF = 1e9 + 19;\nconst ll INFL = 1e18 + 19;\nconst int dx[] = {-1, 0, 0, 1};\nconst int dy[] = {0, -1, 1, 0};\nconst int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\nconst int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};\nconst double EPS = 1e-10;\n//_____________________________________Templates_________________________________________//\n\ntemplate<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}\ntemplate<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}\ntemplate<class T> inline void pri(T a){cout << a << endl;}\ntemplate<class Z> using vec = vector<Z>;\ntemplate<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n//mainly use for dynamic prog\ntemplate<class T1, class T2>\nvoid update(T1 &a, T2 b){\n a += b;\n if(a > Mod) a %= Mod;\n}\n\ninline void IN(void){\n return;\n}\n\ntemplate <typename First, typename... Rest>\nvoid IN(First& first, Rest&... rest){\n cin >> first;\n IN(rest...);\n return;\n}\n\ninline void OUT(void){\n cout << \"\\n\";\n return;\n}\n\ntemplate <typename First, typename... Rest>\nvoid OUT(First first, Rest... rest){\n cout << first << \" \";\n OUT(rest...);\n return;\n}\n\nbool pairsort(pll pl, pll pr){\n if(pl.first == pr.first)return pl.second > pr.second;\n return pl.first < pr.first;\n}\n\nint cntbit(ll a,int n,int j){int res = 0;For(i,j,n){if(a>>i & 1){res++;}}return res;}\nvector<int> make_bit(int a){vector<int> res; for(int i=31;i>=0;i--)if(a&(1<<i))res.pb(i);return res;}\nbool stdbit(int a, int b){return a&(1 << b); }\nint GCD(int a, int b){if(b > a)return GCD(b,a);if(a%b == 0)return b;else return GCD(b, a%b);}\nint LCM(int a, int b){return a*b/GCD(a,b);}\nint roundup(int a, int b){if(a % b == 0)return a/b;else return (a+b)/b;}\nint rounddown(int a, int b){if(a%b == 0)return a/b;else {return (a-b)/b;}}\nll pow(ll a, ll n){ll res = 1;while(n > 0){if(n&1)res *= a; a *= a; n = n >> 1;}return res;}\nll GetDiviserCount(ll N)//約数の個数\n{\n ll res = 1;\n For(i,2,sqrt(N)+1)\n {\n ll cnt = 0;\n while(N%i == 0)\n {\n cnt++;\n N /= i;\n }\n res *= (cnt + 1);\n if(N == 1)break;\n }\n if(N != 1)res *= 2;\n return res;\n}\nvll GetDivisor(ll N)//約数列挙\n{\n vll res;\n for(ll i = 1;i*i <= N;i++)\n {\n if(N%i == 0)\n {\n res.pb(i);\n if(i*i != N)res.pb(N/i);\n }\n }\n sort(All(res));\n return res;\n}\n\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%Mod+Mod)%Mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= Mod) x -= Mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += Mod-a.x) >= Mod) x -= Mod;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= Mod;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n \n // for prime mod\n mint inv() const {\n return pow(Mod-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n friend ostream& operator<<(ostream& os, const mint& a);\n};\nostream& operator<<(ostream& os, const mint& a)\n{\n os << a.x;\n return os;\n}\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n assert(n < Mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n};\n \ntemplate<class Z>\nstruct MyMatrix\n{\n using mat = MyMatrix<Z>;\n vector<vector<Z>> m_dat;\n int m_h;\n int m_w;\n MyMatrix(int h, int w) : m_h(h), m_w(w) ,m_dat(h,vector<Z>(w)) {}\n vector<Z> &operator[] (int idx)\n {\n return m_dat[idx];\n }\n mat Multiple(mat &a)\n {\n mat C(m_h, a.m_w);\n for(int i=0;i<m_h;i++)\n {\n for(int j=0;j<a.m_w;j++)\n {\n for(int k=0;k<m_w;k++)\n {\n C[i][j] += m_dat[i][k] * a[k][j];\n }\n }\n }\n return C;\n }\n mat Pow(ll x)\n {\n mat B(m_h,m_w);\n for(int i=0;i<m_h;i++)\n {\n B[i][i] = 1;\n }\n mat A = *this;\n while(x > 0)\n {\n if(x&1)B = B.Multiple(A);\n A = A.Multiple(A);\n x = x >> 1;\n }\n return B;\n }\n //friend ostream& operator<<(ostream &os, const mat &A);\n};\n/*\ntemplate<class Z>\nostream& operator<<(ostream &os, Matrix<Z>& A)\n{\n for(int i=0;i<A.m_h;i++)\n {\n for(int j=0;j<A.m_w;j++)\n {\n os << A[i][j] << \" \";\n }\n os << endl;\n }\n return os;\n}\n*/\ntemplate<class T>\nusing mat = MyMatrix<T>;\n//_____________________ following sorce code_________________________//\nconst int max_n = 3 * (1e5) + 1;\nconst int max_m = 83 * (1e5) + 1;\n\nint n,m,k;\nll N;\nint h,w;\nstring S;\n//int a,b,c;\nvi v;\nint ans;\ndouble x,y,z;\nint a[2],b[2];\nvector<int> G[1010101];\nstruct Data\n{ \n int cost;\n int x,y;\n Data(int cost,int x,int y) : cost(cost),x(x),y(y) {}\n bool operator>(const Data &a) const\n {\n return cost > a.cost;\n }\n};\nmint times[1000][1000];\nint cost[1000][10000];\nint visit[1010][1010];\nvoid Dijkstra()\n{\n min_priority_queue<Data> qu;\n memset(times,0,sizeof(times));\n memset(cost,INF,sizeof(cost));\n memset(visit,false,sizeof(visit));\n qu.push(Data(0,a[0],b[0]));\n times[a[0]][b[0]] = 1;\n cost[a[0]][b[0]] = 0;\n while(qu.size())\n {\n auto e = qu.top(); qu.pop();\n if(visit[e.x][e.y])continue;\n visit[e.x][e.y] = true;\n rep(i,4)\n {\n int nx = e.x + dx[i];\n int ny = e.y + dy[i];\n if(nx >= 0 and nx < h and ny >= 0 and ny < w)\n {\n if(cost[nx][ny] == e.cost + 1)\n {\n times[nx][ny] += times[e.x][e.y];\n qu.push(Data(e.cost+1,nx,ny));\n }\n if(cost[nx][ny] > e.cost + 1)\n {\n times[nx][ny] = times[e.x][e.y];\n cost[nx][ny] = e.cost + 1;\n qu.push(Data(e.cost+1,nx,ny));\n }\n }\n }\n\n if(e.x != 0)\n {\n if(cost[0][e.y] == e.cost + 1)\n {\n times[0][e.y] += times[e.x][e.y];\n qu.push(Data(e.cost+1,0,e.y));\n }\n else if(cost[0][e.y] > e.cost + 1)\n {\n times[0][e.y] = times[e.x][e.y];\n cost[0][e.y] = e.cost + 1;\n qu.push(Data(e.cost+1,0,e.y));\n }\n }\n if(e.x != h-1)\n {\n if(cost[h-1][e.y] == e.cost + 1)\n {\n times[h-1][e.y] += times[e.x][e.y];\n qu.push(Data(e.cost+1,h-1,e.y));\n }\n else if(cost[h-1][e.y] > e.cost + 1)\n {\n times[h-1][e.y] = times[e.x][e.y];\n cost[h-1][e.y] = e.cost + 1;\n qu.push(Data(e.cost+1,h-1,e.y));\n }\n }\n if(e.y != 0)\n {\n if(cost[e.x][0] == e.cost + 1)\n {\n times[e.x][0] += times[e.x][e.y];\n qu.push(Data(e.cost+1,e.x,0));\n }\n else if(cost[e.x][0] > e.cost + 1)\n {\n times[e.x][0] = times[e.x][e.y];\n cost[e.x][0] = e.cost + 1;\n qu.push(Data(e.cost+1,e.x,0));\n }\n }\n if(e.y != w-1)\n {\n if(cost[e.x][w-1] == e.cost + 1)\n {\n times[e.x][w-1] += times[e.x][e.y];\n qu.push(Data(e.cost+1,e.x,w-1));\n }\n else if(cost[e.x][w-1] > e.cost + 1)\n {\n times[e.x][w-1] = times[e.x][e.y];\n cost[e.x][w-1] = e.cost + 1;\n qu.push(Data(e.cost+1,e.x,w-1));\n }\n }\n }\n}\n\nsigned main (int argc, char* argv[]) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n IN(h,w,a[0],b[0],a[1],b[1]);\n Dijkstra();\n cout << cost[a[1]][b[1]] << \" \" << times[a[1]][b[1]] << endl;\n //dump(times[1][1]);\n //for(auto c : ans){cout << c << endl;}\n //cout << fixed << setprecision(15) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":77820,"score_of_the_acc":-0.2818,"final_rank":15},{"submission_id":"aoj_3042_4321714","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\nconst int MOD = (int)1e9 + 7;\n\ntemplate<class T> using Rig = pair<T, long long>;\ntemplate<class T> Rig<T> add(const Rig<T> &a, const Rig<T> &b) {\n if (a.first != b.first) return min(a, b);\n return Rig<T>(a.first, (a.second + b.second) % MOD);\n}\ntemplate<class T> Rig<T> mul(const Rig<T> &a, const Rig<T> &b) {\n return Rig<T>(a.first + b.first, a.second * b.second % MOD);\n}\n\ntemplate<class T, class S> ostream& operator<<(ostream& os, const pair<T, S>& p) { return os << p.first << \" \" << p.second; }\nconst int INF = (int)1e9 + 7;\nusing pii = pair<int, int>;\nint main() {\n int h, w; cin >> h >> w;\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\n vector<vector<Rig<int>>> dp(h, vector<Rig<int>>(w, Rig<int>(INF, 0)));\n vector<vector<bool>> done(h, vector<bool>(w));\n queue<pair<Rig<int>, pii>> que;\n dp[si][sj] = Rig<int>(0, 1);\n que.emplace(dp[si][sj], pii(si, sj));\n while (!que.empty()) {\n pii p = que.front().second; que.pop();\n int i = p.first, j = p.second;\n if (done[i][j]) continue;\n done[i][j] = true;\n int dij[] = {0, 1, 0, -1, 0};\n for (int k = 0; k < 4; k++) {\n int ni = i + dij[k], nj = j + dij[k + 1];\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\n que.emplace(dp[ni][nj], pii(ni, nj));\n }\n int nis[] = {i, i, 0, h - 1}, njs[] = {0, w - 1, j, j};\n for (int k = 0; k < 4; k++) {\n int ni = nis[k], nj = njs[k];\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\n que.emplace(dp[ni][nj], pii(ni, nj));\n }\n }\n cout << dp[ti][tj] << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6152,"score_of_the_acc":-0.0421,"final_rank":8},{"submission_id":"aoj_3042_4321646","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\nconst int MOD = (int)1e9 + 7;\n\ntemplate<class T> using Rig = pair<T, long long>;\ntemplate<class T> Rig<T> add(const Rig<T> &a, const Rig<T> &b) {\n if (a.first != b.first) return min(a, b);\n return Rig<T>(a.first, (a.second + b.second) % MOD);\n}\ntemplate<class T> Rig<T> mul(const Rig<T> &a, const Rig<T> &b) {\n return Rig<T>(a.first + b.first, a.second * b.second % MOD);\n}\n\nusing pii = pair<int, int>;\nconst int INF = (int)1e9 + 7;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T, class S> ostream& operator<<(ostream& os, const pair<T, S>& p) { return os << p.first << \" \" << p.second; }\nint main() {\n int h, w; cin >> h >> w;\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\n vector<vector<Rig<int>>> dp(h, vector<Rig<int>>(w, Rig<int>(INF, 0)));\n vector<vector<bool>> done(h, vector<bool>(w));\n min_heap<pair<Rig<int>, pii>> pq;\n pq.emplace(dp[si][sj] = Rig<int>(0, 1), pii(si, sj));\n while (!pq.empty()) {\n pii p = pq.top().second; pq.pop();\n int i = p.first, j = p.second;\n if (done[i][j]) continue;\n done[i][j] = true;\n int dij[] = {0, 1, 0, -1, 0};\n for (int k = 0; k < 4; k++) {\n int ni = i + dij[k], nj = j + dij[k + 1];\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\n pq.emplace(dp[ni][nj], pii(ni, nj));\n }\n int nis[] = {i, i, 0, h - 1}, njs[] = {0, w - 1, j, j};\n for (int k = 0; k < 4; k++) {\n int ni = nis[k], nj = njs[k];\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\n pq.emplace(dp[ni][nj], pii(ni, nj));\n }\n }\n cout << dp[ti][tj] << endl;\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":6096,"score_of_the_acc":-0.562,"final_rank":18},{"submission_id":"aoj_3042_4321547","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nusing pii = pair<int, int>;\nconst int INF = (int)1e9 + 7;\nconst int MOD = (int)1e9 + 7;\ntemplate<class T> void add(T &a, T b) { (a += (b % MOD + MOD) % MOD) %= MOD; }\ntemplate<class T> inline bool chmin(T &a, T b) { return a > b ? (a = b, 1) : 0; }\n\nint main() {\n int h, w; cin >> h >> w;\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\n vector<vector<int>> dist(h, vector<int>(w, INF));\n vector<vector<int>> dp(h + 1, vector<int>(w + 1));\n vector<pair<pii, pii>> cur;\n cur.emplace_back(pii(si, sj), pii(h, w)), dp[h][w] = 1;\n for (int k = 0; !cur.empty(); k++) {\n vector<pair<pii, pii>> nxt;\n for (auto &p: cur) {\n int i = p.first.first, j = p.first.second;\n int prv = dp[p.second.first][p.second.second];\n if (chmin(dist[i][j], k)) {\n dp[i][j] = prv;\n int dij[] = {0, 1, 0, -1, 0};\n for (int d = 0; d < 4; d++) {\n int ni = i + dij[d], nj = j + dij[d + 1];\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\n nxt.emplace_back(pii(ni, nj), pii(i, j));\n } {\n nxt.emplace_back(pii(i, 0), pii(i, j));\n nxt.emplace_back(pii(i, w - 1), pii(i, j));\n nxt.emplace_back(pii(0, j), pii(i, j));\n nxt.emplace_back(pii(h - 1, j), pii(i, j));\n }\n } else if (dist[i][j] == k) {\n add(dp[i][j], prv);\n }\n }\n cur = nxt;\n }\n cout << dist[ti][tj] << \" \" << dp[ti][tj] << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5212,"score_of_the_acc":-0.04,"final_rank":5},{"submission_id":"aoj_3042_4239165","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define INF 329496729612\n#define int long long\n#define MOD (int)(1e9+7)\n#define MAX 500\ntypedef pair<int,int> P;\n\nint r, c, ax, ay, by, bx, ans, temp;\nint grid[MAX+10][MAX+10],countg[MAX+10][MAX+10], flags[MAX+10][MAX+10], dxy[4] = {1, -1, 0, 0};\n\nvoid huga(){\n queue<P> Q;\n Q.push(P(ax,ay));\n\n for(int i = 0; i <= MAX; i++)\n for(int j = 0; j <= MAX; j++)\n grid[i][j] = INF;\n\n grid[ay][ax] = 0;\n countg[ay][ax]=1;\n\n while(!Q.empty()){\n P p = Q.front();Q.pop();\n int x = p.first, y=p.second,ny, nx;\n // int rc[2][4] = {{x,x,0,r-1},{0,c-1,y,y}};\n int rc[2][4] = {{x,x,0,c-1},{0,r-1,y,y}};\n for(int i = 0; i < 8; i++){\n if(i < 4) nx = x + dxy[i], ny = y + dxy[3-i];\n else ny = rc[1][i-4], nx = rc[0][i-4];\n\n if(0 <= nx && nx < c && 0 <= ny && ny < r){\n\tif(grid[y][x]+1 < grid[ny][nx]){\n\t grid[ny][nx] = grid[y][x]+1;\n\t if(nx != bx|| ny != by)Q.push(P(nx,ny));\n\t}\n }\n }\n }\n\n Q.push(P(ax,ay));\n while(!Q.empty()){\n P p = Q.front();Q.pop();\n int x = p.first, y=p.second,ny, nx;\n // int rc[2][4] = {{x,x,0,r-1},{0,c-1,y,y}};\n int rc[2][4] = {{x,x,0,c-1},{0,r-1,y,y}};\n if(flags[y][x])continue;\n else flags[y][x]=1;\n for(int i = 0; i < 8; i++){\n if(i < 4) nx = x + dxy[i], ny = y + dxy[3-i];\n else ny = rc[1][i-4], nx = rc[0][i-4];\n\n if(0 <= nx && nx < c && 0 <= ny && ny < r){\n\tif(grid[y][x]+1 == grid[ny][nx]){\n\t countg[ny][nx] += countg[y][x];\n\t if(nx != bx|| ny != by)Q.push(P(nx,ny));\n\t countg[ny][nx] %= MOD;\n\t}\n }\n }\n }\n}\n\nsigned main(){\n cin>>r>>c>>ay>>ax>>by>>bx;\n\n huga();\n\n cout<<grid[by][bx]<<\" \"<<countg[by][bx]%MOD<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":8948,"score_of_the_acc":-0.0083,"final_rank":4},{"submission_id":"aoj_3042_3708175","code_snippet":"#include <iostream>\n#include <cstring>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <set>\n#include <utility>\n#include <cstdlib>\n#include <queue>\n#include <stack>\n#include <iomanip>\n#include <cstdio>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n\n#define _upgrade ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)\n#define all(x) (x).begin(), (x).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define pb push_back\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n\n//ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}\n//ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}\n\nint dx[4] = {1,0,-1,0};\nint dy[4] = {0,1,0,-1};\n\nconst ll INF = 1e9;\nconst long double PI = 3.14159265358979323846;\n\n\n// ****************************************CODE***************************************//\n\ntemplate<int MOD> struct ModInt {\n static const int Mod = MOD; unsigned x; ModInt() : x(0) { }\n ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n int get() const { return (int)x; }\n ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\n ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\n ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }\n ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }\n ModInt operator+(ModInt that) const { return ModInt(*this) += that; }\n ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }\n ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }\n ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }\n ModInt inverse() const {\n long long a = x, b = MOD, u = 1, v = 0;\n while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }\n return ModInt(u);\n }\n bool operator==(ModInt that) const { return x == that.x; }\n bool operator!=(ModInt that) const { return x != that.x; }\n ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }\n};\ntemplate<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };\ntemplate<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {\n ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;\n}\ntypedef ModInt<1000000007> mint;\n\n\n\nint W, H, ax, ay, bx, by;\nint dst[505][505], vis[505][505];\nmint cnt[505][505];\n\nint main(){\n cin >> W >> H >> ax >> ay >> bx >> by;\n\n rep(y,H) rep(x,W) dst[y][x] = INF;\n min_priority_queue<pair<int, int>> que;\n\n dst[ay][ax] = 0;\n cnt[ay][ax] = 1;\n que.push({0, ay * 1010 + ax});\n while(!que.empty()){\n auto q = que.top(); que.pop();\n\n //この場合分けのやり方すごい画期的過ぎんか\n //何それすごいってやつ\n //んーコストとグリッド状の座標を保存する時にこれは便利になるのかなーと思う。すごいなー。\n //今回はグラフを作るという作業はしないみたいやね。というよりはもともと全てのグラフはグリッドとして用意されていてあとはコストが1ってある程度決まってるからbfs的な感じでも解けるんだよね。\n //\n int x = q.second % 1010;\n int y = q.second / 1010;\n int c = q.first;\n\n if(vis[y][x]) continue;\n vis[y][x] = 1;\n\n if(y == by and x == bx){\n cout << c << \" \" << cnt[y][x] << endl;\n return 0;\n }\n\n //次に行くパターンを全部ここに入れるのかーなるほど\n vector<pair<int, int>> nxt;\n rep(i,4) nxt.push_back({x + dx[i], y + dy[i]});\n nxt.push_back({0,y});\n nxt.push_back({W-1, y});\n nxt.push_back({x, 0});\n nxt.push_back({x, H-1});\n\n for(auto p : nxt){\n int xx, yy;\n tie(xx, yy) = p;\n\n if(xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\n\n //最短経路数問題の感じはこんな感じだねー覚えとかないとねー\n if(c + 1 < dst[yy][xx]){\n dst[yy][xx] = c + 1;\n cnt[yy][xx] = cnt[y][x];\n que.push({c + 1, yy * 1010 + xx});\n }\n else if(c+1 == dst[yy][xx]) cnt[yy][xx] += cnt[y][x];\n }\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":5308,"score_of_the_acc":-0.0002,"final_rank":1},{"submission_id":"aoj_3042_3385923","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double Double;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\n\nnamespace sub {\n template<typename T>\n constexpr typename std::enable_if<std::is_integral<T>::value, T>::type\n inf_sub() {\n return std::numeric_limits<T>::max() / 2 - 1000;\n }\n\n template<typename T>\n constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type\n inf_sub() {\n return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));\n }\n} // namespace sub\n\ntemplate<typename T>\nconstexpr T inf() {\n static_assert(std::is_arithmetic<T>::value, \"T must be arithmetic value\");\n return sub::inf_sub<T>();\n}\n\ntemplate<typename T>\nconstexpr T zero() {\n static_assert(std::is_arithmetic<T>::value, \"T must be arithmetic value\");\n return T(0);\n}\n\nconst long double pi = acos(-1.0);\n\ntemplate<class edge_t>\nclass graph_t {\n std::vector<std::vector<edge_t>> g;\n\npublic:\n using reference = std::vector<edge_t> &;\n using const_reference = const std::vector<edge_t> &;\n using iterator = typename std::vector<edge_t>::iterator;\n\n graph_t() : g(0) { ; }\n\n graph_t(int n) : g(n) { ; }\n\n int size() const { return g.size(); }\n\n void push_back(const std::vector<edge_t> &es) { g.push_back(es); }\n\n reference operator[](int x) { return g[x]; }\n\n const_reference operator[](int x) const { return g[x]; }\n\n iterator &begin() { return begin(g); }\n\n iterator &end() { return end(g); }\n};\n\ntemplate<typename edge_t, typename cost_type = typename edge_t::cost_type>\nstd::vector<cost_type> dijkstra(const graph_t<edge_t> &g, int s) {\n std::vector<cost_type> d(g.size(), inf<cost_type>());\n d[s] = zero<cost_type>();\n using P = std::pair<cost_type, int>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\n que.push(P(zero<cost_type>(), s));\n while (!que.empty()) {\n cost_type dist = que.top().first;\n int v = que.top().second;\n que.pop();\n if (d[v] < dist) continue;\n for (const auto &e : g[v]) {\n if (d[e.to] <= d[v] + e.cost) continue;\n d[e.to] = d[v] + e.cost;\n que.push(P(d[e.to], e.to));\n }\n }\n return d;\n}\n\n\ntemplate<typename Cost>\nclass WeightedEdge {\npublic:\n using cost_type = Cost;\n int to;\n cost_type cost;\n\n WeightedEdge(int, int t, cost_type c) : to(t), cost(c) { ; }\n};\n\ntemplate<typename Cost> using WeightedGraph = graph_t<WeightedEdge<Cost>>;\n\ntemplate<typename Cost>\nvoid add_edge(WeightedGraph<Cost> &g, int from, int to, Cost cost) {\n g[from].emplace_back(from, to, cost);\n}\n\nint main() {\n int R, C, r1, c1, r2, c2;\n cin >> R >> C >> r1 >> c1 >> r2 >> c2;\n\n WeightedGraph<int> g(R * C);\n auto id = [&](int r, int c) {\n return r * C + c;\n };\n auto valid = [&](int r, int c) {\n return r >= 0 && r < R && c >= 0 && c < C;\n };\n\n int dr[] = {-1, 0, 1, 0};\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n for (int d = 0; d < 4; d++) {\n int r = i + dr[d];\n int c = j + dr[(d + 1) % 4];\n if (valid(r, c)) {\n add_edge(g, id(i, j), id(r, c), 1);\n }\n }\n add_edge(g, id(i, j), id(0, j), 1);\n add_edge(g, id(i, j), id(i, 0), 1);\n add_edge(g, id(i, j), id(R - 1, j), 1);\n add_edge(g, id(i, j), id(i, C - 1), 1);\n }\n }\n auto costs = dijkstra(g, id(r1, c1));\n vector<pair<int,int>> ws;\n for(int i = 0 ; i < costs.size() ; i++){\n ws.push_back({costs[i], i});\n }\n sort(ws.begin(), ws.end());\n vector<int> dp(R * C);\n dp[id(r1, c1)] = 1;\n for( auto I : ws ){\n int i = I.second;\n for(auto j : g[i]){\n if( j.cost + costs[i] == costs[j.to]) {\n dp[j.to] += dp[i];\n dp[j.to] %= 1000000007;\n }\n }\n }\n cout << costs[id(r2, c2)] << \" \" << dp[id(r2, c2)] << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":24244,"score_of_the_acc":-0.2824,"final_rank":16},{"submission_id":"aoj_3042_3224224","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 505\n\nstruct Info{\n\tInfo(int arg_row,int arg_col,ll arg_count){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tcount = arg_count;\n\t}\n\tint row,col;\n\tll count;\n};\n\nstruct Data{\n\tData(){\n\t\trow = col = 0;\n\t\tsum_cost = 0;\n\t}\n\n\tData(int arg_row,int arg_col,int arg_sum_cost){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tll row,col,sum_cost;\n};\n\nint H,W;\nint start_row,start_col,goal_row,goal_col;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nll dp[NUM][NUM];\nll min_cost[NUM][NUM];\n\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\nint find(vector<Info> V,int row,int col){\n\n int\tret = -1;\n\n\tfor(int i = 0; i < V.size(); i++){\n\t\tif(V[i].row == row && V[i].col == col){\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\tscanf(\"%d %d %d %d\",&start_row,&start_col,&goal_row,&goal_col);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tmin_cost[row][col] = HUGE_NUM; //そのマスに到達する際の最小コスト\n\t\t\tdp[row][col] = 0; //そのマスに到達する経路の総数\n\t\t}\n\t}\n\n\tmin_cost[start_row][start_col] = 0;\n\tdp[start_row][start_col] = 1;\n\n\tqueue<Data> Q;\n\tQ.push(Data(start_row,start_col,0));\n\n\tData data;\n\tint adj_row,adj_col,tmp_index;\n\tvector<Info> V;\n\n\twhile(!Q.empty()){\n\n\t\tdata = Q.front();\n\t\tQ.pop();\n\n\t\t//今回のマスから行けるマスと、そこへの経路数を数える\n\t\tV.clear();\n\n\t\t//まずは上下左右\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tadj_row = data.row+diff_row[i];\n\t\t\tadj_col = data.col+diff_col[i];\n\n\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\tV.push_back(Info(adj_row,adj_col,1));\n\t\t}\n\n\t\t//行の左端(今左端にいるなら、コストがかかるだけ移動は無駄)\n\t\tif(data.col != 0){\n\n\t\t\ttmp_index = find(V,data.row,0);\n\t\t\tif(tmp_index == -1){\n\n\t\t\t\tV.push_back(Info(data.row,0,1));\n\t\t\t}else{\n\n\t\t\t\tV[tmp_index].count++;\n\t\t\t}\n\t\t}\n\n\t\t//行の右端\n\t\tif(data.col != W-1){\n\n\t\t\ttmp_index = find(V,data.row,W-1);\n\t\t\tif(tmp_index == -1){\n\n\t\t\t\tV.push_back(Info(data.row,W-1,1));\n\t\t\t}else{\n\n\t\t\t\tV[tmp_index].count++;\n\t\t\t}\n\t\t}\n\n\t\t//列の上端\n\t\tif(data.row != 0){\n\n\t\t\ttmp_index = find(V,0,data.col);\n\t\t\tif(tmp_index == -1){\n\n\t\t\t\tV.push_back(Info(0,data.col,1));\n\t\t\t}else{\n\n\t\t\t\tV[tmp_index].count++;\n\t\t\t}\n\t\t}\n\n\t\t//列の下端\n\t\tif(data.row != H-1){\n\n\t\t\ttmp_index = find(V,H-1,data.col);\n\t\t\tif(tmp_index == -1){\n\n\t\t\t\tV.push_back(Info(H-1,data.col,1));\n\t\t\t}else{\n\n\t\t\t\tV[tmp_index].count++;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i = 0; i < V.size(); i++){\n\n\t\t\tif(min_cost[V[i].row][V[i].col] > data.sum_cost+1){ //最小値を更新する場合\n\n\t\t\t\tmin_cost[V[i].row][V[i].col] = data.sum_cost+1;\n\t\t\t\tdp[V[i].row][V[i].col] = dp[data.row][data.col]*V[i].count;\n\t\t\t\tdp[V[i].row][V[i].col] %= MOD;\n\t\t\t\tQ.push(Data(V[i].row,V[i].col,data.sum_cost+1));\n\n\t\t\t}else if(min_cost[V[i].row][V[i].col] == data.sum_cost+1){ //同点で最小値の場合\n\n\t\t\t\tdp[V[i].row][V[i].col] += dp[data.row][data.col]*V[i].count;\n\t\t\t\tdp[V[i].row][V[i].col] %= MOD;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld %lld\\n\",min_cost[goal_row][goal_col],dp[goal_row][goal_col]);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7032,"score_of_the_acc":-0.0441,"final_rank":10},{"submission_id":"aoj_3042_3160018","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\nusing namespace std;\n \n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n \npair<int, int> dp[510][510];\nconst pair<int, int> INFII(INF, -1);\n \nvoid update(pair<int, int> &A, pair<int, int> B) {\n B.first = B.first + 1;\n if(A.first > B.first) A = B;\n else if(A.first == B.first) {\n (A.second += B.second) %= MOD;\n }\n}\n \nstruct Elem {\n int x, y, ans, cnt;\n};\n \nsigned main() {\n int R, C, sx, sy, tx, ty; cin >> R >> C >> sx >> sy >> tx >> ty;\n fill(dp[0], dp[R], INFII);\n dp[sx][sy] = make_pair(0, 1);\n \n queue<Elem> que;\n que.push(Elem{sx, sy, 0, 1});\n \n const int ex[] = {-1, 0, -1, R-1};\n const int ey[] = {0, -1, C-1, -1};\n for(int step=0; step<R+C; step++) {\n set< pair<int, int> > checked;\n while(que.size()) {\n Elem cur = que.front(); que.pop();\n // 隣接\n for(int k=0; k<4; k++) {\n int nx = cur.x + dx[k], ny = cur.y + dy[k];\n if(nx < 0 || ny < 0 || nx >= R || ny >= C) continue;\n if(dp[nx][ny].first < dp[cur.x][cur.y].first + 1) continue;\n update(dp[nx][ny], dp[cur.x][cur.y]);\n checked.insert(make_pair(nx, ny));\n }\n \n // テレポート\n for(int k=0; k<4; k++) {\n int nx = (ex[k] < 0 ? cur.x : ex[k]);\n int ny = (ey[k] < 0 ? cur.y : ey[k]);\n if(dp[nx][ny].first < dp[cur.x][cur.y].first + 1) continue;\n update(dp[nx][ny], dp[cur.x][cur.y]);\n checked.insert(make_pair(nx, ny));\n }\n }\n \n for(auto x : checked) {\n int nx, ny; tie(nx, ny) = x;\n int vl, vr; tie(vl, vr) = dp[nx][ny];\n que.push(Elem{nx, ny, vl, vr});\n }\n }\n \n int ans1, ans2;\n tie(ans1, ans2) = dp[tx][ty];\n printf(\"%lld %lld\\n\", ans1, ans2);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7120,"score_of_the_acc":-0.0443,"final_rank":11},{"submission_id":"aoj_3042_3153314","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\nll dp[600][600];\nint dist[600][600];\n\nint main(){\n int w, h, sx, sy, gx, gy;\n\n cin >> w >> h >> sx >> sy >> gx >> gy;\n\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n dist[i][j] = INF;\n\n queue<pair<pair<int,int>,pair<int,int> > > q1;\n\n q1.push({{sy, sx}, {h, w}});\n dp[h][w] = 1;\n \n for(int i=0;q1.size();i++){\n queue<pair<pair<int,int>,pair<int,int> > > q2;\n\n while(q1.size()){\n auto p = q1.front(); q1.pop();\n int y = p.first.first;\n int x = p.first.second;\n ll cost = dp[p.second.first][p.second.second];\n\n if(y < 0 || h <= y || x < 0 || w <= x) continue;\n if(dist[y][x] < i) continue;\n \n if(dist[y][x] == i){\n dp[y][x] = (dp[y][x] + cost)%mod;\n continue;\n }\n\n dp[y][x] = cost;\n dist[y][x] = i;\n\n int dx[8] = {0,0,1,-1,1,1,-1,-1};\n int dy[8] = {1,-1,0,0,1,-1,1,-1};\n for(int i=0;i<4;i++){\n q2.push({{y+dy[i], x+dx[i]},{y,x}});\n }\n q2.push({{0,x},{y,x}});\n q2.push({{y,0},{y,x}});\n q2.push({{h-1,x},{y,x}});\n q2.push({{y,w-1},{y,x}});\n }\n\n q1 = q2;\n }\n\n cout << dist[gy][gx] << \" \" << dp[gy][gx] << endl;\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6380,"score_of_the_acc":-0.0426,"final_rank":9},{"submission_id":"aoj_3042_3149583","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\ntemplate<int MOD> struct ModInt {\n static const int Mod = MOD; unsigned x; ModInt() : x(0) { }\n ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\n int get() const { return (int)x; }\n ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\n ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\n ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }\n ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }\n ModInt operator+(ModInt that) const { return ModInt(*this) += that; }\n ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }\n ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }\n ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }\n ModInt inverse() const {\n long long a = x, b = MOD, u = 1, v = 0;\n while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }\n return ModInt(u);\n }\n bool operator==(ModInt that) const { return x == that.x; }\n bool operator!=(ModInt that) const { return x != that.x; }\n ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }\n};\ntemplate<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };\ntemplate<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {\n ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;\n}\ntypedef ModInt<1000000007> mint;\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\nint W, H, ax, ay, bx, by;\nint dst[505][505], vis[505][505]; mint dp[505][505];\nint dx[4] = { 0, 1, 0, -1 }, dy[4] = { -1, 0, 1, 0 };\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> W >> H >> ax >> ay >> bx >> by;\n\n rep(y, 0, H) rep(x, 0, W) dst[y][x] = inf;\n min_priority_queue<pair<int, int>> que;\n\n dst[ay][ax] = 0;\n dp[ay][ax] = 1;\n que.push({ 0, ay * 1010 + ax });\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n int x = q.second % 1010;\n int y = q.second / 1010;\n int c = q.first;\n\n if (vis[y][x]) continue;\n vis[y][x] = 1;\n\n if (y == by and x == bx) {\n cout << c << \" \" << dp[y][x] << endl;\n return;\n }\n\n vector<pair<int, int>> nxt;\n rep(d, 0, 4) nxt.push_back({ x + dx[d], y + dy[d] });\n nxt.push_back({ 0, y });\n nxt.push_back({ W - 1, y });\n nxt.push_back({ x, 0 });\n nxt.push_back({ x, H - 1 });\n\n fore(p, nxt) {\n int xx, yy;\n tie(xx, yy) = p;\n\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\n\n if (c + 1 < dst[yy][xx]) {\n dst[yy][xx] = c + 1;\n dp[yy][xx] = dp[y][x];\n que.push({ c + 1, yy * 1010 + xx });\n }\n else if (c + 1 == dst[yy][xx]) dp[yy][xx] += dp[y][x];\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":5372,"score_of_the_acc":-0.0404,"final_rank":6},{"submission_id":"aoj_3042_3146105","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/*\n <url:https://onlinejudge.u-aizu.ac.jp/services/room.html#ACPC2018Day2/problems/D>\n 問題文============================================================\n =================================================================\n 解説=============================================================\n ================================================================\n */\n\nconst ll MOD = 1e9+7;\nint d[4] = {1,0,-1,0};\nstruct edge{\n ll x,y,dist,sum;\n edge(ll x = 0,ll y = 0,ll dist = 0,ll sum = 0)\n :x(x),y(y),dist(dist),sum(sum){}\n bool operator < (const edge& e) const{\n return this->dist < e.dist;\n }\n bool operator > (const edge& e) const{\n return this->dist > e.dist;\n }\n\n};\nvector<ll> solve(){\n vector<ll> res;\n ll R,C,ai,aj,bi,bj;\n cin >> R >> C >> ai >> aj >> bi >> bj;\n vector<vector<pll>> dist(R,vector<pll>(C,{LINF,0}));\n priority_queue<edge,vector<edge>,greater<edge>> pq;\n pq.push(edge(ai,aj,0,1));\n dist[ai][aj] = {0,1};\n while(pq.size()){\n edge state = pq.top(); pq.pop();\n state.sum = dist[state.x][state.y].second;\n for(int k = 0; k < 4;k++){\n ll nx = state.x + d[k];\n ll ny = state.y + d[k^1];\n \n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\n if(dist[nx][ny].first > state.dist + 1){\n dist[nx][ny] = {state.dist+1,state.sum};\n pq.push(edge(nx,ny,state.dist+1,state.sum));\n }else if(dist[nx][ny].first == state.dist + 1){\n (dist[nx][ny].second += state.sum)%=MOD;\n }\n }\n {\n ll nx = state.x; ll ny = 0;\n \n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\n if(dist[nx][ny].first > state.dist + 1){\n dist[nx][ny] = {state.dist+1,state.sum};\n pq.push(edge(nx,ny,state.dist+1,state.sum));\n }else if(dist[nx][ny].first == state.dist + 1){\n (dist[nx][ny].second += state.sum)%=MOD;\n }\n }\n {\n ll nx = state.x; ll ny = C-1;\n \n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\n if(dist[nx][ny].first > state.dist + 1){\n dist[nx][ny] = {state.dist+1,state.sum};\n pq.push(edge(nx,ny,state.dist+1,state.sum));\n }else if(dist[nx][ny].first == state.dist + 1){\n (dist[nx][ny].second += state.sum)%=MOD;\n }\n }\n {\n ll nx = 0; ll ny = state.y;\n \n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\n if(dist[nx][ny].first > state.dist + 1){\n dist[nx][ny] = {state.dist+1,state.sum};\n pq.push(edge(nx,ny,state.dist+1,state.sum));\n }else if(dist[nx][ny].first == state.dist + 1){\n (dist[nx][ny].second += state.sum)%=MOD;\n }\n }\n {\n ll nx = R-1; ll ny = state.y;\n \n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\n if(dist[nx][ny].first > state.dist + 1){\n dist[nx][ny] = {state.dist+1,state.sum};\n pq.push(edge(nx,ny,state.dist+1,state.sum));\n } else if(dist[nx][ny].first == state.dist + 1){\n (dist[nx][ny].second += state.sum)%=MOD;\n }\n }\n }\n \n res = vector<ll>{dist[bi][bj].first,dist[bi][bj].second};\n return res;\n}\nint main(void) {\n cin.tie(0); ios_base::sync_with_stdio(false);\n cout << solve() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5956,"score_of_the_acc":-0.0017,"final_rank":2},{"submission_id":"aoj_3042_3145166","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nint h,w,ax,ay,bx,by;\nvector<int> G[500*500+1];\nint px[]={0,1,0,-1};\nint py[]={1,0,-1,0};\nlong long int mod=1e9+7;\nint comb(int x,int y){\n int ans=x+y*w;\n return ans;\n}\n\ntypedef pair<int, int> P;\nvector<pair<int,long long int> > dist(500*500+1,make_pair(1e9,0));\n\nvoid dijkstra(long long int s){\n priority_queue<P,vector<P>,greater<P> > que;\n dist[s]=make_pair(0,1);\n que.push(P(0,s));\n while(!que.empty()){\n P p=que.top();\n que.pop();\n long long int v=p.second;\n long long int d=p.first;\n if(dist[v].first<d)continue;\n for(int i=0;i<G[v].size();i++){\n long long int d2=d+1;\n if(dist[G[v][i]].first>d2){\n dist[G[v][i]].first=d2;\n dist[G[v][i]].second=dist[v].second;\n dist[G[v][i]].second%mod;\n que.push(P(dist[G[v][i]].first,G[v][i]));\n }else if(dist[G[v][i]].first==d2){\n dist[G[v][i]].second+=dist[v].second;\n dist[G[v][i]].second%=mod;\n }\n }\n }\n}\n\nint main(){\n cin>>h>>w>>ay>>ax>>by>>bx;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n for(int k=0;k<4;k++){\n int nx=j+px[k];\n int ny=i+py[k];\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\n G[comb(j,i)].push_back(comb(nx,ny));\n }\n }\n int nx=0;\n int ny=i;\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\n G[comb(j,i)].push_back(comb(nx,ny));\n }\n nx=w-1;\n ny=i;\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\n G[comb(j,i)].push_back(comb(nx,ny));\n }\n nx=j;\n ny=0;\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\n G[comb(j,i)].push_back(comb(nx,ny));\n }\n nx=j;\n ny=h-1;\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\n G[comb(j,i)].push_back(comb(nx,ny));\n }\n }\n }\n dijkstra(comb(ax,ay));\n //for(int i=0;i<h*w;i++)cout<<dist[i].first<<\" \"<<dist[i].second<<endl;\n cout<<dist[comb(bx,by)].first<<\" \"<<dist[comb(bx,by)].second%mod<<endl;\n}","accuracy":1,"time_ms":50,"memory_kb":21312,"score_of_the_acc":-0.1959,"final_rank":14},{"submission_id":"aoj_3042_3145113","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst int mod = 1000000007;\n\nint dx[] = {0, 1, 0, -1};\nint dy[] = {1, 0, -1, 0};\n\nint main() {\n int h, w, ai, aj, bi, bj;\n cin >> h >> w >> ai >> aj >> bi >> bj;\n\n vector<vector<pair<ll, ll>>> r(h, vector<pair<ll, ll>>(w, {1e9, 0}));\n\n queue<pair<int, int>> q;\n q.push({ai, aj});\n r[ai][aj] = {0, 1};\n while (!q.empty()) {\n auto p = q.front();\n q.pop();\n\n vector<pair<int, int>> next;\n for (int i = 0; i < 4; i++) {\n next.push_back({p.first + dy[i], p.second + dx[i]});\n }\n next.push_back({p.first, 0});\n next.push_back({p.first, w - 1});\n next.push_back({0, p.second});\n next.push_back({h - 1, p.second});\n\n for (auto e : next) {\n if (e == p || e.first < 0 || h <= e.first || e.second < 0 || w <= e.second) {\n continue;\n }\n\n if (r[p.first][p.second].first + 1 == r[e.first][e.second].first) {\n r[e.first][e.second].second += r[p.first][p.second].second;\n r[e.first][e.second].second %= mod;\n } else if (r[p.first][p.second].first + 1 < r[e.first][e.second].first) {\n r[e.first][e.second].first = r[p.first][p.second].first + 1;\n r[e.first][e.second].second = r[p.first][p.second].second;\n q.push(e);\n }\n }\n }\n\n // for (auto ee : r) {\n // for (auto e : ee) {\n // cerr << e.first << \",\" << e.second << \" \";\n // }\n // cerr << endl;\n // }\n\n cout << r[bi][bj].first << \" \" << r[bi][bj].second << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":5728,"score_of_the_acc":-0.0411,"final_rank":7},{"submission_id":"aoj_3042_3145067","code_snippet":"#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) for(int i = 0; i < (b); i++)\n#define all(a) (a).begin(), (a).end()\n#define show(x) cerr << #x << \" = \" << (x) << endl;\nusing namespace std;\n\ntemplate<typename T>\nostream& operator << (ostream& os, vector<T>& v){\n\trep(i,v.size()){ os << v[i] << (i == v.size() - 1 ? \"\" : \" \"); } return os;\n}\ntemplate<typename T>\nistream& operator >> (istream& is, vector<T>& v){\n\tfor(T& x: v){ is >> x; } return is;\n}\n\nconst int MAX = 510;\nconst long long M = 1000000007;\n\nint r, c, ay, ax, by, bx;\nint dis[MAX][MAX];\nlong long cnt[MAX][MAX];\n\nstruct P{\n\tint y, x;\n\tint cost;\n\tP(int y, int x, int cost) : y(y), x(x), cost(cost) { }\n\tbool operator < ( const P &right ) const {\n\t\treturn cost < right.cost;\n\t}\n\tbool operator > ( const P &right ) const {\n\t\treturn cost > right.cost;\n\t}\n};\n\nconst int dy[16] = { 0,-1, 0, 1, 1,-1, 1,-1, 0,-2, 0, 2};\nconst int dx[16] = { 1, 0,-1, 0, 1, 1,-1,-1, 2, 0,-2, 0};\n\nint shortestPath(){\n\tpriority_queue<P, vector<P>, greater<P>> q;\n\tq.emplace(P(ay, ax, 0));\n\n\twhile(not q.empty()){\n\t\tP cur = q.top(); q.pop();\n\n\t\tif(dis[cur.y][cur.x] != INT_MAX) continue;\n\t\tdis[cur.y][cur.x] = cur.cost;\n\n\t\tif(cur.y == by and cur.x == bx) continue;\n\n\t\t//cout << cur.y << ' ' << cur.x << endl;\n\t\trep(d,4){ // 隣接\n\t\t\tint ny = cur.y + dy[d];\n\t\t\tint nx = cur.x + dx[d];\n\t\t\tif(ny < 0 || ny >= r || nx < 0 || nx >= c) continue;\n\t\t\tif(dis[ny][nx] <= cur.cost + 1) continue;\n\t\t\tq.emplace(ny, nx, cur.cost + 1);\n\t\t}\n\t\trep(d,4){\n\t\t\tint ny = cur.y, nx = cur.x;\n\t\t\tif(dy[d] == 1) ny = r - 1;\n\t\t\tif(dy[d] == -1) ny = 0;\n\n\t\t\tif(dx[d] == 1) nx = c - 1;\n\t\t\tif(dx[d] == -1) nx = 0;\n\n\t\t\tif(dis[ny][nx] <= cur.cost + 1) continue;\n\t\t\tq.emplace(ny, nx, cur.cost + 1);\n\t\t}\n\t}\n\n\t//rep(i,r){ rep(j,c){ cout << dis[i][j] << ' '; } cout << endl; }\n\t\n\treturn dis[by][bx];\n}\n\nlong long solve(){\n\tpriority_queue<P, vector<P>, greater<P>> q;\n\tq.emplace(P(ay, ax, 0));\n\n\tcnt[ay][ax] = 1;\n\n\tbool used[MAX][MAX] = {};\n\twhile(not q.empty()){\n\t\tP cur = q.top(); q.pop();\n\n\t\tif(cur.y == by and cur.x == bx) continue;\n\t\tif(used[cur.y][cur.x]) continue;\n\t\tused[cur.y][cur.x] = true;\n\n\t\t//cout << \"cur \" << cur.y << ' ' << cur.x << endl;\n\n\t\trep(d,4){ // 隣接\n\t\t\tint ny = cur.y + dy[d];\n\t\t\tint nx = cur.x + dx[d];\n\t\t\tif(ny < 0 || ny >= r || nx < 0 || nx >= c) continue;\n\t\t\tif(dis[ny][nx] < cur.cost + 1) continue;\n\t\t\t//cout << dy[d] << ' ' << dx[d] << endl;\n\t\t\t//cout << ny << ' ' << nx << ' ' << cur.y << ' ' << cur.x << endl;\n\t\t\t(cnt[ny][nx] += cnt[cur.y][cur.x]) %= M;\n\t\t\tq.emplace(ny, nx, cur.cost + 1);\n\t\t}\n\t\trep(d,4){\n\t\t\tint ny = cur.y, nx = cur.x;\n\t\t\tif(dy[d] == 1) ny = r - 1;\n\t\t\tif(dy[d] == -1) ny = 0;\n\n\t\t\tif(dx[d] == 1) nx = c - 1;\n\t\t\tif(dx[d] == -1) nx = 0;\n\n\t\t\tif(dis[ny][nx] < cur.cost + 1) continue;\n\t\t\t//cout << ny << ' ' << nx << ' ' << cur.y << ' ' << cur.x << endl;\n\t\t\t(cnt[ny][nx] += cnt[cur.y][cur.x]) %= M;\n\t\t\tq.emplace(ny, nx, cur.cost + 1);\n\t\t}\n\t}\n\t//rep(i,r){ rep(j,c){ cout << cnt[i][j] << ' '; } cout << endl; }\n\n\treturn cnt[by][bx];\n}\n\nint main(){\n\tcin >> r >> c >> ay >> ax >> by >> bx;\n\trep(i,MAX) rep(j,MAX) dis[i][j] = INT_MAX;\n\n\tshortestPath();\n\tcout << shortestPath() << ' ' << solve() << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":6272,"score_of_the_acc":-0.1224,"final_rank":13},{"submission_id":"aoj_3042_3145045","code_snippet":"#include<iostream>\n#include<iomanip>\n#include<queue>\n#include<string>\n#include<stack>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cstring>\n#include<cassert>\n#include<ctime>\n#include<algorithm>\n#include<utility>\n#include<map>\n#include<set>\n#include<vector>\n#include<functional>\n#include<complex>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned ui;\ntypedef unsigned long long ull;\ntypedef pair<int,int> i_i;\ntypedef pair<ll,int> ll_i;\ntypedef pair<ll,ll> ll_ll;\ntypedef pair<double,int> d_i;\ntypedef pair<double,double> d_d;\ntypedef vector<int> vi;\ntypedef vector<vector<int> > vii;\n\n#ifdef DEBUG\n#define dprintf printf\n#define dputs puts\n#define dout(x) cout<<#x\" = \"<<(x)<<endl\n#define darray(x,n) {int i;rep(i,n)cout<<#x\"[\"<<i<<\"] = \"<<*((x)+i)<<endl;}\n#define dloop(i,s,g) for(int (i)=(s);(i)<(g);(i)++)\n#define drep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define dstop() scanf(\"%*c\")\n#else\n#define dprintf (1)?0:printf\n#define dputs (1)?0:puts\n#define dout(x)\n#define darray(x,n)\n#define dloop(i,s,g) if(int i=0){}else\n#define drep(i,n) if(int i=0){}else\n#define dstop()\n#endif\n\n#define F first\n#define S second\n#define pb push_back\n#define mp make_pair\n\n#define loop(i,s,g) for((i)=(s);(i)<(g);(i)++)\n#define rep(i,n) for((i)=0;(i)<(n);(i)++)\n#define all(x) (x.begin(),x.end())\n#define in(T,...) T __VA_ARGS__; impl(__VA_ARGS__)\n#define array(T,id,n) T id[(n)]; for(int i=0;i<(n);i++)cin>>id[i]\n#define putv(n) cout<<(n)<<endl\n\n//#define int long long\n#ifndef int\n#define INF __INT32_MAX__\n#else\n#define INF __INT64_MAX__\n#endif\n\nvoid impl(){};\ntemplate <typename T,typename... TS >\nvoid impl(T &head,TS &... tail)\n{\n cin>>head;\n impl(tail ...);\n}\n\nll dp[600][600][600];\n\nsigned main(void)\n{\n bool judge=false;\n int dx[4]={0,1,0,-1};\n int dy[4]={1,0,-1,0};\n int i,x,y;\n ll mod = 1e9+7;\n in(int,R,C,ai,aj,bi,bj);\n dp[0][ai][aj]=1;\n rep(i,520){\n rep(x,R){\n rep(y,C){\n dp[i][x][y]%=mod;\n int j;\n rep(j,4){\n if(0<=x+dx[j]&&x+dx[j]<R&&\n 0<=y+dy[j]&&y+dy[j]<C){\n dp[i+1][x+dx[j]][y+dy[j]]+=dp[i][x][y];\n }\n }\n dp[i+1][0 ][y ]+=dp[i][x][y];\n dp[i+1][R-1][y ]+=dp[i][x][y];\n dp[i+1][x ][0 ]+=dp[i][x][y];\n dp[i+1][x ][C-1]+=dp[i][x][y];\n if(x==bi&&y==bj&&\n dp[i][bi][bj]!=0){\n judge=true;\n }\n }\n }\n if(judge)\n break;\n }\n printf(\"%d %lld\\n\",i,dp[i][bi][bj]%mod);\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":454036,"score_of_the_acc":-2,"final_rank":19},{"submission_id":"aoj_3042_3145034","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nlong long di[4] = {0, -1, 0, 1};\nlong long dj[4] = {1, 0, -1, 0};\n//(R, C)\n//(i, j)\n//array[][]\n\n#define INF 1000000000000\nconst long long MOD = 1000000007;\n\n// 🔴\n// O(ElogE)\n\n// pq<pair> はfirstが大きい順に出てくるのですか？\n// s:= 開始ノード v:= 頂点数 adjlist:= 隣接リスト (first:= コスト second:= 行先)\nvector<long long> dijk(long long s, long long v, vector<vector<pair<long long, long long> > > &adjlist){\n\n priority_queue <pair<long long, long long> > wait;\n vector<long long> result(v, INF);\n\n //スタート地点を追加\n result[s] = 0;\n wait.push(make_pair(0, s));\n\n //ダイクストラ本体\n while(!wait.empty()){ //waitが空になるまで\n\n long long nowpoint = wait.top().second;\n long long nowcost = -wait.top().first;\n wait.pop();\n\n if(result[nowpoint] < nowcost) continue;\n\n //今いる頂点と隣接しているすべての頂点をなめる\n for(long long i = 0; i < adjlist[nowpoint].size(); i++){\n\n long long nextpoint = adjlist[nowpoint][i].second;\n long long nextcost = nowcost + adjlist[nowpoint][i].first;\n //現時点より安く到達できそうであれば、結果を更新して優先度付きキューに格納\n if(result[nextpoint] > nextcost){\n result[nextpoint] = nextcost;\n wait.push(make_pair(-nextcost, nextpoint));\n }\n }\n }\n \n return result; //結果列を返す\n}\n\nint main(){\n\n long long R, C, si, sj, gi, gj; cin >> R >> C >> si >> sj >> gi >> gj;\n \n vector<vector<long long> > MAP(R, vector<long long> (C));\n long long n = 0; //頂点数\n for(long long i = 0; i < R; i++){\n for(long long j = 0; j < C; j++){\n MAP[i][j] = n;\n n++;\n }\n }\n\n vector<vector<pair<long long, long long> > > adj(n);\n\n for(long long i = 0; i < R; i++){\n for(long long j = 0; j < C; j++){\n\n long long now = MAP[i][j];\n \n //上下左右\n for(long long h = 0; h < 4; h++){\n long long ni = i + di[h];\n long long nj = j + dj[h];\n if(ni < 0 || R <= ni || nj < 0 || C <= nj) continue;\n\n long long next = MAP[ni][nj];\n adj[now].push_back({1, next});\n }\n\n //特殊辺\n long long next = MAP[i][0];\n if(now != next) adj[now].push_back({1, next});\n next = MAP[i][C - 1];\n if(now != next) adj[now].push_back({1, next});\n next = MAP[0][j];\n if(now != next) adj[now].push_back({1, next});\n next = MAP[R - 1][j];\n if(now != next) adj[now].push_back({1, next}); \n }\n }\n\n vector<long long> result(n);\n long long S = MAP[si][sj];\n long long G = MAP[gi][gj];\n result = dijk(S, n, adj);\n //cout << result[G] << endl;\n \n\n //辺削除\n vector<bool> used(n, false);\n vector<long long> dp(n, 0);\n\n dp[S] = 1;\n used[S] = true;\n queue<long long> q;\n q.push(S);\n\n while(!q.empty()){\n \n long long now = q.front();\n q.pop();\n for(auto e : adj[now]){\n\n int next = e.second;\n if(result[next] - result[now] != 1) continue;\n dp[next] += dp[now];\n dp[next] %= MOD;\n if(!used[next]){\n q.push(next);\n used[next] = true;\n }\n }\n }\n\n cout << result[G] << \" \" << dp[G] << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":37208,"score_of_the_acc":-0.3113,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_3042_9616360\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int N = 501;\\nconst int P = N * N;\\nconst int INF = 1e9 + 128;\\nconst int MOD = 1e9 + 7;\\n\\nint d[P], cnt[P];\\nvector<int> g[P];\\n\\nconst int dx[] = {1, -1, 0, 0};\\nconst int dy[] = {0, 0, 1, -1};\\n\\nint r, c;\\n\\nint get(int x, int y) {\\n return x * c + y;\\n}\\n\\nbool ok(int x, int y) {\\n return 0 <= x && x < r && 0 <= y && y < c;\\n}\\n\\nint main() {\\n cin >> r >> c;\\n\\n for (int i = 0; i < r; i++)\\n for (int j = 0; j < c; j++) {\\n int cnode = get(i, j);\\n d[cnode] = INF;\\n for (int x = 0; x < 4; x++) {\\n int ni = i + dx[x], nj = j + dy[x];\\n if (ok(ni, nj))\\n g[cnode].push_back(get(ni, nj));\\n }\\n for (int x : {0, r - 1})\\n g[cnode].push_back(get(x, j));\\n for (int y : {0, c - 1})\\n g[cnode].push_back(get(i, y));\\n }\\n\\n int a, b;\\n cin >> a >> b;\\n int snode = get(a, b);\\n\\n cin >> a >> b;\\n int dnode = get(a, b);\\n\\n d[snode] = 0;\\n cnt[snode] = 1;\\n\\n queue <int> q;\\n q.push(snode);\\n\\n while (!q.empty()) {\\n int node = q.front(); q.pop();\\n\\n for (int i = 0; i < (int)g[node].size(); ) {\\n int j = i;\\n while (j < (int)g[node].size() && g[node][i] == g[node][j])\\n ++j;\\n int to = g[node][i];\\n int cc = j - i;\\n if (d[to] > d[node] + 1)\\n d[to] = d[node] + 1, cnt[to] = (cc * cnt[node]) % MOD, q.push(to);\\n else if (d[to] == d[node] + 1)\\n cnt[to] = (cnt[to] + cc * cnt[node]) % MOD;\\n i = j;\\n }\\n }\\n\\n cout << d[dnode] << ' ' << cnt[dnode] << '\\\\n';\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 19344,\n \"score_of_the_acc\": -0.0715,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3042_6060184\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string.h>\\n#include <stdio.h>\\n#include <stack>\\n#include <queue>\\n#include <cmath>\\n#include <vector>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\nint mov[4][2]={{1,0},{0,1},{0,-1},{-1,0}};\\nint dis[505][505];\\nll ans[505][505];\\nint vis[505][505];\\nconst int inf=1000000007;\\nint main()\\n{\\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n int r,c,a,b,xxx,yyy;\\n cin>>r>>c>>a>>b>>xxx>>yyy;\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++)\\n dis[i][j]=1000;\\n }\\n dis[a][b]=0;\\n queue<pair<int,int> > q;\\n q.push(make_pair(a,b));\\n while(!q.empty()){\\n int x=q.front().first,y=q.front().second;\\n q.pop();\\n for(int i=0;i<4;i++){\\n int xx=x+mov[i][0],yy=y+mov[i][1];\\n if(xx>=0&&yy>=0&&xx<r&&yy<c){\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n }\\n int xx=x,yy=y;\\n xx=0;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=r-1;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=x,yy=0;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n yy=c-1;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n cout<<dis[xxx][yyy]<<\\\" \\\";\\n vis[a][b]=1;\\n ans[a][b]=1;\\n while(!q.empty()) q.pop();\\n q.push(make_pair(a,b));\\n while(!q.empty()){\\n int x=q.front().first,y=q.front().second;\\n q.pop();\\n int xx,yy;\\n for(int i=0;i<4;i++){\\n xx=x+mov[i][0],yy=y+mov[i][1];\\n if(xx>=0&&yy>=0&&xx<r&&y<c){\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n }\\n xx=0,yy=y;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=r-1;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=x,yy=0;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n yy=c-1;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]=(ans[xx][yy]+ans[x][y])%inf;\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n cout<<ans[xxx][yyy]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6948,\n \"score_of_the_acc\": -0.0039,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3042_6060175\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string.h>\\n#include <stdio.h>\\n#include <stack>\\n#include <queue>\\n#include <cmath>\\n#include <vector>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\nint mov[4][2]={{1,0},{0,1},{0,-1},{-1,0}};\\nint dis[505][505];\\nll ans[505][505];\\nint vis[505][505];\\nint main()\\n{\\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n int r,c,a,b,xxx,yyy;\\n cin>>r>>c>>a>>b>>xxx>>yyy;\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++)\\n dis[i][j]=1000;\\n }\\n dis[a][b]=0;\\n queue<pair<int,int> > q;\\n q.push(make_pair(a,b));\\n while(!q.empty()){\\n int x=q.front().first,y=q.front().second;\\n q.pop();\\n for(int i=0;i<4;i++){\\n int xx=x+mov[i][0],yy=y+mov[i][1];\\n if(xx>=0&&yy>=0&&xx<r&&yy<c){\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n }\\n int xx=x,yy=y;\\n xx=0;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=r-1;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=x,yy=0;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n yy=c-1;\\n if(dis[xx][yy]>dis[x][y]+1){\\n dis[xx][yy]=dis[x][y]+1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n cout<<dis[xxx][yyy]<<\\\" \\\";\\n vis[a][b]=1;\\n ans[a][b]=1;\\n while(!q.empty()) q.pop();\\n q.push(make_pair(a,b));\\n while(!q.empty()){\\n int x=q.front().first,y=q.front().second;\\n q.pop();\\n int xx,yy;\\n for(int i=0;i<4;i++){\\n xx=x+mov[i][0],yy=y+mov[i][1];\\n if(xx>=0&&yy>=0&&xx<r&&y<c){\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]+=ans[x][y];\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n }\\n xx=0,yy=y;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]+=ans[x][y];\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=r-1;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]+=ans[x][y];\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n xx=x,yy=0;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]+=ans[x][y];\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n yy=c-1;\\n if(dis[xx][yy]>dis[x][y]){\\n ans[xx][yy]+=ans[x][y];\\n }\\n if(!vis[xx][yy]){\\n vis[xx][yy]=1;\\n q.push(make_pair(xx,yy));\\n }\\n }\\n cout<<ans[xxx][yyy]%1000000007<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.2982456140350877,\n \"time_ms\": 10,\n \"memory_kb\": 6904,\n \"score_of_the_acc\": -0.0038,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3042_4496493\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <algorithm>\\n#include <cmath>\\n#include <set>\\n#include <cstdio>\\n#include <vector>\\n#include <iostream>\\n#include <utility>\\n#include <queue>\\n#include <map>\\n#include <complex>\\n#define fir first\\n#define sec second\\n#define sz(s) (s).size()\\n#define pb push_back\\n#define get(n) scanf(\\\"%d\\\",&n);\\n#define gets(s) string s;cin >> (s);\\n#define prfi(n) printf(\\\"%d\\\", &n);\\n#define prfd(n) printf(\\\"%lf\\\", &n);\\n#define All(s) (s).begin(), (s).end()\\n#define rep(i,j) for(int (i)=0;(i)<(j);(i)++)\\n#define For(i,j,k) for(int (i)=(j);(i)<(k);(i)++)\\n#define drep(i,j) for(int (i)=(j);(i)>=0;(i)--)\\n#define Ford(i,j,k) for(int (i)=(j);i>=(k);i--)\\n#define fore(c,v) for(auto (c): (v))\\n#define lp for(int __=0;__<n;i++)\\n#define mem(a,b) memset(a,b,sizeof(a));\\n#define dump(x) std::cout << #x << \\\" = \\\" << (x) << std::endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\nusing ull = unsigned long long int;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = std::pair<int,int>;\\nusing pll = std::pair<ll, ll>;\\nusing vi = std::vector<int> ;\\nusing vvi = std::vector<vi> ;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vd = std::vector<double> ;\\nusing vvd = std::vector<vd> ;\\nusing qi = std::queue<int> ;\\nusing vpii = std::vector<std::pair<int, int> >;\\nusing vpll = std::vector<pll>;\\nusing namespace std;\\n\\nconst int Mod = (1e9) + 7;\\nconst int INF = 1e9 + 19;\\nconst ll INFL = 1e18 + 19;\\nconst int dx[] = {-1, 0, 0, 1};\\nconst int dy[] = {0, -1, 1, 0};\\nconst int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\\nconst int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};\\nconst double EPS = 1e-10;\\n//_____________________________________Templates_________________________________________//\\n\\ntemplate<class T1, class T2> inline void chmin(T1 &a, T2 b){if(a > b) a = b;}\\ntemplate<class T1, class T2> inline void chmax(T1 &a, T2 b){if(a < b) a = b;}\\ntemplate<class T> inline void pri(T a){cout << a << endl;}\\ntemplate<class Z> using vec = vector<Z>;\\ntemplate<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\n//mainly use for dynamic prog\\ntemplate<class T1, class T2>\\nvoid update(T1 &a, T2 b){\\n a += b;\\n if(a > Mod) a %= Mod;\\n}\\n\\ninline void IN(void){\\n return;\\n}\\n\\ntemplate <typename First, typename... Rest>\\nvoid IN(First& first, Rest&... rest){\\n cin >> first;\\n IN(rest...);\\n return;\\n}\\n\\ninline void OUT(void){\\n cout << \\\"\\\\n\\\";\\n return;\\n}\\n\\ntemplate <typename First, typename... Rest>\\nvoid OUT(First first, Rest... rest){\\n cout << first << \\\" \\\";\\n OUT(rest...);\\n return;\\n}\\n\\nbool pairsort(pll pl, pll pr){\\n if(pl.first == pr.first)return pl.second > pr.second;\\n return pl.first < pr.first;\\n}\\n\\nint cntbit(ll a,int n,int j){int res = 0;For(i,j,n){if(a>>i & 1){res++;}}return res;}\\nvector<int> make_bit(int a){vector<int> res; for(int i=31;i>=0;i--)if(a&(1<<i))res.pb(i);return res;}\\nbool stdbit(int a, int b){return a&(1 << b); }\\nint GCD(int a, int b){if(b > a)return GCD(b,a);if(a%b == 0)return b;else return GCD(b, a%b);}\\nint LCM(int a, int b){return a*b/GCD(a,b);}\\nint roundup(int a, int b){if(a % b == 0)return a/b;else return (a+b)/b;}\\nint rounddown(int a, int b){if(a%b == 0)return a/b;else {return (a-b)/b;}}\\nll pow(ll a, ll n){ll res = 1;while(n > 0){if(n&1)res *= a; a *= a; n = n >> 1;}return res;}\\nll GetDiviserCount(ll N)//約数の個数\\n{\\n ll res = 1;\\n For(i,2,sqrt(N)+1)\\n {\\n ll cnt = 0;\\n while(N%i == 0)\\n {\\n cnt++;\\n N /= i;\\n }\\n res *= (cnt + 1);\\n if(N == 1)break;\\n }\\n if(N != 1)res *= 2;\\n return res;\\n}\\nvll GetDivisor(ll N)//約数列挙\\n{\\n vll res;\\n for(ll i = 1;i*i <= N;i++)\\n {\\n if(N%i == 0)\\n {\\n res.pb(i);\\n if(i*i != N)res.pb(N/i);\\n }\\n }\\n sort(All(res));\\n return res;\\n}\\n\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%Mod+Mod)%Mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= Mod) x -= Mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += Mod-a.x) >= Mod) x -= Mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= Mod;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n \\n // for prime mod\\n mint inv() const {\\n return pow(Mod-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n friend ostream& operator<<(ostream& os, const mint& a);\\n};\\nostream& operator<<(ostream& os, const mint& a)\\n{\\n os << a.x;\\n return os;\\n}\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n assert(n < Mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n};\\n \\ntemplate<class Z>\\nstruct MyMatrix\\n{\\n using mat = MyMatrix<Z>;\\n vector<vector<Z>> m_dat;\\n int m_h;\\n int m_w;\\n MyMatrix(int h, int w) : m_h(h), m_w(w) ,m_dat(h,vector<Z>(w)) {}\\n vector<Z> &operator[] (int idx)\\n {\\n return m_dat[idx];\\n }\\n mat Multiple(mat &a)\\n {\\n mat C(m_h, a.m_w);\\n for(int i=0;i<m_h;i++)\\n {\\n for(int j=0;j<a.m_w;j++)\\n {\\n for(int k=0;k<m_w;k++)\\n {\\n C[i][j] += m_dat[i][k] * a[k][j];\\n }\\n }\\n }\\n return C;\\n }\\n mat Pow(ll x)\\n {\\n mat B(m_h,m_w);\\n for(int i=0;i<m_h;i++)\\n {\\n B[i][i] = 1;\\n }\\n mat A = *this;\\n while(x > 0)\\n {\\n if(x&1)B = B.Multiple(A);\\n A = A.Multiple(A);\\n x = x >> 1;\\n }\\n return B;\\n }\\n //friend ostream& operator<<(ostream &os, const mat &A);\\n};\\n/*\\ntemplate<class Z>\\nostream& operator<<(ostream &os, Matrix<Z>& A)\\n{\\n for(int i=0;i<A.m_h;i++)\\n {\\n for(int j=0;j<A.m_w;j++)\\n {\\n os << A[i][j] << \\\" \\\";\\n }\\n os << endl;\\n }\\n return os;\\n}\\n*/\\ntemplate<class T>\\nusing mat = MyMatrix<T>;\\n//_____________________ following sorce code_________________________//\\nconst int max_n = 3 * (1e5) + 1;\\nconst int max_m = 83 * (1e5) + 1;\\n\\nint n,m,k;\\nll N;\\nint h,w;\\nstring S;\\n//int a,b,c;\\nvi v;\\nint ans;\\ndouble x,y,z;\\nint a[2],b[2];\\nvector<int> G[1010101];\\nstruct Data\\n{ \\n int cost;\\n int x,y;\\n Data(int cost,int x,int y) : cost(cost),x(x),y(y) {}\\n bool operator>(const Data &a) const\\n {\\n return cost > a.cost;\\n }\\n};\\nmint times[1000][1000];\\nint cost[1000][10000];\\nint visit[1010][1010];\\nvoid Dijkstra()\\n{\\n min_priority_queue<Data> qu;\\n memset(times,0,sizeof(times));\\n memset(cost,INF,sizeof(cost));\\n memset(visit,false,sizeof(visit));\\n qu.push(Data(0,a[0],b[0]));\\n times[a[0]][b[0]] = 1;\\n cost[a[0]][b[0]] = 0;\\n while(qu.size())\\n {\\n auto e = qu.top(); qu.pop();\\n if(visit[e.x][e.y])continue;\\n visit[e.x][e.y] = true;\\n rep(i,4)\\n {\\n int nx = e.x + dx[i];\\n int ny = e.y + dy[i];\\n if(nx >= 0 and nx < h and ny >= 0 and ny < w)\\n {\\n if(cost[nx][ny] == e.cost + 1)\\n {\\n times[nx][ny] += times[e.x][e.y];\\n qu.push(Data(e.cost+1,nx,ny));\\n }\\n if(cost[nx][ny] > e.cost + 1)\\n {\\n times[nx][ny] = times[e.x][e.y];\\n cost[nx][ny] = e.cost + 1;\\n qu.push(Data(e.cost+1,nx,ny));\\n }\\n }\\n }\\n\\n if(e.x != 0)\\n {\\n if(cost[0][e.y] == e.cost + 1)\\n {\\n times[0][e.y] += times[e.x][e.y];\\n qu.push(Data(e.cost+1,0,e.y));\\n }\\n else if(cost[0][e.y] > e.cost + 1)\\n {\\n times[0][e.y] = times[e.x][e.y];\\n cost[0][e.y] = e.cost + 1;\\n qu.push(Data(e.cost+1,0,e.y));\\n }\\n }\\n if(e.x != h-1)\\n {\\n if(cost[h-1][e.y] == e.cost + 1)\\n {\\n times[h-1][e.y] += times[e.x][e.y];\\n qu.push(Data(e.cost+1,h-1,e.y));\\n }\\n else if(cost[h-1][e.y] > e.cost + 1)\\n {\\n times[h-1][e.y] = times[e.x][e.y];\\n cost[h-1][e.y] = e.cost + 1;\\n qu.push(Data(e.cost+1,h-1,e.y));\\n }\\n }\\n if(e.y != 0)\\n {\\n if(cost[e.x][0] == e.cost + 1)\\n {\\n times[e.x][0] += times[e.x][e.y];\\n qu.push(Data(e.cost+1,e.x,0));\\n }\\n else if(cost[e.x][0] > e.cost + 1)\\n {\\n times[e.x][0] = times[e.x][e.y];\\n cost[e.x][0] = e.cost + 1;\\n qu.push(Data(e.cost+1,e.x,0));\\n }\\n }\\n if(e.y != w-1)\\n {\\n if(cost[e.x][w-1] == e.cost + 1)\\n {\\n times[e.x][w-1] += times[e.x][e.y];\\n qu.push(Data(e.cost+1,e.x,w-1));\\n }\\n else if(cost[e.x][w-1] > e.cost + 1)\\n {\\n times[e.x][w-1] = times[e.x][e.y];\\n cost[e.x][w-1] = e.cost + 1;\\n qu.push(Data(e.cost+1,e.x,w-1));\\n }\\n }\\n }\\n}\\n\\nsigned main (int argc, char* argv[]) {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n IN(h,w,a[0],b[0],a[1],b[1]);\\n Dijkstra();\\n cout << cost[a[1]][b[1]] << \\\" \\\" << times[a[1]][b[1]] << endl;\\n //dump(times[1][1]);\\n //for(auto c : ans){cout << c << endl;}\\n //cout << fixed << setprecision(15) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 77820,\n \"score_of_the_acc\": -0.2818,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3042_4321714\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\nconst int MOD = (int)1e9 + 7;\\n\\ntemplate<class T> using Rig = pair<T, long long>;\\ntemplate<class T> Rig<T> add(const Rig<T> &a, const Rig<T> &b) {\\n if (a.first != b.first) return min(a, b);\\n return Rig<T>(a.first, (a.second + b.second) % MOD);\\n}\\ntemplate<class T> Rig<T> mul(const Rig<T> &a, const Rig<T> &b) {\\n return Rig<T>(a.first + b.first, a.second * b.second % MOD);\\n}\\n\\ntemplate<class T, class S> ostream& operator<<(ostream& os, const pair<T, S>& p) { return os << p.first << \\\" \\\" << p.second; }\\nconst int INF = (int)1e9 + 7;\\nusing pii = pair<int, int>;\\nint main() {\\n int h, w; cin >> h >> w;\\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\\n vector<vector<Rig<int>>> dp(h, vector<Rig<int>>(w, Rig<int>(INF, 0)));\\n vector<vector<bool>> done(h, vector<bool>(w));\\n queue<pair<Rig<int>, pii>> que;\\n dp[si][sj] = Rig<int>(0, 1);\\n que.emplace(dp[si][sj], pii(si, sj));\\n while (!que.empty()) {\\n pii p = que.front().second; que.pop();\\n int i = p.first, j = p.second;\\n if (done[i][j]) continue;\\n done[i][j] = true;\\n int dij[] = {0, 1, 0, -1, 0};\\n for (int k = 0; k < 4; k++) {\\n int ni = i + dij[k], nj = j + dij[k + 1];\\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\\n que.emplace(dp[ni][nj], pii(ni, nj));\\n }\\n int nis[] = {i, i, 0, h - 1}, njs[] = {0, w - 1, j, j};\\n for (int k = 0; k < 4; k++) {\\n int ni = nis[k], nj = njs[k];\\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\\n que.emplace(dp[ni][nj], pii(ni, nj));\\n }\\n }\\n cout << dp[ti][tj] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6152,\n \"score_of_the_acc\": -0.0421,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3042_4321646\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\nconst int MOD = (int)1e9 + 7;\\n\\ntemplate<class T> using Rig = pair<T, long long>;\\ntemplate<class T> Rig<T> add(const Rig<T> &a, const Rig<T> &b) {\\n if (a.first != b.first) return min(a, b);\\n return Rig<T>(a.first, (a.second + b.second) % MOD);\\n}\\ntemplate<class T> Rig<T> mul(const Rig<T> &a, const Rig<T> &b) {\\n return Rig<T>(a.first + b.first, a.second * b.second % MOD);\\n}\\n\\nusing pii = pair<int, int>;\\nconst int INF = (int)1e9 + 7;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T, class S> ostream& operator<<(ostream& os, const pair<T, S>& p) { return os << p.first << \\\" \\\" << p.second; }\\nint main() {\\n int h, w; cin >> h >> w;\\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\\n vector<vector<Rig<int>>> dp(h, vector<Rig<int>>(w, Rig<int>(INF, 0)));\\n vector<vector<bool>> done(h, vector<bool>(w));\\n min_heap<pair<Rig<int>, pii>> pq;\\n pq.emplace(dp[si][sj] = Rig<int>(0, 1), pii(si, sj));\\n while (!pq.empty()) {\\n pii p = pq.top().second; pq.pop();\\n int i = p.first, j = p.second;\\n if (done[i][j]) continue;\\n done[i][j] = true;\\n int dij[] = {0, 1, 0, -1, 0};\\n for (int k = 0; k < 4; k++) {\\n int ni = i + dij[k], nj = j + dij[k + 1];\\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\\n pq.emplace(dp[ni][nj], pii(ni, nj));\\n }\\n int nis[] = {i, i, 0, h - 1}, njs[] = {0, w - 1, j, j};\\n for (int k = 0; k < 4; k++) {\\n int ni = nis[k], nj = njs[k];\\n dp[ni][nj] = add(dp[ni][nj], mul(dp[i][j], Rig<int>(1, 1)));\\n pq.emplace(dp[ni][nj], pii(ni, nj));\\n }\\n }\\n cout << dp[ti][tj] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 6096,\n \"score_of_the_acc\": -0.562,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3042_4321547\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\nusing pii = pair<int, int>;\\nconst int INF = (int)1e9 + 7;\\nconst int MOD = (int)1e9 + 7;\\ntemplate<class T> void add(T &a, T b) { (a += (b % MOD + MOD) % MOD) %= MOD; }\\ntemplate<class T> inline bool chmin(T &a, T b) { return a > b ? (a = b, 1) : 0; }\\n\\nint main() {\\n int h, w; cin >> h >> w;\\n int si, sj, ti, tj; cin >> si >> sj >> ti >> tj;\\n vector<vector<int>> dist(h, vector<int>(w, INF));\\n vector<vector<int>> dp(h + 1, vector<int>(w + 1));\\n vector<pair<pii, pii>> cur;\\n cur.emplace_back(pii(si, sj), pii(h, w)), dp[h][w] = 1;\\n for (int k = 0; !cur.empty(); k++) {\\n vector<pair<pii, pii>> nxt;\\n for (auto &p: cur) {\\n int i = p.first.first, j = p.first.second;\\n int prv = dp[p.second.first][p.second.second];\\n if (chmin(dist[i][j], k)) {\\n dp[i][j] = prv;\\n int dij[] = {0, 1, 0, -1, 0};\\n for (int d = 0; d < 4; d++) {\\n int ni = i + dij[d], nj = j + dij[d + 1];\\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) continue;\\n nxt.emplace_back(pii(ni, nj), pii(i, j));\\n } {\\n nxt.emplace_back(pii(i, 0), pii(i, j));\\n nxt.emplace_back(pii(i, w - 1), pii(i, j));\\n nxt.emplace_back(pii(0, j), pii(i, j));\\n nxt.emplace_back(pii(h - 1, j), pii(i, j));\\n }\\n } else if (dist[i][j] == k) {\\n add(dp[i][j], prv);\\n }\\n }\\n cur = nxt;\\n }\\n cout << dist[ti][tj] << \\\" \\\" << dp[ti][tj] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5212,\n \"score_of_the_acc\": -0.04,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3042_4239165\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define INF 329496729612\\n#define int long long\\n#define MOD (int)(1e9+7)\\n#define MAX 500\\ntypedef pair<int,int> P;\\n\\nint r, c, ax, ay, by, bx, ans, temp;\\nint grid[MAX+10][MAX+10],countg[MAX+10][MAX+10], flags[MAX+10][MAX+10], dxy[4] = {1, -1, 0, 0};\\n\\nvoid huga(){\\n queue<P> Q;\\n Q.push(P(ax,ay));\\n\\n for(int i = 0; i <= MAX; i++)\\n for(int j = 0; j <= MAX; j++)\\n grid[i][j] = INF;\\n\\n grid[ay][ax] = 0;\\n countg[ay][ax]=1;\\n\\n while(!Q.empty()){\\n P p = Q.front();Q.pop();\\n int x = p.first, y=p.second,ny, nx;\\n // int rc[2][4] = {{x,x,0,r-1},{0,c-1,y,y}};\\n int rc[2][4] = {{x,x,0,c-1},{0,r-1,y,y}};\\n for(int i = 0; i < 8; i++){\\n if(i < 4) nx = x + dxy[i], ny = y + dxy[3-i];\\n else ny = rc[1][i-4], nx = rc[0][i-4];\\n\\n if(0 <= nx && nx < c && 0 <= ny && ny < r){\\n\\tif(grid[y][x]+1 < grid[ny][nx]){\\n\\t grid[ny][nx] = grid[y][x]+1;\\n\\t if(nx != bx|| ny != by)Q.push(P(nx,ny));\\n\\t}\\n }\\n }\\n }\\n\\n Q.push(P(ax,ay));\\n while(!Q.empty()){\\n P p = Q.front();Q.pop();\\n int x = p.first, y=p.second,ny, nx;\\n // int rc[2][4] = {{x,x,0,r-1},{0,c-1,y,y}};\\n int rc[2][4] = {{x,x,0,c-1},{0,r-1,y,y}};\\n if(flags[y][x])continue;\\n else flags[y][x]=1;\\n for(int i = 0; i < 8; i++){\\n if(i < 4) nx = x + dxy[i], ny = y + dxy[3-i];\\n else ny = rc[1][i-4], nx = rc[0][i-4];\\n\\n if(0 <= nx && nx < c && 0 <= ny && ny < r){\\n\\tif(grid[y][x]+1 == grid[ny][nx]){\\n\\t countg[ny][nx] += countg[y][x];\\n\\t if(nx != bx|| ny != by)Q.push(P(nx,ny));\\n\\t countg[ny][nx] %= MOD;\\n\\t}\\n }\\n }\\n }\\n}\\n\\nsigned main(){\\n cin>>r>>c>>ay>>ax>>by>>bx;\\n\\n huga();\\n\\n cout<<grid[by][bx]<<\\\" \\\"<<countg[by][bx]%MOD<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8948,\n \"score_of_the_acc\": -0.0083,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3042_3708175\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <set>\\n#include <utility>\\n#include <cstdlib>\\n#include <queue>\\n#include <stack>\\n#include <iomanip>\\n#include <cstdio>\\n#include <map>\\n#include <list>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\n\\n#define _upgrade ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\\n#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define pb push_back\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\n\\n//ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}\\n//ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}\\n\\nint dx[4] = {1,0,-1,0};\\nint dy[4] = {0,1,0,-1};\\n\\nconst ll INF = 1e9;\\nconst long double PI = 3.14159265358979323846;\\n\\n\\n// ****************************************CODE***************************************//\\n\\ntemplate<int MOD> struct ModInt {\\n static const int Mod = MOD; unsigned x; ModInt() : x(0) { }\\n ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\\n ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\\n int get() const { return (int)x; }\\n ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\\n ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\\n ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }\\n ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }\\n ModInt operator+(ModInt that) const { return ModInt(*this) += that; }\\n ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }\\n ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }\\n ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }\\n ModInt inverse() const {\\n long long a = x, b = MOD, u = 1, v = 0;\\n while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }\\n return ModInt(u);\\n }\\n bool operator==(ModInt that) const { return x == that.x; }\\n bool operator!=(ModInt that) const { return x != that.x; }\\n ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }\\n};\\ntemplate<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };\\ntemplate<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {\\n ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;\\n}\\ntypedef ModInt<1000000007> mint;\\n\\n\\n\\nint W, H, ax, ay, bx, by;\\nint dst[505][505], vis[505][505];\\nmint cnt[505][505];\\n\\nint main(){\\n cin >> W >> H >> ax >> ay >> bx >> by;\\n\\n rep(y,H) rep(x,W) dst[y][x] = INF;\\n min_priority_queue<pair<int, int>> que;\\n\\n dst[ay][ax] = 0;\\n cnt[ay][ax] = 1;\\n que.push({0, ay * 1010 + ax});\\n while(!que.empty()){\\n auto q = que.top(); que.pop();\\n\\n //この場合分けのやり方すごい画期的過ぎんか\\n //何それすごいってやつ\\n //んーコストとグリッド状の座標を保存する時にこれは便利になるのかなーと思う。すごいなー。\\n //今回はグラフを作るという作業はしないみたいやね。というよりはもともと全てのグラフはグリッドとして用意されていてあとはコストが1ってある程度決まってるからbfs的な感じでも解けるんだよね。\\n //\\n int x = q.second % 1010;\\n int y = q.second / 1010;\\n int c = q.first;\\n\\n if(vis[y][x]) continue;\\n vis[y][x] = 1;\\n\\n if(y == by and x == bx){\\n cout << c << \\\" \\\" << cnt[y][x] << endl;\\n return 0;\\n }\\n\\n //次に行くパターンを全部ここに入れるのかーなるほど\\n vector<pair<int, int>> nxt;\\n rep(i,4) nxt.push_back({x + dx[i], y + dy[i]});\\n nxt.push_back({0,y});\\n nxt.push_back({W-1, y});\\n nxt.push_back({x, 0});\\n nxt.push_back({x, H-1});\\n\\n for(auto p : nxt){\\n int xx, yy;\\n tie(xx, yy) = p;\\n\\n if(xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\\n\\n //最短経路数問題の感じはこんな感じだねー覚えとかないとねー\\n if(c + 1 < dst[yy][xx]){\\n dst[yy][xx] = c + 1;\\n cnt[yy][xx] = cnt[y][x];\\n que.push({c + 1, yy * 1010 + xx});\\n }\\n else if(c+1 == dst[yy][xx]) cnt[yy][xx] += cnt[y][x];\\n }\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5308,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3042_3385923\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double Double;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n\\n\\nnamespace sub {\\n template<typename T>\\n constexpr typename std::enable_if<std::is_integral<T>::value, T>::type\\n inf_sub() {\\n return std::numeric_limits<T>::max() / 2 - 1000;\\n }\\n\\n template<typename T>\\n constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type\\n inf_sub() {\\n return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));\\n }\\n} // namespace sub\\n\\ntemplate<typename T>\\nconstexpr T inf() {\\n static_assert(std::is_arithmetic<T>::value, \\\"T must be arithmetic value\\\");\\n return sub::inf_sub<T>();\\n}\\n\\ntemplate<typename T>\\nconstexpr T zero() {\\n static_assert(std::is_arithmetic<T>::value, \\\"T must be arithmetic value\\\");\\n return T(0);\\n}\\n\\nconst long double pi = acos(-1.0);\\n\\ntemplate<class edge_t>\\nclass graph_t {\\n std::vector<std::vector<edge_t>> g;\\n\\npublic:\\n using reference = std::vector<edge_t> &;\\n using const_reference = const std::vector<edge_t> &;\\n using iterator = typename std::vector<edge_t>::iterator;\\n\\n graph_t() : g(0) { ; }\\n\\n graph_t(int n) : g(n) { ; }\\n\\n int size() const { return g.size(); }\\n\\n void push_back(const std::vector<edge_t> &es) { g.push_back(es); }\\n\\n reference operator[](int x) { return g[x]; }\\n\\n const_reference operator[](int x) const { return g[x]; }\\n\\n iterator &begin() { return begin(g); }\\n\\n iterator &end() { return end(g); }\\n};\\n\\ntemplate<typename edge_t, typename cost_type = typename edge_t::cost_type>\\nstd::vector<cost_type> dijkstra(const graph_t<edge_t> &g, int s) {\\n std::vector<cost_type> d(g.size(), inf<cost_type>());\\n d[s] = zero<cost_type>();\\n using P = std::pair<cost_type, int>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\\n que.push(P(zero<cost_type>(), s));\\n while (!que.empty()) {\\n cost_type dist = que.top().first;\\n int v = que.top().second;\\n que.pop();\\n if (d[v] < dist) continue;\\n for (const auto &e : g[v]) {\\n if (d[e.to] <= d[v] + e.cost) continue;\\n d[e.to] = d[v] + e.cost;\\n que.push(P(d[e.to], e.to));\\n }\\n }\\n return d;\\n}\\n\\n\\ntemplate<typename Cost>\\nclass WeightedEdge {\\npublic:\\n using cost_type = Cost;\\n int to;\\n cost_type cost;\\n\\n WeightedEdge(int, int t, cost_type c) : to(t), cost(c) { ; }\\n};\\n\\ntemplate<typename Cost> using WeightedGraph = graph_t<WeightedEdge<Cost>>;\\n\\ntemplate<typename Cost>\\nvoid add_edge(WeightedGraph<Cost> &g, int from, int to, Cost cost) {\\n g[from].emplace_back(from, to, cost);\\n}\\n\\nint main() {\\n int R, C, r1, c1, r2, c2;\\n cin >> R >> C >> r1 >> c1 >> r2 >> c2;\\n\\n WeightedGraph<int> g(R * C);\\n auto id = [&](int r, int c) {\\n return r * C + c;\\n };\\n auto valid = [&](int r, int c) {\\n return r >= 0 && r < R && c >= 0 && c < C;\\n };\\n\\n int dr[] = {-1, 0, 1, 0};\\n for (int i = 0; i < R; i++) {\\n for (int j = 0; j < C; j++) {\\n for (int d = 0; d < 4; d++) {\\n int r = i + dr[d];\\n int c = j + dr[(d + 1) % 4];\\n if (valid(r, c)) {\\n add_edge(g, id(i, j), id(r, c), 1);\\n }\\n }\\n add_edge(g, id(i, j), id(0, j), 1);\\n add_edge(g, id(i, j), id(i, 0), 1);\\n add_edge(g, id(i, j), id(R - 1, j), 1);\\n add_edge(g, id(i, j), id(i, C - 1), 1);\\n }\\n }\\n auto costs = dijkstra(g, id(r1, c1));\\n vector<pair<int,int>> ws;\\n for(int i = 0 ; i < costs.size() ; i++){\\n ws.push_back({costs[i], i});\\n }\\n sort(ws.begin(), ws.end());\\n vector<int> dp(R * C);\\n dp[id(r1, c1)] = 1;\\n for( auto I : ws ){\\n int i = I.second;\\n for(auto j : g[i]){\\n if( j.cost + costs[i] == costs[j.to]) {\\n dp[j.to] += dp[i];\\n dp[j.to] %= 1000000007;\\n }\\n }\\n }\\n cout << costs[id(r2, c2)] << \\\" \\\" << dp[id(r2, c2)] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 24244,\n \"score_of_the_acc\": -0.2824,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3042_3224224\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 505\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col,ll arg_count){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tcount = arg_count;\\n\\t}\\n\\tint row,col;\\n\\tll count;\\n};\\n\\nstruct Data{\\n\\tData(){\\n\\t\\trow = col = 0;\\n\\t\\tsum_cost = 0;\\n\\t}\\n\\n\\tData(int arg_row,int arg_col,int arg_sum_cost){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tll row,col,sum_cost;\\n};\\n\\nint H,W;\\nint start_row,start_col,goal_row,goal_col;\\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\\nll dp[NUM][NUM];\\nll min_cost[NUM][NUM];\\n\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\\n\\t\\treturn true;\\n\\t}else{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nint find(vector<Info> V,int row,int col){\\n\\n int\\tret = -1;\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\tif(V[i].row == row && V[i].col == col){\\n\\t\\t\\treturn i;\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\tscanf(\\\"%d %d %d %d\\\",&start_row,&start_col,&goal_row,&goal_col);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tmin_cost[row][col] = HUGE_NUM; //そのマスに到達する際の最小コスト\\n\\t\\t\\tdp[row][col] = 0; //そのマスに到達する経路の総数\\n\\t\\t}\\n\\t}\\n\\n\\tmin_cost[start_row][start_col] = 0;\\n\\tdp[start_row][start_col] = 1;\\n\\n\\tqueue<Data> Q;\\n\\tQ.push(Data(start_row,start_col,0));\\n\\n\\tData data;\\n\\tint adj_row,adj_col,tmp_index;\\n\\tvector<Info> V;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tdata = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\t//今回のマスから行けるマスと、そこへの経路数を数える\\n\\t\\tV.clear();\\n\\n\\t\\t//まずは上下左右\\n\\t\\tfor(int i = 0; i < 4; i++){\\n\\n\\t\\t\\tadj_row = data.row+diff_row[i];\\n\\t\\t\\tadj_col = data.col+diff_col[i];\\n\\n\\t\\t\\tif(!rangeCheck(adj_row,adj_col))continue;\\n\\n\\t\\t\\tV.push_back(Info(adj_row,adj_col,1));\\n\\t\\t}\\n\\n\\t\\t//行の左端(今左端にいるなら、コストがかかるだけ移動は無駄)\\n\\t\\tif(data.col != 0){\\n\\n\\t\\t\\ttmp_index = find(V,data.row,0);\\n\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\tV.push_back(Info(data.row,0,1));\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV[tmp_index].count++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//行の右端\\n\\t\\tif(data.col != W-1){\\n\\n\\t\\t\\ttmp_index = find(V,data.row,W-1);\\n\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\tV.push_back(Info(data.row,W-1,1));\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV[tmp_index].count++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//列の上端\\n\\t\\tif(data.row != 0){\\n\\n\\t\\t\\ttmp_index = find(V,0,data.col);\\n\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\tV.push_back(Info(0,data.col,1));\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV[tmp_index].count++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//列の下端\\n\\t\\tif(data.row != H-1){\\n\\n\\t\\t\\ttmp_index = find(V,H-1,data.col);\\n\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\tV.push_back(Info(H-1,data.col,1));\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tV[tmp_index].count++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < V.size(); i++){\\n\\n\\t\\t\\tif(min_cost[V[i].row][V[i].col] > data.sum_cost+1){ //最小値を更新する場合\\n\\n\\t\\t\\t\\tmin_cost[V[i].row][V[i].col] = data.sum_cost+1;\\n\\t\\t\\t\\tdp[V[i].row][V[i].col] = dp[data.row][data.col]*V[i].count;\\n\\t\\t\\t\\tdp[V[i].row][V[i].col] %= MOD;\\n\\t\\t\\t\\tQ.push(Data(V[i].row,V[i].col,data.sum_cost+1));\\n\\n\\t\\t\\t}else if(min_cost[V[i].row][V[i].col] == data.sum_cost+1){ //同点で最小値の場合\\n\\n\\t\\t\\t\\tdp[V[i].row][V[i].col] += dp[data.row][data.col]*V[i].count;\\n\\t\\t\\t\\tdp[V[i].row][V[i].col] %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld %lld\\\\n\\\",min_cost[goal_row][goal_col],dp[goal_row][goal_col]);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7032,\n \"score_of_the_acc\": -0.0441,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3042_3160018\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\nusing namespace std;\\n \\n#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)\\n#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)\\n#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)\\n#define debug(...) fprintf(stderr, __VA_ARGS__)\\n#define int long long int\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst ll INF = 1001001001001001LL;\\nconst ll MOD = 1000000007LL;\\n \\npair<int, int> dp[510][510];\\nconst pair<int, int> INFII(INF, -1);\\n \\nvoid update(pair<int, int> &A, pair<int, int> B) {\\n B.first = B.first + 1;\\n if(A.first > B.first) A = B;\\n else if(A.first == B.first) {\\n (A.second += B.second) %= MOD;\\n }\\n}\\n \\nstruct Elem {\\n int x, y, ans, cnt;\\n};\\n \\nsigned main() {\\n int R, C, sx, sy, tx, ty; cin >> R >> C >> sx >> sy >> tx >> ty;\\n fill(dp[0], dp[R], INFII);\\n dp[sx][sy] = make_pair(0, 1);\\n \\n queue<Elem> que;\\n que.push(Elem{sx, sy, 0, 1});\\n \\n const int ex[] = {-1, 0, -1, R-1};\\n const int ey[] = {0, -1, C-1, -1};\\n for(int step=0; step<R+C; step++) {\\n set< pair<int, int> > checked;\\n while(que.size()) {\\n Elem cur = que.front(); que.pop();\\n // 隣接\\n for(int k=0; k<4; k++) {\\n int nx = cur.x + dx[k], ny = cur.y + dy[k];\\n if(nx < 0 || ny < 0 || nx >= R || ny >= C) continue;\\n if(dp[nx][ny].first < dp[cur.x][cur.y].first + 1) continue;\\n update(dp[nx][ny], dp[cur.x][cur.y]);\\n checked.insert(make_pair(nx, ny));\\n }\\n \\n // テレポート\\n for(int k=0; k<4; k++) {\\n int nx = (ex[k] < 0 ? cur.x : ex[k]);\\n int ny = (ey[k] < 0 ? cur.y : ey[k]);\\n if(dp[nx][ny].first < dp[cur.x][cur.y].first + 1) continue;\\n update(dp[nx][ny], dp[cur.x][cur.y]);\\n checked.insert(make_pair(nx, ny));\\n }\\n }\\n \\n for(auto x : checked) {\\n int nx, ny; tie(nx, ny) = x;\\n int vl, vr; tie(vl, vr) = dp[nx][ny];\\n que.push(Elem{nx, ny, vl, vr});\\n }\\n }\\n \\n int ans1, ans2;\\n tie(ans1, ans2) = dp[tx][ty];\\n printf(\\\"%lld %lld\\\\n\\\", ans1, ans2);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7120,\n \"score_of_the_acc\": -0.0443,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3042_3153314\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\nll dp[600][600];\\nint dist[600][600];\\n\\nint main(){\\n int w, h, sx, sy, gx, gy;\\n\\n cin >> w >> h >> sx >> sy >> gx >> gy;\\n\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n dist[i][j] = INF;\\n\\n queue<pair<pair<int,int>,pair<int,int> > > q1;\\n\\n q1.push({{sy, sx}, {h, w}});\\n dp[h][w] = 1;\\n \\n for(int i=0;q1.size();i++){\\n queue<pair<pair<int,int>,pair<int,int> > > q2;\\n\\n while(q1.size()){\\n auto p = q1.front(); q1.pop();\\n int y = p.first.first;\\n int x = p.first.second;\\n ll cost = dp[p.second.first][p.second.second];\\n\\n if(y < 0 || h <= y || x < 0 || w <= x) continue;\\n if(dist[y][x] < i) continue;\\n \\n if(dist[y][x] == i){\\n dp[y][x] = (dp[y][x] + cost)%mod;\\n continue;\\n }\\n\\n dp[y][x] = cost;\\n dist[y][x] = i;\\n\\n int dx[8] = {0,0,1,-1,1,1,-1,-1};\\n int dy[8] = {1,-1,0,0,1,-1,1,-1};\\n for(int i=0;i<4;i++){\\n q2.push({{y+dy[i], x+dx[i]},{y,x}});\\n }\\n q2.push({{0,x},{y,x}});\\n q2.push({{y,0},{y,x}});\\n q2.push({{h-1,x},{y,x}});\\n q2.push({{y,w-1},{y,x}});\\n }\\n\\n q1 = q2;\\n }\\n\\n cout << dist[gy][gx] << \\\" \\\" << dp[gy][gx] << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6380,\n \"score_of_the_acc\": -0.0426,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3042_3149583\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\ntemplate<int MOD> struct ModInt {\\n static const int Mod = MOD; unsigned x; ModInt() : x(0) { }\\n ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\\n ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }\\n int get() const { return (int)x; }\\n ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\\n ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\\n ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }\\n ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }\\n ModInt operator+(ModInt that) const { return ModInt(*this) += that; }\\n ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }\\n ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }\\n ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }\\n ModInt inverse() const {\\n long long a = x, b = MOD, u = 1, v = 0;\\n while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }\\n return ModInt(u);\\n }\\n bool operator==(ModInt that) const { return x == that.x; }\\n bool operator!=(ModInt that) const { return x != that.x; }\\n ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }\\n};\\ntemplate<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };\\ntemplate<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {\\n ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;\\n}\\ntypedef ModInt<1000000007> mint;\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\nint W, H, ax, ay, bx, by;\\nint dst[505][505], vis[505][505]; mint dp[505][505];\\nint dx[4] = { 0, 1, 0, -1 }, dy[4] = { -1, 0, 1, 0 };\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> W >> H >> ax >> ay >> bx >> by;\\n\\n rep(y, 0, H) rep(x, 0, W) dst[y][x] = inf;\\n min_priority_queue<pair<int, int>> que;\\n\\n dst[ay][ax] = 0;\\n dp[ay][ax] = 1;\\n que.push({ 0, ay * 1010 + ax });\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n int x = q.second % 1010;\\n int y = q.second / 1010;\\n int c = q.first;\\n\\n if (vis[y][x]) continue;\\n vis[y][x] = 1;\\n\\n if (y == by and x == bx) {\\n cout << c << \\\" \\\" << dp[y][x] << endl;\\n return;\\n }\\n\\n vector<pair<int, int>> nxt;\\n rep(d, 0, 4) nxt.push_back({ x + dx[d], y + dy[d] });\\n nxt.push_back({ 0, y });\\n nxt.push_back({ W - 1, y });\\n nxt.push_back({ x, 0 });\\n nxt.push_back({ x, H - 1 });\\n\\n fore(p, nxt) {\\n int xx, yy;\\n tie(xx, yy) = p;\\n\\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\\n\\n if (c + 1 < dst[yy][xx]) {\\n dst[yy][xx] = c + 1;\\n dp[yy][xx] = dp[y][x];\\n que.push({ c + 1, yy * 1010 + xx });\\n }\\n else if (c + 1 == dst[yy][xx]) dp[yy][xx] += dp[y][x];\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5372,\n \"score_of_the_acc\": -0.0404,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3042_3146105\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/*\\n <url:https://onlinejudge.u-aizu.ac.jp/services/room.html#ACPC2018Day2/problems/D>\\n 問題文============================================================\\n =================================================================\\n 解説=============================================================\\n ================================================================\\n */\\n\\nconst ll MOD = 1e9+7;\\nint d[4] = {1,0,-1,0};\\nstruct edge{\\n ll x,y,dist,sum;\\n edge(ll x = 0,ll y = 0,ll dist = 0,ll sum = 0)\\n :x(x),y(y),dist(dist),sum(sum){}\\n bool operator < (const edge& e) const{\\n return this->dist < e.dist;\\n }\\n bool operator > (const edge& e) const{\\n return this->dist > e.dist;\\n }\\n\\n};\\nvector<ll> solve(){\\n vector<ll> res;\\n ll R,C,ai,aj,bi,bj;\\n cin >> R >> C >> ai >> aj >> bi >> bj;\\n vector<vector<pll>> dist(R,vector<pll>(C,{LINF,0}));\\n priority_queue<edge,vector<edge>,greater<edge>> pq;\\n pq.push(edge(ai,aj,0,1));\\n dist[ai][aj] = {0,1};\\n while(pq.size()){\\n edge state = pq.top(); pq.pop();\\n state.sum = dist[state.x][state.y].second;\\n for(int k = 0; k < 4;k++){\\n ll nx = state.x + d[k];\\n ll ny = state.y + d[k^1];\\n \\n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\\n if(dist[nx][ny].first > state.dist + 1){\\n dist[nx][ny] = {state.dist+1,state.sum};\\n pq.push(edge(nx,ny,state.dist+1,state.sum));\\n }else if(dist[nx][ny].first == state.dist + 1){\\n (dist[nx][ny].second += state.sum)%=MOD;\\n }\\n }\\n {\\n ll nx = state.x; ll ny = 0;\\n \\n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\\n if(dist[nx][ny].first > state.dist + 1){\\n dist[nx][ny] = {state.dist+1,state.sum};\\n pq.push(edge(nx,ny,state.dist+1,state.sum));\\n }else if(dist[nx][ny].first == state.dist + 1){\\n (dist[nx][ny].second += state.sum)%=MOD;\\n }\\n }\\n {\\n ll nx = state.x; ll ny = C-1;\\n \\n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\\n if(dist[nx][ny].first > state.dist + 1){\\n dist[nx][ny] = {state.dist+1,state.sum};\\n pq.push(edge(nx,ny,state.dist+1,state.sum));\\n }else if(dist[nx][ny].first == state.dist + 1){\\n (dist[nx][ny].second += state.sum)%=MOD;\\n }\\n }\\n {\\n ll nx = 0; ll ny = state.y;\\n \\n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\\n if(dist[nx][ny].first > state.dist + 1){\\n dist[nx][ny] = {state.dist+1,state.sum};\\n pq.push(edge(nx,ny,state.dist+1,state.sum));\\n }else if(dist[nx][ny].first == state.dist + 1){\\n (dist[nx][ny].second += state.sum)%=MOD;\\n }\\n }\\n {\\n ll nx = R-1; ll ny = state.y;\\n \\n if(nx < 0 || nx >= R || ny < 0 || ny >= C) continue;\\n if(dist[nx][ny].first > state.dist + 1){\\n dist[nx][ny] = {state.dist+1,state.sum};\\n pq.push(edge(nx,ny,state.dist+1,state.sum));\\n } else if(dist[nx][ny].first == state.dist + 1){\\n (dist[nx][ny].second += state.sum)%=MOD;\\n }\\n }\\n }\\n \\n res = vector<ll>{dist[bi][bj].first,dist[bi][bj].second};\\n return res;\\n}\\nint main(void) {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n cout << solve() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5956,\n \"score_of_the_acc\": -0.0017,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3042_3145166\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nint h,w,ax,ay,bx,by;\\nvector<int> G[500*500+1];\\nint px[]={0,1,0,-1};\\nint py[]={1,0,-1,0};\\nlong long int mod=1e9+7;\\nint comb(int x,int y){\\n int ans=x+y*w;\\n return ans;\\n}\\n\\ntypedef pair<int, int> P;\\nvector<pair<int,long long int> > dist(500*500+1,make_pair(1e9,0));\\n\\nvoid dijkstra(long long int s){\\n priority_queue<P,vector<P>,greater<P> > que;\\n dist[s]=make_pair(0,1);\\n que.push(P(0,s));\\n while(!que.empty()){\\n P p=que.top();\\n que.pop();\\n long long int v=p.second;\\n long long int d=p.first;\\n if(dist[v].first<d)continue;\\n for(int i=0;i<G[v].size();i++){\\n long long int d2=d+1;\\n if(dist[G[v][i]].first>d2){\\n dist[G[v][i]].first=d2;\\n dist[G[v][i]].second=dist[v].second;\\n dist[G[v][i]].second%mod;\\n que.push(P(dist[G[v][i]].first,G[v][i]));\\n }else if(dist[G[v][i]].first==d2){\\n dist[G[v][i]].second+=dist[v].second;\\n dist[G[v][i]].second%=mod;\\n }\\n }\\n }\\n}\\n\\nint main(){\\n cin>>h>>w>>ay>>ax>>by>>bx;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n for(int k=0;k<4;k++){\\n int nx=j+px[k];\\n int ny=i+py[k];\\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\\n G[comb(j,i)].push_back(comb(nx,ny));\\n }\\n }\\n int nx=0;\\n int ny=i;\\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\\n G[comb(j,i)].push_back(comb(nx,ny));\\n }\\n nx=w-1;\\n ny=i;\\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\\n G[comb(j,i)].push_back(comb(nx,ny));\\n }\\n nx=j;\\n ny=0;\\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\\n G[comb(j,i)].push_back(comb(nx,ny));\\n }\\n nx=j;\\n ny=h-1;\\n if(nx>=0&&ny>=0&&nx<w&&ny<h){\\n G[comb(j,i)].push_back(comb(nx,ny));\\n }\\n }\\n }\\n dijkstra(comb(ax,ay));\\n //for(int i=0;i<h*w;i++)cout<<dist[i].first<<\\\" \\\"<<dist[i].second<<endl;\\n cout<<dist[comb(bx,by)].first<<\\\" \\\"<<dist[comb(bx,by)].second%mod<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 21312,\n \"score_of_the_acc\": -0.1959,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3042_3145113\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst int mod = 1000000007;\\n\\nint dx[] = {0, 1, 0, -1};\\nint dy[] = {1, 0, -1, 0};\\n\\nint main() {\\n int h, w, ai, aj, bi, bj;\\n cin >> h >> w >> ai >> aj >> bi >> bj;\\n\\n vector<vector<pair<ll, ll>>> r(h, vector<pair<ll, ll>>(w, {1e9, 0}));\\n\\n queue<pair<int, int>> q;\\n q.push({ai, aj});\\n r[ai][aj] = {0, 1};\\n while (!q.empty()) {\\n auto p = q.front();\\n q.pop();\\n\\n vector<pair<int, int>> next;\\n for (int i = 0; i < 4; i++) {\\n next.push_back({p.first + dy[i], p.second + dx[i]});\\n }\\n next.push_back({p.first, 0});\\n next.push_back({p.first, w - 1});\\n next.push_back({0, p.second});\\n next.push_back({h - 1, p.second});\\n\\n for (auto e : next) {\\n if (e == p || e.first < 0 || h <= e.first || e.second < 0 || w <= e.second) {\\n continue;\\n }\\n\\n if (r[p.first][p.second].first + 1 == r[e.first][e.second].first) {\\n r[e.first][e.second].second += r[p.first][p.second].second;\\n r[e.first][e.second].second %= mod;\\n } else if (r[p.first][p.second].first + 1 < r[e.first][e.second].first) {\\n r[e.first][e.second].first = r[p.first][p.second].first + 1;\\n r[e.first][e.second].second = r[p.first][p.second].second;\\n q.push(e);\\n }\\n }\\n }\\n\\n // for (auto ee : r) {\\n // for (auto e : ee) {\\n // cerr << e.first << \\\",\\\" << e.second << \\\" \\\";\\n // }\\n // cerr << endl;\\n // }\\n\\n cout << r[bi][bj].first << \\\" \\\" << r[bi][bj].second << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5728,\n \"score_of_the_acc\": -0.0411,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3042_3145067\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define range(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,b) for(int i = 0; i < (b); i++)\\n#define all(a) (a).begin(), (a).end()\\n#define show(x) cerr << #x << \\\" = \\\" << (x) << endl;\\nusing namespace std;\\n\\ntemplate<typename T>\\nostream& operator << (ostream& os, vector<T>& v){\\n\\trep(i,v.size()){ os << v[i] << (i == v.size() - 1 ? \\\"\\\" : \\\" \\\"); } return os;\\n}\\ntemplate<typename T>\\nistream& operator >> (istream& is, vector<T>& v){\\n\\tfor(T& x: v){ is >> x; } return is;\\n}\\n\\nconst int MAX = 510;\\nconst long long M = 1000000007;\\n\\nint r, c, ay, ax, by, bx;\\nint dis[MAX][MAX];\\nlong long cnt[MAX][MAX];\\n\\nstruct P{\\n\\tint y, x;\\n\\tint cost;\\n\\tP(int y, int x, int cost) : y(y), x(x), cost(cost) { }\\n\\tbool operator < ( const P &right ) const {\\n\\t\\treturn cost < right.cost;\\n\\t}\\n\\tbool operator > ( const P &right ) const {\\n\\t\\treturn cost > right.cost;\\n\\t}\\n};\\n\\nconst int dy[16] = { 0,-1, 0, 1, 1,-1, 1,-1, 0,-2, 0, 2};\\nconst int dx[16] = { 1, 0,-1, 0, 1, 1,-1,-1, 2, 0,-2, 0};\\n\\nint shortestPath(){\\n\\tpriority_queue<P, vector<P>, greater<P>> q;\\n\\tq.emplace(P(ay, ax, 0));\\n\\n\\twhile(not q.empty()){\\n\\t\\tP cur = q.top(); q.pop();\\n\\n\\t\\tif(dis[cur.y][cur.x] != INT_MAX) continue;\\n\\t\\tdis[cur.y][cur.x] = cur.cost;\\n\\n\\t\\tif(cur.y == by and cur.x == bx) continue;\\n\\n\\t\\t//cout << cur.y << ' ' << cur.x << endl;\\n\\t\\trep(d,4){ // 隣接\\n\\t\\t\\tint ny = cur.y + dy[d];\\n\\t\\t\\tint nx = cur.x + dx[d];\\n\\t\\t\\tif(ny < 0 || ny >= r || nx < 0 || nx >= c) continue;\\n\\t\\t\\tif(dis[ny][nx] <= cur.cost + 1) continue;\\n\\t\\t\\tq.emplace(ny, nx, cur.cost + 1);\\n\\t\\t}\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = cur.y, nx = cur.x;\\n\\t\\t\\tif(dy[d] == 1) ny = r - 1;\\n\\t\\t\\tif(dy[d] == -1) ny = 0;\\n\\n\\t\\t\\tif(dx[d] == 1) nx = c - 1;\\n\\t\\t\\tif(dx[d] == -1) nx = 0;\\n\\n\\t\\t\\tif(dis[ny][nx] <= cur.cost + 1) continue;\\n\\t\\t\\tq.emplace(ny, nx, cur.cost + 1);\\n\\t\\t}\\n\\t}\\n\\n\\t//rep(i,r){ rep(j,c){ cout << dis[i][j] << ' '; } cout << endl; }\\n\\t\\n\\treturn dis[by][bx];\\n}\\n\\nlong long solve(){\\n\\tpriority_queue<P, vector<P>, greater<P>> q;\\n\\tq.emplace(P(ay, ax, 0));\\n\\n\\tcnt[ay][ax] = 1;\\n\\n\\tbool used[MAX][MAX] = {};\\n\\twhile(not q.empty()){\\n\\t\\tP cur = q.top(); q.pop();\\n\\n\\t\\tif(cur.y == by and cur.x == bx) continue;\\n\\t\\tif(used[cur.y][cur.x]) continue;\\n\\t\\tused[cur.y][cur.x] = true;\\n\\n\\t\\t//cout << \\\"cur \\\" << cur.y << ' ' << cur.x << endl;\\n\\n\\t\\trep(d,4){ // 隣接\\n\\t\\t\\tint ny = cur.y + dy[d];\\n\\t\\t\\tint nx = cur.x + dx[d];\\n\\t\\t\\tif(ny < 0 || ny >= r || nx < 0 || nx >= c) continue;\\n\\t\\t\\tif(dis[ny][nx] < cur.cost + 1) continue;\\n\\t\\t\\t//cout << dy[d] << ' ' << dx[d] << endl;\\n\\t\\t\\t//cout << ny << ' ' << nx << ' ' << cur.y << ' ' << cur.x << endl;\\n\\t\\t\\t(cnt[ny][nx] += cnt[cur.y][cur.x]) %= M;\\n\\t\\t\\tq.emplace(ny, nx, cur.cost + 1);\\n\\t\\t}\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = cur.y, nx = cur.x;\\n\\t\\t\\tif(dy[d] == 1) ny = r - 1;\\n\\t\\t\\tif(dy[d] == -1) ny = 0;\\n\\n\\t\\t\\tif(dx[d] == 1) nx = c - 1;\\n\\t\\t\\tif(dx[d] == -1) nx = 0;\\n\\n\\t\\t\\tif(dis[ny][nx] < cur.cost + 1) continue;\\n\\t\\t\\t//cout << ny << ' ' << nx << ' ' << cur.y << ' ' << cur.x << endl;\\n\\t\\t\\t(cnt[ny][nx] += cnt[cur.y][cur.x]) %= M;\\n\\t\\t\\tq.emplace(ny, nx, cur.cost + 1);\\n\\t\\t}\\n\\t}\\n\\t//rep(i,r){ rep(j,c){ cout << cnt[i][j] << ' '; } cout << endl; }\\n\\n\\treturn cnt[by][bx];\\n}\\n\\nint main(){\\n\\tcin >> r >> c >> ay >> ax >> by >> bx;\\n\\trep(i,MAX) rep(j,MAX) dis[i][j] = INT_MAX;\\n\\n\\tshortestPath();\\n\\tcout << shortestPath() << ' ' << solve() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6272,\n \"score_of_the_acc\": -0.1224,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3042_3145045\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\n#include<queue>\\n#include<string>\\n#include<stack>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cmath>\\n#include<cstring>\\n#include<cassert>\\n#include<ctime>\\n#include<algorithm>\\n#include<utility>\\n#include<map>\\n#include<set>\\n#include<vector>\\n#include<functional>\\n#include<complex>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned ui;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> i_i;\\ntypedef pair<ll,int> ll_i;\\ntypedef pair<ll,ll> ll_ll;\\ntypedef pair<double,int> d_i;\\ntypedef pair<double,double> d_d;\\ntypedef vector<int> vi;\\ntypedef vector<vector<int> > vii;\\n\\n#ifdef DEBUG\\n#define dprintf printf\\n#define dputs puts\\n#define dout(x) cout<<#x\\\" = \\\"<<(x)<<endl\\n#define darray(x,n) {int i;rep(i,n)cout<<#x\\\"[\\\"<<i<<\\\"] = \\\"<<*((x)+i)<<endl;}\\n#define dloop(i,s,g) for(int (i)=(s);(i)<(g);(i)++)\\n#define drep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define dstop() scanf(\\\"%*c\\\")\\n#else\\n#define dprintf (1)?0:printf\\n#define dputs (1)?0:puts\\n#define dout(x)\\n#define darray(x,n)\\n#define dloop(i,s,g) if(int i=0){}else\\n#define drep(i,n) if(int i=0){}else\\n#define dstop()\\n#endif\\n\\n#define F first\\n#define S second\\n#define pb push_back\\n#define mp make_pair\\n\\n#define loop(i,s,g) for((i)=(s);(i)<(g);(i)++)\\n#define rep(i,n) for((i)=0;(i)<(n);(i)++)\\n#define all(x) (x.begin(),x.end())\\n#define in(T,...) T __VA_ARGS__; impl(__VA_ARGS__)\\n#define array(T,id,n) T id[(n)]; for(int i=0;i<(n);i++)cin>>id[i]\\n#define putv(n) cout<<(n)<<endl\\n\\n//#define int long long\\n#ifndef int\\n#define INF __INT32_MAX__\\n#else\\n#define INF __INT64_MAX__\\n#endif\\n\\nvoid impl(){};\\ntemplate <typename T,typename... TS >\\nvoid impl(T &head,TS &... tail)\\n{\\n cin>>head;\\n impl(tail ...);\\n}\\n\\nll dp[600][600][600];\\n\\nsigned main(void)\\n{\\n bool judge=false;\\n int dx[4]={0,1,0,-1};\\n int dy[4]={1,0,-1,0};\\n int i,x,y;\\n ll mod = 1e9+7;\\n in(int,R,C,ai,aj,bi,bj);\\n dp[0][ai][aj]=1;\\n rep(i,520){\\n rep(x,R){\\n rep(y,C){\\n dp[i][x][y]%=mod;\\n int j;\\n rep(j,4){\\n if(0<=x+dx[j]&&x+dx[j]<R&&\\n 0<=y+dy[j]&&y+dy[j]<C){\\n dp[i+1][x+dx[j]][y+dy[j]]+=dp[i][x][y];\\n }\\n }\\n dp[i+1][0 ][y ]+=dp[i][x][y];\\n dp[i+1][R-1][y ]+=dp[i][x][y];\\n dp[i+1][x ][0 ]+=dp[i][x][y];\\n dp[i+1][x ][C-1]+=dp[i][x][y];\\n if(x==bi&&y==bj&&\\n dp[i][bi][bj]!=0){\\n judge=true;\\n }\\n }\\n }\\n if(judge)\\n break;\\n }\\n printf(\\\"%d %lld\\\\n\\\",i,dp[i][bi][bj]%mod);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 454036,\n \"score_of_the_acc\": -2,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3042_3145034\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nlong long di[4] = {0, -1, 0, 1};\\nlong long dj[4] = {1, 0, -1, 0};\\n//(R, C)\\n//(i, j)\\n//array[][]\\n\\n#define INF 1000000000000\\nconst long long MOD = 1000000007;\\n\\n// 🔴\\n// O(ElogE)\\n\\n// pq<pair> はfirstが大きい順に出てくるのですか？\\n// s:= 開始ノード v:= 頂点数 adjlist:= 隣接リスト (first:= コスト second:= 行先)\\nvector<long long> dijk(long long s, long long v, vector<vector<pair<long long, long long> > > &adjlist){\\n\\n priority_queue <pair<long long, long long> > wait;\\n vector<long long> result(v, INF);\\n\\n //スタート地点を追加\\n result[s] = 0;\\n wait.push(make_pair(0, s));\\n\\n //ダイクストラ本体\\n while(!wait.empty()){ //waitが空になるまで\\n\\n long long nowpoint = wait.top().second;\\n long long nowcost = -wait.top().first;\\n wait.pop();\\n\\n if(result[nowpoint] < nowcost) continue;\\n\\n //今いる頂点と隣接しているすべての頂点をなめる\\n for(long long i = 0; i < adjlist[nowpoint].size(); i++){\\n\\n long long nextpoint = adjlist[nowpoint][i].second;\\n long long nextcost = nowcost + adjlist[nowpoint][i].first;\\n //現時点より安く到達できそうであれば、結果を更新して優先度付きキューに格納\\n if(result[nextpoint] > nextcost){\\n result[nextpoint] = nextcost;\\n wait.push(make_pair(-nextcost, nextpoint));\\n }\\n }\\n }\\n \\n return result; //結果列を返す\\n}\\n\\nint main(){\\n\\n long long R, C, si, sj, gi, gj; cin >> R >> C >> si >> sj >> gi >> gj;\\n \\n vector<vector<long long> > MAP(R, vector<long long> (C));\\n long long n = 0; //頂点数\\n for(long long i = 0; i < R; i++){\\n for(long long j = 0; j < C; j++){\\n MAP[i][j] = n;\\n n++;\\n }\\n }\\n\\n vector<vector<pair<long long, long long> > > adj(n);\\n\\n for(long long i = 0; i < R; i++){\\n for(long long j = 0; j < C; j++){\\n\\n long long now = MAP[i][j];\\n \\n //上下左右\\n for(long long h = 0; h < 4; h++){\\n long long ni = i + di[h];\\n long long nj = j + dj[h];\\n if(ni < 0 || R <= ni || nj < 0 || C <= nj) continue;\\n\\n long long next = MAP[ni][nj];\\n adj[now].push_back({1, next});\\n }\\n\\n //特殊辺\\n long long next = MAP[i][0];\\n if(now != next) adj[now].push_back({1, next});\\n next = MAP[i][C - 1];\\n if(now != next) adj[now].push_back({1, next});\\n next = MAP[0][j];\\n if(now != next) adj[now].push_back({1, next});\\n next = MAP[R - 1][j];\\n if(now != next) adj[now].push_back({1, next}); \\n }\\n }\\n\\n vector<long long> result(n);\\n long long S = MAP[si][sj];\\n long long G = MAP[gi][gj];\\n result = dijk(S, n, adj);\\n //cout << result[G] << endl;\\n \\n\\n //辺削除\\n vector<bool> used(n, false);\\n vector<long long> dp(n, 0);\\n\\n dp[S] = 1;\\n used[S] = true;\\n queue<long long> q;\\n q.push(S);\\n\\n while(!q.empty()){\\n \\n long long now = q.front();\\n q.pop();\\n for(auto e : adj[now]){\\n\\n int next = e.second;\\n if(result[next] - result[now] != 1) continue;\\n dp[next] += dp[now];\\n dp[next] %= MOD;\\n if(!used[next]){\\n q.push(next);\\n used[next] = true;\\n }\\n }\\n }\\n\\n cout << result[G] << \\\" \\\" << dp[G] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 37208,\n \"score_of_the_acc\": -0.3113,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1886,"cells":{"group_id":{"kind":"string","value":"aoj_3045_cpp"},"problem_description":{"kind":"string","value":"Problem G: Painting\nProblem\n長さ$N$の数列$X$が与えられる。初期状態では$X$の要素は全て$0$である。加えて、$M$個の整数のペア$(A_i, B_i)$が与えられる。各ペアに対し以下の操作を行い、最終的な数列$X$を出力せよ。\n整数$j$ $(1 \\le j \\le N)$に対し、$(A_i+j)$を$B_i$で割った余りを$X_j$に加える。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$\n$A_1$ $B_1$\n$A_2$ $B_2$\n:\n$A_M$ $B_M$\n$1$行目に、与えられる数列の要素数$N$、ペアの数$M$が空白区切りで与えられる。\n続く$M$行に、$i$番目のペア$(A_i, B_i)$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N, M \\le 10^5$\n$0 \\le A_i < B_i \\le 10^9 (1 \\le i \\le M)$\n与えられる入力は全て整数である\nOutput\n操作後の数列を$N$行で出力せよ。$j$行目に$X_j$を出力せよ。\nSample Input 1\n5 3\n1 4\n3 7\n0 1000\nSample Output 1\n7\n10\n9\n5\n8\nSample Input 2\n14 12\n1 4\n2 3\n0 5\n1 4\n1 2\n0 8\n0 2\n0 10\n0 1\n0 8\n3 10\n1 10\nSample Output 2\n15\n24\n25\n31\n35\n44\n32\n25\n24\n15\n16\n25\n31\n40"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3045_6012364","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\n#include <map>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<ll,ll> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\n\nconst int MX = 1000010;\nint _r() {\n int x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\n \nmap<pil,ll> cnt;\nint n,m;\nll sum;\nvoid Init() {\n cnt.clear();\n n=_r();\n m=_r();\n pil now;\n for(int i=0;i<m;i++){\n now.first=_r(),now.second=_r();\n sum+=now.first;\n cnt[now]++;\n }\n}\nll ans[MX]={0};\nvoid solve() {\n for(auto it : cnt){\n pil now=it.first;\n for(int i=now.second-now.first;i<=n;i+=now.second){\n ans[i]-=now.second*cnt[now];\n }\n }\n for(int i=1;i<=n;i++){\n sum+=ans[i]+m;\n printf(\"%lld\\n\",sum);\n }\n}\nint main() {\n //freopen(\"data.in\", \"r\", stdin);\n //freopen(\"data.out\", \"w\", stdout);\n int t = 1;\n while (t--) {\n Init();\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":10152,"score_of_the_acc":-0.9396,"final_rank":10},{"submission_id":"aoj_3045_6012361","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\n#include <map>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<ll,ll> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\n\nconst int MX = 1000010;\nint _r() {\n int x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\n \nmap<pil,ll> cnt;\nint n,m;\nint sum;\nvoid Init() {\n cnt.clear();\n n=_r();\n m=_r();\n pil now;\n for(int i=0;i<m;i++){\n now.first=_r(),now.second=_r();\n sum+=now.first;\n cnt[now]++;\n }\n}\nll ans[MX]={0};\nvoid solve() {\n for(auto it : cnt){\n pil now=it.first;\n for(int i=now.second-now.first;i<=n;i+=now.second){\n ans[i]-=now.second*cnt[now];\n }\n }\n for(int i=1;i<=n;i++){\n sum+=ans[i]+m;\n printf(\"%lld\\n\",sum);\n }\n}\nint main() {\n //freopen(\"data.in\", \"r\", stdin);\n //freopen(\"data.out\", \"w\", stdout);\n int t = 1;\n while (t--) {\n Init();\n solve();\n }\n return 0;\n}","accuracy":0.3384615384615385,"time_ms":20,"memory_kb":10148,"score_of_the_acc":-0.8611,"final_rank":20},{"submission_id":"aoj_3045_4322604","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\n\nint main() {\n int n, m; cin >> n >> m;\n map<pair<int, int>, int> mp;\n for (int i = 0; i < m; i++) {\n int a, b; cin >> a >> b;\n mp[{a, b}]++;\n }\n vector<long long> imos(n, m);\n for (auto &p: mp) {\n long long a = p.first.first, b = p.first.second, c = p.second;\n imos[0] += a * c;\n for (int i = b - a - 1; i < n; i += b) imos[i] -= b * c;\n }\n for (int i = 0; i + 1 < n; i++) imos[i + 1] += imos[i];\n for (auto x: imos) cout << x << endl;\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":9668,"score_of_the_acc":-0.8907,"final_rank":9},{"submission_id":"aoj_3045_3799931","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <climits>\n#include <iomanip>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <tuple>\n#include <iostream>\n#include <deque>\n#include <array>\n#include <set>\n#include <functional>\n#include <memory>\n#include <stack>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <bitset>\n\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<std::vector<long long int>> lower(static_cast<int>(std::sqrt(n)) + 1);\n\tfor (auto i = 0; i < lower.size(); ++i) lower[i] = std::vector<long long int>(i + 1, 0);\n\tstd::vector<long long int> all(n, 0);\n\tfor (auto _i = 0; _i < m; ++_i) {\n\t\tint a, b; std::cin >> a >> b;\n\t\tif (b <= lower.size()) {\n\t\t\tfor (auto j = 0; j < b; ++j) {\n\t\t\t\tlower[b - 1][j] += (a + j + 1) % b;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tall[0] += a + 1;\n\t\t\tall[1] -= a;\n\t\t\tfor (auto j = b - a - 1; j < n; j += b) {\n\t\t\t\tall[j] -= b;\n\t\t\t\tif (j + 1 < n) all[j + 1] += b;\n\t\t\t}\n\t\t}\n\t}\n\tfor (auto i = 1; i < n; ++i) all[i] += all[i - 1];\n\tfor (auto i = 1; i < n; ++i) all[i] += all[i - 1];\n\tfor (auto i = 0; i < n; ++i) {\n\t\tlong long int sum = 0LL;\n\t\tfor (const auto& l : lower) sum += l[i % l.size()];\n\t\tstd::cout << all[i] + sum << '\\n';\n\t}\n}","accuracy":1,"time_ms":280,"memory_kb":3888,"score_of_the_acc":-0.2295,"final_rank":2},{"submission_id":"aoj_3045_3668504","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define REP(i,n) for(ll i =0;i<n;++i)\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> a(m),b(m);\n REP(i,m)cin>>a[i]>>b[i];\n int k=200;\n vector<vector<ll>> cnt(k);\n REP(i,k)cnt[i].resize(i);\n vector<ll> sum(n);\n REP(i,m){\n if(b[i]>=k){\n int pos=b[i]-a[i]-1;\n while(pos<n){\n sum[pos]+=b[i];\n pos+=b[i];\n }\n }else{\n cnt[b[i]][(b[i]-a[i]%b[i])%b[i]]+=b[i];\n }\n }\n ll ans=0;\n REP(i,m)ans+=(a[i]+1)%b[i];\n cout<<ans<<endl;\n for(int j=1;j<n;++j){\n ans+=m;\n for(int i=1;i<k;++i){\n ans-=cnt[i][(j+1)%i];\n }\n ans-=sum[j];\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":180,"memory_kb":4432,"score_of_the_acc":-0.2295,"final_rank":1},{"submission_id":"aoj_3045_3668490","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\n#define REP(i,n) for(ll i =0;i<n;++i)\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> a(m),b(m);\n REP(i,m)cin>>a[i]>>b[i];\n int k=200;\n vector<vector<ll>> cnt(k);\n REP(i,k)cnt[i].resize(i);\n vector<ll> sum(n);\n REP(i,m){\n if(b[i]>=k){\n int pos=b[i]-a[i];\n while(pos<n){\n sum[pos]+=b[i];\n pos+=b[i];\n }\n }else{\n cnt[b[i]][(b[i]-a[i]%b[i])%b[i]]+=b[i];\n }\n }\n ll ans=0;\n REP(i,m)ans+=(a[i]+1)%b[i];\n cout<<ans<<endl;\n for(int j=1;j<n;++j){\n ans+=m;\n for(int i=1;i<k;++i){\n ans-=cnt[i][(j+1)%i];\n }\n ans-=sum[j];\n cout<<ans<<endl;\n }\n}","accuracy":0.3384615384615385,"time_ms":150,"memory_kb":4248,"score_of_the_acc":-0.1843,"final_rank":16},{"submission_id":"aoj_3045_3386097","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct Item {\n int A;\n int B;\n int count;\n int time;\n\n int diff() const {\n return B - A;\n }\n\n bool operator<(const Item &rhs) const {\n return time > rhs.time;\n }\n};\n\npriority_queue<Item> Q;\n\nint geta = 0;\n\nvoid add(int A, int B, int count, int time) {\n Q.push({A, B, count, time});\n}\n\n\nlong long update(int time) {\n long long dec_sum = 0;\n while (Q.size()) {\n auto q = Q.top();\n if (q.time > time) {\n break;\n }\n Q.pop();\n add(q.A, q.B, q.count, time + q.B);\n dec_sum += 1ll * q.B * q.count;\n }\n\n return dec_sum;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n\n map<pair<int, int>, int> counter;\n long long sum = 0;\n int cnt = 0;\n for (int i = 0; i < M; i++) {\n int A, B;\n cin >> A >> B;\n if (B > 1) {\n counter[{A, B}]++;\n sum += A % B;\n cnt++;\n }\n }\n for (auto i : counter) {\n add(i.first.first, i.first.second, i.second, i.first.second - i.first.first - 1);\n }\n\n for (int i = 0; i < N; i++) {\n sum += cnt;\n sum -= update(i);\n cout << sum << endl;\n }\n\n\n}","accuracy":1,"time_ms":800,"memory_kb":11164,"score_of_the_acc":-1.5467,"final_rank":14},{"submission_id":"aoj_3045_3239932","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100005\n\nll N,M;\nll diff[NUM];\n\nint main(){\n\n\tscanf(\"%lld %lld\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tdiff[i] = 0;\n\t}\n\n\tint loc;\n\tll A,B;\n\tll sum_ADD = M;\n\n\tfor(int loop = 0; loop < M; loop++){\n\n\t\tscanf(\"%lld %lld\",&A,&B);\n\t\tsum_ADD += A;\n\n\t\tloc = B-A-1;\n\n\t\twhile(loc < N){\n\n\t\t\tdiff[loc] -= B;\n\t\t\tloc += B;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdiff[i] += diff[i-1];\n\t}\n\n\tfor(ll i = 0; i < N; i++){\n\n\t\tprintf(\"%lld\\n\",sum_ADD+diff[i]+i*M);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":1300,"memory_kb":3960,"score_of_the_acc":-0.9623,"final_rank":11},{"submission_id":"aoj_3045_3239931","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100005\n\nint N,M;\nll diff[NUM];\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tdiff[i] = 0;\n\t}\n\n\tint loc;\n\tll A,B;\n\tll sum_ADD = M;\n\n\tfor(int loop = 0; loop < M; loop++){\n\n\t\tscanf(\"%lld %lld\",&A,&B);\n\t\tsum_ADD += A;\n\n\t\tloc = B-A-1;\n\n\t\twhile(loc < N){\n\n\t\t\tdiff[loc] -= B;\n\t\t\tloc += B;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdiff[i] += diff[i-1];\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tprintf(\"%lld\\n\",sum_ADD+diff[i]+i*M);\n\t}\n\n\treturn 0;\n}","accuracy":0.3384615384615385,"time_ms":10,"memory_kb":3760,"score_of_the_acc":-0.0214,"final_rank":15},{"submission_id":"aoj_3045_3215882","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\n\ntypedef vector<pair<long long int,long long int>> DP;\n\nDP connect(const DP&l, const DP&r) {\n\tDP k(l.size()+r.size()-1,make_pair(1e18,1e18));\n\tfor (int i = 0; i < l.size(); ++i) {\n\t\tfor (int j = 0; j < r.size(); ++j) {\n\t\t\tauto x = make_pair(l[i].first + r[j].first, l[i].second + r[j].second);\n\n\t\t\tk[i + j] = min(k[i + j], x);\n\n\t\t}\n\t}\n\treturn k;\n}\nDP dfs(const int now, const int from,\n\tconst vector<vector<int>>&edges,vector<int>&overs) {\n\n\tlong long int over_num=overs[now];\n\tDP v(2);\n\tv[0]=make_pair(over_num,0);\n\tv[1]=make_pair(over_num-1,0);\n\n\tvector<vector<pair<long long int,long long int>>>ps;\n\tfor (auto e : edges[now]) {\n\t\tif(e==from)continue;\n\t\tps.push_back(dfs(e,now,edges,overs));\n\t}\n\tsort(ps.begin(), ps.end(), [](const vector < pair<long long int, long long int>>&l, const vector<pair<long long int, long long int>>&r) {\n\t\treturn l.size()<r.size();\n\t});\n\tfor (auto p : ps) {\n\t\tv=connect(v,p);\n\t}\n\tfor (auto &k : v) {\n\t\tk.second+=abs(k.first);\n\t}\n\treturn v;\n}\nint main() {\n\tint N,M;cin>>N>>M;\n\n\tint K=sqrt(N);\n\tlong long int sum=0;\n\tlong long int zero_ans=0;\n\tvector<long long int>sas(N);\n\n\tvector<vector<long long int>>nums;\n\tfor (int i = 0; i < K; ++i) {\n\t\tnums.push_back(vector<long long int>(i,0));\n\t}\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a,b;cin>>a>>b;\n\t\ta=(a+1)%b;\n\t\tif (K > b) {\n\t\t\tnums[b][a]++;\n\t\t}\n\t\telse {\n\t\t\tsum++;\n\t\t\tzero_ans+=a;\n\t\t\tfor (int j = b - a; j < N; j += b) {\n\t\t\t\tsas[j]-=b;\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<long long int>anss(N);\n\n\tlong long int pre=zero_ans;\n\tlong long int small_sum = 0;\n\tlong long int small_cnt = 0;\n\tfor (int j = 1; j < K; ++j) {\n\t\tfor (int k = 0; k < j; ++k) {\n\t\t\tsmall_sum += nums[j][k] * k;\n\t\t\tsmall_cnt += nums[j][k];\n\t\t}\n\t}\n\t{\n\t\tanss[0]+=zero_ans;\n\t\tanss[0]+=small_sum;\n\t}\n\tlong long int small_pre=small_sum;\n\n\tfor (int i = 1; i < N; ++i) {\n\t\tpre+=sum;\n\t\tpre+=sas[i];\n\t\tanss[i]=pre;\n\n\t\tsmall_sum+=small_cnt;\n\t\tfor (long long int j = 1; j < K; ++j) {\n\t\t\tsmall_sum-=j*nums[j][(1000000*j-i)%j];\n\t\t}\n\t\tanss[i]+=small_sum;\n\t}\n\tfor(auto ans:anss)cout<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":4676,"score_of_the_acc":-0.389,"final_rank":4},{"submission_id":"aoj_3045_3160014","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nll a[101010],cnt[500][500];\nint main(){\n ll n,m;\n cin>>n>>m;\n rep(i,m){\n ll x,y;\n cin>>x>>y;\n if(y<400)cnt[y][x]++;\n else {\n a[0]+=x+1;\n a[1]-=x;\n ll z=y-x-1;\n while(z<=n){\n a[z]-=y;\n a[z+1]+=y;\n z+=y;\n }\n }\n }\n rep(i,n)a[i+1]+=a[i]; \n rep(i,n)a[i+1]+=a[i];\n rep(i,400){\n if(i==0)continue;\n ll sum=0,num=0;\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\n rep(j,n){\n sum+=num;\n sum-=cnt[i][(n*i-j-1)%i]*i;\n a[j]+=sum;\n }\n }\n rep(i,n)cout<<a[i]<<endl; \n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":4228,"score_of_the_acc":-0.3661,"final_rank":3},{"submission_id":"aoj_3045_3160011","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nll a[101010],cnt[500][500];\nint main(){\n ll n,m;\n cin>>n>>m;\n rep(i,m){\n ll x,y;\n cin>>x>>y;\n if(y<400)cnt[y][x]++;\n else {\n a[0]+=(x+1)%y;\n a[1]-=a[0]-1;\n ll z=y-x;\n while(z<=n){\n a[z]-=y;\n a[z+1]+=y;\n z+=y;\n }\n }\n }\n rep(i,n)a[i+1]+=a[i]; \n rep(i,n)a[i+1]+=a[i];\n rep(i,400){\n if(i==0)continue;\n ll sum=0,num=0;\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\n rep(j,n){\n sum+=num;\n sum-=cnt[i][(n*i-j-1)%i]*i;\n a[j]+=sum;\n }\n }\n rep(i,n)cout<<a[i]<<endl; \n return 0;\n}","accuracy":0.3384615384615385,"time_ms":350,"memory_kb":3596,"score_of_the_acc":-0.2411,"final_rank":18},{"submission_id":"aoj_3045_3160009","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nll a[101010],cnt[500][500];\nint main(){\n ll n,m;\n cin>>n>>m;\n rep(i,m){\n ll x,y;\n cin>>x>>y;\n if(y<400)cnt[y][x]++;\n else {\n a[0]+=x+1;\n a[1]-=x;\n ll z=y-x;\n while(z<=n){\n a[z]-=y;\n a[z+1]+=y;\n z+=y;\n }\n }\n }\n rep(i,n)a[i+1]+=a[i]; \n rep(i,n)a[i+1]+=a[i];\n rep(i,400){\n if(i==0)continue;\n ll sum=0,num=0;\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\n rep(j,n){\n sum+=num;\n sum-=cnt[i][(n*i-j-1)%i]*i;\n a[j]+=sum;\n }\n }\n rep(i,n)cout<<a[i]<<endl; \n return 0;\n}","accuracy":0.3384615384615385,"time_ms":340,"memory_kb":3628,"score_of_the_acc":-0.2382,"final_rank":17},{"submission_id":"aoj_3045_3160007","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nll a[101010],cnt[500][500];\nint main(){\n ll n,m;\n cin>>n>>m;\n rep(i,m){\n ll x,y;\n cin>>x>>y;\n if(y<400)cnt[y][x]++;\n else {\n a[0]+=x+1;\n a[1]-=x;\n int z=y-x;\n while(z<=n){\n a[z]-=y;\n a[z+1]+=y;\n z+=y;\n }\n }\n }\n rep(i,n)a[i+1]+=a[i]; \n rep(i,n)a[i+1]+=a[i];\n rep(i,400){\n if(i==0)continue;\n ll sum=0,num=0;\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\n rep(j,n){\n sum+=num;\n sum-=cnt[i][(n*i-j-1)%i]*i;\n a[j]+=sum;\n }\n }\n rep(i,n)cout<<a[i]<<endl; \n return 0;\n}","accuracy":0.3384615384615385,"time_ms":340,"memory_kb":3700,"score_of_the_acc":-0.2476,"final_rank":19},{"submission_id":"aoj_3045_3160004","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst int DIV = 350;\n\nint N, M;\nvector<long long> A, B;\n\nint main() {\n cin >> N >> M;\n A.resize(M); B.resize(M);\n for (int i = 0; i < M; ++i) scanf(\"%lld %lld\", &A[i], &B[i]);\n\n vector<vector<long long> > sb(DIV, vector<long long>(DIV, 0));\n vector<long long> imos(N+1, 0);\n long long geta = 0;\n for (int i = 0; i < M; ++i) {\n if (B[i] < DIV) {\n for (int j = 0; j < B[i]; ++j) {\n long long q = (A[i] + j + 1) % B[i];\n sb[B[i]][j] += q;\n }\n }\n else {\n ++geta;\n imos[0] += A[i];\n imos[N] += -1 - (A[i]+N)%B[i];\n for (int q = B[i]-A[i]-1; q < N; q += B[i]) {\n imos[q] -= B[i];\n }\n }\n }\n for (int i = 0; i <= N; ++i) imos[i] += geta;\n for (int i = 0; i <= N; ++i) imos[i+1] += imos[i];\n \n vector<long long> res = imos;\n for (int b = 1; b < DIV; ++b) {\n for (int i = 0; i < N; ++i) {\n int r = i % b;\n res[i] += sb[b][r];\n }\n }\n \n for (int i = 0; i < N; ++i) printf(\"%lld\\n\", res[i]);\n}","accuracy":1,"time_ms":200,"memory_kb":6896,"score_of_the_acc":-0.5649,"final_rank":5},{"submission_id":"aoj_3045_3159234","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\nll sum[SIZE];\n\nint main(){\n int n, m;\n ll suma = 0;\n map<pair<int,int>,int> mm;\n \n scanf(\"%d%d\", &n,&m);\n\n for(int i=0;i<m;i++){\n int a, b;\n\n scanf(\"%d%d\", &a,&b);\n suma += a;\n mm[make_pair(a,b)]++;\n }\n \n for(auto it : mm){\n int a = it.first.first;\n int b = it.first.second;\n int c = it.second;\n \n for(int i=b-a;i<=n;i+=b){\n if(i) sum[i] -= (ll)c * b;\n }\n }\n\n for(int i=0;i<n;i++){\n suma += m + sum[i+1]; \n printf(\"%lld\\n\",suma);\n }\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":9820,"score_of_the_acc":-0.8325,"final_rank":7},{"submission_id":"aoj_3045_3153462","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\nusing T = tuple<Int,Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\ntemplate<class T>void prArr(T a,string s=\" \"){Int i=0;for(T t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\ntemplate<typename T>\nclass CumulativeSum{\npublic:\n int n;\n vector<T> sum;\n vector<T> A;\n int added;\n CumulativeSum():n(-1),added(0){}\n CumulativeSum(int n):n(n), sum(n+1), A(n+1),added(0){}\n CumulativeSum(const vector<T> &B):n(B.size()), sum(n+1), A(n+1),added(0){\n for(int i=1;i<=n;i++) sum[i] = sum[i-1] + B[i-1];\n }\n\n void apply(){\n for(int i=1;i<=n;i++) A[i] = A[i] + A[i-1];\n for(int i=1;i<=n;i++) A[i] = A[i] + A[i-1];\n for(int i=1;i<=n;i++) sum[i] = sum[i] + A[i-1];\n added = 0; A.clear(); A.resize(n+1);\n }\n\n //[l, r)にxを加算\n T add(int l, int r, T x){\n added = 1;\n assert(l <= r && 0 <= l && r <= n);\n A[l] = A[l] + x;\n A[r] = A[r] - x;\n }\n\n //[l, r)の和を得る\n T get(int l,int r){\n assert(l<=r && 0<=l && r<=n);\n if(added) apply();\n return sum[r] - sum[l];\n }\n};\n\nsigned main(){\n srand((unsigned)time(NULL));\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n Int N, M;\n cin>>N>>M;\n\n const Int limit = 500;\n CumulativeSum<Int> S(N+100);\n \n auto query1=[&](Int a, Int b){ //b >= limit\n assert(b >= limit);\n a %= b;\n Int l = 0, r = min(N, b - a - 1);\n S.add(l, l+1, a);\n S.add(l, r, 1);\n S.add(r, r+1, -(a+r));\n l = r + 1;\n r = min(N, r + b);\n a = 0;\n while(l < N){\n S.add(l, r, 1);\n S.add(r, r+1, -(r-l));\n l = r + 1;\n r = min(N, r + b);\n }\n };\n\n vector<vector<Int> > mem(limit, vector<Int>(limit, 0));\n auto query2=[&](Int a, Int b){ // b < limit\n assert(b < limit);\n a %= b;\n for(Int i=0;i<b;i++) mem[b][i] += (a+1 + i)%b;\n };\n \n for(Int i=0;i<M;i++){\n Int a, b;\n cin>>a>>b;\n (b >= limit)? query1(a, b):query2(a, b);\n }\n\n for(Int i=0;i<N;i++){\n Int ans = S.get(0, i+1);\n for(Int j=1;j<limit;j++) ans += mem[j][i%j];\n cout<<ans<<endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":640,"memory_kb":6280,"score_of_the_acc":-0.7967,"final_rank":6},{"submission_id":"aoj_3045_3152352","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//INSERT ABOVE HERE\nsigned main(){\n Int n,m;\n cin>>n>>m;\n vector<Int> a(m),b(m);\n for(Int i=0;i<m;i++) cin>>a[i]>>b[i];\n\n const Int BS = 400;\n vector<Int> x(n,0);\n vector<vector<Int> > p(BS,vector<Int>(BS,0));\n vector<Int> d(n,0);\n Int f=0;\n \n for(Int i=0;i<m;i++){\n if(b[i]<BS){\n for(Int j=0;j<b[i];j++)\n\tp[b[i]][j]+=(a[i]+j+1)%b[i];\n }else{\n f++;\n d[0]+=a[i];\n for(Int j=b[i]-(a[i]+1);j<n;j+=b[i])\n\td[j]+=-b[i];\n }\n }\n \n for(Int i=1;i<BS;i++)\n for(Int j=0;j<n;j++)\n x[j]+=p[i][j%i];\n\n for(Int j=0;j<n;j++){\n if(j) d[j]+=d[j-1];\n d[j]+=f;\n x[j]+=d[j];\n }\n \n for(Int i=0;i<n;i++) cout<<x[i]<<endl;\n return 0;\n}","accuracy":1,"time_ms":570,"memory_kb":7076,"score_of_the_acc":-0.8508,"final_rank":8},{"submission_id":"aoj_3045_3148796","code_snippet":"#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;\ntypedef pair<ll, ll> pll;\n\nint main(void) {\n ll N, M;\n cin >> N >> M;\n vector<ll> A(M), B(M);\n REP(i, 0, M) cin >> A[i] >> B[i];\n\n map<pll, ll> p;\n REP(i, 0, M) p[pll(A[i], B[i])]++;\n\n vector<ll> x(N, M);\n for (auto q : p) {\n ll a = q.first.first, b = q.first.second, cnt = q.second;\n x[0] += a * cnt;\n for (ll j = b - a; j - 1 < N; j += b) {\n x[j - 1] -= b * cnt;\n }\n }\n\n REP(i, 0, N - 1) x[i + 1] += x[i];\n REP(i, 0, N) cout << x[i] << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":11268,"score_of_the_acc":-1.0993,"final_rank":12},{"submission_id":"aoj_3045_3146374","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/*\n <url:https://onlinejudge.u-aizu.ac.jp/services/room.html#ACPC2018Day2/problems/G>\n 問題文============================================================\n =================================================================\n 解説=============================================================\n ================================================================\n */\n\n\nint main(void) {\n cin.tie(0); ios_base::sync_with_stdio(false);\n ll N,M; cin >> N >> M;\n vector<ll> A(M),B(M);\n for(int i = 0; i < M;i++) cin >> A[i] >> B[i];\n\n vector<ll> ans(N);\n for(int i = 1; i < N;i++) ans[i] = ans[i-1] + M;\n \n vector<ll> rm(N);\n ll sum = 0;\n for(int i = 0; i < M;i++){\n sum += (A[i] + 1)%B[i];\n \n ll ind = B[i] - ((A[i]+1)%B[i]);\n while(ind < N){\n rm[ind] += B[i];\n ind += B[i];\n }\n }\n// cout << sum << endl;\n// cout << ans << endl;\n// cout << rm << endl;\n \n cout << ans[0] + sum << endl;\n for(int i = 1; i < N;i++){\n rm[i] += rm[i-1];\n \n ans[i] = ans[i] + sum - rm[i];\n cout << ans[i] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1420,"memory_kb":5732,"score_of_the_acc":-1.2784,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3045_6012364\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\n#include <map>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<ll,ll> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\n\\nconst int MX = 1000010;\\nint _r() {\\n int x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\n \\nmap<pil,ll> cnt;\\nint n,m;\\nll sum;\\nvoid Init() {\\n cnt.clear();\\n n=_r();\\n m=_r();\\n pil now;\\n for(int i=0;i<m;i++){\\n now.first=_r(),now.second=_r();\\n sum+=now.first;\\n cnt[now]++;\\n }\\n}\\nll ans[MX]={0};\\nvoid solve() {\\n for(auto it : cnt){\\n pil now=it.first;\\n for(int i=now.second-now.first;i<=n;i+=now.second){\\n ans[i]-=now.second*cnt[now];\\n }\\n }\\n for(int i=1;i<=n;i++){\\n sum+=ans[i]+m;\\n printf(\\\"%lld\\\\n\\\",sum);\\n }\\n}\\nint main() {\\n //freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n //freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n int t = 1;\\n while (t--) {\\n Init();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 10152,\n \"score_of_the_acc\": -0.9396,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3045_6012361\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\n#include <map>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<ll,ll> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\n\\nconst int MX = 1000010;\\nint _r() {\\n int x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\n \\nmap<pil,ll> cnt;\\nint n,m;\\nint sum;\\nvoid Init() {\\n cnt.clear();\\n n=_r();\\n m=_r();\\n pil now;\\n for(int i=0;i<m;i++){\\n now.first=_r(),now.second=_r();\\n sum+=now.first;\\n cnt[now]++;\\n }\\n}\\nll ans[MX]={0};\\nvoid solve() {\\n for(auto it : cnt){\\n pil now=it.first;\\n for(int i=now.second-now.first;i<=n;i+=now.second){\\n ans[i]-=now.second*cnt[now];\\n }\\n }\\n for(int i=1;i<=n;i++){\\n sum+=ans[i]+m;\\n printf(\\\"%lld\\\\n\\\",sum);\\n }\\n}\\nint main() {\\n //freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n //freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n int t = 1;\\n while (t--) {\\n Init();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 20,\n \"memory_kb\": 10148,\n \"score_of_the_acc\": -0.8611,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3045_4322604\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\nint main() {\\n int n, m; cin >> n >> m;\\n map<pair<int, int>, int> mp;\\n for (int i = 0; i < m; i++) {\\n int a, b; cin >> a >> b;\\n mp[{a, b}]++;\\n }\\n vector<long long> imos(n, m);\\n for (auto &p: mp) {\\n long long a = p.first.first, b = p.first.second, c = p.second;\\n imos[0] += a * c;\\n for (int i = b - a - 1; i < n; i += b) imos[i] -= b * c;\\n }\\n for (int i = 0; i + 1 < n; i++) imos[i + 1] += imos[i];\\n for (auto x: imos) cout << x << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 9668,\n \"score_of_the_acc\": -0.8907,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3045_3799931\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <string>\\n#include <climits>\\n#include <iomanip>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <tuple>\\n#include <iostream>\\n#include <deque>\\n#include <array>\\n#include <set>\\n#include <functional>\\n#include <memory>\\n#include <stack>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n#include <bitset>\\n\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<std::vector<long long int>> lower(static_cast<int>(std::sqrt(n)) + 1);\\n\\tfor (auto i = 0; i < lower.size(); ++i) lower[i] = std::vector<long long int>(i + 1, 0);\\n\\tstd::vector<long long int> all(n, 0);\\n\\tfor (auto _i = 0; _i < m; ++_i) {\\n\\t\\tint a, b; std::cin >> a >> b;\\n\\t\\tif (b <= lower.size()) {\\n\\t\\t\\tfor (auto j = 0; j < b; ++j) {\\n\\t\\t\\t\\tlower[b - 1][j] += (a + j + 1) % b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tall[0] += a + 1;\\n\\t\\t\\tall[1] -= a;\\n\\t\\t\\tfor (auto j = b - a - 1; j < n; j += b) {\\n\\t\\t\\t\\tall[j] -= b;\\n\\t\\t\\t\\tif (j + 1 < n) all[j + 1] += b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (auto i = 1; i < n; ++i) all[i] += all[i - 1];\\n\\tfor (auto i = 1; i < n; ++i) all[i] += all[i - 1];\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tlong long int sum = 0LL;\\n\\t\\tfor (const auto& l : lower) sum += l[i % l.size()];\\n\\t\\tstd::cout << all[i] + sum << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 3888,\n \"score_of_the_acc\": -0.2295,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3045_3668504\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define REP(i,n) for(ll i =0;i<n;++i)\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n vector<int> a(m),b(m);\\n REP(i,m)cin>>a[i]>>b[i];\\n int k=200;\\n vector<vector<ll>> cnt(k);\\n REP(i,k)cnt[i].resize(i);\\n vector<ll> sum(n);\\n REP(i,m){\\n if(b[i]>=k){\\n int pos=b[i]-a[i]-1;\\n while(pos<n){\\n sum[pos]+=b[i];\\n pos+=b[i];\\n }\\n }else{\\n cnt[b[i]][(b[i]-a[i]%b[i])%b[i]]+=b[i];\\n }\\n }\\n ll ans=0;\\n REP(i,m)ans+=(a[i]+1)%b[i];\\n cout<<ans<<endl;\\n for(int j=1;j<n;++j){\\n ans+=m;\\n for(int i=1;i<k;++i){\\n ans-=cnt[i][(j+1)%i];\\n }\\n ans-=sum[j];\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4432,\n \"score_of_the_acc\": -0.2295,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3045_3668490\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define REP(i,n) for(ll i =0;i<n;++i)\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n vector<int> a(m),b(m);\\n REP(i,m)cin>>a[i]>>b[i];\\n int k=200;\\n vector<vector<ll>> cnt(k);\\n REP(i,k)cnt[i].resize(i);\\n vector<ll> sum(n);\\n REP(i,m){\\n if(b[i]>=k){\\n int pos=b[i]-a[i];\\n while(pos<n){\\n sum[pos]+=b[i];\\n pos+=b[i];\\n }\\n }else{\\n cnt[b[i]][(b[i]-a[i]%b[i])%b[i]]+=b[i];\\n }\\n }\\n ll ans=0;\\n REP(i,m)ans+=(a[i]+1)%b[i];\\n cout<<ans<<endl;\\n for(int j=1;j<n;++j){\\n ans+=m;\\n for(int i=1;i<k;++i){\\n ans-=cnt[i][(j+1)%i];\\n }\\n ans-=sum[j];\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 150,\n \"memory_kb\": 4248,\n \"score_of_the_acc\": -0.1843,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3045_3386097\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nstruct Item {\\n int A;\\n int B;\\n int count;\\n int time;\\n\\n int diff() const {\\n return B - A;\\n }\\n\\n bool operator<(const Item &rhs) const {\\n return time > rhs.time;\\n }\\n};\\n\\npriority_queue<Item> Q;\\n\\nint geta = 0;\\n\\nvoid add(int A, int B, int count, int time) {\\n Q.push({A, B, count, time});\\n}\\n\\n\\nlong long update(int time) {\\n long long dec_sum = 0;\\n while (Q.size()) {\\n auto q = Q.top();\\n if (q.time > time) {\\n break;\\n }\\n Q.pop();\\n add(q.A, q.B, q.count, time + q.B);\\n dec_sum += 1ll * q.B * q.count;\\n }\\n\\n return dec_sum;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n\\n map<pair<int, int>, int> counter;\\n long long sum = 0;\\n int cnt = 0;\\n for (int i = 0; i < M; i++) {\\n int A, B;\\n cin >> A >> B;\\n if (B > 1) {\\n counter[{A, B}]++;\\n sum += A % B;\\n cnt++;\\n }\\n }\\n for (auto i : counter) {\\n add(i.first.first, i.first.second, i.second, i.first.second - i.first.first - 1);\\n }\\n\\n for (int i = 0; i < N; i++) {\\n sum += cnt;\\n sum -= update(i);\\n cout << sum << endl;\\n }\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 11164,\n \"score_of_the_acc\": -1.5467,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3045_3239932\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100005\\n\\nll N,M;\\nll diff[NUM];\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdiff[i] = 0;\\n\\t}\\n\\n\\tint loc;\\n\\tll A,B;\\n\\tll sum_ADD = M;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&A,&B);\\n\\t\\tsum_ADD += A;\\n\\n\\t\\tloc = B-A-1;\\n\\n\\t\\twhile(loc < N){\\n\\n\\t\\t\\tdiff[loc] -= B;\\n\\t\\t\\tloc += B;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdiff[i] += diff[i-1];\\n\\t}\\n\\n\\tfor(ll i = 0; i < N; i++){\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",sum_ADD+diff[i]+i*M);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1300,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.9623,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3045_3239931\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100005\\n\\nint N,M;\\nll diff[NUM];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdiff[i] = 0;\\n\\t}\\n\\n\\tint loc;\\n\\tll A,B;\\n\\tll sum_ADD = M;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\n\\t\\tscanf(\\\"%lld %lld\\\",&A,&B);\\n\\t\\tsum_ADD += A;\\n\\n\\t\\tloc = B-A-1;\\n\\n\\t\\twhile(loc < N){\\n\\n\\t\\t\\tdiff[loc] -= B;\\n\\t\\t\\tloc += B;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdiff[i] += diff[i-1];\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",sum_ADD+diff[i]+i*M);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 10,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.0214,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3045_3215882\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\n\\ntypedef vector<pair<long long int,long long int>> DP;\\n\\nDP connect(const DP&l, const DP&r) {\\n\\tDP k(l.size()+r.size()-1,make_pair(1e18,1e18));\\n\\tfor (int i = 0; i < l.size(); ++i) {\\n\\t\\tfor (int j = 0; j < r.size(); ++j) {\\n\\t\\t\\tauto x = make_pair(l[i].first + r[j].first, l[i].second + r[j].second);\\n\\n\\t\\t\\tk[i + j] = min(k[i + j], x);\\n\\n\\t\\t}\\n\\t}\\n\\treturn k;\\n}\\nDP dfs(const int now, const int from,\\n\\tconst vector<vector<int>>&edges,vector<int>&overs) {\\n\\n\\tlong long int over_num=overs[now];\\n\\tDP v(2);\\n\\tv[0]=make_pair(over_num,0);\\n\\tv[1]=make_pair(over_num-1,0);\\n\\n\\tvector<vector<pair<long long int,long long int>>>ps;\\n\\tfor (auto e : edges[now]) {\\n\\t\\tif(e==from)continue;\\n\\t\\tps.push_back(dfs(e,now,edges,overs));\\n\\t}\\n\\tsort(ps.begin(), ps.end(), [](const vector < pair<long long int, long long int>>&l, const vector<pair<long long int, long long int>>&r) {\\n\\t\\treturn l.size()<r.size();\\n\\t});\\n\\tfor (auto p : ps) {\\n\\t\\tv=connect(v,p);\\n\\t}\\n\\tfor (auto &k : v) {\\n\\t\\tk.second+=abs(k.first);\\n\\t}\\n\\treturn v;\\n}\\nint main() {\\n\\tint N,M;cin>>N>>M;\\n\\n\\tint K=sqrt(N);\\n\\tlong long int sum=0;\\n\\tlong long int zero_ans=0;\\n\\tvector<long long int>sas(N);\\n\\n\\tvector<vector<long long int>>nums;\\n\\tfor (int i = 0; i < K; ++i) {\\n\\t\\tnums.push_back(vector<long long int>(i,0));\\n\\t}\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a,b;cin>>a>>b;\\n\\t\\ta=(a+1)%b;\\n\\t\\tif (K > b) {\\n\\t\\t\\tnums[b][a]++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tsum++;\\n\\t\\t\\tzero_ans+=a;\\n\\t\\t\\tfor (int j = b - a; j < N; j += b) {\\n\\t\\t\\t\\tsas[j]-=b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<long long int>anss(N);\\n\\n\\tlong long int pre=zero_ans;\\n\\tlong long int small_sum = 0;\\n\\tlong long int small_cnt = 0;\\n\\tfor (int j = 1; j < K; ++j) {\\n\\t\\tfor (int k = 0; k < j; ++k) {\\n\\t\\t\\tsmall_sum += nums[j][k] * k;\\n\\t\\t\\tsmall_cnt += nums[j][k];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tanss[0]+=zero_ans;\\n\\t\\tanss[0]+=small_sum;\\n\\t}\\n\\tlong long int small_pre=small_sum;\\n\\n\\tfor (int i = 1; i < N; ++i) {\\n\\t\\tpre+=sum;\\n\\t\\tpre+=sas[i];\\n\\t\\tanss[i]=pre;\\n\\n\\t\\tsmall_sum+=small_cnt;\\n\\t\\tfor (long long int j = 1; j < K; ++j) {\\n\\t\\t\\tsmall_sum-=j*nums[j][(1000000*j-i)%j];\\n\\t\\t}\\n\\t\\tanss[i]+=small_sum;\\n\\t}\\n\\tfor(auto ans:anss)cout<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 4676,\n \"score_of_the_acc\": -0.389,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3045_3160014\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nll a[101010],cnt[500][500];\\nint main(){\\n ll n,m;\\n cin>>n>>m;\\n rep(i,m){\\n ll x,y;\\n cin>>x>>y;\\n if(y<400)cnt[y][x]++;\\n else {\\n a[0]+=x+1;\\n a[1]-=x;\\n ll z=y-x-1;\\n while(z<=n){\\n a[z]-=y;\\n a[z+1]+=y;\\n z+=y;\\n }\\n }\\n }\\n rep(i,n)a[i+1]+=a[i]; \\n rep(i,n)a[i+1]+=a[i];\\n rep(i,400){\\n if(i==0)continue;\\n ll sum=0,num=0;\\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\\n rep(j,n){\\n sum+=num;\\n sum-=cnt[i][(n*i-j-1)%i]*i;\\n a[j]+=sum;\\n }\\n }\\n rep(i,n)cout<<a[i]<<endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 4228,\n \"score_of_the_acc\": -0.3661,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3045_3160011\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nll a[101010],cnt[500][500];\\nint main(){\\n ll n,m;\\n cin>>n>>m;\\n rep(i,m){\\n ll x,y;\\n cin>>x>>y;\\n if(y<400)cnt[y][x]++;\\n else {\\n a[0]+=(x+1)%y;\\n a[1]-=a[0]-1;\\n ll z=y-x;\\n while(z<=n){\\n a[z]-=y;\\n a[z+1]+=y;\\n z+=y;\\n }\\n }\\n }\\n rep(i,n)a[i+1]+=a[i]; \\n rep(i,n)a[i+1]+=a[i];\\n rep(i,400){\\n if(i==0)continue;\\n ll sum=0,num=0;\\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\\n rep(j,n){\\n sum+=num;\\n sum-=cnt[i][(n*i-j-1)%i]*i;\\n a[j]+=sum;\\n }\\n }\\n rep(i,n)cout<<a[i]<<endl; \\n return 0;\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 350,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.2411,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3045_3160009\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(ll i=(ll)m ; i < (ll) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nll a[101010],cnt[500][500];\\nint main(){\\n ll n,m;\\n cin>>n>>m;\\n rep(i,m){\\n ll x,y;\\n cin>>x>>y;\\n if(y<400)cnt[y][x]++;\\n else {\\n a[0]+=x+1;\\n a[1]-=x;\\n ll z=y-x;\\n while(z<=n){\\n a[z]-=y;\\n a[z+1]+=y;\\n z+=y;\\n }\\n }\\n }\\n rep(i,n)a[i+1]+=a[i]; \\n rep(i,n)a[i+1]+=a[i];\\n rep(i,400){\\n if(i==0)continue;\\n ll sum=0,num=0;\\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\\n rep(j,n){\\n sum+=num;\\n sum-=cnt[i][(n*i-j-1)%i]*i;\\n a[j]+=sum;\\n }\\n }\\n rep(i,n)cout<<a[i]<<endl; \\n return 0;\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 340,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.2382,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3045_3160007\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nll a[101010],cnt[500][500];\\nint main(){\\n ll n,m;\\n cin>>n>>m;\\n rep(i,m){\\n ll x,y;\\n cin>>x>>y;\\n if(y<400)cnt[y][x]++;\\n else {\\n a[0]+=x+1;\\n a[1]-=x;\\n int z=y-x;\\n while(z<=n){\\n a[z]-=y;\\n a[z+1]+=y;\\n z+=y;\\n }\\n }\\n }\\n rep(i,n)a[i+1]+=a[i]; \\n rep(i,n)a[i+1]+=a[i];\\n rep(i,400){\\n if(i==0)continue;\\n ll sum=0,num=0;\\n rep(j,400)sum+=cnt[i][j]*j,num+=cnt[i][j];\\n rep(j,n){\\n sum+=num;\\n sum-=cnt[i][(n*i-j-1)%i]*i;\\n a[j]+=sum;\\n }\\n }\\n rep(i,n)cout<<a[i]<<endl; \\n return 0;\\n}\",\n \"accuracy\": 0.3384615384615385,\n \"time_ms\": 340,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.2476,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3045_3160004\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nconst int DIV = 350;\\n\\nint N, M;\\nvector<long long> A, B;\\n\\nint main() {\\n cin >> N >> M;\\n A.resize(M); B.resize(M);\\n for (int i = 0; i < M; ++i) scanf(\\\"%lld %lld\\\", &A[i], &B[i]);\\n\\n vector<vector<long long> > sb(DIV, vector<long long>(DIV, 0));\\n vector<long long> imos(N+1, 0);\\n long long geta = 0;\\n for (int i = 0; i < M; ++i) {\\n if (B[i] < DIV) {\\n for (int j = 0; j < B[i]; ++j) {\\n long long q = (A[i] + j + 1) % B[i];\\n sb[B[i]][j] += q;\\n }\\n }\\n else {\\n ++geta;\\n imos[0] += A[i];\\n imos[N] += -1 - (A[i]+N)%B[i];\\n for (int q = B[i]-A[i]-1; q < N; q += B[i]) {\\n imos[q] -= B[i];\\n }\\n }\\n }\\n for (int i = 0; i <= N; ++i) imos[i] += geta;\\n for (int i = 0; i <= N; ++i) imos[i+1] += imos[i];\\n \\n vector<long long> res = imos;\\n for (int b = 1; b < DIV; ++b) {\\n for (int i = 0; i < N; ++i) {\\n int r = i % b;\\n res[i] += sb[b][r];\\n }\\n }\\n \\n for (int i = 0; i < N; ++i) printf(\\\"%lld\\\\n\\\", res[i]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6896,\n \"score_of_the_acc\": -0.5649,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3045_3159234\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\nll sum[SIZE];\\n\\nint main(){\\n int n, m;\\n ll suma = 0;\\n map<pair<int,int>,int> mm;\\n \\n scanf(\\\"%d%d\\\", &n,&m);\\n\\n for(int i=0;i<m;i++){\\n int a, b;\\n\\n scanf(\\\"%d%d\\\", &a,&b);\\n suma += a;\\n mm[make_pair(a,b)]++;\\n }\\n \\n for(auto it : mm){\\n int a = it.first.first;\\n int b = it.first.second;\\n int c = it.second;\\n \\n for(int i=b-a;i<=n;i+=b){\\n if(i) sum[i] -= (ll)c * b;\\n }\\n }\\n\\n for(int i=0;i<n;i++){\\n suma += m + sum[i+1]; \\n printf(\\\"%lld\\\\n\\\",suma);\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 9820,\n \"score_of_the_acc\": -0.8325,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3045_3153462\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)<<\\\" \\\"\\n#define pr2(a,b) pr1(a)<<pr1(b)\\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\\nusing namespace std;\\nusing Int = long long;\\nusing _int = int;\\nusing ll = long long;\\nusing Double = long double;\\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\\nconst Int mod = (1e9)+7;\\nconst Double EPS = 1e-8;\\nconst Double PI = 6.0 * asin((Double)0.5);\\nusing P = pair<Int,Int>;\\nusing T = tuple<Int,Int,Int>;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\\n return o<<\\\"(\\\"<<get<0>(t)<<\\\",\\\"<<get<1>(t)<<\\\",\\\"<<get<2>(t)<<\\\")\\\";}\\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\\ntemplate<class T>void prArr(T a,string s=\\\" \\\"){Int i=0;for(T t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\ntemplate<typename T>\\nclass CumulativeSum{\\npublic:\\n int n;\\n vector<T> sum;\\n vector<T> A;\\n int added;\\n CumulativeSum():n(-1),added(0){}\\n CumulativeSum(int n):n(n), sum(n+1), A(n+1),added(0){}\\n CumulativeSum(const vector<T> &B):n(B.size()), sum(n+1), A(n+1),added(0){\\n for(int i=1;i<=n;i++) sum[i] = sum[i-1] + B[i-1];\\n }\\n\\n void apply(){\\n for(int i=1;i<=n;i++) A[i] = A[i] + A[i-1];\\n for(int i=1;i<=n;i++) A[i] = A[i] + A[i-1];\\n for(int i=1;i<=n;i++) sum[i] = sum[i] + A[i-1];\\n added = 0; A.clear(); A.resize(n+1);\\n }\\n\\n //[l, r)にxを加算\\n T add(int l, int r, T x){\\n added = 1;\\n assert(l <= r && 0 <= l && r <= n);\\n A[l] = A[l] + x;\\n A[r] = A[r] - x;\\n }\\n\\n //[l, r)の和を得る\\n T get(int l,int r){\\n assert(l<=r && 0<=l && r<=n);\\n if(added) apply();\\n return sum[r] - sum[l];\\n }\\n};\\n\\nsigned main(){\\n srand((unsigned)time(NULL));\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n Int N, M;\\n cin>>N>>M;\\n\\n const Int limit = 500;\\n CumulativeSum<Int> S(N+100);\\n \\n auto query1=[&](Int a, Int b){ //b >= limit\\n assert(b >= limit);\\n a %= b;\\n Int l = 0, r = min(N, b - a - 1);\\n S.add(l, l+1, a);\\n S.add(l, r, 1);\\n S.add(r, r+1, -(a+r));\\n l = r + 1;\\n r = min(N, r + b);\\n a = 0;\\n while(l < N){\\n S.add(l, r, 1);\\n S.add(r, r+1, -(r-l));\\n l = r + 1;\\n r = min(N, r + b);\\n }\\n };\\n\\n vector<vector<Int> > mem(limit, vector<Int>(limit, 0));\\n auto query2=[&](Int a, Int b){ // b < limit\\n assert(b < limit);\\n a %= b;\\n for(Int i=0;i<b;i++) mem[b][i] += (a+1 + i)%b;\\n };\\n \\n for(Int i=0;i<M;i++){\\n Int a, b;\\n cin>>a>>b;\\n (b >= limit)? query1(a, b):query2(a, b);\\n }\\n\\n for(Int i=0;i<N;i++){\\n Int ans = S.get(0, i+1);\\n for(Int j=1;j<limit;j++) ans += mem[j][i%j];\\n cout<<ans<<endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 6280,\n \"score_of_the_acc\": -0.7967,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3045_3152352\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,m;\\n cin>>n>>m;\\n vector<Int> a(m),b(m);\\n for(Int i=0;i<m;i++) cin>>a[i]>>b[i];\\n\\n const Int BS = 400;\\n vector<Int> x(n,0);\\n vector<vector<Int> > p(BS,vector<Int>(BS,0));\\n vector<Int> d(n,0);\\n Int f=0;\\n \\n for(Int i=0;i<m;i++){\\n if(b[i]<BS){\\n for(Int j=0;j<b[i];j++)\\n\\tp[b[i]][j]+=(a[i]+j+1)%b[i];\\n }else{\\n f++;\\n d[0]+=a[i];\\n for(Int j=b[i]-(a[i]+1);j<n;j+=b[i])\\n\\td[j]+=-b[i];\\n }\\n }\\n \\n for(Int i=1;i<BS;i++)\\n for(Int j=0;j<n;j++)\\n x[j]+=p[i][j%i];\\n\\n for(Int j=0;j<n;j++){\\n if(j) d[j]+=d[j-1];\\n d[j]+=f;\\n x[j]+=d[j];\\n }\\n \\n for(Int i=0;i<n;i++) cout<<x[i]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 7076,\n \"score_of_the_acc\": -0.8508,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3045_3148796\",\n \"code_snippet\": \"#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;\\ntypedef pair<ll, ll> pll;\\n\\nint main(void) {\\n ll N, M;\\n cin >> N >> M;\\n vector<ll> A(M), B(M);\\n REP(i, 0, M) cin >> A[i] >> B[i];\\n\\n map<pll, ll> p;\\n REP(i, 0, M) p[pll(A[i], B[i])]++;\\n\\n vector<ll> x(N, M);\\n for (auto q : p) {\\n ll a = q.first.first, b = q.first.second, cnt = q.second;\\n x[0] += a * cnt;\\n for (ll j = b - a; j - 1 < N; j += b) {\\n x[j - 1] -= b * cnt;\\n }\\n }\\n\\n REP(i, 0, N - 1) x[i + 1] += x[i];\\n REP(i, 0, N) cout << x[i] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 11268,\n \"score_of_the_acc\": -1.0993,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3045_3146374\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/*\\n <url:https://onlinejudge.u-aizu.ac.jp/services/room.html#ACPC2018Day2/problems/G>\\n 問題文============================================================\\n =================================================================\\n 解説=============================================================\\n ================================================================\\n */\\n\\n\\nint main(void) {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n ll N,M; cin >> N >> M;\\n vector<ll> A(M),B(M);\\n for(int i = 0; i < M;i++) cin >> A[i] >> B[i];\\n\\n vector<ll> ans(N);\\n for(int i = 1; i < N;i++) ans[i] = ans[i-1] + M;\\n \\n vector<ll> rm(N);\\n ll sum = 0;\\n for(int i = 0; i < M;i++){\\n sum += (A[i] + 1)%B[i];\\n \\n ll ind = B[i] - ((A[i]+1)%B[i]);\\n while(ind < N){\\n rm[ind] += B[i];\\n ind += B[i];\\n }\\n }\\n// cout << sum << endl;\\n// cout << ans << endl;\\n// cout << rm << endl;\\n \\n cout << ans[0] + sum << endl;\\n for(int i = 1; i < N;i++){\\n rm[i] += rm[i-1];\\n \\n ans[i] = ans[i] + sum - rm[i];\\n cout << ans[i] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1420,\n \"memory_kb\": 5732,\n \"score_of_the_acc\": -1.2784,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1887,"cells":{"group_id":{"kind":"string","value":"aoj_3046_cpp"},"problem_description":{"kind":"string","value":"Problem H: Loss\nProblem\nあなたは、とある会社からプログラムの作成を依頼された。\n その会社には$N$個の仕事があり、それぞれの仕事には$1$から$N$までの番号が振られている。\n 仕事$i$には、$M_i$個の前提となる仕事$X_{i,j}$が存在し、仕事$i$を前提となる仕事$X_{i,j}$よりも先に行うと、仕事$i$は多大な損失を被る。\nそこであなたには、損失を被る仕事の数が最小となるような順番ですべての仕事を行ったときの損失を被った仕事の数を求めてもらいたい。\nInput\n入力は以下の形式ですべて整数で与えられる。\n$N$\n$M_1$ $X_{1,1}$ $X_{1,2}$ ... $X_{1,M_1}$\n$M_2$ $X_{2,1}$ $X_{2,2}$ ... $X_{2,M_2}$\n:\n$M_N$ $X_{N,1}$ $X_{N,2}$ ...$X_{N,M_N}$\n仕事の数$N$が$1$行に与えられる。\n続く$N$行に前提となる仕事の情報が与えられる。$i+1$行目には仕事$i$の情報が空白区切りで与えられる。$M_i$は、仕事$i$の前提となる仕事の数、$X_{i,j}$は仕事$i$の前提となる仕事の番号を表している。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N \\le 10^5$\n$0 \\le M_i \\le N$\n$M_i$の総和は$10^5$を超えない\n$1 \\le X_{i,j} \\le min(i+1,N)$\nOutput\n損失を被る仕事の数が最小になるような順番ですべての仕事を行ったとき、そのときの損失を被った仕事の数を一行に出力する。\nSample Input 1\n2\n1 1\n0\nSample Output 1\n1\n仕事$1$のように前提となる仕事がその仕事自身となるような入力も存在する。\nSample Input 2\n3\n3 2 1 2\n0\n1 2\nSample Output 2\n1\nSample Input 3\n5\n1 2\n1 3\n2 1 2\n3 1 3 5\n0\nSample Output 3\n1\n例えば、$3,2,1,5,4$の順に仕事を行うと損失を最小化できる。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3046_4405872","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100005\n\n\n\nstruct GROUP{\n\tvector<int> nodes;\n};\n\nGROUP group[NUM]; //強連結成分のグループ\nint N;\nvector<int> G[NUM];\nvector<int> reverse_G[NUM];\nstack<int> S;\nmap<pair<int,int>,bool> MAP;\n\nbool check[NUM],SELF[NUM];\nint table[NUM],work[NUM];\ndouble sleep[NUM];\n\nint group_index;\n\nvoid dfs(int node_id){\n\tcheck[node_id] = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tif(!check[G[node_id][i]])dfs(G[node_id][i]);\n\t}\n\tS.push(node_id);\n}\n\nvoid reverse_dfs(int node_id){\n\tcheck[node_id] = true;\n\n\ttable[node_id] = group_index;\n\tgroup[group_index].nodes.push_back(node_id); //group[group_index]にノードを突っ込む\n\n\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\n\t\tif(!check[reverse_G[node_id][i]])reverse_dfs(reverse_G[node_id][i]);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint num,pre_node;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tSELF[i] = false;\n\n\t\tscanf(\"%d\",&num);\n\n\t\tfor(int k = 0; k < num; k++){\n\t\t\tscanf(\"%d\",&pre_node);\n\t\t\tpre_node--;\n\n\t\t\tif(pre_node == i){\n\n\t\t\t\tSELF[i] = true;\n\t\t\t}\n\n\t\t\tauto at = MAP.find(make_pair(pre_node,i));\n\t\t\tif(at != MAP.end())continue;\n\n\t\t\tMAP[make_pair(pre_node,i)] = true;\n\n\t\t\tG[pre_node].push_back(i);\n\t\t\treverse_G[i].push_back(pre_node);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++)check[i] = false;\n\n\tfor(int i = 0; i < N;i++){\n\t\tif(!check[i])dfs(i);\n\t}\n\n\tfor(int i = 0; i < N;i++)check[i] = false;\n\n\tgroup_index = -1;\n\n\twhile(!S.empty()){\n\t\tif(!check[S.top()]){\n\t\t\tgroup_index++;\n\n\t\t\treverse_dfs(S.top());\n\t\t}\n\t\tS.pop();\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\twork[i] = -BIG_NUM;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < reverse_G[i].size(); k++){\n\t\t\tint tmp_node = reverse_G[i][k];\n\n\t\t\tif(tmp_node > i || table[i] != table[tmp_node])continue;\n\n\t\t\twork[i] = max(work[i],tmp_node);\n\t\t}\n\t}\n\n\tint tmp = -1;\n\tint ans = 0;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(work[i] == -BIG_NUM)continue;\n\t\tif(tmp < work[i]){\n\t\t\tans++;\n\t\t\ttmp = i;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":23496,"score_of_the_acc":-0.9388,"final_rank":15},{"submission_id":"aoj_3046_3668751","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing Graph=vector<vector<int>>;\nint main(){\n int n;\n cin>>n;\n vector<int> upper(n+1);\n vector<int> self(n+1);\n self[n]=true;\n\n Graph g(n);\n for(int i=0;i<n;i++){\n int m;\n cin>>m;\n while(m--){\n int x;\n cin>>x;\n x--;\n if(x==i) self[i]=true;\n if(x<i) g[x].push_back(i);\n if(i<x) upper[i]=true;\n }\n }\n vector<int> flag(n);\n int res=0;\n int l=0;\n for(int i=0;i<=n;i++){\n if(self[i] || flag[i]){\n res++;\n while(l<i){\n\tfor(auto to:g[l]) flag[to]=false;\n\tl++;\n }\n }\n else if(upper[i]){\n for(auto to:g[i]) flag[to]=true;\n }\n else{\n while(l<i){\n\tfor(auto to:g[l]) flag[to]=false;\n\tl++;\n }\n }\n }\n cout<<res-1<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7460,"score_of_the_acc":-0.2039,"final_rank":7},{"submission_id":"aoj_3046_3214244","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nstruct Edge {\n\tint src;\n\tint dst;\n\tlong long int A;\n\tlong long int B;\n};\nstruct aa {\n\tint now;\n\tlong long int cost;\n};\nbool operator <(const aa&l, const aa&r) {\n\treturn l.cost>r.cost;\n}\nlong long int ce(long long int a,long long int b) {\n\treturn (a-1)/b+1;\n}\nint main() {\n\tint N;cin>>N;\n\tvector<int>valids(N,true),need_next(N),need_pre(N);\n\tvector<int>l_cnts(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tint K;cin>>K;\n\t\tvector<int>v;\n\t\tfor (int k = 0; k < K; ++k) {\n\t\t\tint a;cin>>a;\n\t\t\ta--;\n\t\t\tv.push_back(a);\n\t\t\tif (a == i) {\n\t\t\t\tvalids[i]=false;\n\t\t\t}\n\t\t\tif (a == i - 1) {\n\t\t\t\tneed_pre[i]=true;\n\t\t\t}\n\t\t\telse if (a == i + 1) {\n\t\t\t\tneed_next[i]=true;\n\t\t\t}\n\t\t}\n\t\tsort(v.begin(),v.end());\n\t\tv.erase(unique(v.begin(),v.end()),v.end());\n\t\tauto it=lower_bound(v.begin(),v.end(),i);\n\t\t\t\n\t\n\t\tl_cnts[i]=it==v.begin()?30000000:i-*prev(it);\n\t}\n\tvector<int>dp(N+1);\n\tfor (int i = 0; i < N; ++i) {\n\n\t\tdp[i + 1] = max(dp[i+1],dp[i]);\n\t\tif (!valids[i]) {\n\t\t}\n\t\telse {\n\t\t\tif (need_next[i]) {\n\t\t\t\tint k=i+1;\n\t\t\t\tint sum=1;\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (l_cnts[k]<=sum) {\n\t\t\t\t\t\tdp[k+1]=max(dp[k+1],dp[i]+sum);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (valids[k]) {\n\t\t\t\t\t\t\tif (need_next[k]) {\n\t\t\t\t\t\t\t\tdp[k+1]=max(dp[k+1],dp[i]+sum);\n\t\t\t\t\t\t\t\tk++;\n\t\t\t\t\t\t\t\tsum++;\n\t\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tif (l_cnts[k] > sum) {\n\n\t\t\t\t\t\t\t\t\tdp[k + 1] = max(dp[k + 1],dp[i]+ sum + 1);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t\t\t\tdp[k+1]=max(dp[k+1],dp[i]+sum);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tdp[k+1]=max(dp[k+1],dp[i]+sum);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdp[i+1]=max(dp[i]+1,dp[i+1]);\n\t\t\t}\n\t\t}\n\t}\n\tcout<<N-dp[N]<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4728,"score_of_the_acc":-0.0824,"final_rank":2},{"submission_id":"aoj_3046_3208449","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\n/* Starry Sky Tree */\n//0-index\n\nstruct StarrySkyTree{\n typedef int Type;\n int segn2;\n vector<Type> data,s_data;\n function<Type(Type, Type)> merge;\n \n StarrySkyTree(function<Type(Type, Type)> merge, int n): merge(merge)\n {\n for(segn2=1;segn2<n;segn2*=2);\n data.assign(segn2*2,0);\n s_data.assign(segn2*2,0);\n }\n\n StarrySkyTree(int n): //Original Ver.\n StarrySkyTree([](Type a, Type b){ return max(a, b); }, n) {}\n \n //get minimum value of [a,b)\n Type query(int a,int b,int l=0,int r=-1,int k=0){\n if(r==-1) r+=segn2;\n if(r <= a || b <= l) return -INF; //大きさに注意\n if(a <= l && r <= b) return data[k] + s_data[k];\n return merge(query(a,b,l,(l+r)/2,k*2+1),query(a,b,(l+r)/2,r,k*2+2))+s_data[k];\n }\n \n //add x to [a,b)\n Type add(int a,int b,Type x,int l=0,int r=-1,int k=0){\n if(r==-1) r+=segn2;\n if(a <= l && r <= b){\n s_data[k]+=x;\n }else if(a < r && l < b){\n data[k] = merge(add(a,b,x,l,(l+r)/2,k*2+1),add(a,b,x,(l+r)/2,r,k*2+2));\n }\n return data[k] + s_data[k];\n }\n \n};\n\nbool hasnext[SIZE], hasown[SIZE];\nint prevmax[SIZE];\n\nint main(){\n int n, m, x;\n\n scanf(\"%d\", &n);\n\n for(int i=0;i<n;i++) prevmax[i] = -1;\n \n for(int i=0;i<n;i++){\n scanf(\"%d\", &m);\n for(int j=0;j<m;j++){\n scanf(\"%d\", &x);\n x--;\n hasnext[i] |= x == i+1;\n hasown[i] |= x == i;\n if(x < i) prevmax[i] = max(prevmax[i], x);\n }\n }\n\n StarrySkyTree seg(n+1);\n\n seg.add(1,n+1, -INF);\n \n for(int i=0;i<n;i++){\n if(!hasown[i] && !hasnext[i]){\n seg.add(prevmax[i]+1, i+1, 1);\n }\n\n int res = seg.query(0,i+1);\n \n seg.add(i+1, i+2, res - seg.query(i+1, i+2));\n\n if(!hasown[i] && hasnext[i]){\n seg.add(prevmax[i]+1, i+1, 1);\n }\n }\n\n cout << n - seg.query(0,n+1) << endl;\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5492,"score_of_the_acc":-0.1323,"final_rank":4},{"submission_id":"aoj_3046_3159499","code_snippet":"#include <bits/stdc++.h>\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nclass segtree{\npublic:\n\tstatic const int N=1<<18;\n\tint dp[1<<19];\n\tint lazy[1<<19];\n\tsegtree(){\n\t\tmemset(dp,0,sizeof(dp));\n\t\tfor(int i=0;i<N*2;i++){\n\t\t\tdp[i]=11451419;\n\t\t\tlazy[i]=11451419;\n\t\t}\n\t}\n\n\tvoid lazy_eval(int k){\n\t\tdp[k]=min(dp[k],lazy[k]);\n\t\tif(k<N-1){\n\t\t\tlazy[k*2+1]=min(lazy[k*2+1],lazy[k]);\n\t\t\tlazy[k*2+2]=min(lazy[k*2+2],lazy[k]);\n\t\t}\n\t}\n\n\tvoid lazy_upd(int k){\n\t\tdp[k]=min(dp[k*2+1],dp[k*2+2]);\n\t}\n\tvoid update(int a,int b,int v,int k=0,int l=0,int r=N){\n\t\tlazy_eval(k);\n\t\tif(b<=l || r<=a)return;\n\t\tif(a<=l && r<=b){\n\t\t\tlazy[k]=min(lazy[k],v);\n\t\t\tlazy_eval(k);\n\t\t\treturn;\n\t\t}\n\t\tint mid=(l+r)/2;\n\t\tupdate(a,b,v,k*2+1,l,mid);\n\t\tupdate(a,b,v,k*2+2,mid,r);\n\t\tlazy_upd(k);\n\t}\n\n\tint query(int a,int b,int k=0,int l=0,int r=N){\n\t\tlazy_eval(k);\n\t\tif(b<=l || r<=a)return 11451419;\n\t\tif(a<=l && r<=b)return dp[k];\n\t\tint mid=(l+r)/2;\n\t\tint vl=query(a,b,k*2+1,l,mid);\n\t\tint vr=query(a,b,k*2+2,mid,r);\n\t\tlazy_upd(k);\n\t\treturn min(vl,vr);\n\t}\n};\n\nint n;\nset<int> g[100005];\nset<int> gg[100005];\nsegtree seg;\nbool self[100005];\n\nint main(void){\n\tscanf(\"%d\",&n);\n\tint selfc=0;\n\tint pr=0;\n\tfor(int i=0;i<n;i++){\n\t\tint m;\n\t\tscanf(\"%d\",&m);\n\t\tbool flag=false;\n\t\tfor(int j=0;j<m;j++){\n\t\t\tint x;\n\t\t\tscanf(\"%d\",&x);\n\t\t\tx--;\n\t\t\tif(x==i){\n\t\t\t\tself[i]=true;\n\t\t\t\tg[i].insert(x);\n\t\t\t}else if(x==i+1){\n\t\t\t\tflag=true;\n\t\t\t}else if(x>=pr && !self[i]){\n\t\t\t\tg[i].insert(x);\n\t\t\t}\n\t\t}\n\t\tif(!flag){\n\t\t\tpr=i+1;\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tfor(set<int>::iterator it=g[i].begin();it!=g[i].end();it++){\n\t\t\tint v=*it;\n\t\t\tgg[v].insert(i);\n\t\t}\n\t}\n\tint mini_m=11451419;\n\tfor(int i=n-1;i>=0;i--){\n\t\tfor(set<int>::iterator it=gg[i].begin();it!=gg[i].end();it++){\n\t\t\tint v=*it;\n\t\t\tmini_m=min(v,mini_m);\n\t\t}\n\t\tif(*(gg[i].begin())>mini_m){\n\t\t\tgg[i].insert(mini_m);\n\t\t}\n\t}\n\tseg.update(0,1,0);\n\tint prv=0;\n\tint cnt=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(gg[i].size()==0)continue;\n\t\tint v=seg.query(prv,prv+1);\n\t\tint nxt=*(gg[i].begin());\n\t\t//printf(\"%d %d %d\\n\",i,nxt,v);\n\t\tseg.update(i+1,nxt+2,v+1);\n\t\tprv=i+1;\n\t}\n\tprintf(\"%d\\n\",seg.query(prv,prv+1));\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":16804,"score_of_the_acc":-0.6091,"final_rank":10},{"submission_id":"aoj_3046_3159246","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\n/* Starry Sky Tree */\n//0-index\n\nstruct StarrySkyTree{\n typedef int Type;\n int segn2;\n vector<Type> data,s_data;\n \n StarrySkyTree(int n){\n for(segn2=1;segn2<n;segn2*=2);\n data.assign(segn2*2,0);\n s_data.assign(segn2*2,0);\n }\n \n //get maximum value of [a,b]\n Type query(int a,int b,int l=0,int r=-1,int k=0){\n if(r==-1) r+=segn2;\n if(r<a || b<l) return -INF; //大きさに注意\n if(a<=l && r<=b) return data[k] + s_data[k];\n return max(query(a,b,l,(l+r)/2,k*2+1),query(a,b,(l+r)/2+1,r,k*2+2))+s_data[k];\n }\n \n //add x to [a,b]\n Type add(int a,int b,Type x,int l=0,int r=-1,int k=0){\n if(r==-1) r+=segn2;\n if(a<=l && r<=b){\n s_data[k]+=x;\n }else if(a<=r && l<=b){\n data[k] = max(add(a,b,x,l,(l+r)/2,k*2+1),add(a,b,x,(l+r)/2+1,r,k*2+2));\n }\n return data[k] + s_data[k];\n }\n \n};\n\nbool hasnext[SIZE], hasown[SIZE];\nint prevmax[SIZE];\n\nint main(){\n int n, m, x;\n\n scanf(\"%d\", &n);\n\n for(int i=0;i<n;i++) prevmax[i] = -1;\n \n for(int i=0;i<n;i++){\n scanf(\"%d\", &m);\n for(int j=0;j<m;j++){\n scanf(\"%d\", &x);\n x--;\n hasnext[i] |= x == i+1;\n hasown[i] |= x == i;\n if(x < i) prevmax[i] = max(prevmax[i], x);\n }\n }\n\n StarrySkyTree seg(n+1);\n\n seg.add(1,n, -INF);\n \n for(int i=0;i<n;i++){\n if(!hasown[i] && !hasnext[i]){\n seg.add(prevmax[i]+1, i, 1);\n }\n\n int res = seg.query(0,i);\n \n seg.add(i+1, i+1, res - seg.query(i+1, i+1));\n\n if(!hasown[i] && hasnext[i]){\n seg.add(prevmax[i]+1, i, 1);\n }\n }\n\n cout << n - seg.query(0,n) << endl;\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":5432,"score_of_the_acc":-0.1243,"final_rank":3},{"submission_id":"aoj_3046_3152353","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct SCC{\n int n;\n vector<vector<int> > G,rG,T,C;\n vector<int> vs,used,belong;\n SCC(){}\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\n \n void add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n \n void input(int m,int offset=0){\n int a,b;\n for(int i=0;i<m;i++){\n cin>>a>>b;\n add_edge(a+offset,b+offset);\n }\n }\n \n void dfs(int v){\n used[v]=1;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]]) dfs(G[v][i]);\n }\n vs.push_back(v);\n }\n \n void rdfs(int v,int k){\n used[v]=1;\n belong[v]=k;\n C[k].push_back(v);\n for(int i=0;i<(int)rG[v].size();i++){\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\n }\n }\n \n int build(){\n fill(used.begin(),used.end(),0);\n vs.clear();\n for(int v=0;v<n;v++){\n if(!used[v]) dfs(v);\n }\n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!used[vs[i]]){\n\tT.push_back(vector<int>());\n\tC.push_back(vector<int>());\n\trdfs(vs[i],k++);\n }\n }\n for(int i=0;i<n;i++)\n for(int u:G[i])\n\tif(belong[i]!=belong[u])\n\t T[belong[i]].push_back(belong[u]);\n for(int i=0;i<k;i++){\n sort(T[i].begin(),T[i].end());\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\n }\n return k;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n cin>>n;\n vector<vector<int> > G(n);\n SCC scc(n);\n for(int i=0;i<n;i++){\n int c;\n cin>>c;\n G[i].resize(c);\n for(int j=0;j<c;j++) cin>>G[i][j],G[i][j]--;\n for(auto j:G[i]) scc.add_edge(j,i);\n }\n scc.build();\n auto &b=scc.belong;\n int ans=0,lst=-1;\n for(int v=0;v<n;v++){\n for(int u:G[v]){\n if(b[u]!=b[v]) continue;\n if(u==v+1) continue;\n if(u<=lst) continue;\n lst=v;ans++;\n }\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":24360,"score_of_the_acc":-0.9719,"final_rank":16},{"submission_id":"aoj_3046_3145941","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n\nint n,m;\nset<int> g[125252];\n\nint sm[125252];\nvector<int> eds[125252];\n\nint main(){\n scanf(\"%d\",&n);\n REP(i,n){\n scanf(\"%d\",&m);\n while(m--){\n int x;\n scanf(\"%d\",&x);\n g[i].insert(x-1);\n }\n }\n set<int> rm;\n REP(i,n)if(g[i].count(i)){\n rm.insert(i);\n }\n REP(i,n)if(!rm.count(i)){\n set<int>::iterator it = g[i].begin();\n while(it != g[i].end()){\n if(rm.count(*it)){\n g[i].erase(it++);\n }else{\n it++;\n }\n }\n }\n REP(i,n)if(!rm.count(i) && g[i].count(i+1)){\n sm[i+1]++;\n }\n REP(i,n+1)sm[i+1]+=sm[i];\n REP(i,n)if(!rm.count(i)){\n set<int>::iterator it = g[i].begin();\n while(it != g[i].end()){\n int x = *it; it++;\n int y = i;\n if(x==y+1)continue;\n assert(x<y);\n if(y-x == sm[y]-sm[x]){\n eds[x].push_back(y);\n }\n }\n }\n priority_queue<int> Q;\n int ans = rm.size();\n REP(i,n){\n for(int x : eds[i]){\n Q.push(-x);\n }\n if(Q.size() && -Q.top() == i){\n ans++;\n while(Q.size())Q.pop();\n }\n }\n printf(\"%d\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":16804,"score_of_the_acc":-0.6144,"final_rank":11},{"submission_id":"aoj_3046_3145555","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\n#define INF 1e16\n#define mod 1000000007\n\nint N;\nvector<P> rs;\n\nint main(){\n cin>>N;\n ll pre=0;\n rep(i,N){\n ll m;\n cin>>m;\n bool ok=false;\n rep(j,m){\n ll b;\n cin>>b;\n b--;\n if(b>=pre&&b<=i){\n rs.push_back(P(b,i));\n }else if(b==i+1){\n ok=true;\n }\n }\n if(!ok){\n pre=i+1;\n }\n }\n sort(all(rs),[](const P& a,const P& b){ return a.se < b.se; });\n ll crt=0,res=0;\n rep(i,rs.size()){\n if(crt<=rs[i].fi){\n crt=rs[i].se+1; res++;\n }\n }\n cout<<res<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3116,"score_of_the_acc":-0.0106,"final_rank":1},{"submission_id":"aoj_3046_3145536","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for (int i=0;i<(n);i++)\n#define REP2(i,m,n) for (int i=m;i<(n);i++)\ntypedef long long ll;\ntypedef long double ld;\n#define fst first\n#define snd second\n#define all(c) ((c).begin()), ((c).end())\n\n\nstruct graph {\n int n;\n vector<vector<int>> adj, rdj;\n vector<int> ord, visited, group;\n graph(int n) : n(n), adj(n), rdj(n), visited(n), group(n) { }\n void add_edge(int src, int dst) {\n adj[src].push_back(dst);\n rdj[dst].push_back(src);\n }\n\n vector<vector<int>> strongly_connected_components() { // kosaraju\n vector<vector<int>> scc;\n function<void(int,vector<vector<int>>&, vector<int>&)> dfs\n = [&](int u, vector<vector<int>> &adj, vector<int> &out) {\n visited[u] = true;\n for (int v: adj[u])\n if (!visited[v]) dfs(v, adj, out);\n out.push_back(u);\n };\n for (int u = 0; u < n; ++u)\n if (!visited[u]) dfs(u, adj, ord);\n fill(all(visited), false);\n for (int i = n-1; i >= 0; --i)\n if (!visited[ord[i]])\n scc.push_back({}), dfs(ord[i], rdj, scc.back());\n for (int i = 0; i < (int)scc.size(); ++i)\n for (int j = 0; j < (int)scc[i].size(); ++j)\n group[scc[i][j]] = scc[i][0];\n return scc;\n }\n};\n\nbool used[101010];\nint indeg[101010];\nint outdeg[101010];\nvector<int> inv[101010];\nvector<vector<int>> hoge;\n\n\nint main() {\n int N; cin >> N;\n graph g(N);\n int ans = 0;\n hoge = vector<vector<int>>(N);\n\n REP(i, N) {\n int m; cin >> m;\n REP(_, m) {\n int j;\n cin >> j;\n --j;\n hoge[i].push_back(j);\n if (i == j) {\n used[i] = true;\n }\n }\n sort(hoge[i].begin(), hoge[i].end());\n hoge[i].erase(unique(hoge[i].begin(), hoge[i].end()), hoge[i].end());\n }\n\n REP(i, N) ans += used[i];\n\n REP(i, N) if (!used[i]) {\n for (auto j: hoge[i]) if (!used[j]) g.add_edge(j, i);\n for (auto j: hoge[i]) if (!used[j]) inv[i].push_back(j);\n }\n\n vector<vector<int>> scc = g.strongly_connected_components();\n\n REP(i, (int)scc.size()) {\n priority_queue<pair<int, int>> pq;\n REP(j, (int)scc[i].size()) {\n indeg[scc[i][j]] = 0;\n for (auto k: inv[scc[i][j]]) if (g.group[k] == g.group[scc[i][j]]) indeg[scc[i][j]]++;\n pq.push(make_pair(-indeg[scc[i][j]], scc[i][j]));\n }\n while (!pq.empty()) {\n auto p = pq.top();\n pq.pop();\n auto deg = -p.first;\n auto j = p.second;\n if (used[j]) continue;\n vector<int> del = {j};\n vector<int> cand;\n for (auto to: inv[j]) {\n if (used[to] || g.group[j] != g.group[to]) continue;\n del.push_back(to);\n used[to] = true;\n }\n ans += deg;\n used[j] = true;\n for (auto d: del) {\n for (auto e: g.adj[d]) {\n if (used[e] || g.group[d] != g.group[e]) continue;\n indeg[e] -= 1;\n cand.push_back(e);\n }\n }\n sort(cand.begin(), cand.end());\n cand.erase(unique(cand.begin(), cand.end()), cand.end());\n for (auto c: cand) pq.push(make_pair(-indeg[c], c));\n }\n }\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":25588,"score_of_the_acc":-1.0372,"final_rank":18},{"submission_id":"aoj_3046_3145514","code_snippet":"// g++ -std=c++11 a.cpp\n#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<unordered_map>\n#include<utility>\n#include<cmath>\n#include<random>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<bitset>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#include<typeinfo>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define FOR(i,a) for(auto i:a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n#define show1d(v) rep(i,v.size())cout<<\" \"<<v[i];cout<<endl<<endl;\n#define show2d(v) rep(i,v.size()){rep(j,v[i].size())cout<<\" \"<<v[i][j];cout<<endl;}cout<<endl;\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\n//#define int ll\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n// #define mt make_tuple\n// typedef tuple<int,int,int> tp;\n// typedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\n//template<class C>constexpr int size(const C &c){return (int)c.size();}\n//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}\nconst double PI=acos(-1);\nconst double EPS=1e-9;\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\n\nint main(){\n\tint n;\n\tcin>>n;\n\tvvi G(n);\n\tvi h(n);\n\tint co=0;\n\trep(i,n){\n\t\tint m;\n\t\tcin>>m;\n\t\tvi t(m);\n\t\tbool q=false;\n\t\trep(j,m)cin>>t[j];\n\t\trep(j,m)if(i+1==t[j])q=true;\n\t\tif(q)co++;\n\t\telse{\n\t\t\trep(j,m){\n\t\t\t\tint a=t[j];\n\t\t\t\tif(i+2==a)h[i]=1;\n\t\t\t\telse if(i+1==a){\n\t\t\t\t\tco++;\n\t\t\t\t}else G[a-1].pb(i);\n\t\t\t}\n\t\t}\n\t}\n//\tshow1d(h);\n//\tshow2d(G);\n\n\trep(i,n)if(h[i]){\n\t\tint l=i,r;\n\t\twhile(h[i])i++;\n\t\tr=i;\n\t\tvp in;\n\t\tloop(j,l,r)rep(k,G[j].size())\n\t\t\tif(G[j][k]<=r)in.pb({G[j][k],j});\n\t\t\n\t\tsort(all(in));\n//\t\tcout<<l<<\" \"<<r<<endl;\n//\t\trep(j,in.size())cout<<\" \"<<in[j].first<<\" \"<<in[j].second<<endl;\n//\t\tcout<<endl;\n\t\tint t=-1;\n\t\trep(j,in.size()){\n\t\t\tif(t<in[j].second){\n\t\t\t\tco++;\n\t\t\t\tt=in[j].first;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<co<<endl;\n\t\n}","accuracy":1,"time_ms":30,"memory_kb":6828,"score_of_the_acc":-0.1758,"final_rank":5},{"submission_id":"aoj_3046_3145458","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing lint = long long int;\n\nclass UnionFind {\nprivate:\n\tvector< int > data;\n\t\npublic:\n\tUnionFind() {}\n\tUnionFind(int n) : data(n, -1) {}\n\t\n\tbool unionSet(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\t\n\t\tif (x == y) return 0;\n\t\t\n\t\tif (data[y] < data[x]) swap(x, y);\n\t\tdata[x] += data[y]; data[y] = x;\n\t\treturn 1;\n\t}\n\t\n\tbool sameSet(int x, int y) { return root(x) == root(y); }\n\tint root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n\tint size(int x) { return -data[root(x)]; }\n};\n\nint N;\nvector< set< int > > X;\nUnionFind uf;\n\nvoid solve() {\n\tvector< int > max_start(N, -1);\n\tfor (int i=0; i<N; ++i) for (int x : X[i]) if (uf.sameSet(x, i)) max_start[i] = max(max_start[i], x);\n\t\n\t/*\n\tfor (int i=0; i<N; ++i) cerr << max_start[i] << \" \";\n\tcerr << endl;\n\t*/\n\t\n\tint ans = 0, cur = -1;\n\tfor (int i=0; i<N; ++i) {\n\t\tif (max_start[i] >= 0 && cur < max_start[i]) {\n\t\t\tcur = i;\n\t\t\t++ans;\n\t\t}\n\t}\n\tcout << ans << endl;\n}\n\nint main() {\n\tcin >> N;\n\t\n\tX.assign(N, set< int >());\t\n\tuf = UnionFind(N);\n\t\n\tfor (int i=0; i<N; ++i) {\n\t\tint M;\n\t\tcin >> M;\n\t\t\n\t\tfor (int j=0; j<M; ++j) {\n\t\t\tint x;\n\t\t\tcin >> x;\n\t\t\t--x;\n\t\t\tif (x == i+1) uf.unionSet(i,i+1);\n\t\t\telse X[i].insert(x);\n\t\t}\n\t}\n\t\n\tsolve();\n}","accuracy":1,"time_ms":30,"memory_kb":12260,"score_of_the_acc":-0.4175,"final_rank":9},{"submission_id":"aoj_3046_3145309","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <string>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <stdio.h>\nusing namespace std;\n#define int long long\nint MOD = 1000000007;\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tvector<vector<int> > A(N);\n\tint res = 0;\n\tfor (int i = 0; i < N; i++) {\n\t\tint M;\n\t\tcin >> M;\n\t\tint a;\n\t\tfor (int j = 0; j < M; j++) {\n\t\t\tcin >> a;\n\t\t\ta--;\n\t\t\tA[i].push_back(a);\n\t\t}\n\t\tsort(A[i].begin(), A[i].end());\n\t\tA[i].erase(unique(A[i].begin(), A[i].end()), A[i].end());\n\t}\n\tint mx = -1;\n\tvector<int> E(N, 1);\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < A[i].size(); j++) {\n\t\t\tif (A[i][j] == i) {\n\t\t\t\tE[i] = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = N - 1; i >= 0; i--) {\n\t\tif (E[i] == 0) {\n\t\t\tmx = -1;\n\t\t}\n\t\telse if ((int)A[i].size() == 0) {\n\t\t\tres++;\n\t\t\tmx = -1;\n\t\t}\n\t\telse if (A[i].back() == i + 1 && E[i + 1] == 1) {\n\t\t\tif (mx == i) {\n\t\t\t\tmx = -1;\n\t\t\t\tE[i] = 0;\n\t\t\t\t//cerr << \"erase \" << i << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint x = (int)A[i].size() - 2;\n\t\t\t\twhile (x >= 0 && E[A[i][x]] == 0) {\n\t\t\t\t\tx--;\n\t\t\t\t}\n\t\t\t\tif (x >= 0) {\n\t\t\t\t\tmx = max(mx, A[i][x]);\n\t\t\t\t}\n\t\t\t\tres++;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tres++;\n\t\t\tint x = (int)A[i].size() - 1;\n\t\t\twhile (x >= 0 && E[A[i][x]] == 0) {\n\t\t\t\tx--;\n\t\t\t}\n\t\t\tif (x >= 0) {\n\t\t\t\tmx = A[i][x];\n\t\t\t}\n\t\t}\n\t}\n\tcout << N - res << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":7656,"score_of_the_acc":-0.202,"final_rank":6},{"submission_id":"aoj_3046_3145297","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing namespace std;\nusing Int = long long;\n\n//BEGIN CUT HERE\ntemplate< typename T >\nstruct MonotoneMinima {\n using F = function< T(int, int) >;\n int n;\n F dist;\n T INF;\n vector< T > dp;\n\n // dist(i,l) + dist(j,k) >= dist(i,k) + dist(j,l)\n // if( i<=j && k<=l )\n MonotoneMinima(int n, F dist, T INF) :\n n(n), dist(dist), INF(INF), dp(n + 1, INF) {}\n\n void dfs(int l, int r, int a, int b) {\n if(l == r) return;\n int m = (l + r) >> 1;\n T ma = INF;\n int mi = -1;\n for(int i = a; i < b; i++) {\n T tmp = dp[i + 1] + dist(i, m);\n if(tmp < ma) ma = tmp, mi = i;\n }\n dp[m] = min(dp[m], ma);\n dfs(l, m, a, mi + 1);\n dfs(m + 1, r, mi, b);\n }\n\n void solve(int l, int r) {\n if(l + 1 == r) {\n dp[l] = min(dp[l], dp[r] + dist(l, l));\n return;\n }\n int m = (l + r) >> 1;\n solve(m, r);\n dfs(l, m, m, r);\n solve(l, m);\n }\n\n T solve() {\n dp[n] = 0;\n solve(0, n);\n return dp[0];\n }\n};\n\nstruct SuccinctIndexableDictionary {\n size_t length;\n size_t blocks;\n vector< unsigned > bit, sum;\n\n SuccinctIndexableDictionary() {\n }\n\n SuccinctIndexableDictionary(size_t _length) {\n length = _length;\n blocks = (length + 31) >> 5;\n bit.assign(blocks, 0U);\n sum.assign(blocks, 0U);\n }\n\n void set(int k) {\n bit[k >> 5] |= 1U << (k & 31);\n }\n\n void build() {\n sum[0] = 0U;\n for(int i = 1; i < blocks; i++) {\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\n }\n }\n\n bool operator[](int k) const {\n return (bool((bit[k >> 5] >> (k & 31)) & 1));\n }\n\n int rank(int k) {\n return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));\n }\n\n int rank(bool val, int k) {\n return (val ? rank(k) : k - rank(k));\n }\n\n int select(bool val, int k) {\n if(k < 0 || rank(val, length) <= k) return (-1);\n int low = 0, high = length;\n while(high - low > 1) {\n int mid = (low + high) >> 1;\n if(rank(val, mid) >= k + 1) high = mid;\n else low = mid;\n }\n return (high - 1);\n }\n\n int select(bool val, int i, int l) {\n return select(val, i + rank(val, l));\n }\n};\n\ntemplate< class T, int MAXLOG >\nstruct WaveletMatrix {\n size_t length;\n SuccinctIndexableDictionary matrix[MAXLOG];\n int zs[MAXLOG];\n int buff1[MAXLOG], buff2[MAXLOG];\n\n void max_dfs(int d, int l, int r, int &k, T val, vector< T > &vs) {\n if(l >= r || !k) return;\n if(d == MAXLOG) {\n while(l++ < r && k > 0) vs.push_back(val), k--;\n return;\n }\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\n max_dfs(d + 1, lc + zs[d], rc + zs[d], k, 1ULL << (MAXLOG - d - 1) | val, vs);\n max_dfs(d + 1, l - lc, r - rc, k, val, vs);\n }\n\n T max_dfs(int d, int l, int r, T val, T a, T b) {\n if(r - l <= 0 || val >= b) return -1;\n if(d == MAXLOG) return val >= a ? val : -1;\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\n T ret = max_dfs(d + 1, lc + zs[d], rc + zs[d], 1ULL << (MAXLOG - d - 1) | val, a, b);\n if(~ret) return ret;\n return max_dfs(d + 1, l - lc, r - rc, val, a, b);\n }\n\n int freq_dfs(int d, int l, int r, T val, T a, T b) {\n if(l == r) return 0;\n if(d == MAXLOG) return (a <= val && val < b) ? r - l : 0;\n T nv = 1ULL << (MAXLOG - d - 1) | val, nnv = ((1ULL << (MAXLOG - d - 1)) - 1) | nv;\n if(nnv < a || b <= val) return 0;\n if(a <= val && nnv < b) return r - l;\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\n return freq_dfs(d + 1, l - lc, r - rc, val, a, b) +\n freq_dfs(d + 1, lc + zs[d], rc + zs[d], nv, a, b);\n }\n\n void list_dfs(int d, int l, int r, T val, T a, T b, vector< pair< T, int>> &vs) {\n if(val >= b || r - l <= 0) return;\n if(d == MAXLOG) {\n if(a <= val) vs.push_back(make_pair(val, r - l));\n return;\n }\n T nv = val | (1LL << (MAXLOG - d - 1)), nnv = nv | (((1LL << (MAXLOG - d - 1)) - 1));\n if(nnv < a) return;\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\n list_dfs(d + 1, l - lc, r - rc, val, a, b, vs);\n list_dfs(d + 1, lc + zs[d], rc + zs[d], nv, a, b, vs);\n }\n\n\n WaveletMatrix(vector< T > data) {\n length = data.size();\n vector< T > l(length), r(length);\n for(int depth = 0; depth < MAXLOG; depth++) {\n matrix[depth] = SuccinctIndexableDictionary(length + 1);\n int left = 0, right = 0;\n for(int i = 0; i < length; i++) {\n bool k = (data[i] >> (MAXLOG - depth - 1)) & 1;\n if(k) r[right++] = data[i], matrix[depth].set(i);\n else l[left++] = data[i];\n }\n zs[depth] = left;\n matrix[depth].build();\n swap(l, data);\n for(int i = 0; i < right; i++) data[left + i] = r[i];\n }\n }\n\n T access(int k) {\n int ret = 0;\n bool bit;\n for(int depth = 0; depth < MAXLOG; depth++) {\n bit = matrix[depth][k];\n ret = (ret << 1) | bit;\n k = matrix[depth].rank(bit, k) + zs[depth] * bit;\n }\n return (ret);\n }\n\n int rank(T val, int k) {\n int l = 0, r = k;\n for(int depth = 0; depth < MAXLOG; depth++) {\n buff1[depth] = l, buff2[depth] = r;\n bool bit = (val >> (MAXLOG - depth - 1)) & 1;\n l = matrix[depth].rank(bit, l) + zs[depth] * bit;\n r = matrix[depth].rank(bit, r) + zs[depth] * bit;\n }\n return (r - l);\n }\n\n int select(T val, int kth) {\n rank(val, length);\n for(int depth = MAXLOG - 1; depth >= 0; depth--) {\n bool bit = (val >> (MAXLOG - depth - 1)) & 1;\n kth = matrix[depth].select(bit, kth, buff1[depth]);\n if(kth >= buff2[depth] || kth < 0) return (-1);\n kth -= buff1[depth];\n }\n return (kth);\n }\n\n int select(T val, int k, int l) {\n return (select(val, k + rank(val, l)));\n }\n\n\n int quantile(int left, int right, int kth) {\n if(right - left <= kth || kth < 0) return (-1);\n T ret = 0;\n for(int depth = 0; depth < MAXLOG; depth++) {\n int l = matrix[depth].rank(1, left);\n int r = matrix[depth].rank(1, right);\n if(r - l > kth) {\n left = l + zs[depth];\n right = r + zs[depth];\n ret |= 1ULL << (MAXLOG - depth - 1);\n } else {\n kth -= r - l;\n left -= l;\n right -= r;\n }\n }\n return (ret);\n }\n\n vector< T > topk(int l, int r, int k) {\n if(r - l < k) k = r - l;\n if(k < 0) return (vector< T >());\n vector< T > ret;\n max_dfs(0, l, r, k, 0, ret);\n return (ret);\n }\n\n vector< pair< T, int > > freq_list(int l, int r, T a, T b) {\n vector< pair< T, int > > ret;\n list_dfs(0, l, r, 0, a, b, ret);\n return (ret);\n }\n\n vector< pair< int, T > > get_rect(int l, int r, T a, T b) {\n vector< pair< T, int > > res = freq_list(l, r, a, b);\n vector< pair< int, T > > ret;\n for(auto &e : res) {\n for(int i = 0; i < e.second; i++) {\n ret.emplace_back(select(e.first, i, l), e.first);\n }\n }\n return (ret);\n }\n\n int rangefreq(int left, int right, T lower, T upper) {\n return (freq_dfs(0, left, right, 0, lower, upper));\n }\n};\n\n\nint main() {\n int N;\n vector< int > g[100000];\n bool nxt[100000] = {};\n\n\n cin >> N;\n for(int i = 0; i < N; i++) {\n int x;\n cin >> x;\n bool flag = false;\n while(x--) {\n int v;\n cin >> v;\n --v;\n if(v == i + 1) nxt[i] = true;\n else g[i].emplace_back(v);\n }\n }\n vector< int > near(N);\n for(int i = 0; i < N; i++) {\n sort(begin(g[i]), end(g[i]));\n near[i] = 0;\n if(g[i].size()) near[i] = g[i].back() + 1;\n }\n WaveletMatrix< int, 19 > mat(near);\n\n auto dist = [&](int r, int l) {\n int cost = nxt[r] | near[r] - 1 >= l;\n cost += mat.rangefreq(l, r, l + 1, N + 5);\n return cost;\n };\n using int64 = long long;\n const int64 INF = 1LL << 60;\n MonotoneMinima< int64 > beet(N, dist, INF);\n cout << beet.solve() << endl;\n}","accuracy":1,"time_ms":1030,"memory_kb":8856,"score_of_the_acc":-0.798,"final_rank":13},{"submission_id":"aoj_3046_3145264","code_snippet":"#include<bits/stdc++.h>\n#define X first\n#define Y sevcond\n#define pb emplace_back\n#define eb pb\n#define rep(X,Y) for(int X=0;X<(Y);++X)\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\n#define all(X) (X).begin(),(X).end()\n#define rall(X) (X).rbegin(),(X).rend()\n\nusing namespace std;\nusing ll=long long;\nconst ll MOD=1e9+7;\nusing Graph=vector<vector<int>>;\n\n#include<chrono>\nusing namespace chrono;\nsystem_clock::time_point starttime=system_clock::now();\n\nint main(){\n\tint n;\n\tcin>>n;\n\tGraph g(n);\n\trep(i,n){\n\t\tint m;\n\t\tcin>>m;\n\t\trep(j,m){\n\t\t\tint v;\n\t\t\tcin>>v; --v;\n\t\t\tg[v].pb(i);\n\t\t}\n\t}\n\tvector<int> vst(n),in(n,-1);\n\tint ans=0;\n\tfunction<int(int,int)> dfs=\n\t\t[&](int v,int d)->int{\n\t\t\tif(vst[v]) return -1;\n\t\t\tin[v]=d;\n\t\t\tvst[v]=1;\n\t\t\t// cout<<v<<\",\"<<d<<endl;\n\t\t\tint re=-1;\n\t\t\tfor(int w:g[v]){\n\t\t\t\t// cout<<v<<\":\"<<w<<\",\"<<in[w]<<endl;\n\t\t\t\tif(in[w]>=0) re=max(re,in[w]);\n\t\t\t\telse re=max(re,dfs(w,d+1));\n\t\t\t}\n\t\t\t// cout<<v<<\",\"<<d<<\",\"<<re<<endl;\n\t\t\tin[v]=-1;\n\t\t\tif(re==d){\n\t\t\t\t++ans;\n\t\t\t\tre=-1;\n\t\t\t}\n\t\t\treturn re;\n\t\t};\n\tint re=MOD;\n\tvector<int> ind(n); iota(all(ind),0);\n\t// ind={4,1,2,3,0};\n\t// rep(i,n) dfs(ind[i],0);\n\t// cout<<ans<<endl;\n\t// return 0;\n\twhile((duration_cast<milliseconds>(system_clock::now()-starttime).count())<1900){\n\t\tans=0;\n\t\tfill(all(vst),0);\n\t\tfill(all(in),-1);\n\t\trep(i,n) dfs(ind[i],0);\n\t\tre=min(re,ans);\n\t\t// if(ans==0){\n\t\t// \trep(i,n) cout<<ind[i]<<\",\";cout<<endl;\n\t\t// \texit(0);\n\t\t// }\n\t\trandom_shuffle(all(ind));\n\t\trep(i,n) random_shuffle(all(g[i]));\n\t}\n\tcout<<re<<endl;\n}","accuracy":0.3939393939393939,"time_ms":1890,"memory_kb":3196,"score_of_the_acc":-1.0036,"final_rank":20},{"submission_id":"aoj_3046_3145254","code_snippet":"#include<bits/stdc++.h>\n#define X first\n#define Y sevcond\n#define pb emplace_back\n#define eb pb\n#define rep(X,Y) for(int X=0;X<(Y);++X)\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\n#define all(X) (X).begin(),(X).end()\n#define rall(X) (X).rbegin(),(X).rend()\n\nusing namespace std;\nusing ll=long long;\nconst ll MOD=1e9+7;\nusing Graph=vector<vector<int>>;\n\n#include<chrono>\nusing namespace chrono;\nsystem_clock::time_point starttime=system_clock::now();\n\nint main(){\n\tint n;\n\tcin>>n;\n\tGraph g(n);\n\trep(i,n){\n\t\tint m;\n\t\tcin>>m;\n\t\trep(j,m){\n\t\t\tint v;\n\t\t\tcin>>v; --v;\n\t\t\tg[v].pb(i);\n\t\t}\n\t}\n\tvector<int> vst(n),in(n,-1);\n\tint ans=0;\n\tfunction<int(int,int)> dfs=\n\t\t[&](int v,int d)->int{\n\t\t\tif(vst[v]) return -1;\n\t\t\tin[v]=d;\n\t\t\tvst[v]=1;\n\t\t\t// cout<<v<<\",\"<<d<<endl;\n\t\t\tint re=-1;\n\t\t\tfor(int w:g[v]){\n\t\t\t\t// cout<<v<<\":\"<<w<<\",\"<<in[w]<<endl;\n\t\t\t\tif(in[w]>=0) re=max(re,in[w]);\n\t\t\t\telse re=max(re,dfs(w,d+1));\n\t\t\t}\n\t\t\t// cout<<v<<\",\"<<d<<\",\"<<re<<endl;\n\t\t\tin[v]=-1;\n\t\t\tif(re==d){\n\t\t\t\t++ans;\n\t\t\t\tre=-1;\n\t\t\t}\n\t\t\treturn re;\n\t\t};\n\tint re=MOD;\n\tvector<int> ind(n); iota(all(ind),0);\n\t// ind={4,1,2,3,0};\n\t// rep(i,n) dfs(ind[i],0);\n\t// cout<<ans<<endl;\n\t// return 0;\n\twhile((duration_cast<milliseconds>(system_clock::now()-starttime).count())<1900){\n\t\tans=0;\n\t\tfill(all(vst),0);\n\t\tfill(all(in),-1);\n\t\trep(i,n) dfs(ind[i],0);\n\t\tre=min(re,ans);\n\t\t// if(ans==0){\n\t\t// \trep(i,n) cout<<ind[i]<<\",\";cout<<endl;\n\t\t// \texit(0);\n\t\t// }\n\t\trandom_shuffle(all(ind));\n\t}\n\tcout<<re<<endl;\n}","accuracy":0.3939393939393939,"time_ms":1890,"memory_kb":3148,"score_of_the_acc":-1.0014,"final_rank":19},{"submission_id":"aoj_3046_3130649","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\nusing T = tuple<Int,Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\ntemplate<class T>void prArr(T a,string s=\" \"){Int i=0;for(T t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\n\nclass SCC{\npublic:\n int V,K; //頂点数, scc後の頂点数\n vector<vector<int> > G; //グラフの隣接リストの表現\n vector<vector<int> >rG; //辺の向きを逆にしたグラフ\n vector<vector<int> >DAG; //scc後のグラフの隣接リストの表現\n vector<vector<int> >rDAG; //scc後の辺の向きを逆にしたグラフ\n vector<int> vs; //帰りがけ順の並び\n vector<int>used; //すでに調べたか\n vector<int> cmp; //属する強連結成分のトポロジカル順\n vector<vector<int> > member; //scc後の同じグループのノードの集合\n int ok; //buildされているか。\n SCC(){V = K = -1;}\n SCC(int V):V(V),G(V),rG(V),used(V,0),cmp(V),ok(0){}\n \n void add_edge(int from,int to){\n assert(from<V && to<V);\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n\n void dfs(int v){\n used[v]=true;\n for(int nx:G[v]) if(!used[nx]) dfs(nx);\n vs.push_back(v);\n }\n\n void rdfs(int v,int k){\n used[v]=true;\n cmp[v]=k;\n for(int nx:rG[v]) if(!used[nx]) rdfs(nx,k);\n }\n\n int build(bool makeDAG = 0){ //DAGのグラフも作りたかったらmakeDAGを1にする\n ok = true;\n used.clear(); used.resize(V,0);\n vs.clear();\n for(int v=0;v<V;v++) if(!used[v]) dfs(v);\n \n used.clear(); used.resize(V,0);\n int &k= K = 0;\n for(int i=vs.size()-1;i>=0;i--)if(!used[vs[i]]) rdfs(vs[i],k++);\n\n member.clear();\n member.resize(k);\n for(int i=0;i<V;i++) member[cmp[i]].push_back(i);\n \n if(makeDAG) DAG = getDAG(G), rDAG = getDAG(rG); //O(ElogE)\n \n return k;\n }\n\n bool same(int u, int v){assert(ok);return cmp[u] == cmp[v];}\n\nprivate:\n vector<vector<int> > getDAG(const vector<vector<int> > &G){\n assert(K>=0);\n vector<vector<int> >res(K);\n for(int from=0;from<V;from++)\n for(int to:G[from]) if(cmp[from]!=cmp[to]) res[cmp[from]].push_back(cmp[to]);\n \n for(int i=0;i<K;i++){\n sort(res[i].begin(),res[i].end());\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\n }\n return res;\n }\n};\n\n\nsigned main(){\n srand((unsigned)time(NULL));\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n \n int n;\n cin>>n;\n\n SCC scc(n);\n vector<vector<int> > G(n);\n for(int i=0;i<n;i++){\n int m;\n cin>>m;\n for(int j=0;j<m;j++){\n int to;\n cin>>to; to--;\n assert(i >= to -1);\n scc.add_edge(i, to);\n G[i].push_back(to);\n }\n }\n\n scc.build();\n vector<P> A;\n for(int i=0;i<n;i++){\n for(int to:G[i]){\n if(!scc.same(i, to)) continue;\n if(i < to) continue;\n int l = to, r = i;\n A.push_back(P(r, l));\n }\n }\n \n sort(A.begin(), A.end());\n int ans = 0;\n int last = -1;\n for(P p:A){\n int r, l; tie(r, l) = p;\n if(last < l){\n ans++;\n last = r;\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":20728,"score_of_the_acc":-0.7944,"final_rank":12},{"submission_id":"aoj_3046_3130558","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct SCC{\n int n;\n vector<vector<int> > G,rG,T,C;\n vector<int> vs,used,belong;\n SCC(){}\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\n \n void add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n \n void input(int m,int offset=0){\n int a,b;\n for(int i=0;i<m;i++){\n cin>>a>>b;\n add_edge(a+offset,b+offset);\n }\n }\n \n void dfs(int v){\n used[v]=1;\n for(int i=0;i<(int)G[v].size();i++){\n if(!used[G[v][i]]) dfs(G[v][i]);\n }\n vs.push_back(v);\n }\n \n void rdfs(int v,int k){\n used[v]=1;\n belong[v]=k;\n C[k].push_back(v);\n for(int i=0;i<(int)rG[v].size();i++){\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\n }\n }\n \n int build(){\n fill(used.begin(),used.end(),0);\n vs.clear();\n for(int v=0;v<n;v++){\n if(!used[v]) dfs(v);\n }\n fill(used.begin(),used.end(),0);\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(!used[vs[i]]){\n\tT.push_back(vector<int>());\n\tC.push_back(vector<int>());\n\trdfs(vs[i],k++);\n }\n }\n for(int i=0;i<n;i++)\n for(int u:G[i])\n\tif(belong[i]!=belong[u])\n\t T[belong[i]].push_back(belong[u]);\n for(int i=0;i<k;i++){\n sort(T[i].begin(),T[i].end());\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\n }\n return k;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n cin>>n;\n vector<vector<int> > G(n);\n SCC scc(n);\n for(int i=0;i<n;i++){\n int c;\n cin>>c;\n G[i].resize(c);\n for(int j=0;j<c;j++) cin>>G[i][j],G[i][j]--;\n for(auto j:G[i]) scc.add_edge(j,i);\n }\n scc.build();\n auto &b=scc.belong;\n int ans=0,lst=-1;\n for(int v=0;v<n;v++){\n for(int u:G[v]){\n if(b[u]!=b[v]) continue;\n if(u==v+1) continue;\n if(u<=lst) continue;\n lst=v;ans++;\n }\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":24248,"score_of_the_acc":-0.9723,"final_rank":17},{"submission_id":"aoj_3046_3130554","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\nusing T = tuple<Int,Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\ntemplate<class T>void prArr(T a,string s=\" \"){Int i=0;for(T t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\n\nclass SCC{\npublic:\n int V,K; //頂点数, scc後の頂点数\n vector<vector<int> > G; //グラフの隣接リストの表現\n vector<vector<int> >rG; //辺の向きを逆にしたグラフ\n vector<vector<int> >DAG; //scc後のグラフの隣接リストの表現\n vector<vector<int> >rDAG; //scc後の辺の向きを逆にしたグラフ\n vector<int> vs; //帰りがけ順の並び\n vector<int>used; //すでに調べたか\n vector<int> cmp; //属する強連結成分のトポロジカル順\n vector<vector<int> > member; //scc後の同じグループのノードの集合\n int ok; //buildされているか。\n SCC(){V = K = -1;}\n SCC(int V):V(V),G(V),rG(V),used(V,0),cmp(V),ok(0){}\n \n void add_edge(int from,int to){\n assert(from<V && to<V);\n G[from].push_back(to);\n rG[to].push_back(from);\n }\n\n void dfs(int v){\n used[v]=true;\n for(int nx:G[v]) if(!used[nx]) dfs(nx);\n vs.push_back(v);\n }\n\n void rdfs(int v,int k){\n used[v]=true;\n cmp[v]=k;\n for(int nx:rG[v]) if(!used[nx]) rdfs(nx,k);\n }\n\n int build(bool makeDAG = 0){ //DAGのグラフも作りたかったらmakeDAGを1にする\n ok = true;\n used.clear(); used.resize(V,0);\n vs.clear();\n for(int v=0;v<V;v++) if(!used[v]) dfs(v);\n \n used.clear(); used.resize(V,0);\n int &k= K = 0;\n for(int i=vs.size()-1;i>=0;i--)if(!used[vs[i]]) rdfs(vs[i],k++);\n\n member.clear();\n member.resize(k);\n for(int i=0;i<V;i++) member[cmp[i]].push_back(i);\n \n if(makeDAG) DAG = getDAG(G), rDAG = getDAG(rG); //O(ElogE)\n \n return k;\n }\n\n bool same(int u, int v){assert(ok);return cmp[u] == cmp[v];}\n\nprivate:\n vector<vector<int> > getDAG(const vector<vector<int> > &G){\n assert(K>=0);\n vector<vector<int> >res(K);\n for(int from=0;from<V;from++)\n for(int to:G[from]) if(cmp[from]!=cmp[to]) res[cmp[from]].push_back(cmp[to]);\n \n for(int i=0;i<K;i++){\n sort(res[i].begin(),res[i].end());\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\n }\n return res;\n }\n};\n\n\nsigned main(){\n srand((unsigned)time(NULL));\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n \n int n;\n cin>>n;\n\n SCC scc(n);\n vector<vector<int> > G(n);\n for(int i=0;i<n;i++){\n int m;\n cin>>m;\n for(int j=0;j<m;j++){\n int to;\n cin>>to; to--;\n assert(i >= to -1);\n scc.add_edge(i, to);\n G[i].push_back(to);\n }\n }\n\n scc.build();\n vector<P> A;\n for(int i=0;i<n;i++){\n for(int to:G[i]){\n if(!scc.same(i, to)) continue;\n if(i < to) continue;\n int l = to, r = i;\n A.push_back(P(r, l));\n }\n }\n \n sort(A.begin(), A.end());\n int ans = 0;\n int last = -1;\n for(P p:A){\n int r, l; tie(r, l) = p;\n if(last < l){\n ans++;\n last = r;\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":20964,"score_of_the_acc":-0.8049,"final_rank":14},{"submission_id":"aoj_3046_3130547","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define all(v) (v).begin(), (v).end()\n\nusing Pi = pair<int, int>;\nusing vint = vector<int>;\nusing Graph = vector<vint>;\n\nGraph get_rev(const Graph& G) {\n int V = G.size();\n Graph H(V);\n for(int v = 0; v < V; ++v) {\n for(int u : G[v]) H[u].push_back(v);\n }\n return H;\n}\nvoid dfs(const Graph& G, int v, vint& ord, vint& used) {\n used[v] = 1;\n for(int u : G[v]) if(!used[u]) dfs(G, u, ord, used);\n ord.push_back(v);\n}\nvoid rdfs(const Graph& H, int v, int id, vint& cmp) {\n cmp[v] = id;\n for(int u : H[v]) if(cmp[u] == -1) rdfs(H, u, id, cmp);\n}\nvint decompose(const Graph& G) {\n Graph H = get_rev(G);\n int V = G.size();\n vint ord, used(V, 0);\n for(int v = 0; v < V; ++v) if(!used[v]) dfs(G, v, ord, used);\n reverse(all(ord));\n int sz = 0;\n vint cmp(V, -1);\n for(int v : ord) if(cmp[v] == -1) rdfs(H, v, sz++, cmp);\n\n return cmp;\n}\n\nint main() {\n int N;\n cin >> N;\n Graph G(N);\n for(int i = 0; i < N; ++i) {\n int k;\n cin >> k;\n for(int j = 0; j < k; ++j) {\n int job;\n cin >> job; --job;\n G[job].push_back(i);\n }\n }\n vint cmp = decompose(G);\n vector<Pi> vec;\n for(int l = 0; l < N; ++l) {\n for(int r : G[l]) {\n if(cmp[l] != cmp[r] || l > r) continue;\n vec.emplace_back(r, l);\n }\n }\n sort(all(vec));\n int ans = 0, last = -1;\n for(Pi p : vec) {\n if(last < p.second) ++ans, last = p.first;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":11684,"score_of_the_acc":-0.3972,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_3046_4405872\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100005\\n\\n\\n\\nstruct GROUP{\\n\\tvector<int> nodes;\\n};\\n\\nGROUP group[NUM]; //強連結成分のグループ\\nint N;\\nvector<int> G[NUM];\\nvector<int> reverse_G[NUM];\\nstack<int> S;\\nmap<pair<int,int>,bool> MAP;\\n\\nbool check[NUM],SELF[NUM];\\nint table[NUM],work[NUM];\\ndouble sleep[NUM];\\n\\nint group_index;\\n\\nvoid dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tif(!check[G[node_id][i]])dfs(G[node_id][i]);\\n\\t}\\n\\tS.push(node_id);\\n}\\n\\nvoid reverse_dfs(int node_id){\\n\\tcheck[node_id] = true;\\n\\n\\ttable[node_id] = group_index;\\n\\tgroup[group_index].nodes.push_back(node_id); //group[group_index]にノードを突っ込む\\n\\n\\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\\n\\t\\tif(!check[reverse_G[node_id][i]])reverse_dfs(reverse_G[node_id][i]);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint num,pre_node;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tSELF[i] = false;\\n\\n\\t\\tscanf(\\\"%d\\\",&num);\\n\\n\\t\\tfor(int k = 0; k < num; k++){\\n\\t\\t\\tscanf(\\\"%d\\\",&pre_node);\\n\\t\\t\\tpre_node--;\\n\\n\\t\\t\\tif(pre_node == i){\\n\\n\\t\\t\\t\\tSELF[i] = true;\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto at = MAP.find(make_pair(pre_node,i));\\n\\t\\t\\tif(at != MAP.end())continue;\\n\\n\\t\\t\\tMAP[make_pair(pre_node,i)] = true;\\n\\n\\t\\t\\tG[pre_node].push_back(i);\\n\\t\\t\\treverse_G[i].push_back(pre_node);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++)check[i] = false;\\n\\n\\tfor(int i = 0; i < N;i++){\\n\\t\\tif(!check[i])dfs(i);\\n\\t}\\n\\n\\tfor(int i = 0; i < N;i++)check[i] = false;\\n\\n\\tgroup_index = -1;\\n\\n\\twhile(!S.empty()){\\n\\t\\tif(!check[S.top()]){\\n\\t\\t\\tgroup_index++;\\n\\n\\t\\t\\treverse_dfs(S.top());\\n\\t\\t}\\n\\t\\tS.pop();\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\twork[i] = -BIG_NUM;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < reverse_G[i].size(); k++){\\n\\t\\t\\tint tmp_node = reverse_G[i][k];\\n\\n\\t\\t\\tif(tmp_node > i || table[i] != table[tmp_node])continue;\\n\\n\\t\\t\\twork[i] = max(work[i],tmp_node);\\n\\t\\t}\\n\\t}\\n\\n\\tint tmp = -1;\\n\\tint ans = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(work[i] == -BIG_NUM)continue;\\n\\t\\tif(tmp < work[i]){\\n\\t\\t\\tans++;\\n\\t\\t\\ttmp = i;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 23496,\n \"score_of_the_acc\": -0.9388,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3046_3668751\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing Graph=vector<vector<int>>;\\nint main(){\\n int n;\\n cin>>n;\\n vector<int> upper(n+1);\\n vector<int> self(n+1);\\n self[n]=true;\\n\\n Graph g(n);\\n for(int i=0;i<n;i++){\\n int m;\\n cin>>m;\\n while(m--){\\n int x;\\n cin>>x;\\n x--;\\n if(x==i) self[i]=true;\\n if(x<i) g[x].push_back(i);\\n if(i<x) upper[i]=true;\\n }\\n }\\n vector<int> flag(n);\\n int res=0;\\n int l=0;\\n for(int i=0;i<=n;i++){\\n if(self[i] || flag[i]){\\n res++;\\n while(l<i){\\n\\tfor(auto to:g[l]) flag[to]=false;\\n\\tl++;\\n }\\n }\\n else if(upper[i]){\\n for(auto to:g[i]) flag[to]=true;\\n }\\n else{\\n while(l<i){\\n\\tfor(auto to:g[l]) flag[to]=false;\\n\\tl++;\\n }\\n }\\n }\\n cout<<res-1<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7460,\n \"score_of_the_acc\": -0.2039,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3046_3214244\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nstruct Edge {\\n\\tint src;\\n\\tint dst;\\n\\tlong long int A;\\n\\tlong long int B;\\n};\\nstruct aa {\\n\\tint now;\\n\\tlong long int cost;\\n};\\nbool operator <(const aa&l, const aa&r) {\\n\\treturn l.cost>r.cost;\\n}\\nlong long int ce(long long int a,long long int b) {\\n\\treturn (a-1)/b+1;\\n}\\nint main() {\\n\\tint N;cin>>N;\\n\\tvector<int>valids(N,true),need_next(N),need_pre(N);\\n\\tvector<int>l_cnts(N);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint K;cin>>K;\\n\\t\\tvector<int>v;\\n\\t\\tfor (int k = 0; k < K; ++k) {\\n\\t\\t\\tint a;cin>>a;\\n\\t\\t\\ta--;\\n\\t\\t\\tv.push_back(a);\\n\\t\\t\\tif (a == i) {\\n\\t\\t\\t\\tvalids[i]=false;\\n\\t\\t\\t}\\n\\t\\t\\tif (a == i - 1) {\\n\\t\\t\\t\\tneed_pre[i]=true;\\n\\t\\t\\t}\\n\\t\\t\\telse if (a == i + 1) {\\n\\t\\t\\t\\tneed_next[i]=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(v.begin(),v.end());\\n\\t\\tv.erase(unique(v.begin(),v.end()),v.end());\\n\\t\\tauto it=lower_bound(v.begin(),v.end(),i);\\n\\t\\t\\t\\n\\t\\n\\t\\tl_cnts[i]=it==v.begin()?30000000:i-*prev(it);\\n\\t}\\n\\tvector<int>dp(N+1);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\n\\t\\tdp[i + 1] = max(dp[i+1],dp[i]);\\n\\t\\tif (!valids[i]) {\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (need_next[i]) {\\n\\t\\t\\t\\tint k=i+1;\\n\\t\\t\\t\\tint sum=1;\\n\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\tif (l_cnts[k]<=sum) {\\n\\t\\t\\t\\t\\t\\tdp[k+1]=max(dp[k+1],dp[i]+sum);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tif (valids[k]) {\\n\\t\\t\\t\\t\\t\\t\\tif (need_next[k]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[k+1]=max(dp[k+1],dp[i]+sum);\\n\\t\\t\\t\\t\\t\\t\\t\\tk++;\\n\\t\\t\\t\\t\\t\\t\\t\\tsum++;\\n\\t\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (l_cnts[k] > sum) {\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[k + 1] = max(dp[k + 1],dp[i]+ sum + 1);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[k+1]=max(dp[k+1],dp[i]+sum);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tdp[k+1]=max(dp[k+1],dp[i]+sum);\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tdp[i+1]=max(dp[i]+1,dp[i+1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<N-dp[N]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4728,\n \"score_of_the_acc\": -0.0824,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3046_3208449\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\n/* Starry Sky Tree */\\n//0-index\\n\\nstruct StarrySkyTree{\\n typedef int Type;\\n int segn2;\\n vector<Type> data,s_data;\\n function<Type(Type, Type)> merge;\\n \\n StarrySkyTree(function<Type(Type, Type)> merge, int n): merge(merge)\\n {\\n for(segn2=1;segn2<n;segn2*=2);\\n data.assign(segn2*2,0);\\n s_data.assign(segn2*2,0);\\n }\\n\\n StarrySkyTree(int n): //Original Ver.\\n StarrySkyTree([](Type a, Type b){ return max(a, b); }, n) {}\\n \\n //get minimum value of [a,b)\\n Type query(int a,int b,int l=0,int r=-1,int k=0){\\n if(r==-1) r+=segn2;\\n if(r <= a || b <= l) return -INF; //大きさに注意\\n if(a <= l && r <= b) return data[k] + s_data[k];\\n return merge(query(a,b,l,(l+r)/2,k*2+1),query(a,b,(l+r)/2,r,k*2+2))+s_data[k];\\n }\\n \\n //add x to [a,b)\\n Type add(int a,int b,Type x,int l=0,int r=-1,int k=0){\\n if(r==-1) r+=segn2;\\n if(a <= l && r <= b){\\n s_data[k]+=x;\\n }else if(a < r && l < b){\\n data[k] = merge(add(a,b,x,l,(l+r)/2,k*2+1),add(a,b,x,(l+r)/2,r,k*2+2));\\n }\\n return data[k] + s_data[k];\\n }\\n \\n};\\n\\nbool hasnext[SIZE], hasown[SIZE];\\nint prevmax[SIZE];\\n\\nint main(){\\n int n, m, x;\\n\\n scanf(\\\"%d\\\", &n);\\n\\n for(int i=0;i<n;i++) prevmax[i] = -1;\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\", &m);\\n for(int j=0;j<m;j++){\\n scanf(\\\"%d\\\", &x);\\n x--;\\n hasnext[i] |= x == i+1;\\n hasown[i] |= x == i;\\n if(x < i) prevmax[i] = max(prevmax[i], x);\\n }\\n }\\n\\n StarrySkyTree seg(n+1);\\n\\n seg.add(1,n+1, -INF);\\n \\n for(int i=0;i<n;i++){\\n if(!hasown[i] && !hasnext[i]){\\n seg.add(prevmax[i]+1, i+1, 1);\\n }\\n\\n int res = seg.query(0,i+1);\\n \\n seg.add(i+1, i+2, res - seg.query(i+1, i+2));\\n\\n if(!hasown[i] && hasnext[i]){\\n seg.add(prevmax[i]+1, i+1, 1);\\n }\\n }\\n\\n cout << n - seg.query(0,n+1) << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5492,\n \"score_of_the_acc\": -0.1323,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3046_3159499\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 1000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\n\\nclass segtree{\\npublic:\\n\\tstatic const int N=1<<18;\\n\\tint dp[1<<19];\\n\\tint lazy[1<<19];\\n\\tsegtree(){\\n\\t\\tmemset(dp,0,sizeof(dp));\\n\\t\\tfor(int i=0;i<N*2;i++){\\n\\t\\t\\tdp[i]=11451419;\\n\\t\\t\\tlazy[i]=11451419;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid lazy_eval(int k){\\n\\t\\tdp[k]=min(dp[k],lazy[k]);\\n\\t\\tif(k<N-1){\\n\\t\\t\\tlazy[k*2+1]=min(lazy[k*2+1],lazy[k]);\\n\\t\\t\\tlazy[k*2+2]=min(lazy[k*2+2],lazy[k]);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid lazy_upd(int k){\\n\\t\\tdp[k]=min(dp[k*2+1],dp[k*2+2]);\\n\\t}\\n\\tvoid update(int a,int b,int v,int k=0,int l=0,int r=N){\\n\\t\\tlazy_eval(k);\\n\\t\\tif(b<=l || r<=a)return;\\n\\t\\tif(a<=l && r<=b){\\n\\t\\t\\tlazy[k]=min(lazy[k],v);\\n\\t\\t\\tlazy_eval(k);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tint mid=(l+r)/2;\\n\\t\\tupdate(a,b,v,k*2+1,l,mid);\\n\\t\\tupdate(a,b,v,k*2+2,mid,r);\\n\\t\\tlazy_upd(k);\\n\\t}\\n\\n\\tint query(int a,int b,int k=0,int l=0,int r=N){\\n\\t\\tlazy_eval(k);\\n\\t\\tif(b<=l || r<=a)return 11451419;\\n\\t\\tif(a<=l && r<=b)return dp[k];\\n\\t\\tint mid=(l+r)/2;\\n\\t\\tint vl=query(a,b,k*2+1,l,mid);\\n\\t\\tint vr=query(a,b,k*2+2,mid,r);\\n\\t\\tlazy_upd(k);\\n\\t\\treturn min(vl,vr);\\n\\t}\\n};\\n\\nint n;\\nset<int> g[100005];\\nset<int> gg[100005];\\nsegtree seg;\\nbool self[100005];\\n\\nint main(void){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tint selfc=0;\\n\\tint pr=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint m;\\n\\t\\tscanf(\\\"%d\\\",&m);\\n\\t\\tbool flag=false;\\n\\t\\tfor(int j=0;j<m;j++){\\n\\t\\t\\tint x;\\n\\t\\t\\tscanf(\\\"%d\\\",&x);\\n\\t\\t\\tx--;\\n\\t\\t\\tif(x==i){\\n\\t\\t\\t\\tself[i]=true;\\n\\t\\t\\t\\tg[i].insert(x);\\n\\t\\t\\t}else if(x==i+1){\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t}else if(x>=pr && !self[i]){\\n\\t\\t\\t\\tg[i].insert(x);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!flag){\\n\\t\\t\\tpr=i+1;\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(set<int>::iterator it=g[i].begin();it!=g[i].end();it++){\\n\\t\\t\\tint v=*it;\\n\\t\\t\\tgg[v].insert(i);\\n\\t\\t}\\n\\t}\\n\\tint mini_m=11451419;\\n\\tfor(int i=n-1;i>=0;i--){\\n\\t\\tfor(set<int>::iterator it=gg[i].begin();it!=gg[i].end();it++){\\n\\t\\t\\tint v=*it;\\n\\t\\t\\tmini_m=min(v,mini_m);\\n\\t\\t}\\n\\t\\tif(*(gg[i].begin())>mini_m){\\n\\t\\t\\tgg[i].insert(mini_m);\\n\\t\\t}\\n\\t}\\n\\tseg.update(0,1,0);\\n\\tint prv=0;\\n\\tint cnt=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(gg[i].size()==0)continue;\\n\\t\\tint v=seg.query(prv,prv+1);\\n\\t\\tint nxt=*(gg[i].begin());\\n\\t\\t//printf(\\\"%d %d %d\\\\n\\\",i,nxt,v);\\n\\t\\tseg.update(i+1,nxt+2,v+1);\\n\\t\\tprv=i+1;\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",seg.query(prv,prv+1));\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 16804,\n \"score_of_the_acc\": -0.6091,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3046_3159246\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\n/* Starry Sky Tree */\\n//0-index\\n\\nstruct StarrySkyTree{\\n typedef int Type;\\n int segn2;\\n vector<Type> data,s_data;\\n \\n StarrySkyTree(int n){\\n for(segn2=1;segn2<n;segn2*=2);\\n data.assign(segn2*2,0);\\n s_data.assign(segn2*2,0);\\n }\\n \\n //get maximum value of [a,b]\\n Type query(int a,int b,int l=0,int r=-1,int k=0){\\n if(r==-1) r+=segn2;\\n if(r<a || b<l) return -INF; //大きさに注意\\n if(a<=l && r<=b) return data[k] + s_data[k];\\n return max(query(a,b,l,(l+r)/2,k*2+1),query(a,b,(l+r)/2+1,r,k*2+2))+s_data[k];\\n }\\n \\n //add x to [a,b]\\n Type add(int a,int b,Type x,int l=0,int r=-1,int k=0){\\n if(r==-1) r+=segn2;\\n if(a<=l && r<=b){\\n s_data[k]+=x;\\n }else if(a<=r && l<=b){\\n data[k] = max(add(a,b,x,l,(l+r)/2,k*2+1),add(a,b,x,(l+r)/2+1,r,k*2+2));\\n }\\n return data[k] + s_data[k];\\n }\\n \\n};\\n\\nbool hasnext[SIZE], hasown[SIZE];\\nint prevmax[SIZE];\\n\\nint main(){\\n int n, m, x;\\n\\n scanf(\\\"%d\\\", &n);\\n\\n for(int i=0;i<n;i++) prevmax[i] = -1;\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\", &m);\\n for(int j=0;j<m;j++){\\n scanf(\\\"%d\\\", &x);\\n x--;\\n hasnext[i] |= x == i+1;\\n hasown[i] |= x == i;\\n if(x < i) prevmax[i] = max(prevmax[i], x);\\n }\\n }\\n\\n StarrySkyTree seg(n+1);\\n\\n seg.add(1,n, -INF);\\n \\n for(int i=0;i<n;i++){\\n if(!hasown[i] && !hasnext[i]){\\n seg.add(prevmax[i]+1, i, 1);\\n }\\n\\n int res = seg.query(0,i);\\n \\n seg.add(i+1, i+1, res - seg.query(i+1, i+1));\\n\\n if(!hasown[i] && hasnext[i]){\\n seg.add(prevmax[i]+1, i, 1);\\n }\\n }\\n\\n cout << n - seg.query(0,n) << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5432,\n \"score_of_the_acc\": -0.1243,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3046_3152353\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct SCC{\\n int n;\\n vector<vector<int> > G,rG,T,C;\\n vector<int> vs,used,belong;\\n SCC(){}\\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\\n \\n void add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n }\\n \\n void input(int m,int offset=0){\\n int a,b;\\n for(int i=0;i<m;i++){\\n cin>>a>>b;\\n add_edge(a+offset,b+offset);\\n }\\n }\\n \\n void dfs(int v){\\n used[v]=1;\\n for(int i=0;i<(int)G[v].size();i++){\\n if(!used[G[v][i]]) dfs(G[v][i]);\\n }\\n vs.push_back(v);\\n }\\n \\n void rdfs(int v,int k){\\n used[v]=1;\\n belong[v]=k;\\n C[k].push_back(v);\\n for(int i=0;i<(int)rG[v].size();i++){\\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\\n }\\n }\\n \\n int build(){\\n fill(used.begin(),used.end(),0);\\n vs.clear();\\n for(int v=0;v<n;v++){\\n if(!used[v]) dfs(v);\\n }\\n fill(used.begin(),used.end(),0);\\n int k=0;\\n for(int i=vs.size()-1;i>=0;i--){\\n if(!used[vs[i]]){\\n\\tT.push_back(vector<int>());\\n\\tC.push_back(vector<int>());\\n\\trdfs(vs[i],k++);\\n }\\n }\\n for(int i=0;i<n;i++)\\n for(int u:G[i])\\n\\tif(belong[i]!=belong[u])\\n\\t T[belong[i]].push_back(belong[u]);\\n for(int i=0;i<k;i++){\\n sort(T[i].begin(),T[i].end());\\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\\n }\\n return k;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<vector<int> > G(n);\\n SCC scc(n);\\n for(int i=0;i<n;i++){\\n int c;\\n cin>>c;\\n G[i].resize(c);\\n for(int j=0;j<c;j++) cin>>G[i][j],G[i][j]--;\\n for(auto j:G[i]) scc.add_edge(j,i);\\n }\\n scc.build();\\n auto &b=scc.belong;\\n int ans=0,lst=-1;\\n for(int v=0;v<n;v++){\\n for(int u:G[v]){\\n if(b[u]!=b[v]) continue;\\n if(u==v+1) continue;\\n if(u<=lst) continue;\\n lst=v;ans++;\\n }\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 24360,\n \"score_of_the_acc\": -0.9719,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3046_3145941\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n\\nint n,m;\\nset<int> g[125252];\\n\\nint sm[125252];\\nvector<int> eds[125252];\\n\\nint main(){\\n scanf(\\\"%d\\\",&n);\\n REP(i,n){\\n scanf(\\\"%d\\\",&m);\\n while(m--){\\n int x;\\n scanf(\\\"%d\\\",&x);\\n g[i].insert(x-1);\\n }\\n }\\n set<int> rm;\\n REP(i,n)if(g[i].count(i)){\\n rm.insert(i);\\n }\\n REP(i,n)if(!rm.count(i)){\\n set<int>::iterator it = g[i].begin();\\n while(it != g[i].end()){\\n if(rm.count(*it)){\\n g[i].erase(it++);\\n }else{\\n it++;\\n }\\n }\\n }\\n REP(i,n)if(!rm.count(i) && g[i].count(i+1)){\\n sm[i+1]++;\\n }\\n REP(i,n+1)sm[i+1]+=sm[i];\\n REP(i,n)if(!rm.count(i)){\\n set<int>::iterator it = g[i].begin();\\n while(it != g[i].end()){\\n int x = *it; it++;\\n int y = i;\\n if(x==y+1)continue;\\n assert(x<y);\\n if(y-x == sm[y]-sm[x]){\\n eds[x].push_back(y);\\n }\\n }\\n }\\n priority_queue<int> Q;\\n int ans = rm.size();\\n REP(i,n){\\n for(int x : eds[i]){\\n Q.push(-x);\\n }\\n if(Q.size() && -Q.top() == i){\\n ans++;\\n while(Q.size())Q.pop();\\n }\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 16804,\n \"score_of_the_acc\": -0.6144,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3046_3145555\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcount\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nint N;\\nvector<P> rs;\\n\\nint main(){\\n cin>>N;\\n ll pre=0;\\n rep(i,N){\\n ll m;\\n cin>>m;\\n bool ok=false;\\n rep(j,m){\\n ll b;\\n cin>>b;\\n b--;\\n if(b>=pre&&b<=i){\\n rs.push_back(P(b,i));\\n }else if(b==i+1){\\n ok=true;\\n }\\n }\\n if(!ok){\\n pre=i+1;\\n }\\n }\\n sort(all(rs),[](const P& a,const P& b){ return a.se < b.se; });\\n ll crt=0,res=0;\\n rep(i,rs.size()){\\n if(crt<=rs[i].fi){\\n crt=rs[i].se+1; res++;\\n }\\n }\\n cout<<res<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.0106,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3046_3145536\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i,n) for (int i=0;i<(n);i++)\\n#define REP2(i,m,n) for (int i=m;i<(n);i++)\\ntypedef long long ll;\\ntypedef long double ld;\\n#define fst first\\n#define snd second\\n#define all(c) ((c).begin()), ((c).end())\\n\\n\\nstruct graph {\\n int n;\\n vector<vector<int>> adj, rdj;\\n vector<int> ord, visited, group;\\n graph(int n) : n(n), adj(n), rdj(n), visited(n), group(n) { }\\n void add_edge(int src, int dst) {\\n adj[src].push_back(dst);\\n rdj[dst].push_back(src);\\n }\\n\\n vector<vector<int>> strongly_connected_components() { // kosaraju\\n vector<vector<int>> scc;\\n function<void(int,vector<vector<int>>&, vector<int>&)> dfs\\n = [&](int u, vector<vector<int>> &adj, vector<int> &out) {\\n visited[u] = true;\\n for (int v: adj[u])\\n if (!visited[v]) dfs(v, adj, out);\\n out.push_back(u);\\n };\\n for (int u = 0; u < n; ++u)\\n if (!visited[u]) dfs(u, adj, ord);\\n fill(all(visited), false);\\n for (int i = n-1; i >= 0; --i)\\n if (!visited[ord[i]])\\n scc.push_back({}), dfs(ord[i], rdj, scc.back());\\n for (int i = 0; i < (int)scc.size(); ++i)\\n for (int j = 0; j < (int)scc[i].size(); ++j)\\n group[scc[i][j]] = scc[i][0];\\n return scc;\\n }\\n};\\n\\nbool used[101010];\\nint indeg[101010];\\nint outdeg[101010];\\nvector<int> inv[101010];\\nvector<vector<int>> hoge;\\n\\n\\nint main() {\\n int N; cin >> N;\\n graph g(N);\\n int ans = 0;\\n hoge = vector<vector<int>>(N);\\n\\n REP(i, N) {\\n int m; cin >> m;\\n REP(_, m) {\\n int j;\\n cin >> j;\\n --j;\\n hoge[i].push_back(j);\\n if (i == j) {\\n used[i] = true;\\n }\\n }\\n sort(hoge[i].begin(), hoge[i].end());\\n hoge[i].erase(unique(hoge[i].begin(), hoge[i].end()), hoge[i].end());\\n }\\n\\n REP(i, N) ans += used[i];\\n\\n REP(i, N) if (!used[i]) {\\n for (auto j: hoge[i]) if (!used[j]) g.add_edge(j, i);\\n for (auto j: hoge[i]) if (!used[j]) inv[i].push_back(j);\\n }\\n\\n vector<vector<int>> scc = g.strongly_connected_components();\\n\\n REP(i, (int)scc.size()) {\\n priority_queue<pair<int, int>> pq;\\n REP(j, (int)scc[i].size()) {\\n indeg[scc[i][j]] = 0;\\n for (auto k: inv[scc[i][j]]) if (g.group[k] == g.group[scc[i][j]]) indeg[scc[i][j]]++;\\n pq.push(make_pair(-indeg[scc[i][j]], scc[i][j]));\\n }\\n while (!pq.empty()) {\\n auto p = pq.top();\\n pq.pop();\\n auto deg = -p.first;\\n auto j = p.second;\\n if (used[j]) continue;\\n vector<int> del = {j};\\n vector<int> cand;\\n for (auto to: inv[j]) {\\n if (used[to] || g.group[j] != g.group[to]) continue;\\n del.push_back(to);\\n used[to] = true;\\n }\\n ans += deg;\\n used[j] = true;\\n for (auto d: del) {\\n for (auto e: g.adj[d]) {\\n if (used[e] || g.group[d] != g.group[e]) continue;\\n indeg[e] -= 1;\\n cand.push_back(e);\\n }\\n }\\n sort(cand.begin(), cand.end());\\n cand.erase(unique(cand.begin(), cand.end()), cand.end());\\n for (auto c: cand) pq.push(make_pair(-indeg[c], c));\\n }\\n }\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 25588,\n \"score_of_the_acc\": -1.0372,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3046_3145514\",\n \"code_snippet\": \"// g++ -std=c++11 a.cpp\\n#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<unordered_map>\\n#include<utility>\\n#include<cmath>\\n#include<random>\\n#include<cstring>\\n#include<queue>\\n#include<stack>\\n#include<bitset>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#include<assert.h>\\n#include<typeinfo>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define FOR(i,a) for(auto i:a)\\n#define pb push_back\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n#define show1d(v) rep(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl<<endl;\\n#define show2d(v) rep(i,v.size()){rep(j,v[i].size())cout<<\\\" \\\"<<v[i][j];cout<<endl;}cout<<endl;\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\n//#define int ll\\ntypedef int Def;\\ntypedef pair<Def,Def> pii;\\ntypedef vector<Def> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef vector<string> vs;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef pair<Def,pii> pip;\\ntypedef vector<pip>vip;\\n// #define mt make_tuple\\n// typedef tuple<int,int,int> tp;\\n// typedef vector<tp> vt;\\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\\n//template<class C>constexpr int size(const C &c){return (int)c.size();}\\n//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}\\nconst double PI=acos(-1);\\nconst double EPS=1e-9;\\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;\\nint dx[]={0,1,0,-1};\\nint dy[]={1,0,-1,0};\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tvvi G(n);\\n\\tvi h(n);\\n\\tint co=0;\\n\\trep(i,n){\\n\\t\\tint m;\\n\\t\\tcin>>m;\\n\\t\\tvi t(m);\\n\\t\\tbool q=false;\\n\\t\\trep(j,m)cin>>t[j];\\n\\t\\trep(j,m)if(i+1==t[j])q=true;\\n\\t\\tif(q)co++;\\n\\t\\telse{\\n\\t\\t\\trep(j,m){\\n\\t\\t\\t\\tint a=t[j];\\n\\t\\t\\t\\tif(i+2==a)h[i]=1;\\n\\t\\t\\t\\telse if(i+1==a){\\n\\t\\t\\t\\t\\tco++;\\n\\t\\t\\t\\t}else G[a-1].pb(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n//\\tshow1d(h);\\n//\\tshow2d(G);\\n\\n\\trep(i,n)if(h[i]){\\n\\t\\tint l=i,r;\\n\\t\\twhile(h[i])i++;\\n\\t\\tr=i;\\n\\t\\tvp in;\\n\\t\\tloop(j,l,r)rep(k,G[j].size())\\n\\t\\t\\tif(G[j][k]<=r)in.pb({G[j][k],j});\\n\\t\\t\\n\\t\\tsort(all(in));\\n//\\t\\tcout<<l<<\\\" \\\"<<r<<endl;\\n//\\t\\trep(j,in.size())cout<<\\\" \\\"<<in[j].first<<\\\" \\\"<<in[j].second<<endl;\\n//\\t\\tcout<<endl;\\n\\t\\tint t=-1;\\n\\t\\trep(j,in.size()){\\n\\t\\t\\tif(t<in[j].second){\\n\\t\\t\\t\\tco++;\\n\\t\\t\\t\\tt=in[j].first;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<co<<endl;\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6828,\n \"score_of_the_acc\": -0.1758,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3046_3145458\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing lint = long long int;\\n\\nclass UnionFind {\\nprivate:\\n\\tvector< int > data;\\n\\t\\npublic:\\n\\tUnionFind() {}\\n\\tUnionFind(int n) : data(n, -1) {}\\n\\t\\n\\tbool unionSet(int x, int y) {\\n\\t\\tx = root(x); y = root(y);\\n\\t\\t\\n\\t\\tif (x == y) return 0;\\n\\t\\t\\n\\t\\tif (data[y] < data[x]) swap(x, y);\\n\\t\\tdata[x] += data[y]; data[y] = x;\\n\\t\\treturn 1;\\n\\t}\\n\\t\\n\\tbool sameSet(int x, int y) { return root(x) == root(y); }\\n\\tint root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\\n\\tint size(int x) { return -data[root(x)]; }\\n};\\n\\nint N;\\nvector< set< int > > X;\\nUnionFind uf;\\n\\nvoid solve() {\\n\\tvector< int > max_start(N, -1);\\n\\tfor (int i=0; i<N; ++i) for (int x : X[i]) if (uf.sameSet(x, i)) max_start[i] = max(max_start[i], x);\\n\\t\\n\\t/*\\n\\tfor (int i=0; i<N; ++i) cerr << max_start[i] << \\\" \\\";\\n\\tcerr << endl;\\n\\t*/\\n\\t\\n\\tint ans = 0, cur = -1;\\n\\tfor (int i=0; i<N; ++i) {\\n\\t\\tif (max_start[i] >= 0 && cur < max_start[i]) {\\n\\t\\t\\tcur = i;\\n\\t\\t\\t++ans;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\\n\\nint main() {\\n\\tcin >> N;\\n\\t\\n\\tX.assign(N, set< int >());\\t\\n\\tuf = UnionFind(N);\\n\\t\\n\\tfor (int i=0; i<N; ++i) {\\n\\t\\tint M;\\n\\t\\tcin >> M;\\n\\t\\t\\n\\t\\tfor (int j=0; j<M; ++j) {\\n\\t\\t\\tint x;\\n\\t\\t\\tcin >> x;\\n\\t\\t\\t--x;\\n\\t\\t\\tif (x == i+1) uf.unionSet(i,i+1);\\n\\t\\t\\telse X[i].insert(x);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tsolve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12260,\n \"score_of_the_acc\": -0.4175,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3046_3145309\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <string>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <stdio.h>\\nusing namespace std;\\n#define int long long\\nint MOD = 1000000007;\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<vector<int> > A(N);\\n\\tint res = 0;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tint M;\\n\\t\\tcin >> M;\\n\\t\\tint a;\\n\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\tcin >> a;\\n\\t\\t\\ta--;\\n\\t\\t\\tA[i].push_back(a);\\n\\t\\t}\\n\\t\\tsort(A[i].begin(), A[i].end());\\n\\t\\tA[i].erase(unique(A[i].begin(), A[i].end()), A[i].end());\\n\\t}\\n\\tint mx = -1;\\n\\tvector<int> E(N, 1);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < A[i].size(); j++) {\\n\\t\\t\\tif (A[i][j] == i) {\\n\\t\\t\\t\\tE[i] = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = N - 1; i >= 0; i--) {\\n\\t\\tif (E[i] == 0) {\\n\\t\\t\\tmx = -1;\\n\\t\\t}\\n\\t\\telse if ((int)A[i].size() == 0) {\\n\\t\\t\\tres++;\\n\\t\\t\\tmx = -1;\\n\\t\\t}\\n\\t\\telse if (A[i].back() == i + 1 && E[i + 1] == 1) {\\n\\t\\t\\tif (mx == i) {\\n\\t\\t\\t\\tmx = -1;\\n\\t\\t\\t\\tE[i] = 0;\\n\\t\\t\\t\\t//cerr << \\\"erase \\\" << i << endl;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tint x = (int)A[i].size() - 2;\\n\\t\\t\\t\\twhile (x >= 0 && E[A[i][x]] == 0) {\\n\\t\\t\\t\\t\\tx--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (x >= 0) {\\n\\t\\t\\t\\t\\tmx = max(mx, A[i][x]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tres++;\\n\\t\\t\\tint x = (int)A[i].size() - 1;\\n\\t\\t\\twhile (x >= 0 && E[A[i][x]] == 0) {\\n\\t\\t\\t\\tx--;\\n\\t\\t\\t}\\n\\t\\t\\tif (x >= 0) {\\n\\t\\t\\t\\tmx = A[i][x];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << N - res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7656,\n \"score_of_the_acc\": -0.202,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3046_3145297\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing namespace std;\\nusing Int = long long;\\n\\n//BEGIN CUT HERE\\ntemplate< typename T >\\nstruct MonotoneMinima {\\n using F = function< T(int, int) >;\\n int n;\\n F dist;\\n T INF;\\n vector< T > dp;\\n\\n // dist(i,l) + dist(j,k) >= dist(i,k) + dist(j,l)\\n // if( i<=j && k<=l )\\n MonotoneMinima(int n, F dist, T INF) :\\n n(n), dist(dist), INF(INF), dp(n + 1, INF) {}\\n\\n void dfs(int l, int r, int a, int b) {\\n if(l == r) return;\\n int m = (l + r) >> 1;\\n T ma = INF;\\n int mi = -1;\\n for(int i = a; i < b; i++) {\\n T tmp = dp[i + 1] + dist(i, m);\\n if(tmp < ma) ma = tmp, mi = i;\\n }\\n dp[m] = min(dp[m], ma);\\n dfs(l, m, a, mi + 1);\\n dfs(m + 1, r, mi, b);\\n }\\n\\n void solve(int l, int r) {\\n if(l + 1 == r) {\\n dp[l] = min(dp[l], dp[r] + dist(l, l));\\n return;\\n }\\n int m = (l + r) >> 1;\\n solve(m, r);\\n dfs(l, m, m, r);\\n solve(l, m);\\n }\\n\\n T solve() {\\n dp[n] = 0;\\n solve(0, n);\\n return dp[0];\\n }\\n};\\n\\nstruct SuccinctIndexableDictionary {\\n size_t length;\\n size_t blocks;\\n vector< unsigned > bit, sum;\\n\\n SuccinctIndexableDictionary() {\\n }\\n\\n SuccinctIndexableDictionary(size_t _length) {\\n length = _length;\\n blocks = (length + 31) >> 5;\\n bit.assign(blocks, 0U);\\n sum.assign(blocks, 0U);\\n }\\n\\n void set(int k) {\\n bit[k >> 5] |= 1U << (k & 31);\\n }\\n\\n void build() {\\n sum[0] = 0U;\\n for(int i = 1; i < blocks; i++) {\\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\\n }\\n }\\n\\n bool operator[](int k) const {\\n return (bool((bit[k >> 5] >> (k & 31)) & 1));\\n }\\n\\n int rank(int k) {\\n return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));\\n }\\n\\n int rank(bool val, int k) {\\n return (val ? rank(k) : k - rank(k));\\n }\\n\\n int select(bool val, int k) {\\n if(k < 0 || rank(val, length) <= k) return (-1);\\n int low = 0, high = length;\\n while(high - low > 1) {\\n int mid = (low + high) >> 1;\\n if(rank(val, mid) >= k + 1) high = mid;\\n else low = mid;\\n }\\n return (high - 1);\\n }\\n\\n int select(bool val, int i, int l) {\\n return select(val, i + rank(val, l));\\n }\\n};\\n\\ntemplate< class T, int MAXLOG >\\nstruct WaveletMatrix {\\n size_t length;\\n SuccinctIndexableDictionary matrix[MAXLOG];\\n int zs[MAXLOG];\\n int buff1[MAXLOG], buff2[MAXLOG];\\n\\n void max_dfs(int d, int l, int r, int &k, T val, vector< T > &vs) {\\n if(l >= r || !k) return;\\n if(d == MAXLOG) {\\n while(l++ < r && k > 0) vs.push_back(val), k--;\\n return;\\n }\\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\\n max_dfs(d + 1, lc + zs[d], rc + zs[d], k, 1ULL << (MAXLOG - d - 1) | val, vs);\\n max_dfs(d + 1, l - lc, r - rc, k, val, vs);\\n }\\n\\n T max_dfs(int d, int l, int r, T val, T a, T b) {\\n if(r - l <= 0 || val >= b) return -1;\\n if(d == MAXLOG) return val >= a ? val : -1;\\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\\n T ret = max_dfs(d + 1, lc + zs[d], rc + zs[d], 1ULL << (MAXLOG - d - 1) | val, a, b);\\n if(~ret) return ret;\\n return max_dfs(d + 1, l - lc, r - rc, val, a, b);\\n }\\n\\n int freq_dfs(int d, int l, int r, T val, T a, T b) {\\n if(l == r) return 0;\\n if(d == MAXLOG) return (a <= val && val < b) ? r - l : 0;\\n T nv = 1ULL << (MAXLOG - d - 1) | val, nnv = ((1ULL << (MAXLOG - d - 1)) - 1) | nv;\\n if(nnv < a || b <= val) return 0;\\n if(a <= val && nnv < b) return r - l;\\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\\n return freq_dfs(d + 1, l - lc, r - rc, val, a, b) +\\n freq_dfs(d + 1, lc + zs[d], rc + zs[d], nv, a, b);\\n }\\n\\n void list_dfs(int d, int l, int r, T val, T a, T b, vector< pair< T, int>> &vs) {\\n if(val >= b || r - l <= 0) return;\\n if(d == MAXLOG) {\\n if(a <= val) vs.push_back(make_pair(val, r - l));\\n return;\\n }\\n T nv = val | (1LL << (MAXLOG - d - 1)), nnv = nv | (((1LL << (MAXLOG - d - 1)) - 1));\\n if(nnv < a) return;\\n int lc = matrix[d].rank(1, l), rc = matrix[d].rank(1, r);\\n list_dfs(d + 1, l - lc, r - rc, val, a, b, vs);\\n list_dfs(d + 1, lc + zs[d], rc + zs[d], nv, a, b, vs);\\n }\\n\\n\\n WaveletMatrix(vector< T > data) {\\n length = data.size();\\n vector< T > l(length), r(length);\\n for(int depth = 0; depth < MAXLOG; depth++) {\\n matrix[depth] = SuccinctIndexableDictionary(length + 1);\\n int left = 0, right = 0;\\n for(int i = 0; i < length; i++) {\\n bool k = (data[i] >> (MAXLOG - depth - 1)) & 1;\\n if(k) r[right++] = data[i], matrix[depth].set(i);\\n else l[left++] = data[i];\\n }\\n zs[depth] = left;\\n matrix[depth].build();\\n swap(l, data);\\n for(int i = 0; i < right; i++) data[left + i] = r[i];\\n }\\n }\\n\\n T access(int k) {\\n int ret = 0;\\n bool bit;\\n for(int depth = 0; depth < MAXLOG; depth++) {\\n bit = matrix[depth][k];\\n ret = (ret << 1) | bit;\\n k = matrix[depth].rank(bit, k) + zs[depth] * bit;\\n }\\n return (ret);\\n }\\n\\n int rank(T val, int k) {\\n int l = 0, r = k;\\n for(int depth = 0; depth < MAXLOG; depth++) {\\n buff1[depth] = l, buff2[depth] = r;\\n bool bit = (val >> (MAXLOG - depth - 1)) & 1;\\n l = matrix[depth].rank(bit, l) + zs[depth] * bit;\\n r = matrix[depth].rank(bit, r) + zs[depth] * bit;\\n }\\n return (r - l);\\n }\\n\\n int select(T val, int kth) {\\n rank(val, length);\\n for(int depth = MAXLOG - 1; depth >= 0; depth--) {\\n bool bit = (val >> (MAXLOG - depth - 1)) & 1;\\n kth = matrix[depth].select(bit, kth, buff1[depth]);\\n if(kth >= buff2[depth] || kth < 0) return (-1);\\n kth -= buff1[depth];\\n }\\n return (kth);\\n }\\n\\n int select(T val, int k, int l) {\\n return (select(val, k + rank(val, l)));\\n }\\n\\n\\n int quantile(int left, int right, int kth) {\\n if(right - left <= kth || kth < 0) return (-1);\\n T ret = 0;\\n for(int depth = 0; depth < MAXLOG; depth++) {\\n int l = matrix[depth].rank(1, left);\\n int r = matrix[depth].rank(1, right);\\n if(r - l > kth) {\\n left = l + zs[depth];\\n right = r + zs[depth];\\n ret |= 1ULL << (MAXLOG - depth - 1);\\n } else {\\n kth -= r - l;\\n left -= l;\\n right -= r;\\n }\\n }\\n return (ret);\\n }\\n\\n vector< T > topk(int l, int r, int k) {\\n if(r - l < k) k = r - l;\\n if(k < 0) return (vector< T >());\\n vector< T > ret;\\n max_dfs(0, l, r, k, 0, ret);\\n return (ret);\\n }\\n\\n vector< pair< T, int > > freq_list(int l, int r, T a, T b) {\\n vector< pair< T, int > > ret;\\n list_dfs(0, l, r, 0, a, b, ret);\\n return (ret);\\n }\\n\\n vector< pair< int, T > > get_rect(int l, int r, T a, T b) {\\n vector< pair< T, int > > res = freq_list(l, r, a, b);\\n vector< pair< int, T > > ret;\\n for(auto &e : res) {\\n for(int i = 0; i < e.second; i++) {\\n ret.emplace_back(select(e.first, i, l), e.first);\\n }\\n }\\n return (ret);\\n }\\n\\n int rangefreq(int left, int right, T lower, T upper) {\\n return (freq_dfs(0, left, right, 0, lower, upper));\\n }\\n};\\n\\n\\nint main() {\\n int N;\\n vector< int > g[100000];\\n bool nxt[100000] = {};\\n\\n\\n cin >> N;\\n for(int i = 0; i < N; i++) {\\n int x;\\n cin >> x;\\n bool flag = false;\\n while(x--) {\\n int v;\\n cin >> v;\\n --v;\\n if(v == i + 1) nxt[i] = true;\\n else g[i].emplace_back(v);\\n }\\n }\\n vector< int > near(N);\\n for(int i = 0; i < N; i++) {\\n sort(begin(g[i]), end(g[i]));\\n near[i] = 0;\\n if(g[i].size()) near[i] = g[i].back() + 1;\\n }\\n WaveletMatrix< int, 19 > mat(near);\\n\\n auto dist = [&](int r, int l) {\\n int cost = nxt[r] | near[r] - 1 >= l;\\n cost += mat.rangefreq(l, r, l + 1, N + 5);\\n return cost;\\n };\\n using int64 = long long;\\n const int64 INF = 1LL << 60;\\n MonotoneMinima< int64 > beet(N, dist, INF);\\n cout << beet.solve() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1030,\n \"memory_kb\": 8856,\n \"score_of_the_acc\": -0.798,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3046_3145264\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define X first\\n#define Y sevcond\\n#define pb emplace_back\\n#define eb pb\\n#define rep(X,Y) for(int X=0;X<(Y);++X)\\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n\\nusing namespace std;\\nusing ll=long long;\\nconst ll MOD=1e9+7;\\nusing Graph=vector<vector<int>>;\\n\\n#include<chrono>\\nusing namespace chrono;\\nsystem_clock::time_point starttime=system_clock::now();\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tGraph g(n);\\n\\trep(i,n){\\n\\t\\tint m;\\n\\t\\tcin>>m;\\n\\t\\trep(j,m){\\n\\t\\t\\tint v;\\n\\t\\t\\tcin>>v; --v;\\n\\t\\t\\tg[v].pb(i);\\n\\t\\t}\\n\\t}\\n\\tvector<int> vst(n),in(n,-1);\\n\\tint ans=0;\\n\\tfunction<int(int,int)> dfs=\\n\\t\\t[&](int v,int d)->int{\\n\\t\\t\\tif(vst[v]) return -1;\\n\\t\\t\\tin[v]=d;\\n\\t\\t\\tvst[v]=1;\\n\\t\\t\\t// cout<<v<<\\\",\\\"<<d<<endl;\\n\\t\\t\\tint re=-1;\\n\\t\\t\\tfor(int w:g[v]){\\n\\t\\t\\t\\t// cout<<v<<\\\":\\\"<<w<<\\\",\\\"<<in[w]<<endl;\\n\\t\\t\\t\\tif(in[w]>=0) re=max(re,in[w]);\\n\\t\\t\\t\\telse re=max(re,dfs(w,d+1));\\n\\t\\t\\t}\\n\\t\\t\\t// cout<<v<<\\\",\\\"<<d<<\\\",\\\"<<re<<endl;\\n\\t\\t\\tin[v]=-1;\\n\\t\\t\\tif(re==d){\\n\\t\\t\\t\\t++ans;\\n\\t\\t\\t\\tre=-1;\\n\\t\\t\\t}\\n\\t\\t\\treturn re;\\n\\t\\t};\\n\\tint re=MOD;\\n\\tvector<int> ind(n); iota(all(ind),0);\\n\\t// ind={4,1,2,3,0};\\n\\t// rep(i,n) dfs(ind[i],0);\\n\\t// cout<<ans<<endl;\\n\\t// return 0;\\n\\twhile((duration_cast<milliseconds>(system_clock::now()-starttime).count())<1900){\\n\\t\\tans=0;\\n\\t\\tfill(all(vst),0);\\n\\t\\tfill(all(in),-1);\\n\\t\\trep(i,n) dfs(ind[i],0);\\n\\t\\tre=min(re,ans);\\n\\t\\t// if(ans==0){\\n\\t\\t// \\trep(i,n) cout<<ind[i]<<\\\",\\\";cout<<endl;\\n\\t\\t// \\texit(0);\\n\\t\\t// }\\n\\t\\trandom_shuffle(all(ind));\\n\\t\\trep(i,n) random_shuffle(all(g[i]));\\n\\t}\\n\\tcout<<re<<endl;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 1890,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -1.0036,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3046_3145254\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define X first\\n#define Y sevcond\\n#define pb emplace_back\\n#define eb pb\\n#define rep(X,Y) for(int X=0;X<(Y);++X)\\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n\\nusing namespace std;\\nusing ll=long long;\\nconst ll MOD=1e9+7;\\nusing Graph=vector<vector<int>>;\\n\\n#include<chrono>\\nusing namespace chrono;\\nsystem_clock::time_point starttime=system_clock::now();\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tGraph g(n);\\n\\trep(i,n){\\n\\t\\tint m;\\n\\t\\tcin>>m;\\n\\t\\trep(j,m){\\n\\t\\t\\tint v;\\n\\t\\t\\tcin>>v; --v;\\n\\t\\t\\tg[v].pb(i);\\n\\t\\t}\\n\\t}\\n\\tvector<int> vst(n),in(n,-1);\\n\\tint ans=0;\\n\\tfunction<int(int,int)> dfs=\\n\\t\\t[&](int v,int d)->int{\\n\\t\\t\\tif(vst[v]) return -1;\\n\\t\\t\\tin[v]=d;\\n\\t\\t\\tvst[v]=1;\\n\\t\\t\\t// cout<<v<<\\\",\\\"<<d<<endl;\\n\\t\\t\\tint re=-1;\\n\\t\\t\\tfor(int w:g[v]){\\n\\t\\t\\t\\t// cout<<v<<\\\":\\\"<<w<<\\\",\\\"<<in[w]<<endl;\\n\\t\\t\\t\\tif(in[w]>=0) re=max(re,in[w]);\\n\\t\\t\\t\\telse re=max(re,dfs(w,d+1));\\n\\t\\t\\t}\\n\\t\\t\\t// cout<<v<<\\\",\\\"<<d<<\\\",\\\"<<re<<endl;\\n\\t\\t\\tin[v]=-1;\\n\\t\\t\\tif(re==d){\\n\\t\\t\\t\\t++ans;\\n\\t\\t\\t\\tre=-1;\\n\\t\\t\\t}\\n\\t\\t\\treturn re;\\n\\t\\t};\\n\\tint re=MOD;\\n\\tvector<int> ind(n); iota(all(ind),0);\\n\\t// ind={4,1,2,3,0};\\n\\t// rep(i,n) dfs(ind[i],0);\\n\\t// cout<<ans<<endl;\\n\\t// return 0;\\n\\twhile((duration_cast<milliseconds>(system_clock::now()-starttime).count())<1900){\\n\\t\\tans=0;\\n\\t\\tfill(all(vst),0);\\n\\t\\tfill(all(in),-1);\\n\\t\\trep(i,n) dfs(ind[i],0);\\n\\t\\tre=min(re,ans);\\n\\t\\t// if(ans==0){\\n\\t\\t// \\trep(i,n) cout<<ind[i]<<\\\",\\\";cout<<endl;\\n\\t\\t// \\texit(0);\\n\\t\\t// }\\n\\t\\trandom_shuffle(all(ind));\\n\\t}\\n\\tcout<<re<<endl;\\n}\",\n \"accuracy\": 0.3939393939393939,\n \"time_ms\": 1890,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -1.0014,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3046_3130649\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)<<\\\" \\\"\\n#define pr2(a,b) pr1(a)<<pr1(b)\\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\\nusing namespace std;\\nusing Int = long long;\\nusing _int = int;\\nusing ll = long long;\\nusing Double = long double;\\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\\nconst Int mod = (1e9)+7;\\nconst Double EPS = 1e-8;\\nconst Double PI = 6.0 * asin((Double)0.5);\\nusing P = pair<Int,Int>;\\nusing T = tuple<Int,Int,Int>;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\\n return o<<\\\"(\\\"<<get<0>(t)<<\\\",\\\"<<get<1>(t)<<\\\",\\\"<<get<2>(t)<<\\\")\\\";}\\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\\ntemplate<class T>void prArr(T a,string s=\\\" \\\"){Int i=0;for(T t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\n\\nclass SCC{\\npublic:\\n int V,K; //頂点数, scc後の頂点数\\n vector<vector<int> > G; //グラフの隣接リストの表現\\n vector<vector<int> >rG; //辺の向きを逆にしたグラフ\\n vector<vector<int> >DAG; //scc後のグラフの隣接リストの表現\\n vector<vector<int> >rDAG; //scc後の辺の向きを逆にしたグラフ\\n vector<int> vs; //帰りがけ順の並び\\n vector<int>used; //すでに調べたか\\n vector<int> cmp; //属する強連結成分のトポロジカル順\\n vector<vector<int> > member; //scc後の同じグループのノードの集合\\n int ok; //buildされているか。\\n SCC(){V = K = -1;}\\n SCC(int V):V(V),G(V),rG(V),used(V,0),cmp(V),ok(0){}\\n \\n void add_edge(int from,int to){\\n assert(from<V && to<V);\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n }\\n\\n void dfs(int v){\\n used[v]=true;\\n for(int nx:G[v]) if(!used[nx]) dfs(nx);\\n vs.push_back(v);\\n }\\n\\n void rdfs(int v,int k){\\n used[v]=true;\\n cmp[v]=k;\\n for(int nx:rG[v]) if(!used[nx]) rdfs(nx,k);\\n }\\n\\n int build(bool makeDAG = 0){ //DAGのグラフも作りたかったらmakeDAGを1にする\\n ok = true;\\n used.clear(); used.resize(V,0);\\n vs.clear();\\n for(int v=0;v<V;v++) if(!used[v]) dfs(v);\\n \\n used.clear(); used.resize(V,0);\\n int &k= K = 0;\\n for(int i=vs.size()-1;i>=0;i--)if(!used[vs[i]]) rdfs(vs[i],k++);\\n\\n member.clear();\\n member.resize(k);\\n for(int i=0;i<V;i++) member[cmp[i]].push_back(i);\\n \\n if(makeDAG) DAG = getDAG(G), rDAG = getDAG(rG); //O(ElogE)\\n \\n return k;\\n }\\n\\n bool same(int u, int v){assert(ok);return cmp[u] == cmp[v];}\\n\\nprivate:\\n vector<vector<int> > getDAG(const vector<vector<int> > &G){\\n assert(K>=0);\\n vector<vector<int> >res(K);\\n for(int from=0;from<V;from++)\\n for(int to:G[from]) if(cmp[from]!=cmp[to]) res[cmp[from]].push_back(cmp[to]);\\n \\n for(int i=0;i<K;i++){\\n sort(res[i].begin(),res[i].end());\\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\\n }\\n return res;\\n }\\n};\\n\\n\\nsigned main(){\\n srand((unsigned)time(NULL));\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n \\n int n;\\n cin>>n;\\n\\n SCC scc(n);\\n vector<vector<int> > G(n);\\n for(int i=0;i<n;i++){\\n int m;\\n cin>>m;\\n for(int j=0;j<m;j++){\\n int to;\\n cin>>to; to--;\\n assert(i >= to -1);\\n scc.add_edge(i, to);\\n G[i].push_back(to);\\n }\\n }\\n\\n scc.build();\\n vector<P> A;\\n for(int i=0;i<n;i++){\\n for(int to:G[i]){\\n if(!scc.same(i, to)) continue;\\n if(i < to) continue;\\n int l = to, r = i;\\n A.push_back(P(r, l));\\n }\\n }\\n \\n sort(A.begin(), A.end());\\n int ans = 0;\\n int last = -1;\\n for(P p:A){\\n int r, l; tie(r, l) = p;\\n if(last < l){\\n ans++;\\n last = r;\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 20728,\n \"score_of_the_acc\": -0.7944,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3046_3130558\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct SCC{\\n int n;\\n vector<vector<int> > G,rG,T,C;\\n vector<int> vs,used,belong;\\n SCC(){}\\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\\n \\n void add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n }\\n \\n void input(int m,int offset=0){\\n int a,b;\\n for(int i=0;i<m;i++){\\n cin>>a>>b;\\n add_edge(a+offset,b+offset);\\n }\\n }\\n \\n void dfs(int v){\\n used[v]=1;\\n for(int i=0;i<(int)G[v].size();i++){\\n if(!used[G[v][i]]) dfs(G[v][i]);\\n }\\n vs.push_back(v);\\n }\\n \\n void rdfs(int v,int k){\\n used[v]=1;\\n belong[v]=k;\\n C[k].push_back(v);\\n for(int i=0;i<(int)rG[v].size();i++){\\n if(!used[rG[v][i]]) rdfs(rG[v][i],k);\\n }\\n }\\n \\n int build(){\\n fill(used.begin(),used.end(),0);\\n vs.clear();\\n for(int v=0;v<n;v++){\\n if(!used[v]) dfs(v);\\n }\\n fill(used.begin(),used.end(),0);\\n int k=0;\\n for(int i=vs.size()-1;i>=0;i--){\\n if(!used[vs[i]]){\\n\\tT.push_back(vector<int>());\\n\\tC.push_back(vector<int>());\\n\\trdfs(vs[i],k++);\\n }\\n }\\n for(int i=0;i<n;i++)\\n for(int u:G[i])\\n\\tif(belong[i]!=belong[u])\\n\\t T[belong[i]].push_back(belong[u]);\\n for(int i=0;i<k;i++){\\n sort(T[i].begin(),T[i].end());\\n T[i].erase(unique(T[i].begin(),T[i].end()),T[i].end());\\n }\\n return k;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<vector<int> > G(n);\\n SCC scc(n);\\n for(int i=0;i<n;i++){\\n int c;\\n cin>>c;\\n G[i].resize(c);\\n for(int j=0;j<c;j++) cin>>G[i][j],G[i][j]--;\\n for(auto j:G[i]) scc.add_edge(j,i);\\n }\\n scc.build();\\n auto &b=scc.belong;\\n int ans=0,lst=-1;\\n for(int v=0;v<n;v++){\\n for(int u:G[v]){\\n if(b[u]!=b[v]) continue;\\n if(u==v+1) continue;\\n if(u<=lst) continue;\\n lst=v;ans++;\\n }\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 24248,\n \"score_of_the_acc\": -0.9723,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3046_3130554\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)<<\\\" \\\"\\n#define pr2(a,b) pr1(a)<<pr1(b)\\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\\nusing namespace std;\\nusing Int = long long;\\nusing _int = int;\\nusing ll = long long;\\nusing Double = long double;\\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\\nconst Int mod = (1e9)+7;\\nconst Double EPS = 1e-8;\\nconst Double PI = 6.0 * asin((Double)0.5);\\nusing P = pair<Int,Int>;\\nusing T = tuple<Int,Int,Int>;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\\n return o<<\\\"(\\\"<<get<0>(t)<<\\\",\\\"<<get<1>(t)<<\\\",\\\"<<get<2>(t)<<\\\")\\\";}\\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\\ntemplate<class T>void prArr(T a,string s=\\\" \\\"){Int i=0;for(T t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\n\\nclass SCC{\\npublic:\\n int V,K; //頂点数, scc後の頂点数\\n vector<vector<int> > G; //グラフの隣接リストの表現\\n vector<vector<int> >rG; //辺の向きを逆にしたグラフ\\n vector<vector<int> >DAG; //scc後のグラフの隣接リストの表現\\n vector<vector<int> >rDAG; //scc後の辺の向きを逆にしたグラフ\\n vector<int> vs; //帰りがけ順の並び\\n vector<int>used; //すでに調べたか\\n vector<int> cmp; //属する強連結成分のトポロジカル順\\n vector<vector<int> > member; //scc後の同じグループのノードの集合\\n int ok; //buildされているか。\\n SCC(){V = K = -1;}\\n SCC(int V):V(V),G(V),rG(V),used(V,0),cmp(V),ok(0){}\\n \\n void add_edge(int from,int to){\\n assert(from<V && to<V);\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n }\\n\\n void dfs(int v){\\n used[v]=true;\\n for(int nx:G[v]) if(!used[nx]) dfs(nx);\\n vs.push_back(v);\\n }\\n\\n void rdfs(int v,int k){\\n used[v]=true;\\n cmp[v]=k;\\n for(int nx:rG[v]) if(!used[nx]) rdfs(nx,k);\\n }\\n\\n int build(bool makeDAG = 0){ //DAGのグラフも作りたかったらmakeDAGを1にする\\n ok = true;\\n used.clear(); used.resize(V,0);\\n vs.clear();\\n for(int v=0;v<V;v++) if(!used[v]) dfs(v);\\n \\n used.clear(); used.resize(V,0);\\n int &k= K = 0;\\n for(int i=vs.size()-1;i>=0;i--)if(!used[vs[i]]) rdfs(vs[i],k++);\\n\\n member.clear();\\n member.resize(k);\\n for(int i=0;i<V;i++) member[cmp[i]].push_back(i);\\n \\n if(makeDAG) DAG = getDAG(G), rDAG = getDAG(rG); //O(ElogE)\\n \\n return k;\\n }\\n\\n bool same(int u, int v){assert(ok);return cmp[u] == cmp[v];}\\n\\nprivate:\\n vector<vector<int> > getDAG(const vector<vector<int> > &G){\\n assert(K>=0);\\n vector<vector<int> >res(K);\\n for(int from=0;from<V;from++)\\n for(int to:G[from]) if(cmp[from]!=cmp[to]) res[cmp[from]].push_back(cmp[to]);\\n \\n for(int i=0;i<K;i++){\\n sort(res[i].begin(),res[i].end());\\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\\n }\\n return res;\\n }\\n};\\n\\n\\nsigned main(){\\n srand((unsigned)time(NULL));\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n \\n int n;\\n cin>>n;\\n\\n SCC scc(n);\\n vector<vector<int> > G(n);\\n for(int i=0;i<n;i++){\\n int m;\\n cin>>m;\\n for(int j=0;j<m;j++){\\n int to;\\n cin>>to; to--;\\n assert(i >= to -1);\\n scc.add_edge(i, to);\\n G[i].push_back(to);\\n }\\n }\\n\\n scc.build();\\n vector<P> A;\\n for(int i=0;i<n;i++){\\n for(int to:G[i]){\\n if(!scc.same(i, to)) continue;\\n if(i < to) continue;\\n int l = to, r = i;\\n A.push_back(P(r, l));\\n }\\n }\\n \\n sort(A.begin(), A.end());\\n int ans = 0;\\n int last = -1;\\n for(P p:A){\\n int r, l; tie(r, l) = p;\\n if(last < l){\\n ans++;\\n last = r;\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 20964,\n \"score_of_the_acc\": -0.8049,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3046_3130547\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define all(v) (v).begin(), (v).end()\\n\\nusing Pi = pair<int, int>;\\nusing vint = vector<int>;\\nusing Graph = vector<vint>;\\n\\nGraph get_rev(const Graph& G) {\\n int V = G.size();\\n Graph H(V);\\n for(int v = 0; v < V; ++v) {\\n for(int u : G[v]) H[u].push_back(v);\\n }\\n return H;\\n}\\nvoid dfs(const Graph& G, int v, vint& ord, vint& used) {\\n used[v] = 1;\\n for(int u : G[v]) if(!used[u]) dfs(G, u, ord, used);\\n ord.push_back(v);\\n}\\nvoid rdfs(const Graph& H, int v, int id, vint& cmp) {\\n cmp[v] = id;\\n for(int u : H[v]) if(cmp[u] == -1) rdfs(H, u, id, cmp);\\n}\\nvint decompose(const Graph& G) {\\n Graph H = get_rev(G);\\n int V = G.size();\\n vint ord, used(V, 0);\\n for(int v = 0; v < V; ++v) if(!used[v]) dfs(G, v, ord, used);\\n reverse(all(ord));\\n int sz = 0;\\n vint cmp(V, -1);\\n for(int v : ord) if(cmp[v] == -1) rdfs(H, v, sz++, cmp);\\n\\n return cmp;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n Graph G(N);\\n for(int i = 0; i < N; ++i) {\\n int k;\\n cin >> k;\\n for(int j = 0; j < k; ++j) {\\n int job;\\n cin >> job; --job;\\n G[job].push_back(i);\\n }\\n }\\n vint cmp = decompose(G);\\n vector<Pi> vec;\\n for(int l = 0; l < N; ++l) {\\n for(int r : G[l]) {\\n if(cmp[l] != cmp[r] || l > r) continue;\\n vec.emplace_back(r, l);\\n }\\n }\\n sort(all(vec));\\n int ans = 0, last = -1;\\n for(Pi p : vec) {\\n if(last < p.second) ++ans, last = p.first;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 11684,\n \"score_of_the_acc\": -0.3972,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1888,"cells":{"group_id":{"kind":"string","value":"aoj_3044_cpp"},"problem_description":{"kind":"string","value":"Problem F: Timing\nProblem\n$N$頂点$M$辺の無向グラフが与えられる。各頂点には相異なる$1$から$N$までの番号が定められている。あなたは時刻$0$に頂点$S$を出発し、頂点$G$まで移動したい。各辺にはパラメータ$a, b$が設定されていて、時刻$t$にその辺の片側の頂点から出発した場合、もう片側の頂点には時刻$t+ceil\\left(\\cfrac{b}{t+a}\\right)$に到達することがわかっている。ここで、$ceil(x)$は$x$以上の最小の整数を表す。また、各頂点では任意の非負整数時間を余分に消費することができる。つまり、時刻$t$にある頂点にいるとき、任意の非負整数$k$を選び、時刻$t+k$になるまで待機することができる。最速最強アルゴリズマーを目指すあなたは、頂点$S$から頂点$G$まで移動するためにかかる時間の最小値を求めたくなった。\nInput\n入力は以下の形式で与えられる。\n$N$ $M$ $S$ $G$\n$U_1$ $V_1$ $A_1$ $B_1$\n$U_2$ $V_2$ $A_2$ $B_2$\n:\n$U_M$ $V_M$ $A_M$ $B_M$\n$1$行目に、与えられるグラフの頂点数$N$、辺数$M$、スタートの頂点番号$S$、ゴールの頂点番号$G$が空白区切りで与えられる。\n続く$M$行に、各辺の情報が空白区切りで与えられる。$i$行目の情報は、頂点$U_i$と頂点$V_i$の間に$(a, b) = (A_i, B_i)$であるような辺が存在することを表す。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N, M \\le 2 \\times 10^5$\n$1 \\le S, G \\le N$, $S \\neq G$\n$1 \\le U_i, V_i \\le N$, $U_i \\neq V_i (1 \\le i \\le M)$\n$1 \\le A_i, B_i \\le 10^{15} (1 \\le i \\le M)$\n与えられる入力は全て整数である\nOutput\n頂点$S$から頂点$G$まで移動するためにかかる時間の最小値を出力せよ。頂点$S$から頂点$G$に移動できない場合は、代わりに$-1$を出力せよ。\nSample Input 1\n2 1 1 2\n1 2 1 100\nSample Output 1\n19\n頂点$1$で時間を$9$消費し、時刻$9$に辺$1$を使うと、辺の所要時間は$ceil\\left(\\cfrac{100}{10}\\right) = 10$となり、時刻$19$に頂点$2$に到達できる。これが最短である。\nSample Input 2\n2 1 1 2\n1 2 50 100\nSample Output 2\n2\n時刻$0$に辺$1$を使うのが最適である。\nSample Input 3\n3 1 1 3\n1 2 1 1\nSample Output 3\n-1\n頂点$S$から頂点$G$に移動できない場合もある。\nSample Input 4\n3 3 1 3\n1 2 1 1\n2 3 1 6\n2 3 50 100\nSample Output 4\n3\nSample Input 5\n3 3 1 3\n1 2 10 100\n2 3 1 6\n2 3 50 100\nSample Output 5\n11"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3044_10853067","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int N = 2e5 + 1;\nvector<pair<int, pair<ll, ll> > > g[N];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m, S, G;\n cin >> n >> m >> S >> G;\n S--;\n G--;\n for (int i = 0; i < m; i++) {\n int u, v;\n ll a, b;\n cin >> u >> v >> a >> b;\n u--;\n v--;\n g[u].push_back({v, {a, b}});\n g[v].push_back({u, {a, b}});\n }\n auto get = [&](ll x, ll a, ll b) {\n if (a + x > b) return x + 1;\n ll l = x, r = b;\n while (r - l > 2) {\n ll m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;\n double f1 = m1 + (double) (b + m1 + a - 1.00) / (m1 + a),\n f2 = m2 + (double) (b + m2 + a - 1.00) / (m2 + a);\n if (f1 < f2) {\n r = m2;\n } else\n l = m1;\n }\n ll ans = 1e18;\n for (ll i = l; i <= r; i++)\n ans = min(ans, i + (i + a + b - 1) / (a + i));\n return ans;\n };\n vector<ll> d(n, 1e18);\n d[S] = 0;\n set<pair<ll, int> > st = {{0, S}};\n while (!st.empty()) {\n auto [w, v] = *st.begin();\n st.erase(st.begin());\n for (auto [to, ab]: g[v]) {\n auto [a, b] = ab;\n ll wx = get(w, a, b);\n if (d[to] > wx) {\n st.erase({d[to], to});\n d[to] = wx;\n st.insert({d[to], to});\n }\n }\n }\n cout << (d[G] == 1e18 ? -1 : d[G]) << '\\n';\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":34560,"score_of_the_acc":-1.4703,"final_rank":10},{"submission_id":"aoj_3044_6012242","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst int MX = 1000010;\nconst int MOD= 1e9+7;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nint n,m,st,ed;\n\nstruct Node {\n ll a,b;\n\tint v;\n\tint _next;\n}e[MX<<1];\nint head[MX], cnt = 0;\nvoid addedge(int u, int v, ll a, ll b) {\n\te[++cnt].v = v;\n\te[cnt].a = a;\n e[cnt].b = b;\n\te[cnt]._next = head[u];\n\thead[u] = cnt;\n}\npriority_queue<pil, vector<pil>, greater<pil> > q;\nint vis[MX] = { 0 };\nll dis[MX]={0};\nll calc(ll a,ll b,ll t){\n if(b<=t+a)\n return t+1;\n //等待时间x,求导求极小值\n ll x=sqrt(b)-t-a;\n ll temp=t+ceil((double)(b)/(t+a));\n if(x>=0)\n temp=_min(temp,t+x+(ll)ceil((double)(b)/(t+a+x)));\n if(x-1>=0)\n temp=_min(temp,t+x-1+(ll)ceil((double)(b)/(t+a+x-1)));\n if(x+1>=0)\n temp=_min(temp,t+x+1+(ll)ceil((double)(b)/(t+a+x+1)));\n return (ll)temp;\n}\nvoid dijkstra(int u) {\n\tq.push(make_pair(0, u));\n\tdis[u] = 0;\n\twhile (!q.empty()) {\n\t\tpil a = q.top(); q.pop();\n\t\tu = a.second;\n\t\tif (vis[u])continue;\n\t\tvis[u] = 1;\n\t\tfor (int i = head[u]; i; i = e[i]._next) {\n ll temp=calc(e[i].a,e[i].b,dis[u] );\n\t\t\tif (temp< dis[e[i].v]) {\n\t\t\t\tdis[e[i].v] = temp;\n\t\t\t\tq.push(make_pair(dis[e[i].v], e[i].v));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Init() {\n n=_r(),m=_r(),st=_r(),ed=_r();\n for(int i=0;i<=n;i++){\n dis[i]=ll_INF;\n }\n int u,v;\n ll a,b;\n for(int i=0;i<m;i++){ \n u=_r(),v=_r();\n a=_r(),b=_r();\n addedge(u,v,a,b);\n addedge(v,u,a,b);\n }\n}\n\nvoid solve() {\n dijkstra(st);\n printf(\"%lld\\n\",dis[ed]==ll_INF?-1:dis[ed]);\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n Init();\n solve();\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":16852,"score_of_the_acc":-0.3037,"final_rank":1},{"submission_id":"aoj_3044_6012235","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst int MX = 1000010;\nconst int MOD= 1e9+7;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nint n,m,st,ed;\n\nstruct Node {\n int a,b;\n\tint v;\n\tint _next;\n}e[MX<<1];\nint head[MX], cnt = 0;\nvoid addedge(int u, int v, int a, int b) {\n\te[++cnt].v = v;\n\te[cnt].a = a;\n e[cnt].b = b;\n\te[cnt]._next = head[u];\n\thead[u] = cnt;\n}\npriority_queue<pil, vector<pil>, greater<pil> > q;\nint vis[MX] = { 0 };\nll dis[MX]={0};\nll calc(int a,int b,ll t){\n if(b<=t+a)\n return t+1;\n //等待时间x,求导求极小值\n ll x=ceil(sqrt(b))-t-a;\n ll temp=t+ceil((double)(b)/(t+a));\n if(x>=0)\n temp=_min(temp,t+x+(ll)ceil((double)(b)/(t+a+x)));\n if(x-1>=0)\n temp=_min(temp,t+x-1+(ll)ceil((double)(b)/(t+a+x-1)));\n if(x+1>=0)\n temp=_min(temp,t+x+1+(ll)ceil((double)(b)/(t+a+x+1)));\n return (ll)temp;\n}\nvoid dijkstra(int u) {\n\tq.push(make_pair(0, u));\n\tdis[u] = 0;\n\twhile (!q.empty()) {\n\t\tpil a = q.top(); q.pop();\n\t\tu = a.second;\n\t\tif (vis[u])continue;\n\t\tvis[u] = 1;\n\t\tfor (int i = head[u]; i; i = e[i]._next) {\n ll temp=calc(e[i].a,e[i].b,dis[u] );\n\t\t\tif (temp< dis[e[i].v]) {\n\t\t\t\tdis[e[i].v] = temp;\n\t\t\t\tq.push(make_pair(dis[e[i].v], e[i].v));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Init() {\n n=_r(),m=_r(),st=_r(),ed=_r();\n for(int i=0;i<=n;i++){\n dis[i]=ll_INF;\n }\n for(int i=0;i<m;i++){\n int u,v,a,b;\n u=_r(),v=_r(),a=_r(),b=_r();\n addedge(u,v,a,b);\n addedge(v,u,a,b);\n }\n}\n\nvoid solve() {\n dijkstra(st);\n printf(\"%lld\\n\",dis[ed]==ll_INF?-1:dis[ed]);\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n Init();\n solve();\n return 0;\n}","accuracy":0.2698412698412698,"time_ms":80,"memory_kb":10972,"score_of_the_acc":-0.0805,"final_rank":16},{"submission_id":"aoj_3044_6012188","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst int MX = 1000010;\nconst int MOD= 1e9+7;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nint n,m,st,ed;\n\nstruct Node {\n int a,b;\n\tint v;\n\tint _next;\n}e[MX<<1];\nint head[MX], cnt = 0;\nvoid addedge(int u, int v, int a, int b) {\n\te[++cnt].v = v;\n\te[cnt].a = a;\n e[cnt].b = b;\n\te[cnt]._next = head[u];\n\thead[u] = cnt;\n}\npriority_queue<pil, vector<pil>, greater<pil> > q;\nint vis[MX] = { 0 };\nll dis[MX]={0};\nll calc(int a,int b,ll t){\n if(b<=t+a)\n return t+1;\n //求导求极小值\n ll x=(ll)sqrt(b)-t-a;\n ll temp=t+ceil((double)(b)/(t+a));\n if(x>0)\n temp=_min(temp,t+x+(int)ceil((double)(b)/(t+a+x)));\n if(x-1>0)\n temp=_min(temp,t+x-1+(int)ceil((double)(b)/(t+a+x-1)));\n if(x+1>0)\n temp=_min(temp,t+x+1+(int)ceil((double)(b)/(t+a+x+1)));\n return (ll)temp;\n}\nvoid dijkstra(int u) {\n\tq.push(make_pair(0, u));\n\tdis[u] = 0;\n\twhile (!q.empty()) {\n\t\tpil a = q.top(); q.pop();\n\t\tu = a.second;\n\t\tif (vis[u])continue;\n\t\tvis[u] = 1;\n\t\tfor (int i = head[u]; i; i = e[i]._next) {\n ll temp=calc(e[i].a,e[i].b,dis[u] );\n\t\t\tif (temp< dis[e[i].v]) {\n\t\t\t\tdis[e[i].v] = temp;\n\t\t\t\tq.push(make_pair(dis[e[i].v], e[i].v));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Init() {\n n=_r(),m=_r(),st=_r(),ed=_r();\n for(int i=0;i<=n;i++){\n dis[i]=ll_INF;\n }\n for(int i=0;i<m;i++){\n int u,v,a,b;\n u=_r(),v=_r(),a=_r(),b=_r();\n addedge(u,v,a,b);\n addedge(v,u,a,b);\n }\n}\n\nvoid solve() {\n dijkstra(st);\n printf(\"%lld\\n\",dis[ed]==ll_INF?-1:dis[ed]);\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n Init();\n solve();\n return 0;\n}","accuracy":0.2698412698412698,"time_ms":80,"memory_kb":11040,"score_of_the_acc":-0.0832,"final_rank":17},{"submission_id":"aoj_3044_6012182","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst int MX = 1000010;\nconst int MOD= 1e9+7;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nint n,m,st,ed;\n\nstruct Node {\n int a,b;\n\tint v;\n\tint _next;\n}e[MX<<1];\nint head[MX], cnt = 0;\nvoid addedge(int u, int v, int a, int b) {\n\te[++cnt].v = v;\n\te[cnt].a = a;\n e[cnt].b = b;\n\te[cnt]._next = head[u];\n\thead[u] = cnt;\n}\npriority_queue<pil, vector<pil>, greater<pil> > q;\nint vis[MX] = { 0 };\nll dis[MX]={0};\nll calc(int a,int b,ll t){\n if(b<=t+a)\n return t+1;\n //求导求极小值\n int x=(int)sqrt(b)-t-a;\n int temp=t+ceil((double)(b)/(t+a));\n if(x>0)\n temp=_min(temp,t+x+(int)ceil((double)(b)/(t+a+x)));\n if(x-1>0)\n temp=_min(temp,t+x-1+(int)ceil((double)(b)/(t+a+x-1)));\n if(x+1>0)\n temp=_min(temp,t+x+1+(int)ceil((double)(b)/(t+a+x+1)));\n return (ll)temp;\n}\nvoid dijkstra(int u) {\n\tq.push(make_pair(0, u));\n\tdis[u] = 0;\n\twhile (!q.empty()) {\n\t\tpil a = q.top(); q.pop();\n\t\tu = a.second;\n\t\tif (vis[u])continue;\n\t\tvis[u] = 1;\n\t\tfor (int i = head[u]; i; i = e[i]._next) {\n ll temp=calc(e[i].a,e[i].b,dis[u] );\n\t\t\tif (temp< dis[e[i].v]) {\n\t\t\t\tdis[e[i].v] = temp;\n\t\t\t\tq.push(make_pair(dis[e[i].v], e[i].v));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Init() {\n n=_r(),m=_r(),st=_r(),ed=_r();\n for(int i=0;i<=n;i++){\n dis[i]=ll_INF;\n }\n for(int i=0;i<m;i++){\n int u,v,a,b;\n u=_r(),v=_r(),a=_r(),b=_r();\n addedge(u,v,a,b);\n addedge(v,u,a,b);\n }\n}\n\nvoid solve() {\n dijkstra(st);\n printf(\"%lld\\n\",dis[ed]==ll_INF?-1:dis[ed]);\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n Init();\n solve();\n return 0;\n}","accuracy":0.2698412698412698,"time_ms":80,"memory_kb":11144,"score_of_the_acc":-0.0873,"final_rank":19},{"submission_id":"aoj_3044_6012176","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ull;\ntypedef pair<int,int> pil;\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\nconst int int_INF = 0x3f3f3f3f;\nconst double EPS = 1e-7;\n#define R register\n#define _max(a,b) ((a)>(b)?(a):(b))\n#define _min(a,b) ((a)<(b)?(a):(b))\n#define _abs(a) ((a)> 0 ?(a):-(a))\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\n#define _eql(x,y) (_abs((x) - (y))<EPS)\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst int MX = 1000010;\nconst int MOD= 1e9+7;\nll _r() {\n ll x = 0, f = 1;\n char c = getchar();\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\n return f==-1?-x:x;\n}\nint n,m,st,ed;\n\nstruct Node {\n int a,b;\n\tint v;\n\tint _next;\n}e[MX<<1];\nint head[MX], cnt = 0;\nvoid addedge(int u, int v, int a, int b) {\n\te[++cnt].v = v;\n\te[cnt].a = a;\n e[cnt].b = b;\n\te[cnt]._next = head[u];\n\thead[u] = cnt;\n}\npriority_queue<pil, vector<pil>, greater<pil> > q;\nint vis[MX] = { 0 };\nll dis[MX]={0};\nll calc(int a,int b,ll t){\n if(b<=t+a)\n return t+1;\n //求导求极小值\n double x=(double)sqrt(b)-t-a;\n double temp=t+ceil((double)(b)/(t+a));\n if(ceil(x)>0)\n temp=_min(temp,t+ ceil(x)+ceil((double)(b)/(t+a+ ceil(x))));\n if(floor(x)>0)\n temp=_min(temp,t+floor(x)+ceil((double)(b)/(t+a+floor(x))));\n return (ll)temp;\n}\nvoid dijkstra(int u) {\n\tq.push(make_pair(0, u));\n\tdis[u] = 0;\n\twhile (!q.empty()) {\n\t\tpil a = q.top(); q.pop();\n\t\tu = a.second;\n\t\tif (vis[u])continue;\n\t\tvis[u] = 1;\n\t\tfor (int i = head[u]; i; i = e[i]._next) {\n ll temp=calc(e[i].a,e[i].b,dis[u] );\n\t\t\tif (temp< dis[e[i].v]) {\n\t\t\t\tdis[e[i].v] = temp;\n\t\t\t\tq.push(make_pair(dis[e[i].v], e[i].v));\n\t\t\t}\n\t\t}\n\t}\n}\nvoid Init() {\n n=_r(),m=_r(),st=_r(),ed=_r();\n for(int i=0;i<=n;i++){\n dis[i]=ll_INF;\n }\n for(int i=0;i<m;i++){\n int u,v,a,b;\n u=_r(),v=_r(),a=_r(),b=_r();\n addedge(u,v,a,b);\n addedge(v,u,a,b);\n }\n}\n\nvoid solve() {\n dijkstra(st);\n printf(\"%lld\\n\",dis[ed]==ll_INF?-1:dis[ed]);\n}\nint main() {\n#ifdef LOCAL\n freopen(\"data.in\", \"r\", stdin);\n freopen(\"data.out\", \"w\", stdout);\n#endif\n Init();\n solve();\n return 0;\n}","accuracy":0.2698412698412698,"time_ms":80,"memory_kb":11124,"score_of_the_acc":-0.0865,"final_rank":18},{"submission_id":"aoj_3044_5543340","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <cmath>\nusing namespace std;\nusing ll = long long int;\nusing P = pair<ll, int>;\nstruct Edge{\n int to;\n ll a;\n ll b;\n};\n\nint main(){\n int n, m, s, g;\n cin >> n >> m >> s >> g;\n s--; g--;\n vector<vector<Edge>> G(n);\n for(int i = 0; i < m; i++){\n ll u, v, a, b;\n cin >> u >> v >> a >> b;\n u--; v--;\n G[u].push_back({(int)v, a, b});\n G[v].push_back({(int)u, a, b});\n }\n\n vector<ll> dist(n, 1LL << 60);\n priority_queue<P, vector<P>, greater<P>> Q;\n dist[s] = 0;\n Q.push({0, s});\n auto newtime = [&](const Edge &e, ll curtime){\n ll ans = 1LL << 60;\n ll start = max(curtime, (ll)sqrt(e.b)-e.a-20);\n for(ll t = start; t < start+40; t++) ans = min(ans, t+(e.b+t+e.a-1)/(t+e.a));\n return ans;\n };\n while(Q.size()){\n P cur = Q.top(); Q.pop();\n if(dist[cur.second] < cur.first) continue;\n\n for(auto &p: G[cur.second]){\n ll ntime = newtime(p, dist[cur.second]);\n if(dist[p.to] > ntime){\n dist[p.to] = ntime;\n Q.push({ntime, p.to});\n }\n }\n }\n\n if(dist[g] < 1LL << 60) cout << dist[g] << endl;\n else cout << -1 << endl;\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":28648,"score_of_the_acc":-1.0159,"final_rank":8},{"submission_id":"aoj_3044_4322426","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\n#include <cmath>\nusing namespace std;\ntemplate<class T> T ceil(T a, T b) { return a / b + !!(a % b); }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nusing pll = pair<long long, long long>;\nusing edge = pair<int, pll>;\nusing Graph = vector<vector<edge>>;\nint main() {\n int n, m; cin >> n >> m;\n int s, t; cin >> s >> t; s--, t--;\n Graph g(n);\n while (m--) {\n int u, v; cin >> u >> v; u--, v--;\n long long a, b; cin >> a >> b;\n g[u].emplace_back(v, pll(a, b));\n g[v].emplace_back(u, pll(a, b));\n }\n using T = long long;\n const T INF = numeric_limits<T>::max();\n vector<T> dp(n, INF);\n using P = pair<T, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n que.emplace(dp[s] = 0, s);\n auto calc = [&](long long cur, pll &p) {\n long long a, b; tie(a, b) = p;\n auto f = [&](long long t) { return t + ceil(b, t + a); };\n long long mi = f(cur), t = sqrt(b) - a;\n for (int d: {-1, 0, 1}) if (cur <= t + d) chmin(mi, f(t + d));\n return mi;\n };\n while (!que.empty()) {\n long long cur; int u; tie(cur, u) = que.top(); que.pop();\n if (dp[u] < cur) continue;\n for (auto &e: g[u]) {\n int v = e.first;\n if (chmin(dp[v], calc(cur, e.second))) que.emplace(dp[v], v);\n }\n }\n cout << (dp[t] == INF ? -1 : dp[t]) << endl;\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":26548,"score_of_the_acc":-0.9091,"final_rank":6},{"submission_id":"aoj_3044_4264969","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 200005\n\nstruct Edge{\n\n\tint from,to;\n\tll A,B;\n};\n\nstruct Info{\n\tInfo(int arg_to,int arg_index){\n\t\tto = arg_to;\n\t\tedge_index = arg_index;\n\t}\n\tint to,edge_index;\n};\n\nstruct State{\n\tState(int arg_node_id,double arg_sum_dist){\n\t\tnode_id = arg_node_id;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct State &arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\n\t}\n\n\tint node_id;\n\tdouble sum_dist;\n};\n\nint N,M,start,goal;\ndouble min_dist[SIZE];\nEdge edge[SIZE];\nvector<Info> G[SIZE];\n\nint main(){\n\n\tscanf(\"%d %d %d %d\",&N,&M,&start,&goal);\n\tstart--;\n\tgoal--;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%d %d %lld %lld\",&edge[i].from,&edge[i].to,&edge[i].A,&edge[i].B);\n\t\tedge[i].from--;\n\t\tedge[i].to--;\n\t\tG[edge[i].from].push_back(Info(edge[i].to,i));\n\t\tG[edge[i].to].push_back(Info(edge[i].from,i));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tmin_dist[i] = DBL_MAX;\n\t}\n\n\tmin_dist[start] = 0;\n\n\tpriority_queue<State> Q;\n\tQ.push(State(start,0));\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\n\n\t\t\tQ.pop();\n\n\t\t}else if(Q.top().node_id == goal){\n\n\t\t\tprintf(\"%.0lf\\n\",Q.top().sum_dist);\n\t\t\treturn 0;\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\n\t\t\t\tint next = G[Q.top().node_id][i].to;\n\t\t\t\tint index = G[Q.top().node_id][i].edge_index;\n\t\t\t\tll A = edge[index].A;\n\t\t\t\tll B = edge[index].B;\n\n\t\t\t\tdouble base = sqrt(B)-A;\n\t\t\t\tdouble next_dist;\n\n\t\t\t\tif(base <= Q.top().sum_dist){\n\n\t\t\t\t\tnext_dist = ceil(Q.top().sum_dist+(B/(Q.top().sum_dist+A)));\n\n\t\t\t\t}else{\n\n\t\t\t\t\tnext_dist = ceil(base+(B/(base+A)));\n\t\t\t\t}\n\n\t\t\t\tif(min_dist[next] > next_dist){\n\t\t\t\t\tmin_dist[next] = next_dist;\n\t\t\t\t\tQ.push(State(next,next_dist));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tprintf(\"-1\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":26700,"score_of_the_acc":-0.7083,"final_rank":2},{"submission_id":"aoj_3044_3668487","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\nconst ll INF=1e18;\nconst ll WIDTH=1;\nstruct Edge{\n int to;\n ll a,b;\n};\nusing Graph=vector<vector<Edge>>;\nll f(ll t,ll a,ll b){\n return t+b/(t+a)+(int)(b%(t+a)>0);\n}\n\nusing dbl=double;\nll calc(ll t,ll a,ll b){\n dbl X=2*a+1;\n dbl Y=(dbl)(a)*(a+1)-b;\n dbl t0=(-X+sqrt(X*X-4*Y))/2;\n ll res=f(t,a,b);\n ll tx=t0;\n for(int i=-WIDTH;i<=WIDTH;i++){\n ll topt=tx+i;\n if(topt<t) continue;\n res=min(res,f(topt,a,b));\n }\n\n return res;\n}\nvector<ll> Dijkstra(int s,Graph& g){\n int n=g.size();\n vector<ll> t(n,INF);\n using Item=pair<ll,int>;\n priority_queue<Item,vector<Item>,greater<>> que;\n t[s]=0;\n que.push({0LL,s});\n vector<int> used(n,false);\n while(!que.empty()){\n auto tmp=que.top(); que.pop();\n int v=tmp.second;\n if(t[v]<tmp.first) continue;\n assert(!used[v]);\n used[v]=true;\n for(Edge& e:g[v]){\n ll tot=calc(t[v],e.a,e.b);\n assert(t[v]<=tot);\n if(tot<t[e.to]){\n\tt[e.to]=tot;\n\tque.push({tot,e.to});\n }\n }\n }\n return t;\n}\nint main(){\nios::sync_with_stdio(false);\ncin.tie(0);\n int n,m;\n int S,G;\n cin>>n>>m>>S>>G;\n S--,G--;\n Graph g(n);\n for(int i=0;i<m;i++){\n int u,v;\n ll a,b;\n cin>>u>>v>>a>>b;\n u--,v--;\n g[u].push_back(Edge{v,a,b});\n g[v].push_back(Edge{u,a,b});\n }\n\n auto t=Dijkstra(S,g);\n\n cout<<(t[G]>=INF ? -1LL : t[G])<<endl;\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":27292,"score_of_the_acc":-0.7894,"final_rank":3},{"submission_id":"aoj_3044_3392255","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<P,P> PP;\nconst ll MOD = 1000000007;\nconst int IINF = INT_MAX;\nconst ll LLINF = LLONG_MAX;\nconst int MAX_N = int(2e5 + 5);\nconst int MAX_V = int(2e5 + 5);\nconst double EPS = 1e-10;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define SORT(v) sort((v).begin(), (v).end())\n#define ALL(v) (v).begin(), (v).end()\n\nstruct edge {\n ll from, to, a, b;\n edge(ll u, ll v, ll a, ll b) : from(u), to(v), a(a), b(b){};\n};\n\nvector<edge> G[MAX_V];\nll dmin[MAX_V];\n\nvoid add_edge(ll u, ll v, ll a, ll b) {\n G[u].push_back(edge(u, v, a, b));\n G[v].push_back(edge(v, u, a, b));\n}\n\nll f(ll b, ll a, ll x) { return ll(ceil(b / double(a + x) + double(x))); }\n\nvoid dijkstra(int s) {\n priority_queue<P, vector<P>, greater<P> > que; //小さいものから取り出す\n fill(dmin, dmin + MAX_V, LLINF);\n dmin[s] = 0;\n que.push(P(0, s));\n\n while (!que.empty()) {\n P p = que.top();\n que.pop();\n int v = p.second;\n if (dmin[v] < p.first) continue;\n for (auto &e : G[v]) {\n ll k = max(0.0, pow(e.b, 0.5) - (e.a + dmin[v])), cost;\n cost = f(e.b, e.a + dmin[v], 0);\n if (k > 0) {\n cost = min(cost,min(f(e.b,e.a+dmin[v],floor(k)),f(e.b,e.a+dmin[v],ceil(k))));\n }\n if (dmin[e.to] > dmin[v] + cost) {\n dmin[e.to] = dmin[v] + cost;\n que.push(P(dmin[e.to], e.to));\n }\n }\n }\n}\n\nint main() {\n ll n, m, s, g;\n cin >> n >> m >> s >> g;\n REP(i, m) {\n ll u, v, a, b;\n cin >> u >> v >> a >> b;\n add_edge(u, v, a, b);\n }\n dijkstra(s);\n cout << (dmin[g]!=LLINF?dmin[g]:-1) << endl;\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":32316,"score_of_the_acc":-1.1738,"final_rank":9},{"submission_id":"aoj_3044_3386073","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nnamespace sub {\n template<typename T>\n constexpr typename std::enable_if<std::is_integral<T>::value, T>::type\n inf_sub() {\n return std::numeric_limits<T>::max() / 2 - 1000;\n }\n\n template<typename T>\n constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type\n inf_sub() {\n return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));\n }\n} // namespace sub\n\ntemplate<typename T>\nconstexpr T inf() {\n static_assert(std::is_arithmetic<T>::value, \"T must be arithmetic value\");\n return sub::inf_sub<T>();\n}\n\ntemplate<typename T>\nconstexpr T zero() {\n static_assert(std::is_arithmetic<T>::value, \"T must be arithmetic value\");\n return T(0);\n}\n\nconst long double pi = acos(-1.0);\n\ntemplate<class edge_t>\nclass graph_t {\n std::vector<std::vector<edge_t>> g;\n\npublic:\n using reference = std::vector<edge_t> &;\n using const_reference = const std::vector<edge_t> &;\n using iterator = typename std::vector<edge_t>::iterator;\n\n graph_t() : g(0) { ; }\n\n graph_t(int n) : g(n) { ; }\n\n int size() const { return g.size(); }\n\n void push_back(const std::vector<edge_t> &es) { g.push_back(es); }\n\n reference operator[](int x) { return g[x]; }\n\n const_reference operator[](int x) const { return g[x]; }\n\n iterator &begin() { return begin(g); }\n\n iterator &end() { return end(g); }\n};\n\n\ntypedef __int128 int128;\n\n/**\n * func: (long long) -> boolean\n * binary_search() returns the minimum element x which satisfies f(-∞) != f(x)\n * e.g.\n * i: 1 2 3 4 5 6 7 8 9\n * f(i): 0 0 0 0 0 0 1 1 1\n * ^\n * x\n */\ntemplate<class F>\nint128 binary_search(F func) {\n int128 l = -1, r = 1;\n while (func(l) == func(r)) {\n l *= 2;\n r *= 2;\n }\n bool l_value = func(l);\n\n while (l != r) {\n int128 m = (l + r);\n if (m % 2 == 0) m /= 2;\n else m = (m - 1) / 2;\n if (func(m) != l_value) {\n r = m;\n } else {\n l = m + 1;\n }\n }\n return l;\n}\n\nint128 sqrt(int128 v) {\n return binary_search([v](int128 x) {\n if (x < 0) return false;\n if (x >= v) return true;\n return x * x >= v;\n });\n\n}\n\nvector<long long> best_time(long long t, long long a, long long b) {\n long long alpha = t + a;\n int128 B = 2 * alpha;\n int128 C = (int128) alpha * alpha - b;\n if (B * B - 4 * C < 0) {\n return {0};\n }\n int128 D = sqrt(B * B - 4 * C);\n\n return {0ll, (long long) ((-B + D) / 2), (long long) ((-B + D) / 2) + 1};\n}\n\nlong long ceil(long long a, long long b) {\n return (a + b - 1) / b;\n}\n\ntemplate<typename edge_t, typename cost_type = typename edge_t::cost_type>\nstd::vector<cost_type> dijkstra(const graph_t<edge_t> &g, int s) {\n std::vector<cost_type> d(g.size(), inf<cost_type>());\n d[s] = zero<cost_type>();\n using P = std::pair<cost_type, int>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\n que.push(P(zero<cost_type>(), s));\n while (!que.empty()) {\n cost_type dist = que.top().first;\n int v = que.top().second;\n que.pop();\n if (d[v] < dist) continue;\n for (const auto &e : g[v]) {\n for (auto k : best_time(dist, e.a, e.b)) {\n if (k < 0) continue;\n// while (k > 0) {\n// long long cost = k + ceil(e.b, dist + e.a + k);\n// long long cost2 = k-1 + ceil(e.b, dist + e.a + k-1);\n// if( cost <= cost2 ){\n// break;\n// }\n// --k;\n// }\n// while (true) {\n// long long cost = k + ceil(e.b, dist + e.a + k);\n// long long cost2 = k+1 + ceil(e.b, dist + e.a + k+1);\n// if( cost <= cost2 ){\n// break;\n// }\n// ++k;\n// }\n long long cost = k + ceil(e.b, dist + e.a + k);\n\n if (d[e.to] <= d[v] + cost) continue;\n d[e.to] = d[v] + cost;\n que.push(P(d[e.to], e.to));\n }\n }\n }\n return d;\n}\n\n\ntemplate<typename Cost>\nclass WeightedEdge {\npublic:\n using cost_type = Cost;\n int to;\n cost_type cost;\n long long a, b;\n\n WeightedEdge(int, int t, cost_type c, long long a, long long b) : to(t), cost(c), a(a), b(b) { ; }\n};\n\ntemplate<typename Cost> using WeightedGraph = graph_t<WeightedEdge<Cost>>;\n\ntemplate<typename Cost>\nvoid add_edge(WeightedGraph<Cost> &g, int from, int to, Cost cost, long long a, long long b) {\n g[from].emplace_back(from, to, cost, a, b);\n}\n\nint main() {\n int N, M, S, G;\n cin >> N >> M >> S >> G;\n WeightedGraph<long long> g(N);\n\n for (int i = 0; i < M; i++) {\n long long u, v, a, b;\n cin >> u >> v >> a >> b;\n --u, --v;\n add_edge(g, u, v, 0ll, a, b);\n add_edge(g, v, u, 0ll, a, b);\n }\n --S, --G;\n\n auto ans = dijkstra(g, S)[G];\n if (ans != inf<long long>()) {\n cout << ans << endl;\n } else {\n cout << -1 << endl;\n }\n}","accuracy":1,"time_ms":430,"memory_kb":36024,"score_of_the_acc":-1.4828,"final_rank":11},{"submission_id":"aoj_3044_3213678","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nstruct Edge {\n\tint src;\n\tint dst;\n\tlong long int A;\n\tlong long int B;\n};\nstruct aa {\n\tint now;\n\tlong long int cost;\n};\nbool operator <(const aa&l, const aa&r) {\n\treturn l.cost>r.cost;\n}\nlong long int ce(long long int a,long long int b) {\n\treturn (a-1)/b+1;\n}\nint main() {\n\tint N,M,S,G;cin>>N>>M>>S>>G;\n\tS--;G--;\n\tvector<vector<Edge>>g(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a,b;\n\t\tlong long int A,B;cin>>a>>b>>A>>B;a--;b--;\n\t\tg[a].push_back(Edge{ a,b,A,B });\n\t\tg[b].push_back(Edge{ b,a,A,B });\n\t}\n\n\tvector<long long int>memo(N,1e18);\n\tmemo[S]=0;\n\tpriority_queue<aa>que;\n\tque.push(aa{ S,0 });\n\twhile (!que.empty()) {\n\t\tauto atop(que.top());\n\t\tque.pop();\n\t\tconst int now=atop.now;\n\t\tconst long long int now_cost=atop.cost;\n\t\tif(memo[now]!=now_cost)continue;\n\t\tfor (auto e : g[now]) {\n\t\t\tint next=e.dst;\n\t\t\tlong long int next_cost=now_cost;\n\t\t\tif (e.A >= 1e8) {\n\t\t\t\tnext_cost=now_cost+ce(e.B,e.A+now_cost);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlong long int needt=sqrt(e.B)-e.A;\n\n\t\t\t\tlong long int this_cost=1e18;\n\t\t\t\tfor (long long int stop_t = needt - 1; stop_t <= needt + 1; ++stop_t) {\n\t\t\t\t\tlong long int at = max(stop_t, now_cost);\n\t\t\t\t\t{\n\t\t\t\t\t\tthis_cost=min(this_cost,at+ce(e.B,e.A+at));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnext_cost=this_cost;\n\t\t\t}\n\t\t\tif (memo[next] > next_cost) {\n\t\t\t\tmemo[next]=next_cost;\n\t\t\t\tque.push(aa{ next,next_cost });\n\t\t\t}\n\t\t}\n\t}\n\tif(memo[G]>7e17)memo[G]=-1;\n\tcout<<memo[G]<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":26648,"score_of_the_acc":-0.9131,"final_rank":7},{"submission_id":"aoj_3044_3213659","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nstruct Edge {\n\tint src;\n\tint dst;\n\tlong long int A;\n\tlong long int B;\n};\nstruct aa {\n\tint now;\n\tlong long int cost;\n};\nbool operator <(const aa&l, const aa&r) {\n\treturn l.cost>r.cost;\n}\nlong long int ce(long long int a,long long int b) {\n\treturn (a-1)/b+1;\n}\nint main() {\n\tint N,M,S,G;cin>>N>>M>>S>>G;\n\tS--;G--;\n\tvector<vector<Edge>>g(N);\n\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a,b;\n\t\tint A,B;cin>>a>>b>>A>>B;a--;b--;\n\t\tg[a].push_back(Edge{ a,b,A,B });\n\t\tg[b].push_back(Edge{ b,a,A,B });\n\t}\n\n\tvector<long long int>memo(N,1e18);\n\tmemo[S]=0;\n\tpriority_queue<aa>que;\n\tque.push(aa{ S,0 });\n\twhile (!que.empty()) {\n\t\tauto atop(que.top());\n\t\tque.pop();\n\t\tconst int now=atop.now;\n\t\tconst long long int now_cost=atop.cost;\n\t\tfor (auto e : g[now]) {\n\t\t\tint next=e.dst;\n\t\t\tlong long int next_cost=now_cost;\n\t\t\tif (e.A >= 1e8) {\n\t\t\t\tnext_cost=now_cost+ce(e.B,e.A+now_cost);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlong long int needt=sqrt(e.B)-e.A;\n\n\t\t\t\tlong long int this_cost=1e18;\n\t\t\t\tfor (long long int stop_t = needt - 2; stop_t <= needt + 2; ++stop_t) {\n\t\t\t\t\tlong long int at = max(stop_t, now_cost);\n\t\t\t\t\t{\n\t\t\t\t\t\tthis_cost=min(this_cost,at+ce(e.B,e.A+at));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnext_cost=this_cost;\n\t\t\t}\n\t\t\tif (memo[next] > next_cost) {\n\t\t\t\tmemo[next]=next_cost;\n\t\t\t\tque.push(aa{ next,next_cost });\n\t\t\t}\n\t\t}\n\t}\n\tif(memo[G]>7e17)memo[G]=-1;\n\tcout<<memo[G]<<endl;\n\treturn 0;\n}","accuracy":0.25396825396825395,"time_ms":10,"memory_kb":15912,"score_of_the_acc":-0.1972,"final_rank":20},{"submission_id":"aoj_3044_3160438","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cmath>\nusing namespace std;\n\n\n#define REP(i, s) for (int i = 0; i < s; ++i)\n#define ALL(v) (v.begin(), v.end())\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\n\n\n\ntypedef pair<long long, long long> Par;\ntypedef pair<int, Par> Edge;\nvector<vector<Edge> > G;\n\nint N, M, s, g;\n\ninline long long func(long long t, long long a, long long b) {\n return t + (b + t+a-1) / (t+a);\n}\ninline long long calc(long long K, long long a, long long b) {\n long long sb = (long long)(sqrt(b));\n long long start = max(0LL, sb - a - 2);\n long long res = func(K, a, b);\n for (long long t = start; t < start + 5; ++t) {\n if (t < K) continue;\n res = min(res, func(t, a, b));\n }\n return res;\n}\n\nint main() {\n cin >> N >> M >> s >> g;\n --s, --g;\n G.clear(); G.resize(N);\n for (int i = 0; i < M; ++i) {\n int u, v; cin >> u >> v; --u, --v;\n long long a, b; cin >> a >> b;\n G[u].push_back(Edge(v, Par(a, b)));\n G[v].push_back(Edge(u, Par(a, b)));\n }\n \n const long long INF = 1LL<<60;\n vector<long long> dp(N, INF);\n priority_queue<pair<long long,int>, vector<pair<long long,int> >, greater<pair<long long,int> > > que;\n que.push(make_pair(0, s));\n dp[s] = 0;\n while (!que.empty()) {\n auto cur = que.top(); que.pop();\n int v = cur.second;\n long long t = cur.first;\n if (dp[v] < t) continue;\n \n //cout << v << \": \" << dp[v] << endl;\n \n for (auto e : G[v]) {\n int to = e.first;\n long long a = e.second.first;\n long long b = e.second.second;\n long long dist = calc(t, a, b);\n if (chmin(dp[to], dist)) que.push(make_pair(dist, to));\n }\n }\n if (dp[g] < INF) cout << dp[g] << endl;\n else cout << -1 << endl;\n}","accuracy":1,"time_ms":250,"memory_kb":26532,"score_of_the_acc":-0.897,"final_rank":5},{"submission_id":"aoj_3044_3160434","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cmath>\nusing namespace std;\n\n\n#define REP(i, s) for (int i = 0; i < s; ++i)\n#define ALL(v) (v.begin(), v.end())\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\n\n\n\ntypedef pair<long long, long long> Par;\ntypedef pair<int, Par> Edge;\nvector<vector<Edge> > G;\n\nint N, M, s, g;\n\ninline long long func(long long t, long long a, long long b) {\n return t + (b + t+a-1) / (t+a);\n}\ninline long long calc(long long K, long long a, long long b) {\n long long sb = (long long)(sqrt(b));\n long long start = sb - 2;\n long long res = func(K, a, b);\n for (long long t = max(0LL, start); t < start + 5; ++t) {\n if (t < K) continue;\n res = min(res, func(t, a, b));\n }\n return res;\n}\n\nint main() {\n cin >> N >> M >> s >> g;\n --s, --g;\n G.clear(); G.resize(N);\n for (int i = 0; i < M; ++i) {\n int u, v; cin >> u >> v; --u, --v;\n long long a, b; cin >> a >> b;\n G[u].push_back(Edge(v, Par(a, b)));\n G[v].push_back(Edge(u, Par(a, b)));\n }\n \n const long long INF = 1LL<<60;\n vector<long long> dp(N, INF);\n priority_queue<pair<long long,int>, vector<pair<long long,int> >, greater<pair<long long,int> > > que;\n que.push(make_pair(0, s));\n dp[s] = 0;\n while (!que.empty()) {\n auto cur = que.top(); que.pop();\n int v = cur.second;\n long long t = cur.first;\n if (dp[v] < t) continue;\n \n //cout << v << \": \" << dp[v] << endl;\n \n for (auto e : G[v]) {\n int to = e.first;\n long long a = e.second.first;\n long long b = e.second.second;\n long long dist = calc(t, a, b);\n if (chmin(dp[to], dist)) que.push(make_pair(dist, to));\n }\n }\n if (dp[g] < INF) cout << dp[g] << endl;\n else cout << -1 << endl;\n}","accuracy":0.38095238095238093,"time_ms":270,"memory_kb":19348,"score_of_the_acc":-0.6332,"final_rank":13},{"submission_id":"aoj_3044_3152839","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\ntemplate<typename Func>\nll findMin(ll L, ll R, Func f) { //[L, R)\n ll lo = L - 1, hi = R - 1;\n while (lo + 1 != hi) {\n ll mi = (lo + hi) / 2;\n if (f(mi) <= f(mi + 1)) hi = mi;\n else lo = mi;\n }\n return hi;\n}\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\nvector<pair<int,int>> E[201010];\nll dst[201010]; int vis[201010];\nll line[201010];\n//---------------------------------------------------------------------------------------------------\nll a, b;\nll f(ll x) {\n return x + (b + x + a - 1) / (x + a);\n}\ndouble fd(double x) {\n return x + 1.0 * b / (x + 1.0 * a);\n}\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> N >> M >> S >> G;\n S--; G--;\n rep(i, 0, M) {\n cin >> U[i] >> V[i] >> A[i] >> B[i];\n U[i]--; V[i]--;\n\n E[U[i]].push_back({ V[i], i });\n E[V[i]].push_back({ U[i], i });\n }\n\n rep(i, 0, N) dst[i] = infl;\n\n min_priority_queue<pair<ll, int>> que;\n que.push({0, S});\n dst[S] = 0;\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n ll d = q.first;\n int cu = q.second;\n\n if (vis[cu]) continue;\n vis[cu] = 1;\n\n if (cu == G) {\n printf(\"%lld\\n\", dst[cu]);\n return;\n }\n\n fore(p, E[cu]) {\n int to = p.first;\n a = A[p.second];\n b = B[p.second];\n\n ll t = findMin(d, infl, fd);\n\n ll nd = min(f(t), f(t + 1));\n\n if (nd < dst[to]) {\n dst[to] = nd;\n que.push({ nd, to });\n }\n }\n }\n\n printf(\"-1\\n\");\n}","accuracy":1,"time_ms":220,"memory_kb":26684,"score_of_the_acc":-0.8686,"final_rank":4},{"submission_id":"aoj_3044_3152805","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\ntemplate<typename Func>\ndouble findMinReal(double L, double R, Func f) { //[L, R)\n double left = L, right = R;\n\n for (int loop = 0; loop < 101; ++loop) {\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\n right = (left + right * 2) / 3;\n }\n else {\n left = (left * 2 + right) / 3;\n }\n }\n return (right + left) * 0.5;\n}\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\nvector<pair<int,int>> E[201010];\nll dst[201010]; int vis[201010];\nll line[201010];\n//---------------------------------------------------------------------------------------------------\nll a, b;\nll f(ll x) {\n return x + (b + x + a - 1) / (x + a);\n}\ndouble fr(double x) {\n return x + 1.0 * b / (x + a);\n}\n//---------------------------------------------------------------------------------------------------\nll getline(int i) {\n /*a = A[i]; b = B[i];\n double l = 0, h = 1e20;\n rep(i, 0, 200) {\n double m1 = l + (h - l) / 3, m2 = l + (h - l) / 3 * 2;\n double f1 = fr(m1), f2 = fr(m2);\n if (f1 > f2) l = m1; else h = m2;\n }\n return f((ll)l) < f((ll)l + 1) ? l : l + 1;*/\n\n a = A[i]; b = B[i];\n double t = findMinReal(0, infl, fr);\n\n ll res = t;\n ll mi = res;\n\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\n return mi;\n}\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> N >> M >> S >> G;\n S--; G--;\n rep(i, 0, M) {\n cin >> U[i] >> V[i] >> A[i] >> B[i];\n U[i]--; V[i]--;\n\n E[U[i]].push_back({ V[i], i });\n E[V[i]].push_back({ U[i], i });\n line[i] = getline(i);\n }\n\n rep(i, 0, N) dst[i] = infl;\n\n min_priority_queue<pair<ll, int>> que;\n que.push({0, S});\n dst[S] = 0;\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n ll d = q.first;\n int cu = q.second;\n\n if (vis[cu]) continue;\n vis[cu] = 1;\n\n if (cu == G) {\n printf(\"%lld\\n\", dst[cu]);\n return;\n }\n\n fore(p, E[cu]) {\n int to = p.first;\n a = A[p.second];\n b = B[p.second];\n\n ll t;\n if (d < line[q.second]) t = line[p.second];\n else t = d;\n\n ll nd = f(t);\n\n if (nd < dst[to]) {\n dst[to] = nd;\n que.push({ nd, to });\n }\n }\n }\n printf(\"-1\\n\");\n}","accuracy":0.5238095238095238,"time_ms":400,"memory_kb":20888,"score_of_the_acc":-0.8441,"final_rank":12},{"submission_id":"aoj_3044_3152786","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define double long double\ntemplate<typename Func>\ndouble findMinReal(double L, double R, Func f) { //[L, R)\n double left = L, right = R;\n\n for (int loop = 0; loop < 201; ++loop) {\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\n right = (left + right * 2) / 3;\n }\n else {\n left = (left * 2 + right) / 3;\n }\n }\n return (right + left) * 0.5;\n}\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\nvector<pair<int,int>> E[201010];\nll dst[201010]; int vis[201010];\nll line[201010];\n//---------------------------------------------------------------------------------------------------\nll a, b;\nll f(ll x) {\n return x + (b + x + a - 1) / (x + a);\n}\ndouble fr(double x) {\n return x + b / (x + a);\n}\n//---------------------------------------------------------------------------------------------------\nll getline(int i) {\n a = A[i]; b = B[i];\n double t = findMinReal(0, infl, fr);\n\n ll res = t;\n ll mi = res;\n\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\n return mi;\n}\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> N >> M >> S >> G;\n S--; G--;\n rep(i, 0, M) {\n cin >> U[i] >> V[i] >> A[i] >> B[i];\n U[i]--; V[i]--;\n\n E[U[i]].push_back({ V[i], i });\n E[V[i]].push_back({ U[i], i });\n line[i] = getline(i);\n }\n\n rep(i, 0, N) dst[i] = infl;\n\n min_priority_queue<pair<ll, int>> que;\n que.push({0, S});\n dst[S] = 0;\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n ll d = q.first;\n int cu = q.second;\n\n if (vis[cu]) continue;\n vis[cu] = 1;\n\n if (cu == G) {\n printf(\"%lld\\n\", dst[cu]);\n return;\n }\n\n fore(p, E[cu]) {\n int to = p.first;\n a = A[p.second];\n b = B[p.second];\n\n ll t;\n if (d < line[q.second]) t = line[q.second];\n else t = d;\n\n ll nd = f(t);\n\n if (nd < dst[to]) {\n dst[to] = nd;\n que.push({ nd, to });\n }\n }\n }\n printf(\"-1\\n\");\n}","accuracy":0.31746031746031744,"time_ms":880,"memory_kb":20248,"score_of_the_acc":-1.3703,"final_rank":15},{"submission_id":"aoj_3044_3152781","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\ntemplate<typename Func>\ndouble findMinReal(double L, double R, Func f) { //[L, R)\n double left = L, right = R;\n\n for (int loop = 0; loop < 101; ++loop) {\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\n right = (left + right * 2) / 3;\n }\n else {\n left = (left * 2 + right) / 3;\n }\n }\n return (right + left) * 0.5;\n}\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\nvector<pair<int,int>> E[201010];\nll dst[201010]; int vis[201010];\nll line[201010];\n//---------------------------------------------------------------------------------------------------\nll a, b;\nll f(ll x) {\n return x + (b + x + a - 1) / (x + a);\n}\ndouble fr(double x) {\n return x + b / (x + a);\n}\n//---------------------------------------------------------------------------------------------------\nll getline(int i) {\n a = A[i]; b = B[i];\n double t = findMinReal(0, infl, fr);\n\n ll res = t;\n ll mi = res;\n\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\n return mi;\n}\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> N >> M >> S >> G;\n S--; G--;\n rep(i, 0, M) {\n cin >> U[i] >> V[i] >> A[i] >> B[i];\n U[i]--; V[i]--;\n\n E[U[i]].push_back({ V[i], i });\n E[V[i]].push_back({ U[i], i });\n line[i] = getline(i);\n }\n\n rep(i, 0, N) dst[i] = infl;\n\n min_priority_queue<pair<ll, int>> que;\n que.push({0, S});\n dst[S] = 0;\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n ll d = q.first;\n int cu = q.second;\n\n if (vis[cu]) continue;\n vis[cu] = 1;\n\n if (cu == G) {\n printf(\"%lld\\n\", dst[cu]);\n return;\n }\n\n fore(p, E[cu]) {\n int to = p.first;\n a = A[p.second];\n b = B[p.second];\n\n ll t;\n if (d < line[q.second]) t = line[q.second];\n else t = d;\n\n ll nd = f(t);\n\n if (nd < dst[to]) {\n dst[to] = nd;\n que.push({ nd, to });\n }\n }\n }\n printf(\"-1\\n\");\n}","accuracy":0.31746031746031744,"time_ms":400,"memory_kb":20180,"score_of_the_acc":-0.8158,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_3044_10853067\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int N = 2e5 + 1;\\nvector<pair<int, pair<ll, ll> > > g[N];\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n, m, S, G;\\n cin >> n >> m >> S >> G;\\n S--;\\n G--;\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n ll a, b;\\n cin >> u >> v >> a >> b;\\n u--;\\n v--;\\n g[u].push_back({v, {a, b}});\\n g[v].push_back({u, {a, b}});\\n }\\n auto get = [&](ll x, ll a, ll b) {\\n if (a + x > b) return x + 1;\\n ll l = x, r = b;\\n while (r - l > 2) {\\n ll m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;\\n double f1 = m1 + (double) (b + m1 + a - 1.00) / (m1 + a),\\n f2 = m2 + (double) (b + m2 + a - 1.00) / (m2 + a);\\n if (f1 < f2) {\\n r = m2;\\n } else\\n l = m1;\\n }\\n ll ans = 1e18;\\n for (ll i = l; i <= r; i++)\\n ans = min(ans, i + (i + a + b - 1) / (a + i));\\n return ans;\\n };\\n vector<ll> d(n, 1e18);\\n d[S] = 0;\\n set<pair<ll, int> > st = {{0, S}};\\n while (!st.empty()) {\\n auto [w, v] = *st.begin();\\n st.erase(st.begin());\\n for (auto [to, ab]: g[v]) {\\n auto [a, b] = ab;\\n ll wx = get(w, a, b);\\n if (d[to] > wx) {\\n st.erase({d[to], to});\\n d[to] = wx;\\n st.insert({d[to], to});\\n }\\n }\\n }\\n cout << (d[G] == 1e18 ? -1 : d[G]) << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 34560,\n \"score_of_the_acc\": -1.4703,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3044_6012242\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<int,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\nconst int dx[]={1,0,-1,0};\\nconst int dy[]={0,1,0,-1};\\nconst int MX = 1000010;\\nconst int MOD= 1e9+7;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nint n,m,st,ed;\\n\\nstruct Node {\\n ll a,b;\\n\\tint v;\\n\\tint _next;\\n}e[MX<<1];\\nint head[MX], cnt = 0;\\nvoid addedge(int u, int v, ll a, ll b) {\\n\\te[++cnt].v = v;\\n\\te[cnt].a = a;\\n e[cnt].b = b;\\n\\te[cnt]._next = head[u];\\n\\thead[u] = cnt;\\n}\\npriority_queue<pil, vector<pil>, greater<pil> > q;\\nint vis[MX] = { 0 };\\nll dis[MX]={0};\\nll calc(ll a,ll b,ll t){\\n if(b<=t+a)\\n return t+1;\\n //等待时间x,求导求极小值\\n ll x=sqrt(b)-t-a;\\n ll temp=t+ceil((double)(b)/(t+a));\\n if(x>=0)\\n temp=_min(temp,t+x+(ll)ceil((double)(b)/(t+a+x)));\\n if(x-1>=0)\\n temp=_min(temp,t+x-1+(ll)ceil((double)(b)/(t+a+x-1)));\\n if(x+1>=0)\\n temp=_min(temp,t+x+1+(ll)ceil((double)(b)/(t+a+x+1)));\\n return (ll)temp;\\n}\\nvoid dijkstra(int u) {\\n\\tq.push(make_pair(0, u));\\n\\tdis[u] = 0;\\n\\twhile (!q.empty()) {\\n\\t\\tpil a = q.top(); q.pop();\\n\\t\\tu = a.second;\\n\\t\\tif (vis[u])continue;\\n\\t\\tvis[u] = 1;\\n\\t\\tfor (int i = head[u]; i; i = e[i]._next) {\\n ll temp=calc(e[i].a,e[i].b,dis[u] );\\n\\t\\t\\tif (temp< dis[e[i].v]) {\\n\\t\\t\\t\\tdis[e[i].v] = temp;\\n\\t\\t\\t\\tq.push(make_pair(dis[e[i].v], e[i].v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Init() {\\n n=_r(),m=_r(),st=_r(),ed=_r();\\n for(int i=0;i<=n;i++){\\n dis[i]=ll_INF;\\n }\\n int u,v;\\n ll a,b;\\n for(int i=0;i<m;i++){ \\n u=_r(),v=_r();\\n a=_r(),b=_r();\\n addedge(u,v,a,b);\\n addedge(v,u,a,b);\\n }\\n}\\n\\nvoid solve() {\\n dijkstra(st);\\n printf(\\\"%lld\\\\n\\\",dis[ed]==ll_INF?-1:dis[ed]);\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n#endif\\n Init();\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 16852,\n \"score_of_the_acc\": -0.3037,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3044_6012235\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<int,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\nconst int dx[]={1,0,-1,0};\\nconst int dy[]={0,1,0,-1};\\nconst int MX = 1000010;\\nconst int MOD= 1e9+7;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nint n,m,st,ed;\\n\\nstruct Node {\\n int a,b;\\n\\tint v;\\n\\tint _next;\\n}e[MX<<1];\\nint head[MX], cnt = 0;\\nvoid addedge(int u, int v, int a, int b) {\\n\\te[++cnt].v = v;\\n\\te[cnt].a = a;\\n e[cnt].b = b;\\n\\te[cnt]._next = head[u];\\n\\thead[u] = cnt;\\n}\\npriority_queue<pil, vector<pil>, greater<pil> > q;\\nint vis[MX] = { 0 };\\nll dis[MX]={0};\\nll calc(int a,int b,ll t){\\n if(b<=t+a)\\n return t+1;\\n //等待时间x,求导求极小值\\n ll x=ceil(sqrt(b))-t-a;\\n ll temp=t+ceil((double)(b)/(t+a));\\n if(x>=0)\\n temp=_min(temp,t+x+(ll)ceil((double)(b)/(t+a+x)));\\n if(x-1>=0)\\n temp=_min(temp,t+x-1+(ll)ceil((double)(b)/(t+a+x-1)));\\n if(x+1>=0)\\n temp=_min(temp,t+x+1+(ll)ceil((double)(b)/(t+a+x+1)));\\n return (ll)temp;\\n}\\nvoid dijkstra(int u) {\\n\\tq.push(make_pair(0, u));\\n\\tdis[u] = 0;\\n\\twhile (!q.empty()) {\\n\\t\\tpil a = q.top(); q.pop();\\n\\t\\tu = a.second;\\n\\t\\tif (vis[u])continue;\\n\\t\\tvis[u] = 1;\\n\\t\\tfor (int i = head[u]; i; i = e[i]._next) {\\n ll temp=calc(e[i].a,e[i].b,dis[u] );\\n\\t\\t\\tif (temp< dis[e[i].v]) {\\n\\t\\t\\t\\tdis[e[i].v] = temp;\\n\\t\\t\\t\\tq.push(make_pair(dis[e[i].v], e[i].v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Init() {\\n n=_r(),m=_r(),st=_r(),ed=_r();\\n for(int i=0;i<=n;i++){\\n dis[i]=ll_INF;\\n }\\n for(int i=0;i<m;i++){\\n int u,v,a,b;\\n u=_r(),v=_r(),a=_r(),b=_r();\\n addedge(u,v,a,b);\\n addedge(v,u,a,b);\\n }\\n}\\n\\nvoid solve() {\\n dijkstra(st);\\n printf(\\\"%lld\\\\n\\\",dis[ed]==ll_INF?-1:dis[ed]);\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n#endif\\n Init();\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.2698412698412698,\n \"time_ms\": 80,\n \"memory_kb\": 10972,\n \"score_of_the_acc\": -0.0805,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3044_6012188\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<int,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\nconst int dx[]={1,0,-1,0};\\nconst int dy[]={0,1,0,-1};\\nconst int MX = 1000010;\\nconst int MOD= 1e9+7;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nint n,m,st,ed;\\n\\nstruct Node {\\n int a,b;\\n\\tint v;\\n\\tint _next;\\n}e[MX<<1];\\nint head[MX], cnt = 0;\\nvoid addedge(int u, int v, int a, int b) {\\n\\te[++cnt].v = v;\\n\\te[cnt].a = a;\\n e[cnt].b = b;\\n\\te[cnt]._next = head[u];\\n\\thead[u] = cnt;\\n}\\npriority_queue<pil, vector<pil>, greater<pil> > q;\\nint vis[MX] = { 0 };\\nll dis[MX]={0};\\nll calc(int a,int b,ll t){\\n if(b<=t+a)\\n return t+1;\\n //求导求极小值\\n ll x=(ll)sqrt(b)-t-a;\\n ll temp=t+ceil((double)(b)/(t+a));\\n if(x>0)\\n temp=_min(temp,t+x+(int)ceil((double)(b)/(t+a+x)));\\n if(x-1>0)\\n temp=_min(temp,t+x-1+(int)ceil((double)(b)/(t+a+x-1)));\\n if(x+1>0)\\n temp=_min(temp,t+x+1+(int)ceil((double)(b)/(t+a+x+1)));\\n return (ll)temp;\\n}\\nvoid dijkstra(int u) {\\n\\tq.push(make_pair(0, u));\\n\\tdis[u] = 0;\\n\\twhile (!q.empty()) {\\n\\t\\tpil a = q.top(); q.pop();\\n\\t\\tu = a.second;\\n\\t\\tif (vis[u])continue;\\n\\t\\tvis[u] = 1;\\n\\t\\tfor (int i = head[u]; i; i = e[i]._next) {\\n ll temp=calc(e[i].a,e[i].b,dis[u] );\\n\\t\\t\\tif (temp< dis[e[i].v]) {\\n\\t\\t\\t\\tdis[e[i].v] = temp;\\n\\t\\t\\t\\tq.push(make_pair(dis[e[i].v], e[i].v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Init() {\\n n=_r(),m=_r(),st=_r(),ed=_r();\\n for(int i=0;i<=n;i++){\\n dis[i]=ll_INF;\\n }\\n for(int i=0;i<m;i++){\\n int u,v,a,b;\\n u=_r(),v=_r(),a=_r(),b=_r();\\n addedge(u,v,a,b);\\n addedge(v,u,a,b);\\n }\\n}\\n\\nvoid solve() {\\n dijkstra(st);\\n printf(\\\"%lld\\\\n\\\",dis[ed]==ll_INF?-1:dis[ed]);\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n#endif\\n Init();\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.2698412698412698,\n \"time_ms\": 80,\n \"memory_kb\": 11040,\n \"score_of_the_acc\": -0.0832,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3044_6012182\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<int,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\nconst int dx[]={1,0,-1,0};\\nconst int dy[]={0,1,0,-1};\\nconst int MX = 1000010;\\nconst int MOD= 1e9+7;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nint n,m,st,ed;\\n\\nstruct Node {\\n int a,b;\\n\\tint v;\\n\\tint _next;\\n}e[MX<<1];\\nint head[MX], cnt = 0;\\nvoid addedge(int u, int v, int a, int b) {\\n\\te[++cnt].v = v;\\n\\te[cnt].a = a;\\n e[cnt].b = b;\\n\\te[cnt]._next = head[u];\\n\\thead[u] = cnt;\\n}\\npriority_queue<pil, vector<pil>, greater<pil> > q;\\nint vis[MX] = { 0 };\\nll dis[MX]={0};\\nll calc(int a,int b,ll t){\\n if(b<=t+a)\\n return t+1;\\n //求导求极小值\\n int x=(int)sqrt(b)-t-a;\\n int temp=t+ceil((double)(b)/(t+a));\\n if(x>0)\\n temp=_min(temp,t+x+(int)ceil((double)(b)/(t+a+x)));\\n if(x-1>0)\\n temp=_min(temp,t+x-1+(int)ceil((double)(b)/(t+a+x-1)));\\n if(x+1>0)\\n temp=_min(temp,t+x+1+(int)ceil((double)(b)/(t+a+x+1)));\\n return (ll)temp;\\n}\\nvoid dijkstra(int u) {\\n\\tq.push(make_pair(0, u));\\n\\tdis[u] = 0;\\n\\twhile (!q.empty()) {\\n\\t\\tpil a = q.top(); q.pop();\\n\\t\\tu = a.second;\\n\\t\\tif (vis[u])continue;\\n\\t\\tvis[u] = 1;\\n\\t\\tfor (int i = head[u]; i; i = e[i]._next) {\\n ll temp=calc(e[i].a,e[i].b,dis[u] );\\n\\t\\t\\tif (temp< dis[e[i].v]) {\\n\\t\\t\\t\\tdis[e[i].v] = temp;\\n\\t\\t\\t\\tq.push(make_pair(dis[e[i].v], e[i].v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Init() {\\n n=_r(),m=_r(),st=_r(),ed=_r();\\n for(int i=0;i<=n;i++){\\n dis[i]=ll_INF;\\n }\\n for(int i=0;i<m;i++){\\n int u,v,a,b;\\n u=_r(),v=_r(),a=_r(),b=_r();\\n addedge(u,v,a,b);\\n addedge(v,u,a,b);\\n }\\n}\\n\\nvoid solve() {\\n dijkstra(st);\\n printf(\\\"%lld\\\\n\\\",dis[ed]==ll_INF?-1:dis[ed]);\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n#endif\\n Init();\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.2698412698412698,\n \"time_ms\": 80,\n \"memory_kb\": 11144,\n \"score_of_the_acc\": -0.0873,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3044_6012176\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <string>\\n#include <cstdlib>\\n#include <sstream>\\n#include <queue>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ull;\\ntypedef pair<int,int> pil;\\nconst ll ll_INF = 0x3f3f3f3f3f3f3f3f;\\nconst int int_INF = 0x3f3f3f3f;\\nconst double EPS = 1e-7;\\n#define R register\\n#define _max(a,b) ((a)>(b)?(a):(b))\\n#define _min(a,b) ((a)<(b)?(a):(b))\\n#define _abs(a) ((a)> 0 ?(a):-(a))\\n#define _swap(a,b) ((a)^=(b)^=(a)^=(b))\\n#define _eql(x,y) (_abs((x) - (y))<EPS)\\nconst int dx[]={1,0,-1,0};\\nconst int dy[]={0,1,0,-1};\\nconst int MX = 1000010;\\nconst int MOD= 1e9+7;\\nll _r() {\\n ll x = 0, f = 1;\\n char c = getchar();\\n while (c > '9' || c < '0') { if (c == '-')f = -1; c = getchar(); }\\n while (c >= '0' && c <= '9')x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();\\n return f==-1?-x:x;\\n}\\nint n,m,st,ed;\\n\\nstruct Node {\\n int a,b;\\n\\tint v;\\n\\tint _next;\\n}e[MX<<1];\\nint head[MX], cnt = 0;\\nvoid addedge(int u, int v, int a, int b) {\\n\\te[++cnt].v = v;\\n\\te[cnt].a = a;\\n e[cnt].b = b;\\n\\te[cnt]._next = head[u];\\n\\thead[u] = cnt;\\n}\\npriority_queue<pil, vector<pil>, greater<pil> > q;\\nint vis[MX] = { 0 };\\nll dis[MX]={0};\\nll calc(int a,int b,ll t){\\n if(b<=t+a)\\n return t+1;\\n //求导求极小值\\n double x=(double)sqrt(b)-t-a;\\n double temp=t+ceil((double)(b)/(t+a));\\n if(ceil(x)>0)\\n temp=_min(temp,t+ ceil(x)+ceil((double)(b)/(t+a+ ceil(x))));\\n if(floor(x)>0)\\n temp=_min(temp,t+floor(x)+ceil((double)(b)/(t+a+floor(x))));\\n return (ll)temp;\\n}\\nvoid dijkstra(int u) {\\n\\tq.push(make_pair(0, u));\\n\\tdis[u] = 0;\\n\\twhile (!q.empty()) {\\n\\t\\tpil a = q.top(); q.pop();\\n\\t\\tu = a.second;\\n\\t\\tif (vis[u])continue;\\n\\t\\tvis[u] = 1;\\n\\t\\tfor (int i = head[u]; i; i = e[i]._next) {\\n ll temp=calc(e[i].a,e[i].b,dis[u] );\\n\\t\\t\\tif (temp< dis[e[i].v]) {\\n\\t\\t\\t\\tdis[e[i].v] = temp;\\n\\t\\t\\t\\tq.push(make_pair(dis[e[i].v], e[i].v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid Init() {\\n n=_r(),m=_r(),st=_r(),ed=_r();\\n for(int i=0;i<=n;i++){\\n dis[i]=ll_INF;\\n }\\n for(int i=0;i<m;i++){\\n int u,v,a,b;\\n u=_r(),v=_r(),a=_r(),b=_r();\\n addedge(u,v,a,b);\\n addedge(v,u,a,b);\\n }\\n}\\n\\nvoid solve() {\\n dijkstra(st);\\n printf(\\\"%lld\\\\n\\\",dis[ed]==ll_INF?-1:dis[ed]);\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"data.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"data.out\\\", \\\"w\\\", stdout);\\n#endif\\n Init();\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.2698412698412698,\n \"time_ms\": 80,\n \"memory_kb\": 11124,\n \"score_of_the_acc\": -0.0865,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3044_5543340\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <cmath>\\nusing namespace std;\\nusing ll = long long int;\\nusing P = pair<ll, int>;\\nstruct Edge{\\n int to;\\n ll a;\\n ll b;\\n};\\n\\nint main(){\\n int n, m, s, g;\\n cin >> n >> m >> s >> g;\\n s--; g--;\\n vector<vector<Edge>> G(n);\\n for(int i = 0; i < m; i++){\\n ll u, v, a, b;\\n cin >> u >> v >> a >> b;\\n u--; v--;\\n G[u].push_back({(int)v, a, b});\\n G[v].push_back({(int)u, a, b});\\n }\\n\\n vector<ll> dist(n, 1LL << 60);\\n priority_queue<P, vector<P>, greater<P>> Q;\\n dist[s] = 0;\\n Q.push({0, s});\\n auto newtime = [&](const Edge &e, ll curtime){\\n ll ans = 1LL << 60;\\n ll start = max(curtime, (ll)sqrt(e.b)-e.a-20);\\n for(ll t = start; t < start+40; t++) ans = min(ans, t+(e.b+t+e.a-1)/(t+e.a));\\n return ans;\\n };\\n while(Q.size()){\\n P cur = Q.top(); Q.pop();\\n if(dist[cur.second] < cur.first) continue;\\n\\n for(auto &p: G[cur.second]){\\n ll ntime = newtime(p, dist[cur.second]);\\n if(dist[p.to] > ntime){\\n dist[p.to] = ntime;\\n Q.push({ntime, p.to});\\n }\\n }\\n }\\n\\n if(dist[g] < 1LL << 60) cout << dist[g] << endl;\\n else cout << -1 << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 28648,\n \"score_of_the_acc\": -1.0159,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3044_4322426\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <tuple>\\n#include <cmath>\\nusing namespace std;\\ntemplate<class T> T ceil(T a, T b) { return a / b + !!(a % b); }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nusing pll = pair<long long, long long>;\\nusing edge = pair<int, pll>;\\nusing Graph = vector<vector<edge>>;\\nint main() {\\n int n, m; cin >> n >> m;\\n int s, t; cin >> s >> t; s--, t--;\\n Graph g(n);\\n while (m--) {\\n int u, v; cin >> u >> v; u--, v--;\\n long long a, b; cin >> a >> b;\\n g[u].emplace_back(v, pll(a, b));\\n g[v].emplace_back(u, pll(a, b));\\n }\\n using T = long long;\\n const T INF = numeric_limits<T>::max();\\n vector<T> dp(n, INF);\\n using P = pair<T, int>;\\n priority_queue<P, vector<P>, greater<P>> que;\\n que.emplace(dp[s] = 0, s);\\n auto calc = [&](long long cur, pll &p) {\\n long long a, b; tie(a, b) = p;\\n auto f = [&](long long t) { return t + ceil(b, t + a); };\\n long long mi = f(cur), t = sqrt(b) - a;\\n for (int d: {-1, 0, 1}) if (cur <= t + d) chmin(mi, f(t + d));\\n return mi;\\n };\\n while (!que.empty()) {\\n long long cur; int u; tie(cur, u) = que.top(); que.pop();\\n if (dp[u] < cur) continue;\\n for (auto &e: g[u]) {\\n int v = e.first;\\n if (chmin(dp[v], calc(cur, e.second))) que.emplace(dp[v], v);\\n }\\n }\\n cout << (dp[t] == INF ? -1 : dp[t]) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 26548,\n \"score_of_the_acc\": -0.9091,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3044_4264969\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 200005\\n\\nstruct Edge{\\n\\n\\tint from,to;\\n\\tll A,B;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_to,int arg_index){\\n\\t\\tto = arg_to;\\n\\t\\tedge_index = arg_index;\\n\\t}\\n\\tint to,edge_index;\\n};\\n\\nstruct State{\\n\\tState(int arg_node_id,double arg_sum_dist){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\\n\\t}\\n\\n\\tint node_id;\\n\\tdouble sum_dist;\\n};\\n\\nint N,M,start,goal;\\ndouble min_dist[SIZE];\\nEdge edge[SIZE];\\nvector<Info> G[SIZE];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&M,&start,&goal);\\n\\tstart--;\\n\\tgoal--;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%d %d %lld %lld\\\",&edge[i].from,&edge[i].to,&edge[i].A,&edge[i].B);\\n\\t\\tedge[i].from--;\\n\\t\\tedge[i].to--;\\n\\t\\tG[edge[i].from].push_back(Info(edge[i].to,i));\\n\\t\\tG[edge[i].to].push_back(Info(edge[i].from,i));\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tmin_dist[i] = DBL_MAX;\\n\\t}\\n\\n\\tmin_dist[start] = 0;\\n\\n\\tpriority_queue<State> Q;\\n\\tQ.push(State(start,0));\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else if(Q.top().node_id == goal){\\n\\n\\t\\t\\tprintf(\\\"%.0lf\\\\n\\\",Q.top().sum_dist);\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tint next = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tint index = G[Q.top().node_id][i].edge_index;\\n\\t\\t\\t\\tll A = edge[index].A;\\n\\t\\t\\t\\tll B = edge[index].B;\\n\\n\\t\\t\\t\\tdouble base = sqrt(B)-A;\\n\\t\\t\\t\\tdouble next_dist;\\n\\n\\t\\t\\t\\tif(base <= Q.top().sum_dist){\\n\\n\\t\\t\\t\\t\\tnext_dist = ceil(Q.top().sum_dist+(B/(Q.top().sum_dist+A)));\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tnext_dist = ceil(base+(B/(base+A)));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(min_dist[next] > next_dist){\\n\\t\\t\\t\\t\\tmin_dist[next] = next_dist;\\n\\t\\t\\t\\t\\tQ.push(State(next,next_dist));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"-1\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 26700,\n \"score_of_the_acc\": -0.7083,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3044_3668487\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\nconst ll INF=1e18;\\nconst ll WIDTH=1;\\nstruct Edge{\\n int to;\\n ll a,b;\\n};\\nusing Graph=vector<vector<Edge>>;\\nll f(ll t,ll a,ll b){\\n return t+b/(t+a)+(int)(b%(t+a)>0);\\n}\\n\\nusing dbl=double;\\nll calc(ll t,ll a,ll b){\\n dbl X=2*a+1;\\n dbl Y=(dbl)(a)*(a+1)-b;\\n dbl t0=(-X+sqrt(X*X-4*Y))/2;\\n ll res=f(t,a,b);\\n ll tx=t0;\\n for(int i=-WIDTH;i<=WIDTH;i++){\\n ll topt=tx+i;\\n if(topt<t) continue;\\n res=min(res,f(topt,a,b));\\n }\\n\\n return res;\\n}\\nvector<ll> Dijkstra(int s,Graph& g){\\n int n=g.size();\\n vector<ll> t(n,INF);\\n using Item=pair<ll,int>;\\n priority_queue<Item,vector<Item>,greater<>> que;\\n t[s]=0;\\n que.push({0LL,s});\\n vector<int> used(n,false);\\n while(!que.empty()){\\n auto tmp=que.top(); que.pop();\\n int v=tmp.second;\\n if(t[v]<tmp.first) continue;\\n assert(!used[v]);\\n used[v]=true;\\n for(Edge& e:g[v]){\\n ll tot=calc(t[v],e.a,e.b);\\n assert(t[v]<=tot);\\n if(tot<t[e.to]){\\n\\tt[e.to]=tot;\\n\\tque.push({tot,e.to});\\n }\\n }\\n }\\n return t;\\n}\\nint main(){\\nios::sync_with_stdio(false);\\ncin.tie(0);\\n int n,m;\\n int S,G;\\n cin>>n>>m>>S>>G;\\n S--,G--;\\n Graph g(n);\\n for(int i=0;i<m;i++){\\n int u,v;\\n ll a,b;\\n cin>>u>>v>>a>>b;\\n u--,v--;\\n g[u].push_back(Edge{v,a,b});\\n g[v].push_back(Edge{u,a,b});\\n }\\n\\n auto t=Dijkstra(S,g);\\n\\n cout<<(t[G]>=INF ? -1LL : t[G])<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 27292,\n \"score_of_the_acc\": -0.7894,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3044_3392255\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef pair<P,P> PP;\\nconst ll MOD = 1000000007;\\nconst int IINF = INT_MAX;\\nconst ll LLINF = LLONG_MAX;\\nconst int MAX_N = int(2e5 + 5);\\nconst int MAX_V = int(2e5 + 5);\\nconst double EPS = 1e-10;\\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\\n#define REP(i, n) for (int i = 0; i < n; i++)\\n#define REPR(i, n) for (int i = n; i >= 0; i--)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define ALL(v) (v).begin(), (v).end()\\n\\nstruct edge {\\n ll from, to, a, b;\\n edge(ll u, ll v, ll a, ll b) : from(u), to(v), a(a), b(b){};\\n};\\n\\nvector<edge> G[MAX_V];\\nll dmin[MAX_V];\\n\\nvoid add_edge(ll u, ll v, ll a, ll b) {\\n G[u].push_back(edge(u, v, a, b));\\n G[v].push_back(edge(v, u, a, b));\\n}\\n\\nll f(ll b, ll a, ll x) { return ll(ceil(b / double(a + x) + double(x))); }\\n\\nvoid dijkstra(int s) {\\n priority_queue<P, vector<P>, greater<P> > que; //小さいものから取り出す\\n fill(dmin, dmin + MAX_V, LLINF);\\n dmin[s] = 0;\\n que.push(P(0, s));\\n\\n while (!que.empty()) {\\n P p = que.top();\\n que.pop();\\n int v = p.second;\\n if (dmin[v] < p.first) continue;\\n for (auto &e : G[v]) {\\n ll k = max(0.0, pow(e.b, 0.5) - (e.a + dmin[v])), cost;\\n cost = f(e.b, e.a + dmin[v], 0);\\n if (k > 0) {\\n cost = min(cost,min(f(e.b,e.a+dmin[v],floor(k)),f(e.b,e.a+dmin[v],ceil(k))));\\n }\\n if (dmin[e.to] > dmin[v] + cost) {\\n dmin[e.to] = dmin[v] + cost;\\n que.push(P(dmin[e.to], e.to));\\n }\\n }\\n }\\n}\\n\\nint main() {\\n ll n, m, s, g;\\n cin >> n >> m >> s >> g;\\n REP(i, m) {\\n ll u, v, a, b;\\n cin >> u >> v >> a >> b;\\n add_edge(u, v, a, b);\\n }\\n dijkstra(s);\\n cout << (dmin[g]!=LLINF?dmin[g]:-1) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 32316,\n \"score_of_the_acc\": -1.1738,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3044_3386073\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nnamespace sub {\\n template<typename T>\\n constexpr typename std::enable_if<std::is_integral<T>::value, T>::type\\n inf_sub() {\\n return std::numeric_limits<T>::max() / 2 - 1000;\\n }\\n\\n template<typename T>\\n constexpr typename std::enable_if<std::is_floating_point<T>::value, T>::type\\n inf_sub() {\\n return std::min(std::numeric_limits<T>::max() / 2 - 1000, T(1e50));\\n }\\n} // namespace sub\\n\\ntemplate<typename T>\\nconstexpr T inf() {\\n static_assert(std::is_arithmetic<T>::value, \\\"T must be arithmetic value\\\");\\n return sub::inf_sub<T>();\\n}\\n\\ntemplate<typename T>\\nconstexpr T zero() {\\n static_assert(std::is_arithmetic<T>::value, \\\"T must be arithmetic value\\\");\\n return T(0);\\n}\\n\\nconst long double pi = acos(-1.0);\\n\\ntemplate<class edge_t>\\nclass graph_t {\\n std::vector<std::vector<edge_t>> g;\\n\\npublic:\\n using reference = std::vector<edge_t> &;\\n using const_reference = const std::vector<edge_t> &;\\n using iterator = typename std::vector<edge_t>::iterator;\\n\\n graph_t() : g(0) { ; }\\n\\n graph_t(int n) : g(n) { ; }\\n\\n int size() const { return g.size(); }\\n\\n void push_back(const std::vector<edge_t> &es) { g.push_back(es); }\\n\\n reference operator[](int x) { return g[x]; }\\n\\n const_reference operator[](int x) const { return g[x]; }\\n\\n iterator &begin() { return begin(g); }\\n\\n iterator &end() { return end(g); }\\n};\\n\\n\\ntypedef __int128 int128;\\n\\n/**\\n * func: (long long) -> boolean\\n * binary_search() returns the minimum element x which satisfies f(-∞) != f(x)\\n * e.g.\\n * i: 1 2 3 4 5 6 7 8 9\\n * f(i): 0 0 0 0 0 0 1 1 1\\n * ^\\n * x\\n */\\ntemplate<class F>\\nint128 binary_search(F func) {\\n int128 l = -1, r = 1;\\n while (func(l) == func(r)) {\\n l *= 2;\\n r *= 2;\\n }\\n bool l_value = func(l);\\n\\n while (l != r) {\\n int128 m = (l + r);\\n if (m % 2 == 0) m /= 2;\\n else m = (m - 1) / 2;\\n if (func(m) != l_value) {\\n r = m;\\n } else {\\n l = m + 1;\\n }\\n }\\n return l;\\n}\\n\\nint128 sqrt(int128 v) {\\n return binary_search([v](int128 x) {\\n if (x < 0) return false;\\n if (x >= v) return true;\\n return x * x >= v;\\n });\\n\\n}\\n\\nvector<long long> best_time(long long t, long long a, long long b) {\\n long long alpha = t + a;\\n int128 B = 2 * alpha;\\n int128 C = (int128) alpha * alpha - b;\\n if (B * B - 4 * C < 0) {\\n return {0};\\n }\\n int128 D = sqrt(B * B - 4 * C);\\n\\n return {0ll, (long long) ((-B + D) / 2), (long long) ((-B + D) / 2) + 1};\\n}\\n\\nlong long ceil(long long a, long long b) {\\n return (a + b - 1) / b;\\n}\\n\\ntemplate<typename edge_t, typename cost_type = typename edge_t::cost_type>\\nstd::vector<cost_type> dijkstra(const graph_t<edge_t> &g, int s) {\\n std::vector<cost_type> d(g.size(), inf<cost_type>());\\n d[s] = zero<cost_type>();\\n using P = std::pair<cost_type, int>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\\n que.push(P(zero<cost_type>(), s));\\n while (!que.empty()) {\\n cost_type dist = que.top().first;\\n int v = que.top().second;\\n que.pop();\\n if (d[v] < dist) continue;\\n for (const auto &e : g[v]) {\\n for (auto k : best_time(dist, e.a, e.b)) {\\n if (k < 0) continue;\\n// while (k > 0) {\\n// long long cost = k + ceil(e.b, dist + e.a + k);\\n// long long cost2 = k-1 + ceil(e.b, dist + e.a + k-1);\\n// if( cost <= cost2 ){\\n// break;\\n// }\\n// --k;\\n// }\\n// while (true) {\\n// long long cost = k + ceil(e.b, dist + e.a + k);\\n// long long cost2 = k+1 + ceil(e.b, dist + e.a + k+1);\\n// if( cost <= cost2 ){\\n// break;\\n// }\\n// ++k;\\n// }\\n long long cost = k + ceil(e.b, dist + e.a + k);\\n\\n if (d[e.to] <= d[v] + cost) continue;\\n d[e.to] = d[v] + cost;\\n que.push(P(d[e.to], e.to));\\n }\\n }\\n }\\n return d;\\n}\\n\\n\\ntemplate<typename Cost>\\nclass WeightedEdge {\\npublic:\\n using cost_type = Cost;\\n int to;\\n cost_type cost;\\n long long a, b;\\n\\n WeightedEdge(int, int t, cost_type c, long long a, long long b) : to(t), cost(c), a(a), b(b) { ; }\\n};\\n\\ntemplate<typename Cost> using WeightedGraph = graph_t<WeightedEdge<Cost>>;\\n\\ntemplate<typename Cost>\\nvoid add_edge(WeightedGraph<Cost> &g, int from, int to, Cost cost, long long a, long long b) {\\n g[from].emplace_back(from, to, cost, a, b);\\n}\\n\\nint main() {\\n int N, M, S, G;\\n cin >> N >> M >> S >> G;\\n WeightedGraph<long long> g(N);\\n\\n for (int i = 0; i < M; i++) {\\n long long u, v, a, b;\\n cin >> u >> v >> a >> b;\\n --u, --v;\\n add_edge(g, u, v, 0ll, a, b);\\n add_edge(g, v, u, 0ll, a, b);\\n }\\n --S, --G;\\n\\n auto ans = dijkstra(g, S)[G];\\n if (ans != inf<long long>()) {\\n cout << ans << endl;\\n } else {\\n cout << -1 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 36024,\n \"score_of_the_acc\": -1.4828,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3044_3213678\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nstruct Edge {\\n\\tint src;\\n\\tint dst;\\n\\tlong long int A;\\n\\tlong long int B;\\n};\\nstruct aa {\\n\\tint now;\\n\\tlong long int cost;\\n};\\nbool operator <(const aa&l, const aa&r) {\\n\\treturn l.cost>r.cost;\\n}\\nlong long int ce(long long int a,long long int b) {\\n\\treturn (a-1)/b+1;\\n}\\nint main() {\\n\\tint N,M,S,G;cin>>N>>M>>S>>G;\\n\\tS--;G--;\\n\\tvector<vector<Edge>>g(N);\\n\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a,b;\\n\\t\\tlong long int A,B;cin>>a>>b>>A>>B;a--;b--;\\n\\t\\tg[a].push_back(Edge{ a,b,A,B });\\n\\t\\tg[b].push_back(Edge{ b,a,A,B });\\n\\t}\\n\\n\\tvector<long long int>memo(N,1e18);\\n\\tmemo[S]=0;\\n\\tpriority_queue<aa>que;\\n\\tque.push(aa{ S,0 });\\n\\twhile (!que.empty()) {\\n\\t\\tauto atop(que.top());\\n\\t\\tque.pop();\\n\\t\\tconst int now=atop.now;\\n\\t\\tconst long long int now_cost=atop.cost;\\n\\t\\tif(memo[now]!=now_cost)continue;\\n\\t\\tfor (auto e : g[now]) {\\n\\t\\t\\tint next=e.dst;\\n\\t\\t\\tlong long int next_cost=now_cost;\\n\\t\\t\\tif (e.A >= 1e8) {\\n\\t\\t\\t\\tnext_cost=now_cost+ce(e.B,e.A+now_cost);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlong long int needt=sqrt(e.B)-e.A;\\n\\n\\t\\t\\t\\tlong long int this_cost=1e18;\\n\\t\\t\\t\\tfor (long long int stop_t = needt - 1; stop_t <= needt + 1; ++stop_t) {\\n\\t\\t\\t\\t\\tlong long int at = max(stop_t, now_cost);\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tthis_cost=min(this_cost,at+ce(e.B,e.A+at));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnext_cost=this_cost;\\n\\t\\t\\t}\\n\\t\\t\\tif (memo[next] > next_cost) {\\n\\t\\t\\t\\tmemo[next]=next_cost;\\n\\t\\t\\t\\tque.push(aa{ next,next_cost });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(memo[G]>7e17)memo[G]=-1;\\n\\tcout<<memo[G]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 26648,\n \"score_of_the_acc\": -0.9131,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3044_3213659\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nstruct Edge {\\n\\tint src;\\n\\tint dst;\\n\\tlong long int A;\\n\\tlong long int B;\\n};\\nstruct aa {\\n\\tint now;\\n\\tlong long int cost;\\n};\\nbool operator <(const aa&l, const aa&r) {\\n\\treturn l.cost>r.cost;\\n}\\nlong long int ce(long long int a,long long int b) {\\n\\treturn (a-1)/b+1;\\n}\\nint main() {\\n\\tint N,M,S,G;cin>>N>>M>>S>>G;\\n\\tS--;G--;\\n\\tvector<vector<Edge>>g(N);\\n\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint a,b;\\n\\t\\tint A,B;cin>>a>>b>>A>>B;a--;b--;\\n\\t\\tg[a].push_back(Edge{ a,b,A,B });\\n\\t\\tg[b].push_back(Edge{ b,a,A,B });\\n\\t}\\n\\n\\tvector<long long int>memo(N,1e18);\\n\\tmemo[S]=0;\\n\\tpriority_queue<aa>que;\\n\\tque.push(aa{ S,0 });\\n\\twhile (!que.empty()) {\\n\\t\\tauto atop(que.top());\\n\\t\\tque.pop();\\n\\t\\tconst int now=atop.now;\\n\\t\\tconst long long int now_cost=atop.cost;\\n\\t\\tfor (auto e : g[now]) {\\n\\t\\t\\tint next=e.dst;\\n\\t\\t\\tlong long int next_cost=now_cost;\\n\\t\\t\\tif (e.A >= 1e8) {\\n\\t\\t\\t\\tnext_cost=now_cost+ce(e.B,e.A+now_cost);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlong long int needt=sqrt(e.B)-e.A;\\n\\n\\t\\t\\t\\tlong long int this_cost=1e18;\\n\\t\\t\\t\\tfor (long long int stop_t = needt - 2; stop_t <= needt + 2; ++stop_t) {\\n\\t\\t\\t\\t\\tlong long int at = max(stop_t, now_cost);\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tthis_cost=min(this_cost,at+ce(e.B,e.A+at));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnext_cost=this_cost;\\n\\t\\t\\t}\\n\\t\\t\\tif (memo[next] > next_cost) {\\n\\t\\t\\t\\tmemo[next]=next_cost;\\n\\t\\t\\t\\tque.push(aa{ next,next_cost });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(memo[G]>7e17)memo[G]=-1;\\n\\tcout<<memo[G]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.25396825396825395,\n \"time_ms\": 10,\n \"memory_kb\": 15912,\n \"score_of_the_acc\": -0.1972,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3044_3160438\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cmath>\\nusing namespace std;\\n\\n\\n#define REP(i, s) for (int i = 0; i < s; ++i)\\n#define ALL(v) (v.begin(), v.end())\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\n\\n\\n\\ntypedef pair<long long, long long> Par;\\ntypedef pair<int, Par> Edge;\\nvector<vector<Edge> > G;\\n\\nint N, M, s, g;\\n\\ninline long long func(long long t, long long a, long long b) {\\n return t + (b + t+a-1) / (t+a);\\n}\\ninline long long calc(long long K, long long a, long long b) {\\n long long sb = (long long)(sqrt(b));\\n long long start = max(0LL, sb - a - 2);\\n long long res = func(K, a, b);\\n for (long long t = start; t < start + 5; ++t) {\\n if (t < K) continue;\\n res = min(res, func(t, a, b));\\n }\\n return res;\\n}\\n\\nint main() {\\n cin >> N >> M >> s >> g;\\n --s, --g;\\n G.clear(); G.resize(N);\\n for (int i = 0; i < M; ++i) {\\n int u, v; cin >> u >> v; --u, --v;\\n long long a, b; cin >> a >> b;\\n G[u].push_back(Edge(v, Par(a, b)));\\n G[v].push_back(Edge(u, Par(a, b)));\\n }\\n \\n const long long INF = 1LL<<60;\\n vector<long long> dp(N, INF);\\n priority_queue<pair<long long,int>, vector<pair<long long,int> >, greater<pair<long long,int> > > que;\\n que.push(make_pair(0, s));\\n dp[s] = 0;\\n while (!que.empty()) {\\n auto cur = que.top(); que.pop();\\n int v = cur.second;\\n long long t = cur.first;\\n if (dp[v] < t) continue;\\n \\n //cout << v << \\\": \\\" << dp[v] << endl;\\n \\n for (auto e : G[v]) {\\n int to = e.first;\\n long long a = e.second.first;\\n long long b = e.second.second;\\n long long dist = calc(t, a, b);\\n if (chmin(dp[to], dist)) que.push(make_pair(dist, to));\\n }\\n }\\n if (dp[g] < INF) cout << dp[g] << endl;\\n else cout << -1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 26532,\n \"score_of_the_acc\": -0.897,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3044_3160434\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cmath>\\nusing namespace std;\\n\\n\\n#define REP(i, s) for (int i = 0; i < s; ++i)\\n#define ALL(v) (v.begin(), v.end())\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\n\\n\\n\\ntypedef pair<long long, long long> Par;\\ntypedef pair<int, Par> Edge;\\nvector<vector<Edge> > G;\\n\\nint N, M, s, g;\\n\\ninline long long func(long long t, long long a, long long b) {\\n return t + (b + t+a-1) / (t+a);\\n}\\ninline long long calc(long long K, long long a, long long b) {\\n long long sb = (long long)(sqrt(b));\\n long long start = sb - 2;\\n long long res = func(K, a, b);\\n for (long long t = max(0LL, start); t < start + 5; ++t) {\\n if (t < K) continue;\\n res = min(res, func(t, a, b));\\n }\\n return res;\\n}\\n\\nint main() {\\n cin >> N >> M >> s >> g;\\n --s, --g;\\n G.clear(); G.resize(N);\\n for (int i = 0; i < M; ++i) {\\n int u, v; cin >> u >> v; --u, --v;\\n long long a, b; cin >> a >> b;\\n G[u].push_back(Edge(v, Par(a, b)));\\n G[v].push_back(Edge(u, Par(a, b)));\\n }\\n \\n const long long INF = 1LL<<60;\\n vector<long long> dp(N, INF);\\n priority_queue<pair<long long,int>, vector<pair<long long,int> >, greater<pair<long long,int> > > que;\\n que.push(make_pair(0, s));\\n dp[s] = 0;\\n while (!que.empty()) {\\n auto cur = que.top(); que.pop();\\n int v = cur.second;\\n long long t = cur.first;\\n if (dp[v] < t) continue;\\n \\n //cout << v << \\\": \\\" << dp[v] << endl;\\n \\n for (auto e : G[v]) {\\n int to = e.first;\\n long long a = e.second.first;\\n long long b = e.second.second;\\n long long dist = calc(t, a, b);\\n if (chmin(dp[to], dist)) que.push(make_pair(dist, to));\\n }\\n }\\n if (dp[g] < INF) cout << dp[g] << endl;\\n else cout << -1 << endl;\\n}\",\n \"accuracy\": 0.38095238095238093,\n \"time_ms\": 270,\n \"memory_kb\": 19348,\n \"score_of_the_acc\": -0.6332,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3044_3152839\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<typename Func>\\nll findMin(ll L, ll R, Func f) { //[L, R)\\n ll lo = L - 1, hi = R - 1;\\n while (lo + 1 != hi) {\\n ll mi = (lo + hi) / 2;\\n if (f(mi) <= f(mi + 1)) hi = mi;\\n else lo = mi;\\n }\\n return hi;\\n}\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\\nvector<pair<int,int>> E[201010];\\nll dst[201010]; int vis[201010];\\nll line[201010];\\n//---------------------------------------------------------------------------------------------------\\nll a, b;\\nll f(ll x) {\\n return x + (b + x + a - 1) / (x + a);\\n}\\ndouble fd(double x) {\\n return x + 1.0 * b / (x + 1.0 * a);\\n}\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n rep(i, 0, M) {\\n cin >> U[i] >> V[i] >> A[i] >> B[i];\\n U[i]--; V[i]--;\\n\\n E[U[i]].push_back({ V[i], i });\\n E[V[i]].push_back({ U[i], i });\\n }\\n\\n rep(i, 0, N) dst[i] = infl;\\n\\n min_priority_queue<pair<ll, int>> que;\\n que.push({0, S});\\n dst[S] = 0;\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n ll d = q.first;\\n int cu = q.second;\\n\\n if (vis[cu]) continue;\\n vis[cu] = 1;\\n\\n if (cu == G) {\\n printf(\\\"%lld\\\\n\\\", dst[cu]);\\n return;\\n }\\n\\n fore(p, E[cu]) {\\n int to = p.first;\\n a = A[p.second];\\n b = B[p.second];\\n\\n ll t = findMin(d, infl, fd);\\n\\n ll nd = min(f(t), f(t + 1));\\n\\n if (nd < dst[to]) {\\n dst[to] = nd;\\n que.push({ nd, to });\\n }\\n }\\n }\\n\\n printf(\\\"-1\\\\n\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 26684,\n \"score_of_the_acc\": -0.8686,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3044_3152805\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<typename Func>\\ndouble findMinReal(double L, double R, Func f) { //[L, R)\\n double left = L, right = R;\\n\\n for (int loop = 0; loop < 101; ++loop) {\\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\\n right = (left + right * 2) / 3;\\n }\\n else {\\n left = (left * 2 + right) / 3;\\n }\\n }\\n return (right + left) * 0.5;\\n}\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\\nvector<pair<int,int>> E[201010];\\nll dst[201010]; int vis[201010];\\nll line[201010];\\n//---------------------------------------------------------------------------------------------------\\nll a, b;\\nll f(ll x) {\\n return x + (b + x + a - 1) / (x + a);\\n}\\ndouble fr(double x) {\\n return x + 1.0 * b / (x + a);\\n}\\n//---------------------------------------------------------------------------------------------------\\nll getline(int i) {\\n /*a = A[i]; b = B[i];\\n double l = 0, h = 1e20;\\n rep(i, 0, 200) {\\n double m1 = l + (h - l) / 3, m2 = l + (h - l) / 3 * 2;\\n double f1 = fr(m1), f2 = fr(m2);\\n if (f1 > f2) l = m1; else h = m2;\\n }\\n return f((ll)l) < f((ll)l + 1) ? l : l + 1;*/\\n\\n a = A[i]; b = B[i];\\n double t = findMinReal(0, infl, fr);\\n\\n ll res = t;\\n ll mi = res;\\n\\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\\n return mi;\\n}\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n rep(i, 0, M) {\\n cin >> U[i] >> V[i] >> A[i] >> B[i];\\n U[i]--; V[i]--;\\n\\n E[U[i]].push_back({ V[i], i });\\n E[V[i]].push_back({ U[i], i });\\n line[i] = getline(i);\\n }\\n\\n rep(i, 0, N) dst[i] = infl;\\n\\n min_priority_queue<pair<ll, int>> que;\\n que.push({0, S});\\n dst[S] = 0;\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n ll d = q.first;\\n int cu = q.second;\\n\\n if (vis[cu]) continue;\\n vis[cu] = 1;\\n\\n if (cu == G) {\\n printf(\\\"%lld\\\\n\\\", dst[cu]);\\n return;\\n }\\n\\n fore(p, E[cu]) {\\n int to = p.first;\\n a = A[p.second];\\n b = B[p.second];\\n\\n ll t;\\n if (d < line[q.second]) t = line[p.second];\\n else t = d;\\n\\n ll nd = f(t);\\n\\n if (nd < dst[to]) {\\n dst[to] = nd;\\n que.push({ nd, to });\\n }\\n }\\n }\\n printf(\\\"-1\\\\n\\\");\\n}\",\n \"accuracy\": 0.5238095238095238,\n \"time_ms\": 400,\n \"memory_kb\": 20888,\n \"score_of_the_acc\": -0.8441,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3044_3152786\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\n#define double long double\\ntemplate<typename Func>\\ndouble findMinReal(double L, double R, Func f) { //[L, R)\\n double left = L, right = R;\\n\\n for (int loop = 0; loop < 201; ++loop) {\\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\\n right = (left + right * 2) / 3;\\n }\\n else {\\n left = (left * 2 + right) / 3;\\n }\\n }\\n return (right + left) * 0.5;\\n}\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\\nvector<pair<int,int>> E[201010];\\nll dst[201010]; int vis[201010];\\nll line[201010];\\n//---------------------------------------------------------------------------------------------------\\nll a, b;\\nll f(ll x) {\\n return x + (b + x + a - 1) / (x + a);\\n}\\ndouble fr(double x) {\\n return x + b / (x + a);\\n}\\n//---------------------------------------------------------------------------------------------------\\nll getline(int i) {\\n a = A[i]; b = B[i];\\n double t = findMinReal(0, infl, fr);\\n\\n ll res = t;\\n ll mi = res;\\n\\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\\n return mi;\\n}\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n rep(i, 0, M) {\\n cin >> U[i] >> V[i] >> A[i] >> B[i];\\n U[i]--; V[i]--;\\n\\n E[U[i]].push_back({ V[i], i });\\n E[V[i]].push_back({ U[i], i });\\n line[i] = getline(i);\\n }\\n\\n rep(i, 0, N) dst[i] = infl;\\n\\n min_priority_queue<pair<ll, int>> que;\\n que.push({0, S});\\n dst[S] = 0;\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n ll d = q.first;\\n int cu = q.second;\\n\\n if (vis[cu]) continue;\\n vis[cu] = 1;\\n\\n if (cu == G) {\\n printf(\\\"%lld\\\\n\\\", dst[cu]);\\n return;\\n }\\n\\n fore(p, E[cu]) {\\n int to = p.first;\\n a = A[p.second];\\n b = B[p.second];\\n\\n ll t;\\n if (d < line[q.second]) t = line[q.second];\\n else t = d;\\n\\n ll nd = f(t);\\n\\n if (nd < dst[to]) {\\n dst[to] = nd;\\n que.push({ nd, to });\\n }\\n }\\n }\\n printf(\\\"-1\\\\n\\\");\\n}\",\n \"accuracy\": 0.31746031746031744,\n \"time_ms\": 880,\n \"memory_kb\": 20248,\n \"score_of_the_acc\": -1.3703,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3044_3152781\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<typename Func>\\ndouble findMinReal(double L, double R, Func f) { //[L, R)\\n double left = L, right = R;\\n\\n for (int loop = 0; loop < 101; ++loop) {\\n if (f((left * 2 + right) / 3) <= f((left + right * 2) / 3)) {\\n right = (left + right * 2) / 3;\\n }\\n else {\\n left = (left * 2 + right) / 3;\\n }\\n }\\n return (right + left) * 0.5;\\n}\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\nint N, M, S, G, U[201010], V[201010]; ll A[201010], B[201010];\\nvector<pair<int,int>> E[201010];\\nll dst[201010]; int vis[201010];\\nll line[201010];\\n//---------------------------------------------------------------------------------------------------\\nll a, b;\\nll f(ll x) {\\n return x + (b + x + a - 1) / (x + a);\\n}\\ndouble fr(double x) {\\n return x + b / (x + a);\\n}\\n//---------------------------------------------------------------------------------------------------\\nll getline(int i) {\\n a = A[i]; b = B[i];\\n double t = findMinReal(0, infl, fr);\\n\\n ll res = t;\\n ll mi = res;\\n\\n rep(d, -1, 2) if (0 <= res + d and f(res + d) < f(mi)) mi = res + d;\\n return mi;\\n}\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> N >> M >> S >> G;\\n S--; G--;\\n rep(i, 0, M) {\\n cin >> U[i] >> V[i] >> A[i] >> B[i];\\n U[i]--; V[i]--;\\n\\n E[U[i]].push_back({ V[i], i });\\n E[V[i]].push_back({ U[i], i });\\n line[i] = getline(i);\\n }\\n\\n rep(i, 0, N) dst[i] = infl;\\n\\n min_priority_queue<pair<ll, int>> que;\\n que.push({0, S});\\n dst[S] = 0;\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n ll d = q.first;\\n int cu = q.second;\\n\\n if (vis[cu]) continue;\\n vis[cu] = 1;\\n\\n if (cu == G) {\\n printf(\\\"%lld\\\\n\\\", dst[cu]);\\n return;\\n }\\n\\n fore(p, E[cu]) {\\n int to = p.first;\\n a = A[p.second];\\n b = B[p.second];\\n\\n ll t;\\n if (d < line[q.second]) t = line[q.second];\\n else t = d;\\n\\n ll nd = f(t);\\n\\n if (nd < dst[to]) {\\n dst[to] = nd;\\n que.push({ nd, to });\\n }\\n }\\n }\\n printf(\\\"-1\\\\n\\\");\\n}\",\n \"accuracy\": 0.31746031746031744,\n \"time_ms\": 400,\n \"memory_kb\": 20180,\n \"score_of_the_acc\": -0.8158,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1889,"cells":{"group_id":{"kind":"string","value":"aoj_3047_cpp"},"problem_description":{"kind":"string","value":"Problem I: Shiritori\nProblem\nここに文字列のリストがある。息抜きに、しりとりをして遊ぶことにしよう。しりとりは、以下のルールで行われる。\nまず最初に、リストの中から好きな文字列を一つ選び、その文字列をリストから除外する。\n続いて、一つ前に選んだ文字列の最後の一文字が、最初の一文字である文字列をリストから一つ選ぶ。\n選んだ文字列をリストから除外する。\nこの後、2., 3.を交互に繰り返すことになる。\nさて、このしりとりを2.でリストから選べる文字列がなくなるまで続けたとしよう。\n このときに、最後に選んだ文字列の「最後の一文字」としてあり得る文字をすべて列挙したい。\nInput\n$N$\n$s_1$\n$s_2$\n$s_3$\n:\n$s_N$\n一行目に、文字列の数$N$が与えられる。\n続く$N$行に、文字列のリストが与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N \\lt 10^4$\n$1 \\le |s_i| \\lt 100$\n$s_i \\neq s_j (i \\neq j)$\n文字列には、英小文字のみ含まれる\nOutput\n最後に選んだ文字列の「最後の一文字」としてあり得る文字をaからzの順で辞書順で昇順に出力せよ。\nSample Input 1\n5\nyou\nate\nmy\nhum\ntoast\nSample Output 1\ne\nt\nu\nこの時、以下のような場合がアウトプット例となる。\nate(1つの文字列のみ)\ntoast\nhum - my - you\nまた、m,yで終わるパターンは存在しない。\nSample Input 2\n7\nshe\nsells\nsea\nshells\nby\nthe\nseashore\nSample Output 2\na\ne\ny"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3047_9258323","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct Dinic {\n struct edge {\n int to, rev; ll cap;\n edge(int t, int r, ll c) : to(t), rev(r), cap(c) {}\n };\n int n;\n vii<edge> to;\n vi<int> dist, iter;\n const ll inf = 1e18;\n Dinic(int n_) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, ll c) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, c });\n to[v].push_back({ u, su, 0 });\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n dist[s] = 0;\n queue<int> q;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (edge& nv : to[v]) {\n if (nv.cap == 0 || dist[nv.to] != -1) continue;\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n\n ll dfs(int v, int t, ll f) {\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (nv.cap == 0 || dist[nv.to] <= dist[v]) continue;\n ll nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n ll maxflow(int s, int t) {\n ll res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n iter.assign(n, 0);\n do {\n flow = dfs(s, t, inf);\n res += flow;\n\n } while (flow);\n };\n return res;\n }\n};\n\nint main()\n{\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n int n;\n cin >> n;\n\n vi<string> s(n);\n rep(i, n) cin >> s[i];\n\n //文字cを頂点とみなし、indeg: cで終わる、outdeg: cで始まる\n int mx = 26;\n vi<int> indeg(mx), outdeg(mx);\n rep(i, n) {\n indeg[s[i].back() - 'a']++;\n outdeg[s[i].front() - 'a']++;\n }\n\n vi<char> ans;\n rep(i, mx) {\n char c = 'a' + i;\n\n //cで終わるものがそもそもない\n if (indeg[i] == 0) continue;\n\n //cに戻ってくることはない\n if (outdeg[i] == 0) {\n ans.push_back('a' + i);\n continue;\n }\n\n //cで始まるのものがcで終わるものより多い\n if (indeg[i] < outdeg[i]) continue;\n\n Dinic dn(mx + 2);\n int S = mx, T = S + 1;\n \n rep(j, n) {\n char sf = s[j].front();\n char sb = s[j].back();\n int u = sf - 'a';\n int v = sb - 'a';\n if (sf == c) u = S;\n if (sb == c) v = T;\n dn.addedge(u, v, 1);\n }\n\n int flow = dn.maxflow(S, T);\n if (flow == outdeg[i]) ans.push_back(c);\n }\n\n for (char c : ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5136,"score_of_the_acc":-0.0723,"final_rank":4},{"submission_id":"aoj_3047_9258294","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct Dinic {\n struct edge {\n int to, rev; ll cap;\n edge(int t, int r, ll c) : to(t), rev(r), cap(c) {}\n };\n int n;\n vii<edge> to;\n vi<int> dist, iter;\n const ll inf = 1e18;\n Dinic(int n_) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, ll c) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, c });\n to[v].push_back({ u, su, 0 });\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n dist[s] = 0;\n queue<int> q;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (edge& nv : to[v]) {\n if (nv.cap == 0 || dist[nv.to] != -1) continue;\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n\n ll dfs(int v, int t, ll f) {\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (nv.cap == 0 || dist[nv.to] <= dist[v]) continue;\n ll nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n ll maxflow(int s, int t) {\n ll res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n iter.assign(n, 0);\n do {\n flow = dfs(s, t, inf);\n res += flow;\n\n } while (flow);\n };\n return res;\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n vi<string> s(n);\n rep(i, n) cin >> s[i];\n\n //文字cを頂点とみなし、indeg: cで終わる、outdeg: cで始まる\n int mx = 26;\n vi<int> indeg(mx), outdeg(mx);\n rep(i, n) {\n indeg[s[i].back() - 'a']++;\n outdeg[s[i].front() - 'a']++;\n }\n\n vi<char> ans;\n rep(i, mx) {\n char c = 'a' + i;\n\n //cで終わるものがそもそもない\n if (indeg[i] == 0) continue;\n\n //cに戻ってくることはない\n if (outdeg[i] == 0) {\n ans.push_back('a' + i);\n continue;\n }\n\n Dinic dn(mx + 2);\n int S = mx, T = S + 1;\n \n rep(j, n) {\n char sf = s[j].front();\n char sb = s[j].back();\n int u = sf - 'a';\n int v = sb - 'a';\n if (sf == c) u = S;\n if (sb == c) v = T;\n dn.addedge(u, v, 1);\n }\n\n int flow = dn.maxflow(S, T);\n if (flow >= outdeg[i]) ans.push_back(c);\n }\n\n for (char c : ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5476,"score_of_the_acc":-0.0958,"final_rank":8},{"submission_id":"aoj_3047_8411648","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> pr;\ntypedef pair<pr, ll> prpl;\ntypedef pair<ll, pr> prlp;\ntypedef tuple<ll, ll, ll> tri;\ntypedef tuple<ll, ll, ll, ll, ll> cinq;\n\n\nconst ll INF = (ll)1e18;\n\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++) // for文の省略\n#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)\n#define all(v) v.begin(), v.end() // 配列範囲の指定の省略。reverse()やsort()に入れる時便利\n#define pb push_back\n\n// 変数を宣言して入力を代入する所の省略\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\n#define llin(...) ll __VA_ARGS__; input(__VA_ARGS__)\nvoid input_vector(vector<ll>& v, ll N){\n rep(i, N){\n cin >> v[i];\n }\n}\n#define vectin(v, N) vector<ll> v(N); input_vector(v, N)\ntemplate<class U>\nvoid input_graph(vector<vector<U>>& G, ll M, bool directed = false, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n if(!directed){\n G[A].push_back(B);\n G[B].push_back(A);\n } else {\n G[A].push_back(B);\n }\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n if(!directed){\n G[A].push_back({B, cost});\n G[B].push_back({A, cost});\n } else {\n G[A].push_back({B, cost});\n }\n }\n }\n}\n#define graphin(G, N, M) vector<vector<ll>> G(N); input_graph(G, M)\n#define graphin_directed(G, N, M) vector<vector<ll>> G(N); input_graph(G, M, directed = true)\n#define graphin_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, weighted = true)\n#define graphin_directed_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, directed = true, weighted = true)\ntemplate<class U>\nvoid input_edge(vector<U> E, ll M, bool weighted = false){\n rep(i, M){\n if(!weighted){\n ll A, B; cin >> A >> B;\n E[i] = {A, B};\n } else {\n ll A, B, cost; cin >> A >> B >> cost;\n E[i] = {cost, {A, B}};\n }\n }\n if(weighted){\n sort(all(E));\n }\n}\n#define edgein(E, M) vector<pr> E(M); input_edge(E, M)\n#define edgein_weighted(E, M) vector<prlp> E(M); input_edge(E, M, weighted = true)\n\n\n// デバッグ処理の簡略化。「#define _DEBUG」行をコメントアウトするかどうかで処理を行うかどうか変えられる\nvoid debug_out() { cout << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cout << H << \" \";\n debug_out(T...);\n}\n#define _DEBUG\n#ifdef _DEBUG\n#define debug(...) debug_out(__VA_ARGS__)\n#else\n#define debug(...) \n#endif\n\n#ifndef H_make_vector\n#define H_make_vector\n\n/**\n * @brief 多次元 vector の作成\n * @author えびちゃん\n */\n\n#include <cstddef>\n#include <type_traits>\n#include <vector>\n\nnamespace detail {\n template <typename Tp, ll Nb>\n auto make_vector(std::vector<ll>& sizes, Tp const& x) {\n if constexpr (Nb == 1) {\n return vector(sizes[0], x);\n } else {\n ll size = sizes[Nb-1];\n sizes.pop_back();\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\n }\n }\n} // detail::\n\ntemplate <typename Tp, ll Nb>\nauto make_vector(ll const(&sizes)[Nb], Tp const& x = Tp()) {\n vector<ll> s(Nb);\n for (ll i = 0; i < Nb; ++i) s[i] = sizes[Nb-i-1];\n return detail::make_vector<Tp, Nb>(s, x);\n}\n\n#endif /* !defined(H_make_vector) */\n\ntemplate <typename S, typename T>\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first + q.first, p.second + q.second);\n}\n \ntemplate <typename S, typename T>\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first - q.first, p.second - q.second);\n}\n\nll Max_V = 603;\n\n\ntemplate<typename T> class Node {\npublic:\n pair<T, ll> val, al;\n T lazy;\n Node *left, *right, *par;\n Node() : val((T)0, -1), al((T)0, -1), lazy(0),\n left(nullptr), right(nullptr), par(nullptr){}\n void reset(){\n left = right = par = nullptr;\n }\n bool isRoot() const {\n return (!par) || (par->left != this && par->right != this);\n }\n void push(){\n if(lazy){\n val.first += lazy, al.first += lazy;\n if(left) left->lazy += lazy;\n if(right) right->lazy += lazy;\n lazy = 0;\n }\n }\n void eval(){\n al = val;\n if(left){\n left->push();\n if((left->al).first < al.first) al = left->al;\n }\n if(right){\n right->push();\n if((right->al).first <= al.first) al = right->al;\n }\n }\n void rotate(bool right){\n Node *p = this->par, *g = p->par;\n if(right){\n if((p->left = this->right)) this->right->par = p;\n this->right = p, p->par = this;\n }else{\n if((p->right = this->left)) this->left->par = p;\n this->left = p, p->par = this;\n }\n p->eval(), this->eval(), this->par = g;\n if(!g) return;\n if(g->left == p) g->left = this;\n if(g->right == p) g->right = this;\n g->eval();\n }\n void splay(){\n while(!(this->isRoot())){\n Node *p = this->par, *gp = p->par;\n if(p->isRoot()){\n p->push(), this->push();\n this->rotate((this == p->left));\n }else{\n gp->push(), p->push(), this->push();\n bool flag = (this == p->left);\n if((this == p->left) == (p == gp->left)){\n p->rotate(flag), this->rotate(flag);\n }else{\n this->rotate(flag), this->rotate(!flag);\n }\n }\n }\n this->push();\n }\n};\n\ntemplate<typename T> class Dinic {\npublic:\n struct edge {\n const ll to, rev;\n T rev_cap;\n edge(const ll _to, const ll _rev, const T _rev_cap) :\n to(_to), rev(_rev), rev_cap(_rev_cap){}\n };\nprivate:\n const ll V;\n vector<ll> que, level, iter, used;\n\tvector<Node<T> > arr;\n void access(Node<T> *u){\n Node<T> *last = nullptr;\n for(Node<T>* v = u; v; v = v->par){\n if((v->val).second == -1){\n last->par = nullptr;\n break;\n }\n v->splay(), v->right = last, v->eval(), last = v;\n }\n u->splay();\n }\n void link(Node<T> *u, Node<T> *v){\n access(u), u->right = v, u->eval(), v->par = u;\n }\n void set(Node<T> *u, const T x, const ll id){\n u->val = {x, id}, u->eval();\n }\n ll prev(Node<T> *u){\n (u = u->right)->push();\n while(u->left){\n (u = u->left)->push();\n }\n u->splay();\n return (u->val).second;\n }\n ll top(Node<T> *u){\n while(u->left){\n (u = u->left)->push();\n }\n u->splay();\n return (u->val).second;\n }\n void range(Node<T> *u, const T x){\n u->lazy += x, u->push();\n }\n void cut_and_reflect(const ll ver){\n Node<T> *u = &arr[ver];\n u->splay();\n if(u->left) u->left->par = nullptr, u->left = nullptr, u->eval();\n edge& e = G[ver][iter[ver]++];\n G[e.to][e.rev].rev_cap += e.rev_cap - (u->val).first, e.rev_cap = (u->val).first;\n }\n void bfs(const ll s, const ll t){\n level[s] = 0, used[s] = 1;\n\t\tll qh = 0, qt = 0;\n for(que[qt++] = s; qh < qt;){\n ll v = que[qh++];\n for(edge& e : G[v]){\n if(level[e.to] < 0 && G[e.to][e.rev].rev_cap > 0){\n\t\t\t\t\tlevel[e.to] = level[v] + 1, used[e.to] = 1, que[qt++] = e.to;\n }\n }\n }\n }\n\tT block_flow_naive(const ll s, ll cur, T f){\n\t\tif(s == cur) return f;\n\t\tT flow = 0;\n\t\tfor(ll& i = iter[cur]; i < (ll)G[cur].size(); ++i){\n\t\t\tedge& e = G[cur][i];\n\t\t\tif(e.rev_cap > 0 && level[e.to] < level[cur]){\n\t\t\t\tT d = block_flow_naive(s, e.to, min(f, e.rev_cap));\n\t\t\t\tif(d > 0){\n\t\t\t\t\te.rev_cap -= d, G[e.to][e.rev].rev_cap += d;\n\t\t\t\t\tf -= d, flow += d;\n\t\t\t\t\tif(f == 0) break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn flow;\n\t}\n T block_flow(const ll s, const ll t){\n T flow = 0;\n bool find = false;\n ll cur = t;\n while(true){\n if(find){\n const pair<T, ll>& res = arr[cur].al;\n flow += res.first;\n range(&arr[cur], -res.first);\n cut_and_reflect(cur = res.second);\n find = false;\n }\n used[cur] = 2;\n bool update = false;\n for(ll& i = iter[cur]; i < (ll)G[cur].size(); ++i){\n edge& e = G[cur][i];\n if(e.rev_cap > 0 && level[e.to] < level[cur] && used[e.to] >= 1){\n update = true;\n set(&arr[cur], e.rev_cap, cur);\n if(e.to == s){\n find = true;\n }else if(used[e.to] == 1){\n\t\t\t\t\t\tarr[e.to].right = &arr[cur];\n\t\t\t\t\t\tarr[cur].par = &arr[e.to], cur = e.to;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tlink(&arr[e.to], &arr[cur]);\n\t\t\t\t\t\tconst pair<T, ll>& res = arr[e.to].al;\n\t\t\t\t\t\tif(res.first == 0){\n\t\t\t\t\t\t\tcut_and_reflect(cur = res.second);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(level[cur = top(&arr[e.to])] == 1) find = true;\n\t\t\t\t\t\t\telse cut_and_reflect(cur);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n }\n }\n if(update) continue;\n used[cur] = -1, (arr[cur].val).second = -1;\n if(cur == t) break;\n cut_and_reflect(cur = prev(&arr[cur]));\n }\n return flow;\n }\n void update_dfs(Node<T>* u, vector<vector<edge>>& G, const vector<ll>& iter, vector<ll>& used){\n u->push();\n if(u->left) update_dfs(u->left, G, iter, used);\n if(u->right) update_dfs(u->right, G, iter, used);\n const ll id = (u->val).second;\n if(iter[id] < (ll)G[id].size()){\n auto& e = G[id][iter[id]];\n G[e.to][e.rev].rev_cap += e.rev_cap - (u->val).first;\n e.rev_cap = (u->val).first;\n }\n\t\tused[id] = 0, u->reset();\n }\n void update_and_clear(vector<vector<edge>>& G, const vector<ll>& iter, vector<ll>& used){\n for(ll i = 0; i < V; ++i){\n if(used[i] == 2 && arr[i].isRoot()) update_dfs(&arr[i], G, iter, used);\n\t\t\telse if(used[i] == -1) arr[i].reset();\n }\n }\n\npublic:\n vector<vector<edge>> G;\n Dinic(const ll node_size)\n : V(node_size), que(V), level(V), iter(V), used(V), arr(V), G(V){}\n void add_edge(const ll from, const ll to, const T cap){\n G[from].emplace_back(to, (ll)G[to].size(), (T)0);\n G[to].emplace_back(from, (ll)G[from].size() - 1, cap);\n }\n T solve(const ll s, const ll t){\n T flow = 0;\n while(true){\n fill(level.begin(), level.end(), -1);\n fill(used.begin(), used.end(), 0);\n bfs(s, t);\n if(level[t] < 0) break;\n fill(iter.begin(), iter.end(), 0);\n\t\t\tflow += block_flow(s, t);\n\t\t\tupdate_and_clear(G, iter, used);\n }\n return flow;\n }\n};\n\n\n\n\nconst ll alpha = 26;\n\nint main(void){\n llin(N);\n Dinic<ll> Dn(2 * alpha);\n vector<ll> delta_minus(alpha, 0), delta_plus(alpha, 0);\n rep(i, N){\n string S; cin >> S;\n char s_c = S[0], t_c = S[S.size() - 1];\n ll a = s_c - 'a', b = t_c - 'a';\n Dn.add_edge(a + alpha, b, 1);\n delta_plus[a]++; delta_minus[b]++;\n }\n rep(i, alpha){\n Dn.add_edge(i, i + alpha, INF);\n }\n rep(i, alpha){\n if(delta_minus[i] != 0 && Dn.solve(i + alpha, i) == delta_plus[i]){\n cout << (char)('a' + i) << endl;\n }\n }\n \n}","accuracy":1,"time_ms":10,"memory_kb":3984,"score_of_the_acc":-0.0285,"final_rank":2},{"submission_id":"aoj_3047_8062667","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\nusing namespace std;\n// using namespace atcoder;\n// #include \"atcoder/modint.hpp\"\n// using mint = atcoder::modint998244353;\n#define int long long\n#define intu __int128_t\n#define rep(i,n) for(int i=0;i<n;++i)\n#define rep1(i,n) for(int i=1;i<=n;++i)\n#define reps(i,a,b,c) for(int i=a;i<b;i+=c)\n#define repnega(i,a,b) for(int i=b;i>a;i--)\n#define mod2 1000000007\n#define mod 998244353\n#define endl '\\n'\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\n#define pb push_back\n#define eb emplace_back\n#define ep emplace\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n\nint n;\nstring s[10009];\nint sh[10009][2];\nvector<int> g[10009];\nvector<int> revg[10009];\nvector<int> ans(29,0);\nvoid dfs(int p,int c){\n\tsh[p][c]=1;\n\tint cnt=0;\n\tfor(int e:g[p]){\n\t\tif(!sh[e][c]){dfs(e,c);cnt++;}\n\t}\n\tif(cnt==0&&sh[p][1]==0){\n\t\tc=1;\n\t\tsh[p][1]=1;\n\t\tif(c==1){\n\t\t\tans[s[p][(int)s[p].size()-1]-'a']=1;\n\t\t\t// cout<<s[p]<<endl;\n\t\t}\n\t\tfor(int e:g[p]){\n\t\t\tif(!sh[e][c]){dfs(e,c);cnt++;}\n\t\t}\n\t}\n}\nsigned main(){\n\tcin>>n;\n\trep(i,n)cin>>s[i];\n\trep(i,n)rep(j,n){\n\t\tif(i==j)continue;\n\t\tif(s[i][(int)s[i].size()-1]==s[j][0]){\n\t\t\tg[i].pb(j);\n\t\t\trevg[j].pb(i);\n\t\t}\n\t}\n\trep(i,n){\n\t\tif(revg[i].size()==0&&(sh[i][0]==0&&sh[i][1]==0)){\n\t\t\tdfs(i,0);\n\t\t}\n\t}\n\trep(i,n){\n\t\tif((int)g[i].size()&&sh[i][0]==0&&sh[i][1]==0){\n\t\t\tdfs(i,0);\n\t\t}\n\t}\n\trep(i,26){\n\t\tif(ans[i]){\n\t\t\tcout<<(char)('a'+i)<<endl;\n\t\t}\n\t}\n}","accuracy":0.1794871794871795,"time_ms":10,"memory_kb":9236,"score_of_the_acc":-0.2278,"final_rank":20},{"submission_id":"aoj_3047_8062665","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\nusing namespace std;\n// using namespace atcoder;\n// #include \"atcoder/modint.hpp\"\n// using mint = atcoder::modint998244353;\n#define int long long\n#define intu __int128_t\n#define rep(i,n) for(int i=0;i<n;++i)\n#define rep1(i,n) for(int i=1;i<=n;++i)\n#define reps(i,a,b,c) for(int i=a;i<b;i+=c)\n#define repnega(i,a,b) for(int i=b;i>a;i--)\n#define mod2 1000000007\n#define mod 998244353\n#define endl '\\n'\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\n#define pb push_back\n#define eb emplace_back\n#define ep emplace\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n\nint n;\nstring s[10009];\nint sh[10009][2];\nvector<int> g[10009];\nvector<int> revg[10009];\nvector<int> ans(29,0);\nvoid dfs(int p,int c){\n\tsh[p][c]=1;\n\tint cnt=0;\n\tfor(int e:g[p]){\n\t\tif(!sh[e][c]){dfs(e,c);cnt++;}\n\t}\n\tif(cnt==0&&sh[p][1]==0){\n\t\tc=1;\n\t\tsh[p][1]=1;\n\t\tif(c==1){\n\t\t\tans[s[p][(int)s[p].size()-1]-'a']=1;\n\t\t\t// cout<<s[p]<<endl;\n\t\t}\n\t\tfor(int e:g[p]){\n\t\t\tif(!sh[e][c]){dfs(e,c);cnt++;}\n\t\t}\n\t}\n}\nsigned main(){\n\tcin>>n;\n\trep(i,n)cin>>s[i];\n\trep(i,n)rep(j,n){\n\t\tif(i==j)continue;\n\t\tif(s[i][(int)s[i].size()-1]==s[j][0]){\n\t\t\tg[i].pb(j);\n\t\t\trevg[j].pb(i);\n\t\t}\n\t}\n\trep(i,n){\n\t\tif(revg[i].size()==0&&(sh[i][0]==0&&sh[i][1]==0)){\n\t\t\tdfs(i,0);\n\t\t}\n\t}\n\trep(i,n){\n\t\tif(sh[i][0]==0&&sh[i][1]==0){\n\t\t\tdfs(i,0);\n\t\t}\n\t}\n\trep(i,26){\n\t\tif(ans[i]){\n\t\t\tcout<<(char)('a'+i)<<endl;\n\t\t}\n\t}\n}","accuracy":0.1794871794871795,"time_ms":10,"memory_kb":9212,"score_of_the_acc":-0.2269,"final_rank":19},{"submission_id":"aoj_3047_7428637","code_snippet":"#pragma region Macros\n\n#include <bits/extc++.h>\nusing namespace std;\nusing namespace __gnu_pbds;\n// using namespace __gnu_cxx;\n\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n\n#define TO_STRING(var) # var\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acos(-1);\nconst ld EPS = 1e-10;\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\n// __attribute__((constructor))\n// void constructor() {\n// ios::sync_with_stdio(false);\n// cin.tie(nullptr);\n// // ifstream in(\"input.txt\");\n// // cin.rdbuf(in.rdbuf());\n// cout << fixed << setprecision(15);\n// }\n\ntemplate<int mod> class modint{\npublic:\n int val = 0;\n modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n modint(const modint &r) { val = r.val; }\n\n modint operator -() { return modint(-val); }\n modint operator +(const modint &r) { return modint(*this) += r; }\n modint operator -(const modint &r) { return modint(*this) -= r; }\n modint operator *(const modint &r) { return modint(*this) *= r; }\n modint operator /(const modint &r) { return modint(*this) /= r; }\n\n modint &operator +=(const modint &r) {\n val += r.val;\n if (val >= mod) val -= mod;\n return *this;\n }\n modint &operator -=(const modint &r) {\n if (val < r.val) val += mod;\n val -= r.val;\n return *this;\n }\n modint &operator *=(const modint &r) {\n val = val * r.val % mod;\n return *this;\n }\n modint &operator /=(const modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {\n int t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % mod;\n if (val < 0) val += mod;\n return *this;\n }\n\n bool operator ==(const modint& r) { return this -> val == r.val; }\n bool operator <(const modint& r) { return this -> val < r.val; }\n bool operator !=(const modint& r) { return this -> val != r.val; }\n};\n\nusing mint = modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t;\n x = t;\n return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\n\nmint modpow(const mint &a, int n) {\n if (n == 0) return 1;\n mint t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n}\n\nint modpow(int x, int n, int mod) {\n int ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\n\n#pragma endregion\n\nstruct Edge {\n char from, to;\n int cap, rev;\n Edge(char to, int cap, int rev) : from(-1), to(to), cap(cap), rev(rev) {}\n Edge(char from, char to, int cap, int rev) : from(from), to(to), cap(cap), rev(rev) {}\n Edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n // operator int() const { return to; }\n};\n\nvector<int> flag;\nint dfs(int v, int t, int f, vector<vector<Edge>> &G) { // tは一貫\n if (v == t) return f; // 残余グラフ上にs-tパスが存在するなら\n flag[v] = true;\n\n for (auto &e : G[v]) {\n if (flag[e.to] or e.cap == 0) continue;\n // eが訪問済み、もしくは残余グラフの辺eが無効ならとばす\n\n int d = dfs(e.to, t, min(f, e.cap), G); // fはtに到達するまでずっと0\n if (d > 0) {\n e.cap -= d; // 残余グラフの容量を減らし\n G[e.to][e.rev].cap += d; // 元のグラフで同じ量の水を長す\n return d;\n }\n }\n return 0; // s-tパスが見つからなかったらこれが返る\n}\n\nint max_flow(int s, int t, vector<vector<Edge>> &G) {\n int ret = 0;\n\n while (true) {\n flag.assign((int)G.size(), false);\n int f = dfs(s, t, INFL, G);\n if (f == 0) return ret; // 残余グラフでs-tパスが存在しなくなったら終了\n ret += f;\n }\n // そもそも元のグラフにs-tパスが存在しない場合は0が返る\n}\n\nsigned main() {\n int N;\n cin >> N;\n vector<string> S(N);\n for (int i = 0; i < N; i++) cin >> S[i];\n\n vector<vector<Edge>> G(270);\n for (int i = 0; i < N; i++) {\n G[S[i][0]].pb(S[i].back(), 1, G[S[i].back()].size());\n G[S[i].back()].pb(S[i][0], 0, G[S[i][0]].size() - 1); // 逆辺\n }\n\n vector<vector<Edge>> G2 = G;\n\n for (char c = 'a'; c <= 'z'; c++) {\n G = G2;\n char t = 'z' + 1;\n int indeg = 0;\n int outdeg = 0;\n for (int i = 0; i < N; i++) {\n if (S[i].back() == c) {\n G[S[i][0]].pb(t, 1, G[t].size());\n G[t].pb(S[i][0], 0, G[S[i][0]].size() - 1); // 逆辺\n indeg++;\n }\n if (S[i][0] == c) outdeg++;\n }\n if (indeg == outdeg && indeg == 0) continue;\n // cout << c << \" \" << outdeg << \" \" << max_flow(c, t, G) << endl;\n\n if (max_flow(c, t, G) == outdeg) cout << c << endl;\n }\n}","accuracy":1,"time_ms":190,"memory_kb":6020,"score_of_the_acc":-0.2973,"final_rank":12},{"submission_id":"aoj_3047_7428363","code_snippet":"#pragma region Macros\n\n#include <bits/extc++.h>\nusing namespace std;\nusing namespace __gnu_pbds;\n// using namespace __gnu_cxx;\n\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n\n#define TO_STRING(var) # var\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acos(-1);\nconst ld EPS = 1e-10;\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\n// __attribute__((constructor))\n// void constructor() {\n// ios::sync_with_stdio(false);\n// cin.tie(nullptr);\n// // ifstream in(\"input.txt\");\n// // cin.rdbuf(in.rdbuf());\n// cout << fixed << setprecision(15);\n// }\n\ntemplate<int mod> class modint{\npublic:\n int val = 0;\n modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n modint(const modint &r) { val = r.val; }\n\n modint operator -() { return modint(-val); }\n modint operator +(const modint &r) { return modint(*this) += r; }\n modint operator -(const modint &r) { return modint(*this) -= r; }\n modint operator *(const modint &r) { return modint(*this) *= r; }\n modint operator /(const modint &r) { return modint(*this) /= r; }\n\n modint &operator +=(const modint &r) {\n val += r.val;\n if (val >= mod) val -= mod;\n return *this;\n }\n modint &operator -=(const modint &r) {\n if (val < r.val) val += mod;\n val -= r.val;\n return *this;\n }\n modint &operator *=(const modint &r) {\n val = val * r.val % mod;\n return *this;\n }\n modint &operator /=(const modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {\n int t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n val = val * u % mod;\n if (val < 0) val += mod;\n return *this;\n }\n\n bool operator ==(const modint& r) { return this -> val == r.val; }\n bool operator <(const modint& r) { return this -> val < r.val; }\n bool operator !=(const modint& r) { return this -> val != r.val; }\n};\n\nusing mint = modint<MOD>;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t;\n x = t;\n return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\n\nmint modpow(const mint &a, int n) {\n if (n == 0) return 1;\n mint t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n}\n\nint modpow(int x, int n, int mod) {\n int ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\n\n#pragma endregion\n\nsigned main() {\n int N;\n cin >> N;\n vector<string> S(N);\n for (int i = 0; i < N; i++) cin >> S[i];\n\n map<string, string> G;\n map<string, int> outdeg;\n map<string, int> indeg;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j) continue;\n if (S[i].back() == S[j][0]) {\n G[S[i]] = S[j];\n outdeg[S[i]]++;\n indeg[S[j]]++;\n }\n }\n }\n\n set<char> ans;\n for (int i = 0; i < N; i++) {\n if (outdeg[S[i]] == 0) ans.insert(S[i].back());\n }\n for (auto &x : ans) {\n cout << x << endl;\n }\n \n}","accuracy":0.1794871794871795,"time_ms":40,"memory_kb":4980,"score_of_the_acc":-0.0982,"final_rank":18},{"submission_id":"aoj_3047_6145604","code_snippet":"#line 1 \"library/me/template.cpp\"\n// This is a dummy line\n#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\n#define ALL(a) (a).begin(),(a).end()\n#define END(...) { print(__VA_ARGS__); return; }\n\n#ifdef ONLINE_JUDGE\n#define DBG(...) ;\n#else\n#define DBG(a) { cerr << #a << \": \"; dbg(a); }\n#endif\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VVVI = vector<VVI>;\nusing ll = long long;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VVVL = vector<VVL>;\nusing VD = vector<double>;\nusing VVD = vector<VD>;\nusing VVVD = vector<VVD>;\nusing VS = vector<string>;\nusing VVS = vector<VS>;\nusing VVVS = vector<VVS>;\nusing VC = vector<char>;\nusing VVC = vector<VC>;\nusing VVVC = vector<VVC>;\nusing P = pair<int, int>;\nusing VP = vector<P>;\nusing VVP = vector<VP>;\nusing VVVP = vector<VVP>;\nusing LP = pair<ll, ll>;\nusing VLP = vector<LP>;\nusing VVLP = vector<VLP>;\nusing VVVLP = vector<VVLP>;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int DX[] = {1, 0, -1, 0};\nconstexpr int DY[] = {0, 1, 0, -1};\n\n#ifdef aclmodint\n\nusing MI7 = modint1000000007;\nusing V7 = vector<MI7>;\nusing VV7 = vector<V7>;\nusing VVV7 = vector<VV7>;\nusing MI3 = modint998244353;\nusing V3 = vector<MI3>;\nusing VV3 = vector<V3>;\nusing VVV3 = vector<VV3>;\n\nostream &operator<<(ostream &os, const modint &x) {\n os << x.val();\n return os;\n}\n\nostream &operator<<(ostream &os, const MI3 &x) {\n os << x.val();\n return os;\n}\n\nostream &operator<<(ostream &os, const MI7 &x) {\n os << x.val();\n return os;\n}\n\nistream &operator>>(istream &is, modint &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\nistream &operator>>(istream &is, MI3 &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\nistream &operator>>(istream &is, MI7 &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\n#endif\n\nvoid print() { cout << '\\n'; }\ntemplate<typename T>\nvoid print(const T &t) { cout << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid print(const Head &head, const Tail &... tail) {\n cout << head << ' ';\n print(tail...);\n}\n\n#ifdef ONLINE_JUDGE\ntemplate<typename... Args>\nvoid dbg(const Args &... args) {}\n#else\nvoid dbg() { cerr << '\\n'; }\ntemplate<typename T>\nvoid dbg(const T &t) { cerr << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid dbg(const Head &head, const Tail &... tail) {\n cerr << head << ' ';\n dbg(tail...);\n}\n#endif\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 >& p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != (int) v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate <typename T>\npair<VI, vector<T>> compress(const vector<T> &a) {\n int n = a.size();\n vector<T> x;\n REP(i, n) x.push_back(a[i]);\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\n VI res(n);\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\n return make_pair(res, x);\n}\n\n#ifdef aclsegtree\ntemplate<typename S>\nstruct value_size { S value; int size; };\n\ntemplate<typename S>\nS min_op(S l, S r) { return min(l, r); };\ntemplate<typename S>\nS max_op(S l, S r) { return max(l, r); };\ntemplate<typename S>\nS sum_op(S l, S r) { return l + r; };\ntemplate<typename S>\nvalue_size<S> sum_op_size(value_size<S> l, value_size<S> r) {\n return {l.value + r.value, l.size + r.size};\n};\ntemplate<typename S>\nvalue_size<S> min_op_size(value_size<S> l, value_size<S> r) {\n return {min(l.value, r.value), l.size + r.size};\n};\ntemplate<typename S>\nvalue_size<S> max_op_size(value_size<S> l, value_size<S> r) {\n return {max(l.value, r.value), l.size + r.size};\n};\n\ntemplate<typename S>\nS min_e() { return numeric_limits<S>::max(); };\ntemplate<typename S>\nS max_e() { return numeric_limits<S>::min(); };\ntemplate<typename S>\nS sum_e() { return 0; }\ntemplate<typename S>\nvalue_size<S> sum_e_size() { return {0, 0}; }\ntemplate<typename S>\nvalue_size<S> min_e_size() { return {numeric_limits<S>::max(), 0}; }\ntemplate<typename S>\nvalue_size<S> max_e_size() { return {numeric_limits<S>::min(), 0}; }\n\ntemplate<typename S, typename F>\nS chmin_mapping(F f, S x) { return min(x, f); }\ntemplate<typename S, typename F>\nS chmax_mapping(F f, S x) { return max(x, f); }\ntemplate<typename S, typename F>\nS add_mapping(F f, S x) { return x + f; }\ntemplate<typename S, typename F>\nvalue_size<S> add_mapping_size(F f, value_size<S> x) {\n return {x.value + x.size * f, x.size};\n}\n\ntemplate<typename F>\nF chmin_composition(F f, F g) { return min(f, g); }\ntemplate<typename F>\nF chmax_composition(F f, F g) { return max(f, g); }\ntemplate<typename F>\nF add_composition(F f, F g) { return f + g; }\n\ntemplate<typename F>\nF chmin_id() { return numeric_limits<F>::max(); }\ntemplate<typename F>\nF chmax_id() { return numeric_limits<F>::min(); }\ntemplate<typename F>\nF add_id() { return 0; }\n\ntemplate<typename S>\nusing RSumQ = segtree<S, sum_op<S>, sum_e<S>>;\ntemplate<typename S>\nusing RMaxQ = segtree<S, max_op<S>, max_e<S>>;\ntemplate<typename S>\nusing RMinQ = segtree<S, min_op<S>, min_e<S>>;\n\ntemplate<typename S, typename F>\nusing RAddSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\n F, add_mapping_size<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RAddMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RAddMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RMinMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n F, chmin_mapping<S, F>, chmin_composition<F>, chmin_id<F>>;\ntemplate<typename S, typename F>\nusing RMaxMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n F, chmax_mapping<S, F>, chmax_composition<F>, chmax_id<F>>;\n#endif\n#line 2 \"Contests/Dummy/a/main.cpp\"\n/* #define aclmodint */\n/* #define aclsegtree */\n/* #include <atcoder/all> */\n/* using namespace atcoder; */\n#line 1 \"library/atcoder/atcoder/maxflow.hpp\"\n\n\n\n#line 9 \"library/atcoder/atcoder/maxflow.hpp\"\n\n#line 1 \"library/atcoder/atcoder/internal_queue.hpp\"\n\n\n\n#line 5 \"library/atcoder/atcoder/internal_queue.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 11 \"library/atcoder/atcoder/maxflow.hpp\"\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\n\n#line 7 \"Contests/Dummy/a/main.cpp\"\nusing namespace atcoder;\n\nvoid solve(){\n int n; cin >> n;\n VS s(n); cin >> s;\n VI leave(26);\n VI sink(26);\n REP(i, n) {\n leave[s[i][0] - 'a']++;\n sink[s[i].back() - 'a']++;\n }\n REP(i, 26) {\n mf_graph<int> mfg(28);\n REP(j, n) {\n int from = s[j][0] - 'a';\n int to = s[j].back() - 'a';\n if(from == i) from = 26;\n if(to == i) to = 27;\n mfg.add_edge(from, to, 1);\n }\n if(sink[i] > 0 && mfg.flow(26, 27) == leave[i]) print((char)('a' + i));\n }\n}\n\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\nint main() {\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 1;\n //cin >> t; // comment out if solving multi testcase\n for(int testCase = 1;testCase <= t;++testCase){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5096,"score_of_the_acc":-0.0814,"final_rank":5},{"submission_id":"aoj_3047_5263465","code_snippet":"//////////////////////////////\n// Check before you submit.\n// #define _ATCODER_LIBRARY\n\nconst long long MOD = 1e9+7;\n// const long long MOD = 998244353;\n\n/////////////////////////////\n#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _ATCODER_LIBRARY\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n// _ATCODER_LIBRARY\n\nconst long long INF = 1LL << 60;\nconst double PI = acos(-1);\nusing ll = long long;\nusing P = array<ll, 2>;\n\n#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define SUM(v) accumulate(ALL(v),0ll)\n\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){REP(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;REP(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\"\\n\";REP(i,vv.size())s+=join(vv[i])+\"\\n\";return s;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}\ntemplate<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v){return o<<\"(\"<<v.first<<\",\"<<v.second<<\")\";}\ntemplate<typename T>istream& operator>>(istream&i,array<T,2>&v){i>>v[0]>>v[1]; return i;}\ntemplate<typename T>ostream& operator<<(ostream&o,array<T,2>&v){return o<<\"(\"<<v[0]<<\",\"<<v[1]<<\")\"; return o;}\n\n#define DEBUG(x);\n\n#ifdef _DEBUG\n#define DEBUG(x) std::cerr << #x << \" : \" << (x) << std::endl;\n#define GLIBCXX_DEBUG\n#define GLIBCXX_DEBUG_PEDANTIC\n#endif\n// _DEBUG\n\nint dx[4]{0, 1, 0, -1};\nint dy[4]{1, 0, -1, 0};\n\nvoid init_init_init() {ios_base::sync_with_stdio(false);cin.tie(NULL);std::cout<<fixed<<setprecision(10);}\ntemplate<class T>T up(T a, T b){assert(b);return (a+b-1)/b;}\ntemplate<typename... A>bool eq(A const&... a){auto t={a...};assert(t.size());auto tar=*t.begin();for(const auto&e:t)if(tar!=e)return false;return true;}\n\ntemplate<class T>bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T>bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmax(T &a, initializer_list<T>l){return chmax(a,max(l));}\ntemplate<class T>bool chmin(T &a, initializer_list<T>l){return chmin(a,min(l));}\n\n//////////////////////////////////////////////////////////////////\n// My Library\n//////////////////////////////////////////////////////////////////\n\ntemplate<typename T> class Dinic {\nprivate:\n\tint V;\n\tvector<int> level,iter;\n\tvoid bfs(int s) {\n\t\tfill(level.begin(),level.end(),-1);\n\t\tqueue<int> que;\n\t\tlevel[s] = 0;\n\t\tque.push(s);\n\t\twhile(!que.empty()){\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto& e : G[v]){\n\t\t\t\tif(e.cap > 0 && level[e.to] < 0){\n\t\t\t\t\tlevel[e.to] = level[v] + 1;\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tT dfs(int v,int t,T f) {\n\t\tif(v==t){\n\t\t\treturn f;\n\t\t}\n\t\tfor(int& i = iter[v]; i < (int)G[v].size(); i++){\n\t\t\tedge& e = G[v][i];\n\t\t\tif(e.cap > 0 && level[v] < level[e.to]){\n\t\t\t\tT d = dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(d > 0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n \npublic:\n\tstruct edge{\n\t\tint to;\n\t\tT cap;\n\t\tint rev;\n\t};\n\tvector<vector<edge> > G;\n \n\tDinic(int node_size) : V(node_size), level(V), iter(V), G(V){}\n\t// Adding edge on a node.\n\tvoid add_edge(int from,int to,T cap) {\n\t\tG[from].push_back((edge){to,cap,(int)G[to].size()});\n\t\tG[to].push_back((edge){from,(T)0,(int)G[from].size()-1});\n\t}\n\t// Calculate the maximum flow.\n\tT solve(int s,int t) {\n\t\tT flow = 0;\n\t\tfor(;;){\n\t\t\tbfs(s);\n\t\t\tif(level[t] < 0) return flow;\n\t\t\tfill(iter.begin(),iter.end(),0);\n\t\t\tT f;\n\t\t\twhile((f=dfs(s,t,numeric_limits<T>::max())) > 0){\n\t\t\t\tflow += f;\n\t\t\t}\n\t\t}\n\t}\n};\n\n\n//////////////////////////////////////////////////////////////////\n// Contest Code\n//////////////////////////////////////////////////////////////////\n\n\n\nint main(int argc, char **argv)\n{\n\tinit_init_init();\n\n\tll N; cin >> N;\n\tvector<string> S(N);\n\tREP(i, N) cin >> S[i];\n\tmap<char, ll> is_last;\n\tfor (auto e : S)\n\t\t\tis_last[e.back()] = true;\n\tfor (char c = 'a'; c <= 'z'; ++c)\n\t{\n\t\t\tconst ll start = 26;\n\t\t\tconst ll goal = 27;\n\t\t\tDinic<ll> max_flow(28);\n\t\t\tll cnt{0};\n\t\t\tll cnt2{0};\n\t\t\tREP(i, N)\n\t\t\t{\n\t\t\t\t\tstring s = S[i];\n\t\t\t\t\tll v1, v2;\n\t\t\t\t\tif (s.front() == c)\n\t\t\t\t\t{\n\t\t\t\t\t\t\tv1 = start;\n\t\t\t\t\t\t\t++cnt;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t\tv1 = (ll)(s.front() - 'a');\n\t\t\t\t\tif (s.back() == c)\n\t\t\t\t\t{\n\t\t\t\t\t\t\tv2 = goal;\n\t\t\t\t\t\t\t++cnt2;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t\tv2 = (ll)(s.back() - 'a');\n\n\t\t\t\t\tmax_flow.add_edge(v1, v2, 1);\n\t\t\t}\n\n\t\t\tll tmp = max_flow.solve(start, goal);\n\t\t\tif (cnt2 and cnt == tmp)\n\t\t\t\t\tstd::cout << c << std::endl;\n\t}\n\t\n}","accuracy":1,"time_ms":20,"memory_kb":5416,"score_of_the_acc":-0.0935,"final_rank":7},{"submission_id":"aoj_3047_5263448","code_snippet":"//////////////////////////////\n// Check before you submit.\n// #define _ATCODER_LIBRARY\n\nconst long long MOD = 1e9+7;\n// const long long MOD = 998244353;\n\n/////////////////////////////\n#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _ATCODER_LIBRARY\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n// _ATCODER_LIBRARY\n\nconst long long INF = 1LL << 60;\nconst double PI = acos(-1);\nusing ll = long long;\nusing P = array<ll, 2>;\n\n#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n#define SUM(v) accumulate(ALL(v),0ll)\n\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){REP(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;REP(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\"\\n\";REP(i,vv.size())s+=join(vv[i])+\"\\n\";return s;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}\ntemplate<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v){return o<<\"(\"<<v.first<<\",\"<<v.second<<\")\";}\ntemplate<typename T>istream& operator>>(istream&i,array<T,2>&v){i>>v[0]>>v[1]; return i;}\ntemplate<typename T>ostream& operator<<(ostream&o,array<T,2>&v){return o<<\"(\"<<v[0]<<\",\"<<v[1]<<\")\"; return o;}\n\n#define DEBUG(x);\n\n#ifdef _DEBUG\n#define DEBUG(x) std::cerr << #x << \" : \" << (x) << std::endl;\n#define GLIBCXX_DEBUG\n#define GLIBCXX_DEBUG_PEDANTIC\n#endif\n// _DEBUG\n\nint dx[4]{0, 1, 0, -1};\nint dy[4]{1, 0, -1, 0};\n\nvoid init_init_init() {ios_base::sync_with_stdio(false);cin.tie(NULL);std::cout<<fixed<<setprecision(10);}\ntemplate<class T>T up(T a, T b){assert(b);return (a+b-1)/b;}\ntemplate<typename... A>bool eq(A const&... a){auto t={a...};assert(t.size());auto tar=*t.begin();for(const auto&e:t)if(tar!=e)return false;return true;}\n\ntemplate<class T>bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T>bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmax(T &a, initializer_list<T>l){return chmax(a,max(l));}\ntemplate<class T>bool chmin(T &a, initializer_list<T>l){return chmin(a,min(l));}\n\n//////////////////////////////////////////////////////////////////\n// My Library\n//////////////////////////////////////////////////////////////////\n\ntemplate<typename T> class Dinic {\nprivate:\n\tint V;\n\tvector<int> level,iter;\n\tvoid bfs(int s) {\n\t\tfill(level.begin(),level.end(),-1);\n\t\tqueue<int> que;\n\t\tlevel[s] = 0;\n\t\tque.push(s);\n\t\twhile(!que.empty()){\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto& e : G[v]){\n\t\t\t\tif(e.cap > 0 && level[e.to] < 0){\n\t\t\t\t\tlevel[e.to] = level[v] + 1;\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tT dfs(int v,int t,T f) {\n\t\tif(v==t){\n\t\t\treturn f;\n\t\t}\n\t\tfor(int& i = iter[v]; i < (int)G[v].size(); i++){\n\t\t\tedge& e = G[v][i];\n\t\t\tif(e.cap > 0 && level[v] < level[e.to]){\n\t\t\t\tT d = dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(d > 0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n \npublic:\n\tstruct edge{\n\t\tint to;\n\t\tT cap;\n\t\tint rev;\n\t};\n\tvector<vector<edge> > G;\n \n\tDinic(int node_size) : V(node_size), level(V), iter(V), G(V){}\n\t// Adding edge on a node.\n\tvoid add_edge(int from,int to,T cap) {\n\t\tG[from].push_back((edge){to,cap,(int)G[to].size()});\n\t\tG[to].push_back((edge){from,(T)0,(int)G[from].size()-1});\n\t}\n\t// Calculate the maximum flow.\n\tT solve(int s,int t) {\n\t\tT flow = 0;\n\t\tfor(;;){\n\t\t\tbfs(s);\n\t\t\tif(level[t] < 0) return flow;\n\t\t\tfill(iter.begin(),iter.end(),0);\n\t\t\tT f;\n\t\t\twhile((f=dfs(s,t,numeric_limits<T>::max())) > 0){\n\t\t\t\tflow += f;\n\t\t\t}\n\t\t}\n\t}\n};\n\n\n//////////////////////////////////////////////////////////////////\n// Contest Code\n//////////////////////////////////////////////////////////////////\n\n\n\nint main(int argc, char **argv)\n{\n\tinit_init_init();\n\n\tll N; cin >> N;\n\tvector<string> S(N);\n\tREP(i, N) cin >> S[i];\n\tmap<char, ll> is_last;\n\tfor (auto e : S)\n\t\t\tis_last[e.back()] = true;\n\tfor (char c = 'a'; c <= 'z'; ++c)\n\t{\n\t\t\tconst ll start = 26;\n\t\t\tconst ll goal = 27;\n\t\t\tDinic<ll> max_flow(28);\n\t\t\tll cnt{0};\n\t\t\tll cnt2{0};\n\t\t\tREP(i, N)\n\t\t\t{\n\t\t\t\t\tstring s = S[i];\n\t\t\t\t\tll v1, v2;\n\t\t\t\t\tif (s.front() == c)\n\t\t\t\t\t{\n\t\t\t\t\t\t\tv1 = start;\n\t\t\t\t\t\t\t++cnt;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t\tv1 = (ll)(s.front() - 'a');\n\t\t\t\t\tif (s.back() == c)\n\t\t\t\t\t{\n\t\t\t\t\t\t\tv2 = goal;\n\t\t\t\t\t\t\t++cnt2;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\t\tv2 = (ll)(s.back() - 'a');\n\n\t\t\t\t\tmax_flow.add_edge(v1, v2, 1);\n\t\t\t}\n\n\t\t\tll tmp = max_flow.solve(start, goal);\n\t\t\tif (cnt2 and tmp == cnt)\n\t\t\t\t\tstd::cout << c << std::endl;\n\t}\n\t\n}","accuracy":1,"time_ms":20,"memory_kb":5368,"score_of_the_acc":-0.0917,"final_rank":6},{"submission_id":"aoj_3047_4849083","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\n#include <algorithm>\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n g[from].push_back(_edge{to, int(g[to].size()), cap});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n#define int long long\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 FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)\n#define ALL(a) a.begin(), a.end()\n#define IN(a, x, b) (a <= x && x < b)\ntemplate<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}\ntemplate<class T>inline void out(T t){cout << t << \"\\n\";}\ntemplate<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << \" \";out(ts...);}\ntemplate<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}\nconstexpr int INF = 1e18;\n\n\n\nsigned main(){\n\tint N;\n\tcin >> N;\n\tvector<string>s(N);\n\tcin >> s;\n\tREP(i, 26) {\n\t\tmf_graph<int>graph(28);\n\t\tint S = 26, T = 27;\n\t\tint degOut = 0, degIn = 0;\n\t\tREP(j, N) {\n\t\t\tint u = s[j][0] - 'a';\n\t\t\tint v = s[j].back() - 'a';\n\t\t\tif(u == i) {\n\t\t\t\tu = S;\n\t\t\t\t++degOut;\n\t\t\t}\n\t\t\tif(v == i) {\n\t\t\t\tv = T;\n\t\t\t\t++degIn;\n\t\t\t}\n\t\t\tgraph.add_edge(u, v, 1);\n\t\t}\n\t\tint f = graph.flow(S, T);\n\t\tif(f >= degOut && degIn > 0) out(char('a' + i));\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":5540,"score_of_the_acc":-0.0982,"final_rank":9},{"submission_id":"aoj_3047_4810309","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n#define rep(i, n) for(int i=0; i<n; ++i)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\nusing namespace std;\nusing ll = int64_t;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vs = vector<string>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;\nconst int INF = 0xccccccc;\nconst ll LINF = 922337203685477580LL;\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}\ntemplate<typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}\n\nstruct edge{\n int to, rev;\n int64_t cap;\n edge(int t=0, int64_t c=0, int r=0):to(t), cap(c), rev(r) {}\n};\n\nstruct max_flow {\n vector<vector<edge> > G;\n vector<int> level, iter;\n int n;\n max_flow(int n=0):n(n), G(n), level(n), iter(n) {}\n inline void add(int from, int to, int64_t cap) {\n G[from].emplace_back(to, cap, G[to].size());\n G[to].emplace_back(from, 0, G[from].size()-1);\n }\n void bfs(int s) {\n for(int i = 0; i < n; i++) level[i] = -1;\n queue<int> que;\n level[s] = 0;\n que.emplace(s);\n while(!que.empty()) {\n int now = que.front();\n que.pop();\n for(edge &e:G[now]) {\n if(e.cap > 0 and level[e.to] < 0) {\n level[e.to] = level[now] + 1;\n que.emplace(e.to);\n }\n }\n }\n }\n int64_t dfs(int v, int t, int64_t f) {\n if(v == t) return f;\n for(int &i = iter[v]; i < G[v].size(); i++) {\n edge &e = G[v][i];\n if(e.cap > 0 and level[v] < level[e.to]) {\n int64_t d = dfs(e.to, t, min(f, e.cap));\n if(d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n int64_t Dinic(int s, int t) {\n int64_t flow = 0;\n while(true) {\n bfs(s);\n if(level[t] < 0) return flow;\n for(int i = 0; i < n; i++) iter[i] = 0;\n int64_t f;\n while((f = dfs(s, t, INT64_MAX)) > 0) flow += f;\n }\n }\n};\n#define N 10010\n\n//head\n\nint n;\nstring s[N];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> n;\n rep(i, n) cin >> s[i];\n rep(i, 26) {\n max_flow mfl(28);\n const int ss = 27, tt = 26;\n int cnt = 0;\n bool back = false;\n rep(j, n) {\n int from = s[j][0]-'a', to = s[j][s[j].size()-1]-'a';\n if(from == i) {from = ss; cnt++;}\n if(to == i) {to = tt; back = true;}\n mfl.add(from, to, 1);\n }\n if(mfl.Dinic(ss, tt) == cnt and back) cout << char('a'+i) << '\\n';\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4984,"score_of_the_acc":-0.0665,"final_rank":3},{"submission_id":"aoj_3047_4776985","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < n; i++)\n#define rep2(i, x, n) for(int i = x; i <= n; i++)\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\n#define elif else if\n#define sp(x) fixed << setprecision(x)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)x.size()\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\nconst ll MOD = 1e9+7;\n//const ll MOD = 998244353;\nconst int inf = (1<<30)-1;\nconst ll INF = (1LL<<60)-1;\nconst ld EPS = 1e-10;\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\n\ntemplate<typename T>\nstruct Max_Flow{\n struct edge{\n int to; T cap; int rev;\n edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}\n };\n\n vector<vector<edge>> es;\n vector<bool> used;\n const T INF_T;\n\n Max_Flow(int n) : INF_T(numeric_limits<T>::max()){\n es.resize(n), used.resize(n);\n }\n\n void add_edge(int from, int to, T cap, bool directed = true){\n es[from].eb(to, cap, sz(es[to]));\n es[to].eb(from, directed? 0 : cap, sz(es[from])-1);\n }\n\n T dfs(int now, int t, T flow){\n if(now == t) return flow;\n used[now] = true;\n for(auto &e: es[now]){\n if(!used[e.to] && e.cap > 0){\n T f = dfs(e.to, t, min(flow, e.cap));\n if(f > 0){\n e.cap -= f;\n es[e.to][e.rev].cap += f;\n return f;\n }\n }\n }\n return 0;\n }\n\n T max_flow(int s, int t){\n T flow = 0;\n for(;;){\n fill(all(used), false);\n T f = dfs(s, t, INF_T);\n if(f == 0) return flow;\n flow += f;\n }\n }\n};\n\nint main(){\n int N;\n cin >> N;\n string S[N];\n rep(i, N) cin >> S[i];\n rep(i, 26){\n Max_Flow<int> G(28);\n int s = 26, t = 27;\n int in = 0, out = 0;\n rep(j, N){\n int u = S[j].front()-'a', v = S[j].back()-'a';\n if(u == i) u = s, out++;\n if(v == i) v = t, in++;\n G.add_edge(u, v, 1);\n }\n if(G.max_flow(s, t) == out && in) cout << char('a'+i) << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":5248,"score_of_the_acc":-0.1403,"final_rank":11},{"submission_id":"aoj_3047_4373224","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define pb push_back\n#define INF 1000000000\n\nstruct max_flow\n{\n int V;\n struct edge{int to,cap,rev;};\n using Graph=vector<vector<edge>>;\n Graph graph;\n vector<bool> visit;\npublic:\n max_flow(int n) //与えられた頂点は別にスタートとシンクを設定する場合\n {\n V=n;\n graph.resize(V+2,vector<edge> ());\n visit.resize(V+2,false);\n }\n\n void add_edge(int from,int to, int cap)\n {\n graph[from].pb((edge){to,cap,(int)graph[to].size()});\n graph[to].pb((edge){from,0,(int)graph[from].size()-1});\n return ;\n }\n\n int dfs(int s, int t, int f)\n {\n if (s==t) return f;\n visit[s]=true;\n for (int i=0;i<graph[s].size();i++)\n {\n edge &e=graph[s][i];\n if (!visit[e.to] && e.cap>0)\n {\n int d=dfs(e.to,t,min(f,e.cap));\n if (d>0)\n {\n e.cap-=d;\n graph[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n }\n\n int run(int s,int t)\n {\n int flow=0;\n for (;;) //while文\n {\n for (int i=0;i<V+2;i++) visit[i]=false;//memsetは初期化\n int f=dfs(s,t,INF);\n if (f==0) return flow;\n else flow+=f;\n }\n }\n};\n\nint main()\n{\n int N; cin >> N;\n int cnt[28][28];string input;\n for (int i=0;i<27;i++)\n for (int j=0;j<27;j++) cnt[i][j]=0;\n for (int i=0;i<N;i++)\n {\n cin >> input;\n cnt[(int)input[0]-'a'][(int)input[input.size()-1]-'a']++;\n }\n vector<char> ans;\n for (int s=0;s<26;s++)\n {\n max_flow solve(26);\n for (int i=0;i<26;i++)\n {\n if (i!=s)\n {\n for (int j=0;j<26;j++)\n {\n if (j!=s && cnt[i][j]>0 &&i!=j) solve.add_edge(i+1,j+1,cnt[i][j]);\n }\n }\n else continue;\n }\n int sum=0;\n bool ok=false;\n if (cnt[s][s]>0) {ok=true;solve.add_edge(0,27,cnt[s][s]);}\n for (int i=0;i<26;i++)\n {\n sum+=cnt[s][i];\n if (cnt[s][i]>0 && i!=s ) solve.add_edge(0,i+1,cnt[s][i]);\n if (cnt[i][s]>0 && i!=s) {solve.add_edge(i+1,27,cnt[i][s]);ok=true;}\n }\n if (solve.run(0,27)==sum && ok)\n {\n char a='a'+s;\n ans.pb(a);\n }\n }\n for (int i=0;i<ans.size();i++) cout << ans[i] << endl;\nreturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3232,"score_of_the_acc":-0.0213,"final_rank":1},{"submission_id":"aoj_3047_4344893","code_snippet":"#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr double INFD = 1e100;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ios::sync_with_stdio(false);\n// cin.tie(nullptr);\n// ---------------------------------------------------------------------------\n\n\n#define MAX_V 1000000\nstruct edge{\n int to,cap,rev;\n};\n\nvector<vector<edge>> G(MAX_V);\nbool used[MAX_V];\n\nvoid add_edge(int from,int to,int cap){\n edge F;\n edge T;\n F.to = to;\n F.cap = cap;\n F.rev = G[to].size();\n G[from].push_back(F);\n\n T.to = from;\n T.cap = 0;\n T.rev = G[from].size()-1;\n G[to].push_back(T);\n}\n\nint dfs(int v,int t,int f){\n if(v == t) return f;\n used[v] = true;\n for(int i=0; i<G[v].size(); i++){\n edge &e = G[v][i];\n if(!used[e.to] and e.cap > 0){\n int d = dfs(e.to,t,min(f,e.cap));\n if(d > 0){\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n}\n\nint max_flow(int s,int t){\n int flow = 0;\n while(1){\n memset(used, 0, sizeof(used));\n int f = dfs(s,t,inf);\n if(f == 0) return flow;\n flow += f;\n }\n}\n\n\nint main(){\n int N;\n cin >> N;\n vector<string> S(N);\n for(int i=0; i<N; i++){\n cin >> S[i];\n }\n vector<bool> last(26,false);\n for(int i=0; i<N; i++){\n last[S[i].back()-'a'] = true;\n }\n for(int c=0; c<26; c++){\n if(!last[c]) continue;\n int s=26,t=27;\n int cnt = 0;\n memset(used,0,sizeof(used));\n for(int i=0; i<30; i++){\n G[i].clear();\n }\n for(int i=0; i<N; i++){\n int u = (S[i].front() == c+'a') ? s : (S[i].front()-'a');\n int v = (S[i].back() == c+'a') ? t : (S[i].back()-'a');\n // cout << u << \" \" << v << enld;\n add_edge(u,v,1);\n if(S[i].front() == c+'a') cnt++; \n }\n // cout << G[s].size() << enld;\n int flow = max_flow(s,t);\n // cout << \"check:\" << char(c+'a') << \" \" << flow << \" \" << cnt << enld;\n if(flow == cnt){\n cout << char(c+'a') << enld;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":29584,"score_of_the_acc":-1.3617,"final_rank":17},{"submission_id":"aoj_3047_4322747","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<typename flow_t>\nstruct Dinic {\n struct Edge {\n int to; flow_t cap; int rev; bool isrev;\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\n };\n const flow_t INF;\n vector<vector<Edge>> g;\n vector<int> min_cost, iter;\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\n void add_edge(int from, int to, flow_t cap) {\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\n }\n bool bfs(int s, int t) {\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\n queue<int> que; que.emplace(s);\n while (!que.empty() && min_cost[t] == -1) {\n int v = que.front(); que.pop();\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.emplace(e.to);\n }\n }\n return min_cost[t] != -1;\n }\n flow_t dfs(int v, int t, flow_t flow) {\n if (v == t) return flow;\n for (int &i = iter[v]; i < (int)g[v].size(); i++) {\n Edge &e = g[v][i];\n if (e.cap > 0 && min_cost[v] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if (d > 0) {\n e.cap -= d, g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while (bfs(s, t)) {\n iter.assign(g.size(), 0);\n flow_t f = 0;\n while ((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n friend ostream& operator<<(ostream& os, Dinic& mf) {\n for (int i = 0; i < (int)mf.g.size(); i++) {\n for (auto &e: mf.g[i]) if (!e.isrev) {\n auto &rev_e = mf.g[e.to][e.rev];\n os << i << \" -> \" << e.to << \" (flow: \";\n os << rev_e.cap << \" / \" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n return os;\n }\n};\n\nint main() {\n int n; cin >> n;\n vector<string> ss(n);\n for (auto &si: ss) cin >> si;\n string ans;\n for (int c = 0; c < 26; c++) {\n Dinic<int> mf(26 + 2);\n int s = 26, t = s + 1;\n int deg_out = 0, deg_in = 0;\n for (auto &si: ss) {\n int u = si.front() - 'a', v = si.back() - 'a';\n if (u == c) u = s, deg_out++;\n if (v == c) v = t, deg_in++;\n mf.add_edge(u, v, 1);\n }\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\n }\n for (char c: ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5360,"score_of_the_acc":-0.102,"final_rank":10},{"submission_id":"aoj_3047_4322730","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<typename flow_t>\nstruct Dinic {\n struct Edge {\n int to; flow_t cap; int rev; bool isrev;\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\n };\n const flow_t INF;\n vector<vector<Edge>> g;\n vector<int> min_cost, iter;\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\n void add_edge(int from, int to, flow_t cap) {\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\n }\n bool bfs(int s, int t) {\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\n queue<int> que; que.emplace(s);\n while (!que.empty() && min_cost[t] == -1) {\n int v = que.front(); que.pop();\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.emplace(e.to);\n }\n }\n return min_cost[t] != -1;\n }\n flow_t dfs(int v, int t, flow_t flow) {\n if (v == t) return flow;\n for (int i = iter[v]; i < (int)g[v].size(); i++) {\n Edge &e = g[v][i];\n if (e.cap > 0 && min_cost[v] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if (d > 0) {\n e.cap -= d, g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while (bfs(s, t)) {\n iter.assign(g.size(), 0);\n flow_t f = 0;\n while ((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n};\n\nint main() {\n int n; cin >> n;\n vector<string> ss(n);\n for (auto &si: ss) cin >> si;\n string ans;\n for (int c = 0; c < 26; c++) {\n Dinic<int> mf(26 + 2);\n int s = 26, t = s + 1;\n int deg_out = 0, deg_in = 0;\n for (auto &si: ss) {\n int u = si.front() - 'a', v = si.back() - 'a';\n if (u == c) u = s, deg_out++;\n if (v == c) v = t, deg_in++;\n mf.add_edge(u, v, 1);\n }\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\n }\n for (char c: ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":930,"memory_kb":5320,"score_of_the_acc":-1.058,"final_rank":14},{"submission_id":"aoj_3047_4322712","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<typename flow_t>\nstruct Dinic {\n struct Edge {\n int to; flow_t cap; int rev; bool isrev;\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\n };\n const flow_t INF;\n vector<vector<Edge>> g;\n vector<int> min_cost, iter;\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\n void add_edge(int from, int to, flow_t cap) {\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\n }\n bool bfs(int s, int t) {\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\n queue<int> que; que.emplace(s);\n while (!que.empty() && min_cost[t] == -1) {\n int v = que.front(); que.pop();\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.emplace(e.to);\n }\n }\n return min_cost[t] != -1;\n }\n flow_t dfs(int idx, int t, flow_t flow) {\n if (idx == t) return flow;\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\n Edge &e = g[idx][i];\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if (d > 0) {\n e.cap -= d, g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while (bfs(s, t)) {\n iter.assign(g.size(), 0);\n flow_t f = 0;\n while ((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n friend ostream& operator<<(ostream& os, Dinic& mf) {\n for (int i = 0; i < (int)mf.g.size(); i++) {\n for (auto &e: mf.g[i]) if (!e.isrev) {\n auto &rev_e = mf.g[e.to][e.rev];\n os << i << \" -> \" << e.to << \" (flow: \";\n os << rev_e.cap << \" / \" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n return os;\n }\n};\n\nint main() {\n int n; cin >> n;\n vector<string> ss(n);\n for (auto &si: ss) cin >> si;\n for (int c = 0; c < 26; c++) {\n Dinic<int> mf(26 + 2);\n int s = 26, t = s + 1;\n int deg_out = 0, deg_in = 0;\n for (auto &si: ss) {\n int u = si.front() - 'a', v = si.back() - 'a';\n if (u == c) u = s, deg_out++;\n if (v == c) v = t, deg_in++;\n mf.add_edge(u, v, 1);\n }\n if (deg_in && mf.max_flow(s, t) == deg_out) cout << char('a' + c) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":930,"memory_kb":5336,"score_of_the_acc":-1.0586,"final_rank":15},{"submission_id":"aoj_3047_4322703","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<typename flow_t>\nstruct Dinic {\n struct Edge {\n int to; flow_t cap; int rev; bool isrev;\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\n };\n const flow_t INF;\n vector<vector<Edge>> g;\n vector<int> min_cost, iter;\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n), min_cost(n) { }\n void add_edge(int from, int to, flow_t cap) {\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\n }\n bool bfs(int s, int t) {\n fill(begin(min_cost), end(min_cost), -1), min_cost[s] = 0;\n queue<int> que; que.emplace(s);\n while (!que.empty() && min_cost[t] == -1) {\n int v = que.front(); que.pop();\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.emplace(e.to);\n }\n }\n return min_cost[t] != -1;\n }\n flow_t dfs(int idx, int t, flow_t flow) {\n if (idx == t) return flow;\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\n Edge &e = g[idx][i];\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if (d > 0) {\n e.cap -= d, g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while (bfs(s, t)) {\n iter.assign(g.size(), 0);\n flow_t f = 0;\n while ((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n friend ostream& operator<<(ostream& os, Dinic& mf) {\n for (int i = 0; i < (int)mf.g.size(); i++) {\n for (auto &e: mf.g[i]) if (!e.isrev) {\n auto &rev_e = mf.g[e.to][e.rev];\n os << i << \" -> \" << e.to << \" (flow: \";\n os << rev_e.cap << \" / \" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n return os;\n }\n};\n\nint main() {\n int n; cin >> n;\n vector<string> ss(n);\n for (auto &si: ss) cin >> si;\n string ans;\n for (int c = 0; c < 26; c++) {\n Dinic<int> mf(28);\n int s = 26, t = s + 1;\n int deg_out = 0, deg_in = 0;\n for (auto &si: ss) {\n int u = si.front() - 'a', v = si.back() - 'a';\n if (u == c) u = s, deg_out++;\n if (v == c) v = t, deg_in++;\n mf.add_edge(u, v, 1);\n }\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\n }\n for (char c: ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":950,"memory_kb":5348,"score_of_the_acc":-1.0803,"final_rank":16},{"submission_id":"aoj_3047_4322700","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<typename flow_t>\nstruct Dinic {\n struct Edge {\n int to; flow_t cap; int rev; bool isrev;\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\n };\n const flow_t INF;\n vector<vector<Edge>> g;\n vector<int> min_cost, iter;\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\n void add_edge(int from, int to, flow_t cap) {\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\n }\n bool bfs(int s, int t) {\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\n queue<int> que; que.emplace(s);\n while (!que.empty() && min_cost[t] == -1) {\n int v = que.front(); que.pop();\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.emplace(e.to);\n }\n }\n return min_cost[t] != -1;\n }\n flow_t dfs(int idx, int t, flow_t flow) {\n if (idx == t) return flow;\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\n Edge &e = g[idx][i];\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if (d > 0) {\n e.cap -= d, g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while (bfs(s, t)) {\n iter.assign(g.size(), 0);\n flow_t f = 0;\n while ((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n friend ostream& operator<<(ostream& os, Dinic& mf) {\n for (int i = 0; i < (int)mf.g.size(); i++) {\n for (auto &e: mf.g[i]) if (!e.isrev) {\n auto &rev_e = mf.g[e.to][e.rev];\n os << i << \" -> \" << e.to << \" (flow: \";\n os << rev_e.cap << \" / \" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n return os;\n }\n};\n\nint main() {\n int n; cin >> n;\n vector<string> ss(n);\n for (auto &si: ss) cin >> si;\n string ans;\n for (int c = 0; c < 26; c++) {\n Dinic<int> mf(28);\n int s = 26, t = s + 1;\n int deg_out = 0, deg_in = 0;\n for (auto &si: ss) {\n int u = si.front() - 'a', v = si.back() - 'a';\n if (u == c) u = s, deg_out++;\n if (v == c) v = t, deg_in++;\n mf.add_edge(u, v, 1);\n }\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\n }\n for (char c: ans) cout << c << endl;\n return 0;\n}","accuracy":1,"time_ms":920,"memory_kb":5412,"score_of_the_acc":-1.0508,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_3047_9258323\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\nstruct Dinic {\\n struct edge {\\n int to, rev; ll cap;\\n edge(int t, int r, ll c) : to(t), rev(r), cap(c) {}\\n };\\n int n;\\n vii<edge> to;\\n vi<int> dist, iter;\\n const ll inf = 1e18;\\n Dinic(int n_) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, ll c) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, c });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n dist[s] = 0;\\n queue<int> q;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (edge& nv : to[v]) {\\n if (nv.cap == 0 || dist[nv.to] != -1) continue;\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n\\n ll dfs(int v, int t, ll f) {\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (nv.cap == 0 || dist[nv.to] <= dist[v]) continue;\\n ll nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n ll maxflow(int s, int t) {\\n ll res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n iter.assign(n, 0);\\n do {\\n flow = dfs(s, t, inf);\\n res += flow;\\n\\n } while (flow);\\n };\\n return res;\\n }\\n};\\n\\nint main()\\n{\\n std::cin.tie(nullptr);\\n std::ios_base::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n\\n vi<string> s(n);\\n rep(i, n) cin >> s[i];\\n\\n //文字cを頂点とみなし、indeg: cで終わる、outdeg: cで始まる\\n int mx = 26;\\n vi<int> indeg(mx), outdeg(mx);\\n rep(i, n) {\\n indeg[s[i].back() - 'a']++;\\n outdeg[s[i].front() - 'a']++;\\n }\\n\\n vi<char> ans;\\n rep(i, mx) {\\n char c = 'a' + i;\\n\\n //cで終わるものがそもそもない\\n if (indeg[i] == 0) continue;\\n\\n //cに戻ってくることはない\\n if (outdeg[i] == 0) {\\n ans.push_back('a' + i);\\n continue;\\n }\\n\\n //cで始まるのものがcで終わるものより多い\\n if (indeg[i] < outdeg[i]) continue;\\n\\n Dinic dn(mx + 2);\\n int S = mx, T = S + 1;\\n \\n rep(j, n) {\\n char sf = s[j].front();\\n char sb = s[j].back();\\n int u = sf - 'a';\\n int v = sb - 'a';\\n if (sf == c) u = S;\\n if (sb == c) v = T;\\n dn.addedge(u, v, 1);\\n }\\n\\n int flow = dn.maxflow(S, T);\\n if (flow == outdeg[i]) ans.push_back(c);\\n }\\n\\n for (char c : ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5136,\n \"score_of_the_acc\": -0.0723,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3047_9258294\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\nstruct Dinic {\\n struct edge {\\n int to, rev; ll cap;\\n edge(int t, int r, ll c) : to(t), rev(r), cap(c) {}\\n };\\n int n;\\n vii<edge> to;\\n vi<int> dist, iter;\\n const ll inf = 1e18;\\n Dinic(int n_) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, ll c) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, c });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n dist[s] = 0;\\n queue<int> q;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (edge& nv : to[v]) {\\n if (nv.cap == 0 || dist[nv.to] != -1) continue;\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n\\n ll dfs(int v, int t, ll f) {\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (nv.cap == 0 || dist[nv.to] <= dist[v]) continue;\\n ll nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n ll maxflow(int s, int t) {\\n ll res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n iter.assign(n, 0);\\n do {\\n flow = dfs(s, t, inf);\\n res += flow;\\n\\n } while (flow);\\n };\\n return res;\\n }\\n};\\n\\nint main()\\n{\\n int n;\\n cin >> n;\\n\\n vi<string> s(n);\\n rep(i, n) cin >> s[i];\\n\\n //文字cを頂点とみなし、indeg: cで終わる、outdeg: cで始まる\\n int mx = 26;\\n vi<int> indeg(mx), outdeg(mx);\\n rep(i, n) {\\n indeg[s[i].back() - 'a']++;\\n outdeg[s[i].front() - 'a']++;\\n }\\n\\n vi<char> ans;\\n rep(i, mx) {\\n char c = 'a' + i;\\n\\n //cで終わるものがそもそもない\\n if (indeg[i] == 0) continue;\\n\\n //cに戻ってくることはない\\n if (outdeg[i] == 0) {\\n ans.push_back('a' + i);\\n continue;\\n }\\n\\n Dinic dn(mx + 2);\\n int S = mx, T = S + 1;\\n \\n rep(j, n) {\\n char sf = s[j].front();\\n char sb = s[j].back();\\n int u = sf - 'a';\\n int v = sb - 'a';\\n if (sf == c) u = S;\\n if (sb == c) v = T;\\n dn.addedge(u, v, 1);\\n }\\n\\n int flow = dn.maxflow(S, T);\\n if (flow >= outdeg[i]) ans.push_back(c);\\n }\\n\\n for (char c : ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5476,\n \"score_of_the_acc\": -0.0958,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3047_8411648\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> pr;\\ntypedef pair<pr, ll> prpl;\\ntypedef pair<ll, pr> prlp;\\ntypedef tuple<ll, ll, ll> tri;\\ntypedef tuple<ll, ll, ll, ll, ll> cinq;\\n\\n\\nconst ll INF = (ll)1e18;\\n\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++) // for文の省略\\n#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)\\n#define all(v) v.begin(), v.end() // 配列範囲の指定の省略。reverse()やsort()に入れる時便利\\n#define pb push_back\\n\\n// 変数を宣言して入力を代入する所の省略\\ntemplate<class... T>\\nvoid input(T&... a){\\n (cin >> ... >> a);\\n}\\n#define llin(...) ll __VA_ARGS__; input(__VA_ARGS__)\\nvoid input_vector(vector<ll>& v, ll N){\\n rep(i, N){\\n cin >> v[i];\\n }\\n}\\n#define vectin(v, N) vector<ll> v(N); input_vector(v, N)\\ntemplate<class U>\\nvoid input_graph(vector<vector<U>>& G, ll M, bool directed = false, bool weighted = false){\\n rep(i, M){\\n if(!weighted){\\n ll A, B; cin >> A >> B;\\n if(!directed){\\n G[A].push_back(B);\\n G[B].push_back(A);\\n } else {\\n G[A].push_back(B);\\n }\\n } else {\\n ll A, B, cost; cin >> A >> B >> cost;\\n if(!directed){\\n G[A].push_back({B, cost});\\n G[B].push_back({A, cost});\\n } else {\\n G[A].push_back({B, cost});\\n }\\n }\\n }\\n}\\n#define graphin(G, N, M) vector<vector<ll>> G(N); input_graph(G, M)\\n#define graphin_directed(G, N, M) vector<vector<ll>> G(N); input_graph(G, M, directed = true)\\n#define graphin_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, weighted = true)\\n#define graphin_directed_weighted(G, N, M) vector<vector<pr>> G(N); input_graph(G, M, directed = true, weighted = true)\\ntemplate<class U>\\nvoid input_edge(vector<U> E, ll M, bool weighted = false){\\n rep(i, M){\\n if(!weighted){\\n ll A, B; cin >> A >> B;\\n E[i] = {A, B};\\n } else {\\n ll A, B, cost; cin >> A >> B >> cost;\\n E[i] = {cost, {A, B}};\\n }\\n }\\n if(weighted){\\n sort(all(E));\\n }\\n}\\n#define edgein(E, M) vector<pr> E(M); input_edge(E, M)\\n#define edgein_weighted(E, M) vector<prlp> E(M); input_edge(E, M, weighted = true)\\n\\n\\n// デバッグ処理の簡略化。「#define _DEBUG」行をコメントアウトするかどうかで処理を行うかどうか変えられる\\nvoid debug_out() { cout << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cout << H << \\\" \\\";\\n debug_out(T...);\\n}\\n#define _DEBUG\\n#ifdef _DEBUG\\n#define debug(...) debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) \\n#endif\\n\\n#ifndef H_make_vector\\n#define H_make_vector\\n\\n/**\\n * @brief 多次元 vector の作成\\n * @author えびちゃん\\n */\\n\\n#include <cstddef>\\n#include <type_traits>\\n#include <vector>\\n\\nnamespace detail {\\n template <typename Tp, ll Nb>\\n auto make_vector(std::vector<ll>& sizes, Tp const& x) {\\n if constexpr (Nb == 1) {\\n return vector(sizes[0], x);\\n } else {\\n ll size = sizes[Nb-1];\\n sizes.pop_back();\\n return vector(size, make_vector<Tp, Nb-1>(sizes, x));\\n }\\n }\\n} // detail::\\n\\ntemplate <typename Tp, ll Nb>\\nauto make_vector(ll const(&sizes)[Nb], Tp const& x = Tp()) {\\n vector<ll> s(Nb);\\n for (ll i = 0; i < Nb; ++i) s[i] = sizes[Nb-i-1];\\n return detail::make_vector<Tp, Nb>(s, x);\\n}\\n\\n#endif /* !defined(H_make_vector) */\\n\\ntemplate <typename S, typename T>\\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\\n return make_pair(p.first + q.first, p.second + q.second);\\n}\\n \\ntemplate <typename S, typename T>\\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\\n return make_pair(p.first - q.first, p.second - q.second);\\n}\\n\\nll Max_V = 603;\\n\\n\\ntemplate<typename T> class Node {\\npublic:\\n pair<T, ll> val, al;\\n T lazy;\\n Node *left, *right, *par;\\n Node() : val((T)0, -1), al((T)0, -1), lazy(0),\\n left(nullptr), right(nullptr), par(nullptr){}\\n void reset(){\\n left = right = par = nullptr;\\n }\\n bool isRoot() const {\\n return (!par) || (par->left != this && par->right != this);\\n }\\n void push(){\\n if(lazy){\\n val.first += lazy, al.first += lazy;\\n if(left) left->lazy += lazy;\\n if(right) right->lazy += lazy;\\n lazy = 0;\\n }\\n }\\n void eval(){\\n al = val;\\n if(left){\\n left->push();\\n if((left->al).first < al.first) al = left->al;\\n }\\n if(right){\\n right->push();\\n if((right->al).first <= al.first) al = right->al;\\n }\\n }\\n void rotate(bool right){\\n Node *p = this->par, *g = p->par;\\n if(right){\\n if((p->left = this->right)) this->right->par = p;\\n this->right = p, p->par = this;\\n }else{\\n if((p->right = this->left)) this->left->par = p;\\n this->left = p, p->par = this;\\n }\\n p->eval(), this->eval(), this->par = g;\\n if(!g) return;\\n if(g->left == p) g->left = this;\\n if(g->right == p) g->right = this;\\n g->eval();\\n }\\n void splay(){\\n while(!(this->isRoot())){\\n Node *p = this->par, *gp = p->par;\\n if(p->isRoot()){\\n p->push(), this->push();\\n this->rotate((this == p->left));\\n }else{\\n gp->push(), p->push(), this->push();\\n bool flag = (this == p->left);\\n if((this == p->left) == (p == gp->left)){\\n p->rotate(flag), this->rotate(flag);\\n }else{\\n this->rotate(flag), this->rotate(!flag);\\n }\\n }\\n }\\n this->push();\\n }\\n};\\n\\ntemplate<typename T> class Dinic {\\npublic:\\n struct edge {\\n const ll to, rev;\\n T rev_cap;\\n edge(const ll _to, const ll _rev, const T _rev_cap) :\\n to(_to), rev(_rev), rev_cap(_rev_cap){}\\n };\\nprivate:\\n const ll V;\\n vector<ll> que, level, iter, used;\\n\\tvector<Node<T> > arr;\\n void access(Node<T> *u){\\n Node<T> *last = nullptr;\\n for(Node<T>* v = u; v; v = v->par){\\n if((v->val).second == -1){\\n last->par = nullptr;\\n break;\\n }\\n v->splay(), v->right = last, v->eval(), last = v;\\n }\\n u->splay();\\n }\\n void link(Node<T> *u, Node<T> *v){\\n access(u), u->right = v, u->eval(), v->par = u;\\n }\\n void set(Node<T> *u, const T x, const ll id){\\n u->val = {x, id}, u->eval();\\n }\\n ll prev(Node<T> *u){\\n (u = u->right)->push();\\n while(u->left){\\n (u = u->left)->push();\\n }\\n u->splay();\\n return (u->val).second;\\n }\\n ll top(Node<T> *u){\\n while(u->left){\\n (u = u->left)->push();\\n }\\n u->splay();\\n return (u->val).second;\\n }\\n void range(Node<T> *u, const T x){\\n u->lazy += x, u->push();\\n }\\n void cut_and_reflect(const ll ver){\\n Node<T> *u = &arr[ver];\\n u->splay();\\n if(u->left) u->left->par = nullptr, u->left = nullptr, u->eval();\\n edge& e = G[ver][iter[ver]++];\\n G[e.to][e.rev].rev_cap += e.rev_cap - (u->val).first, e.rev_cap = (u->val).first;\\n }\\n void bfs(const ll s, const ll t){\\n level[s] = 0, used[s] = 1;\\n\\t\\tll qh = 0, qt = 0;\\n for(que[qt++] = s; qh < qt;){\\n ll v = que[qh++];\\n for(edge& e : G[v]){\\n if(level[e.to] < 0 && G[e.to][e.rev].rev_cap > 0){\\n\\t\\t\\t\\t\\tlevel[e.to] = level[v] + 1, used[e.to] = 1, que[qt++] = e.to;\\n }\\n }\\n }\\n }\\n\\tT block_flow_naive(const ll s, ll cur, T f){\\n\\t\\tif(s == cur) return f;\\n\\t\\tT flow = 0;\\n\\t\\tfor(ll& i = iter[cur]; i < (ll)G[cur].size(); ++i){\\n\\t\\t\\tedge& e = G[cur][i];\\n\\t\\t\\tif(e.rev_cap > 0 && level[e.to] < level[cur]){\\n\\t\\t\\t\\tT d = block_flow_naive(s, e.to, min(f, e.rev_cap));\\n\\t\\t\\t\\tif(d > 0){\\n\\t\\t\\t\\t\\te.rev_cap -= d, G[e.to][e.rev].rev_cap += d;\\n\\t\\t\\t\\t\\tf -= d, flow += d;\\n\\t\\t\\t\\t\\tif(f == 0) break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn flow;\\n\\t}\\n T block_flow(const ll s, const ll t){\\n T flow = 0;\\n bool find = false;\\n ll cur = t;\\n while(true){\\n if(find){\\n const pair<T, ll>& res = arr[cur].al;\\n flow += res.first;\\n range(&arr[cur], -res.first);\\n cut_and_reflect(cur = res.second);\\n find = false;\\n }\\n used[cur] = 2;\\n bool update = false;\\n for(ll& i = iter[cur]; i < (ll)G[cur].size(); ++i){\\n edge& e = G[cur][i];\\n if(e.rev_cap > 0 && level[e.to] < level[cur] && used[e.to] >= 1){\\n update = true;\\n set(&arr[cur], e.rev_cap, cur);\\n if(e.to == s){\\n find = true;\\n }else if(used[e.to] == 1){\\n\\t\\t\\t\\t\\t\\tarr[e.to].right = &arr[cur];\\n\\t\\t\\t\\t\\t\\tarr[cur].par = &arr[e.to], cur = e.to;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tlink(&arr[e.to], &arr[cur]);\\n\\t\\t\\t\\t\\t\\tconst pair<T, ll>& res = arr[e.to].al;\\n\\t\\t\\t\\t\\t\\tif(res.first == 0){\\n\\t\\t\\t\\t\\t\\t\\tcut_and_reflect(cur = res.second);\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tif(level[cur = top(&arr[e.to])] == 1) find = true;\\n\\t\\t\\t\\t\\t\\t\\telse cut_and_reflect(cur);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n }\\n }\\n if(update) continue;\\n used[cur] = -1, (arr[cur].val).second = -1;\\n if(cur == t) break;\\n cut_and_reflect(cur = prev(&arr[cur]));\\n }\\n return flow;\\n }\\n void update_dfs(Node<T>* u, vector<vector<edge>>& G, const vector<ll>& iter, vector<ll>& used){\\n u->push();\\n if(u->left) update_dfs(u->left, G, iter, used);\\n if(u->right) update_dfs(u->right, G, iter, used);\\n const ll id = (u->val).second;\\n if(iter[id] < (ll)G[id].size()){\\n auto& e = G[id][iter[id]];\\n G[e.to][e.rev].rev_cap += e.rev_cap - (u->val).first;\\n e.rev_cap = (u->val).first;\\n }\\n\\t\\tused[id] = 0, u->reset();\\n }\\n void update_and_clear(vector<vector<edge>>& G, const vector<ll>& iter, vector<ll>& used){\\n for(ll i = 0; i < V; ++i){\\n if(used[i] == 2 && arr[i].isRoot()) update_dfs(&arr[i], G, iter, used);\\n\\t\\t\\telse if(used[i] == -1) arr[i].reset();\\n }\\n }\\n\\npublic:\\n vector<vector<edge>> G;\\n Dinic(const ll node_size)\\n : V(node_size), que(V), level(V), iter(V), used(V), arr(V), G(V){}\\n void add_edge(const ll from, const ll to, const T cap){\\n G[from].emplace_back(to, (ll)G[to].size(), (T)0);\\n G[to].emplace_back(from, (ll)G[from].size() - 1, cap);\\n }\\n T solve(const ll s, const ll t){\\n T flow = 0;\\n while(true){\\n fill(level.begin(), level.end(), -1);\\n fill(used.begin(), used.end(), 0);\\n bfs(s, t);\\n if(level[t] < 0) break;\\n fill(iter.begin(), iter.end(), 0);\\n\\t\\t\\tflow += block_flow(s, t);\\n\\t\\t\\tupdate_and_clear(G, iter, used);\\n }\\n return flow;\\n }\\n};\\n\\n\\n\\n\\nconst ll alpha = 26;\\n\\nint main(void){\\n llin(N);\\n Dinic<ll> Dn(2 * alpha);\\n vector<ll> delta_minus(alpha, 0), delta_plus(alpha, 0);\\n rep(i, N){\\n string S; cin >> S;\\n char s_c = S[0], t_c = S[S.size() - 1];\\n ll a = s_c - 'a', b = t_c - 'a';\\n Dn.add_edge(a + alpha, b, 1);\\n delta_plus[a]++; delta_minus[b]++;\\n }\\n rep(i, alpha){\\n Dn.add_edge(i, i + alpha, INF);\\n }\\n rep(i, alpha){\\n if(delta_minus[i] != 0 && Dn.solve(i + alpha, i) == delta_plus[i]){\\n cout << (char)('a' + i) << endl;\\n }\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3984,\n \"score_of_the_acc\": -0.0285,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3047_8062667\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\nusing namespace std;\\n// using namespace atcoder;\\n// #include \\\"atcoder/modint.hpp\\\"\\n// using mint = atcoder::modint998244353;\\n#define int long long\\n#define intu __int128_t\\n#define rep(i,n) for(int i=0;i<n;++i)\\n#define rep1(i,n) for(int i=1;i<=n;++i)\\n#define reps(i,a,b,c) for(int i=a;i<b;i+=c)\\n#define repnega(i,a,b) for(int i=b;i>a;i--)\\n#define mod2 1000000007\\n#define mod 998244353\\n#define endl '\\\\n'\\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\\n#define pb push_back\\n#define eb emplace_back\\n#define ep emplace\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n\\nint n;\\nstring s[10009];\\nint sh[10009][2];\\nvector<int> g[10009];\\nvector<int> revg[10009];\\nvector<int> ans(29,0);\\nvoid dfs(int p,int c){\\n\\tsh[p][c]=1;\\n\\tint cnt=0;\\n\\tfor(int e:g[p]){\\n\\t\\tif(!sh[e][c]){dfs(e,c);cnt++;}\\n\\t}\\n\\tif(cnt==0&&sh[p][1]==0){\\n\\t\\tc=1;\\n\\t\\tsh[p][1]=1;\\n\\t\\tif(c==1){\\n\\t\\t\\tans[s[p][(int)s[p].size()-1]-'a']=1;\\n\\t\\t\\t// cout<<s[p]<<endl;\\n\\t\\t}\\n\\t\\tfor(int e:g[p]){\\n\\t\\t\\tif(!sh[e][c]){dfs(e,c);cnt++;}\\n\\t\\t}\\n\\t}\\n}\\nsigned main(){\\n\\tcin>>n;\\n\\trep(i,n)cin>>s[i];\\n\\trep(i,n)rep(j,n){\\n\\t\\tif(i==j)continue;\\n\\t\\tif(s[i][(int)s[i].size()-1]==s[j][0]){\\n\\t\\t\\tg[i].pb(j);\\n\\t\\t\\trevg[j].pb(i);\\n\\t\\t}\\n\\t}\\n\\trep(i,n){\\n\\t\\tif(revg[i].size()==0&&(sh[i][0]==0&&sh[i][1]==0)){\\n\\t\\t\\tdfs(i,0);\\n\\t\\t}\\n\\t}\\n\\trep(i,n){\\n\\t\\tif((int)g[i].size()&&sh[i][0]==0&&sh[i][1]==0){\\n\\t\\t\\tdfs(i,0);\\n\\t\\t}\\n\\t}\\n\\trep(i,26){\\n\\t\\tif(ans[i]){\\n\\t\\t\\tcout<<(char)('a'+i)<<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 0.1794871794871795,\n \"time_ms\": 10,\n \"memory_kb\": 9236,\n \"score_of_the_acc\": -0.2278,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3047_8062665\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\nusing namespace std;\\n// using namespace atcoder;\\n// #include \\\"atcoder/modint.hpp\\\"\\n// using mint = atcoder::modint998244353;\\n#define int long long\\n#define intu __int128_t\\n#define rep(i,n) for(int i=0;i<n;++i)\\n#define rep1(i,n) for(int i=1;i<=n;++i)\\n#define reps(i,a,b,c) for(int i=a;i<b;i+=c)\\n#define repnega(i,a,b) for(int i=b;i>a;i--)\\n#define mod2 1000000007\\n#define mod 998244353\\n#define endl '\\\\n'\\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\\n#define pb push_back\\n#define eb emplace_back\\n#define ep emplace\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n\\nint n;\\nstring s[10009];\\nint sh[10009][2];\\nvector<int> g[10009];\\nvector<int> revg[10009];\\nvector<int> ans(29,0);\\nvoid dfs(int p,int c){\\n\\tsh[p][c]=1;\\n\\tint cnt=0;\\n\\tfor(int e:g[p]){\\n\\t\\tif(!sh[e][c]){dfs(e,c);cnt++;}\\n\\t}\\n\\tif(cnt==0&&sh[p][1]==0){\\n\\t\\tc=1;\\n\\t\\tsh[p][1]=1;\\n\\t\\tif(c==1){\\n\\t\\t\\tans[s[p][(int)s[p].size()-1]-'a']=1;\\n\\t\\t\\t// cout<<s[p]<<endl;\\n\\t\\t}\\n\\t\\tfor(int e:g[p]){\\n\\t\\t\\tif(!sh[e][c]){dfs(e,c);cnt++;}\\n\\t\\t}\\n\\t}\\n}\\nsigned main(){\\n\\tcin>>n;\\n\\trep(i,n)cin>>s[i];\\n\\trep(i,n)rep(j,n){\\n\\t\\tif(i==j)continue;\\n\\t\\tif(s[i][(int)s[i].size()-1]==s[j][0]){\\n\\t\\t\\tg[i].pb(j);\\n\\t\\t\\trevg[j].pb(i);\\n\\t\\t}\\n\\t}\\n\\trep(i,n){\\n\\t\\tif(revg[i].size()==0&&(sh[i][0]==0&&sh[i][1]==0)){\\n\\t\\t\\tdfs(i,0);\\n\\t\\t}\\n\\t}\\n\\trep(i,n){\\n\\t\\tif(sh[i][0]==0&&sh[i][1]==0){\\n\\t\\t\\tdfs(i,0);\\n\\t\\t}\\n\\t}\\n\\trep(i,26){\\n\\t\\tif(ans[i]){\\n\\t\\t\\tcout<<(char)('a'+i)<<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 0.1794871794871795,\n \"time_ms\": 10,\n \"memory_kb\": 9212,\n \"score_of_the_acc\": -0.2269,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3047_7428637\",\n \"code_snippet\": \"#pragma region Macros\\n\\n#include <bits/extc++.h>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n// using namespace __gnu_cxx;\\n\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n\\n#define TO_STRING(var) # var\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acos(-1);\\nconst ld EPS = 1e-10;\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\n// const int MOD = 998244353;\\nconst int MOD = 1000000007;\\n\\n// __attribute__((constructor))\\n// void constructor() {\\n// ios::sync_with_stdio(false);\\n// cin.tie(nullptr);\\n// // ifstream in(\\\"input.txt\\\");\\n// // cin.rdbuf(in.rdbuf());\\n// cout << fixed << setprecision(15);\\n// }\\n\\ntemplate<int mod> class modint{\\npublic:\\n int val = 0;\\n modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n modint(const modint &r) { val = r.val; }\\n\\n modint operator -() { return modint(-val); }\\n modint operator +(const modint &r) { return modint(*this) += r; }\\n modint operator -(const modint &r) { return modint(*this) -= r; }\\n modint operator *(const modint &r) { return modint(*this) *= r; }\\n modint operator /(const modint &r) { return modint(*this) /= r; }\\n\\n modint &operator +=(const modint &r) {\\n val += r.val;\\n if (val >= mod) val -= mod;\\n return *this;\\n }\\n modint &operator -=(const modint &r) {\\n if (val < r.val) val += mod;\\n val -= r.val;\\n return *this;\\n }\\n modint &operator *=(const modint &r) {\\n val = val * r.val % mod;\\n return *this;\\n }\\n modint &operator /=(const modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {\\n int t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % mod;\\n if (val < 0) val += mod;\\n return *this;\\n }\\n\\n bool operator ==(const modint& r) { return this -> val == r.val; }\\n bool operator <(const modint& r) { return this -> val < r.val; }\\n bool operator !=(const modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = modint<MOD>;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t;\\n x = t;\\n return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\n\\nmint modpow(const mint &a, int n) {\\n if (n == 0) return 1;\\n mint t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n}\\n\\nint modpow(int x, int n, int mod) {\\n int ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n\\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\n\\n#pragma endregion\\n\\nstruct Edge {\\n char from, to;\\n int cap, rev;\\n Edge(char to, int cap, int rev) : from(-1), to(to), cap(cap), rev(rev) {}\\n Edge(char from, char to, int cap, int rev) : from(from), to(to), cap(cap), rev(rev) {}\\n Edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n\\n // operator int() const { return to; }\\n};\\n\\nvector<int> flag;\\nint dfs(int v, int t, int f, vector<vector<Edge>> &G) { // tは一貫\\n if (v == t) return f; // 残余グラフ上にs-tパスが存在するなら\\n flag[v] = true;\\n\\n for (auto &e : G[v]) {\\n if (flag[e.to] or e.cap == 0) continue;\\n // eが訪問済み、もしくは残余グラフの辺eが無効ならとばす\\n\\n int d = dfs(e.to, t, min(f, e.cap), G); // fはtに到達するまでずっと0\\n if (d > 0) {\\n e.cap -= d; // 残余グラフの容量を減らし\\n G[e.to][e.rev].cap += d; // 元のグラフで同じ量の水を長す\\n return d;\\n }\\n }\\n return 0; // s-tパスが見つからなかったらこれが返る\\n}\\n\\nint max_flow(int s, int t, vector<vector<Edge>> &G) {\\n int ret = 0;\\n\\n while (true) {\\n flag.assign((int)G.size(), false);\\n int f = dfs(s, t, INFL, G);\\n if (f == 0) return ret; // 残余グラフでs-tパスが存在しなくなったら終了\\n ret += f;\\n }\\n // そもそも元のグラフにs-tパスが存在しない場合は0が返る\\n}\\n\\nsigned main() {\\n int N;\\n cin >> N;\\n vector<string> S(N);\\n for (int i = 0; i < N; i++) cin >> S[i];\\n\\n vector<vector<Edge>> G(270);\\n for (int i = 0; i < N; i++) {\\n G[S[i][0]].pb(S[i].back(), 1, G[S[i].back()].size());\\n G[S[i].back()].pb(S[i][0], 0, G[S[i][0]].size() - 1); // 逆辺\\n }\\n\\n vector<vector<Edge>> G2 = G;\\n\\n for (char c = 'a'; c <= 'z'; c++) {\\n G = G2;\\n char t = 'z' + 1;\\n int indeg = 0;\\n int outdeg = 0;\\n for (int i = 0; i < N; i++) {\\n if (S[i].back() == c) {\\n G[S[i][0]].pb(t, 1, G[t].size());\\n G[t].pb(S[i][0], 0, G[S[i][0]].size() - 1); // 逆辺\\n indeg++;\\n }\\n if (S[i][0] == c) outdeg++;\\n }\\n if (indeg == outdeg && indeg == 0) continue;\\n // cout << c << \\\" \\\" << outdeg << \\\" \\\" << max_flow(c, t, G) << endl;\\n\\n if (max_flow(c, t, G) == outdeg) cout << c << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 6020,\n \"score_of_the_acc\": -0.2973,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3047_7428363\",\n \"code_snippet\": \"#pragma region Macros\\n\\n#include <bits/extc++.h>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n// using namespace __gnu_cxx;\\n\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n\\n#define TO_STRING(var) # var\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acos(-1);\\nconst ld EPS = 1e-10;\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\n// const int MOD = 998244353;\\nconst int MOD = 1000000007;\\n\\n// __attribute__((constructor))\\n// void constructor() {\\n// ios::sync_with_stdio(false);\\n// cin.tie(nullptr);\\n// // ifstream in(\\\"input.txt\\\");\\n// // cin.rdbuf(in.rdbuf());\\n// cout << fixed << setprecision(15);\\n// }\\n\\ntemplate<int mod> class modint{\\npublic:\\n int val = 0;\\n modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n modint(const modint &r) { val = r.val; }\\n\\n modint operator -() { return modint(-val); }\\n modint operator +(const modint &r) { return modint(*this) += r; }\\n modint operator -(const modint &r) { return modint(*this) -= r; }\\n modint operator *(const modint &r) { return modint(*this) *= r; }\\n modint operator /(const modint &r) { return modint(*this) /= r; }\\n\\n modint &operator +=(const modint &r) {\\n val += r.val;\\n if (val >= mod) val -= mod;\\n return *this;\\n }\\n modint &operator -=(const modint &r) {\\n if (val < r.val) val += mod;\\n val -= r.val;\\n return *this;\\n }\\n modint &operator *=(const modint &r) {\\n val = val * r.val % mod;\\n return *this;\\n }\\n modint &operator /=(const modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {\\n int t = a / b;\\n a -= t * b; swap(a, b);\\n u -= t * v; swap(u, v);\\n }\\n val = val * u % mod;\\n if (val < 0) val += mod;\\n return *this;\\n }\\n\\n bool operator ==(const modint& r) { return this -> val == r.val; }\\n bool operator <(const modint& r) { return this -> val < r.val; }\\n bool operator !=(const modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = modint<MOD>;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t;\\n x = t;\\n return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\n\\nmint modpow(const mint &a, int n) {\\n if (n == 0) return 1;\\n mint t = modpow(a, n / 2);\\n t = t * t;\\n if (n & 1) t = t * a;\\n return t;\\n}\\n\\nint modpow(int x, int n, int mod) {\\n int ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n\\nint ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\n\\n#pragma endregion\\n\\nsigned main() {\\n int N;\\n cin >> N;\\n vector<string> S(N);\\n for (int i = 0; i < N; i++) cin >> S[i];\\n\\n map<string, string> G;\\n map<string, int> outdeg;\\n map<string, int> indeg;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j) continue;\\n if (S[i].back() == S[j][0]) {\\n G[S[i]] = S[j];\\n outdeg[S[i]]++;\\n indeg[S[j]]++;\\n }\\n }\\n }\\n\\n set<char> ans;\\n for (int i = 0; i < N; i++) {\\n if (outdeg[S[i]] == 0) ans.insert(S[i].back());\\n }\\n for (auto &x : ans) {\\n cout << x << endl;\\n }\\n \\n}\",\n \"accuracy\": 0.1794871794871795,\n \"time_ms\": 40,\n \"memory_kb\": 4980,\n \"score_of_the_acc\": -0.0982,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3047_6145604\",\n \"code_snippet\": \"#line 1 \\\"library/me/template.cpp\\\"\\n// This is a dummy line\\n#ifndef ONLINE_JUDGE\\n#define _GLIBCXX_DEBUG\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\\n#define ALL(a) (a).begin(),(a).end()\\n#define END(...) { print(__VA_ARGS__); return; }\\n\\n#ifdef ONLINE_JUDGE\\n#define DBG(...) ;\\n#else\\n#define DBG(a) { cerr << #a << \\\": \\\"; dbg(a); }\\n#endif\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VVVI = vector<VVI>;\\nusing ll = long long;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VVVL = vector<VVL>;\\nusing VD = vector<double>;\\nusing VVD = vector<VD>;\\nusing VVVD = vector<VVD>;\\nusing VS = vector<string>;\\nusing VVS = vector<VS>;\\nusing VVVS = vector<VVS>;\\nusing VC = vector<char>;\\nusing VVC = vector<VC>;\\nusing VVVC = vector<VVC>;\\nusing P = pair<int, int>;\\nusing VP = vector<P>;\\nusing VVP = vector<VP>;\\nusing VVVP = vector<VVP>;\\nusing LP = pair<ll, ll>;\\nusing VLP = vector<LP>;\\nusing VVLP = vector<VLP>;\\nusing VVVLP = vector<VVLP>;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int DX[] = {1, 0, -1, 0};\\nconstexpr int DY[] = {0, 1, 0, -1};\\n\\n#ifdef aclmodint\\n\\nusing MI7 = modint1000000007;\\nusing V7 = vector<MI7>;\\nusing VV7 = vector<V7>;\\nusing VVV7 = vector<VV7>;\\nusing MI3 = modint998244353;\\nusing V3 = vector<MI3>;\\nusing VV3 = vector<V3>;\\nusing VVV3 = vector<VV3>;\\n\\nostream &operator<<(ostream &os, const modint &x) {\\n os << x.val();\\n return os;\\n}\\n\\nostream &operator<<(ostream &os, const MI3 &x) {\\n os << x.val();\\n return os;\\n}\\n\\nostream &operator<<(ostream &os, const MI7 &x) {\\n os << x.val();\\n return os;\\n}\\n\\nistream &operator>>(istream &is, modint &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\nistream &operator>>(istream &is, MI3 &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\nistream &operator>>(istream &is, MI7 &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\n#endif\\n\\nvoid print() { cout << '\\\\n'; }\\ntemplate<typename T>\\nvoid print(const T &t) { cout << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid print(const Head &head, const Tail &... tail) {\\n cout << head << ' ';\\n print(tail...);\\n}\\n\\n#ifdef ONLINE_JUDGE\\ntemplate<typename... Args>\\nvoid dbg(const Args &... args) {}\\n#else\\nvoid dbg() { cerr << '\\\\n'; }\\ntemplate<typename T>\\nvoid dbg(const T &t) { cerr << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid dbg(const Head &head, const Tail &... tail) {\\n cerr << head << ' ';\\n dbg(tail...);\\n}\\n#endif\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 >& p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != (int) v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate <typename T>\\npair<VI, vector<T>> compress(const vector<T> &a) {\\n int n = a.size();\\n vector<T> x;\\n REP(i, n) x.push_back(a[i]);\\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\\n VI res(n);\\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\\n return make_pair(res, x);\\n}\\n\\n#ifdef aclsegtree\\ntemplate<typename S>\\nstruct value_size { S value; int size; };\\n\\ntemplate<typename S>\\nS min_op(S l, S r) { return min(l, r); };\\ntemplate<typename S>\\nS max_op(S l, S r) { return max(l, r); };\\ntemplate<typename S>\\nS sum_op(S l, S r) { return l + r; };\\ntemplate<typename S>\\nvalue_size<S> sum_op_size(value_size<S> l, value_size<S> r) {\\n return {l.value + r.value, l.size + r.size};\\n};\\ntemplate<typename S>\\nvalue_size<S> min_op_size(value_size<S> l, value_size<S> r) {\\n return {min(l.value, r.value), l.size + r.size};\\n};\\ntemplate<typename S>\\nvalue_size<S> max_op_size(value_size<S> l, value_size<S> r) {\\n return {max(l.value, r.value), l.size + r.size};\\n};\\n\\ntemplate<typename S>\\nS min_e() { return numeric_limits<S>::max(); };\\ntemplate<typename S>\\nS max_e() { return numeric_limits<S>::min(); };\\ntemplate<typename S>\\nS sum_e() { return 0; }\\ntemplate<typename S>\\nvalue_size<S> sum_e_size() { return {0, 0}; }\\ntemplate<typename S>\\nvalue_size<S> min_e_size() { return {numeric_limits<S>::max(), 0}; }\\ntemplate<typename S>\\nvalue_size<S> max_e_size() { return {numeric_limits<S>::min(), 0}; }\\n\\ntemplate<typename S, typename F>\\nS chmin_mapping(F f, S x) { return min(x, f); }\\ntemplate<typename S, typename F>\\nS chmax_mapping(F f, S x) { return max(x, f); }\\ntemplate<typename S, typename F>\\nS add_mapping(F f, S x) { return x + f; }\\ntemplate<typename S, typename F>\\nvalue_size<S> add_mapping_size(F f, value_size<S> x) {\\n return {x.value + x.size * f, x.size};\\n}\\n\\ntemplate<typename F>\\nF chmin_composition(F f, F g) { return min(f, g); }\\ntemplate<typename F>\\nF chmax_composition(F f, F g) { return max(f, g); }\\ntemplate<typename F>\\nF add_composition(F f, F g) { return f + g; }\\n\\ntemplate<typename F>\\nF chmin_id() { return numeric_limits<F>::max(); }\\ntemplate<typename F>\\nF chmax_id() { return numeric_limits<F>::min(); }\\ntemplate<typename F>\\nF add_id() { return 0; }\\n\\ntemplate<typename S>\\nusing RSumQ = segtree<S, sum_op<S>, sum_e<S>>;\\ntemplate<typename S>\\nusing RMaxQ = segtree<S, max_op<S>, max_e<S>>;\\ntemplate<typename S>\\nusing RMinQ = segtree<S, min_op<S>, min_e<S>>;\\n\\ntemplate<typename S, typename F>\\nusing RAddSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\\n F, add_mapping_size<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RAddMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RAddMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RMinMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n F, chmin_mapping<S, F>, chmin_composition<F>, chmin_id<F>>;\\ntemplate<typename S, typename F>\\nusing RMaxMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n F, chmax_mapping<S, F>, chmax_composition<F>, chmax_id<F>>;\\n#endif\\n#line 2 \\\"Contests/Dummy/a/main.cpp\\\"\\n/* #define aclmodint */\\n/* #define aclsegtree */\\n/* #include <atcoder/all> */\\n/* using namespace atcoder; */\\n#line 1 \\\"library/atcoder/atcoder/maxflow.hpp\\\"\\n\\n\\n\\n#line 9 \\\"library/atcoder/atcoder/maxflow.hpp\\\"\\n\\n#line 1 \\\"library/atcoder/atcoder/internal_queue.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/atcoder/internal_queue.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 11 \\\"library/atcoder/atcoder/maxflow.hpp\\\"\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n explicit mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\n\\n#line 7 \\\"Contests/Dummy/a/main.cpp\\\"\\nusing namespace atcoder;\\n\\nvoid solve(){\\n int n; cin >> n;\\n VS s(n); cin >> s;\\n VI leave(26);\\n VI sink(26);\\n REP(i, n) {\\n leave[s[i][0] - 'a']++;\\n sink[s[i].back() - 'a']++;\\n }\\n REP(i, 26) {\\n mf_graph<int> mfg(28);\\n REP(j, n) {\\n int from = s[j][0] - 'a';\\n int to = s[j].back() - 'a';\\n if(from == i) from = 26;\\n if(to == i) to = 27;\\n mfg.add_edge(from, to, 1);\\n }\\n if(sink[i] > 0 && mfg.flow(26, 27) == leave[i]) print((char)('a' + i));\\n }\\n}\\n\\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\\nint main() {\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 1;\\n //cin >> t; // comment out if solving multi testcase\\n for(int testCase = 1;testCase <= t;++testCase){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5096,\n \"score_of_the_acc\": -0.0814,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3047_5263465\",\n \"code_snippet\": \"//////////////////////////////\\n// Check before you submit.\\n// #define _ATCODER_LIBRARY\\n\\nconst long long MOD = 1e9+7;\\n// const long long MOD = 998244353;\\n\\n/////////////////////////////\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _ATCODER_LIBRARY\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n// _ATCODER_LIBRARY\\n\\nconst long long INF = 1LL << 60;\\nconst double PI = acos(-1);\\nusing ll = long long;\\nusing P = array<ll, 2>;\\n\\n#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n#define SUM(v) accumulate(ALL(v),0ll)\\n\\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){REP(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;REP(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\\\"\\\\n\\\";REP(i,vv.size())s+=join(vv[i])+\\\"\\\\n\\\";return s;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}\\ntemplate<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v){return o<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";}\\ntemplate<typename T>istream& operator>>(istream&i,array<T,2>&v){i>>v[0]>>v[1]; return i;}\\ntemplate<typename T>ostream& operator<<(ostream&o,array<T,2>&v){return o<<\\\"(\\\"<<v[0]<<\\\",\\\"<<v[1]<<\\\")\\\"; return o;}\\n\\n#define DEBUG(x);\\n\\n#ifdef _DEBUG\\n#define DEBUG(x) std::cerr << #x << \\\" : \\\" << (x) << std::endl;\\n#define GLIBCXX_DEBUG\\n#define GLIBCXX_DEBUG_PEDANTIC\\n#endif\\n// _DEBUG\\n\\nint dx[4]{0, 1, 0, -1};\\nint dy[4]{1, 0, -1, 0};\\n\\nvoid init_init_init() {ios_base::sync_with_stdio(false);cin.tie(NULL);std::cout<<fixed<<setprecision(10);}\\ntemplate<class T>T up(T a, T b){assert(b);return (a+b-1)/b;}\\ntemplate<typename... A>bool eq(A const&... a){auto t={a...};assert(t.size());auto tar=*t.begin();for(const auto&e:t)if(tar!=e)return false;return true;}\\n\\ntemplate<class T>bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\\ntemplate<class T>bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmax(T &a, initializer_list<T>l){return chmax(a,max(l));}\\ntemplate<class T>bool chmin(T &a, initializer_list<T>l){return chmin(a,min(l));}\\n\\n//////////////////////////////////////////////////////////////////\\n// My Library\\n//////////////////////////////////////////////////////////////////\\n\\ntemplate<typename T> class Dinic {\\nprivate:\\n\\tint V;\\n\\tvector<int> level,iter;\\n\\tvoid bfs(int s) {\\n\\t\\tfill(level.begin(),level.end(),-1);\\n\\t\\tqueue<int> que;\\n\\t\\tlevel[s] = 0;\\n\\t\\tque.push(s);\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto& e : G[v]){\\n\\t\\t\\t\\tif(e.cap > 0 && level[e.to] < 0){\\n\\t\\t\\t\\t\\tlevel[e.to] = level[v] + 1;\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tT dfs(int v,int t,T f) {\\n\\t\\tif(v==t){\\n\\t\\t\\treturn f;\\n\\t\\t}\\n\\t\\tfor(int& i = iter[v]; i < (int)G[v].size(); i++){\\n\\t\\t\\tedge& e = G[v][i];\\n\\t\\t\\tif(e.cap > 0 && level[v] < level[e.to]){\\n\\t\\t\\t\\tT d = dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(d > 0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n \\npublic:\\n\\tstruct edge{\\n\\t\\tint to;\\n\\t\\tT cap;\\n\\t\\tint rev;\\n\\t};\\n\\tvector<vector<edge> > G;\\n \\n\\tDinic(int node_size) : V(node_size), level(V), iter(V), G(V){}\\n\\t// Adding edge on a node.\\n\\tvoid add_edge(int from,int to,T cap) {\\n\\t\\tG[from].push_back((edge){to,cap,(int)G[to].size()});\\n\\t\\tG[to].push_back((edge){from,(T)0,(int)G[from].size()-1});\\n\\t}\\n\\t// Calculate the maximum flow.\\n\\tT solve(int s,int t) {\\n\\t\\tT flow = 0;\\n\\t\\tfor(;;){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t] < 0) return flow;\\n\\t\\t\\tfill(iter.begin(),iter.end(),0);\\n\\t\\t\\tT f;\\n\\t\\t\\twhile((f=dfs(s,t,numeric_limits<T>::max())) > 0){\\n\\t\\t\\t\\tflow += f;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\n\\n//////////////////////////////////////////////////////////////////\\n// Contest Code\\n//////////////////////////////////////////////////////////////////\\n\\n\\n\\nint main(int argc, char **argv)\\n{\\n\\tinit_init_init();\\n\\n\\tll N; cin >> N;\\n\\tvector<string> S(N);\\n\\tREP(i, N) cin >> S[i];\\n\\tmap<char, ll> is_last;\\n\\tfor (auto e : S)\\n\\t\\t\\tis_last[e.back()] = true;\\n\\tfor (char c = 'a'; c <= 'z'; ++c)\\n\\t{\\n\\t\\t\\tconst ll start = 26;\\n\\t\\t\\tconst ll goal = 27;\\n\\t\\t\\tDinic<ll> max_flow(28);\\n\\t\\t\\tll cnt{0};\\n\\t\\t\\tll cnt2{0};\\n\\t\\t\\tREP(i, N)\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\tstring s = S[i];\\n\\t\\t\\t\\t\\tll v1, v2;\\n\\t\\t\\t\\t\\tif (s.front() == c)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tv1 = start;\\n\\t\\t\\t\\t\\t\\t\\t++cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tv1 = (ll)(s.front() - 'a');\\n\\t\\t\\t\\t\\tif (s.back() == c)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tv2 = goal;\\n\\t\\t\\t\\t\\t\\t\\t++cnt2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tv2 = (ll)(s.back() - 'a');\\n\\n\\t\\t\\t\\t\\tmax_flow.add_edge(v1, v2, 1);\\n\\t\\t\\t}\\n\\n\\t\\t\\tll tmp = max_flow.solve(start, goal);\\n\\t\\t\\tif (cnt2 and cnt == tmp)\\n\\t\\t\\t\\t\\tstd::cout << c << std::endl;\\n\\t}\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5416,\n \"score_of_the_acc\": -0.0935,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3047_5263448\",\n \"code_snippet\": \"//////////////////////////////\\n// Check before you submit.\\n// #define _ATCODER_LIBRARY\\n\\nconst long long MOD = 1e9+7;\\n// const long long MOD = 998244353;\\n\\n/////////////////////////////\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _ATCODER_LIBRARY\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n// _ATCODER_LIBRARY\\n\\nconst long long INF = 1LL << 60;\\nconst double PI = acos(-1);\\nusing ll = long long;\\nusing P = array<ll, 2>;\\n\\n#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n#define SUM(v) accumulate(ALL(v),0ll)\\n\\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){REP(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;REP(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\\\"\\\\n\\\";REP(i,vv.size())s+=join(vv[i])+\\\"\\\\n\\\";return s;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}\\ntemplate<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v){return o<<\\\"(\\\"<<v.first<<\\\",\\\"<<v.second<<\\\")\\\";}\\ntemplate<typename T>istream& operator>>(istream&i,array<T,2>&v){i>>v[0]>>v[1]; return i;}\\ntemplate<typename T>ostream& operator<<(ostream&o,array<T,2>&v){return o<<\\\"(\\\"<<v[0]<<\\\",\\\"<<v[1]<<\\\")\\\"; return o;}\\n\\n#define DEBUG(x);\\n\\n#ifdef _DEBUG\\n#define DEBUG(x) std::cerr << #x << \\\" : \\\" << (x) << std::endl;\\n#define GLIBCXX_DEBUG\\n#define GLIBCXX_DEBUG_PEDANTIC\\n#endif\\n// _DEBUG\\n\\nint dx[4]{0, 1, 0, -1};\\nint dy[4]{1, 0, -1, 0};\\n\\nvoid init_init_init() {ios_base::sync_with_stdio(false);cin.tie(NULL);std::cout<<fixed<<setprecision(10);}\\ntemplate<class T>T up(T a, T b){assert(b);return (a+b-1)/b;}\\ntemplate<typename... A>bool eq(A const&... a){auto t={a...};assert(t.size());auto tar=*t.begin();for(const auto&e:t)if(tar!=e)return false;return true;}\\n\\ntemplate<class T>bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\\ntemplate<class T>bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmax(T &a, initializer_list<T>l){return chmax(a,max(l));}\\ntemplate<class T>bool chmin(T &a, initializer_list<T>l){return chmin(a,min(l));}\\n\\n//////////////////////////////////////////////////////////////////\\n// My Library\\n//////////////////////////////////////////////////////////////////\\n\\ntemplate<typename T> class Dinic {\\nprivate:\\n\\tint V;\\n\\tvector<int> level,iter;\\n\\tvoid bfs(int s) {\\n\\t\\tfill(level.begin(),level.end(),-1);\\n\\t\\tqueue<int> que;\\n\\t\\tlevel[s] = 0;\\n\\t\\tque.push(s);\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto& e : G[v]){\\n\\t\\t\\t\\tif(e.cap > 0 && level[e.to] < 0){\\n\\t\\t\\t\\t\\tlevel[e.to] = level[v] + 1;\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tT dfs(int v,int t,T f) {\\n\\t\\tif(v==t){\\n\\t\\t\\treturn f;\\n\\t\\t}\\n\\t\\tfor(int& i = iter[v]; i < (int)G[v].size(); i++){\\n\\t\\t\\tedge& e = G[v][i];\\n\\t\\t\\tif(e.cap > 0 && level[v] < level[e.to]){\\n\\t\\t\\t\\tT d = dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(d > 0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n \\npublic:\\n\\tstruct edge{\\n\\t\\tint to;\\n\\t\\tT cap;\\n\\t\\tint rev;\\n\\t};\\n\\tvector<vector<edge> > G;\\n \\n\\tDinic(int node_size) : V(node_size), level(V), iter(V), G(V){}\\n\\t// Adding edge on a node.\\n\\tvoid add_edge(int from,int to,T cap) {\\n\\t\\tG[from].push_back((edge){to,cap,(int)G[to].size()});\\n\\t\\tG[to].push_back((edge){from,(T)0,(int)G[from].size()-1});\\n\\t}\\n\\t// Calculate the maximum flow.\\n\\tT solve(int s,int t) {\\n\\t\\tT flow = 0;\\n\\t\\tfor(;;){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t] < 0) return flow;\\n\\t\\t\\tfill(iter.begin(),iter.end(),0);\\n\\t\\t\\tT f;\\n\\t\\t\\twhile((f=dfs(s,t,numeric_limits<T>::max())) > 0){\\n\\t\\t\\t\\tflow += f;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\n\\n//////////////////////////////////////////////////////////////////\\n// Contest Code\\n//////////////////////////////////////////////////////////////////\\n\\n\\n\\nint main(int argc, char **argv)\\n{\\n\\tinit_init_init();\\n\\n\\tll N; cin >> N;\\n\\tvector<string> S(N);\\n\\tREP(i, N) cin >> S[i];\\n\\tmap<char, ll> is_last;\\n\\tfor (auto e : S)\\n\\t\\t\\tis_last[e.back()] = true;\\n\\tfor (char c = 'a'; c <= 'z'; ++c)\\n\\t{\\n\\t\\t\\tconst ll start = 26;\\n\\t\\t\\tconst ll goal = 27;\\n\\t\\t\\tDinic<ll> max_flow(28);\\n\\t\\t\\tll cnt{0};\\n\\t\\t\\tll cnt2{0};\\n\\t\\t\\tREP(i, N)\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\tstring s = S[i];\\n\\t\\t\\t\\t\\tll v1, v2;\\n\\t\\t\\t\\t\\tif (s.front() == c)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tv1 = start;\\n\\t\\t\\t\\t\\t\\t\\t++cnt;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tv1 = (ll)(s.front() - 'a');\\n\\t\\t\\t\\t\\tif (s.back() == c)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tv2 = goal;\\n\\t\\t\\t\\t\\t\\t\\t++cnt2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tv2 = (ll)(s.back() - 'a');\\n\\n\\t\\t\\t\\t\\tmax_flow.add_edge(v1, v2, 1);\\n\\t\\t\\t}\\n\\n\\t\\t\\tll tmp = max_flow.solve(start, goal);\\n\\t\\t\\tif (cnt2 and tmp == cnt)\\n\\t\\t\\t\\t\\tstd::cout << c << std::endl;\\n\\t}\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5368,\n \"score_of_the_acc\": -0.0917,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3047_4849083\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\n#include <algorithm>\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n g[from].push_back(_edge{to, int(g[to].size()), cap});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\n#define int long long\\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 FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)\\n#define ALL(a) a.begin(), a.end()\\n#define IN(a, x, b) (a <= x && x < b)\\ntemplate<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}\\ntemplate<class T>inline void out(T t){cout << t << \\\"\\\\n\\\";}\\ntemplate<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << \\\" \\\";out(ts...);}\\ntemplate<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}\\nconstexpr int INF = 1e18;\\n\\n\\n\\nsigned main(){\\n\\tint N;\\n\\tcin >> N;\\n\\tvector<string>s(N);\\n\\tcin >> s;\\n\\tREP(i, 26) {\\n\\t\\tmf_graph<int>graph(28);\\n\\t\\tint S = 26, T = 27;\\n\\t\\tint degOut = 0, degIn = 0;\\n\\t\\tREP(j, N) {\\n\\t\\t\\tint u = s[j][0] - 'a';\\n\\t\\t\\tint v = s[j].back() - 'a';\\n\\t\\t\\tif(u == i) {\\n\\t\\t\\t\\tu = S;\\n\\t\\t\\t\\t++degOut;\\n\\t\\t\\t}\\n\\t\\t\\tif(v == i) {\\n\\t\\t\\t\\tv = T;\\n\\t\\t\\t\\t++degIn;\\n\\t\\t\\t}\\n\\t\\t\\tgraph.add_edge(u, v, 1);\\n\\t\\t}\\n\\t\\tint f = graph.flow(S, T);\\n\\t\\tif(f >= degOut && degIn > 0) out(char('a' + i));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5540,\n \"score_of_the_acc\": -0.0982,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3047_4810309\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n#define rep(i, n) for(int i=0; i<n; ++i)\\n#define all(v) v.begin(), v.end()\\n#define rall(v) v.rbegin(), v.rend()\\nusing namespace std;\\nusing ll = int64_t;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vs = vector<string>;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\ntemplate<class T> using PQ = priority_queue<T>;\\ntemplate<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;\\nconst int INF = 0xccccccc;\\nconst ll LINF = 922337203685477580LL;\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}\\ntemplate<typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}\\n\\nstruct edge{\\n int to, rev;\\n int64_t cap;\\n edge(int t=0, int64_t c=0, int r=0):to(t), cap(c), rev(r) {}\\n};\\n\\nstruct max_flow {\\n vector<vector<edge> > G;\\n vector<int> level, iter;\\n int n;\\n max_flow(int n=0):n(n), G(n), level(n), iter(n) {}\\n inline void add(int from, int to, int64_t cap) {\\n G[from].emplace_back(to, cap, G[to].size());\\n G[to].emplace_back(from, 0, G[from].size()-1);\\n }\\n void bfs(int s) {\\n for(int i = 0; i < n; i++) level[i] = -1;\\n queue<int> que;\\n level[s] = 0;\\n que.emplace(s);\\n while(!que.empty()) {\\n int now = que.front();\\n que.pop();\\n for(edge &e:G[now]) {\\n if(e.cap > 0 and level[e.to] < 0) {\\n level[e.to] = level[now] + 1;\\n que.emplace(e.to);\\n }\\n }\\n }\\n }\\n int64_t dfs(int v, int t, int64_t f) {\\n if(v == t) return f;\\n for(int &i = iter[v]; i < G[v].size(); i++) {\\n edge &e = G[v][i];\\n if(e.cap > 0 and level[v] < level[e.to]) {\\n int64_t d = dfs(e.to, t, min(f, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n int64_t Dinic(int s, int t) {\\n int64_t flow = 0;\\n while(true) {\\n bfs(s);\\n if(level[t] < 0) return flow;\\n for(int i = 0; i < n; i++) iter[i] = 0;\\n int64_t f;\\n while((f = dfs(s, t, INT64_MAX)) > 0) flow += f;\\n }\\n }\\n};\\n#define N 10010\\n\\n//head\\n\\nint n;\\nstring s[N];\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cin >> n;\\n rep(i, n) cin >> s[i];\\n rep(i, 26) {\\n max_flow mfl(28);\\n const int ss = 27, tt = 26;\\n int cnt = 0;\\n bool back = false;\\n rep(j, n) {\\n int from = s[j][0]-'a', to = s[j][s[j].size()-1]-'a';\\n if(from == i) {from = ss; cnt++;}\\n if(to == i) {to = tt; back = true;}\\n mfl.add(from, to, 1);\\n }\\n if(mfl.Dinic(ss, tt) == cnt and back) cout << char('a'+i) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4984,\n \"score_of_the_acc\": -0.0665,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3047_4776985\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n#define rep2(i, x, n) for(int i = x; i <= n; i++)\\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\\n#define elif else if\\n#define sp(x) fixed << setprecision(x)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)x.size()\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\nconst ll MOD = 1e9+7;\\n//const ll MOD = 998244353;\\nconst int inf = (1<<30)-1;\\nconst ll INF = (1LL<<60)-1;\\nconst ld EPS = 1e-10;\\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\\n\\ntemplate<typename T>\\nstruct Max_Flow{\\n struct edge{\\n int to; T cap; int rev;\\n edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}\\n };\\n\\n vector<vector<edge>> es;\\n vector<bool> used;\\n const T INF_T;\\n\\n Max_Flow(int n) : INF_T(numeric_limits<T>::max()){\\n es.resize(n), used.resize(n);\\n }\\n\\n void add_edge(int from, int to, T cap, bool directed = true){\\n es[from].eb(to, cap, sz(es[to]));\\n es[to].eb(from, directed? 0 : cap, sz(es[from])-1);\\n }\\n\\n T dfs(int now, int t, T flow){\\n if(now == t) return flow;\\n used[now] = true;\\n for(auto &e: es[now]){\\n if(!used[e.to] && e.cap > 0){\\n T f = dfs(e.to, t, min(flow, e.cap));\\n if(f > 0){\\n e.cap -= f;\\n es[e.to][e.rev].cap += f;\\n return f;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n T max_flow(int s, int t){\\n T flow = 0;\\n for(;;){\\n fill(all(used), false);\\n T f = dfs(s, t, INF_T);\\n if(f == 0) return flow;\\n flow += f;\\n }\\n }\\n};\\n\\nint main(){\\n int N;\\n cin >> N;\\n string S[N];\\n rep(i, N) cin >> S[i];\\n rep(i, 26){\\n Max_Flow<int> G(28);\\n int s = 26, t = 27;\\n int in = 0, out = 0;\\n rep(j, N){\\n int u = S[j].front()-'a', v = S[j].back()-'a';\\n if(u == i) u = s, out++;\\n if(v == i) v = t, in++;\\n G.add_edge(u, v, 1);\\n }\\n if(G.max_flow(s, t) == out && in) cout << char('a'+i) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5248,\n \"score_of_the_acc\": -0.1403,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3047_4373224\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define pb push_back\\n#define INF 1000000000\\n\\nstruct max_flow\\n{\\n int V;\\n struct edge{int to,cap,rev;};\\n using Graph=vector<vector<edge>>;\\n Graph graph;\\n vector<bool> visit;\\npublic:\\n max_flow(int n) //与えられた頂点は別にスタートとシンクを設定する場合\\n {\\n V=n;\\n graph.resize(V+2,vector<edge> ());\\n visit.resize(V+2,false);\\n }\\n\\n void add_edge(int from,int to, int cap)\\n {\\n graph[from].pb((edge){to,cap,(int)graph[to].size()});\\n graph[to].pb((edge){from,0,(int)graph[from].size()-1});\\n return ;\\n }\\n\\n int dfs(int s, int t, int f)\\n {\\n if (s==t) return f;\\n visit[s]=true;\\n for (int i=0;i<graph[s].size();i++)\\n {\\n edge &e=graph[s][i];\\n if (!visit[e.to] && e.cap>0)\\n {\\n int d=dfs(e.to,t,min(f,e.cap));\\n if (d>0)\\n {\\n e.cap-=d;\\n graph[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n int run(int s,int t)\\n {\\n int flow=0;\\n for (;;) //while文\\n {\\n for (int i=0;i<V+2;i++) visit[i]=false;//memsetは初期化\\n int f=dfs(s,t,INF);\\n if (f==0) return flow;\\n else flow+=f;\\n }\\n }\\n};\\n\\nint main()\\n{\\n int N; cin >> N;\\n int cnt[28][28];string input;\\n for (int i=0;i<27;i++)\\n for (int j=0;j<27;j++) cnt[i][j]=0;\\n for (int i=0;i<N;i++)\\n {\\n cin >> input;\\n cnt[(int)input[0]-'a'][(int)input[input.size()-1]-'a']++;\\n }\\n vector<char> ans;\\n for (int s=0;s<26;s++)\\n {\\n max_flow solve(26);\\n for (int i=0;i<26;i++)\\n {\\n if (i!=s)\\n {\\n for (int j=0;j<26;j++)\\n {\\n if (j!=s && cnt[i][j]>0 &&i!=j) solve.add_edge(i+1,j+1,cnt[i][j]);\\n }\\n }\\n else continue;\\n }\\n int sum=0;\\n bool ok=false;\\n if (cnt[s][s]>0) {ok=true;solve.add_edge(0,27,cnt[s][s]);}\\n for (int i=0;i<26;i++)\\n {\\n sum+=cnt[s][i];\\n if (cnt[s][i]>0 && i!=s ) solve.add_edge(0,i+1,cnt[s][i]);\\n if (cnt[i][s]>0 && i!=s) {solve.add_edge(i+1,27,cnt[i][s]);ok=true;}\\n }\\n if (solve.run(0,27)==sum && ok)\\n {\\n char a='a'+s;\\n ans.pb(a);\\n }\\n }\\n for (int i=0;i<ans.size();i++) cout << ans[i] << endl;\\nreturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -0.0213,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3047_4344893\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define enld '\\\\n'\\n#define rep(i,n) for(int i=0; i<(n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr double INFD = 1e100;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst double PI = 3.1415926535897932384626433832795028841971;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n// ios::sync_with_stdio(false);\\n// cin.tie(nullptr);\\n// ---------------------------------------------------------------------------\\n\\n\\n#define MAX_V 1000000\\nstruct edge{\\n int to,cap,rev;\\n};\\n\\nvector<vector<edge>> G(MAX_V);\\nbool used[MAX_V];\\n\\nvoid add_edge(int from,int to,int cap){\\n edge F;\\n edge T;\\n F.to = to;\\n F.cap = cap;\\n F.rev = G[to].size();\\n G[from].push_back(F);\\n\\n T.to = from;\\n T.cap = 0;\\n T.rev = G[from].size()-1;\\n G[to].push_back(T);\\n}\\n\\nint dfs(int v,int t,int f){\\n if(v == t) return f;\\n used[v] = true;\\n for(int i=0; i<G[v].size(); i++){\\n edge &e = G[v][i];\\n if(!used[e.to] and e.cap > 0){\\n int d = dfs(e.to,t,min(f,e.cap));\\n if(d > 0){\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint max_flow(int s,int t){\\n int flow = 0;\\n while(1){\\n memset(used, 0, sizeof(used));\\n int f = dfs(s,t,inf);\\n if(f == 0) return flow;\\n flow += f;\\n }\\n}\\n\\n\\nint main(){\\n int N;\\n cin >> N;\\n vector<string> S(N);\\n for(int i=0; i<N; i++){\\n cin >> S[i];\\n }\\n vector<bool> last(26,false);\\n for(int i=0; i<N; i++){\\n last[S[i].back()-'a'] = true;\\n }\\n for(int c=0; c<26; c++){\\n if(!last[c]) continue;\\n int s=26,t=27;\\n int cnt = 0;\\n memset(used,0,sizeof(used));\\n for(int i=0; i<30; i++){\\n G[i].clear();\\n }\\n for(int i=0; i<N; i++){\\n int u = (S[i].front() == c+'a') ? s : (S[i].front()-'a');\\n int v = (S[i].back() == c+'a') ? t : (S[i].back()-'a');\\n // cout << u << \\\" \\\" << v << enld;\\n add_edge(u,v,1);\\n if(S[i].front() == c+'a') cnt++; \\n }\\n // cout << G[s].size() << enld;\\n int flow = max_flow(s,t);\\n // cout << \\\"check:\\\" << char(c+'a') << \\\" \\\" << flow << \\\" \\\" << cnt << enld;\\n if(flow == cnt){\\n cout << char(c+'a') << enld;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 29584,\n \"score_of_the_acc\": -1.3617,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3047_4322747\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<typename flow_t>\\nstruct Dinic {\\n struct Edge {\\n int to; flow_t cap; int rev; bool isrev;\\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\\n };\\n const flow_t INF;\\n vector<vector<Edge>> g;\\n vector<int> min_cost, iter;\\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\\n void add_edge(int from, int to, flow_t cap) {\\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\\n }\\n bool bfs(int s, int t) {\\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\\n queue<int> que; que.emplace(s);\\n while (!que.empty() && min_cost[t] == -1) {\\n int v = que.front(); que.pop();\\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.emplace(e.to);\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n flow_t dfs(int v, int t, flow_t flow) {\\n if (v == t) return flow;\\n for (int &i = iter[v]; i < (int)g[v].size(); i++) {\\n Edge &e = g[v][i];\\n if (e.cap > 0 && min_cost[v] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if (d > 0) {\\n e.cap -= d, g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while (bfs(s, t)) {\\n iter.assign(g.size(), 0);\\n flow_t f = 0;\\n while ((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n friend ostream& operator<<(ostream& os, Dinic& mf) {\\n for (int i = 0; i < (int)mf.g.size(); i++) {\\n for (auto &e: mf.g[i]) if (!e.isrev) {\\n auto &rev_e = mf.g[e.to][e.rev];\\n os << i << \\\" -> \\\" << e.to << \\\" (flow: \\\";\\n os << rev_e.cap << \\\" / \\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nint main() {\\n int n; cin >> n;\\n vector<string> ss(n);\\n for (auto &si: ss) cin >> si;\\n string ans;\\n for (int c = 0; c < 26; c++) {\\n Dinic<int> mf(26 + 2);\\n int s = 26, t = s + 1;\\n int deg_out = 0, deg_in = 0;\\n for (auto &si: ss) {\\n int u = si.front() - 'a', v = si.back() - 'a';\\n if (u == c) u = s, deg_out++;\\n if (v == c) v = t, deg_in++;\\n mf.add_edge(u, v, 1);\\n }\\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\\n }\\n for (char c: ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5360,\n \"score_of_the_acc\": -0.102,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3047_4322730\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<typename flow_t>\\nstruct Dinic {\\n struct Edge {\\n int to; flow_t cap; int rev; bool isrev;\\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\\n };\\n const flow_t INF;\\n vector<vector<Edge>> g;\\n vector<int> min_cost, iter;\\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\\n void add_edge(int from, int to, flow_t cap) {\\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\\n }\\n bool bfs(int s, int t) {\\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\\n queue<int> que; que.emplace(s);\\n while (!que.empty() && min_cost[t] == -1) {\\n int v = que.front(); que.pop();\\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.emplace(e.to);\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n flow_t dfs(int v, int t, flow_t flow) {\\n if (v == t) return flow;\\n for (int i = iter[v]; i < (int)g[v].size(); i++) {\\n Edge &e = g[v][i];\\n if (e.cap > 0 && min_cost[v] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if (d > 0) {\\n e.cap -= d, g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while (bfs(s, t)) {\\n iter.assign(g.size(), 0);\\n flow_t f = 0;\\n while ((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n};\\n\\nint main() {\\n int n; cin >> n;\\n vector<string> ss(n);\\n for (auto &si: ss) cin >> si;\\n string ans;\\n for (int c = 0; c < 26; c++) {\\n Dinic<int> mf(26 + 2);\\n int s = 26, t = s + 1;\\n int deg_out = 0, deg_in = 0;\\n for (auto &si: ss) {\\n int u = si.front() - 'a', v = si.back() - 'a';\\n if (u == c) u = s, deg_out++;\\n if (v == c) v = t, deg_in++;\\n mf.add_edge(u, v, 1);\\n }\\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\\n }\\n for (char c: ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 5320,\n \"score_of_the_acc\": -1.058,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3047_4322712\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<typename flow_t>\\nstruct Dinic {\\n struct Edge {\\n int to; flow_t cap; int rev; bool isrev;\\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\\n };\\n const flow_t INF;\\n vector<vector<Edge>> g;\\n vector<int> min_cost, iter;\\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\\n void add_edge(int from, int to, flow_t cap) {\\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\\n }\\n bool bfs(int s, int t) {\\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\\n queue<int> que; que.emplace(s);\\n while (!que.empty() && min_cost[t] == -1) {\\n int v = que.front(); que.pop();\\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.emplace(e.to);\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n flow_t dfs(int idx, int t, flow_t flow) {\\n if (idx == t) return flow;\\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\\n Edge &e = g[idx][i];\\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if (d > 0) {\\n e.cap -= d, g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while (bfs(s, t)) {\\n iter.assign(g.size(), 0);\\n flow_t f = 0;\\n while ((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n friend ostream& operator<<(ostream& os, Dinic& mf) {\\n for (int i = 0; i < (int)mf.g.size(); i++) {\\n for (auto &e: mf.g[i]) if (!e.isrev) {\\n auto &rev_e = mf.g[e.to][e.rev];\\n os << i << \\\" -> \\\" << e.to << \\\" (flow: \\\";\\n os << rev_e.cap << \\\" / \\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nint main() {\\n int n; cin >> n;\\n vector<string> ss(n);\\n for (auto &si: ss) cin >> si;\\n for (int c = 0; c < 26; c++) {\\n Dinic<int> mf(26 + 2);\\n int s = 26, t = s + 1;\\n int deg_out = 0, deg_in = 0;\\n for (auto &si: ss) {\\n int u = si.front() - 'a', v = si.back() - 'a';\\n if (u == c) u = s, deg_out++;\\n if (v == c) v = t, deg_in++;\\n mf.add_edge(u, v, 1);\\n }\\n if (deg_in && mf.max_flow(s, t) == deg_out) cout << char('a' + c) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 5336,\n \"score_of_the_acc\": -1.0586,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3047_4322703\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<typename flow_t>\\nstruct Dinic {\\n struct Edge {\\n int to; flow_t cap; int rev; bool isrev;\\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\\n };\\n const flow_t INF;\\n vector<vector<Edge>> g;\\n vector<int> min_cost, iter;\\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n), min_cost(n) { }\\n void add_edge(int from, int to, flow_t cap) {\\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\\n }\\n bool bfs(int s, int t) {\\n fill(begin(min_cost), end(min_cost), -1), min_cost[s] = 0;\\n queue<int> que; que.emplace(s);\\n while (!que.empty() && min_cost[t] == -1) {\\n int v = que.front(); que.pop();\\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.emplace(e.to);\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n flow_t dfs(int idx, int t, flow_t flow) {\\n if (idx == t) return flow;\\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\\n Edge &e = g[idx][i];\\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if (d > 0) {\\n e.cap -= d, g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while (bfs(s, t)) {\\n iter.assign(g.size(), 0);\\n flow_t f = 0;\\n while ((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n friend ostream& operator<<(ostream& os, Dinic& mf) {\\n for (int i = 0; i < (int)mf.g.size(); i++) {\\n for (auto &e: mf.g[i]) if (!e.isrev) {\\n auto &rev_e = mf.g[e.to][e.rev];\\n os << i << \\\" -> \\\" << e.to << \\\" (flow: \\\";\\n os << rev_e.cap << \\\" / \\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nint main() {\\n int n; cin >> n;\\n vector<string> ss(n);\\n for (auto &si: ss) cin >> si;\\n string ans;\\n for (int c = 0; c < 26; c++) {\\n Dinic<int> mf(28);\\n int s = 26, t = s + 1;\\n int deg_out = 0, deg_in = 0;\\n for (auto &si: ss) {\\n int u = si.front() - 'a', v = si.back() - 'a';\\n if (u == c) u = s, deg_out++;\\n if (v == c) v = t, deg_in++;\\n mf.add_edge(u, v, 1);\\n }\\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\\n }\\n for (char c: ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 950,\n \"memory_kb\": 5348,\n \"score_of_the_acc\": -1.0803,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3047_4322700\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<typename flow_t>\\nstruct Dinic {\\n struct Edge {\\n int to; flow_t cap; int rev; bool isrev;\\n Edge(int t, flow_t c, int r, bool b) : to(t), cap(c), rev(r), isrev(b) { }\\n };\\n const flow_t INF;\\n vector<vector<Edge>> g;\\n vector<int> min_cost, iter;\\n Dinic(int n) : INF(numeric_limits<flow_t>::max()), g(n) { }\\n void add_edge(int from, int to, flow_t cap) {\\n g[from].emplace_back(Edge(to, cap, g[to].size(), false));\\n g[to].emplace_back(Edge(from, 0, g[from].size() - 1, true));\\n }\\n bool bfs(int s, int t) {\\n min_cost.assign(g.size(), -1); min_cost[s] = 0;\\n queue<int> que; que.emplace(s);\\n while (!que.empty() && min_cost[t] == -1) {\\n int v = que.front(); que.pop();\\n for (auto &e: g[v]) if (e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.emplace(e.to);\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n flow_t dfs(int idx, int t, flow_t flow) {\\n if (idx == t) return flow;\\n for (int i = iter[idx]; i < (int)g[idx].size(); i++) {\\n Edge &e = g[idx][i];\\n if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if (d > 0) {\\n e.cap -= d, g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while (bfs(s, t)) {\\n iter.assign(g.size(), 0);\\n flow_t f = 0;\\n while ((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n friend ostream& operator<<(ostream& os, Dinic& mf) {\\n for (int i = 0; i < (int)mf.g.size(); i++) {\\n for (auto &e: mf.g[i]) if (!e.isrev) {\\n auto &rev_e = mf.g[e.to][e.rev];\\n os << i << \\\" -> \\\" << e.to << \\\" (flow: \\\";\\n os << rev_e.cap << \\\" / \\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n return os;\\n }\\n};\\n\\nint main() {\\n int n; cin >> n;\\n vector<string> ss(n);\\n for (auto &si: ss) cin >> si;\\n string ans;\\n for (int c = 0; c < 26; c++) {\\n Dinic<int> mf(28);\\n int s = 26, t = s + 1;\\n int deg_out = 0, deg_in = 0;\\n for (auto &si: ss) {\\n int u = si.front() - 'a', v = si.back() - 'a';\\n if (u == c) u = s, deg_out++;\\n if (v == c) v = t, deg_in++;\\n mf.add_edge(u, v, 1);\\n }\\n if (deg_in && mf.max_flow(s, t) == deg_out) ans += 'a' + c;\\n }\\n for (char c: ans) cout << c << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 5412,\n \"score_of_the_acc\": -1.0508,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1890,"cells":{"group_id":{"kind":"string","value":"aoj_3049_cpp"},"problem_description":{"kind":"string","value":"Problem K: A Polygon And Circles\nProblem\n$N$個の頂点からなる凸多角形と$M$個の円の中心座標が与えられる。すべての円の半径は$r$である。\n以下の条件を満たす最小の実数$r$を求めたい。\n条件: 凸多角形の内部のどの点も、少なくとも一つ以上の円に内包されている。\nInput\n入力は以下の形式ですべて整数で与えられる。\n$N$\n$px_1$ $py_1$\n$px_2$ $py_2$\n:\n$px_N$ $py_N$\n$M$\n$cx_1$ $cy_1$\n$cx_2$ $cy_2$\n:\n$cx_M$ $cy_M$\n$1$行目には凸多角形の頂点数を表す整数$N$が与えられる。\n$2$行目から$2+N-1$行目には凸多角形の各頂点の情報が反時計周りの順で与えられる。$1+i$行目には$i$番目の頂点の座標を表す$px_i$ $py_i$が空白区切りで与えられる。\n$2+N$行目には円の数を表す整数$M$が与えられる。\n$2+N+1$行目から$2+N+M$行には円の中心座標の情報が与えられる。$2+N+i$行目には$i$番目の円の中心座標を表す$cx_i$ $cy_i$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$3 \\le N \\le 100$\n$1 \\le M \\le 100$\n$-10^5 \\le px_i, py_i \\le 10^5$\n$-10^5 \\le cx_i, cy_i \\le 10^5$\n凸多角形の頂点のうちどの3点を選んでも、同一直線上には存在しない\nOutput\n条件を満たす最小の円の半径 $r$ を出力する。\nただし、$10^{-5}$ までの絶対誤差または相対誤差は許容される。\nSample Input 1\n4\n2 3\n1 2\n2 1\n3 2\n4\n1 3\n1 1\n3 3\n3 1\nSample Output 1\n1.414213562373\nSample Input 2\n7\n-96469 25422\n-55204 -45592\n-29140 -72981\n98837 -86795\n92303 63297\n19059 96012\n-67980 70342\n17\n-4265 -14331\n33561 72343\n52055 98952\n-71189 60872\n10459 -7512\n-11981 57756\n-78228 -28044\n37397 -69980\n-27527 -51966\n22661 -16694\n13759 -59976\n86539 -47703\n17098 31709\n-62497 -70998\n-57608 59799\n-1904 -35574\n-73860 121\nSample Output 2\n75307.220122044484"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3049_3159241","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\ntypedef double P_type;\ntypedef complex<P_type> P;\nconst P_type P_eps = 1e-9; //整数の時はゼロ\n\nnamespace std{\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\n }\n};\n\nP rotate(P p, double theta){\n return p * P(cos(theta), sin(theta));\n}\n\n//内積\nP_type dot(P a, P b) {\n return (a * conj(b)).real();\n}\n\n//外積\nP_type cross(P a, P b) {\n return (conj(a) * b).imag();\n}\n\n//反時計回り\nint ccw(P a, P b, P c){\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\n return 0; //a -> c -> b\n}\n\n/* 線分abと点cの距離 */\nP_type distanceSP(P a, P b, P c) {\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 直線abと点cの距離 */\nP_type distanceLP(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 円の点包含判定 */\nbool isContainedCP(P c, double r, P p){\n return abs(c-p) < r - P_eps; //円周上を含まない\n //return abs(c-p) < r + P_eps; //円周上を含む\n}\n\n/* 直線交差判定 */\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\n return abs(cross(a1-a2, b1-b2)) > P_eps;\n}\n\n/* 線分交差判定 */\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\n \n //線分a と 直線b\n int a = ccw(b1,b2,a1);\n int b = ccw(b1,b2,a2);\n \n //線分b と 直線a\n int c = ccw(a1,a2,b1);\n int d = ccw(a1,a2,b2);\n \n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\n}\n\n/* 直線線分交差判定 */\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \n int a = ccw(a1,a2,b1);\n int b = ccw(a1,a2,b2);\n \n // 直線上のとき a or b = 0 or -2 or 2\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\n}\n\n/* 円交差判定 */\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\n double dist = abs(c1 - c2);\n \n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\n}\n\n/* 円直線交差判定 */\nbool isIntersectedCL(P c, double r, P a1, P a2){\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 円線分交差判定 */\nbool isIntersectedCS(P c, double r, P a1, P a2){\n return isContainedCP(c,r,a1) &&\n isContainedCP(c,r,a2) &&\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 直線/線分交点 */\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\n //assert(isIntersectedLL(a1, a2, b1, b2));\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nP getCrosspointSS(P a1, P a2, P b1, P b2){\n //assert(isIntersectedSS(a1, a2, b1, b2));\n return getCrosspointLL(a1, a2, b1, b2);\n}\n\n/* 円交点 */\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\n //assert(isIntersectedCC(c1, r1, c2, r2));\n \n double dist = abs(c1 - c2);\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\n}\n\n/* 円線分交点 */\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\n //assert(isIntersectedCS(c1, r1, c2, r2));\n \n P base1 = a2 - a1;\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\n P e = (a2 - a1) / abs(a2 - a1);\n P base2 = sqrt(r*r - norm(proj - c));\n return {proj + e*base2, proj - e*base2};\n}\n\n/* 多角形-点包含 */\nbool iscontainedPolyP(vector<P> &g, P p){\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\n }\n return f; //内部 or 外部\n}\n\n/* 射影(直線abとpからの垂線との交点) */\nP getProject(P a, P b, P p){\n P base = b - a;\n return a + base * dot(p - a, base) / norm(base);\n}\n\n/* 反射(直線abを対称軸としたpの線対称の位置) */\nP getReflection(P a, P b, P p){\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\n}\n\n\nint main(){\n int n, m, x, y;\n P pxy[101], cxy[101];\n vector<P> pol;\n\n scanf(\"%d\", &n);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\", &x, &y);\n pxy[i] = P(x, y);\n pol.push_back(pxy[i]);\n }\n pxy[n] = pxy[0];\n \n\n scanf(\"%d\", &m);\n \n for(int i=0;i<m;i++){\n scanf(\"%d%d\", &x, &y);\n cxy[i] = P(x, y);\n }\n\n P_type l = 0, r = 1e6;\n\n P_type epseps = 1e-8;\n \n while(abs(l-r) > 2e-6){\n P_type R = (l+r)/2;\n vector<P> vec; \n \n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\n\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + e * (P_type)-1);\n //vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n P_type mone = -1;\n\n for(int j=0;j<n;j++){\n\n for(int i=0;i<m;i++){\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n auto em = e*mone;\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + em);\n //vec.push_back(gc.second + e);\n vec.push_back(gc.second + em);\n }\n }\n\n bool res = true;\n \n for(int i=0;i<vec.size() && res;i++){\n if(iscontainedPolyP(pol, vec[i])){\n\n bool f = false;\n for(int j=0;j<m && !f;j++){\n f |= isContainedCP(cxy[j], R, vec[i]);\n }\n\n res &= f;\n }\n }\n\n if(res){\n r = R;\n }else{\n l = R;\n }\n }\n\n printf(\"%.10lf\\n\", (double)l);\n \n \n return 0;\n}","accuracy":0.35714285714285715,"time_ms":20,"memory_kb":3860,"score_of_the_acc":-0.0924,"final_rank":16},{"submission_id":"aoj_3049_3159239","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\ntypedef double P_type;\ntypedef complex<P_type> P;\nconst P_type P_eps = 1e-9; //整数の時はゼロ\n\nnamespace std{\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\n }\n};\n\nP rotate(P p, double theta){\n return p * P(cos(theta), sin(theta));\n}\n\n//内積\nP_type dot(P a, P b) {\n return (a * conj(b)).real();\n}\n\n//外積\nP_type cross(P a, P b) {\n return (conj(a) * b).imag();\n}\n\n//反時計回り\nint ccw(P a, P b, P c){\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\n return 0; //a -> c -> b\n}\n\n/* 線分abと点cの距離 */\nP_type distanceSP(P a, P b, P c) {\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 直線abと点cの距離 */\nP_type distanceLP(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 円の点包含判定 */\nbool isContainedCP(P c, double r, P p){\n return abs(c-p) < r - P_eps; //円周上を含まない\n //return abs(c-p) < r + P_eps; //円周上を含む\n}\n\n/* 直線交差判定 */\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\n return abs(cross(a1-a2, b1-b2)) > P_eps;\n}\n\n/* 線分交差判定 */\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\n \n //線分a と 直線b\n int a = ccw(b1,b2,a1);\n int b = ccw(b1,b2,a2);\n \n //線分b と 直線a\n int c = ccw(a1,a2,b1);\n int d = ccw(a1,a2,b2);\n \n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\n}\n\n/* 直線線分交差判定 */\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \n int a = ccw(a1,a2,b1);\n int b = ccw(a1,a2,b2);\n \n // 直線上のとき a or b = 0 or -2 or 2\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\n}\n\n/* 円交差判定 */\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\n double dist = abs(c1 - c2);\n \n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\n}\n\n/* 円直線交差判定 */\nbool isIntersectedCL(P c, double r, P a1, P a2){\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 円線分交差判定 */\nbool isIntersectedCS(P c, double r, P a1, P a2){\n return isContainedCP(c,r,a1) &&\n isContainedCP(c,r,a2) &&\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 直線/線分交点 */\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\n //assert(isIntersectedLL(a1, a2, b1, b2));\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nP getCrosspointSS(P a1, P a2, P b1, P b2){\n //assert(isIntersectedSS(a1, a2, b1, b2));\n return getCrosspointLL(a1, a2, b1, b2);\n}\n\n/* 円交点 */\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\n //assert(isIntersectedCC(c1, r1, c2, r2));\n \n double dist = abs(c1 - c2);\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\n}\n\n/* 円線分交点 */\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\n //assert(isIntersectedCS(c1, r1, c2, r2));\n \n P base1 = a2 - a1;\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\n P e = (a2 - a1) / abs(a2 - a1);\n P base2 = sqrt(r*r - norm(proj - c));\n return {proj + e*base2, proj - e*base2};\n}\n\n/* 多角形-点包含 */\nbool iscontainedPolyP(vector<P> &g, P p){\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\n }\n return f; //内部 or 外部\n}\n\n/* 射影(直線abとpからの垂線との交点) */\nP getProject(P a, P b, P p){\n P base = b - a;\n return a + base * dot(p - a, base) / norm(base);\n}\n\n/* 反射(直線abを対称軸としたpの線対称の位置) */\nP getReflection(P a, P b, P p){\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\n}\n\n\nint main(){\n int n, m, x, y;\n P pxy[101], cxy[101];\n vector<P> pol;\n\n scanf(\"%d\", &n);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\", &x, &y);\n pxy[i] = P(x, y);\n pol.push_back(pxy[i]);\n }\n pxy[n] = pxy[0];\n \n\n scanf(\"%d\", &m);\n \n for(int i=0;i<m;i++){\n scanf(\"%d%d\", &x, &y);\n cxy[i] = P(x, y);\n }\n\n P_type l = 0, r = 1e6;\n\n P_type epseps = 1e-6;\n \n while(abs(l-r) > 5e-6){\n P_type R = (l+r)/2;\n vector<P> vec; \n \n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\n\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + e * (P_type)-1);\n //vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n P_type mone = -1;\n\n for(int j=0;j<n;j++){\n\n for(int i=0;i<m;i++){\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n auto em = e*mone;\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + em);\n //vec.push_back(gc.second + e);\n vec.push_back(gc.second + em);\n }\n }\n\n bool res = true;\n \n for(int i=0;i<vec.size() && res;i++){\n if(iscontainedPolyP(pol, vec[i])){\n\n bool f = false;\n for(int j=0;j<m && !f;j++){\n f |= isContainedCP(cxy[j], R, vec[i]);\n }\n\n res &= f;\n }\n }\n\n if(res){\n r = R;\n }else{\n l = R;\n }\n }\n\n printf(\"%.10lf\\n\", (double)l);\n \n \n return 0;\n}","accuracy":0.35714285714285715,"time_ms":20,"memory_kb":3728,"score_of_the_acc":-0.0727,"final_rank":15},{"submission_id":"aoj_3049_3159238","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\ntypedef double P_type;\ntypedef complex<P_type> P;\nconst P_type P_eps = 5e-9; //整数の時はゼロ\n\nnamespace std{\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\n }\n};\n\nP rotate(P p, double theta){\n return p * P(cos(theta), sin(theta));\n}\n\n//内積\nP_type dot(P a, P b) {\n return (a * conj(b)).real();\n}\n\n//外積\nP_type cross(P a, P b) {\n return (conj(a) * b).imag();\n}\n\n//反時計回り\nint ccw(P a, P b, P c){\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\n return 0; //a -> c -> b\n}\n\n/* 線分abと点cの距離 */\nP_type distanceSP(P a, P b, P c) {\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 直線abと点cの距離 */\nP_type distanceLP(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 円の点包含判定 */\nbool isContainedCP(P c, double r, P p){\n return abs(c-p) < r - P_eps; //円周上を含まない\n //return abs(c-p) < r + P_eps; //円周上を含む\n}\n\n/* 直線交差判定 */\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\n return abs(cross(a1-a2, b1-b2)) > P_eps;\n}\n\n/* 線分交差判定 */\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\n \n //線分a と 直線b\n int a = ccw(b1,b2,a1);\n int b = ccw(b1,b2,a2);\n \n //線分b と 直線a\n int c = ccw(a1,a2,b1);\n int d = ccw(a1,a2,b2);\n \n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\n}\n\n/* 直線線分交差判定 */\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \n int a = ccw(a1,a2,b1);\n int b = ccw(a1,a2,b2);\n \n // 直線上のとき a or b = 0 or -2 or 2\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\n}\n\n/* 円交差判定 */\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\n double dist = abs(c1 - c2);\n \n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\n}\n\n/* 円直線交差判定 */\nbool isIntersectedCL(P c, double r, P a1, P a2){\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 円線分交差判定 */\nbool isIntersectedCS(P c, double r, P a1, P a2){\n return isContainedCP(c,r,a1) &&\n isContainedCP(c,r,a2) &&\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 直線/線分交点 */\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\n //assert(isIntersectedLL(a1, a2, b1, b2));\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nP getCrosspointSS(P a1, P a2, P b1, P b2){\n //assert(isIntersectedSS(a1, a2, b1, b2));\n return getCrosspointLL(a1, a2, b1, b2);\n}\n\n/* 円交点 */\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\n //assert(isIntersectedCC(c1, r1, c2, r2));\n \n double dist = abs(c1 - c2);\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\n}\n\n/* 円線分交点 */\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\n //assert(isIntersectedCS(c1, r1, c2, r2));\n \n P base1 = a2 - a1;\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\n P e = (a2 - a1) / abs(a2 - a1);\n P base2 = sqrt(r*r - norm(proj - c));\n return {proj + e*base2, proj - e*base2};\n}\n\n/* 多角形-点包含 */\nbool iscontainedPolyP(vector<P> &g, P p){\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\n }\n return f; //内部 or 外部\n}\n\n/* 射影(直線abとpからの垂線との交点) */\nP getProject(P a, P b, P p){\n P base = b - a;\n return a + base * dot(p - a, base) / norm(base);\n}\n\n/* 反射(直線abを対称軸としたpの線対称の位置) */\nP getReflection(P a, P b, P p){\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\n}\n\n\nint main(){\n int n, m, x, y;\n P pxy[101], cxy[101];\n vector<P> pol;\n\n scanf(\"%d\", &n);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\", &x, &y);\n pxy[i] = P(x, y);\n pol.push_back(pxy[i]);\n }\n pxy[n] = pxy[0];\n \n\n scanf(\"%d\", &m);\n \n for(int i=0;i<m;i++){\n scanf(\"%d%d\", &x, &y);\n cxy[i] = P(x, y);\n }\n\n P_type l = 0, r = 1e6;\n\n P_type epseps = 5e-7;\n \n while(abs(l-r) > 5e-6){\n P_type R = (l+r)/2;\n vector<P> vec; \n \n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\n\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + e * (P_type)-1);\n //vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n P_type mone = -1;\n\n for(int j=0;j<n;j++){\n\n for(int i=0;i<m;i++){\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n auto em = e*mone;\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + em);\n //vec.push_back(gc.second + e);\n vec.push_back(gc.second + em);\n }\n }\n\n bool res = true;\n \n for(int i=0;i<vec.size() && res;i++){\n if(iscontainedPolyP(pol, vec[i])){\n\n bool f = false;\n for(int j=0;j<m && !f;j++){\n f |= isContainedCP(cxy[j], R, vec[i]);\n }\n\n res &= f;\n }\n }\n\n if(res){\n r = R;\n }else{\n l = R;\n }\n }\n\n printf(\"%.10lf\\n\", (double)l);\n \n \n return 0;\n}","accuracy":0.2857142857142857,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.0763,"final_rank":17},{"submission_id":"aoj_3049_3159237","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\ntypedef long double P_type;\ntypedef complex<P_type> P;\nconst P_type P_eps = 1e-9; //整数の時はゼロ\n\nnamespace std{\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\n }\n};\n\nP rotate(P p, double theta){\n return p * P(cos(theta), sin(theta));\n}\n\n//内積\nP_type dot(P a, P b) {\n return (a * conj(b)).real();\n}\n\n//外積\nP_type cross(P a, P b) {\n return (conj(a) * b).imag();\n}\n\n//反時計回り\nint ccw(P a, P b, P c){\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\n return 0; //a -> c -> b\n}\n\n/* 線分abと点cの距離 */\nP_type distanceSP(P a, P b, P c) {\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 直線abと点cの距離 */\nP_type distanceLP(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 円の点包含判定 */\nbool isContainedCP(P c, double r, P p){\n return abs(c-p) < r - P_eps; //円周上を含まない\n //return abs(c-p) < r + P_eps; //円周上を含む\n}\n\n/* 直線交差判定 */\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\n return abs(cross(a1-a2, b1-b2)) > P_eps;\n}\n\n/* 線分交差判定 */\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\n \n //線分a と 直線b\n int a = ccw(b1,b2,a1);\n int b = ccw(b1,b2,a2);\n \n //線分b と 直線a\n int c = ccw(a1,a2,b1);\n int d = ccw(a1,a2,b2);\n \n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\n}\n\n/* 直線線分交差判定 */\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \n int a = ccw(a1,a2,b1);\n int b = ccw(a1,a2,b2);\n \n // 直線上のとき a or b = 0 or -2 or 2\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\n}\n\n/* 円交差判定 */\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\n double dist = abs(c1 - c2);\n \n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\n}\n\n/* 円直線交差判定 */\nbool isIntersectedCL(P c, double r, P a1, P a2){\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 円線分交差判定 */\nbool isIntersectedCS(P c, double r, P a1, P a2){\n return isContainedCP(c,r,a1) &&\n isContainedCP(c,r,a2) &&\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 直線/線分交点 */\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\n //assert(isIntersectedLL(a1, a2, b1, b2));\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nP getCrosspointSS(P a1, P a2, P b1, P b2){\n //assert(isIntersectedSS(a1, a2, b1, b2));\n return getCrosspointLL(a1, a2, b1, b2);\n}\n\n/* 円交点 */\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\n //assert(isIntersectedCC(c1, r1, c2, r2));\n \n double dist = abs(c1 - c2);\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\n}\n\n/* 円線分交点 */\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\n //assert(isIntersectedCS(c1, r1, c2, r2));\n \n P base1 = a2 - a1;\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\n P e = (a2 - a1) / abs(a2 - a1);\n P base2 = sqrt(r*r - norm(proj - c));\n return {proj + e*base2, proj - e*base2};\n}\n\n/* 多角形-点包含 */\nbool iscontainedPolyP(vector<P> &g, P p){\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\n }\n return f; //内部 or 外部\n}\n\n/* 射影(直線abとpからの垂線との交点) */\nP getProject(P a, P b, P p){\n P base = b - a;\n return a + base * dot(p - a, base) / norm(base);\n}\n\n/* 反射(直線abを対称軸としたpの線対称の位置) */\nP getReflection(P a, P b, P p){\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\n}\n\n\nint main(){\n int n, m, x, y;\n P pxy[101], cxy[101];\n vector<P> pol;\n\n scanf(\"%d\", &n);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\", &x, &y);\n pxy[i] = P(x, y);\n pol.push_back(pxy[i]);\n }\n pxy[n] = pxy[0];\n \n\n scanf(\"%d\", &m);\n \n for(int i=0;i<m;i++){\n scanf(\"%d%d\", &x, &y);\n cxy[i] = P(x, y);\n }\n\n P_type l = 0, r = 1e6;\n\n P_type epseps = 1e-7;\n \n while(abs(l-r) > 1e-6){\n P_type R = (l+r)/2;\n vector<P> vec; \n \n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\n\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + e * (P_type)-1);\n //vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n P_type mone = -1;\n\n for(int j=0;j<n;j++){\n\n for(int i=0;i<m;i++){\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\n auto em = e*mone;\n vec.push_back(gc.first + e);\n //vec.push_back(gc.first + em);\n //vec.push_back(gc.second + e);\n vec.push_back(gc.second + em);\n }\n }\n\n bool res = true;\n \n for(int i=0;i<vec.size() && res;i++){\n if(iscontainedPolyP(pol, vec[i])){\n\n bool f = false;\n for(int j=0;j<m && !f;j++){\n f |= isContainedCP(cxy[j], R, vec[i]);\n }\n\n res &= f;\n }\n }\n\n if(res){\n r = R;\n }else{\n l = R;\n }\n }\n\n printf(\"%.10lf\\n\", (double)l);\n \n \n return 0;\n}","accuracy":1,"time_ms":1660,"memory_kb":4048,"score_of_the_acc":-1.0739,"final_rank":11},{"submission_id":"aoj_3049_3146579","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);++i)\n#define all(a) (a).begin(),(a).end()\n\ntypedef complex<double> Point;\ntypedef vector<Point> VP;\nconst double EPS = 1e-9; // 許容誤差^2\nconst double INF = 1e9;\nconst double PI = acos(-1.0);\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > +EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 直線と線分\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\n return cross(a2-a1, b1-a1) * \n cross(a2-a1, b2-a1) < EPS;\n}\n\n// 2直線の交点\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\n double d1 = cross(b2-b1, b1-a1);\n double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n assert(!EQ(d2, 0)); // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\n\n// 2円の交点\nVP crosspointCC(Point a, double ar, Point b, double br) {\n VP ps;\n Point ab = b-a;\n double d = abs(ab);\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\n if (EQ(d, 0) || ar < abs(crL)) return ps;\n\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\n Point cp = a + crL/d * ab;\n ps.push_back(cp + abN);\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n// 多角形の内部判定\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, Point p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n Point a = ps[i] - p;\n Point b = ps[(i + 1) % n] - p;\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\n if (a.Y > b.Y) swap(a,b);\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\n }\n return in;\n}\n\nbool inCircle(Point p, Point c, double r){\n return abs(p-c) <= r;\n}\n\nint n,m;\n// ps: n個の頂点\n// cs: m個の中心\nbool check(double r, VP &ps, VP &cs){\n // 全頂点が1つ以上の円に含まれている\n rep(i,n){\n bool ok = false;\n rep(j,m){\n if(inCircle(ps[i], cs[j], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n\n // 2つの中心の垂直二等分線\n rep(i,m)rep(j,i){\n Point mid = (cs[i]+cs[j])/2.0;\n double d = abs(cs[i]-mid) + 1000.0;\n VP cps = crosspointCC(cs[i],d, cs[j],d);\n rep(k,n){\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\n bool ok = false;\n rep(l,m){\n if(inCircle(p,cs[l],r)) ok = true;\n }\n if(!ok) return false;\n }\n }\n }\n\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\n rep(i,m)rep(j,i){\n VP cps = crosspointCC(cs[i],r, cs[j],r);\n for(auto p : cps)if(inPolygon(ps, p)){\n bool ok = false;\n rep(k,m)if(k!=i && k!=j){\n if(inCircle(p, cs[k], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n }\n\n return true;\n}\n\nint main(void){\n cin>>n;\n VP ps(n);\n rep(i,n){\n double x,y;\n cin>>x>>y;\n ps[i] = Point(x,y);\n }\n cin>>m;\n VP cs(m);\n rep(i,m){\n double x,y;\n cin>>x>>y;\n cs[i] = Point(x,y);\n }\n double l = 0, r = 1000000;\n rep(loop,50){\n double radius = (l+r)/2;\n if(check(radius, ps, cs)){\n r = radius;\n }else{\n l = radius;\n }\n }\n printf(\"%.10f\\n\", r);\n return 0;\n}","accuracy":1,"time_ms":640,"memory_kb":3352,"score_of_the_acc":-0.377,"final_rank":5},{"submission_id":"aoj_3049_3146578","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);++i)\n#define all(a) (a).begin(),(a).end()\n\ntypedef complex<double> Point;\ntypedef vector<Point> VP;\nconst double EPS = 1e-9; // 許容誤差^2\nconst double INF = 1e9;\nconst double PI = acos(-1.0);\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > +EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 直線と線分\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\n return cross(a2-a1, b1-a1) * \n cross(a2-a1, b2-a1) < EPS;\n}\n\n// 2直線の交点\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\n double d1 = cross(b2-b1, b1-a1);\n double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n assert(!EQ(d2, 0)); // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\n\n// 2円の交点\nVP crosspointCC(Point a, double ar, Point b, double br) {\n VP ps;\n Point ab = b-a;\n double d = abs(ab);\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\n if (EQ(d, 0) || ar < abs(crL)) return ps;\n\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\n Point cp = a + crL/d * ab;\n ps.push_back(cp + abN);\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n// 頂点の順序（sortやmax_elementに必要）\nnamespace std {\n bool operator<(const Point a, const Point b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\n// 凸包\n// 入力1個 -> 空\n// 2個以上の全て同じ点 -> 同じもの2つ\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n VP ch(2*n);\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n ch.resize(k-1);\n return ch;\n}\n\n// 多角形の内部判定\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, Point p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n Point a = ps[i] - p;\n Point b = ps[(i + 1) % n] - p;\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\n if (a.Y > b.Y) swap(a,b);\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\n }\n return in;\n}\n\nbool inCircle(Point p, Point c, double r){\n return abs(p-c) <= r;\n}\n\nint n,m;\n// ps: n個の頂点\n// cs: m個の中心\nbool check(double r, VP &ps, VP &cs){\n // 全頂点が1つ以上の円に含まれている\n rep(i,n){\n bool ok = false;\n rep(j,m){\n if(inCircle(ps[i], cs[j], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n\n // 2つの中心の垂直二等分線\n rep(i,m)rep(j,i){\n Point mid = (cs[i]+cs[j])/2.0;\n double d = abs(cs[i]-mid) + 1000.0;\n VP cps = crosspointCC(cs[i],d, cs[j],d);\n rep(k,n){\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\n bool ok = false;\n rep(l,m){\n if(inCircle(p,cs[l],r)) ok = true;\n }\n if(!ok) return false;\n }\n }\n }\n\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\n rep(i,m)rep(j,i){\n VP cps = crosspointCC(cs[i],r, cs[j],r);\n for(auto p : cps)if(inPolygon(ps, p)){\n bool ok = false;\n rep(k,m)if(k!=i && k!=j){\n if(inCircle(p, cs[k], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n }\n\n return true;\n}\n\nint main(void){\n cin>>n;\n VP ps(n);\n rep(i,n){\n double x,y;\n cin>>x>>y;\n ps[i] = Point(x,y);\n }\n cin>>m;\n VP cs(m);\n rep(i,m){\n double x,y;\n cin>>x>>y;\n cs[i] = Point(x,y);\n }\n double l = 0, r = 1000000;\n rep(loop,100){\n double radius = (l+r)/2;\n if(check(radius, ps, cs)){\n r = radius;\n }else{\n l = radius;\n }\n }\n printf(\"%.10f\\n\", r);\n return 0;\n}","accuracy":1,"time_ms":1310,"memory_kb":3280,"score_of_the_acc":-0.7558,"final_rank":8},{"submission_id":"aoj_3049_3146576","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);++i)\n#define all(a) (a).begin(),(a).end()\n\ntypedef complex<double> Point;\ntypedef vector<Point> VP;\nconst double EPS = 1e-9; // 許容誤差^2\nconst double INF = 1e9;\nconst double PI = acos(-1.0);\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > +EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 直線と線分\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\n return cross(a2-a1, b1-a1) * \n cross(a2-a1, b2-a1) < EPS;\n}\n\n// 2直線の交点\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\n double d1 = cross(b2-b1, b1-a1);\n double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n assert(!EQ(d2, 0)); // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\n\n// 2円の交点\nVP crosspointCC(Point a, double ar, Point b, double br) {\n VP ps;\n Point ab = b-a;\n double d = abs(ab);\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\n if (EQ(d, 0) || ar < abs(crL)) return ps;\n\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\n Point cp = a + crL/d * ab;\n ps.push_back(cp + abN);\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n// 頂点の順序（sortやmax_elementに必要）\nnamespace std {\n bool operator<(const Point a, const Point b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\n// 凸包\n// 入力1個 -> 空\n// 2個以上の全て同じ点 -> 同じもの2つ\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n VP ch(2*n);\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n ch.resize(k-1);\n return ch;\n}\n\n// 多角形の内部判定\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, Point p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n Point a = ps[i] - p;\n Point b = ps[(i + 1) % n] - p;\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\n if (a.Y > b.Y) swap(a,b);\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\n }\n return in;\n}\n\nbool inCircle(Point p, Point c, double r){\n return abs(p-c) <= r;\n}\n\nint n,m;\n// ps: n個の頂点\n// cs: m個の中心\nbool check(double r, VP &ps, VP &cs){\n // 全頂点が1つ以上の円に含まれている\n rep(i,n){\n bool ok = false;\n rep(j,m){\n if(inCircle(ps[i], cs[j], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n\n // 2つの中心の垂直二等分線\n rep(i,m)rep(j,i){\n Point mid = (cs[i]+cs[j])/2.0;\n double d = abs(cs[i]-mid) + 1000.0;\n VP cps = crosspointCC(cs[i],d, cs[j],d);\n rep(k,n){\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\n bool ok = false;\n rep(l,m){\n if(inCircle(p,cs[l],r)) ok = true;\n }\n if(!ok) return false;\n }\n }\n }\n\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\n rep(i,m)rep(j,i){\n VP cps = crosspointCC(cs[i],r, cs[j],r);\n for(auto p : cps)if(inPolygon(ps, p)){\n bool ok = false;\n rep(k,m)if(k!=i && k!=j){\n if(inCircle(p, cs[k], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n }\n\n return true;\n}\n\nint main(void){\n cin>>n;\n VP ps(n);\n rep(i,n){\n double x,y;\n cin>>x>>y;\n ps[i] = Point(x,y);\n }\n ps = convexHull(ps);\n cin>>m;\n VP cs(m);\n rep(i,m){\n double x,y;\n cin>>x>>y;\n cs[i] = Point(x,y);\n }\n double l = 0, r = 1000000;\n rep(loop,100){\n double radius = (l+r)/2;\n if(check(radius, ps, cs)){\n r = radius;\n }else{\n l = radius;\n }\n }\n printf(\"%.10f\\n\", r);\n return 0;\n}","accuracy":1,"time_ms":1320,"memory_kb":3356,"score_of_the_acc":-0.773,"final_rank":10},{"submission_id":"aoj_3049_3145672","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define EPS (1e-6)\n#define EQ(a, b) (abs((a) - (b)) < EPS)\n\ntypedef complex<double> vector2;\ntypedef pair<vector2, vector2> line;\n\ndouble dot(vector2 a, vector2 b) { return real(conj(a) * b); }\ndouble cross(vector2 a, vector2 b) { return imag(conj(a) * b); }\n\nvector<vector2> cc_cross(vector2 a, vector2 b, double r) {\n double d = abs(b - a);\n double rc = d / 2;\n double rs = sqrt(r * r - rc * rc);\n vector2 diff = (b - a) / d;\n return {a + diff * vector2(rc, rs), a + diff * vector2(rc, -rs)};\n}\n\nint main() {\n int n, m;\n cin >> n;\n vector<vector2> p(n);\n for (auto &e : p) {\n double x, y;\n cin >> x >> y;\n e = {x, y};\n }\n cin >> m;\n vector<vector2> c(m);\n for (auto &e : c) {\n double x, y;\n cin >> x >> y;\n e = {x, y};\n }\n\n double ng = 0, ok = 1e6, r;\n while (ng + EPS < ok) {\n r = (ng + ok) / 2.0;\n bool isok = true;\n\n vector<int> v(n, -1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (abs(c[j] - p[i]) < r) {\n v[i] = j;\n break;\n }\n }\n if (v[i] == -1) {\n isok = false;\n }\n }\n\n if (isok) {\n vector<vector<bool>> g(m, vector<bool>(m));\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) {\n if (abs(c[j] - c[i]) < 2 * r) {\n g[i][j] = true;\n }\n }\n }\n for (int k = 0; k < m; k++) {\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) {\n if (g[i][k] && g[k][j]) {\n g[i][j] = true;\n }\n }\n }\n }\n\n for (int i = 0; i < m; i++) {\n isok &= g[0][i];\n }\n }\n\n if (isok) {\n vector<vector2> u;\n for (int i = 0; i < m; i++) {\n for (int j = i + 1; j < m; j++) {\n vector<vector2> w = cc_cross(c[i], c[j], r);\n for (auto e : w) {\n bool outer = true;\n for (int k = 0; k < m; k++) {\n if (k == i || k == j) {\n continue;\n }\n outer &= abs(e - c[k]) > r;\n }\n if (outer) {\n u.push_back(e);\n }\n }\n }\n }\n\n for (auto e : u) {\n double t = 0;\n for (int i = 0; i < n; i++) {\n int j = (i + 1) % n;\n vector2 a = p[i] - e, b = p[j] - e;\n t += atan2(cross(a, b), dot(a, b));\n }\n if (!EQ(t, 0)) {\n isok = false;\n break;\n }\n }\n }\n\n if (isok) {\n ok = r;\n } else {\n ng = r;\n }\n }\n\n cout << fixed << setprecision(6) << r << endl;\n}","accuracy":1,"time_ms":330,"memory_kb":3668,"score_of_the_acc":-0.244,"final_rank":3},{"submission_id":"aoj_3049_3145612","code_snippet":"#include <cmath>\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <string>\nnamespace lc {\nstatic const double EPS = 1e-9;\ninline double abs(double x){ return std::abs(x); }\ninline bool tolerant_eq(double a, double b){ return abs(a - b) < EPS; }\n}\nnamespace lc {\nstruct Point {\n\tdouble x;\n\tdouble y;\n\texplicit Point(const double &x = 0.0, const double &y = 0.0) :\n\t\tx(x), y(y)\n\t{ }\n\tPoint operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\n\tPoint operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\n\tPoint operator*(double s) const { return Point(x * s, y * s); }\n\tPoint operator*(const Point &p) const {\n\t\treturn Point(x * p.x - y * p.y, x * p.y + y * p.x);\n\t}\n\tPoint operator/(double s) const { return Point(x / s, y / s); }\n\tdouble abs() const { return sqrt(x * x + y * y); }\n\tdouble norm() const { return x * x + y * y; }\n\tPoint unit() const { return *this / abs(); }\n};\ninline Point operator*(double s, const Point &p){ return p * s; }\ninline bool tolerant_eq(const Point &a, const Point &b){\n\treturn tolerant_eq(a.x, b.x) && tolerant_eq(a.y, b.y);\n}\ninline double cross(const Point &a, const Point &b){\n\treturn a.x * b.y - a.y * b.x;\n}\ninline double dot(const Point &a, const Point &b){\n\treturn a.x * b.x + a.y * b.y;\n}\n}\nnamespace lc {\nstruct Line {\n\tPoint a;\n\tPoint b;\n\texplicit Line(const Point &a = Point(), const Point &b = Point()) :\n\t\ta(a), b(b)\n\t{ }\n\tPoint projection(const Point &p) const {\n\t\tdouble t = dot(p - a, b - a) / (b - a).norm();\n\t\treturn a + t * (b - a);\n\t}\n\tPoint direction() const {\n\t\treturn (b - a).unit();\n\t}\n};\n}\nnamespace lc {\nstruct Segment {\n\tPoint a;\n\tPoint b;\n\texplicit Segment(const Point &a = Point(), const Point &b = Point()) :\n\t\ta(a), b(b)\n\t{ }\n\tLine to_line() const { return Line(a, b); }\n};\n}\nnamespace lc {\nstruct Circle {\n\tPoint c;\n\tdouble r;\n\texplicit Circle(const Point &c = Point(), double r = 0.0) :\n\t\tc(c), r(r)\n\t{ }\n};\ninline bool tolerant_eq(const Circle &a, const Circle &b){\n\treturn tolerant_eq(a.c, b.c) && tolerant_eq(a.r, b.r);\n}\n}\nnamespace lc {\ninline bool intersect(const Point &a, const Segment &b){\n\treturn (b.a - a).abs() + (b.b - a).abs() - (b.b - b.a).abs() < EPS;\n}\ninline bool intersect(const Segment &a, const Point &b){\n\treturn intersect(b, a);\n}\ninline bool intersect(const Circle &a, const Circle &b){\n\tconst double d = (a.c - b.c).abs();\n\treturn d <= a.r + b.r && a.r + d >= b.r && b.r + d >= a.r;\n}\n}\nnamespace lc {\ninline std::vector<Point> crossing_points(const Line &l, const Circle &c){\n\tconst Point &p = l.projection(c.c);\n\tconst double t = (p - c.c).abs();\n\tif(t > c.r + EPS){ return std::vector<Point>(); }\n\tif(t > c.r - EPS){ return std::vector<Point>(1, p); }\n\tconst Point v = l.direction();\n\tconst double d = sqrt(c.r * c.r - t * t);\n\treturn std::vector<Point>({ p + d * v, p - d * v });\n}\ninline std::vector<Point> crossing_points(const Segment &s, const Circle &c){\n\tconst std::vector<Point> cps(crossing_points(s.to_line(), c));\n\tstd::vector<Point> result;\n\tfor(const auto &p : cps){\n\t\tif(intersect(s, p)){ result.push_back(p); }\n\t}\n\treturn result;\n}\ninline std::vector<Point> crossing_points(const Circle &a, const Circle &b){\n\tstd::vector<Point> ret;\n\tif(!intersect(a, b)){ return ret; }\n\tif(tolerant_eq(a, b)){\n\t\tret.push_back(a.c + Point(a.r, 0.0));\n\t\tret.push_back(a.c + Point(-a.r, 0.0));\n\t\tret.push_back(a.c + Point(0.0, a.r));\n\t}else{\n\t\tconst double d = (a.c - b.c).abs();\n\t\tconst double rc = (d * d + a.r * a.r - b.r * b.r) / (2.0 * d);\n\t\tconst double rs = sqrt(a.r * a.r - rc * rc);\n\t\tconst Point diff = (b.c - a.c) / d;\n\t\tconst Point x = a.c + diff * Point(rc, rs);\n\t\tconst Point y = a.c + diff * Point(rc, -rs);\n\t\tret.push_back(x);\n\t\tif(!tolerant_eq(x, y)){ ret.push_back(y); }\n\t}\n\treturn ret;\n}\n}\nnamespace lc {\nclass Polygon {\nprivate:\n\tstd::vector<Point> m_points;\npublic:\n\texplicit Polygon(size_t s, const Point &p = Point())\n\t\t: m_points(s, p)\n\t{ }\n\tPoint &operator[](int i){ return m_points[i]; }\n\tSegment side(int i) const {\n\t\treturn Segment(m_points[i], m_points[(i + 1) % m_points.size()]);\n\t}\n\tint size() const { return static_cast<int>(m_points.size()); }\n\tint contains(const Point &p) const {\n\t\tint result = -1;\n\t\tfor(int i = 0; i < size(); ++i){\n\t\t\tPoint a = m_points[i] - p;\n\t\t\tPoint b = m_points[(i + 1) % size()] - p;\n\t\t\tif(a.y > b.y){ std::swap(a, b); }\n\t\t\tif(a.y <= 0.0 && b.y > 0.0 && cross(a, b) < 0.0){\n\t\t\t\tresult = -result;\n\t\t\t}\n\t\t\tif(cross(a, b) == 0.0 && dot(a, b) <= 0.0){ return 0; }\n\t\t}\n\t\treturn result;\n\t}\n};\n}\nusing namespace std;\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcout << setiosflags(ios::fixed) << setprecision(10);\n\tint n, m;\n\tcin >> n;\n\tlc::Polygon poly(n);\n\tfor(int i = 0; i < n; ++i){\n\t\tcin >> poly[i].x >> poly[i].y;\n\t}\n\tcin >> m;\n\tvector<lc::Point> centers(m);\n\tfor(int i = 0; i < m; ++i){\n\t\tcin >> centers[i].x >> centers[i].y;\n\t}\n\tdouble lo = 0, hi = 1e8;\n\tfor(int iter = 0; iter < 100; ++iter){\n\t\tconst double r = (lo + hi) / 2;\n\t\tvector<lc::Circle> circles(m);\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tcircles[i] = lc::Circle(centers[i], r);\n\t\t}\n\t\tvector<lc::Point> testers;\n\t\tfor(int i = 0; i < n; ++i){ testers.push_back(poly[i]); }\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\tconst auto cps = lc::crossing_points(circles[i], circles[j]);\n\t\t\t\tfor(const auto& p : cps){\n\t\t\t\t\tif(poly.contains(p) >= 0){ testers.push_back(p); }\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j = 0; j < n; ++j){\n\t\t\t\tconst auto cps = lc::crossing_points(poly.side(j), circles[i]);\n\t\t\t\tfor(const auto& p : cps){ testers.push_back(p); }\n\t\t\t}\n\t\t}\n\t\tbool accept = true;\n\t\tfor(const auto& p : testers){\n\t\t\tbool ok = false;\n\t\t\tfor(const auto& c : circles){\n\t\t\t\tif((c.c - p).norm() < (r - lc::EPS) * (r - lc::EPS)){\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!ok){\n\t\t\t\taccept = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(accept){\n\t\t\thi = r;\n\t\t}else{\n\t\t\tlo = r;\n\t\t}\n\t}\n\tcout << lo << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3544,"score_of_the_acc":-0.0859,"final_rank":1},{"submission_id":"aoj_3049_3145611","code_snippet":"#include <cmath>\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <string>\nnamespace lc {\nstatic const double EPS = 1e-9;\ninline double abs(double x){ return std::abs(x); }\ninline bool tolerant_eq(double a, double b){ return abs(a - b) < EPS; }\n}\nnamespace lc {\nstruct Point {\n\tdouble x;\n\tdouble y;\n\texplicit Point(const double &x = 0.0, const double &y = 0.0) :\n\t\tx(x), y(y)\n\t{ }\n\tPoint operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\n\tPoint operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\n\tPoint operator*(double s) const { return Point(x * s, y * s); }\n\tPoint operator*(const Point &p) const {\n\t\treturn Point(x * p.x - y * p.y, x * p.y + y * p.x);\n\t}\n\tPoint operator/(double s) const { return Point(x / s, y / s); }\n\tdouble abs() const { return sqrt(x * x + y * y); }\n\tdouble norm() const { return x * x + y * y; }\n\tPoint unit() const { return *this / abs(); }\n};\ninline Point operator*(double s, const Point &p){ return p * s; }\ninline bool tolerant_eq(const Point &a, const Point &b){\n\treturn tolerant_eq(a.x, b.x) && tolerant_eq(a.y, b.y);\n}\ninline double cross(const Point &a, const Point &b){\n\treturn a.x * b.y - a.y * b.x;\n}\ninline double dot(const Point &a, const Point &b){\n\treturn a.x * b.x + a.y * b.y;\n}\n}\nnamespace lc {\nstruct Line {\n\tPoint a;\n\tPoint b;\n\texplicit Line(const Point &a = Point(), const Point &b = Point()) :\n\t\ta(a), b(b)\n\t{ }\n\tPoint projection(const Point &p) const {\n\t\tdouble t = dot(p - a, b - a) / (b - a).norm();\n\t\treturn a + t * (b - a);\n\t}\n\tPoint direction() const {\n\t\treturn (b - a).unit();\n\t}\n};\n}\nnamespace lc {\nstruct Segment {\n\tPoint a;\n\tPoint b;\n\texplicit Segment(const Point &a = Point(), const Point &b = Point()) :\n\t\ta(a), b(b)\n\t{ }\n\tLine to_line() const { return Line(a, b); }\n};\n}\nnamespace lc {\nstruct Circle {\n\tPoint c;\n\tdouble r;\n\texplicit Circle(const Point &c = Point(), double r = 0.0) :\n\t\tc(c), r(r)\n\t{ }\n};\ninline bool tolerant_eq(const Circle &a, const Circle &b){\n\treturn tolerant_eq(a.c, b.c) && tolerant_eq(a.r, b.r);\n}\n}\nnamespace lc {\ninline bool intersect(const Point &a, const Segment &b){\n\treturn (b.a - a).abs() + (b.b - a).abs() - (b.b - b.a).abs() < EPS;\n}\ninline bool intersect(const Segment &a, const Point &b){\n\treturn intersect(b, a);\n}\ninline bool intersect(const Circle &a, const Circle &b){\n\tconst double d = (a.c - b.c).abs();\n\treturn d <= a.r + b.r && a.r + d >= b.r && b.r + d >= a.r;\n}\n}\nnamespace lc {\ninline std::vector<Point> crossing_points(const Line &l, const Circle &c){\n\tconst Point &p = l.projection(c.c);\n\tconst double t = (p - c.c).abs();\n\tif(t > c.r + EPS){ return std::vector<Point>(); }\n\tif(t > c.r - EPS){ return std::vector<Point>(1, p); }\n\tconst Point v = l.direction();\n\tconst double d = sqrt(c.r * c.r - t * t);\n\treturn std::vector<Point>({ p + d * v, p - d * v });\n}\ninline std::vector<Point> crossing_points(const Segment &s, const Circle &c){\n\tconst std::vector<Point> cps(crossing_points(s.to_line(), c));\n\tstd::vector<Point> result;\n\tfor(const auto &p : cps){\n\t\tif(intersect(s, p)){ result.push_back(p); }\n\t}\n\treturn result;\n}\ninline std::vector<Point> crossing_points(const Circle &a, const Circle &b){\n\tstd::vector<Point> ret;\n\tif(!intersect(a, b)){ return ret; }\n\tif(tolerant_eq(a, b)){\n\t\tret.push_back(a.c + Point(a.r, 0.0));\n\t\tret.push_back(a.c + Point(-a.r, 0.0));\n\t\tret.push_back(a.c + Point(0.0, a.r));\n\t}else{\n\t\tconst double d = (a.c - b.c).abs();\n\t\tconst double rc = (d * d + a.r * a.r - b.r * b.r) / (2.0 * d);\n\t\tconst double rs = sqrt(a.r * a.r - rc * rc);\n\t\tconst Point diff = (b.c - a.c) / d;\n\t\tconst Point x = a.c + diff * Point(rc, rs);\n\t\tconst Point y = a.c + diff * Point(rc, -rs);\n\t\tret.push_back(x);\n\t\tif(!tolerant_eq(x, y)){ ret.push_back(y); }\n\t}\n\treturn ret;\n}\n}\nnamespace lc {\nclass Polygon {\nprivate:\n\tstd::vector<Point> m_points;\npublic:\n\texplicit Polygon(size_t s, const Point &p = Point())\n\t\t: m_points(s, p)\n\t{ }\n\tPoint &operator[](int i){ return m_points[i]; }\n\tSegment side(int i) const {\n\t\treturn Segment(m_points[i], m_points[(i + 1) % m_points.size()]);\n\t}\n\tint size() const { return static_cast<int>(m_points.size()); }\n\tint contains(const Point &p) const {\n\t\tint result = -1;\n\t\tfor(int i = 0; i < size(); ++i){\n\t\t\tPoint a = m_points[i] - p;\n\t\t\tPoint b = m_points[(i + 1) % size()] - p;\n\t\t\tif(a.y > b.y){ std::swap(a, b); }\n\t\t\tif(a.y <= 0.0 && b.y > 0.0 && cross(a, b) < 0.0){\n\t\t\t\tresult = -result;\n\t\t\t}\n\t\t\tif(cross(a, b) == 0.0 && dot(a, b) <= 0.0){ return 0; }\n\t\t}\n\t\treturn result;\n\t}\n};\n}\nusing namespace std;\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcout << setiosflags(ios::fixed) << setprecision(10);\n\tint n, m;\n\tcin >> n;\n\tlc::Polygon poly(n);\n\tfor(int i = 0; i < n; ++i){\n\t\tcin >> poly[i].x >> poly[i].y;\n\t}\n\tcin >> m;\n\tvector<lc::Point> centers(m);\n\tfor(int i = 0; i < m; ++i){\n\t\tcin >> centers[i].x >> centers[i].y;\n\t}\n\tdouble lo = 0, hi = 1e6;\n\tfor(int iter = 0; iter < 50; ++iter){\n\t\tconst double r = (lo + hi) / 2;\n\t\tvector<lc::Circle> circles(m);\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tcircles[i] = lc::Circle(centers[i], r);\n\t\t}\n\t\tvector<lc::Point> testers;\n\t\tfor(int i = 0; i < n; ++i){ testers.push_back(poly[i]); }\n\t\tfor(int i = 0; i < m; ++i){\n\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\tconst auto cps = lc::crossing_points(circles[i], circles[j]);\n\t\t\t\tfor(const auto& p : cps){\n\t\t\t\t\tif(poly.contains(p) >= 0){ testers.push_back(p); }\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int j = 0; j < n; ++j){\n\t\t\t\tconst auto cps = lc::crossing_points(poly.side(j), circles[i]);\n\t\t\t\tfor(const auto& p : cps){ testers.push_back(p); }\n\t\t\t}\n\t\t}\n\t\tbool accept = true;\n\t\tfor(const auto& p : testers){\n\t\t\tbool ok = false;\n\t\t\tfor(const auto& c : circles){\n\t\t\t\tif((c.c - p).norm() < r * r - lc::EPS){\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!ok){\n\t\t\t\taccept = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(accept){\n\t\t\thi = r;\n\t\t}else{\n\t\t\tlo = r;\n\t\t}\n\t}\n\tcout << lo << endl;\n\treturn 0;\n}","accuracy":0.47619047619047616,"time_ms":30,"memory_kb":3404,"score_of_the_acc":-0.0301,"final_rank":13},{"submission_id":"aoj_3049_3145597","code_snippet":"#include<iostream>\n#include<complex>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n//#define mt make_tuple\n//typedef tuple<double,int,double> tp;\n//typedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\ntypedef complex<double> P;\ntypedef vector<P> G;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L(){;}\n};\nstruct C{\n\tP c;double r;\n\tC(const P &c,double r):c(c),r(r){}\n};\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n#define diff(P, i) (next(P, i) - curr(P, i))\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn a.real()==b.real()&&a.imag()==b.imag();\n\t}\n}\nP pin(){\n\tdouble x,y;\n\tchar d;\n\tcin>>x>>y;\n\tP p(x,y);\n\treturn p;\n}\nvoid PIN(P* a,int n){\n\trep(i,n)a[i]=pin();\n}\ndouble dot(P a,P b){\n\treturn real(conj(a)*b);\n}\ndouble cross(P a,P b){\n\treturn imag(conj(a)*b);\n}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0; // a--c--b on line\n}\nP projection(L a,P p){\n\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\n\treturn a[0]+t*(a[0]-a[1]);\n}\nP reflection(L a,P p){\n\treturn p+2.0*(projection(a,p)-p);\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\ndouble distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const L &s, const L &t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n/*bool intersectCS(C c,const L &l){\n return (distanceLP(l,c.c) < c.r+EPS &&\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\n}*/\nint intersectCS(C c,L l){\n\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\n\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\n\tif(d1<c.r+EPS&&d2<c.r+EPS)return 0;\n\tif(d1<c.r-EPS&&d2>c.r+EPS||d1>c.r+EPS&&d2<c.r-EPS)return 1;\n\tconst P h=projection(l,c.c);\n\tif(dot(l[0]-h,l[1]-h)<0)return 2;\n\treturn 0;\n}\nP crosspointSS(L a,L b){\n\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\n\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\n\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\n}\nL crosspointCL(C c,L l){\n\tP pr=projection(l,c.c);\n\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\n\tdouble tmp=c.r*c.r-norm(pr-c.c);\n\tif(abs(tmp)<EPS)tmp=0;\n\tdouble t=sqrt(tmp);\n\tP a=pr+t*e;\n\tP b=pr-t*e;\n\tif(b<a)swap(a,b);\n\treturn L(a,b);\n}\nL crosspointCS(C c,L l){\n\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\n\tL ret=crosspointCL(c,l);\n\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\n\telse ret[0]=ret[1];\n\treturn ret;\n}\nL crosspointCC(C a,C b){\n\tP tmp=b.c-a.c;\n\tdouble d=abs(tmp);\n\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\n\tP p1=a.c+polar(a.r,t+q);\n\tP p2=a.c+polar(a.r,t-q);\n\tif(p2<p1)swap(p1,p2);\n\treturn L(p1,p2);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1] - l[0], m[1] - m[0]);\n double B = cross(l[1] - l[0], l[1] - m[0]);\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\ndouble area(const G &g){\n double S =0;\n for(int i =0;i <g.size();i++){\n S +=(cross(g[i],g[(i+1)%g.size()]));\n }\n return abs(S/2.0);\n}\nbool isconvex(const G &g){\n\tint n=g.size();\n\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\n\treturn true;\n}\nint inconvex(const G& g, const P& p) {\n\tbool in = false;\n\tint n=g.size();\n\trep(i,n){\n\t\tP a=g[i%n]-p;\n\t\tP b=g[(i+1)%n]-p;\n\t\tif(imag(a)>imag(b))swap(a, b);\n\t\tif(imag(a)<EPS&&0<imag(b))if(cross(a,b)<0)in=!in;\n\t\tif(abs(cross(a,b))<EPS&&dot(a,b)<EPS)return 1;//ON\n\t}\n\treturn in?2:0;//IN : OUT;\n}\nG convex_hull(G &ps) {\n int n=ps.size(),k=0;\n\tsort(ps.begin(), ps.end());\n\tG ch(2*n);\n\tfor(int i=0;i<n;ch[k++]=ps[i++])//lower-hull\n\t\twhile(k>=2&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//<=0 -> ==-1\n\tfor(int i=n-2,t=k+1;i>=0;ch[k++]=ps[i--])//upper-hull\n\t\twhile(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//\n\tch.resize(k-1);\n\treturn ch;\n}\ndouble convex_diameter(const G &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(pt[i]) > imag(pt[is])) is = i;\n if (imag(pt[i]) < imag(pt[js])) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}//convex_diameter(g)\nG convex_cut(const G& g, const L& l) {\n G Q;\n for (int i = 0; i < g.size(); ++i) {\n P a= curr(g, i), b= next(g, i);\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\n Q.push_back(crosspointLL(L(a,b), l));\n }\n return Q;\n}\nP turn(P p,double t){\n\treturn p*exp(P(.0,t*PI/180.0));\n}\nP turn2(P p,double t){\n\treturn p*exp(P(.0,t));\n}\nvector<L> tangentCC(C a,C b){\n\tif(a.r<b.r)swap(a,b);\n\tdouble d=abs(a.c-b.c);\n\tvector<L>l;\n\tif(d<EPS)return l;\n\tif(a.r+b.r<d-EPS){//hanareteiru\n\t\tdouble t=acos((a.r+b.r)/d);\n\t\tt=t*180/PI;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\n\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\n\t\tdouble t1=acos((a.r-b.r)/d);\n\t\tt1=t1*180/PI;\n\t\tdouble t2=180-t1;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\n\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\treturn l;\n}\nvoid printL(const L &out){\n\tprintf(\"%0.9f %0.9f %0.9f %0.9f\\n\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\n}\nC CIN(){\n\tP p=pin();\n\tdouble r;\n\tcin>>r;\n\treturn C(p,r);\n}\nbool para(L a,L b){\n\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\n}\ndouble min(double a,double b){return a<b?a:b;}\ndouble max(double a,double b){return a>b?a:b;}\n\n\n//XY座標\n#define X real()\n#define Y imag()\n\t\n// 三角形クラス\nclass Triangle{\n\nprivate:\n\t//三角形の３点の座標\n\tP a, b, c;\n\t//三角形の３辺の長さ\n\tdouble edgeA,edgeB,edgeC;\n\t//三角形の３角の大きさ(ラジアン)\n\tdouble angleA,angleB,angleC;\n\t//余弦定理から３つの角度を求める関数\n\tdouble LawOfCosines(double a,double b, double c){\n\t\treturn acos( (b*b+c*c-a*a) / (2.0*b*c) );\n\t}\n\t//２つのdouble型の数値が等しいかどうか\n\tbool equal(double a, double b){\n\t\treturn (abs( a-b ) < EPS)? true : false ;\n\t}\n\npublic:\n\t//コンストラクタ(３つの点と辺と角度を初期化)\n\tTriangle(P p1, P p2, P p3){\n\t\ta = p1;\n\t\tb = p2;\n\t\tc = p3;\n\t\tedgeB = abs(c-a);\n\t\tedgeA = abs(b-c);\n\t\tedgeC = abs(a-b);\n\t\tangleA = LawOfCosines(edgeA,edgeB,edgeC);\n\t\tangleB = LawOfCosines(edgeB,edgeC,edgeA);\n\t\tangleC = LawOfCosines(edgeC,edgeA,edgeB);\n\t}\n\t\n\tdouble circumscribedCircleRadius(){//外接円の半径を返す\n\t\treturn ( edgeA / sin(angleA) / 2.0 );\n\t}\n\tdouble circumscribedCircleX(){//外心(外接円の中心)のX座標を返す\n\t\tdouble A = sin(2.0*angleA);\n\t\tdouble B = sin(2.0*angleB);\n\t\tdouble C = sin(2.0*angleC);\n\t\treturn ( (a.X * A + b.X * B + c.X * C) / (A+B+C) );\n\t}\n\tdouble circumscribedCircleY(){//外心(外接円の中心)のY座標を返す\n\t\tdouble A = sin(2.0*angleA);\n\t\tdouble B = sin(2.0*angleB);\n\t\tdouble C = sin(2.0*angleC);\n\t\treturn ( (a.Y * A + b.Y * B + c.Y * C) / (A+B+C) );\n\t}\n};\n\nint main(){\n//\t\tTriangle Tr(a,b,c);\n//\t\tr = Tr.circumscribedCircleRadius();\n//\t\txp = Tr.circumscribedCircleX();\n//\t\typ = Tr.circumscribedCircleY();\n\n\tint n;\n\tcin>>n;\n\tG g(n);\n\trep(i,n){\n\t\tdouble a,b;\n\t\tcin>>a>>b;\n\t\tg[i]=P(a,b);\n\t}\n\tint m;\n\tcin>>m;\n\tG in(m);\n\trep(i,m){\n\t\tdouble a,b;\n\t\tcin>>a>>b;\n\t\tin[i]=P(a,b);\n\t}\t\n\tdouble out=0;\n\trep(i,n){\n\t\tdouble mi=inf;\n\t\trep(j,m)mi=min(mi,abs(g[i]-in[j]));\n\t\tout=max(out,mi);\n\t}//couner\n//\tcout<<shosu(10)<<out<<endl;\n\t\n\trep(i,m)loop(j,i+1,m)loop(k,j+1,m){\n\t\tTriangle Tr(in[i],in[j],in[k]);\n\t\tP p(Tr.circumscribedCircleX(),Tr.circumscribedCircleY());\n\t\tif(!inconvex(g,p))continue;\n\t\tdouble mi=inf;\n\t\trep(q,m)mi=min(mi,abs(p-in[q]));\n\t\tout=max(out,mi);\n\t}// gaisin\n//\tcout<<shosu(10)<<out<<endl;\n\n\trep(i,m)loop(j,i+1,m){\n\t\tP p=in[i]+(in[j]-in[i])/2.;\n\t\tL l(p,p+P(0,1)*(in[j]-in[i]));\n\t\trep(k,n){\n\t\t\tif(!intersectLS(l,L(g[k],g[(k+1)%n])))continue;\n\t\t\tP cr=crosspointLL(l,L(g[k],g[(k+1)%n]));\n\t\t\tdouble mi=inf;\n\t\t\trep(q,m)mi=min(mi,abs(cr-in[q]));\n\t\t\tout=max(out,mi);\n\t\t}\n\t}\n\t\n\tcout<<shosu(10)<<out<<endl;\n\t\n}","accuracy":1,"time_ms":160,"memory_kb":3692,"score_of_the_acc":-0.1487,"final_rank":2},{"submission_id":"aoj_3049_3145556","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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(a) (a).begin(),(a).end()\n#define lb(s,x) lower_bound(all(s),x)-s.begin()\n#define ub(s,x) upper_bound(all(s),x)-s.begin()\n#define uniq(a) a.erase(unique(all(a)),a.end())\n#define debug(x) cout<<#x<<\": \"<<x<<endl\ntemplate<class T,class U>\nostream& operator<<(ostream& o, const pair<T,U> &p){\n o<<\"(\"<<p.first<<\", \"<<p.second<<\")\";\n return o;\n}\n#define print(v) { cerr<<#v<<\": [ \"; for(auto _ : v) cerr<<_<<\", \"; cerr<<\"]\"<<endl; }\ntypedef long long ll;\n\n\ntypedef complex<double> Point;\ntypedef pair<Point, Point> Line;\ntypedef vector<Point> VP;\nconst double EPS = 1e-9; // 許容誤差^2\nconst double INF = 1e9;\nconst double PI = acos(-1.0);\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > +EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n/* \n 交差判定 直線・線分は縮退してはならない。\n 接する場合は交差するとみなす。\n 縮退している := 2つのものが区別付かない状態(?)\n isec = intersect\n L = Line\n P = Point\n S = Segment\n*/\n\n// 直線と点\nbool isecLP(Point a1, Point a2, Point b) {\n return abs(ccw(a1, a2, b)) != 1;\n // return EQ(cross(a2-a1, b-a1), 0); と等価\n}\n\n// 直線と直線\nbool isecLL(Point a1, Point a2, Point b1, Point b2) {\n return !isecLP(a2-a1, b2-b1, 0) || isecLP(a1, b1, b2);\n}\n\n// 直線と線分\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\n return cross(a2-a1, b1-a1) * \n cross(a2-a1, b2-a1) < EPS;\n}\n\n// 線分と線分\nbool isecSS(Point a1, Point a2, Point b1, Point b2) {\n return ccw(a1, a2, b1)*ccw(a1, a2, b2) <= 0 &&\n ccw(b1, b2, a1)*ccw(b1, b2, a2) <= 0;\n}\n\n// 線分と点\nbool isecSP(Point a1, Point a2, Point b) {\n return !ccw(a1, a2, b);\n}\n\n\n/* 距離 各直線・線分は縮退してはならない */\n\n// 点pの直線aへの射影点を返す\nPoint proj(Point a1, Point a2, Point p) {\n return a1 + dot(a2-a1, p-a1)/norm(a2-a1) * (a2-a1);\n}\n\n// 点pの直線aへの反射点を返す\nPoint reflection(Point a1, Point a2, Point p) {\n return 2.0*proj(a1, a2, p) - p;\n}\n\n//点aと点bの距離は abs(a-b)\n//#define distPP(p1,p2) abs(p1-p2)\n\ndouble distLP(Point a1, Point a2, Point p) {\n return abs(proj(a1, a2, p) - p);\n}\n\ndouble distLL(Point a1, Point a2, Point b1, Point b2) {\n return isecLL(a1, a2, b1, b2) ? 0 : distLP(a1, a2, b1);\n}\n\ndouble distLS(Point a1, Point a2, Point b1, Point b2) {\n return isecLS(a1, a2, b1, b2) ? 0 : min(distLP(a1, a2, b1), distLP(a1, a2, b2));\n}\n\ndouble distSP(Point a1, Point a2, Point p) {\n Point r = proj(a1, a2, p);\n if (isecSP(a1, a2, r)) return abs(r-p);\n //= !ccw(a1, a2, r)\n return min(abs(a1-p), abs(a2-p));\n}\n\ndouble distSS(Point a1, Point a2, Point b1, Point b2) {\n if (isecSS(a1, a2, b1, b2)) return 0;\n return min({\n distSP(a1, a2, b1),\n distSP(a1, a2, b2),\n distSP(b1, b2, a1),\n distSP(b1, b2, a2)});\n}\n\n// 2直線の交点\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\n double d1 = cross(b2-b1, b1-a1);\n double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n assert(!EQ(d2, 0)); // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\n\n\n/* 円 */\n\ndouble distLC(Point a1, Point a2, Point c, double r) {\n return max(distLP(a1, a2, c) - r, 0.0);\n}\n\ndouble distSC(Point a1, Point a2, Point c, double r) {\n double dSqr1 = norm(c-a1), dSqr2 = norm(c-a2);\n if ((dSqr1 < r*r) ^ (dSqr2 < r*r)) return 0; // 円が線分を包含するとき距離0ならここをORに変える\n if ((dSqr1 < r*r) & (dSqr2 < r*r)) return r - sqrt(max(dSqr1, dSqr2));\n return max(distSP(a1, a2, c) - r, 0.0);\n}\n\nVP crosspointLC(Point a1, Point a2, Point c, double r) {\n VP ps;\n Point ft = proj(a1, a2, c);\n if(!GE(r*r,norm(ft-c))) return ps;\n Point dir = sqrt(max(r*r - norm(ft-c), 0.0)) / abs(a2-a1) * (a2-a1);\n ps.push_back(ft + dir);\n if (!EQ(r*r, norm(ft-c))) ps.push_back(ft - dir);\n return ps;\n}\n\ndouble distCC(Point a, double ar, Point b, double br) {\n double d = abs(a-b);\n return GE(d, abs(ar-br)) ? max(d-ar-br, 0.0) : abs(ar-br) - d;\n}\n\n// 2円の交点\nVP crosspointCC(Point a, double ar, Point b, double br) {\n VP ps;\n Point ab = b-a;\n double d = abs(ab);\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\n if (EQ(d, 0) || ar < abs(crL)) return ps;\n\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\n Point cp = a + crL/d * ab;\n ps.push_back(cp + abN);\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n\n// // 2円の交点(自作)\n// VP crosspointCC(Point a, double ar, Point b, double br){\n// double d = abs(b-a);\n// if(abs(ar-br)>d || abs(ar+br)<d) return {};\n// double t = acos(double((d*d+ar*ar-br*br)/(2*d*ar)));\n// Point p1 = a+polar(ar,arg(b-a)+t);\n// Point p2 = a+polar(ar,arg(b-a)-t);\n// if(abs(p1-p2) < EPS) return {p1};\n// return {p1,p2};\n// }\n\n\n// 点pから円aへの接線の接点\nVP tangentPoints(Point a, double ar, Point p) {\n VP ps;\n double sin = ar / abs(p-a);\n if (!LE(sin, 1)) return ps; // ここでNaNも弾かれる\n double t = PI/2.0 - asin(min(sin, 1.0));\n ps.push_back( a + (p-a)*polar(sin, t));\n if (!EQ(sin, 1)) ps.push_back(a + (p-a)*polar(sin, -t));\n return ps;\n}\n\n// 2円の共通接線。返される各直線に含まれる頂点は円との接点となる\nvector<Line> tangentLines(Point a, double ar, Point b, double br) {\n vector<Line> ls;\n double d = abs(b-a);\n rep (i,2) {\n double sin = (ar - (1-i*2)*br) / d;\n if (!LE(sin*sin, 1)) break;\n double cos = sqrt(max(1 - sin*sin, 0.0));\n rep (j,2) {\n Point n = (b-a) * Point(sin, (1-j*2)*cos) / d;\n ls.push_back(Line(a + ar*n, b + (1-i*2)*br*n));\n if (cos < EPS) break; // 重複する接線を無視（重複していいならこの行不要）\n }\n }\n return ls;\n}\n\n// 三角形の外心。点a,b,cは同一線上にあってはならない\nPoint circumcenter(Point a, Point b, Point c) {\n a = (a-c)*0.5;\n b = (b-c)*0.5;\n return c + crosspointLL(a, a*Point(1,1), b, b*Point(1,1));\n}\n\n// 点aと点bを通り、半径がrの円の中心を返す\nVP circlesPointsRadius(Point a, Point b, double r) {\n VP cs;\n Point abH = (b-a)*0.5;\n double d = abs(abH);\n if (d == 0 || d > r) return cs; // 必要なら !LE(d,r) として円1つになる側へ丸める\n double dN = sqrt(r*r - d*d); // 必要なら max(r*r - d*d, 0) とする\n Point n = abH * Point(0,1) * (dN / d);\n cs.push_back(a + abH + n);\n if (dN > 0) cs.push_back(a + abH - n);\n return cs;\n}\n\n// 点aと点bを通り、直線lに接する円の中心\nVP circlesPointsTangent(Point a, Point b, Point l1, Point l2) {\n Point n = (l2-l1) * Point(0,1);\n Point m = (b-a) * Point(0,0.5);\n double rC = dot((a+b)*0.5-l1, n);\n double qa = norm(n)*norm(m) - dot(n,m)*dot(n,m);\n double qb = -rC * dot(n,m);\n double qc = norm(n)*norm(m) - rC*rC;\n double qd = qb*qb - qa*qc; // qa*k^2 + 2*qb*k + qc = 0\n\n VP cs;\n if (qd < -EPS) return cs;\n if (EQ(qa, 0)) {\n if (!EQ(qb, 0)) cs.push_back((a+b)*0.5 - m * (qc/qb/2));\n return cs;\n }\n double t = -qb/qa;\n cs.push_back( (a+b)*0.5 + m * (t + sqrt(max(qd, 0.0))/qa));\n if (qd > EPS) cs.push_back((a+b)*0.5 + m * (t - sqrt(max(qd, 0.0))/qa));\n return cs;\n}\n\n// 点集合を含む最小の円の中心\nPoint minEnclosingCircle(const VP& ps) {\n Point c;\n double move = 0.5;\n rep(i,39) { // 2^(-39-1) \\approx 0.9e-12\n rep(t,50) {\n double max = 0;\n int k = 0;\n rep (j, ps.size()) if (max < norm(ps[j]-c)) {\n max = norm(ps[j]-c);\n k = j;\n }\n c += (ps[k]-c) * move;\n }\n move /= 2;\n }\n return c;\n}\n\n\n/* 多角形 */\n\n// 頂点の順序（sortやmax_elementに必要）\nnamespace std {\n bool operator<(const Point a, const Point b) {\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n}\n\n//多角形PSのi番目の辺\n#define ps_edge(PS,i) PS[i],PS[(i+1)%PS.size()]\n\n// 凸包\n// 入力1個 -> 空\n// 2個以上の全て同じ点 -> 同じもの2つ\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n VP ch(2*n);\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\n ch.resize(k-1);\n return ch;\n}\n\n// 凸判定。縮退を認めないならccwの判定部分を != 1 とする\n// 反時計か分からなければreverse(ps)も試す（コピー渡し）\nbool isCcwConvex(const VP& ps) {\n int n = ps.size();\n rep(i,n) if (ccw(ps[i], ps[(i+1) % n], ps[(i+2) % n]) == -1) return false;\n return true;\n}\n\n// 凸多角形の内部判定 O(n)\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inConvex(Point p, const VP& ps) {\n int n = ps.size();\n int dir = ccw(ps[0], ps[1], p);\n rep (i, n) {\n int ccwc = ccw(ps[i], ps[(i + 1) % n], p);\n if (!ccwc) return 2; // 線分上に存在\n if (ccwc != dir) return 0;\n }\n return 1;\n}\n\n// 凸多角形の内部判定 O(logn)\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inCcwConvex(const VP& ps, Point p) {\n int n = ps.size();\n Point g = (ps[0] + ps[n / 3] + ps[n*2 / 3]) / 3.0;\n if (g == p) return 1;\n Point gp = p - g;\n\n int l = 0, r = n;\n while (l + 1 < r) {\n int mid = (l + r) / 2;\n Point gl = ps[l] - g;\n Point gm = ps[mid] - g;\n if (cross(gl, gm) > 0) {\n if (cross(gl, gp) >= 0 && cross(gm, gp) <= 0) r = mid;\n else l = mid;\n }\n else {\n if (cross(gl, gp) <= 0 && cross(gm, gp) >= 0) l = mid;\n else r = mid;\n }\n }\n r %= n;\n double cr = cross(ps[l] - p, ps[r] - p);\n return EQ(cr, 0) ? 2 : cr < 0 ? 0 : 1;\n}\n\n// 多角形の内部判定\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\nint inPolygon(const VP& ps, Point p) {\n int n = ps.size();\n bool in = false;\n rep (i, n) {\n Point a = ps[i] - p;\n Point b = ps[(i + 1) % n] - p;\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\n if (a.Y > b.Y) swap(a,b);\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\n }\n return in;\n}\n\n\nbool inPolygon(Point p,VP& ps){\n int n = ps.size();\n double sumAngle=0;\n rep(i,n){\n double t = arg(ps[(i+1)%n]-p)-arg(ps[i]-p);\n while(t > +PI) t -= 2*PI;\n while(t < -PI) t += 2*PI;\n sumAngle += t;\n }\n return (abs(sumAngle) > 0.1);\n}\n\nbool inCircle(Point p, Point c, double r){\n return abs(p-c) <= r;\n}\n\nint n,m;\n// ps: n個の頂点\n// cs: m個の中心\n\nbool check(double r, VP &ps, VP &cs){\n // 全頂点が1つ以上の円に含まれている\n rep(i,n){\n bool ok = false;\n rep(j,m){\n if(inCircle(ps[i], cs[j], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n\n // 2つの中心の垂直二等分線\n rep(i,m)rep(j,i){\n Point mid = (cs[i]+cs[j])/2.0;\n double d = abs(cs[i]-mid) + 1000.0;\n VP cpcc = crosspointCC(cs[i],d, cs[j],d);\n assert((int)cpcc.size() == 2);\n rep(k,n){\n if(isecLS(cpcc[0],cpcc[1], ps[k],ps[(k+1)%n])){\n Point crossPoint = crosspointLL(cpcc[0],cpcc[1], ps[k],ps[(k+1)%n]);\n bool ok = false;\n rep(q,m){\n if(inCircle(crossPoint, cs[q], r)) ok = true;\n }\n if(!ok) return false;\n }\n }\n }\n\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\n rep(i,m)rep(j,i){\n VP cpcc = crosspointCC(cs[i],r, cs[j],r);\n for(auto p : cpcc)if(inPolygon(ps, p)){\n bool ok = false;\n rep(k,m)if(k!=i && k!=j){\n if(inCircle(p, cs[k], r)){\n ok = true;\n }\n }\n if(!ok) return false;\n }\n }\n\n return true;\n}\n\nint main(void){\n cin>>n;\n VP ps(n);\n rep(i,n){\n double x,y;\n cin>>x>>y;\n ps[i] = Point(x,y);\n }\n ps = convexHull(ps);\n cin>>m;\n VP cs(m);\n rep(i,m){\n double x,y;\n cin>>x>>y;\n cs[i] = Point(x,y);\n }\n double l = 0, r = 1000000;\n rep(loop,100){\n double radius = (l+r)/2;\n if(check(radius, ps, cs)){\n r = radius;\n }else{\n l = radius;\n }\n }\n printf(\"%.10f\\n\", r);\n return 0;\n}","accuracy":1,"time_ms":1310,"memory_kb":3372,"score_of_the_acc":-0.7695,"final_rank":9},{"submission_id":"aoj_3049_3145342","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long double ldouble;\n\ntypedef complex<ldouble> P;\ntypedef complex<ldouble> V;\ntypedef vector<P> vecP;\ntypedef pair<P,P> L;\ntypedef pair<P,P> S;\ntypedef pair<P,ldouble> C;\nconst ldouble eps=1e-11;\nconst ldouble PI=acos(-1);\nconst ldouble PI2=PI*2.0;\n \nnamespace std{\n bool operator < (const P &a,const P &b){\n return (a.real()!=b.real()?\n a.real() <b.real():\n a.imag() <b.imag());\n }\n};\n \nV normal(V a){\n assert( abs(a)>0 );\n return a/abs(a);\n}\n \nldouble Sqrt( ldouble x ){\n if(x<0)return 0;\n else return sqrt(x);\n}\n \nP Vector(L a){\n return a.second-a.first;\n}\n \nbool eq(ldouble a,ldouble b){\n return (-eps<a-b&&a-b<eps);\n}\n \nbool eq(P a,P b){\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\n}\n \nldouble dot(P a,P b){\n return real(b*conj(a));\n}\n \nldouble cross(P a,P b){\n return imag(b*conj(a));\n}\n \nldouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n \nldouble getTime(V a,V b){\n assert( eq(cross(a,b),0) );\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\n}\n \n \nP project(P a,P b,P c){\n b-=a,c-=a;\n return a+b*real(c/b);\n}\n \nP reflect(P a,P b,P c){\n b-=a,c-=a;\n return a+b*conj(c/b);\n}\n \nint ccw(P a,P b,P c){\n P ab=b-a,ac=c-a;\n P k=ac*conj(ab);\n if(k.imag()> eps )return 1;\n if(k.imag()< -eps )return -1;\n if(k.real()< -eps )return 2;\n if(abs(ab) + eps <abs(ac))return -2;\n return 0;\n}\n \nbool isParallel(P a,P b){\n return eq(0, cross(a,b));\n}\n \nbool isParallel(S a,S b){\n return eq(0, cross( Vector(a) , Vector(b) ) );\n}\n \nbool onLP(L l,P p){\n P a=l.first, b=l.second;\n return eq(0, cross(b-a,p-a));\n}\n \nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\n}\n \nbool isCrossSS(S s0,S s1){\n P a=s0.first, b=s0.second;\n P c=s1.first, d=s1.second;\n int f0 = ccw(a,b,c) * ccw(a,b,d);\n int f1 = ccw(c,d,a) * ccw(c,d,b);\n return (f0<=0 && f1<=0);\n}\n \nbool isCrossLS(L l,S s){\n P a=l.first, b=l.second;\n P c=s.first, d=s.second;\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\n}\n \nldouble distLP(L l,P p){\n P a=l.first, b=l.second;\n ldouble res = cross(b-a,p-a) / abs(b-a);\n return abs(res);\n}\n \nldouble distSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return distLP(s,p);\n}\n \nldouble distSS(S s0,S s1){\n if( isCrossSS(s0,s1) )return 0;\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\n return min(res0,res1);\n}\n \nP getCrossLL(L l0,L l1){\n P a=l0.first, b=l0.second;\n P c=l1.first, d=l1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n \n \n \nint inPolygon(const vecP &t,P p){\n int n=t.size();\n ldouble sum=0;\n for(int i=0;i<n;i++){\n P a=t[i],b=t[(i+1==n?0:i+1)];\n if( ccw(a,b,p)==0 )return 1;\n sum+= getArg(a-p,b-p);\n }\n if( abs(sum) < eps )return 0;\n else return 2;\n}\n \nvecP andrewScan(vecP &t){\n int N=t.size(),C=0;\n vecP R(N);\n for(int i=0;i<N;i++){\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\n R[C++]=t[i];\n }\n vecP res(C);\n for(int i=0;i<C;i++)res[i]=R[i];\n return res;\n}\n \nvecP convexHull(vecP &t){\n sort(t.begin(),t.end());\n vecP u=andrewScan(t);\n reverse(t.begin(),t.end());\n vecP l=andrewScan(t);\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\n return u;\n}\n \nvecP cutConvex(vecP &t,L l){\n P a=l.first, b=l.second;\n int N=t.size();\n vecP res;\n for(int i=0;i<N;i++){\n P c=t[i],d=t[(i+1)%N];\n int C=ccw(a,b,c),D=ccw(a,b,d);\n if(C!=-1)res.push_back(c);\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\n }\n return res;\n}\n \nP getVector(const vecP &t, int id){\n int n=t.size();\n return t[ (id+1)%n ] - t[id%n];\n}\n \nldouble convex_diameter(vecP &t) {\n int n = t.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(t[i]) > imag(t[is])) is = i;\n if (imag(t[i]) < imag(t[js])) js = i;\n }\n ldouble maxd = norm(t[is]-t[js]);\n \n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n \n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\n \n else i = (i+1) % n;\n if (norm(t[i]-t[j]) > maxd) {\n maxd = norm(t[i]-t[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n \nbool compare_y(const P &a,const P &b){\n return a.imag() < b.imag();\n}\n \nldouble closest_pair(P *a, int n){\n if(n <= 1) return 1e30;\n int m = n / 2;\n ldouble x = a[m].real();\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n inplace_merge(a, a + m, a + n, compare_y);\n vector<P> b;\n for(int i=0;i<n;i++){\n if( abs(a[i].real() - x) >= d) continue;\n for(int j=0;j<(int)b.size();j++){\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\n if(dy >= d) break;\n d = min(d, sqrt(dx * dx + dy * dy));\n }\n b.push_back(a[i]);\n }\n return d;\n}\n \nP _pool[200005];\nldouble minDist(vecP &t){\n int n=t.size();\n for(int i=0;i<n;i++)_pool[i]=t[i];\n sort( _pool, _pool+n);\n return closest_pair(_pool, n);\n}\n \nint getStateCC(C a,C b){\n ldouble ar=a.second, br=b.second;\n ldouble dist=abs(a.first-b.first);\n if(dist>ar+br+eps)return 4;\n if(dist>ar+br-eps)return 3;\n if(dist>abs(ar-br)+eps)return 2;\n if(dist>abs(ar-br)-eps)return 1;\n return 0;\n}\n \nP getCrossCC(C a,C b){\n P p1=a.first, p2=b.first;\n ldouble r1=a.second, r2=b.second;\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\n}\n \nP getTangentCP_(C a,P p,int flg){\n P base=a.first-p;\n ldouble ar=a.second;\n ldouble w=Sqrt(norm(base)-ar*ar);\n P s=p+base*P(w,ar * flg)/norm(base)*w;\n return s;\n}\n \nvector<S> getTangentCP(C a,P p){\n vector<S> res;\n P s=getTangentCP_(a,p,1);\n P t=getTangentCP_(a,p,-1);\n \n if( eq(s,t) ){\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \n }else{\n res.push_back( S(p,s) );\n res.push_back( S(p,t) );\n }\n return res;\n}\n \nS getInTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble w=ar+br;\n ldouble h=Sqrt(norm(base)-w*w);\n P k=base*P(w,h*flg)/norm(base);\n return S(ap+k*ar,bp-k*br);\n}\n \nS getOutTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble h=br-ar;\n \n ldouble w=Sqrt(norm(base)-h*h);\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\n return S(ap+k*ar,bp+k*br);\n}\n \nvector<S> getTangentCC(C a,C b){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n vector<S> res;\n ldouble dist=abs(ap-bp);\n \n if(dist>ar+br+eps)\n res.push_back(getInTangent(a,b,1));\n \n if(dist>ar+br-eps)\n res.push_back(getInTangent(a,b,-1));\n \n if(dist>abs(ar-br)+eps)\n res.push_back(getOutTangent(a,b,1));\n \n if(dist>abs(ar-br)-eps)\n res.push_back(getOutTangent(a,b,-1));\n \n return res;\n}\n\n\nldouble ex_L, ex_R;\nvecP getCrossCL(C cir,L l){\n P a=l.first, b=l.second;\n ldouble cr=cir.second;\n P cp=cir.first;\n \n vecP res;\n P base=b-a, target=project(a,b,cp);\n \n ldouble length=abs(base), h=abs(cp-target);\n base/=length;\n \n if(cr+eps<h)return res;\n ldouble w=Sqrt(cr*cr-h*h);\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\n\n ex_L = L;\n ex_R = R;\n res.push_back(a+base*L);\n if( eq(L,R) )return res;\n res.push_back(a+base*R);\n \n return res;\n}\n \nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n if( ccw(s.first,s.second, tmp[i] ) == 0)\n res.push_back(tmp[i]);\n return res;\n}\n \nldouble getArea(C c,P a,P b){\n P cp=c.first;\n ldouble cr=c.second;\n \n P va=cp-a, vb=cp-b;\n ldouble A=abs(va), B=abs(vb);\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\n \n if( eq(0, f ) )return 0;\n if(A<cr+eps&&B<cr+eps)return f*0.5;\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\n \n vecP u=getCrossCS(c, S(a,b) );\n \n assert( !u.empty() );\n u.insert(u.begin(), a), u.push_back(b);\n \n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\n return res;\n}\n \nldouble getCrossArea(vecP t,C c){\n int n=t.size();\n if(n<3)return 0;\n ldouble res=0;\n for(int i=0;i<n;i++){\n P a=t[i], b=t[(i+1)%n];\n res+=getArea(c,a,b);\n }\n return res;\n}\n \n \nldouble calcPolygonArea(const vecP &t){\n ldouble res=0;\n int n=t.size();\n for(int i=0;i<n;i++){\n res+= cross( t[ (i+1)%n ],t[i] );\n }\n return abs(res)*0.5;\n}\n\nbool check(const vector<P> &t,const vector<P> &u, ldouble r){\n vector<P> targets;\n for(int i=0;i<(int)t.size();i++){\n P a=t[i], b=t[ (i+1)%t.size() ];\n S seg=S(a,b);\n targets.push_back(a);\n for(int j=0;j<(int)u.size();j++){\n vector<P> tmp = getCrossCS( C(u[j],r) , seg );\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\n }\n }\n for(int i=0;i<(int)u.size();i++){\n for(int j=0;j<i;j++){\n targets.push_back( getCrossCC( C(u[i],r) , C(u[j],r) ) );\n targets.push_back( getCrossCC( C(u[j],r) , C(u[i],r) ) );\n }\n }\n sort(targets.begin(), targets.end());\n targets.erase( unique( targets.begin(), targets.end() ), targets.end() );\n\n for(int i=0;i<(int)targets.size();i++){\n if( inPolygon( t , targets[i] ) == 0 )continue;\n ldouble mini=1e9;\n for(int j=0;j<(int)u.size();j++){\n mini=min(mini, abs( targets[i] - u[j] ) );\n }\n if( mini > r - eps )return false;\n }\n return true;\n}\n\nldouble solve(const vector<P> &t,const vector<P> &u){\n ldouble left=0, right=1e6, mid;\n for(int i=0;i<50;i++){\n mid=(left+right)*0.5;\n if( check(t,u,mid) )right=mid;\n else left=mid;\n }\n return left;\n}\n\nint main(){\n\n int n;\n scanf(\"%d\",&n);\n\n vector< P > t(n);\n for(int i=0;i<n;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n t[i]=P(x,y);\n }\n \n int m;\n scanf(\"%d\",&m);\n vector< P > u(m);\n \n for(int i=0;i<m;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n u[i]=P(x,y);\n }\n\n printf(\"%.10f\\n\", (double)solve(t,u) );\n return 0;\n \n}","accuracy":1,"time_ms":1730,"memory_kb":9980,"score_of_the_acc":-2,"final_rank":12},{"submission_id":"aoj_3049_3145340","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 100010\n\ntypedef double P_type;\ntypedef complex<P_type> P;\nconst P_type P_eps = 1e-9; //整数の時はゼロ\n\nnamespace std{\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\n }\n};\n\nP rotate(P p, double theta){\n return p * P(cos(theta), sin(theta));\n}\n\n//内積\nP_type dot(P a, P b) {\n return (a * conj(b)).real();\n}\n\n//外積\nP_type cross(P a, P b) {\n return (conj(a) * b).imag();\n}\n\n//反時計回り\nint ccw(P a, P b, P c){\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\n return 0; //a -> c -> b\n}\n\n/* 線分abと点cの距離 */\nP_type distanceSP(P a, P b, P c) {\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 直線abと点cの距離 */\nP_type distanceLP(P a, P b, P c) {\n return abs(cross(b-a, c-a)) / abs(b-a);\n}\n\n/* 円の点包含判定 */\nbool isContainedCP(P c, double r, P p){\n return abs(c-p) < r - P_eps; //円周上を含まない\n //return abs(c-p) < r + P_eps; //円周上を含む\n}\n\n/* 直線交差判定 */\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\n return abs(cross(a1-a2, b1-b2)) > P_eps;\n}\n\n/* 線分交差判定 */\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\n \n //線分a と 直線b\n int a = ccw(b1,b2,a1);\n int b = ccw(b1,b2,a2);\n \n //線分b と 直線a\n int c = ccw(a1,a2,b1);\n int d = ccw(a1,a2,b2);\n \n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\n}\n\n/* 直線線分交差判定 */\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \n int a = ccw(a1,a2,b1);\n int b = ccw(a1,a2,b2);\n \n // 直線上のとき a or b = 0 or -2 or 2\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\n}\n\n/* 円交差判定 */\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\n double dist = abs(c1 - c2);\n \n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\n}\n\n/* 円直線交差判定 */\nbool isIntersectedCL(P c, double r, P a1, P a2){\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 円線分交差判定 */\nbool isIntersectedCS(P c, double r, P a1, P a2){\n return isContainedCP(c,r,a1) &&\n isContainedCP(c,r,a2) &&\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\n}\n\n/* 直線/線分交点 */\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\n //assert(isIntersectedLL(a1, a2, b1, b2));\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nP getCrosspointSS(P a1, P a2, P b1, P b2){\n //assert(isIntersectedSS(a1, a2, b1, b2));\n return getCrosspointLL(a1, a2, b1, b2);\n}\n\n/* 円交点 */\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\n //assert(isIntersectedCC(c1, r1, c2, r2));\n \n double dist = abs(c1 - c2);\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\n}\n\n/* 円線分交点 */\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\n //assert(isIntersectedCS(c1, r1, c2, r2));\n \n P base1 = a2 - a1;\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\n P e = (a2 - a1) / abs(a2 - a1);\n P base2 = sqrt(r*r - norm(proj - c));\n return {proj + e*base2, proj - e*base2};\n}\n\n/* 多角形-点包含 */\nbool iscontainedPolyP(vector<P> &g, P p){\n int n = g.size();\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\n }\n return f; //内部 or 外部\n}\n\n/* 射影(直線abとpからの垂線との交点) */\nP getProject(P a, P b, P p){\n P base = b - a;\n return a + base * dot(p - a, base) / norm(base);\n}\n\n/* 反射(直線abを対称軸としたpの線対称の位置) */\nP getReflection(P a, P b, P p){\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\n}\n\n\nint main(){\n int n, m, x, y;\n P pxy[101], cxy[101];\n vector<P> pol;\n\n scanf(\"%d\", &n);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\", &x, &y);\n pxy[i] = P(x, y);\n pol.push_back(pxy[i]);\n }\n pxy[n] = pxy[0];\n \n\n scanf(\"%d\", &m);\n \n for(int i=0;i<m;i++){\n scanf(\"%d%d\", &x, &y);\n cxy[i] = P(x, y);\n\n }\n\n P_type l = 0, r = 1e6;\n\n while(abs(l-r) > 1e-6){\n P_type R = (l+r)/2;\n vector<P> vec; \n \n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\n\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * (P_type)1e-7;\n\n vec.push_back(gc.first + e * (P_type)1);\n vec.push_back(gc.first + e * (P_type)-1);\n vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\n\n auto e = (pxy[j] - pxy[j+1]) / abs(pxy[j] - pxy[j+1]) * (P_type)1e-7;\n\n vec.push_back(gc.first + e * (P_type)1);\n vec.push_back(gc.first + e * (P_type)-1);\n vec.push_back(gc.second + e * (P_type)1);\n vec.push_back(gc.second + e * (P_type)-1);\n }\n }\n\n bool res = true;\n \n for(int i=0;i<vec.size() && res;i++){\n if(iscontainedPolyP(pol, vec[i])){\n\n bool f = false;\n for(int j=0;j<m && !f;j++){\n f |= isContainedCP(cxy[j], R, vec[i]);\n }\n\n res &= f;\n }\n }\n\n if(res){\n r = R;\n }else{\n l = R;\n }\n }\n\n printf(\"%.10lf\\n\", (double)l);\n \n \n return 0;\n}","accuracy":0.38095238095238093,"time_ms":30,"memory_kb":3768,"score_of_the_acc":-0.0845,"final_rank":14},{"submission_id":"aoj_3049_3145335","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef double Real;\ntypedef complex<Real> P;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n#define eps 1e-8\n\nint n,m;\nP cvx[125];\nP pts[125];\n\nReal cross(P a, P b){\n return imag(conj(a)*b);\n}\nReal dot(P a, P b){\n return real(conj(a)*b);\n}\n\nbool inner(P p){\n P g = (cvx[0] + cvx[n/3] + cvx[2*n/3]) / 3.0;\n // g += P(1e-7, 1e-7);\n int a = 0, b = n;\n while(a+1<b){\n int c = (a+b)/2;\n if(cross(cvx[a]-g, cvx[c]-g)>0){\n if(cross(cvx[a]-g, p-g)>0 && cross(cvx[c]-g, p-g)<0) b=c;\n else a=c;\n }else{\n if(cross(cvx[a]-g, p-g)<0 && cross(cvx[c]-g, p-g)>0) a=c;\n else b=c;\n }\n }\n b %= n;\n if(cross(cvx[a]-p, cvx[b]-p)<-eps) return false;\n return true;\n}\n\nbool inner2(P p){\n bool in = false;\n REP(i,n){\n P a = cvx[i]-p;\n P b = cvx[(i+1)%n]-p;\n if(imag(a)>imag(b))swap(a,b);\n if(imag(a)<=0 && 0<imag(b)){\n if(cross(a,b)<0)in = !in;\n }\n if(abs(cross(a,b))<eps && dot(a,b)<=0)return true;\n }\n return in;\n}\n\nint main(){\n scanf(\"%d\",&n);\n REP(i,n){\n Real x,y;\n scanf(\"%lf%lf\",&x,&y);\n cvx[i] = P(x,y);\n }\n scanf(\"%d\",&m);\n REP(i,m){\n Real x,y;\n scanf(\"%lf%lf\",&x,&y);\n pts[i] = P(x,y);\n }\n vector<P> po;\n const Real PI = 4.0*atan(1.0);\n\n REP(i,n)po.push_back(cvx[i]);\n\n REP(i,m)REP(j,i){\n P a = pts[i], b = pts[j];\n P s1 = (a+b)/2.0;\n P d1 = (b-a)*exp(P(0,PI/2.0));\n REP(ii,n){\n P x = cvx[ii], y = cvx[(ii+1)%n];\n P s2 = x;\n P d2 = y-x;\n if(cross(d1,s2-s1)*cross(d1,s2+d2-s1) >= eps)continue;\n if(abs(cross(d2,d1))<eps)continue;\n P o = s1 + d1*cross(d2, s2-s1)/cross(d2, d1);\n // #define X real()\n // #define Y imag()\n // if(x.X <= y.X && (o.X < x.X-eps || o.X > y.X+eps))continue;\n // if(x.X >= y.X && (o.X > x.X+eps || o.X < y.X-eps))continue;\n // if(x.Y <= y.X && (o.Y < x.Y-eps || o.Y > y.Y+eps))continue;\n // if(x.Y >= y.X && (o.Y > x.Y+eps || o.Y < y.Y-eps))continue;\n po.push_back(o);\n }\n }\n\n REP(i,m)REP(j,i)REP(k,j){\n P a = pts[i], b = pts[j], c = pts[k];\n if(abs(cross(b-a,c-a))<eps)continue;\n P ab = (a+b)/2.0;\n P ac = (a+c)/2.0;\n P abd = (b-a)*exp(P(0,PI/2.0));\n P acd = (c-a)*exp(P(0,PI/2.0));\n P o = ab + abd * cross(acd, ac-ab) / cross(acd, abd);\n if(inner2(o))po.push_back(o);\n }\n\n Real ans = 0.0;\n REP(i,po.size()){\n P o = po[i];\n Real tmp = 1e18;\n REP(ii,m){\n CHMIN(tmp, abs(pts[ii]-o));\n }\n CHMAX(ans, tmp);\n }\n printf(\"%.9f\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":4992,"score_of_the_acc":-0.3253,"final_rank":4},{"submission_id":"aoj_3049_3137016","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long double ldouble;\n\ntypedef complex<ldouble> P;\ntypedef complex<ldouble> V;\ntypedef vector<P> vecP;\ntypedef pair<P,P> L;\ntypedef pair<P,P> S;\ntypedef pair<P,ldouble> C;\nconst ldouble eps=1e-11;\nconst ldouble PI=acos(-1);\nconst ldouble PI2=PI*2.0;\n \nnamespace std{\n bool operator < (const P &a,const P &b){\n return (a.real()!=b.real()?\n a.real() <b.real():\n a.imag() <b.imag());\n }\n};\n \nV normal(V a){\n assert( abs(a)>0 );\n return a/abs(a);\n}\n \nldouble Sqrt( ldouble x ){\n if(x<0)return 0;\n else return sqrt(x);\n}\n \nP Vector(L a){\n return a.second-a.first;\n}\n \nbool eq(ldouble a,ldouble b){\n return (-eps<a-b&&a-b<eps);\n}\n \nbool eq(P a,P b){\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\n}\n \nldouble dot(P a,P b){\n return real(b*conj(a));\n}\n \nldouble cross(P a,P b){\n return imag(b*conj(a));\n}\n \nldouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n \nldouble getTime(V a,V b){\n assert( eq(cross(a,b),0) );\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\n}\n \n \nP project(P a,P b,P c){\n b-=a,c-=a;\n return a+b*real(c/b);\n}\n \nP reflect(P a,P b,P c){\n b-=a,c-=a;\n return a+b*conj(c/b);\n}\n \nint ccw(P a,P b,P c){\n P ab=b-a,ac=c-a;\n P k=ac*conj(ab);\n if(k.imag()> eps )return 1;\n if(k.imag()< -eps )return -1;\n if(k.real()< -eps )return 2;\n if(abs(ab) + eps <abs(ac))return -2;\n return 0;\n}\n \nbool isParallel(P a,P b){\n return eq(0, cross(a,b));\n}\n \nbool isParallel(S a,S b){\n return eq(0, cross( Vector(a) , Vector(b) ) );\n}\n \nbool onLP(L l,P p){\n P a=l.first, b=l.second;\n return eq(0, cross(b-a,p-a));\n}\n \nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\n}\n \nbool isCrossSS(S s0,S s1){\n P a=s0.first, b=s0.second;\n P c=s1.first, d=s1.second;\n int f0 = ccw(a,b,c) * ccw(a,b,d);\n int f1 = ccw(c,d,a) * ccw(c,d,b);\n return (f0<=0 && f1<=0);\n}\n \nbool isCrossLS(L l,S s){\n P a=l.first, b=l.second;\n P c=s.first, d=s.second;\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\n}\n \nldouble distLP(L l,P p){\n P a=l.first, b=l.second;\n ldouble res = cross(b-a,p-a) / abs(b-a);\n return abs(res);\n}\n \nldouble distSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return distLP(s,p);\n}\n \nldouble distSS(S s0,S s1){\n if( isCrossSS(s0,s1) )return 0;\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\n return min(res0,res1);\n}\n \nP getCrossLL(L l0,L l1){\n P a=l0.first, b=l0.second;\n P c=l1.first, d=l1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n \n \n \nint inPolygon(vecP &t,P p){\n int n=t.size();\n ldouble sum=0;\n for(int i=0;i<n;i++){\n P a=t[i],b=t[(i+1==n?0:i+1)];\n if( ccw(a,b,p)==0 )return 1;\n sum+= getArg(a-p,b-p);\n }\n if( abs(sum) < eps )return 0;\n else return 2;\n}\n \nvecP andrewScan(vecP &t){\n int N=t.size(),C=0;\n vecP R(N);\n for(int i=0;i<N;i++){\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\n R[C++]=t[i];\n }\n vecP res(C);\n for(int i=0;i<C;i++)res[i]=R[i];\n return res;\n}\n \nvecP convexHull(vecP &t){\n sort(t.begin(),t.end());\n vecP u=andrewScan(t);\n reverse(t.begin(),t.end());\n vecP l=andrewScan(t);\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\n return u;\n}\n \nvecP cutConvex(vecP &t,L l){\n P a=l.first, b=l.second;\n int N=t.size();\n vecP res;\n for(int i=0;i<N;i++){\n P c=t[i],d=t[(i+1)%N];\n int C=ccw(a,b,c),D=ccw(a,b,d);\n if(C!=-1)res.push_back(c);\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\n }\n return res;\n}\n \nP getVector(const vecP &t, int id){\n int n=t.size();\n return t[ (id+1)%n ] - t[id%n];\n}\n \nldouble convex_diameter(vecP &t) {\n int n = t.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(t[i]) > imag(t[is])) is = i;\n if (imag(t[i]) < imag(t[js])) js = i;\n }\n ldouble maxd = norm(t[is]-t[js]);\n \n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n \n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\n \n else i = (i+1) % n;\n if (norm(t[i]-t[j]) > maxd) {\n maxd = norm(t[i]-t[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n \nbool compare_y(const P &a,const P &b){\n return a.imag() < b.imag();\n}\n \nldouble closest_pair(P *a, int n){\n if(n <= 1) return 1e30;\n int m = n / 2;\n ldouble x = a[m].real();\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n inplace_merge(a, a + m, a + n, compare_y);\n vector<P> b;\n for(int i=0;i<n;i++){\n if( abs(a[i].real() - x) >= d) continue;\n for(int j=0;j<(int)b.size();j++){\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\n if(dy >= d) break;\n d = min(d, sqrt(dx * dx + dy * dy));\n }\n b.push_back(a[i]);\n }\n return d;\n}\n \nP _pool[200005];\nldouble minDist(vecP &t){\n int n=t.size();\n for(int i=0;i<n;i++)_pool[i]=t[i];\n sort( _pool, _pool+n);\n return closest_pair(_pool, n);\n}\n \nint getStateCC(C a,C b){\n ldouble ar=a.second, br=b.second;\n ldouble dist=abs(a.first-b.first);\n if(dist>ar+br+eps)return 4;\n if(dist>ar+br-eps)return 3;\n if(dist>abs(ar-br)+eps)return 2;\n if(dist>abs(ar-br)-eps)return 1;\n return 0;\n}\n \nP getCrossCC(C a,C b){\n P p1=a.first, p2=b.first;\n ldouble r1=a.second, r2=b.second;\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\n}\n \nP getTangentCP_(C a,P p,int flg){\n P base=a.first-p;\n ldouble ar=a.second;\n ldouble w=Sqrt(norm(base)-ar*ar);\n P s=p+base*P(w,ar * flg)/norm(base)*w;\n return s;\n}\n \nvector<S> getTangentCP(C a,P p){\n vector<S> res;\n P s=getTangentCP_(a,p,1);\n P t=getTangentCP_(a,p,-1);\n \n if( eq(s,t) ){\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \n }else{\n res.push_back( S(p,s) );\n res.push_back( S(p,t) );\n }\n return res;\n}\n \nS getInTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble w=ar+br;\n ldouble h=Sqrt(norm(base)-w*w);\n P k=base*P(w,h*flg)/norm(base);\n return S(ap+k*ar,bp-k*br);\n}\n \nS getOutTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble h=br-ar;\n \n ldouble w=Sqrt(norm(base)-h*h);\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\n return S(ap+k*ar,bp+k*br);\n}\n \nvector<S> getTangentCC(C a,C b){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n vector<S> res;\n ldouble dist=abs(ap-bp);\n \n if(dist>ar+br+eps)\n res.push_back(getInTangent(a,b,1));\n \n if(dist>ar+br-eps)\n res.push_back(getInTangent(a,b,-1));\n \n if(dist>abs(ar-br)+eps)\n res.push_back(getOutTangent(a,b,1));\n \n if(dist>abs(ar-br)-eps)\n res.push_back(getOutTangent(a,b,-1));\n \n return res;\n}\n\n\nldouble ex_L, ex_R;\nvecP getCrossCL(C cir,L l){\n P a=l.first, b=l.second;\n ldouble cr=cir.second;\n P cp=cir.first;\n \n vecP res;\n P base=b-a, target=project(a,b,cp);\n \n ldouble length=abs(base), h=abs(cp-target);\n base/=length;\n \n if(cr+eps<h)return res;\n ldouble w=Sqrt(cr*cr-h*h);\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\n\n ex_L = L;\n ex_R = R;\n res.push_back(a+base*L);\n if( eq(L,R) )return res;\n res.push_back(a+base*R);\n \n return res;\n}\n \nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n if( ccw(s.first,s.second, tmp[i] ) == 0)\n res.push_back(tmp[i]);\n return res;\n}\n \nldouble getArea(C c,P a,P b){\n P cp=c.first;\n ldouble cr=c.second;\n \n P va=cp-a, vb=cp-b;\n ldouble A=abs(va), B=abs(vb);\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\n \n if( eq(0, f ) )return 0;\n if(A<cr+eps&&B<cr+eps)return f*0.5;\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\n \n vecP u=getCrossCS(c, S(a,b) );\n \n assert( !u.empty() );\n u.insert(u.begin(), a), u.push_back(b);\n \n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\n return res;\n}\n \nldouble getCrossArea(vecP t,C c){\n int n=t.size();\n if(n<3)return 0;\n ldouble res=0;\n for(int i=0;i<n;i++){\n P a=t[i], b=t[(i+1)%n];\n res+=getArea(c,a,b);\n }\n return res;\n}\n \n \nldouble calcPolygonArea(const vecP &t){\n ldouble res=0;\n int n=t.size();\n for(int i=0;i<n;i++){\n res+= cross( t[ (i+1)%n ],t[i] );\n }\n return abs(res)*0.5;\n}\n\n\nbool check2(const vector<P> &u,ldouble r, S s){\n typedef pair<ldouble,ldouble> Pair;\n vector< Pair > t,nt;\n \n for(int i=0;i<(int)u.size();i++){\n vector< P > tmp = getCrossCL( C(u[i] , r) , s );\n t.push_back(Pair( ex_L, ex_R ));\n }\n sort( t.begin(), t.end() );\n for(int i=0;i<(int)t.size();i++){\n if(i+1<(int)t.size() && t[i].second > t[i+1].first-eps ){\n t[i+1].first=min(t[i+1].first, t[i].first );\n t[i+1].second=max(t[i+1].second, t[i].second );\n }else{\n nt.push_back(t[i]);\n }\n }\n \n for(int i=0;i< (int)nt.size();i++)\n if(nt[i].first < eps && nt[i].second > abs(s.second-s.first)-eps )\n return true;\n \n return false;\n}\n\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\n for(int i=0;i<(int)t.size();i++){\n \n if( check2(u,r,t[i]) ){\n continue;\n }else{\n return false;\n }\n }\n return true;\n}\n\nldouble solve(const vector<S> &t,const vector<P> &u){\n ldouble left=0, right=1e6, mid;\n for(int i=0;i<50;i++){\n mid=(left+right)*0.5;\n if( check(t,u,mid) )right=mid;\n else left=mid;\n }\n return left;\n}\n\nint main(){\n\n int n;\n scanf(\"%d\",&n);\n\n P cp=P(0,0);\n vector< P > t(n), t2;\n for(int i=0;i<n;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n t[i]=P(x,y);\n cp+=t[i];\n }\n cp /= (ldouble)n;\n \n \n // cout<< (double)cp.real() <<' '<< (double)cp.imag() <<endl;\n vector< vector< P > > G(n);\n for(int i=0;i<n;i++){\n \n P base=t[ (i+1)%n ] - t[i];\n\n int Cnt=70/n+5;\n // Cnt * Cnt * n*n <= 900\n // Cnt*n ^2 <= 30^2\n // Cnt*n <= 30\n // Cnt = 30/n\n for(int j=1;j< Cnt ;j++)\n G[i].push_back( t[i] + base*( (ldouble)j/ (ldouble)Cnt ) );\n }\n \n int m;\n scanf(\"%d\",&m);\n vector< P > u(m);\n for(int i=0;i<m;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n u[i]=P(x,y);\n }\n \n vector< S > w;\n for(int i=0;i<n;i++){\n w.push_back( S(t[i], t[ (i+1)%n ] ) );\n w.push_back( S(t[i], cp ) );\n for(P a:G[i])\n w.push_back( S(a, cp ) );\n // cout<<w.size()<<endl;\n for(int j=0;j<i;j++){\n for(P a:G[i])\n for(P b:G[j])\n w.push_back( S(a,b) );\n }\n }\n\n printf(\"%.10f\\n\", (double)solve(w,u) );\n return 0;\n \n}\n/*\n\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\n vector<P> targets;\n for(int i=0;i<(int)t.size();i++){\n for(int j=0;j<(int)u.size();j++){\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\n targets.push_back(t[i].first);\n targets.push_back(t[i].second);\n }\n }\n sort( targets.begin(), targets.end() );\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\n for(int i=0;i<(int)targets.size();i++){\n\n ldouble mini=1e9;\n for(int j=0;j<(int)u.size();j++){\n ldouble dist=abs(targets[i]-u[j]);\n mini=min(mini,dist);\n }\n if( mini > r - eps )return false;\n }\n return true;\n}\n\n*/","accuracy":0.16666666666666666,"time_ms":1030,"memory_kb":3460,"score_of_the_acc":-0.6199,"final_rank":18},{"submission_id":"aoj_3049_3136860","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long double ldouble;\n\ntypedef complex<ldouble> P;\ntypedef complex<ldouble> V;\ntypedef vector<P> vecP;\ntypedef pair<P,P> L;\ntypedef pair<P,P> S;\ntypedef pair<P,ldouble> C;\nconst ldouble eps=1e-11;\nconst ldouble PI=acos(-1);\nconst ldouble PI2=PI*2.0;\n \nnamespace std{\n bool operator < (const P &a,const P &b){\n return (a.real()!=b.real()?\n a.real() <b.real():\n a.imag() <b.imag());\n }\n};\n \nV normal(V a){\n assert( abs(a)>0 );\n return a/abs(a);\n}\n \nldouble Sqrt( ldouble x ){\n if(x<0)return 0;\n else return sqrt(x);\n}\n \nP Vector(L a){\n return a.second-a.first;\n}\n \nbool eq(ldouble a,ldouble b){\n return (-eps<a-b&&a-b<eps);\n}\n \nbool eq(P a,P b){\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\n}\n \nldouble dot(P a,P b){\n return real(b*conj(a));\n}\n \nldouble cross(P a,P b){\n return imag(b*conj(a));\n}\n \nldouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n \nldouble getTime(V a,V b){\n assert( eq(cross(a,b),0) );\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\n}\n \n \nP project(P a,P b,P c){\n b-=a,c-=a;\n return a+b*real(c/b);\n}\n \nP reflect(P a,P b,P c){\n b-=a,c-=a;\n return a+b*conj(c/b);\n}\n \nint ccw(P a,P b,P c){\n P ab=b-a,ac=c-a;\n P k=ac*conj(ab);\n if(k.imag()> eps )return 1;\n if(k.imag()< -eps )return -1;\n if(k.real()< -eps )return 2;\n if(abs(ab) + eps <abs(ac))return -2;\n return 0;\n}\n \nbool isParallel(P a,P b){\n return eq(0, cross(a,b));\n}\n \nbool isParallel(S a,S b){\n return eq(0, cross( Vector(a) , Vector(b) ) );\n}\n \nbool onLP(L l,P p){\n P a=l.first, b=l.second;\n return eq(0, cross(b-a,p-a));\n}\n \nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\n}\n \nbool isCrossSS(S s0,S s1){\n P a=s0.first, b=s0.second;\n P c=s1.first, d=s1.second;\n int f0 = ccw(a,b,c) * ccw(a,b,d);\n int f1 = ccw(c,d,a) * ccw(c,d,b);\n return (f0<=0 && f1<=0);\n}\n \nbool isCrossLS(L l,S s){\n P a=l.first, b=l.second;\n P c=s.first, d=s.second;\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\n}\n \nldouble distLP(L l,P p){\n P a=l.first, b=l.second;\n ldouble res = cross(b-a,p-a) / abs(b-a);\n return abs(res);\n}\n \nldouble distSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return distLP(s,p);\n}\n \nldouble distSS(S s0,S s1){\n if( isCrossSS(s0,s1) )return 0;\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\n return min(res0,res1);\n}\n \nP getCrossLL(L l0,L l1){\n P a=l0.first, b=l0.second;\n P c=l1.first, d=l1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n \n \n \nint inPolygon(vecP &t,P p){\n int n=t.size();\n ldouble sum=0;\n for(int i=0;i<n;i++){\n P a=t[i],b=t[(i+1==n?0:i+1)];\n if( ccw(a,b,p)==0 )return 1;\n sum+= getArg(a-p,b-p);\n }\n if( abs(sum) < eps )return 0;\n else return 2;\n}\n \nvecP andrewScan(vecP &t){\n int N=t.size(),C=0;\n vecP R(N);\n for(int i=0;i<N;i++){\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\n R[C++]=t[i];\n }\n vecP res(C);\n for(int i=0;i<C;i++)res[i]=R[i];\n return res;\n}\n \nvecP convexHull(vecP &t){\n sort(t.begin(),t.end());\n vecP u=andrewScan(t);\n reverse(t.begin(),t.end());\n vecP l=andrewScan(t);\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\n return u;\n}\n \nvecP cutConvex(vecP &t,L l){\n P a=l.first, b=l.second;\n int N=t.size();\n vecP res;\n for(int i=0;i<N;i++){\n P c=t[i],d=t[(i+1)%N];\n int C=ccw(a,b,c),D=ccw(a,b,d);\n if(C!=-1)res.push_back(c);\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\n }\n return res;\n}\n \nP getVector(const vecP &t, int id){\n int n=t.size();\n return t[ (id+1)%n ] - t[id%n];\n}\n \nldouble convex_diameter(vecP &t) {\n int n = t.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(t[i]) > imag(t[is])) is = i;\n if (imag(t[i]) < imag(t[js])) js = i;\n }\n ldouble maxd = norm(t[is]-t[js]);\n \n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n \n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\n \n else i = (i+1) % n;\n if (norm(t[i]-t[j]) > maxd) {\n maxd = norm(t[i]-t[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n \nbool compare_y(const P &a,const P &b){\n return a.imag() < b.imag();\n}\n \nldouble closest_pair(P *a, int n){\n if(n <= 1) return 1e30;\n int m = n / 2;\n ldouble x = a[m].real();\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n inplace_merge(a, a + m, a + n, compare_y);\n vector<P> b;\n for(int i=0;i<n;i++){\n if( abs(a[i].real() - x) >= d) continue;\n for(int j=0;j<(int)b.size();j++){\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\n if(dy >= d) break;\n d = min(d, sqrt(dx * dx + dy * dy));\n }\n b.push_back(a[i]);\n }\n return d;\n}\n \nP _pool[200005];\nldouble minDist(vecP &t){\n int n=t.size();\n for(int i=0;i<n;i++)_pool[i]=t[i];\n sort( _pool, _pool+n);\n return closest_pair(_pool, n);\n}\n \nint getStateCC(C a,C b){\n ldouble ar=a.second, br=b.second;\n ldouble dist=abs(a.first-b.first);\n if(dist>ar+br+eps)return 4;\n if(dist>ar+br-eps)return 3;\n if(dist>abs(ar-br)+eps)return 2;\n if(dist>abs(ar-br)-eps)return 1;\n return 0;\n}\n \nP getCrossCC(C a,C b){\n P p1=a.first, p2=b.first;\n ldouble r1=a.second, r2=b.second;\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\n}\n \nP getTangentCP_(C a,P p,int flg){\n P base=a.first-p;\n ldouble ar=a.second;\n ldouble w=Sqrt(norm(base)-ar*ar);\n P s=p+base*P(w,ar * flg)/norm(base)*w;\n return s;\n}\n \nvector<S> getTangentCP(C a,P p){\n vector<S> res;\n P s=getTangentCP_(a,p,1);\n P t=getTangentCP_(a,p,-1);\n \n if( eq(s,t) ){\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \n }else{\n res.push_back( S(p,s) );\n res.push_back( S(p,t) );\n }\n return res;\n}\n \nS getInTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble w=ar+br;\n ldouble h=Sqrt(norm(base)-w*w);\n P k=base*P(w,h*flg)/norm(base);\n return S(ap+k*ar,bp-k*br);\n}\n \nS getOutTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble h=br-ar;\n \n ldouble w=Sqrt(norm(base)-h*h);\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\n return S(ap+k*ar,bp+k*br);\n}\n \nvector<S> getTangentCC(C a,C b){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n vector<S> res;\n ldouble dist=abs(ap-bp);\n \n if(dist>ar+br+eps)\n res.push_back(getInTangent(a,b,1));\n \n if(dist>ar+br-eps)\n res.push_back(getInTangent(a,b,-1));\n \n if(dist>abs(ar-br)+eps)\n res.push_back(getOutTangent(a,b,1));\n \n if(dist>abs(ar-br)-eps)\n res.push_back(getOutTangent(a,b,-1));\n \n return res;\n}\n \n \nvecP getCrossCL(C cir,L l){\n P a=l.first, b=l.second;\n ldouble cr=cir.second;\n P cp=cir.first;\n \n vecP res;\n P base=b-a, target=project(a,b,cp);\n \n ldouble length=abs(base), h=abs(cp-target);\n base/=length;\n \n if(cr+eps<h)return res;\n ldouble w=Sqrt(cr*cr-h*h);\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\n \n res.push_back(a+base*L);\n if( eq(L,R) )return res;\n res.push_back(a+base*R);\n \n return res;\n}\n \nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n if( ccw(s.first,s.second, tmp[i] ) == 0)\n res.push_back(tmp[i]);\n \n return res;\n}\n \nldouble getArea(C c,P a,P b){\n P cp=c.first;\n ldouble cr=c.second;\n \n P va=cp-a, vb=cp-b;\n ldouble A=abs(va), B=abs(vb);\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\n \n if( eq(0, f ) )return 0;\n if(A<cr+eps&&B<cr+eps)return f*0.5;\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\n \n vecP u=getCrossCS(c, S(a,b) );\n \n assert( !u.empty() );\n u.insert(u.begin(), a), u.push_back(b);\n \n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\n return res;\n}\n \nldouble getCrossArea(vecP t,C c){\n int n=t.size();\n if(n<3)return 0;\n ldouble res=0;\n for(int i=0;i<n;i++){\n P a=t[i], b=t[(i+1)%n];\n res+=getArea(c,a,b);\n }\n return res;\n}\n \n \nldouble calcPolygonArea(const vecP &t){\n ldouble res=0;\n int n=t.size();\n for(int i=0;i<n;i++){\n res+= cross( t[ (i+1)%n ],t[i] );\n }\n return abs(res)*0.5;\n}\n\n\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\n vector<P> targets;\n for(int i=0;i<(int)t.size();i++){\n for(int j=0;j<(int)u.size();j++){\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\n targets.push_back(t[i].first);\n targets.push_back(t[i].second);\n }\n }\n sort( targets.begin(), targets.end() );\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\n for(int i=0;i<(int)targets.size();i++){\n\n ldouble mini=1e9;\n for(int j=0;j<(int)u.size();j++){\n ldouble dist=abs(targets[i]-u[j]);\n mini=min(mini,dist);\n }\n if( mini > r - eps )return false;\n }\n return true;\n}\n\nldouble solve(const vector<S> &t,const vector<P> &u){\n ldouble left=0, right=1e6, mid;\n for(int i=0;i<50;i++){\n mid=(left+right)*0.5;\n if( check(t,u,mid) )right=mid;\n else left=mid;\n }\n return left;\n}\n\nint main(){\n \n int n;\n scanf(\"%d\",&n);\n P cp=P(0,0);\n vector< P > t(n);\n for(int i=0;i<n;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n t[i]=P(x,y);\n cp+=t[i];\n }\n \n t.push_back( cp / (ldouble)n );\n \n \n int m;\n scanf(\"%d\",&m);\n vector< P > u(m);\n for(int i=0;i<m;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n u[i]=P(x,y);\n }\n\n vector< S > w;\n for(int i=0;i<n;i++){\n for(int j=0;j<i;j++){\n w.push_back( S(t[i],t[j]) );\n }\n }\n \n printf(\"%.10f\\n\", (double)solve(w,u) );\n return 0;\n \n}","accuracy":0.023809523809523808,"time_ms":10,"memory_kb":9536,"score_of_the_acc":-0.9337,"final_rank":20},{"submission_id":"aoj_3049_3136858","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long double ldouble;\n\ntypedef complex<ldouble> P;\ntypedef complex<ldouble> V;\ntypedef vector<P> vecP;\ntypedef pair<P,P> L;\ntypedef pair<P,P> S;\ntypedef pair<P,ldouble> C;\nconst ldouble eps=1e-11;\nconst ldouble PI=acos(-1);\nconst ldouble PI2=PI*2.0;\n \nnamespace std{\n bool operator < (const P &a,const P &b){\n return (a.real()!=b.real()?\n a.real() <b.real():\n a.imag() <b.imag());\n }\n};\n \nV normal(V a){\n assert( abs(a)>0 );\n return a/abs(a);\n}\n \nldouble Sqrt( ldouble x ){\n if(x<0)return 0;\n else return sqrt(x);\n}\n \nP Vector(L a){\n return a.second-a.first;\n}\n \nbool eq(ldouble a,ldouble b){\n return (-eps<a-b&&a-b<eps);\n}\n \nbool eq(P a,P b){\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\n}\n \nldouble dot(P a,P b){\n return real(b*conj(a));\n}\n \nldouble cross(P a,P b){\n return imag(b*conj(a));\n}\n \nldouble getArg(P a,P b){\n return arg(b*conj(a));\n}\n \nldouble getTime(V a,V b){\n assert( eq(cross(a,b),0) );\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\n}\n \n \nP project(P a,P b,P c){\n b-=a,c-=a;\n return a+b*real(c/b);\n}\n \nP reflect(P a,P b,P c){\n b-=a,c-=a;\n return a+b*conj(c/b);\n}\n \nint ccw(P a,P b,P c){\n P ab=b-a,ac=c-a;\n P k=ac*conj(ab);\n if(k.imag()> eps )return 1;\n if(k.imag()< -eps )return -1;\n if(k.real()< -eps )return 2;\n if(abs(ab) + eps <abs(ac))return -2;\n return 0;\n}\n \nbool isParallel(P a,P b){\n return eq(0, cross(a,b));\n}\n \nbool isParallel(S a,S b){\n return eq(0, cross( Vector(a) , Vector(b) ) );\n}\n \nbool onLP(L l,P p){\n P a=l.first, b=l.second;\n return eq(0, cross(b-a,p-a));\n}\n \nbool onSP(S s,P p){\n P a=s.first, b=s.second;\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\n}\n \nbool isCrossSS(S s0,S s1){\n P a=s0.first, b=s0.second;\n P c=s1.first, d=s1.second;\n int f0 = ccw(a,b,c) * ccw(a,b,d);\n int f1 = ccw(c,d,a) * ccw(c,d,b);\n return (f0<=0 && f1<=0);\n}\n \nbool isCrossLS(L l,S s){\n P a=l.first, b=l.second;\n P c=s.first, d=s.second;\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\n}\n \nldouble distLP(L l,P p){\n P a=l.first, b=l.second;\n ldouble res = cross(b-a,p-a) / abs(b-a);\n return abs(res);\n}\n \nldouble distSP(S s,P p){\n P a=s.first, b=s.second;\n if( dot(b-a,p-a) < eps )return abs(p-a);\n if( dot(a-b,p-b) < eps )return abs(p-b);\n return distLP(s,p);\n}\n \nldouble distSS(S s0,S s1){\n if( isCrossSS(s0,s1) )return 0;\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\n return min(res0,res1);\n}\n \nP getCrossLL(L l0,L l1){\n P a=l0.first, b=l0.second;\n P c=l1.first, d=l1.second;\n a-=d;b-=d;c-=d;\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\n}\n \n \n \nint inPolygon(vecP &t,P p){\n int n=t.size();\n ldouble sum=0;\n for(int i=0;i<n;i++){\n P a=t[i],b=t[(i+1==n?0:i+1)];\n if( ccw(a,b,p)==0 )return 1;\n sum+= getArg(a-p,b-p);\n }\n if( abs(sum) < eps )return 0;\n else return 2;\n}\n \nvecP andrewScan(vecP &t){\n int N=t.size(),C=0;\n vecP R(N);\n for(int i=0;i<N;i++){\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\n R[C++]=t[i];\n }\n vecP res(C);\n for(int i=0;i<C;i++)res[i]=R[i];\n return res;\n}\n \nvecP convexHull(vecP &t){\n sort(t.begin(),t.end());\n vecP u=andrewScan(t);\n reverse(t.begin(),t.end());\n vecP l=andrewScan(t);\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\n return u;\n}\n \nvecP cutConvex(vecP &t,L l){\n P a=l.first, b=l.second;\n int N=t.size();\n vecP res;\n for(int i=0;i<N;i++){\n P c=t[i],d=t[(i+1)%N];\n int C=ccw(a,b,c),D=ccw(a,b,d);\n if(C!=-1)res.push_back(c);\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\n }\n return res;\n}\n \nP getVector(const vecP &t, int id){\n int n=t.size();\n return t[ (id+1)%n ] - t[id%n];\n}\n \nldouble convex_diameter(vecP &t) {\n int n = t.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(t[i]) > imag(t[is])) is = i;\n if (imag(t[i]) < imag(t[js])) js = i;\n }\n ldouble maxd = norm(t[is]-t[js]);\n \n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n \n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\n \n else i = (i+1) % n;\n if (norm(t[i]-t[j]) > maxd) {\n maxd = norm(t[i]-t[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}\n \nbool compare_y(const P &a,const P &b){\n return a.imag() < b.imag();\n}\n \nldouble closest_pair(P *a, int n){\n if(n <= 1) return 1e30;\n int m = n / 2;\n ldouble x = a[m].real();\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\n inplace_merge(a, a + m, a + n, compare_y);\n vector<P> b;\n for(int i=0;i<n;i++){\n if( abs(a[i].real() - x) >= d) continue;\n for(int j=0;j<(int)b.size();j++){\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\n if(dy >= d) break;\n d = min(d, sqrt(dx * dx + dy * dy));\n }\n b.push_back(a[i]);\n }\n return d;\n}\n \nP _pool[200005];\nldouble minDist(vecP &t){\n int n=t.size();\n for(int i=0;i<n;i++)_pool[i]=t[i];\n sort( _pool, _pool+n);\n return closest_pair(_pool, n);\n}\n \nint getStateCC(C a,C b){\n ldouble ar=a.second, br=b.second;\n ldouble dist=abs(a.first-b.first);\n if(dist>ar+br+eps)return 4;\n if(dist>ar+br-eps)return 3;\n if(dist>abs(ar-br)+eps)return 2;\n if(dist>abs(ar-br)-eps)return 1;\n return 0;\n}\n \nP getCrossCC(C a,C b){\n P p1=a.first, p2=b.first;\n ldouble r1=a.second, r2=b.second;\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\n}\n \nP getTangentCP_(C a,P p,int flg){\n P base=a.first-p;\n ldouble ar=a.second;\n ldouble w=Sqrt(norm(base)-ar*ar);\n P s=p+base*P(w,ar * flg)/norm(base)*w;\n return s;\n}\n \nvector<S> getTangentCP(C a,P p){\n vector<S> res;\n P s=getTangentCP_(a,p,1);\n P t=getTangentCP_(a,p,-1);\n \n if( eq(s,t) ){\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \n }else{\n res.push_back( S(p,s) );\n res.push_back( S(p,t) );\n }\n return res;\n}\n \nS getInTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble w=ar+br;\n ldouble h=Sqrt(norm(base)-w*w);\n P k=base*P(w,h*flg)/norm(base);\n return S(ap+k*ar,bp-k*br);\n}\n \nS getOutTangent(C a,C b,ldouble flg=1.0){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n P base=bp-ap;\n ldouble h=br-ar;\n \n ldouble w=Sqrt(norm(base)-h*h);\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\n return S(ap+k*ar,bp+k*br);\n}\n \nvector<S> getTangentCC(C a,C b){\n P ap=a.first,bp=b.first;\n ldouble ar=a.second,br=b.second;\n \n vector<S> res;\n ldouble dist=abs(ap-bp);\n \n if(dist>ar+br+eps)\n res.push_back(getInTangent(a,b,1));\n \n if(dist>ar+br-eps)\n res.push_back(getInTangent(a,b,-1));\n \n if(dist>abs(ar-br)+eps)\n res.push_back(getOutTangent(a,b,1));\n \n if(dist>abs(ar-br)-eps)\n res.push_back(getOutTangent(a,b,-1));\n \n return res;\n}\n \n \nvecP getCrossCL(C cir,L l){\n P a=l.first, b=l.second;\n ldouble cr=cir.second;\n P cp=cir.first;\n \n vecP res;\n P base=b-a, target=project(a,b,cp);\n \n ldouble length=abs(base), h=abs(cp-target);\n base/=length;\n \n if(cr+eps<h)return res;\n ldouble w=Sqrt(cr*cr-h*h);\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\n \n res.push_back(a+base*L);\n if( eq(L,R) )return res;\n res.push_back(a+base*R);\n \n return res;\n}\n \nvecP getCrossCS(C cir,S s){\n vecP tmp=getCrossCL(cir,s);\n vecP res;\n for(int i=0;i<(int)tmp.size();i++)\n // if( ccw(s.first,s.second, tmp[i] ) == 0)\n if( onSP( s, tmp[i] ) )\n res.push_back(tmp[i]);\n return res;\n}\n \nldouble getArea(C c,P a,P b){\n P cp=c.first;\n ldouble cr=c.second;\n \n P va=cp-a, vb=cp-b;\n ldouble A=abs(va), B=abs(vb);\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\n \n if( eq(0, f ) )return 0;\n if(A<cr+eps&&B<cr+eps)return f*0.5;\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\n \n vecP u=getCrossCS(c, S(a,b) );\n \n assert( !u.empty() );\n u.insert(u.begin(), a), u.push_back(b);\n \n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\n return res;\n}\n \nldouble getCrossArea(vecP t,C c){\n int n=t.size();\n if(n<3)return 0;\n ldouble res=0;\n for(int i=0;i<n;i++){\n P a=t[i], b=t[(i+1)%n];\n res+=getArea(c,a,b);\n }\n return res;\n}\n \n \nldouble calcPolygonArea(const vecP &t){\n ldouble res=0;\n int n=t.size();\n for(int i=0;i<n;i++){\n res+= cross( t[ (i+1)%n ],t[i] );\n }\n return abs(res)*0.5;\n}\n\n\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\n vector<P> targets;\n for(int i=0;i<(int)t.size();i++){\n for(int j=0;j<(int)u.size();j++){\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\n targets.push_back(t[i].first);\n targets.push_back(t[i].second);\n }\n }\n sort( targets.begin(), targets.end() );\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\n for(int i=0;i<(int)targets.size();i++){\n\n ldouble mini=1e9;\n for(int j=0;j<(int)u.size();j++){\n ldouble dist=abs(targets[i]-u[j]);\n mini=min(mini,dist);\n }\n if( mini > r - eps )return false;\n }\n return true;\n}\n\nldouble solve(const vector<S> &t,const vector<P> &u){\n ldouble left=0, right=1e6, mid;\n for(int i=0;i<50;i++){\n mid=(left+right)*0.5;\n if( check(t,u,mid) )right=mid;\n else left=mid;\n }\n return left;\n}\n\nint main(){\n \n int n;\n scanf(\"%d\",&n);\n P cp=P(0,0);\n vector< P > t(n);\n for(int i=0;i<n;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n t[i]=P(x,y);\n cp+=t[i];\n }\n \n t.push_back( cp / (ldouble)n );\n \n \n int m;\n scanf(\"%d\",&m);\n vector< P > u(m);\n for(int i=0;i<m;i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n u[i]=P(x,y);\n }\n\n vector< S > w;\n for(int i=0;i<n;i++){\n for(int j=0;j<i;j++){\n w.push_back( S(t[i],t[j]) );\n }\n }\n \n printf(\"%.10f\\n\", (double)solve(w,u) );\n return 0;\n \n}","accuracy":0.16666666666666666,"time_ms":20,"memory_kb":9672,"score_of_the_acc":-0.9598,"final_rank":19},{"submission_id":"aoj_3049_3130760","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<math.h>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<deque>\n#include<chrono>\n#include<unordered_map>\n#include<list>\n#include<fstream>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\nconst ll E=1e18+7;\n#define F first\n#define S second\n#define MK make_pair\nconst ll MOD=1000000007;\n\nconst double EPS=1e-7;\n#define equals(a,b) (fabs(a-b)<EPS)\n\nstruct point{\n double x,y;\n \n point(double x=0,double y=0):x(x),y(y){}\n \n point operator + (const point &P) const {\n return point(x+P.x,y+P.y);\n }\n \n point operator - (const point &P) const {\n return point(x-P.x,y-P.y);\n }\n \n point operator * (const double &D) const {\n return point(x*D,y*D);\n }\n \n point operator / (const double &D) const {\n return point(x/D,y/D);\n }\n \n bool operator == (const point &P) const {\n if(fabs(x-P.x)<EPS && fabs(y-P.y)<EPS){return true;}\n if(fabs(x-P.x)/max(fabs(x),fabs(P.x))<EPS && fabs(y-P.y)/max(fabs(y),fabs(P.y))<EPS){return true;}\n return false;\n }\n \n bool operator != (const point &P) const {\n return !((*this)==P);\n }\n \n double norm() const {\n return x*x+y*y;\n }\n \n double abs() const {\n return sqrt(norm());\n }\n \n //ax=y\n double equation() const {\n return y/x;\n }\n};\n\ndouble dot(const point &a,const point &b){\n return a.x*b.x+a.y*b.y;\n}\n\ndouble cross(const point &a,const point &b){\n return a.x*b.y-a.y*b.x;\n}\n\npoint mid_point(const point &a,const point &b){\n return point(a.x+b.x,a.y+b.y)/2;\n}\n\nstruct line{\n point s,t;\n \n line(point s,point t):s(s),t(t){}\n \n bool operator == (const line &L) const {\n return s==L.s && t==L.t;\n }\n \n //ax+b=y\n pair<double,double> equation() const {\n double a=(t-s).equation();\n double b=t.y-t.x*a;\n return {a,b};\n }\n};\n\n//直行判定\nbool isOrthogonal(const point &a,const point &b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(const line &a,const line &b){\n return isOrthogonal(a.t-a.s,b.t-a.s);\n}\n\n//平行判定\nbool isParallel(const point &a,const point &b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(const line &a,const line &b){\n return isParallel(a.t-a.s,b.t-b.s);\n}\n\n//射影\npoint project(const line &L,const point &P){\n point base=L.t-L.s;\n double r=dot(P-L.s,base)/base.norm();\n return L.s+base*r;\n}\n\n//点と点の距離\ndouble getDistancePP(const point &a,const point &b){\n return (a-b).abs();\n}\n\n//直線と点の距離\ndouble getDistanceLP(const line &L,const point &P){\n return fabs(cross(L.t-L.s,P-L.s)/(L.t-L.s).abs());\n}\n\n//線分と点の距離\ndouble getDistanceSP(const line &L,const point &P){\n if(dot(L.t-L.s,P-L.s)<0.0){return (P-L.s).abs();}\n if(dot(L.s-L.t,P-L.t)<0.0){return (P-L.t).abs();}\n return getDistanceLP(L,P);\n}\n\n\nstatic const int COUNTER_CLOCKWISE=1;\nstatic const int CLOCKWISE=-1;\nstatic const int ONLINE_BACK=2;\nstatic const int ONLINE_FRONT=-2;\nstatic const int ON_SEGMENT=0;\n\nint ccw(const point &p0,const point &p1,const point &p2){\n point a=p1-p0;\n point b=p2-p0;\n if(cross(a,b)>EPS){return COUNTER_CLOCKWISE;}\n if(cross(a,b)<-EPS){return CLOCKWISE;}\n if(dot(a,b)<-EPS){return ONLINE_BACK;}\n if(a.norm()<b.norm()){return ONLINE_FRONT;}\n return ON_SEGMENT;\n}\n\nbool intersect(const point &p1,const point &p2,const point &p3,const point &p4){\n return ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 && ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0;\n}\n\n//線分と線分の交差判定\nbool intersect(const line &a,const line &b){\n return intersect(a.s,a.t,b.s,b.t);\n}\n\n//線分と線分の交点\npoint XpointSS(const line &a,const line &b){\n point base=b.t-b.s;\n double d1=fabs(cross(base,a.s-b.s));\n double d2=fabs(cross(base,a.t-b.s));\n double t=d1/(d1+d2);\n return a.s+(a.t-a.s)*t;\n}\n\n\n\nvoid show(const point &p){cout<<p.x<<\" \"<<p.y<<endl;}\n\n\n\ntypedef vector<point> polygon;\n\nbool isInConvex(const polygon &poly,const point &P){\n int sign=ccw(poly[0],poly[1],P);\n for(int i=2;i<poly.size();i++){\n if(ccw(poly[i-1],poly[i],P)!=sign){return false;}\n }\n if(ccw(poly[poly.size()-1],poly[0],P)!=sign){return false;}\n return true;\n}\n\n//0::false 1::is_in //2::on_line\nll is_in_polygon(const polygon &P,const point &a){\n bool x=false;\n for(int i=1;i<=P.size();i++){\n point A=a-P[i-1];\n point B=a-P[i%P.size()];\n if(abs(cross(A,B))<EPS && dot(A,B)<EPS){return 0;}\n if(A.y>B.y){swap(A,B);}\n if(A.y<EPS && EPS<B.y && cross(A,B)>EPS){x=!x;}\n }\n return (x?1:0);\n}\n\nstatic const point err(1e18,1e18);\n\n//直交ベクトル\npoint OrthogonalVector(const line &L){\n point a=L.t-L.s;\n return point(a.y,a.x*-1);\n}\n\nline mid_line(const point &a,const point &b){\n point s=mid_point(a,b);\n point t=s+OrthogonalVector(line(a,b));\n return line(s,t);\n}\n\n//線分が直線と交わるか\nbool XSL(const line &a,const line &b){\n int A=ccw(b.s,b.t,a.s);\n int B=ccw(b.s,b.t,a.t);\n if(A==ONLINE_BACK || A==ONLINE_FRONT){return true;}\n if(B==ONLINE_BACK || B==ONLINE_FRONT){return true;}\n if(A*B<=0){return true;}\n return false;\n}\n\n//直線と直線の交点\npoint XpointLL(const line &a,const line &b){\n if(a.s==a.t || b.s==b.t){return err;}\n if(a.s==b.s || a.s==b.t){return a.s;}\n if(a.t==b.s || a.t==b.t){return a.t;}\n if(isParallel(a,b)){return err;}\n if(isOrthogonal(a,b)){return project(a,b.s);}\n if(intersect(a,b)){return XpointSS(a,b);}\n //ccw(a.s,a.t,b.s)*ccw(a.s,a.t,b.t)<=0\n if(XSL(b,a)){\n double d1=getDistancePP(project(a,b.s),b.s);\n double d2=getDistancePP(project(a,b.t),b.t);\n point base=b.t-b.s;\n return b.s+base*d1/(d2+d1);\n }\n //ccw(b.s,b.t,a.s)*ccw(b.s,b.t,a.t)<=0\n if(XSL(a,b)){\n double d1=getDistancePP(project(b,a.s),a.s);\n double d2=getDistancePP(project(b,a.t),a.t);\n point base=a.t-a.s;\n return a.s+base*d1/(d2+d1);\n }\n double d1=getDistancePP(project(a,b.s),b.s);\n double d2=getDistancePP(project(a,b.t),b.t);\n if(d1<d2){\n return b.s+(b.s-b.t)*(d1/(d2-d1));\n }\n return b.t+(b.t-b.s)*(d2/(d1-d2));\n}\n\n//間に合わせ\nbool X(const line &a,const point &P){\n double mix=min(a.s.x,a.t.x);\n double mxx=max(a.s.x,a.t.x);\n double miy=min(a.s.y,a.t.y);\n double mxy=max(a.s.y,a.t.y);\n if(mxx>=P.x && P.x>=mix && mxy>=P.y && P.y>=miy){return true;}\n return false;\n}\n\n//線分と直線の交点\npoint XpointSL(const line &a,const line &b){\n point ret=XpointLL(b,a);\n /*\n if(ret!=XpointLL(a,b)){\n show(a.s);show(a.t);\n show(b.s);show(b.t);\n show(ret);show(XpointLL(a,b));\n assert(false);\n }\n */\n //assert(ret==XpointLL(a,b));\n if(ret==err){return err;}\n if(X(a,ret)){return ret;}\n //if(ccw(a.s,a.t,ret)==ON_SEGMENT){return ret;}\n return err;\n}\n\n//外心\npoint Circumcenter(const point &a,const point &b,const point &c){\n if(a==b || b==c || c==a){return err;}\n int w=ccw(a,b,c);\n if(w!=COUNTER_CLOCKWISE && w!=CLOCKWISE){return err;}\n line l1=mid_line(a,b);\n line l2=mid_line(a,c);\n return XpointLL(l1,l2);\n}\n\ndouble solve(polygon P,polygon C){\n polygon test=P;\n for(int i=0;i<C.size();i++){\n for(int t=i+1;t<C.size();t++){\n line L=mid_line(C[i],C[t]);\n for(int j=1;j<P.size();j++){\n\tpoint p=XpointSL(line(P[j-1],P[j]),L);\n\tif(p!=err){test.push_back(p);}\n }\n point p=XpointSL(line(P[P.size()-1],P[0]),L);\n if(p!=err){test.push_back(p);}\n }\n }\n for(int i=0;i<C.size();i++){\n for(int t=i+1;t<C.size();t++){\n for(int h=t+1;h<C.size();h++){\n\tpoint p=Circumcenter(C[i],C[t],C[h]);\n\tif(p==err){continue;}\n\tif(isInConvex(P,p)){test.push_back(p);}\n }\n }\n }\n double mx=0;\n for(int i=0;i<test.size();i++){\n double mi=E;\n for(int t=0;t<C.size();t++){\n mi=min(mi,getDistancePP(test[i],C[t]));\n }\n mx=max(mx,mi);\n }\n return mx;\n}\n\n\n\n\nint main(){\n cout<<fixed<<setprecision(12);\n ll n,m;\n cin>>n;\n polygon P,C;\n for(int i=0;i<n;i++){\n double a,b;\n cin>>a>>b;\n P.push_back(point(a,b));\n }\n cin>>m;\n for(int t=0;t<m;t++){\n double a,b;\n cin>>a>>b;\n C.push_back(point(a,b));\n }\n cout<<solve(P,C)+0.00001<<endl;\n \n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6240,"score_of_the_acc":-0.465,"final_rank":6},{"submission_id":"aoj_3049_3130755","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<math.h>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<deque>\n#include<chrono>\n#include<unordered_map>\n#include<list>\n#include<fstream>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\nconst ll E=1e18+7;\n#define F first\n#define S second\n#define MK make_pair\nconst ll MOD=1000000007;\n\nconst double EPS=1e-7;\n#define equals(a,b) (fabs(a-b)<EPS)\n\nstruct point{\n double x,y;\n \n point(double x=0,double y=0):x(x),y(y){}\n \n point operator + (const point &P) const {\n return point(x+P.x,y+P.y);\n }\n \n point operator - (const point &P) const {\n return point(x-P.x,y-P.y);\n }\n \n point operator * (const double &D) const {\n return point(x*D,y*D);\n }\n \n point operator / (const double &D) const {\n return point(x/D,y/D);\n }\n \n bool operator == (const point &P) const {\n if(fabs(x-P.x)<EPS && fabs(y-P.y)<EPS){return true;}\n if(fabs(x-P.x)/max(fabs(x),fabs(P.x))<EPS && fabs(y-P.y)/max(fabs(y),fabs(P.y))<EPS){return true;}\n return false;\n }\n \n bool operator != (const point &P) const {\n return !((*this)==P);\n }\n \n double norm() const {\n return x*x+y*y;\n }\n \n double abs() const {\n return sqrt(norm());\n }\n \n //ax=y\n double equation() const {\n return y/x;\n }\n};\n\ndouble dot(const point &a,const point &b){\n return a.x*b.x+a.y*b.y;\n}\n\ndouble cross(const point &a,const point &b){\n return a.x*b.y-a.y*b.x;\n}\n\npoint mid_point(const point &a,const point &b){\n return point(a.x+b.x,a.y+b.y)/2;\n}\n\nstruct line{\n point s,t;\n \n line(point s,point t):s(s),t(t){}\n \n bool operator == (const line &L) const {\n return s==L.s && t==L.t;\n }\n \n //ax+b=y\n pair<double,double> equation() const {\n double a=(t-s).equation();\n double b=t.y-t.x*a;\n return {a,b};\n }\n};\n\n//直行判定\nbool isOrthogonal(const point &a,const point &b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(const line &a,const line &b){\n return isOrthogonal(a.t-a.s,b.t-a.s);\n}\n\n//平行判定\nbool isParallel(const point &a,const point &b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(const line &a,const line &b){\n return isParallel(a.t-a.s,b.t-b.s);\n}\n\n//射影\npoint project(const line &L,const point &P){\n point base=L.t-L.s;\n double r=dot(P-L.s,base)/base.norm();\n return L.s+base*r;\n}\n\n//点と点の距離\ndouble getDistancePP(const point &a,const point &b){\n return (a-b).abs();\n}\n\n//直線と点の距離\ndouble getDistanceLP(const line &L,const point &P){\n return fabs(cross(L.t-L.s,P-L.s)/(L.t-L.s).abs());\n}\n\n//線分と点の距離\ndouble getDistanceSP(const line &L,const point &P){\n if(dot(L.t-L.s,P-L.s)<0.0){return (P-L.s).abs();}\n if(dot(L.s-L.t,P-L.t)<0.0){return (P-L.t).abs();}\n return getDistanceLP(L,P);\n}\n\n\nstatic const int COUNTER_CLOCKWISE=1;\nstatic const int CLOCKWISE=-1;\nstatic const int ONLINE_BACK=2;\nstatic const int ONLINE_FRONT=-2;\nstatic const int ON_SEGMENT=0;\n\nint ccw(const point &p0,const point &p1,const point &p2){\n point a=p1-p0;\n point b=p2-p0;\n if(cross(a,b)>EPS){return COUNTER_CLOCKWISE;}\n if(cross(a,b)<-EPS){return CLOCKWISE;}\n if(dot(a,b)<-EPS){return ONLINE_BACK;}\n if(a.norm()<b.norm()){return ONLINE_FRONT;}\n return ON_SEGMENT;\n}\n\nbool intersect(const point &p1,const point &p2,const point &p3,const point &p4){\n return ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 && ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0;\n}\n\n//線分と線分の交差判定\nbool intersect(const line &a,const line &b){\n return intersect(a.s,a.t,b.s,b.t);\n}\n\n//線分と線分の交点\npoint XpointSS(const line &a,const line &b){\n point base=b.t-b.s;\n double d1=fabs(cross(base,a.s-b.s));\n double d2=fabs(cross(base,a.t-b.s));\n double t=d1/(d1+d2);\n return a.s+(a.t-a.s)*t;\n}\n\n\n\nvoid show(const point &p){cout<<p.x<<\" \"<<p.y<<endl;}\n\n\n\ntypedef vector<point> polygon;\n\nbool isInConvex(const polygon &poly,const point &P){\n int sign=ccw(poly[0],poly[1],P);\n for(int i=2;i<poly.size();i++){\n if(ccw(poly[i-1],poly[i],P)!=sign){return false;}\n }\n if(ccw(poly[poly.size()-1],poly[0],P)!=sign){return false;}\n return true;\n}\n\n//0::false 1::is_in //2::on_line\nll is_in_polygon(const polygon &P,const point &a){\n bool x=false;\n for(int i=1;i<=P.size();i++){\n point A=a-P[i-1];\n point B=a-P[i%P.size()];\n if(abs(cross(A,B))<EPS && dot(A,B)<EPS){return 0;}\n if(A.y>B.y){swap(A,B);}\n if(A.y<EPS && EPS<B.y && cross(A,B)>EPS){x=!x;}\n }\n return (x?1:0);\n}\n\nstatic const point err(1e18,1e18);\n\n//直交ベクトル\npoint OrthogonalVector(const line &L){\n point a=L.t-L.s;\n return point(a.y,a.x*-1);\n}\n\nline mid_line(const point &a,const point &b){\n point s=mid_point(a,b);\n point t=s+OrthogonalVector(line(a,b));\n return line(s,t);\n}\n\n//線分が直線と交わるか\nbool XSL(const line &a,const line &b){\n int A=ccw(b.s,b.t,a.s);\n int B=ccw(b.s,b.t,a.t);\n if(A==ONLINE_BACK || A==ONLINE_FRONT){return true;}\n if(B==ONLINE_BACK || B==ONLINE_FRONT){return true;}\n if(A*B<=0){return true;}\n return false;\n}\n\n//直線と直線の交点\npoint XpointLL(const line &a,const line &b){\n if(a.s==a.t || b.s==b.t){return err;}\n if(a.s==b.s || a.s==b.t){return a.s;}\n if(a.t==b.s || a.t==b.t){return a.t;}\n if(isParallel(a,b)){return err;}\n if(isOrthogonal(a,b)){return project(a,b.s);}\n if(intersect(a,b)){return XpointSS(a,b);}\n //ccw(a.s,a.t,b.s)*ccw(a.s,a.t,b.t)<=0\n if(XSL(b,a)){\n double d1=getDistancePP(project(a,b.s),b.s);\n double d2=getDistancePP(project(a,b.t),b.t);\n point base=b.t-b.s;\n return b.s+base*d1/(d2+d1);\n }\n //ccw(b.s,b.t,a.s)*ccw(b.s,b.t,a.t)<=0\n if(XSL(a,b)){\n double d1=getDistancePP(project(b,a.s),a.s);\n double d2=getDistancePP(project(b,a.t),a.t);\n point base=a.t-a.s;\n return a.s+base*d1/(d2+d1);\n }\n double d1=getDistancePP(project(a,b.s),b.s);\n double d2=getDistancePP(project(a,b.t),b.t);\n if(d1<d2){\n return b.s+(b.s-b.t)*(d1/(d2-d1));\n }\n return b.t+(b.t-b.s)*(d2/(d1-d2));\n}\n\n//間に合わせ\nbool X(const line &a,const point &P){\n double mix=min(a.s.x,a.t.x);\n double mxx=max(a.s.x,a.t.x);\n double miy=min(a.s.y,a.t.y);\n double mxy=max(a.s.y,a.t.y);\n if(mxx>=P.x && P.x>=mix && mxy>=P.y && P.y>=miy){return true;}\n return false;\n}\n\n//線分と直線の交点\npoint XpointSL(const line &a,const line &b){\n point ret=XpointLL(b,a);\n /*\n if(ret!=XpointLL(a,b)){\n show(a.s);show(a.t);\n show(b.s);show(b.t);\n show(ret);show(XpointLL(a,b));\n assert(false);\n }\n */\n //assert(ret==XpointLL(a,b));\n if(ret==err){return err;}\n if(X(a,ret)){return ret;}\n //if(ccw(a.s,a.t,ret)==ON_SEGMENT){return ret;}\n return err;\n}\n\n//外心\npoint Circumcenter(const point &a,const point &b,const point &c){\n if(a==b || b==c || c==a){return err;}\n int w=ccw(a,b,c);\n if(w!=COUNTER_CLOCKWISE && w!=CLOCKWISE){return err;}\n line l1=mid_line(a,b);\n line l2=mid_line(a,c);\n return XpointLL(l1,l2);\n}\n\ndouble solve(polygon P,polygon C){\n polygon test=P;\n for(int i=0;i<C.size();i++){\n for(int t=i+1;t<C.size();t++){\n line L=mid_line(C[i],C[t]);\n for(int j=1;j<P.size();j++){\n\tpoint p=XpointSL(line(P[j-1],P[j]),L);\n\tif(p!=err){test.push_back(p);}\n }\n point p=XpointSL(line(P[P.size()-1],P[0]),L);\n if(p!=err){test.push_back(p);}\n }\n }\n for(int i=0;i<C.size();i++){\n for(int t=i+1;t<C.size();t++){\n for(int h=t+1;h<C.size();h++){\n\tpoint p=Circumcenter(C[i],C[t],C[h]);\n\tif(p==err){continue;}\n\tif(isInConvex(P,p)){test.push_back(p);}\n }\n }\n }\n double mx=0;\n for(int i=0;i<test.size();i++){\n double mi=E;\n for(int t=0;t<C.size();t++){\n mi=min(mi,getDistancePP(test[i],C[t]));\n }\n mx=max(mx,mi);\n }\n return mx;\n}\n\n\n\n\nint main(){\n //cout<<fixed<<setprecision(12);\n ll n,m;\n cin>>n;\n polygon P,C;\n for(int i=0;i<n;i++){\n double a,b;\n cin>>a>>b;\n P.push_back(point(a,b));\n }\n cin>>m;\n for(int t=0;t<m;t++){\n double a,b;\n cin>>a>>b;\n C.push_back(point(a,b));\n }\n cout<<solve(P,C)<<endl;\n \n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6356,"score_of_the_acc":-0.4824,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_3049_3159241\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\ntypedef double P_type;\\ntypedef complex<P_type> P;\\nconst P_type P_eps = 1e-9; //整数の時はゼロ\\n\\nnamespace std{\\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\\n }\\n};\\n\\nP rotate(P p, double theta){\\n return p * P(cos(theta), sin(theta));\\n}\\n\\n//内積\\nP_type dot(P a, P b) {\\n return (a * conj(b)).real();\\n}\\n\\n//外積\\nP_type cross(P a, P b) {\\n return (conj(a) * b).imag();\\n}\\n\\n//反時計回り\\nint ccw(P a, P b, P c){\\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\\n return 0; //a -> c -> b\\n}\\n\\n/* 線分abと点cの距離 */\\nP_type distanceSP(P a, P b, P c) {\\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 直線abと点cの距離 */\\nP_type distanceLP(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 円の点包含判定 */\\nbool isContainedCP(P c, double r, P p){\\n return abs(c-p) < r - P_eps; //円周上を含まない\\n //return abs(c-p) < r + P_eps; //円周上を含む\\n}\\n\\n/* 直線交差判定 */\\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\\n return abs(cross(a1-a2, b1-b2)) > P_eps;\\n}\\n\\n/* 線分交差判定 */\\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\\n \\n //線分a と 直線b\\n int a = ccw(b1,b2,a1);\\n int b = ccw(b1,b2,a2);\\n \\n //線分b と 直線a\\n int c = ccw(a1,a2,b1);\\n int d = ccw(a1,a2,b2);\\n \\n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\\n}\\n\\n/* 直線線分交差判定 */\\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \\n int a = ccw(a1,a2,b1);\\n int b = ccw(a1,a2,b2);\\n \\n // 直線上のとき a or b = 0 or -2 or 2\\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\\n}\\n\\n/* 円交差判定 */\\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\\n double dist = abs(c1 - c2);\\n \\n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\\n}\\n\\n/* 円直線交差判定 */\\nbool isIntersectedCL(P c, double r, P a1, P a2){\\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 円線分交差判定 */\\nbool isIntersectedCS(P c, double r, P a1, P a2){\\n return isContainedCP(c,r,a1) &&\\n isContainedCP(c,r,a2) &&\\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 直線/線分交点 */\\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\\n //assert(isIntersectedLL(a1, a2, b1, b2));\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nP getCrosspointSS(P a1, P a2, P b1, P b2){\\n //assert(isIntersectedSS(a1, a2, b1, b2));\\n return getCrosspointLL(a1, a2, b1, b2);\\n}\\n\\n/* 円交点 */\\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\\n //assert(isIntersectedCC(c1, r1, c2, r2));\\n \\n double dist = abs(c1 - c2);\\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\\n}\\n\\n/* 円線分交点 */\\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\\n //assert(isIntersectedCS(c1, r1, c2, r2));\\n \\n P base1 = a2 - a1;\\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\\n P e = (a2 - a1) / abs(a2 - a1);\\n P base2 = sqrt(r*r - norm(proj - c));\\n return {proj + e*base2, proj - e*base2};\\n}\\n\\n/* 多角形-点包含 */\\nbool iscontainedPolyP(vector<P> &g, P p){\\n int n = g.size();\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\\n }\\n return f; //内部 or 外部\\n}\\n\\n/* 射影(直線abとpからの垂線との交点) */\\nP getProject(P a, P b, P p){\\n P base = b - a;\\n return a + base * dot(p - a, base) / norm(base);\\n}\\n\\n/* 反射(直線abを対称軸としたpの線対称の位置) */\\nP getReflection(P a, P b, P p){\\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\\n}\\n\\n\\nint main(){\\n int n, m, x, y;\\n P pxy[101], cxy[101];\\n vector<P> pol;\\n\\n scanf(\\\"%d\\\", &n);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n pxy[i] = P(x, y);\\n pol.push_back(pxy[i]);\\n }\\n pxy[n] = pxy[0];\\n \\n\\n scanf(\\\"%d\\\", &m);\\n \\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n cxy[i] = P(x, y);\\n }\\n\\n P_type l = 0, r = 1e6;\\n\\n P_type epseps = 1e-8;\\n \\n while(abs(l-r) > 2e-6){\\n P_type R = (l+r)/2;\\n vector<P> vec; \\n \\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\\n\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + e * (P_type)-1);\\n //vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n P_type mone = -1;\\n\\n for(int j=0;j<n;j++){\\n\\n for(int i=0;i<m;i++){\\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n auto em = e*mone;\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + em);\\n //vec.push_back(gc.second + e);\\n vec.push_back(gc.second + em);\\n }\\n }\\n\\n bool res = true;\\n \\n for(int i=0;i<vec.size() && res;i++){\\n if(iscontainedPolyP(pol, vec[i])){\\n\\n bool f = false;\\n for(int j=0;j<m && !f;j++){\\n f |= isContainedCP(cxy[j], R, vec[i]);\\n }\\n\\n res &= f;\\n }\\n }\\n\\n if(res){\\n r = R;\\n }else{\\n l = R;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", (double)l);\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.35714285714285715,\n \"time_ms\": 20,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -0.0924,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3049_3159239\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\ntypedef double P_type;\\ntypedef complex<P_type> P;\\nconst P_type P_eps = 1e-9; //整数の時はゼロ\\n\\nnamespace std{\\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\\n }\\n};\\n\\nP rotate(P p, double theta){\\n return p * P(cos(theta), sin(theta));\\n}\\n\\n//内積\\nP_type dot(P a, P b) {\\n return (a * conj(b)).real();\\n}\\n\\n//外積\\nP_type cross(P a, P b) {\\n return (conj(a) * b).imag();\\n}\\n\\n//反時計回り\\nint ccw(P a, P b, P c){\\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\\n return 0; //a -> c -> b\\n}\\n\\n/* 線分abと点cの距離 */\\nP_type distanceSP(P a, P b, P c) {\\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 直線abと点cの距離 */\\nP_type distanceLP(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 円の点包含判定 */\\nbool isContainedCP(P c, double r, P p){\\n return abs(c-p) < r - P_eps; //円周上を含まない\\n //return abs(c-p) < r + P_eps; //円周上を含む\\n}\\n\\n/* 直線交差判定 */\\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\\n return abs(cross(a1-a2, b1-b2)) > P_eps;\\n}\\n\\n/* 線分交差判定 */\\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\\n \\n //線分a と 直線b\\n int a = ccw(b1,b2,a1);\\n int b = ccw(b1,b2,a2);\\n \\n //線分b と 直線a\\n int c = ccw(a1,a2,b1);\\n int d = ccw(a1,a2,b2);\\n \\n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\\n}\\n\\n/* 直線線分交差判定 */\\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \\n int a = ccw(a1,a2,b1);\\n int b = ccw(a1,a2,b2);\\n \\n // 直線上のとき a or b = 0 or -2 or 2\\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\\n}\\n\\n/* 円交差判定 */\\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\\n double dist = abs(c1 - c2);\\n \\n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\\n}\\n\\n/* 円直線交差判定 */\\nbool isIntersectedCL(P c, double r, P a1, P a2){\\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 円線分交差判定 */\\nbool isIntersectedCS(P c, double r, P a1, P a2){\\n return isContainedCP(c,r,a1) &&\\n isContainedCP(c,r,a2) &&\\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 直線/線分交点 */\\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\\n //assert(isIntersectedLL(a1, a2, b1, b2));\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nP getCrosspointSS(P a1, P a2, P b1, P b2){\\n //assert(isIntersectedSS(a1, a2, b1, b2));\\n return getCrosspointLL(a1, a2, b1, b2);\\n}\\n\\n/* 円交点 */\\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\\n //assert(isIntersectedCC(c1, r1, c2, r2));\\n \\n double dist = abs(c1 - c2);\\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\\n}\\n\\n/* 円線分交点 */\\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\\n //assert(isIntersectedCS(c1, r1, c2, r2));\\n \\n P base1 = a2 - a1;\\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\\n P e = (a2 - a1) / abs(a2 - a1);\\n P base2 = sqrt(r*r - norm(proj - c));\\n return {proj + e*base2, proj - e*base2};\\n}\\n\\n/* 多角形-点包含 */\\nbool iscontainedPolyP(vector<P> &g, P p){\\n int n = g.size();\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\\n }\\n return f; //内部 or 外部\\n}\\n\\n/* 射影(直線abとpからの垂線との交点) */\\nP getProject(P a, P b, P p){\\n P base = b - a;\\n return a + base * dot(p - a, base) / norm(base);\\n}\\n\\n/* 反射(直線abを対称軸としたpの線対称の位置) */\\nP getReflection(P a, P b, P p){\\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\\n}\\n\\n\\nint main(){\\n int n, m, x, y;\\n P pxy[101], cxy[101];\\n vector<P> pol;\\n\\n scanf(\\\"%d\\\", &n);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n pxy[i] = P(x, y);\\n pol.push_back(pxy[i]);\\n }\\n pxy[n] = pxy[0];\\n \\n\\n scanf(\\\"%d\\\", &m);\\n \\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n cxy[i] = P(x, y);\\n }\\n\\n P_type l = 0, r = 1e6;\\n\\n P_type epseps = 1e-6;\\n \\n while(abs(l-r) > 5e-6){\\n P_type R = (l+r)/2;\\n vector<P> vec; \\n \\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\\n\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + e * (P_type)-1);\\n //vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n P_type mone = -1;\\n\\n for(int j=0;j<n;j++){\\n\\n for(int i=0;i<m;i++){\\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n auto em = e*mone;\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + em);\\n //vec.push_back(gc.second + e);\\n vec.push_back(gc.second + em);\\n }\\n }\\n\\n bool res = true;\\n \\n for(int i=0;i<vec.size() && res;i++){\\n if(iscontainedPolyP(pol, vec[i])){\\n\\n bool f = false;\\n for(int j=0;j<m && !f;j++){\\n f |= isContainedCP(cxy[j], R, vec[i]);\\n }\\n\\n res &= f;\\n }\\n }\\n\\n if(res){\\n r = R;\\n }else{\\n l = R;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", (double)l);\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.35714285714285715,\n \"time_ms\": 20,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": -0.0727,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3049_3159238\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\ntypedef double P_type;\\ntypedef complex<P_type> P;\\nconst P_type P_eps = 5e-9; //整数の時はゼロ\\n\\nnamespace std{\\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\\n }\\n};\\n\\nP rotate(P p, double theta){\\n return p * P(cos(theta), sin(theta));\\n}\\n\\n//内積\\nP_type dot(P a, P b) {\\n return (a * conj(b)).real();\\n}\\n\\n//外積\\nP_type cross(P a, P b) {\\n return (conj(a) * b).imag();\\n}\\n\\n//反時計回り\\nint ccw(P a, P b, P c){\\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\\n return 0; //a -> c -> b\\n}\\n\\n/* 線分abと点cの距離 */\\nP_type distanceSP(P a, P b, P c) {\\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 直線abと点cの距離 */\\nP_type distanceLP(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 円の点包含判定 */\\nbool isContainedCP(P c, double r, P p){\\n return abs(c-p) < r - P_eps; //円周上を含まない\\n //return abs(c-p) < r + P_eps; //円周上を含む\\n}\\n\\n/* 直線交差判定 */\\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\\n return abs(cross(a1-a2, b1-b2)) > P_eps;\\n}\\n\\n/* 線分交差判定 */\\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\\n \\n //線分a と 直線b\\n int a = ccw(b1,b2,a1);\\n int b = ccw(b1,b2,a2);\\n \\n //線分b と 直線a\\n int c = ccw(a1,a2,b1);\\n int d = ccw(a1,a2,b2);\\n \\n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\\n}\\n\\n/* 直線線分交差判定 */\\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \\n int a = ccw(a1,a2,b1);\\n int b = ccw(a1,a2,b2);\\n \\n // 直線上のとき a or b = 0 or -2 or 2\\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\\n}\\n\\n/* 円交差判定 */\\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\\n double dist = abs(c1 - c2);\\n \\n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\\n}\\n\\n/* 円直線交差判定 */\\nbool isIntersectedCL(P c, double r, P a1, P a2){\\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 円線分交差判定 */\\nbool isIntersectedCS(P c, double r, P a1, P a2){\\n return isContainedCP(c,r,a1) &&\\n isContainedCP(c,r,a2) &&\\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 直線/線分交点 */\\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\\n //assert(isIntersectedLL(a1, a2, b1, b2));\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nP getCrosspointSS(P a1, P a2, P b1, P b2){\\n //assert(isIntersectedSS(a1, a2, b1, b2));\\n return getCrosspointLL(a1, a2, b1, b2);\\n}\\n\\n/* 円交点 */\\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\\n //assert(isIntersectedCC(c1, r1, c2, r2));\\n \\n double dist = abs(c1 - c2);\\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\\n}\\n\\n/* 円線分交点 */\\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\\n //assert(isIntersectedCS(c1, r1, c2, r2));\\n \\n P base1 = a2 - a1;\\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\\n P e = (a2 - a1) / abs(a2 - a1);\\n P base2 = sqrt(r*r - norm(proj - c));\\n return {proj + e*base2, proj - e*base2};\\n}\\n\\n/* 多角形-点包含 */\\nbool iscontainedPolyP(vector<P> &g, P p){\\n int n = g.size();\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\\n }\\n return f; //内部 or 外部\\n}\\n\\n/* 射影(直線abとpからの垂線との交点) */\\nP getProject(P a, P b, P p){\\n P base = b - a;\\n return a + base * dot(p - a, base) / norm(base);\\n}\\n\\n/* 反射(直線abを対称軸としたpの線対称の位置) */\\nP getReflection(P a, P b, P p){\\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\\n}\\n\\n\\nint main(){\\n int n, m, x, y;\\n P pxy[101], cxy[101];\\n vector<P> pol;\\n\\n scanf(\\\"%d\\\", &n);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n pxy[i] = P(x, y);\\n pol.push_back(pxy[i]);\\n }\\n pxy[n] = pxy[0];\\n \\n\\n scanf(\\\"%d\\\", &m);\\n \\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n cxy[i] = P(x, y);\\n }\\n\\n P_type l = 0, r = 1e6;\\n\\n P_type epseps = 5e-7;\\n \\n while(abs(l-r) > 5e-6){\\n P_type R = (l+r)/2;\\n vector<P> vec; \\n \\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\\n\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + e * (P_type)-1);\\n //vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n P_type mone = -1;\\n\\n for(int j=0;j<n;j++){\\n\\n for(int i=0;i<m;i++){\\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n auto em = e*mone;\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + em);\\n //vec.push_back(gc.second + e);\\n vec.push_back(gc.second + em);\\n }\\n }\\n\\n bool res = true;\\n \\n for(int i=0;i<vec.size() && res;i++){\\n if(iscontainedPolyP(pol, vec[i])){\\n\\n bool f = false;\\n for(int j=0;j<m && !f;j++){\\n f |= isContainedCP(cxy[j], R, vec[i]);\\n }\\n\\n res &= f;\\n }\\n }\\n\\n if(res){\\n r = R;\\n }else{\\n l = R;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", (double)l);\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.2857142857142857,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.0763,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3049_3159237\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\ntypedef long double P_type;\\ntypedef complex<P_type> P;\\nconst P_type P_eps = 1e-9; //整数の時はゼロ\\n\\nnamespace std{\\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\\n }\\n};\\n\\nP rotate(P p, double theta){\\n return p * P(cos(theta), sin(theta));\\n}\\n\\n//内積\\nP_type dot(P a, P b) {\\n return (a * conj(b)).real();\\n}\\n\\n//外積\\nP_type cross(P a, P b) {\\n return (conj(a) * b).imag();\\n}\\n\\n//反時計回り\\nint ccw(P a, P b, P c){\\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\\n return 0; //a -> c -> b\\n}\\n\\n/* 線分abと点cの距離 */\\nP_type distanceSP(P a, P b, P c) {\\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 直線abと点cの距離 */\\nP_type distanceLP(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 円の点包含判定 */\\nbool isContainedCP(P c, double r, P p){\\n return abs(c-p) < r - P_eps; //円周上を含まない\\n //return abs(c-p) < r + P_eps; //円周上を含む\\n}\\n\\n/* 直線交差判定 */\\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\\n return abs(cross(a1-a2, b1-b2)) > P_eps;\\n}\\n\\n/* 線分交差判定 */\\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\\n \\n //線分a と 直線b\\n int a = ccw(b1,b2,a1);\\n int b = ccw(b1,b2,a2);\\n \\n //線分b と 直線a\\n int c = ccw(a1,a2,b1);\\n int d = ccw(a1,a2,b2);\\n \\n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\\n}\\n\\n/* 直線線分交差判定 */\\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \\n int a = ccw(a1,a2,b1);\\n int b = ccw(a1,a2,b2);\\n \\n // 直線上のとき a or b = 0 or -2 or 2\\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\\n}\\n\\n/* 円交差判定 */\\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\\n double dist = abs(c1 - c2);\\n \\n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\\n}\\n\\n/* 円直線交差判定 */\\nbool isIntersectedCL(P c, double r, P a1, P a2){\\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 円線分交差判定 */\\nbool isIntersectedCS(P c, double r, P a1, P a2){\\n return isContainedCP(c,r,a1) &&\\n isContainedCP(c,r,a2) &&\\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 直線/線分交点 */\\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\\n //assert(isIntersectedLL(a1, a2, b1, b2));\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nP getCrosspointSS(P a1, P a2, P b1, P b2){\\n //assert(isIntersectedSS(a1, a2, b1, b2));\\n return getCrosspointLL(a1, a2, b1, b2);\\n}\\n\\n/* 円交点 */\\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\\n //assert(isIntersectedCC(c1, r1, c2, r2));\\n \\n double dist = abs(c1 - c2);\\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\\n}\\n\\n/* 円線分交点 */\\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\\n //assert(isIntersectedCS(c1, r1, c2, r2));\\n \\n P base1 = a2 - a1;\\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\\n P e = (a2 - a1) / abs(a2 - a1);\\n P base2 = sqrt(r*r - norm(proj - c));\\n return {proj + e*base2, proj - e*base2};\\n}\\n\\n/* 多角形-点包含 */\\nbool iscontainedPolyP(vector<P> &g, P p){\\n int n = g.size();\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\\n }\\n return f; //内部 or 外部\\n}\\n\\n/* 射影(直線abとpからの垂線との交点) */\\nP getProject(P a, P b, P p){\\n P base = b - a;\\n return a + base * dot(p - a, base) / norm(base);\\n}\\n\\n/* 反射(直線abを対称軸としたpの線対称の位置) */\\nP getReflection(P a, P b, P p){\\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\\n}\\n\\n\\nint main(){\\n int n, m, x, y;\\n P pxy[101], cxy[101];\\n vector<P> pol;\\n\\n scanf(\\\"%d\\\", &n);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n pxy[i] = P(x, y);\\n pol.push_back(pxy[i]);\\n }\\n pxy[n] = pxy[0];\\n \\n\\n scanf(\\\"%d\\\", &m);\\n \\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n cxy[i] = P(x, y);\\n }\\n\\n P_type l = 0, r = 1e6;\\n\\n P_type epseps = 1e-7;\\n \\n while(abs(l-r) > 1e-6){\\n P_type R = (l+r)/2;\\n vector<P> vec; \\n \\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\\n\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + e * (P_type)-1);\\n //vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n P_type mone = -1;\\n\\n for(int j=0;j<n;j++){\\n\\n for(int i=0;i<m;i++){\\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * epseps;\\n auto em = e*mone;\\n vec.push_back(gc.first + e);\\n //vec.push_back(gc.first + em);\\n //vec.push_back(gc.second + e);\\n vec.push_back(gc.second + em);\\n }\\n }\\n\\n bool res = true;\\n \\n for(int i=0;i<vec.size() && res;i++){\\n if(iscontainedPolyP(pol, vec[i])){\\n\\n bool f = false;\\n for(int j=0;j<m && !f;j++){\\n f |= isContainedCP(cxy[j], R, vec[i]);\\n }\\n\\n res &= f;\\n }\\n }\\n\\n if(res){\\n r = R;\\n }else{\\n l = R;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", (double)l);\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1660,\n \"memory_kb\": 4048,\n \"score_of_the_acc\": -1.0739,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3049_3146579\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<int(n);++i)\\n#define all(a) (a).begin(),(a).end()\\n\\ntypedef complex<double> Point;\\ntypedef vector<Point> VP;\\nconst double EPS = 1e-9; // 許容誤差^2\\nconst double INF = 1e9;\\nconst double PI = acos(-1.0);\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > +EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 直線と線分\\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\\n return cross(a2-a1, b1-a1) * \\n cross(a2-a1, b2-a1) < EPS;\\n}\\n\\n// 2直線の交点\\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\\n double d1 = cross(b2-b1, b1-a1);\\n double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n assert(!EQ(d2, 0)); // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\n\\n// 2円の交点\\nVP crosspointCC(Point a, double ar, Point b, double br) {\\n VP ps;\\n Point ab = b-a;\\n double d = abs(ab);\\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\\n if (EQ(d, 0) || ar < abs(crL)) return ps;\\n\\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\\n Point cp = a + crL/d * ab;\\n ps.push_back(cp + abN);\\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\\n return ps;\\n}\\n\\n// 多角形の内部判定\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inPolygon(const VP& ps, Point p) {\\n int n = ps.size();\\n bool in = false;\\n rep (i, n) {\\n Point a = ps[i] - p;\\n Point b = ps[(i + 1) % n] - p;\\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\\n if (a.Y > b.Y) swap(a,b);\\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\\n }\\n return in;\\n}\\n\\nbool inCircle(Point p, Point c, double r){\\n return abs(p-c) <= r;\\n}\\n\\nint n,m;\\n// ps: n個の頂点\\n// cs: m個の中心\\nbool check(double r, VP &ps, VP &cs){\\n // 全頂点が1つ以上の円に含まれている\\n rep(i,n){\\n bool ok = false;\\n rep(j,m){\\n if(inCircle(ps[i], cs[j], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n\\n // 2つの中心の垂直二等分線\\n rep(i,m)rep(j,i){\\n Point mid = (cs[i]+cs[j])/2.0;\\n double d = abs(cs[i]-mid) + 1000.0;\\n VP cps = crosspointCC(cs[i],d, cs[j],d);\\n rep(k,n){\\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\\n bool ok = false;\\n rep(l,m){\\n if(inCircle(p,cs[l],r)) ok = true;\\n }\\n if(!ok) return false;\\n }\\n }\\n }\\n\\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\\n rep(i,m)rep(j,i){\\n VP cps = crosspointCC(cs[i],r, cs[j],r);\\n for(auto p : cps)if(inPolygon(ps, p)){\\n bool ok = false;\\n rep(k,m)if(k!=i && k!=j){\\n if(inCircle(p, cs[k], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint main(void){\\n cin>>n;\\n VP ps(n);\\n rep(i,n){\\n double x,y;\\n cin>>x>>y;\\n ps[i] = Point(x,y);\\n }\\n cin>>m;\\n VP cs(m);\\n rep(i,m){\\n double x,y;\\n cin>>x>>y;\\n cs[i] = Point(x,y);\\n }\\n double l = 0, r = 1000000;\\n rep(loop,50){\\n double radius = (l+r)/2;\\n if(check(radius, ps, cs)){\\n r = radius;\\n }else{\\n l = radius;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", r);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.377,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3049_3146578\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<int(n);++i)\\n#define all(a) (a).begin(),(a).end()\\n\\ntypedef complex<double> Point;\\ntypedef vector<Point> VP;\\nconst double EPS = 1e-9; // 許容誤差^2\\nconst double INF = 1e9;\\nconst double PI = acos(-1.0);\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > +EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 直線と線分\\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\\n return cross(a2-a1, b1-a1) * \\n cross(a2-a1, b2-a1) < EPS;\\n}\\n\\n// 2直線の交点\\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\\n double d1 = cross(b2-b1, b1-a1);\\n double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n assert(!EQ(d2, 0)); // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\n\\n// 2円の交点\\nVP crosspointCC(Point a, double ar, Point b, double br) {\\n VP ps;\\n Point ab = b-a;\\n double d = abs(ab);\\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\\n if (EQ(d, 0) || ar < abs(crL)) return ps;\\n\\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\\n Point cp = a + crL/d * ab;\\n ps.push_back(cp + abN);\\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\\n return ps;\\n}\\n\\n// 頂点の順序（sortやmax_elementに必要）\\nnamespace std {\\n bool operator<(const Point a, const Point b) {\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n}\\n\\n// 凸包\\n// 入力1個 -> 空\\n// 2個以上の全て同じ点 -> 同じもの2つ\\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\\n int n = ps.size(), k = 0;\\n sort(ps.begin(), ps.end());\\n VP ch(2*n);\\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\\n ch.resize(k-1);\\n return ch;\\n}\\n\\n// 多角形の内部判定\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inPolygon(const VP& ps, Point p) {\\n int n = ps.size();\\n bool in = false;\\n rep (i, n) {\\n Point a = ps[i] - p;\\n Point b = ps[(i + 1) % n] - p;\\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\\n if (a.Y > b.Y) swap(a,b);\\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\\n }\\n return in;\\n}\\n\\nbool inCircle(Point p, Point c, double r){\\n return abs(p-c) <= r;\\n}\\n\\nint n,m;\\n// ps: n個の頂点\\n// cs: m個の中心\\nbool check(double r, VP &ps, VP &cs){\\n // 全頂点が1つ以上の円に含まれている\\n rep(i,n){\\n bool ok = false;\\n rep(j,m){\\n if(inCircle(ps[i], cs[j], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n\\n // 2つの中心の垂直二等分線\\n rep(i,m)rep(j,i){\\n Point mid = (cs[i]+cs[j])/2.0;\\n double d = abs(cs[i]-mid) + 1000.0;\\n VP cps = crosspointCC(cs[i],d, cs[j],d);\\n rep(k,n){\\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\\n bool ok = false;\\n rep(l,m){\\n if(inCircle(p,cs[l],r)) ok = true;\\n }\\n if(!ok) return false;\\n }\\n }\\n }\\n\\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\\n rep(i,m)rep(j,i){\\n VP cps = crosspointCC(cs[i],r, cs[j],r);\\n for(auto p : cps)if(inPolygon(ps, p)){\\n bool ok = false;\\n rep(k,m)if(k!=i && k!=j){\\n if(inCircle(p, cs[k], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint main(void){\\n cin>>n;\\n VP ps(n);\\n rep(i,n){\\n double x,y;\\n cin>>x>>y;\\n ps[i] = Point(x,y);\\n }\\n cin>>m;\\n VP cs(m);\\n rep(i,m){\\n double x,y;\\n cin>>x>>y;\\n cs[i] = Point(x,y);\\n }\\n double l = 0, r = 1000000;\\n rep(loop,100){\\n double radius = (l+r)/2;\\n if(check(radius, ps, cs)){\\n r = radius;\\n }else{\\n l = radius;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", r);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.7558,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3049_3146576\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<int(n);++i)\\n#define all(a) (a).begin(),(a).end()\\n\\ntypedef complex<double> Point;\\ntypedef vector<Point> VP;\\nconst double EPS = 1e-9; // 許容誤差^2\\nconst double INF = 1e9;\\nconst double PI = acos(-1.0);\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > +EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 直線と線分\\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\\n return cross(a2-a1, b1-a1) * \\n cross(a2-a1, b2-a1) < EPS;\\n}\\n\\n// 2直線の交点\\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\\n double d1 = cross(b2-b1, b1-a1);\\n double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n assert(!EQ(d2, 0)); // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\n\\n// 2円の交点\\nVP crosspointCC(Point a, double ar, Point b, double br) {\\n VP ps;\\n Point ab = b-a;\\n double d = abs(ab);\\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\\n if (EQ(d, 0) || ar < abs(crL)) return ps;\\n\\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\\n Point cp = a + crL/d * ab;\\n ps.push_back(cp + abN);\\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\\n return ps;\\n}\\n\\n// 頂点の順序（sortやmax_elementに必要）\\nnamespace std {\\n bool operator<(const Point a, const Point b) {\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n}\\n\\n// 凸包\\n// 入力1個 -> 空\\n// 2個以上の全て同じ点 -> 同じもの2つ\\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\\n int n = ps.size(), k = 0;\\n sort(ps.begin(), ps.end());\\n VP ch(2*n);\\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\\n ch.resize(k-1);\\n return ch;\\n}\\n\\n// 多角形の内部判定\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inPolygon(const VP& ps, Point p) {\\n int n = ps.size();\\n bool in = false;\\n rep (i, n) {\\n Point a = ps[i] - p;\\n Point b = ps[(i + 1) % n] - p;\\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\\n if (a.Y > b.Y) swap(a,b);\\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\\n }\\n return in;\\n}\\n\\nbool inCircle(Point p, Point c, double r){\\n return abs(p-c) <= r;\\n}\\n\\nint n,m;\\n// ps: n個の頂点\\n// cs: m個の中心\\nbool check(double r, VP &ps, VP &cs){\\n // 全頂点が1つ以上の円に含まれている\\n rep(i,n){\\n bool ok = false;\\n rep(j,m){\\n if(inCircle(ps[i], cs[j], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n\\n // 2つの中心の垂直二等分線\\n rep(i,m)rep(j,i){\\n Point mid = (cs[i]+cs[j])/2.0;\\n double d = abs(cs[i]-mid) + 1000.0;\\n VP cps = crosspointCC(cs[i],d, cs[j],d);\\n rep(k,n){\\n if(isecLS(cps[0],cps[1], ps[k],ps[(k+1)%n])){\\n Point p = crosspointLL(cps[0],cps[1], ps[k],ps[(k+1)%n]);\\n bool ok = false;\\n rep(l,m){\\n if(inCircle(p,cs[l],r)) ok = true;\\n }\\n if(!ok) return false;\\n }\\n }\\n }\\n\\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\\n rep(i,m)rep(j,i){\\n VP cps = crosspointCC(cs[i],r, cs[j],r);\\n for(auto p : cps)if(inPolygon(ps, p)){\\n bool ok = false;\\n rep(k,m)if(k!=i && k!=j){\\n if(inCircle(p, cs[k], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint main(void){\\n cin>>n;\\n VP ps(n);\\n rep(i,n){\\n double x,y;\\n cin>>x>>y;\\n ps[i] = Point(x,y);\\n }\\n ps = convexHull(ps);\\n cin>>m;\\n VP cs(m);\\n rep(i,m){\\n double x,y;\\n cin>>x>>y;\\n cs[i] = Point(x,y);\\n }\\n double l = 0, r = 1000000;\\n rep(loop,100){\\n double radius = (l+r)/2;\\n if(check(radius, ps, cs)){\\n r = radius;\\n }else{\\n l = radius;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", r);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.773,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3049_3145672\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define EPS (1e-6)\\n#define EQ(a, b) (abs((a) - (b)) < EPS)\\n\\ntypedef complex<double> vector2;\\ntypedef pair<vector2, vector2> line;\\n\\ndouble dot(vector2 a, vector2 b) { return real(conj(a) * b); }\\ndouble cross(vector2 a, vector2 b) { return imag(conj(a) * b); }\\n\\nvector<vector2> cc_cross(vector2 a, vector2 b, double r) {\\n double d = abs(b - a);\\n double rc = d / 2;\\n double rs = sqrt(r * r - rc * rc);\\n vector2 diff = (b - a) / d;\\n return {a + diff * vector2(rc, rs), a + diff * vector2(rc, -rs)};\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n;\\n vector<vector2> p(n);\\n for (auto &e : p) {\\n double x, y;\\n cin >> x >> y;\\n e = {x, y};\\n }\\n cin >> m;\\n vector<vector2> c(m);\\n for (auto &e : c) {\\n double x, y;\\n cin >> x >> y;\\n e = {x, y};\\n }\\n\\n double ng = 0, ok = 1e6, r;\\n while (ng + EPS < ok) {\\n r = (ng + ok) / 2.0;\\n bool isok = true;\\n\\n vector<int> v(n, -1);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n if (abs(c[j] - p[i]) < r) {\\n v[i] = j;\\n break;\\n }\\n }\\n if (v[i] == -1) {\\n isok = false;\\n }\\n }\\n\\n if (isok) {\\n vector<vector<bool>> g(m, vector<bool>(m));\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < m; j++) {\\n if (abs(c[j] - c[i]) < 2 * r) {\\n g[i][j] = true;\\n }\\n }\\n }\\n for (int k = 0; k < m; k++) {\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < m; j++) {\\n if (g[i][k] && g[k][j]) {\\n g[i][j] = true;\\n }\\n }\\n }\\n }\\n\\n for (int i = 0; i < m; i++) {\\n isok &= g[0][i];\\n }\\n }\\n\\n if (isok) {\\n vector<vector2> u;\\n for (int i = 0; i < m; i++) {\\n for (int j = i + 1; j < m; j++) {\\n vector<vector2> w = cc_cross(c[i], c[j], r);\\n for (auto e : w) {\\n bool outer = true;\\n for (int k = 0; k < m; k++) {\\n if (k == i || k == j) {\\n continue;\\n }\\n outer &= abs(e - c[k]) > r;\\n }\\n if (outer) {\\n u.push_back(e);\\n }\\n }\\n }\\n }\\n\\n for (auto e : u) {\\n double t = 0;\\n for (int i = 0; i < n; i++) {\\n int j = (i + 1) % n;\\n vector2 a = p[i] - e, b = p[j] - e;\\n t += atan2(cross(a, b), dot(a, b));\\n }\\n if (!EQ(t, 0)) {\\n isok = false;\\n break;\\n }\\n }\\n }\\n\\n if (isok) {\\n ok = r;\\n } else {\\n ng = r;\\n }\\n }\\n\\n cout << fixed << setprecision(6) << r << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 3668,\n \"score_of_the_acc\": -0.244,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3049_3145612\",\n \"code_snippet\": \"#include <cmath>\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <string>\\nnamespace lc {\\nstatic const double EPS = 1e-9;\\ninline double abs(double x){ return std::abs(x); }\\ninline bool tolerant_eq(double a, double b){ return abs(a - b) < EPS; }\\n}\\nnamespace lc {\\nstruct Point {\\n\\tdouble x;\\n\\tdouble y;\\n\\texplicit Point(const double &x = 0.0, const double &y = 0.0) :\\n\\t\\tx(x), y(y)\\n\\t{ }\\n\\tPoint operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\\n\\tPoint operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\\n\\tPoint operator*(double s) const { return Point(x * s, y * s); }\\n\\tPoint operator*(const Point &p) const {\\n\\t\\treturn Point(x * p.x - y * p.y, x * p.y + y * p.x);\\n\\t}\\n\\tPoint operator/(double s) const { return Point(x / s, y / s); }\\n\\tdouble abs() const { return sqrt(x * x + y * y); }\\n\\tdouble norm() const { return x * x + y * y; }\\n\\tPoint unit() const { return *this / abs(); }\\n};\\ninline Point operator*(double s, const Point &p){ return p * s; }\\ninline bool tolerant_eq(const Point &a, const Point &b){\\n\\treturn tolerant_eq(a.x, b.x) && tolerant_eq(a.y, b.y);\\n}\\ninline double cross(const Point &a, const Point &b){\\n\\treturn a.x * b.y - a.y * b.x;\\n}\\ninline double dot(const Point &a, const Point &b){\\n\\treturn a.x * b.x + a.y * b.y;\\n}\\n}\\nnamespace lc {\\nstruct Line {\\n\\tPoint a;\\n\\tPoint b;\\n\\texplicit Line(const Point &a = Point(), const Point &b = Point()) :\\n\\t\\ta(a), b(b)\\n\\t{ }\\n\\tPoint projection(const Point &p) const {\\n\\t\\tdouble t = dot(p - a, b - a) / (b - a).norm();\\n\\t\\treturn a + t * (b - a);\\n\\t}\\n\\tPoint direction() const {\\n\\t\\treturn (b - a).unit();\\n\\t}\\n};\\n}\\nnamespace lc {\\nstruct Segment {\\n\\tPoint a;\\n\\tPoint b;\\n\\texplicit Segment(const Point &a = Point(), const Point &b = Point()) :\\n\\t\\ta(a), b(b)\\n\\t{ }\\n\\tLine to_line() const { return Line(a, b); }\\n};\\n}\\nnamespace lc {\\nstruct Circle {\\n\\tPoint c;\\n\\tdouble r;\\n\\texplicit Circle(const Point &c = Point(), double r = 0.0) :\\n\\t\\tc(c), r(r)\\n\\t{ }\\n};\\ninline bool tolerant_eq(const Circle &a, const Circle &b){\\n\\treturn tolerant_eq(a.c, b.c) && tolerant_eq(a.r, b.r);\\n}\\n}\\nnamespace lc {\\ninline bool intersect(const Point &a, const Segment &b){\\n\\treturn (b.a - a).abs() + (b.b - a).abs() - (b.b - b.a).abs() < EPS;\\n}\\ninline bool intersect(const Segment &a, const Point &b){\\n\\treturn intersect(b, a);\\n}\\ninline bool intersect(const Circle &a, const Circle &b){\\n\\tconst double d = (a.c - b.c).abs();\\n\\treturn d <= a.r + b.r && a.r + d >= b.r && b.r + d >= a.r;\\n}\\n}\\nnamespace lc {\\ninline std::vector<Point> crossing_points(const Line &l, const Circle &c){\\n\\tconst Point &p = l.projection(c.c);\\n\\tconst double t = (p - c.c).abs();\\n\\tif(t > c.r + EPS){ return std::vector<Point>(); }\\n\\tif(t > c.r - EPS){ return std::vector<Point>(1, p); }\\n\\tconst Point v = l.direction();\\n\\tconst double d = sqrt(c.r * c.r - t * t);\\n\\treturn std::vector<Point>({ p + d * v, p - d * v });\\n}\\ninline std::vector<Point> crossing_points(const Segment &s, const Circle &c){\\n\\tconst std::vector<Point> cps(crossing_points(s.to_line(), c));\\n\\tstd::vector<Point> result;\\n\\tfor(const auto &p : cps){\\n\\t\\tif(intersect(s, p)){ result.push_back(p); }\\n\\t}\\n\\treturn result;\\n}\\ninline std::vector<Point> crossing_points(const Circle &a, const Circle &b){\\n\\tstd::vector<Point> ret;\\n\\tif(!intersect(a, b)){ return ret; }\\n\\tif(tolerant_eq(a, b)){\\n\\t\\tret.push_back(a.c + Point(a.r, 0.0));\\n\\t\\tret.push_back(a.c + Point(-a.r, 0.0));\\n\\t\\tret.push_back(a.c + Point(0.0, a.r));\\n\\t}else{\\n\\t\\tconst double d = (a.c - b.c).abs();\\n\\t\\tconst double rc = (d * d + a.r * a.r - b.r * b.r) / (2.0 * d);\\n\\t\\tconst double rs = sqrt(a.r * a.r - rc * rc);\\n\\t\\tconst Point diff = (b.c - a.c) / d;\\n\\t\\tconst Point x = a.c + diff * Point(rc, rs);\\n\\t\\tconst Point y = a.c + diff * Point(rc, -rs);\\n\\t\\tret.push_back(x);\\n\\t\\tif(!tolerant_eq(x, y)){ ret.push_back(y); }\\n\\t}\\n\\treturn ret;\\n}\\n}\\nnamespace lc {\\nclass Polygon {\\nprivate:\\n\\tstd::vector<Point> m_points;\\npublic:\\n\\texplicit Polygon(size_t s, const Point &p = Point())\\n\\t\\t: m_points(s, p)\\n\\t{ }\\n\\tPoint &operator[](int i){ return m_points[i]; }\\n\\tSegment side(int i) const {\\n\\t\\treturn Segment(m_points[i], m_points[(i + 1) % m_points.size()]);\\n\\t}\\n\\tint size() const { return static_cast<int>(m_points.size()); }\\n\\tint contains(const Point &p) const {\\n\\t\\tint result = -1;\\n\\t\\tfor(int i = 0; i < size(); ++i){\\n\\t\\t\\tPoint a = m_points[i] - p;\\n\\t\\t\\tPoint b = m_points[(i + 1) % size()] - p;\\n\\t\\t\\tif(a.y > b.y){ std::swap(a, b); }\\n\\t\\t\\tif(a.y <= 0.0 && b.y > 0.0 && cross(a, b) < 0.0){\\n\\t\\t\\t\\tresult = -result;\\n\\t\\t\\t}\\n\\t\\t\\tif(cross(a, b) == 0.0 && dot(a, b) <= 0.0){ return 0; }\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n};\\n}\\nusing namespace std;\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tcout << setiosflags(ios::fixed) << setprecision(10);\\n\\tint n, m;\\n\\tcin >> n;\\n\\tlc::Polygon poly(n);\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\tcin >> poly[i].x >> poly[i].y;\\n\\t}\\n\\tcin >> m;\\n\\tvector<lc::Point> centers(m);\\n\\tfor(int i = 0; i < m; ++i){\\n\\t\\tcin >> centers[i].x >> centers[i].y;\\n\\t}\\n\\tdouble lo = 0, hi = 1e8;\\n\\tfor(int iter = 0; iter < 100; ++iter){\\n\\t\\tconst double r = (lo + hi) / 2;\\n\\t\\tvector<lc::Circle> circles(m);\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tcircles[i] = lc::Circle(centers[i], r);\\n\\t\\t}\\n\\t\\tvector<lc::Point> testers;\\n\\t\\tfor(int i = 0; i < n; ++i){ testers.push_back(poly[i]); }\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tfor(int j = 0; j < m; ++j){\\n\\t\\t\\t\\tconst auto cps = lc::crossing_points(circles[i], circles[j]);\\n\\t\\t\\t\\tfor(const auto& p : cps){\\n\\t\\t\\t\\t\\tif(poly.contains(p) >= 0){ testers.push_back(p); }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j = 0; j < n; ++j){\\n\\t\\t\\t\\tconst auto cps = lc::crossing_points(poly.side(j), circles[i]);\\n\\t\\t\\t\\tfor(const auto& p : cps){ testers.push_back(p); }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool accept = true;\\n\\t\\tfor(const auto& p : testers){\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor(const auto& c : circles){\\n\\t\\t\\t\\tif((c.c - p).norm() < (r - lc::EPS) * (r - lc::EPS)){\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!ok){\\n\\t\\t\\t\\taccept = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(accept){\\n\\t\\t\\thi = r;\\n\\t\\t}else{\\n\\t\\t\\tlo = r;\\n\\t\\t}\\n\\t}\\n\\tcout << lo << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.0859,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3049_3145611\",\n \"code_snippet\": \"#include <cmath>\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <string>\\nnamespace lc {\\nstatic const double EPS = 1e-9;\\ninline double abs(double x){ return std::abs(x); }\\ninline bool tolerant_eq(double a, double b){ return abs(a - b) < EPS; }\\n}\\nnamespace lc {\\nstruct Point {\\n\\tdouble x;\\n\\tdouble y;\\n\\texplicit Point(const double &x = 0.0, const double &y = 0.0) :\\n\\t\\tx(x), y(y)\\n\\t{ }\\n\\tPoint operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\\n\\tPoint operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\\n\\tPoint operator*(double s) const { return Point(x * s, y * s); }\\n\\tPoint operator*(const Point &p) const {\\n\\t\\treturn Point(x * p.x - y * p.y, x * p.y + y * p.x);\\n\\t}\\n\\tPoint operator/(double s) const { return Point(x / s, y / s); }\\n\\tdouble abs() const { return sqrt(x * x + y * y); }\\n\\tdouble norm() const { return x * x + y * y; }\\n\\tPoint unit() const { return *this / abs(); }\\n};\\ninline Point operator*(double s, const Point &p){ return p * s; }\\ninline bool tolerant_eq(const Point &a, const Point &b){\\n\\treturn tolerant_eq(a.x, b.x) && tolerant_eq(a.y, b.y);\\n}\\ninline double cross(const Point &a, const Point &b){\\n\\treturn a.x * b.y - a.y * b.x;\\n}\\ninline double dot(const Point &a, const Point &b){\\n\\treturn a.x * b.x + a.y * b.y;\\n}\\n}\\nnamespace lc {\\nstruct Line {\\n\\tPoint a;\\n\\tPoint b;\\n\\texplicit Line(const Point &a = Point(), const Point &b = Point()) :\\n\\t\\ta(a), b(b)\\n\\t{ }\\n\\tPoint projection(const Point &p) const {\\n\\t\\tdouble t = dot(p - a, b - a) / (b - a).norm();\\n\\t\\treturn a + t * (b - a);\\n\\t}\\n\\tPoint direction() const {\\n\\t\\treturn (b - a).unit();\\n\\t}\\n};\\n}\\nnamespace lc {\\nstruct Segment {\\n\\tPoint a;\\n\\tPoint b;\\n\\texplicit Segment(const Point &a = Point(), const Point &b = Point()) :\\n\\t\\ta(a), b(b)\\n\\t{ }\\n\\tLine to_line() const { return Line(a, b); }\\n};\\n}\\nnamespace lc {\\nstruct Circle {\\n\\tPoint c;\\n\\tdouble r;\\n\\texplicit Circle(const Point &c = Point(), double r = 0.0) :\\n\\t\\tc(c), r(r)\\n\\t{ }\\n};\\ninline bool tolerant_eq(const Circle &a, const Circle &b){\\n\\treturn tolerant_eq(a.c, b.c) && tolerant_eq(a.r, b.r);\\n}\\n}\\nnamespace lc {\\ninline bool intersect(const Point &a, const Segment &b){\\n\\treturn (b.a - a).abs() + (b.b - a).abs() - (b.b - b.a).abs() < EPS;\\n}\\ninline bool intersect(const Segment &a, const Point &b){\\n\\treturn intersect(b, a);\\n}\\ninline bool intersect(const Circle &a, const Circle &b){\\n\\tconst double d = (a.c - b.c).abs();\\n\\treturn d <= a.r + b.r && a.r + d >= b.r && b.r + d >= a.r;\\n}\\n}\\nnamespace lc {\\ninline std::vector<Point> crossing_points(const Line &l, const Circle &c){\\n\\tconst Point &p = l.projection(c.c);\\n\\tconst double t = (p - c.c).abs();\\n\\tif(t > c.r + EPS){ return std::vector<Point>(); }\\n\\tif(t > c.r - EPS){ return std::vector<Point>(1, p); }\\n\\tconst Point v = l.direction();\\n\\tconst double d = sqrt(c.r * c.r - t * t);\\n\\treturn std::vector<Point>({ p + d * v, p - d * v });\\n}\\ninline std::vector<Point> crossing_points(const Segment &s, const Circle &c){\\n\\tconst std::vector<Point> cps(crossing_points(s.to_line(), c));\\n\\tstd::vector<Point> result;\\n\\tfor(const auto &p : cps){\\n\\t\\tif(intersect(s, p)){ result.push_back(p); }\\n\\t}\\n\\treturn result;\\n}\\ninline std::vector<Point> crossing_points(const Circle &a, const Circle &b){\\n\\tstd::vector<Point> ret;\\n\\tif(!intersect(a, b)){ return ret; }\\n\\tif(tolerant_eq(a, b)){\\n\\t\\tret.push_back(a.c + Point(a.r, 0.0));\\n\\t\\tret.push_back(a.c + Point(-a.r, 0.0));\\n\\t\\tret.push_back(a.c + Point(0.0, a.r));\\n\\t}else{\\n\\t\\tconst double d = (a.c - b.c).abs();\\n\\t\\tconst double rc = (d * d + a.r * a.r - b.r * b.r) / (2.0 * d);\\n\\t\\tconst double rs = sqrt(a.r * a.r - rc * rc);\\n\\t\\tconst Point diff = (b.c - a.c) / d;\\n\\t\\tconst Point x = a.c + diff * Point(rc, rs);\\n\\t\\tconst Point y = a.c + diff * Point(rc, -rs);\\n\\t\\tret.push_back(x);\\n\\t\\tif(!tolerant_eq(x, y)){ ret.push_back(y); }\\n\\t}\\n\\treturn ret;\\n}\\n}\\nnamespace lc {\\nclass Polygon {\\nprivate:\\n\\tstd::vector<Point> m_points;\\npublic:\\n\\texplicit Polygon(size_t s, const Point &p = Point())\\n\\t\\t: m_points(s, p)\\n\\t{ }\\n\\tPoint &operator[](int i){ return m_points[i]; }\\n\\tSegment side(int i) const {\\n\\t\\treturn Segment(m_points[i], m_points[(i + 1) % m_points.size()]);\\n\\t}\\n\\tint size() const { return static_cast<int>(m_points.size()); }\\n\\tint contains(const Point &p) const {\\n\\t\\tint result = -1;\\n\\t\\tfor(int i = 0; i < size(); ++i){\\n\\t\\t\\tPoint a = m_points[i] - p;\\n\\t\\t\\tPoint b = m_points[(i + 1) % size()] - p;\\n\\t\\t\\tif(a.y > b.y){ std::swap(a, b); }\\n\\t\\t\\tif(a.y <= 0.0 && b.y > 0.0 && cross(a, b) < 0.0){\\n\\t\\t\\t\\tresult = -result;\\n\\t\\t\\t}\\n\\t\\t\\tif(cross(a, b) == 0.0 && dot(a, b) <= 0.0){ return 0; }\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n};\\n}\\nusing namespace std;\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tcout << setiosflags(ios::fixed) << setprecision(10);\\n\\tint n, m;\\n\\tcin >> n;\\n\\tlc::Polygon poly(n);\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\tcin >> poly[i].x >> poly[i].y;\\n\\t}\\n\\tcin >> m;\\n\\tvector<lc::Point> centers(m);\\n\\tfor(int i = 0; i < m; ++i){\\n\\t\\tcin >> centers[i].x >> centers[i].y;\\n\\t}\\n\\tdouble lo = 0, hi = 1e6;\\n\\tfor(int iter = 0; iter < 50; ++iter){\\n\\t\\tconst double r = (lo + hi) / 2;\\n\\t\\tvector<lc::Circle> circles(m);\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tcircles[i] = lc::Circle(centers[i], r);\\n\\t\\t}\\n\\t\\tvector<lc::Point> testers;\\n\\t\\tfor(int i = 0; i < n; ++i){ testers.push_back(poly[i]); }\\n\\t\\tfor(int i = 0; i < m; ++i){\\n\\t\\t\\tfor(int j = 0; j < m; ++j){\\n\\t\\t\\t\\tconst auto cps = lc::crossing_points(circles[i], circles[j]);\\n\\t\\t\\t\\tfor(const auto& p : cps){\\n\\t\\t\\t\\t\\tif(poly.contains(p) >= 0){ testers.push_back(p); }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j = 0; j < n; ++j){\\n\\t\\t\\t\\tconst auto cps = lc::crossing_points(poly.side(j), circles[i]);\\n\\t\\t\\t\\tfor(const auto& p : cps){ testers.push_back(p); }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool accept = true;\\n\\t\\tfor(const auto& p : testers){\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor(const auto& c : circles){\\n\\t\\t\\t\\tif((c.c - p).norm() < r * r - lc::EPS){\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!ok){\\n\\t\\t\\t\\taccept = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(accept){\\n\\t\\t\\thi = r;\\n\\t\\t}else{\\n\\t\\t\\tlo = r;\\n\\t\\t}\\n\\t}\\n\\tcout << lo << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.47619047619047616,\n \"time_ms\": 30,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.0301,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3049_3145597\",\n \"code_snippet\": \"#include<iostream>\\n#include<complex>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<stack>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#include<assert.h>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef int Def;\\ntypedef pair<Def,Def> pii;\\ntypedef vector<Def> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef vector<string> vs;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef pair<Def,pii> pip;\\ntypedef vector<pip>vip;\\n//#define mt make_tuple\\n//typedef tuple<double,int,double> tp;\\n//typedef vector<tp> vt;\\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\\nconst double PI=acos(-1);\\nconst double EPS=1e-10;\\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;\\nint dx[]={0,1,0,-1};\\nint dy[]={1,0,-1,0};\\ntypedef complex<double> P;\\ntypedef vector<P> G;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\n\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L(){;}\\n};\\nstruct C{\\n\\tP c;double r;\\n\\tC(const P &c,double r):c(c),r(r){}\\n};\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\n#define diff(P, i) (next(P, i) - curr(P, i))\\nnamespace std {\\n\\tbool operator < (const P& a, const P& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t\\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \\n\\t}\\n\\tbool operator == (const P& a, const P& b) {\\n\\t\\treturn a.real()==b.real()&&a.imag()==b.imag();\\n\\t}\\n}\\nP pin(){\\n\\tdouble x,y;\\n\\tchar d;\\n\\tcin>>x>>y;\\n\\tP p(x,y);\\n\\treturn p;\\n}\\nvoid PIN(P* a,int n){\\n\\trep(i,n)a[i]=pin();\\n}\\ndouble dot(P a,P b){\\n\\treturn real(conj(a)*b);\\n}\\ndouble cross(P a,P b){\\n\\treturn imag(conj(a)*b);\\n}\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0; // a--c--b on line\\n}\\nP projection(L a,P p){\\n\\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\\n\\treturn a[0]+t*(a[0]-a[1]);\\n}\\nP reflection(L a,P p){\\n\\treturn p+2.0*(projection(a,p)-p);\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\ndouble distanceLP(const L &l, const P &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const L &l, const L &m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const L &l, const L &s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const L &s, const P &p) {\\n const P r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const L &s, const L &t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\\n}\\n/*bool intersectCS(C c,const L &l){\\n return (distanceLP(l,c.c) < c.r+EPS &&\\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\\n}*/\\nint intersectCS(C c,L l){\\n\\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\\n\\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\\n\\tif(d1<c.r+EPS&&d2<c.r+EPS)return 0;\\n\\tif(d1<c.r-EPS&&d2>c.r+EPS||d1>c.r+EPS&&d2<c.r-EPS)return 1;\\n\\tconst P h=projection(l,c.c);\\n\\tif(dot(l[0]-h,l[1]-h)<0)return 2;\\n\\treturn 0;\\n}\\nP crosspointSS(L a,L b){\\n\\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\\n\\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\\n\\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\\n}\\nL crosspointCL(C c,L l){\\n\\tP pr=projection(l,c.c);\\n\\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\\n\\tdouble tmp=c.r*c.r-norm(pr-c.c);\\n\\tif(abs(tmp)<EPS)tmp=0;\\n\\tdouble t=sqrt(tmp);\\n\\tP a=pr+t*e;\\n\\tP b=pr-t*e;\\n\\tif(b<a)swap(a,b);\\n\\treturn L(a,b);\\n}\\nL crosspointCS(C c,L l){\\n\\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\\n\\tL ret=crosspointCL(c,l);\\n\\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\\n\\telse ret[0]=ret[1];\\n\\treturn ret;\\n}\\nL crosspointCC(C a,C b){\\n\\tP tmp=b.c-a.c;\\n\\tdouble d=abs(tmp);\\n\\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\\n\\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\\n\\tP p1=a.c+polar(a.r,t+q);\\n\\tP p2=a.c+polar(a.r,t-q);\\n\\tif(p2<p1)swap(p1,p2);\\n\\treturn L(p1,p2);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1] - l[0], m[1] - m[0]);\\n double B = cross(l[1] - l[0], l[1] - m[0]);\\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble area(const G &g){\\n double S =0;\\n for(int i =0;i <g.size();i++){\\n S +=(cross(g[i],g[(i+1)%g.size()]));\\n }\\n return abs(S/2.0);\\n}\\nbool isconvex(const G &g){\\n\\tint n=g.size();\\n\\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\\n\\treturn true;\\n}\\nint inconvex(const G& g, const P& p) {\\n\\tbool in = false;\\n\\tint n=g.size();\\n\\trep(i,n){\\n\\t\\tP a=g[i%n]-p;\\n\\t\\tP b=g[(i+1)%n]-p;\\n\\t\\tif(imag(a)>imag(b))swap(a, b);\\n\\t\\tif(imag(a)<EPS&&0<imag(b))if(cross(a,b)<0)in=!in;\\n\\t\\tif(abs(cross(a,b))<EPS&&dot(a,b)<EPS)return 1;//ON\\n\\t}\\n\\treturn in?2:0;//IN : OUT;\\n}\\nG convex_hull(G &ps) {\\n int n=ps.size(),k=0;\\n\\tsort(ps.begin(), ps.end());\\n\\tG ch(2*n);\\n\\tfor(int i=0;i<n;ch[k++]=ps[i++])//lower-hull\\n\\t\\twhile(k>=2&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//<=0 -> ==-1\\n\\tfor(int i=n-2,t=k+1;i>=0;ch[k++]=ps[i--])//upper-hull\\n\\t\\twhile(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//\\n\\tch.resize(k-1);\\n\\treturn ch;\\n}\\ndouble convex_diameter(const G &pt) {\\n const int n = pt.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(pt[i]) > imag(pt[is])) is = i;\\n if (imag(pt[i]) < imag(pt[js])) js = i;\\n }\\n double maxd = norm(pt[is]-pt[js]);\\n\\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\\n else i = (i+1) % n;\\n if (norm(pt[i]-pt[j]) > maxd) {\\n maxd = norm(pt[i]-pt[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}//convex_diameter(g)\\nG convex_cut(const G& g, const L& l) {\\n G Q;\\n for (int i = 0; i < g.size(); ++i) {\\n P a= curr(g, i), b= next(g, i);\\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\\n Q.push_back(crosspointLL(L(a,b), l));\\n }\\n return Q;\\n}\\nP turn(P p,double t){\\n\\treturn p*exp(P(.0,t*PI/180.0));\\n}\\nP turn2(P p,double t){\\n\\treturn p*exp(P(.0,t));\\n}\\nvector<L> tangentCC(C a,C b){\\n\\tif(a.r<b.r)swap(a,b);\\n\\tdouble d=abs(a.c-b.c);\\n\\tvector<L>l;\\n\\tif(d<EPS)return l;\\n\\tif(a.r+b.r<d-EPS){//hanareteiru\\n\\t\\tdouble t=acos((a.r+b.r)/d);\\n\\t\\tt=t*180/PI;\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\\n\\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\\n\\t\\tP p=a.c+a.r/d*(b.c-a.c);\\n\\t\\tl.pb(L(p,p+turn(b.c-a.c,90)));\\n\\t}\\n\\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\\n\\t\\tdouble t1=acos((a.r-b.r)/d);\\n\\t\\tt1=t1*180/PI;\\n\\t\\tdouble t2=180-t1;\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\\n\\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\\n\\t\\tP p=a.c+a.r/d*(b.c-a.c);\\n\\t\\tl.pb(L(p,p+turn(b.c-a.c,90)));\\n\\t}\\n\\treturn l;\\n}\\nvoid printL(const L &out){\\n\\tprintf(\\\"%0.9f %0.9f %0.9f %0.9f\\\\n\\\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\\n}\\nC CIN(){\\n\\tP p=pin();\\n\\tdouble r;\\n\\tcin>>r;\\n\\treturn C(p,r);\\n}\\nbool para(L a,L b){\\n\\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\\n}\\ndouble min(double a,double b){return a<b?a:b;}\\ndouble max(double a,double b){return a>b?a:b;}\\n\\n\\n//XY座標\\n#define X real()\\n#define Y imag()\\n\\t\\n// 三角形クラス\\nclass Triangle{\\n\\nprivate:\\n\\t//三角形の３点の座標\\n\\tP a, b, c;\\n\\t//三角形の３辺の長さ\\n\\tdouble edgeA,edgeB,edgeC;\\n\\t//三角形の３角の大きさ(ラジアン)\\n\\tdouble angleA,angleB,angleC;\\n\\t//余弦定理から３つの角度を求める関数\\n\\tdouble LawOfCosines(double a,double b, double c){\\n\\t\\treturn acos( (b*b+c*c-a*a) / (2.0*b*c) );\\n\\t}\\n\\t//２つのdouble型の数値が等しいかどうか\\n\\tbool equal(double a, double b){\\n\\t\\treturn (abs( a-b ) < EPS)? true : false ;\\n\\t}\\n\\npublic:\\n\\t//コンストラクタ(３つの点と辺と角度を初期化)\\n\\tTriangle(P p1, P p2, P p3){\\n\\t\\ta = p1;\\n\\t\\tb = p2;\\n\\t\\tc = p3;\\n\\t\\tedgeB = abs(c-a);\\n\\t\\tedgeA = abs(b-c);\\n\\t\\tedgeC = abs(a-b);\\n\\t\\tangleA = LawOfCosines(edgeA,edgeB,edgeC);\\n\\t\\tangleB = LawOfCosines(edgeB,edgeC,edgeA);\\n\\t\\tangleC = LawOfCosines(edgeC,edgeA,edgeB);\\n\\t}\\n\\t\\n\\tdouble circumscribedCircleRadius(){//外接円の半径を返す\\n\\t\\treturn ( edgeA / sin(angleA) / 2.0 );\\n\\t}\\n\\tdouble circumscribedCircleX(){//外心(外接円の中心)のX座標を返す\\n\\t\\tdouble A = sin(2.0*angleA);\\n\\t\\tdouble B = sin(2.0*angleB);\\n\\t\\tdouble C = sin(2.0*angleC);\\n\\t\\treturn ( (a.X * A + b.X * B + c.X * C) / (A+B+C) );\\n\\t}\\n\\tdouble circumscribedCircleY(){//外心(外接円の中心)のY座標を返す\\n\\t\\tdouble A = sin(2.0*angleA);\\n\\t\\tdouble B = sin(2.0*angleB);\\n\\t\\tdouble C = sin(2.0*angleC);\\n\\t\\treturn ( (a.Y * A + b.Y * B + c.Y * C) / (A+B+C) );\\n\\t}\\n};\\n\\nint main(){\\n//\\t\\tTriangle Tr(a,b,c);\\n//\\t\\tr = Tr.circumscribedCircleRadius();\\n//\\t\\txp = Tr.circumscribedCircleX();\\n//\\t\\typ = Tr.circumscribedCircleY();\\n\\n\\tint n;\\n\\tcin>>n;\\n\\tG g(n);\\n\\trep(i,n){\\n\\t\\tdouble a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\tg[i]=P(a,b);\\n\\t}\\n\\tint m;\\n\\tcin>>m;\\n\\tG in(m);\\n\\trep(i,m){\\n\\t\\tdouble a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\tin[i]=P(a,b);\\n\\t}\\t\\n\\tdouble out=0;\\n\\trep(i,n){\\n\\t\\tdouble mi=inf;\\n\\t\\trep(j,m)mi=min(mi,abs(g[i]-in[j]));\\n\\t\\tout=max(out,mi);\\n\\t}//couner\\n//\\tcout<<shosu(10)<<out<<endl;\\n\\t\\n\\trep(i,m)loop(j,i+1,m)loop(k,j+1,m){\\n\\t\\tTriangle Tr(in[i],in[j],in[k]);\\n\\t\\tP p(Tr.circumscribedCircleX(),Tr.circumscribedCircleY());\\n\\t\\tif(!inconvex(g,p))continue;\\n\\t\\tdouble mi=inf;\\n\\t\\trep(q,m)mi=min(mi,abs(p-in[q]));\\n\\t\\tout=max(out,mi);\\n\\t}// gaisin\\n//\\tcout<<shosu(10)<<out<<endl;\\n\\n\\trep(i,m)loop(j,i+1,m){\\n\\t\\tP p=in[i]+(in[j]-in[i])/2.;\\n\\t\\tL l(p,p+P(0,1)*(in[j]-in[i]));\\n\\t\\trep(k,n){\\n\\t\\t\\tif(!intersectLS(l,L(g[k],g[(k+1)%n])))continue;\\n\\t\\t\\tP cr=crosspointLL(l,L(g[k],g[(k+1)%n]));\\n\\t\\t\\tdouble mi=inf;\\n\\t\\t\\trep(q,m)mi=min(mi,abs(cr-in[q]));\\n\\t\\t\\tout=max(out,mi);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<shosu(10)<<out<<endl;\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.1487,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3049_3145556\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<int(n);++i)\\n#define rep1(i,n) for(int i=1;i<=int(n);++i)\\n#define all(a) (a).begin(),(a).end()\\n#define lb(s,x) lower_bound(all(s),x)-s.begin()\\n#define ub(s,x) upper_bound(all(s),x)-s.begin()\\n#define uniq(a) a.erase(unique(all(a)),a.end())\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\ntemplate<class T,class U>\\nostream& operator<<(ostream& o, const pair<T,U> &p){\\n o<<\\\"(\\\"<<p.first<<\\\", \\\"<<p.second<<\\\")\\\";\\n return o;\\n}\\n#define print(v) { cerr<<#v<<\\\": [ \\\"; for(auto _ : v) cerr<<_<<\\\", \\\"; cerr<<\\\"]\\\"<<endl; }\\ntypedef long long ll;\\n\\n\\ntypedef complex<double> Point;\\ntypedef pair<Point, Point> Line;\\ntypedef vector<Point> VP;\\nconst double EPS = 1e-9; // 許容誤差^2\\nconst double INF = 1e9;\\nconst double PI = acos(-1.0);\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > +EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n/* \\n 交差判定 直線・線分は縮退してはならない。\\n 接する場合は交差するとみなす。\\n 縮退している := 2つのものが区別付かない状態(?)\\n isec = intersect\\n L = Line\\n P = Point\\n S = Segment\\n*/\\n\\n// 直線と点\\nbool isecLP(Point a1, Point a2, Point b) {\\n return abs(ccw(a1, a2, b)) != 1;\\n // return EQ(cross(a2-a1, b-a1), 0); と等価\\n}\\n\\n// 直線と直線\\nbool isecLL(Point a1, Point a2, Point b1, Point b2) {\\n return !isecLP(a2-a1, b2-b1, 0) || isecLP(a1, b1, b2);\\n}\\n\\n// 直線と線分\\nbool isecLS(Point a1, Point a2, Point b1, Point b2) {\\n return cross(a2-a1, b1-a1) * \\n cross(a2-a1, b2-a1) < EPS;\\n}\\n\\n// 線分と線分\\nbool isecSS(Point a1, Point a2, Point b1, Point b2) {\\n return ccw(a1, a2, b1)*ccw(a1, a2, b2) <= 0 &&\\n ccw(b1, b2, a1)*ccw(b1, b2, a2) <= 0;\\n}\\n\\n// 線分と点\\nbool isecSP(Point a1, Point a2, Point b) {\\n return !ccw(a1, a2, b);\\n}\\n\\n\\n/* 距離 各直線・線分は縮退してはならない */\\n\\n// 点pの直線aへの射影点を返す\\nPoint proj(Point a1, Point a2, Point p) {\\n return a1 + dot(a2-a1, p-a1)/norm(a2-a1) * (a2-a1);\\n}\\n\\n// 点pの直線aへの反射点を返す\\nPoint reflection(Point a1, Point a2, Point p) {\\n return 2.0*proj(a1, a2, p) - p;\\n}\\n\\n//点aと点bの距離は abs(a-b)\\n//#define distPP(p1,p2) abs(p1-p2)\\n\\ndouble distLP(Point a1, Point a2, Point p) {\\n return abs(proj(a1, a2, p) - p);\\n}\\n\\ndouble distLL(Point a1, Point a2, Point b1, Point b2) {\\n return isecLL(a1, a2, b1, b2) ? 0 : distLP(a1, a2, b1);\\n}\\n\\ndouble distLS(Point a1, Point a2, Point b1, Point b2) {\\n return isecLS(a1, a2, b1, b2) ? 0 : min(distLP(a1, a2, b1), distLP(a1, a2, b2));\\n}\\n\\ndouble distSP(Point a1, Point a2, Point p) {\\n Point r = proj(a1, a2, p);\\n if (isecSP(a1, a2, r)) return abs(r-p);\\n //= !ccw(a1, a2, r)\\n return min(abs(a1-p), abs(a2-p));\\n}\\n\\ndouble distSS(Point a1, Point a2, Point b1, Point b2) {\\n if (isecSS(a1, a2, b1, b2)) return 0;\\n return min({\\n distSP(a1, a2, b1),\\n distSP(a1, a2, b2),\\n distSP(b1, b2, a1),\\n distSP(b1, b2, a2)});\\n}\\n\\n// 2直線の交点\\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\\n double d1 = cross(b2-b1, b1-a1);\\n double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n assert(!EQ(d2, 0)); // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\n\\n\\n/* 円 */\\n\\ndouble distLC(Point a1, Point a2, Point c, double r) {\\n return max(distLP(a1, a2, c) - r, 0.0);\\n}\\n\\ndouble distSC(Point a1, Point a2, Point c, double r) {\\n double dSqr1 = norm(c-a1), dSqr2 = norm(c-a2);\\n if ((dSqr1 < r*r) ^ (dSqr2 < r*r)) return 0; // 円が線分を包含するとき距離0ならここをORに変える\\n if ((dSqr1 < r*r) & (dSqr2 < r*r)) return r - sqrt(max(dSqr1, dSqr2));\\n return max(distSP(a1, a2, c) - r, 0.0);\\n}\\n\\nVP crosspointLC(Point a1, Point a2, Point c, double r) {\\n VP ps;\\n Point ft = proj(a1, a2, c);\\n if(!GE(r*r,norm(ft-c))) return ps;\\n Point dir = sqrt(max(r*r - norm(ft-c), 0.0)) / abs(a2-a1) * (a2-a1);\\n ps.push_back(ft + dir);\\n if (!EQ(r*r, norm(ft-c))) ps.push_back(ft - dir);\\n return ps;\\n}\\n\\ndouble distCC(Point a, double ar, Point b, double br) {\\n double d = abs(a-b);\\n return GE(d, abs(ar-br)) ? max(d-ar-br, 0.0) : abs(ar-br) - d;\\n}\\n\\n// 2円の交点\\nVP crosspointCC(Point a, double ar, Point b, double br) {\\n VP ps;\\n Point ab = b-a;\\n double d = abs(ab);\\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\\n if (EQ(d, 0) || ar < abs(crL)) return ps;\\n\\n Point abN = ab * Point(0, sqrt(ar*ar - crL*crL) / d);\\n Point cp = a + crL/d * ab;\\n ps.push_back(cp + abN);\\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\\n return ps;\\n}\\n\\n\\n// // 2円の交点(自作)\\n// VP crosspointCC(Point a, double ar, Point b, double br){\\n// double d = abs(b-a);\\n// if(abs(ar-br)>d || abs(ar+br)<d) return {};\\n// double t = acos(double((d*d+ar*ar-br*br)/(2*d*ar)));\\n// Point p1 = a+polar(ar,arg(b-a)+t);\\n// Point p2 = a+polar(ar,arg(b-a)-t);\\n// if(abs(p1-p2) < EPS) return {p1};\\n// return {p1,p2};\\n// }\\n\\n\\n// 点pから円aへの接線の接点\\nVP tangentPoints(Point a, double ar, Point p) {\\n VP ps;\\n double sin = ar / abs(p-a);\\n if (!LE(sin, 1)) return ps; // ここでNaNも弾かれる\\n double t = PI/2.0 - asin(min(sin, 1.0));\\n ps.push_back( a + (p-a)*polar(sin, t));\\n if (!EQ(sin, 1)) ps.push_back(a + (p-a)*polar(sin, -t));\\n return ps;\\n}\\n\\n// 2円の共通接線。返される各直線に含まれる頂点は円との接点となる\\nvector<Line> tangentLines(Point a, double ar, Point b, double br) {\\n vector<Line> ls;\\n double d = abs(b-a);\\n rep (i,2) {\\n double sin = (ar - (1-i*2)*br) / d;\\n if (!LE(sin*sin, 1)) break;\\n double cos = sqrt(max(1 - sin*sin, 0.0));\\n rep (j,2) {\\n Point n = (b-a) * Point(sin, (1-j*2)*cos) / d;\\n ls.push_back(Line(a + ar*n, b + (1-i*2)*br*n));\\n if (cos < EPS) break; // 重複する接線を無視（重複していいならこの行不要）\\n }\\n }\\n return ls;\\n}\\n\\n// 三角形の外心。点a,b,cは同一線上にあってはならない\\nPoint circumcenter(Point a, Point b, Point c) {\\n a = (a-c)*0.5;\\n b = (b-c)*0.5;\\n return c + crosspointLL(a, a*Point(1,1), b, b*Point(1,1));\\n}\\n\\n// 点aと点bを通り、半径がrの円の中心を返す\\nVP circlesPointsRadius(Point a, Point b, double r) {\\n VP cs;\\n Point abH = (b-a)*0.5;\\n double d = abs(abH);\\n if (d == 0 || d > r) return cs; // 必要なら !LE(d,r) として円1つになる側へ丸める\\n double dN = sqrt(r*r - d*d); // 必要なら max(r*r - d*d, 0) とする\\n Point n = abH * Point(0,1) * (dN / d);\\n cs.push_back(a + abH + n);\\n if (dN > 0) cs.push_back(a + abH - n);\\n return cs;\\n}\\n\\n// 点aと点bを通り、直線lに接する円の中心\\nVP circlesPointsTangent(Point a, Point b, Point l1, Point l2) {\\n Point n = (l2-l1) * Point(0,1);\\n Point m = (b-a) * Point(0,0.5);\\n double rC = dot((a+b)*0.5-l1, n);\\n double qa = norm(n)*norm(m) - dot(n,m)*dot(n,m);\\n double qb = -rC * dot(n,m);\\n double qc = norm(n)*norm(m) - rC*rC;\\n double qd = qb*qb - qa*qc; // qa*k^2 + 2*qb*k + qc = 0\\n\\n VP cs;\\n if (qd < -EPS) return cs;\\n if (EQ(qa, 0)) {\\n if (!EQ(qb, 0)) cs.push_back((a+b)*0.5 - m * (qc/qb/2));\\n return cs;\\n }\\n double t = -qb/qa;\\n cs.push_back( (a+b)*0.5 + m * (t + sqrt(max(qd, 0.0))/qa));\\n if (qd > EPS) cs.push_back((a+b)*0.5 + m * (t - sqrt(max(qd, 0.0))/qa));\\n return cs;\\n}\\n\\n// 点集合を含む最小の円の中心\\nPoint minEnclosingCircle(const VP& ps) {\\n Point c;\\n double move = 0.5;\\n rep(i,39) { // 2^(-39-1) \\\\approx 0.9e-12\\n rep(t,50) {\\n double max = 0;\\n int k = 0;\\n rep (j, ps.size()) if (max < norm(ps[j]-c)) {\\n max = norm(ps[j]-c);\\n k = j;\\n }\\n c += (ps[k]-c) * move;\\n }\\n move /= 2;\\n }\\n return c;\\n}\\n\\n\\n/* 多角形 */\\n\\n// 頂点の順序（sortやmax_elementに必要）\\nnamespace std {\\n bool operator<(const Point a, const Point b) {\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n}\\n\\n//多角形PSのi番目の辺\\n#define ps_edge(PS,i) PS[i],PS[(i+1)%PS.size()]\\n\\n// 凸包\\n// 入力1個 -> 空\\n// 2個以上の全て同じ点 -> 同じもの2つ\\nVP convexHull(VP ps) { // 元の点集合がソートされていいならVP&に\\n int n = ps.size(), k = 0;\\n sort(ps.begin(), ps.end());\\n VP ch(2*n);\\n for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull\\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k; // 余計な点も含むなら == -1 とする\\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull\\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;\\n ch.resize(k-1);\\n return ch;\\n}\\n\\n// 凸判定。縮退を認めないならccwの判定部分を != 1 とする\\n// 反時計か分からなければreverse(ps)も試す（コピー渡し）\\nbool isCcwConvex(const VP& ps) {\\n int n = ps.size();\\n rep(i,n) if (ccw(ps[i], ps[(i+1) % n], ps[(i+2) % n]) == -1) return false;\\n return true;\\n}\\n\\n// 凸多角形の内部判定 O(n)\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inConvex(Point p, const VP& ps) {\\n int n = ps.size();\\n int dir = ccw(ps[0], ps[1], p);\\n rep (i, n) {\\n int ccwc = ccw(ps[i], ps[(i + 1) % n], p);\\n if (!ccwc) return 2; // 線分上に存在\\n if (ccwc != dir) return 0;\\n }\\n return 1;\\n}\\n\\n// 凸多角形の内部判定 O(logn)\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inCcwConvex(const VP& ps, Point p) {\\n int n = ps.size();\\n Point g = (ps[0] + ps[n / 3] + ps[n*2 / 3]) / 3.0;\\n if (g == p) return 1;\\n Point gp = p - g;\\n\\n int l = 0, r = n;\\n while (l + 1 < r) {\\n int mid = (l + r) / 2;\\n Point gl = ps[l] - g;\\n Point gm = ps[mid] - g;\\n if (cross(gl, gm) > 0) {\\n if (cross(gl, gp) >= 0 && cross(gm, gp) <= 0) r = mid;\\n else l = mid;\\n }\\n else {\\n if (cross(gl, gp) <= 0 && cross(gm, gp) >= 0) l = mid;\\n else r = mid;\\n }\\n }\\n r %= n;\\n double cr = cross(ps[l] - p, ps[r] - p);\\n return EQ(cr, 0) ? 2 : cr < 0 ? 0 : 1;\\n}\\n\\n// 多角形の内部判定\\n// 点が領域内部なら1、境界上なら2、外部なら0を返す\\nint inPolygon(const VP& ps, Point p) {\\n int n = ps.size();\\n bool in = false;\\n rep (i, n) {\\n Point a = ps[i] - p;\\n Point b = ps[(i + 1) % n] - p;\\n if (EQ(cross(a,b), 0) && LE(dot(a,b), 0)) return 2;\\n if (a.Y > b.Y) swap(a,b);\\n if ((a.Y*b.Y < 0 || (a.Y*b.Y < EPS && b.Y > EPS)) && LE(cross(a, b), 0)) in = !in;\\n }\\n return in;\\n}\\n\\n\\nbool inPolygon(Point p,VP& ps){\\n int n = ps.size();\\n double sumAngle=0;\\n rep(i,n){\\n double t = arg(ps[(i+1)%n]-p)-arg(ps[i]-p);\\n while(t > +PI) t -= 2*PI;\\n while(t < -PI) t += 2*PI;\\n sumAngle += t;\\n }\\n return (abs(sumAngle) > 0.1);\\n}\\n\\nbool inCircle(Point p, Point c, double r){\\n return abs(p-c) <= r;\\n}\\n\\nint n,m;\\n// ps: n個の頂点\\n// cs: m個の中心\\n\\nbool check(double r, VP &ps, VP &cs){\\n // 全頂点が1つ以上の円に含まれている\\n rep(i,n){\\n bool ok = false;\\n rep(j,m){\\n if(inCircle(ps[i], cs[j], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n\\n // 2つの中心の垂直二等分線\\n rep(i,m)rep(j,i){\\n Point mid = (cs[i]+cs[j])/2.0;\\n double d = abs(cs[i]-mid) + 1000.0;\\n VP cpcc = crosspointCC(cs[i],d, cs[j],d);\\n assert((int)cpcc.size() == 2);\\n rep(k,n){\\n if(isecLS(cpcc[0],cpcc[1], ps[k],ps[(k+1)%n])){\\n Point crossPoint = crosspointLL(cpcc[0],cpcc[1], ps[k],ps[(k+1)%n]);\\n bool ok = false;\\n rep(q,m){\\n if(inCircle(crossPoint, cs[q], r)) ok = true;\\n }\\n if(!ok) return false;\\n }\\n }\\n }\\n\\n // 2つの円の交点が凸内なら、他の円の中に入っていたい\\n rep(i,m)rep(j,i){\\n VP cpcc = crosspointCC(cs[i],r, cs[j],r);\\n for(auto p : cpcc)if(inPolygon(ps, p)){\\n bool ok = false;\\n rep(k,m)if(k!=i && k!=j){\\n if(inCircle(p, cs[k], r)){\\n ok = true;\\n }\\n }\\n if(!ok) return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint main(void){\\n cin>>n;\\n VP ps(n);\\n rep(i,n){\\n double x,y;\\n cin>>x>>y;\\n ps[i] = Point(x,y);\\n }\\n ps = convexHull(ps);\\n cin>>m;\\n VP cs(m);\\n rep(i,m){\\n double x,y;\\n cin>>x>>y;\\n cs[i] = Point(x,y);\\n }\\n double l = 0, r = 1000000;\\n rep(loop,100){\\n double radius = (l+r)/2;\\n if(check(radius, ps, cs)){\\n r = radius;\\n }else{\\n l = radius;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", r);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.7695,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3049_3145342\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long double ldouble;\\n\\ntypedef complex<ldouble> P;\\ntypedef complex<ldouble> V;\\ntypedef vector<P> vecP;\\ntypedef pair<P,P> L;\\ntypedef pair<P,P> S;\\ntypedef pair<P,ldouble> C;\\nconst ldouble eps=1e-11;\\nconst ldouble PI=acos(-1);\\nconst ldouble PI2=PI*2.0;\\n \\nnamespace std{\\n bool operator < (const P &a,const P &b){\\n return (a.real()!=b.real()?\\n a.real() <b.real():\\n a.imag() <b.imag());\\n }\\n};\\n \\nV normal(V a){\\n assert( abs(a)>0 );\\n return a/abs(a);\\n}\\n \\nldouble Sqrt( ldouble x ){\\n if(x<0)return 0;\\n else return sqrt(x);\\n}\\n \\nP Vector(L a){\\n return a.second-a.first;\\n}\\n \\nbool eq(ldouble a,ldouble b){\\n return (-eps<a-b&&a-b<eps);\\n}\\n \\nbool eq(P a,P b){\\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\\n}\\n \\nldouble dot(P a,P b){\\n return real(b*conj(a));\\n}\\n \\nldouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n \\nldouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n \\nldouble getTime(V a,V b){\\n assert( eq(cross(a,b),0) );\\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\\n}\\n \\n \\nP project(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*real(c/b);\\n}\\n \\nP reflect(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*conj(c/b);\\n}\\n \\nint ccw(P a,P b,P c){\\n P ab=b-a,ac=c-a;\\n P k=ac*conj(ab);\\n if(k.imag()> eps )return 1;\\n if(k.imag()< -eps )return -1;\\n if(k.real()< -eps )return 2;\\n if(abs(ab) + eps <abs(ac))return -2;\\n return 0;\\n}\\n \\nbool isParallel(P a,P b){\\n return eq(0, cross(a,b));\\n}\\n \\nbool isParallel(S a,S b){\\n return eq(0, cross( Vector(a) , Vector(b) ) );\\n}\\n \\nbool onLP(L l,P p){\\n P a=l.first, b=l.second;\\n return eq(0, cross(b-a,p-a));\\n}\\n \\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\\n}\\n \\nbool isCrossSS(S s0,S s1){\\n P a=s0.first, b=s0.second;\\n P c=s1.first, d=s1.second;\\n int f0 = ccw(a,b,c) * ccw(a,b,d);\\n int f1 = ccw(c,d,a) * ccw(c,d,b);\\n return (f0<=0 && f1<=0);\\n}\\n \\nbool isCrossLS(L l,S s){\\n P a=l.first, b=l.second;\\n P c=s.first, d=s.second;\\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\\n}\\n \\nldouble distLP(L l,P p){\\n P a=l.first, b=l.second;\\n ldouble res = cross(b-a,p-a) / abs(b-a);\\n return abs(res);\\n}\\n \\nldouble distSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return distLP(s,p);\\n}\\n \\nldouble distSS(S s0,S s1){\\n if( isCrossSS(s0,s1) )return 0;\\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\\n return min(res0,res1);\\n}\\n \\nP getCrossLL(L l0,L l1){\\n P a=l0.first, b=l0.second;\\n P c=l1.first, d=l1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n \\n \\n \\nint inPolygon(const vecP &t,P p){\\n int n=t.size();\\n ldouble sum=0;\\n for(int i=0;i<n;i++){\\n P a=t[i],b=t[(i+1==n?0:i+1)];\\n if( ccw(a,b,p)==0 )return 1;\\n sum+= getArg(a-p,b-p);\\n }\\n if( abs(sum) < eps )return 0;\\n else return 2;\\n}\\n \\nvecP andrewScan(vecP &t){\\n int N=t.size(),C=0;\\n vecP R(N);\\n for(int i=0;i<N;i++){\\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\\n R[C++]=t[i];\\n }\\n vecP res(C);\\n for(int i=0;i<C;i++)res[i]=R[i];\\n return res;\\n}\\n \\nvecP convexHull(vecP &t){\\n sort(t.begin(),t.end());\\n vecP u=andrewScan(t);\\n reverse(t.begin(),t.end());\\n vecP l=andrewScan(t);\\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\\n return u;\\n}\\n \\nvecP cutConvex(vecP &t,L l){\\n P a=l.first, b=l.second;\\n int N=t.size();\\n vecP res;\\n for(int i=0;i<N;i++){\\n P c=t[i],d=t[(i+1)%N];\\n int C=ccw(a,b,c),D=ccw(a,b,d);\\n if(C!=-1)res.push_back(c);\\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\\n }\\n return res;\\n}\\n \\nP getVector(const vecP &t, int id){\\n int n=t.size();\\n return t[ (id+1)%n ] - t[id%n];\\n}\\n \\nldouble convex_diameter(vecP &t) {\\n int n = t.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(t[i]) > imag(t[is])) is = i;\\n if (imag(t[i]) < imag(t[js])) js = i;\\n }\\n ldouble maxd = norm(t[is]-t[js]);\\n \\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n \\n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\\n \\n else i = (i+1) % n;\\n if (norm(t[i]-t[j]) > maxd) {\\n maxd = norm(t[i]-t[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}\\n \\nbool compare_y(const P &a,const P &b){\\n return a.imag() < b.imag();\\n}\\n \\nldouble closest_pair(P *a, int n){\\n if(n <= 1) return 1e30;\\n int m = n / 2;\\n ldouble x = a[m].real();\\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\\n inplace_merge(a, a + m, a + n, compare_y);\\n vector<P> b;\\n for(int i=0;i<n;i++){\\n if( abs(a[i].real() - x) >= d) continue;\\n for(int j=0;j<(int)b.size();j++){\\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\\n if(dy >= d) break;\\n d = min(d, sqrt(dx * dx + dy * dy));\\n }\\n b.push_back(a[i]);\\n }\\n return d;\\n}\\n \\nP _pool[200005];\\nldouble minDist(vecP &t){\\n int n=t.size();\\n for(int i=0;i<n;i++)_pool[i]=t[i];\\n sort( _pool, _pool+n);\\n return closest_pair(_pool, n);\\n}\\n \\nint getStateCC(C a,C b){\\n ldouble ar=a.second, br=b.second;\\n ldouble dist=abs(a.first-b.first);\\n if(dist>ar+br+eps)return 4;\\n if(dist>ar+br-eps)return 3;\\n if(dist>abs(ar-br)+eps)return 2;\\n if(dist>abs(ar-br)-eps)return 1;\\n return 0;\\n}\\n \\nP getCrossCC(C a,C b){\\n P p1=a.first, p2=b.first;\\n ldouble r1=a.second, r2=b.second;\\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\\n}\\n \\nP getTangentCP_(C a,P p,int flg){\\n P base=a.first-p;\\n ldouble ar=a.second;\\n ldouble w=Sqrt(norm(base)-ar*ar);\\n P s=p+base*P(w,ar * flg)/norm(base)*w;\\n return s;\\n}\\n \\nvector<S> getTangentCP(C a,P p){\\n vector<S> res;\\n P s=getTangentCP_(a,p,1);\\n P t=getTangentCP_(a,p,-1);\\n \\n if( eq(s,t) ){\\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \\n }else{\\n res.push_back( S(p,s) );\\n res.push_back( S(p,t) );\\n }\\n return res;\\n}\\n \\nS getInTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble w=ar+br;\\n ldouble h=Sqrt(norm(base)-w*w);\\n P k=base*P(w,h*flg)/norm(base);\\n return S(ap+k*ar,bp-k*br);\\n}\\n \\nS getOutTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble h=br-ar;\\n \\n ldouble w=Sqrt(norm(base)-h*h);\\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\\n return S(ap+k*ar,bp+k*br);\\n}\\n \\nvector<S> getTangentCC(C a,C b){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n vector<S> res;\\n ldouble dist=abs(ap-bp);\\n \\n if(dist>ar+br+eps)\\n res.push_back(getInTangent(a,b,1));\\n \\n if(dist>ar+br-eps)\\n res.push_back(getInTangent(a,b,-1));\\n \\n if(dist>abs(ar-br)+eps)\\n res.push_back(getOutTangent(a,b,1));\\n \\n if(dist>abs(ar-br)-eps)\\n res.push_back(getOutTangent(a,b,-1));\\n \\n return res;\\n}\\n\\n\\nldouble ex_L, ex_R;\\nvecP getCrossCL(C cir,L l){\\n P a=l.first, b=l.second;\\n ldouble cr=cir.second;\\n P cp=cir.first;\\n \\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n \\n ldouble length=abs(base), h=abs(cp-target);\\n base/=length;\\n \\n if(cr+eps<h)return res;\\n ldouble w=Sqrt(cr*cr-h*h);\\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\\n\\n ex_L = L;\\n ex_R = R;\\n res.push_back(a+base*L);\\n if( eq(L,R) )return res;\\n res.push_back(a+base*R);\\n \\n return res;\\n}\\n \\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n if( ccw(s.first,s.second, tmp[i] ) == 0)\\n res.push_back(tmp[i]);\\n return res;\\n}\\n \\nldouble getArea(C c,P a,P b){\\n P cp=c.first;\\n ldouble cr=c.second;\\n \\n P va=cp-a, vb=cp-b;\\n ldouble A=abs(va), B=abs(vb);\\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\\n \\n if( eq(0, f ) )return 0;\\n if(A<cr+eps&&B<cr+eps)return f*0.5;\\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\\n \\n vecP u=getCrossCS(c, S(a,b) );\\n \\n assert( !u.empty() );\\n u.insert(u.begin(), a), u.push_back(b);\\n \\n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\\n return res;\\n}\\n \\nldouble getCrossArea(vecP t,C c){\\n int n=t.size();\\n if(n<3)return 0;\\n ldouble res=0;\\n for(int i=0;i<n;i++){\\n P a=t[i], b=t[(i+1)%n];\\n res+=getArea(c,a,b);\\n }\\n return res;\\n}\\n \\n \\nldouble calcPolygonArea(const vecP &t){\\n ldouble res=0;\\n int n=t.size();\\n for(int i=0;i<n;i++){\\n res+= cross( t[ (i+1)%n ],t[i] );\\n }\\n return abs(res)*0.5;\\n}\\n\\nbool check(const vector<P> &t,const vector<P> &u, ldouble r){\\n vector<P> targets;\\n for(int i=0;i<(int)t.size();i++){\\n P a=t[i], b=t[ (i+1)%t.size() ];\\n S seg=S(a,b);\\n targets.push_back(a);\\n for(int j=0;j<(int)u.size();j++){\\n vector<P> tmp = getCrossCS( C(u[j],r) , seg );\\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\\n }\\n }\\n for(int i=0;i<(int)u.size();i++){\\n for(int j=0;j<i;j++){\\n targets.push_back( getCrossCC( C(u[i],r) , C(u[j],r) ) );\\n targets.push_back( getCrossCC( C(u[j],r) , C(u[i],r) ) );\\n }\\n }\\n sort(targets.begin(), targets.end());\\n targets.erase( unique( targets.begin(), targets.end() ), targets.end() );\\n\\n for(int i=0;i<(int)targets.size();i++){\\n if( inPolygon( t , targets[i] ) == 0 )continue;\\n ldouble mini=1e9;\\n for(int j=0;j<(int)u.size();j++){\\n mini=min(mini, abs( targets[i] - u[j] ) );\\n }\\n if( mini > r - eps )return false;\\n }\\n return true;\\n}\\n\\nldouble solve(const vector<P> &t,const vector<P> &u){\\n ldouble left=0, right=1e6, mid;\\n for(int i=0;i<50;i++){\\n mid=(left+right)*0.5;\\n if( check(t,u,mid) )right=mid;\\n else left=mid;\\n }\\n return left;\\n}\\n\\nint main(){\\n\\n int n;\\n scanf(\\\"%d\\\",&n);\\n\\n vector< P > t(n);\\n for(int i=0;i<n;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n t[i]=P(x,y);\\n }\\n \\n int m;\\n scanf(\\\"%d\\\",&m);\\n vector< P > u(m);\\n \\n for(int i=0;i<m;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n u[i]=P(x,y);\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", (double)solve(t,u) );\\n return 0;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1730,\n \"memory_kb\": 9980,\n \"score_of_the_acc\": -2,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3049_3145340\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 100010\\n\\ntypedef double P_type;\\ntypedef complex<P_type> P;\\nconst P_type P_eps = 1e-9; //整数の時はゼロ\\n\\nnamespace std{\\n template<class T> bool operator<(const complex<T> &a, const complex<T> &b){\\n return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();\\n }\\n};\\n\\nP rotate(P p, double theta){\\n return p * P(cos(theta), sin(theta));\\n}\\n\\n//内積\\nP_type dot(P a, P b) {\\n return (a * conj(b)).real();\\n}\\n\\n//外積\\nP_type cross(P a, P b) {\\n return (conj(a) * b).imag();\\n}\\n\\n//反時計回り\\nint ccw(P a, P b, P c){\\n if(cross(b-a,c-a) > P_eps) return 1; //COUNTER_CLOCKWISE\\n if(cross(b-a,c-a) < -P_eps) return -1; //CLOCKWISE\\n if(dot(b-a,c-a) < -P_eps) return -2; //c -> a -> b\\n if(dot(a-b,c-b) < -P_eps) return 2; //a -> b -> c\\n return 0; //a -> c -> b\\n}\\n\\n/* 線分abと点cの距離 */\\nP_type distanceSP(P a, P b, P c) {\\n if ( dot(b-a, c-a) < P_eps ) return abs(c-a);\\n if ( dot(a-b, c-b) < P_eps ) return abs(c-b);\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 直線abと点cの距離 */\\nP_type distanceLP(P a, P b, P c) {\\n return abs(cross(b-a, c-a)) / abs(b-a);\\n}\\n\\n/* 円の点包含判定 */\\nbool isContainedCP(P c, double r, P p){\\n return abs(c-p) < r - P_eps; //円周上を含まない\\n //return abs(c-p) < r + P_eps; //円周上を含む\\n}\\n\\n/* 直線交差判定 */\\nbool isIntersectedLL(P a1, P a2, P b1, P b2){\\n return abs(cross(a1-a2, b1-b2)) > P_eps;\\n}\\n\\n/* 線分交差判定 */\\nbool isIntersectedSS(P a1, P a2, P b1, P b2){\\n \\n //線分a と 直線b\\n int a = ccw(b1,b2,a1);\\n int b = ccw(b1,b2,a2);\\n \\n //線分b と 直線a\\n int c = ccw(a1,a2,b1);\\n int d = ccw(a1,a2,b2);\\n \\n return a*b < P_eps && c*d < P_eps; // T字を除く時は -P_eps\\n}\\n\\n/* 直線線分交差判定 */\\nbool isIntersectedLS(P a1, P a2, P b1, P b2){ \\n int a = ccw(a1,a2,b1);\\n int b = ccw(a1,a2,b2);\\n \\n // 直線上のとき a or b = 0 or -2 or 2\\n return (a%2)*(b%2) <= 0; // T字を除く時は (** < 0)\\n}\\n\\n/* 円交差判定 */\\nbool isIntersectedCC(P c1, double r1, P c2, double r2){\\n double dist = abs(c1 - c2);\\n \\n return abs(r1 - r2) < dist + P_eps && dist - P_eps < r1 + r2; //外接内接を含む\\n //return abs(r1 - r2) < dist - P_eps && dist + P_eps < r1 + r2; //外接内接を除く\\n}\\n\\n/* 円直線交差判定 */\\nbool isIntersectedCL(P c, double r, P a1, P a2){\\n return distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 円線分交差判定 */\\nbool isIntersectedCS(P c, double r, P a1, P a2){\\n return isContainedCP(c,r,a1) &&\\n isContainedCP(c,r,a2) &&\\n distanceLP(a1, a2, c) < r + P_eps; //接する場合を含まない場合 - P_eps\\n}\\n\\n/* 直線/線分交点 */\\nP getCrosspointLL(P a1, P a2, P b1, P b2) {\\n //assert(isIntersectedLL(a1, a2, b1, b2));\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nP getCrosspointSS(P a1, P a2, P b1, P b2){\\n //assert(isIntersectedSS(a1, a2, b1, b2));\\n return getCrosspointLL(a1, a2, b1, b2);\\n}\\n\\n/* 円交点 */\\npair<P,P> getCrosspointCC(P c1, P_type r1, P c2, P_type r2){\\n //assert(isIntersectedCC(c1, r1, c2, r2));\\n \\n double dist = abs(c1 - c2);\\n double a = acos((r1*r1 + dist*dist - r2*r2) / (2 * r1 * dist));\\n return {c1 + polar(r1, arg(c2 - c1) + a), c1 + polar(r1, arg(c2 - c1) - a)};\\n}\\n\\n/* 円線分交点 */\\npair<P,P> getCrosspointCS(P c, double r, P a1, P a2){\\n //assert(isIntersectedCS(c1, r1, c2, r2));\\n \\n P base1 = a2 - a1;\\n P proj = a1 + base1 * dot(c - a1, base1) / norm(base1); //射影\\n P e = (a2 - a1) / abs(a2 - a1);\\n P base2 = sqrt(r*r - norm(proj - c));\\n return {proj + e*base2, proj - e*base2};\\n}\\n\\n/* 多角形-点包含 */\\nbool iscontainedPolyP(vector<P> &g, P p){\\n int n = g.size();\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < P_eps && dot(a,b) < P_eps) return true; //辺上\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < P_eps && P_eps < b.imag() && cross(a,b) > P_eps) f = !f;\\n }\\n return f; //内部 or 外部\\n}\\n\\n/* 射影(直線abとpからの垂線との交点) */\\nP getProject(P a, P b, P p){\\n P base = b - a;\\n return a + base * dot(p - a, base) / norm(base);\\n}\\n\\n/* 反射(直線abを対称軸としたpの線対称の位置) */\\nP getReflection(P a, P b, P p){\\n return p + (getProject(a, b, p) - p) * (P_type)2.0;\\n}\\n\\n\\nint main(){\\n int n, m, x, y;\\n P pxy[101], cxy[101];\\n vector<P> pol;\\n\\n scanf(\\\"%d\\\", &n);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n pxy[i] = P(x, y);\\n pol.push_back(pxy[i]);\\n }\\n pxy[n] = pxy[0];\\n \\n\\n scanf(\\\"%d\\\", &m);\\n \\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\", &x, &y);\\n cxy[i] = P(x, y);\\n\\n }\\n\\n P_type l = 0, r = 1e6;\\n\\n while(abs(l-r) > 1e-6){\\n P_type R = (l+r)/2;\\n vector<P> vec; \\n \\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n if(!isIntersectedCC(cxy[i], R, cxy[j], R)) continue;\\n auto gc = getCrosspointCC(cxy[i], R, cxy[j], R);\\n\\n auto e = (gc.first - gc.second) / abs(gc.first - gc.second) * (P_type)1e-7;\\n\\n vec.push_back(gc.first + e * (P_type)1);\\n vec.push_back(gc.first + e * (P_type)-1);\\n vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n auto gc = getCrosspointCS(cxy[i], R, pxy[j], pxy[j+1]);\\n\\n auto e = (pxy[j] - pxy[j+1]) / abs(pxy[j] - pxy[j+1]) * (P_type)1e-7;\\n\\n vec.push_back(gc.first + e * (P_type)1);\\n vec.push_back(gc.first + e * (P_type)-1);\\n vec.push_back(gc.second + e * (P_type)1);\\n vec.push_back(gc.second + e * (P_type)-1);\\n }\\n }\\n\\n bool res = true;\\n \\n for(int i=0;i<vec.size() && res;i++){\\n if(iscontainedPolyP(pol, vec[i])){\\n\\n bool f = false;\\n for(int j=0;j<m && !f;j++){\\n f |= isContainedCP(cxy[j], R, vec[i]);\\n }\\n\\n res &= f;\\n }\\n }\\n\\n if(res){\\n r = R;\\n }else{\\n l = R;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\", (double)l);\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 0.38095238095238093,\n \"time_ms\": 30,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -0.0845,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3049_3145335\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntypedef double Real;\\ntypedef complex<Real> P;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n#define eps 1e-8\\n\\nint n,m;\\nP cvx[125];\\nP pts[125];\\n\\nReal cross(P a, P b){\\n return imag(conj(a)*b);\\n}\\nReal dot(P a, P b){\\n return real(conj(a)*b);\\n}\\n\\nbool inner(P p){\\n P g = (cvx[0] + cvx[n/3] + cvx[2*n/3]) / 3.0;\\n // g += P(1e-7, 1e-7);\\n int a = 0, b = n;\\n while(a+1<b){\\n int c = (a+b)/2;\\n if(cross(cvx[a]-g, cvx[c]-g)>0){\\n if(cross(cvx[a]-g, p-g)>0 && cross(cvx[c]-g, p-g)<0) b=c;\\n else a=c;\\n }else{\\n if(cross(cvx[a]-g, p-g)<0 && cross(cvx[c]-g, p-g)>0) a=c;\\n else b=c;\\n }\\n }\\n b %= n;\\n if(cross(cvx[a]-p, cvx[b]-p)<-eps) return false;\\n return true;\\n}\\n\\nbool inner2(P p){\\n bool in = false;\\n REP(i,n){\\n P a = cvx[i]-p;\\n P b = cvx[(i+1)%n]-p;\\n if(imag(a)>imag(b))swap(a,b);\\n if(imag(a)<=0 && 0<imag(b)){\\n if(cross(a,b)<0)in = !in;\\n }\\n if(abs(cross(a,b))<eps && dot(a,b)<=0)return true;\\n }\\n return in;\\n}\\n\\nint main(){\\n scanf(\\\"%d\\\",&n);\\n REP(i,n){\\n Real x,y;\\n scanf(\\\"%lf%lf\\\",&x,&y);\\n cvx[i] = P(x,y);\\n }\\n scanf(\\\"%d\\\",&m);\\n REP(i,m){\\n Real x,y;\\n scanf(\\\"%lf%lf\\\",&x,&y);\\n pts[i] = P(x,y);\\n }\\n vector<P> po;\\n const Real PI = 4.0*atan(1.0);\\n\\n REP(i,n)po.push_back(cvx[i]);\\n\\n REP(i,m)REP(j,i){\\n P a = pts[i], b = pts[j];\\n P s1 = (a+b)/2.0;\\n P d1 = (b-a)*exp(P(0,PI/2.0));\\n REP(ii,n){\\n P x = cvx[ii], y = cvx[(ii+1)%n];\\n P s2 = x;\\n P d2 = y-x;\\n if(cross(d1,s2-s1)*cross(d1,s2+d2-s1) >= eps)continue;\\n if(abs(cross(d2,d1))<eps)continue;\\n P o = s1 + d1*cross(d2, s2-s1)/cross(d2, d1);\\n // #define X real()\\n // #define Y imag()\\n // if(x.X <= y.X && (o.X < x.X-eps || o.X > y.X+eps))continue;\\n // if(x.X >= y.X && (o.X > x.X+eps || o.X < y.X-eps))continue;\\n // if(x.Y <= y.X && (o.Y < x.Y-eps || o.Y > y.Y+eps))continue;\\n // if(x.Y >= y.X && (o.Y > x.Y+eps || o.Y < y.Y-eps))continue;\\n po.push_back(o);\\n }\\n }\\n\\n REP(i,m)REP(j,i)REP(k,j){\\n P a = pts[i], b = pts[j], c = pts[k];\\n if(abs(cross(b-a,c-a))<eps)continue;\\n P ab = (a+b)/2.0;\\n P ac = (a+c)/2.0;\\n P abd = (b-a)*exp(P(0,PI/2.0));\\n P acd = (c-a)*exp(P(0,PI/2.0));\\n P o = ab + abd * cross(acd, ac-ab) / cross(acd, abd);\\n if(inner2(o))po.push_back(o);\\n }\\n\\n Real ans = 0.0;\\n REP(i,po.size()){\\n P o = po[i];\\n Real tmp = 1e18;\\n REP(ii,m){\\n CHMIN(tmp, abs(pts[ii]-o));\\n }\\n CHMAX(ans, tmp);\\n }\\n printf(\\\"%.9f\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 4992,\n \"score_of_the_acc\": -0.3253,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3049_3137016\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long double ldouble;\\n\\ntypedef complex<ldouble> P;\\ntypedef complex<ldouble> V;\\ntypedef vector<P> vecP;\\ntypedef pair<P,P> L;\\ntypedef pair<P,P> S;\\ntypedef pair<P,ldouble> C;\\nconst ldouble eps=1e-11;\\nconst ldouble PI=acos(-1);\\nconst ldouble PI2=PI*2.0;\\n \\nnamespace std{\\n bool operator < (const P &a,const P &b){\\n return (a.real()!=b.real()?\\n a.real() <b.real():\\n a.imag() <b.imag());\\n }\\n};\\n \\nV normal(V a){\\n assert( abs(a)>0 );\\n return a/abs(a);\\n}\\n \\nldouble Sqrt( ldouble x ){\\n if(x<0)return 0;\\n else return sqrt(x);\\n}\\n \\nP Vector(L a){\\n return a.second-a.first;\\n}\\n \\nbool eq(ldouble a,ldouble b){\\n return (-eps<a-b&&a-b<eps);\\n}\\n \\nbool eq(P a,P b){\\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\\n}\\n \\nldouble dot(P a,P b){\\n return real(b*conj(a));\\n}\\n \\nldouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n \\nldouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n \\nldouble getTime(V a,V b){\\n assert( eq(cross(a,b),0) );\\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\\n}\\n \\n \\nP project(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*real(c/b);\\n}\\n \\nP reflect(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*conj(c/b);\\n}\\n \\nint ccw(P a,P b,P c){\\n P ab=b-a,ac=c-a;\\n P k=ac*conj(ab);\\n if(k.imag()> eps )return 1;\\n if(k.imag()< -eps )return -1;\\n if(k.real()< -eps )return 2;\\n if(abs(ab) + eps <abs(ac))return -2;\\n return 0;\\n}\\n \\nbool isParallel(P a,P b){\\n return eq(0, cross(a,b));\\n}\\n \\nbool isParallel(S a,S b){\\n return eq(0, cross( Vector(a) , Vector(b) ) );\\n}\\n \\nbool onLP(L l,P p){\\n P a=l.first, b=l.second;\\n return eq(0, cross(b-a,p-a));\\n}\\n \\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\\n}\\n \\nbool isCrossSS(S s0,S s1){\\n P a=s0.first, b=s0.second;\\n P c=s1.first, d=s1.second;\\n int f0 = ccw(a,b,c) * ccw(a,b,d);\\n int f1 = ccw(c,d,a) * ccw(c,d,b);\\n return (f0<=0 && f1<=0);\\n}\\n \\nbool isCrossLS(L l,S s){\\n P a=l.first, b=l.second;\\n P c=s.first, d=s.second;\\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\\n}\\n \\nldouble distLP(L l,P p){\\n P a=l.first, b=l.second;\\n ldouble res = cross(b-a,p-a) / abs(b-a);\\n return abs(res);\\n}\\n \\nldouble distSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return distLP(s,p);\\n}\\n \\nldouble distSS(S s0,S s1){\\n if( isCrossSS(s0,s1) )return 0;\\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\\n return min(res0,res1);\\n}\\n \\nP getCrossLL(L l0,L l1){\\n P a=l0.first, b=l0.second;\\n P c=l1.first, d=l1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n \\n \\n \\nint inPolygon(vecP &t,P p){\\n int n=t.size();\\n ldouble sum=0;\\n for(int i=0;i<n;i++){\\n P a=t[i],b=t[(i+1==n?0:i+1)];\\n if( ccw(a,b,p)==0 )return 1;\\n sum+= getArg(a-p,b-p);\\n }\\n if( abs(sum) < eps )return 0;\\n else return 2;\\n}\\n \\nvecP andrewScan(vecP &t){\\n int N=t.size(),C=0;\\n vecP R(N);\\n for(int i=0;i<N;i++){\\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\\n R[C++]=t[i];\\n }\\n vecP res(C);\\n for(int i=0;i<C;i++)res[i]=R[i];\\n return res;\\n}\\n \\nvecP convexHull(vecP &t){\\n sort(t.begin(),t.end());\\n vecP u=andrewScan(t);\\n reverse(t.begin(),t.end());\\n vecP l=andrewScan(t);\\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\\n return u;\\n}\\n \\nvecP cutConvex(vecP &t,L l){\\n P a=l.first, b=l.second;\\n int N=t.size();\\n vecP res;\\n for(int i=0;i<N;i++){\\n P c=t[i],d=t[(i+1)%N];\\n int C=ccw(a,b,c),D=ccw(a,b,d);\\n if(C!=-1)res.push_back(c);\\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\\n }\\n return res;\\n}\\n \\nP getVector(const vecP &t, int id){\\n int n=t.size();\\n return t[ (id+1)%n ] - t[id%n];\\n}\\n \\nldouble convex_diameter(vecP &t) {\\n int n = t.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(t[i]) > imag(t[is])) is = i;\\n if (imag(t[i]) < imag(t[js])) js = i;\\n }\\n ldouble maxd = norm(t[is]-t[js]);\\n \\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n \\n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\\n \\n else i = (i+1) % n;\\n if (norm(t[i]-t[j]) > maxd) {\\n maxd = norm(t[i]-t[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}\\n \\nbool compare_y(const P &a,const P &b){\\n return a.imag() < b.imag();\\n}\\n \\nldouble closest_pair(P *a, int n){\\n if(n <= 1) return 1e30;\\n int m = n / 2;\\n ldouble x = a[m].real();\\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\\n inplace_merge(a, a + m, a + n, compare_y);\\n vector<P> b;\\n for(int i=0;i<n;i++){\\n if( abs(a[i].real() - x) >= d) continue;\\n for(int j=0;j<(int)b.size();j++){\\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\\n if(dy >= d) break;\\n d = min(d, sqrt(dx * dx + dy * dy));\\n }\\n b.push_back(a[i]);\\n }\\n return d;\\n}\\n \\nP _pool[200005];\\nldouble minDist(vecP &t){\\n int n=t.size();\\n for(int i=0;i<n;i++)_pool[i]=t[i];\\n sort( _pool, _pool+n);\\n return closest_pair(_pool, n);\\n}\\n \\nint getStateCC(C a,C b){\\n ldouble ar=a.second, br=b.second;\\n ldouble dist=abs(a.first-b.first);\\n if(dist>ar+br+eps)return 4;\\n if(dist>ar+br-eps)return 3;\\n if(dist>abs(ar-br)+eps)return 2;\\n if(dist>abs(ar-br)-eps)return 1;\\n return 0;\\n}\\n \\nP getCrossCC(C a,C b){\\n P p1=a.first, p2=b.first;\\n ldouble r1=a.second, r2=b.second;\\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\\n}\\n \\nP getTangentCP_(C a,P p,int flg){\\n P base=a.first-p;\\n ldouble ar=a.second;\\n ldouble w=Sqrt(norm(base)-ar*ar);\\n P s=p+base*P(w,ar * flg)/norm(base)*w;\\n return s;\\n}\\n \\nvector<S> getTangentCP(C a,P p){\\n vector<S> res;\\n P s=getTangentCP_(a,p,1);\\n P t=getTangentCP_(a,p,-1);\\n \\n if( eq(s,t) ){\\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \\n }else{\\n res.push_back( S(p,s) );\\n res.push_back( S(p,t) );\\n }\\n return res;\\n}\\n \\nS getInTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble w=ar+br;\\n ldouble h=Sqrt(norm(base)-w*w);\\n P k=base*P(w,h*flg)/norm(base);\\n return S(ap+k*ar,bp-k*br);\\n}\\n \\nS getOutTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble h=br-ar;\\n \\n ldouble w=Sqrt(norm(base)-h*h);\\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\\n return S(ap+k*ar,bp+k*br);\\n}\\n \\nvector<S> getTangentCC(C a,C b){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n vector<S> res;\\n ldouble dist=abs(ap-bp);\\n \\n if(dist>ar+br+eps)\\n res.push_back(getInTangent(a,b,1));\\n \\n if(dist>ar+br-eps)\\n res.push_back(getInTangent(a,b,-1));\\n \\n if(dist>abs(ar-br)+eps)\\n res.push_back(getOutTangent(a,b,1));\\n \\n if(dist>abs(ar-br)-eps)\\n res.push_back(getOutTangent(a,b,-1));\\n \\n return res;\\n}\\n\\n\\nldouble ex_L, ex_R;\\nvecP getCrossCL(C cir,L l){\\n P a=l.first, b=l.second;\\n ldouble cr=cir.second;\\n P cp=cir.first;\\n \\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n \\n ldouble length=abs(base), h=abs(cp-target);\\n base/=length;\\n \\n if(cr+eps<h)return res;\\n ldouble w=Sqrt(cr*cr-h*h);\\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\\n\\n ex_L = L;\\n ex_R = R;\\n res.push_back(a+base*L);\\n if( eq(L,R) )return res;\\n res.push_back(a+base*R);\\n \\n return res;\\n}\\n \\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n if( ccw(s.first,s.second, tmp[i] ) == 0)\\n res.push_back(tmp[i]);\\n return res;\\n}\\n \\nldouble getArea(C c,P a,P b){\\n P cp=c.first;\\n ldouble cr=c.second;\\n \\n P va=cp-a, vb=cp-b;\\n ldouble A=abs(va), B=abs(vb);\\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\\n \\n if( eq(0, f ) )return 0;\\n if(A<cr+eps&&B<cr+eps)return f*0.5;\\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\\n \\n vecP u=getCrossCS(c, S(a,b) );\\n \\n assert( !u.empty() );\\n u.insert(u.begin(), a), u.push_back(b);\\n \\n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\\n return res;\\n}\\n \\nldouble getCrossArea(vecP t,C c){\\n int n=t.size();\\n if(n<3)return 0;\\n ldouble res=0;\\n for(int i=0;i<n;i++){\\n P a=t[i], b=t[(i+1)%n];\\n res+=getArea(c,a,b);\\n }\\n return res;\\n}\\n \\n \\nldouble calcPolygonArea(const vecP &t){\\n ldouble res=0;\\n int n=t.size();\\n for(int i=0;i<n;i++){\\n res+= cross( t[ (i+1)%n ],t[i] );\\n }\\n return abs(res)*0.5;\\n}\\n\\n\\nbool check2(const vector<P> &u,ldouble r, S s){\\n typedef pair<ldouble,ldouble> Pair;\\n vector< Pair > t,nt;\\n \\n for(int i=0;i<(int)u.size();i++){\\n vector< P > tmp = getCrossCL( C(u[i] , r) , s );\\n t.push_back(Pair( ex_L, ex_R ));\\n }\\n sort( t.begin(), t.end() );\\n for(int i=0;i<(int)t.size();i++){\\n if(i+1<(int)t.size() && t[i].second > t[i+1].first-eps ){\\n t[i+1].first=min(t[i+1].first, t[i].first );\\n t[i+1].second=max(t[i+1].second, t[i].second );\\n }else{\\n nt.push_back(t[i]);\\n }\\n }\\n \\n for(int i=0;i< (int)nt.size();i++)\\n if(nt[i].first < eps && nt[i].second > abs(s.second-s.first)-eps )\\n return true;\\n \\n return false;\\n}\\n\\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\\n for(int i=0;i<(int)t.size();i++){\\n \\n if( check2(u,r,t[i]) ){\\n continue;\\n }else{\\n return false;\\n }\\n }\\n return true;\\n}\\n\\nldouble solve(const vector<S> &t,const vector<P> &u){\\n ldouble left=0, right=1e6, mid;\\n for(int i=0;i<50;i++){\\n mid=(left+right)*0.5;\\n if( check(t,u,mid) )right=mid;\\n else left=mid;\\n }\\n return left;\\n}\\n\\nint main(){\\n\\n int n;\\n scanf(\\\"%d\\\",&n);\\n\\n P cp=P(0,0);\\n vector< P > t(n), t2;\\n for(int i=0;i<n;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n t[i]=P(x,y);\\n cp+=t[i];\\n }\\n cp /= (ldouble)n;\\n \\n \\n // cout<< (double)cp.real() <<' '<< (double)cp.imag() <<endl;\\n vector< vector< P > > G(n);\\n for(int i=0;i<n;i++){\\n \\n P base=t[ (i+1)%n ] - t[i];\\n\\n int Cnt=70/n+5;\\n // Cnt * Cnt * n*n <= 900\\n // Cnt*n ^2 <= 30^2\\n // Cnt*n <= 30\\n // Cnt = 30/n\\n for(int j=1;j< Cnt ;j++)\\n G[i].push_back( t[i] + base*( (ldouble)j/ (ldouble)Cnt ) );\\n }\\n \\n int m;\\n scanf(\\\"%d\\\",&m);\\n vector< P > u(m);\\n for(int i=0;i<m;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n u[i]=P(x,y);\\n }\\n \\n vector< S > w;\\n for(int i=0;i<n;i++){\\n w.push_back( S(t[i], t[ (i+1)%n ] ) );\\n w.push_back( S(t[i], cp ) );\\n for(P a:G[i])\\n w.push_back( S(a, cp ) );\\n // cout<<w.size()<<endl;\\n for(int j=0;j<i;j++){\\n for(P a:G[i])\\n for(P b:G[j])\\n w.push_back( S(a,b) );\\n }\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", (double)solve(w,u) );\\n return 0;\\n \\n}\\n/*\\n\\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\\n vector<P> targets;\\n for(int i=0;i<(int)t.size();i++){\\n for(int j=0;j<(int)u.size();j++){\\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\\n targets.push_back(t[i].first);\\n targets.push_back(t[i].second);\\n }\\n }\\n sort( targets.begin(), targets.end() );\\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\\n for(int i=0;i<(int)targets.size();i++){\\n\\n ldouble mini=1e9;\\n for(int j=0;j<(int)u.size();j++){\\n ldouble dist=abs(targets[i]-u[j]);\\n mini=min(mini,dist);\\n }\\n if( mini > r - eps )return false;\\n }\\n return true;\\n}\\n\\n*/\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 1030,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.6199,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3049_3136860\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long double ldouble;\\n\\ntypedef complex<ldouble> P;\\ntypedef complex<ldouble> V;\\ntypedef vector<P> vecP;\\ntypedef pair<P,P> L;\\ntypedef pair<P,P> S;\\ntypedef pair<P,ldouble> C;\\nconst ldouble eps=1e-11;\\nconst ldouble PI=acos(-1);\\nconst ldouble PI2=PI*2.0;\\n \\nnamespace std{\\n bool operator < (const P &a,const P &b){\\n return (a.real()!=b.real()?\\n a.real() <b.real():\\n a.imag() <b.imag());\\n }\\n};\\n \\nV normal(V a){\\n assert( abs(a)>0 );\\n return a/abs(a);\\n}\\n \\nldouble Sqrt( ldouble x ){\\n if(x<0)return 0;\\n else return sqrt(x);\\n}\\n \\nP Vector(L a){\\n return a.second-a.first;\\n}\\n \\nbool eq(ldouble a,ldouble b){\\n return (-eps<a-b&&a-b<eps);\\n}\\n \\nbool eq(P a,P b){\\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\\n}\\n \\nldouble dot(P a,P b){\\n return real(b*conj(a));\\n}\\n \\nldouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n \\nldouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n \\nldouble getTime(V a,V b){\\n assert( eq(cross(a,b),0) );\\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\\n}\\n \\n \\nP project(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*real(c/b);\\n}\\n \\nP reflect(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*conj(c/b);\\n}\\n \\nint ccw(P a,P b,P c){\\n P ab=b-a,ac=c-a;\\n P k=ac*conj(ab);\\n if(k.imag()> eps )return 1;\\n if(k.imag()< -eps )return -1;\\n if(k.real()< -eps )return 2;\\n if(abs(ab) + eps <abs(ac))return -2;\\n return 0;\\n}\\n \\nbool isParallel(P a,P b){\\n return eq(0, cross(a,b));\\n}\\n \\nbool isParallel(S a,S b){\\n return eq(0, cross( Vector(a) , Vector(b) ) );\\n}\\n \\nbool onLP(L l,P p){\\n P a=l.first, b=l.second;\\n return eq(0, cross(b-a,p-a));\\n}\\n \\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\\n}\\n \\nbool isCrossSS(S s0,S s1){\\n P a=s0.first, b=s0.second;\\n P c=s1.first, d=s1.second;\\n int f0 = ccw(a,b,c) * ccw(a,b,d);\\n int f1 = ccw(c,d,a) * ccw(c,d,b);\\n return (f0<=0 && f1<=0);\\n}\\n \\nbool isCrossLS(L l,S s){\\n P a=l.first, b=l.second;\\n P c=s.first, d=s.second;\\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\\n}\\n \\nldouble distLP(L l,P p){\\n P a=l.first, b=l.second;\\n ldouble res = cross(b-a,p-a) / abs(b-a);\\n return abs(res);\\n}\\n \\nldouble distSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return distLP(s,p);\\n}\\n \\nldouble distSS(S s0,S s1){\\n if( isCrossSS(s0,s1) )return 0;\\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\\n return min(res0,res1);\\n}\\n \\nP getCrossLL(L l0,L l1){\\n P a=l0.first, b=l0.second;\\n P c=l1.first, d=l1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n \\n \\n \\nint inPolygon(vecP &t,P p){\\n int n=t.size();\\n ldouble sum=0;\\n for(int i=0;i<n;i++){\\n P a=t[i],b=t[(i+1==n?0:i+1)];\\n if( ccw(a,b,p)==0 )return 1;\\n sum+= getArg(a-p,b-p);\\n }\\n if( abs(sum) < eps )return 0;\\n else return 2;\\n}\\n \\nvecP andrewScan(vecP &t){\\n int N=t.size(),C=0;\\n vecP R(N);\\n for(int i=0;i<N;i++){\\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\\n R[C++]=t[i];\\n }\\n vecP res(C);\\n for(int i=0;i<C;i++)res[i]=R[i];\\n return res;\\n}\\n \\nvecP convexHull(vecP &t){\\n sort(t.begin(),t.end());\\n vecP u=andrewScan(t);\\n reverse(t.begin(),t.end());\\n vecP l=andrewScan(t);\\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\\n return u;\\n}\\n \\nvecP cutConvex(vecP &t,L l){\\n P a=l.first, b=l.second;\\n int N=t.size();\\n vecP res;\\n for(int i=0;i<N;i++){\\n P c=t[i],d=t[(i+1)%N];\\n int C=ccw(a,b,c),D=ccw(a,b,d);\\n if(C!=-1)res.push_back(c);\\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\\n }\\n return res;\\n}\\n \\nP getVector(const vecP &t, int id){\\n int n=t.size();\\n return t[ (id+1)%n ] - t[id%n];\\n}\\n \\nldouble convex_diameter(vecP &t) {\\n int n = t.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(t[i]) > imag(t[is])) is = i;\\n if (imag(t[i]) < imag(t[js])) js = i;\\n }\\n ldouble maxd = norm(t[is]-t[js]);\\n \\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n \\n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\\n \\n else i = (i+1) % n;\\n if (norm(t[i]-t[j]) > maxd) {\\n maxd = norm(t[i]-t[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}\\n \\nbool compare_y(const P &a,const P &b){\\n return a.imag() < b.imag();\\n}\\n \\nldouble closest_pair(P *a, int n){\\n if(n <= 1) return 1e30;\\n int m = n / 2;\\n ldouble x = a[m].real();\\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\\n inplace_merge(a, a + m, a + n, compare_y);\\n vector<P> b;\\n for(int i=0;i<n;i++){\\n if( abs(a[i].real() - x) >= d) continue;\\n for(int j=0;j<(int)b.size();j++){\\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\\n if(dy >= d) break;\\n d = min(d, sqrt(dx * dx + dy * dy));\\n }\\n b.push_back(a[i]);\\n }\\n return d;\\n}\\n \\nP _pool[200005];\\nldouble minDist(vecP &t){\\n int n=t.size();\\n for(int i=0;i<n;i++)_pool[i]=t[i];\\n sort( _pool, _pool+n);\\n return closest_pair(_pool, n);\\n}\\n \\nint getStateCC(C a,C b){\\n ldouble ar=a.second, br=b.second;\\n ldouble dist=abs(a.first-b.first);\\n if(dist>ar+br+eps)return 4;\\n if(dist>ar+br-eps)return 3;\\n if(dist>abs(ar-br)+eps)return 2;\\n if(dist>abs(ar-br)-eps)return 1;\\n return 0;\\n}\\n \\nP getCrossCC(C a,C b){\\n P p1=a.first, p2=b.first;\\n ldouble r1=a.second, r2=b.second;\\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\\n}\\n \\nP getTangentCP_(C a,P p,int flg){\\n P base=a.first-p;\\n ldouble ar=a.second;\\n ldouble w=Sqrt(norm(base)-ar*ar);\\n P s=p+base*P(w,ar * flg)/norm(base)*w;\\n return s;\\n}\\n \\nvector<S> getTangentCP(C a,P p){\\n vector<S> res;\\n P s=getTangentCP_(a,p,1);\\n P t=getTangentCP_(a,p,-1);\\n \\n if( eq(s,t) ){\\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \\n }else{\\n res.push_back( S(p,s) );\\n res.push_back( S(p,t) );\\n }\\n return res;\\n}\\n \\nS getInTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble w=ar+br;\\n ldouble h=Sqrt(norm(base)-w*w);\\n P k=base*P(w,h*flg)/norm(base);\\n return S(ap+k*ar,bp-k*br);\\n}\\n \\nS getOutTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble h=br-ar;\\n \\n ldouble w=Sqrt(norm(base)-h*h);\\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\\n return S(ap+k*ar,bp+k*br);\\n}\\n \\nvector<S> getTangentCC(C a,C b){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n vector<S> res;\\n ldouble dist=abs(ap-bp);\\n \\n if(dist>ar+br+eps)\\n res.push_back(getInTangent(a,b,1));\\n \\n if(dist>ar+br-eps)\\n res.push_back(getInTangent(a,b,-1));\\n \\n if(dist>abs(ar-br)+eps)\\n res.push_back(getOutTangent(a,b,1));\\n \\n if(dist>abs(ar-br)-eps)\\n res.push_back(getOutTangent(a,b,-1));\\n \\n return res;\\n}\\n \\n \\nvecP getCrossCL(C cir,L l){\\n P a=l.first, b=l.second;\\n ldouble cr=cir.second;\\n P cp=cir.first;\\n \\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n \\n ldouble length=abs(base), h=abs(cp-target);\\n base/=length;\\n \\n if(cr+eps<h)return res;\\n ldouble w=Sqrt(cr*cr-h*h);\\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\\n \\n res.push_back(a+base*L);\\n if( eq(L,R) )return res;\\n res.push_back(a+base*R);\\n \\n return res;\\n}\\n \\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n if( ccw(s.first,s.second, tmp[i] ) == 0)\\n res.push_back(tmp[i]);\\n \\n return res;\\n}\\n \\nldouble getArea(C c,P a,P b){\\n P cp=c.first;\\n ldouble cr=c.second;\\n \\n P va=cp-a, vb=cp-b;\\n ldouble A=abs(va), B=abs(vb);\\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\\n \\n if( eq(0, f ) )return 0;\\n if(A<cr+eps&&B<cr+eps)return f*0.5;\\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\\n \\n vecP u=getCrossCS(c, S(a,b) );\\n \\n assert( !u.empty() );\\n u.insert(u.begin(), a), u.push_back(b);\\n \\n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\\n return res;\\n}\\n \\nldouble getCrossArea(vecP t,C c){\\n int n=t.size();\\n if(n<3)return 0;\\n ldouble res=0;\\n for(int i=0;i<n;i++){\\n P a=t[i], b=t[(i+1)%n];\\n res+=getArea(c,a,b);\\n }\\n return res;\\n}\\n \\n \\nldouble calcPolygonArea(const vecP &t){\\n ldouble res=0;\\n int n=t.size();\\n for(int i=0;i<n;i++){\\n res+= cross( t[ (i+1)%n ],t[i] );\\n }\\n return abs(res)*0.5;\\n}\\n\\n\\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\\n vector<P> targets;\\n for(int i=0;i<(int)t.size();i++){\\n for(int j=0;j<(int)u.size();j++){\\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\\n targets.push_back(t[i].first);\\n targets.push_back(t[i].second);\\n }\\n }\\n sort( targets.begin(), targets.end() );\\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\\n for(int i=0;i<(int)targets.size();i++){\\n\\n ldouble mini=1e9;\\n for(int j=0;j<(int)u.size();j++){\\n ldouble dist=abs(targets[i]-u[j]);\\n mini=min(mini,dist);\\n }\\n if( mini > r - eps )return false;\\n }\\n return true;\\n}\\n\\nldouble solve(const vector<S> &t,const vector<P> &u){\\n ldouble left=0, right=1e6, mid;\\n for(int i=0;i<50;i++){\\n mid=(left+right)*0.5;\\n if( check(t,u,mid) )right=mid;\\n else left=mid;\\n }\\n return left;\\n}\\n\\nint main(){\\n \\n int n;\\n scanf(\\\"%d\\\",&n);\\n P cp=P(0,0);\\n vector< P > t(n);\\n for(int i=0;i<n;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n t[i]=P(x,y);\\n cp+=t[i];\\n }\\n \\n t.push_back( cp / (ldouble)n );\\n \\n \\n int m;\\n scanf(\\\"%d\\\",&m);\\n vector< P > u(m);\\n for(int i=0;i<m;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n u[i]=P(x,y);\\n }\\n\\n vector< S > w;\\n for(int i=0;i<n;i++){\\n for(int j=0;j<i;j++){\\n w.push_back( S(t[i],t[j]) );\\n }\\n }\\n \\n printf(\\\"%.10f\\\\n\\\", (double)solve(w,u) );\\n return 0;\\n \\n}\",\n \"accuracy\": 0.023809523809523808,\n \"time_ms\": 10,\n \"memory_kb\": 9536,\n \"score_of_the_acc\": -0.9337,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3049_3136858\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long double ldouble;\\n\\ntypedef complex<ldouble> P;\\ntypedef complex<ldouble> V;\\ntypedef vector<P> vecP;\\ntypedef pair<P,P> L;\\ntypedef pair<P,P> S;\\ntypedef pair<P,ldouble> C;\\nconst ldouble eps=1e-11;\\nconst ldouble PI=acos(-1);\\nconst ldouble PI2=PI*2.0;\\n \\nnamespace std{\\n bool operator < (const P &a,const P &b){\\n return (a.real()!=b.real()?\\n a.real() <b.real():\\n a.imag() <b.imag());\\n }\\n};\\n \\nV normal(V a){\\n assert( abs(a)>0 );\\n return a/abs(a);\\n}\\n \\nldouble Sqrt( ldouble x ){\\n if(x<0)return 0;\\n else return sqrt(x);\\n}\\n \\nP Vector(L a){\\n return a.second-a.first;\\n}\\n \\nbool eq(ldouble a,ldouble b){\\n return (-eps<a-b&&a-b<eps);\\n}\\n \\nbool eq(P a,P b){\\n return ( eq(a.real(),b.real()) && eq(a.imag(),b.imag()) );\\n}\\n \\nldouble dot(P a,P b){\\n return real(b*conj(a));\\n}\\n \\nldouble cross(P a,P b){\\n return imag(b*conj(a));\\n}\\n \\nldouble getArg(P a,P b){\\n return arg(b*conj(a));\\n}\\n \\nldouble getTime(V a,V b){\\n assert( eq(cross(a,b),0) );\\n return ( dot(a,b) < 0 ? -1.0 : 1.0 ) * abs(b) / abs(a);\\n}\\n \\n \\nP project(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*real(c/b);\\n}\\n \\nP reflect(P a,P b,P c){\\n b-=a,c-=a;\\n return a+b*conj(c/b);\\n}\\n \\nint ccw(P a,P b,P c){\\n P ab=b-a,ac=c-a;\\n P k=ac*conj(ab);\\n if(k.imag()> eps )return 1;\\n if(k.imag()< -eps )return -1;\\n if(k.real()< -eps )return 2;\\n if(abs(ab) + eps <abs(ac))return -2;\\n return 0;\\n}\\n \\nbool isParallel(P a,P b){\\n return eq(0, cross(a,b));\\n}\\n \\nbool isParallel(S a,S b){\\n return eq(0, cross( Vector(a) , Vector(b) ) );\\n}\\n \\nbool onLP(L l,P p){\\n P a=l.first, b=l.second;\\n return eq(0, cross(b-a,p-a));\\n}\\n \\nbool onSP(S s,P p){\\n P a=s.first, b=s.second;\\n return eq( abs(b-a) , abs(a-p)+abs(b-p) );\\n}\\n \\nbool isCrossSS(S s0,S s1){\\n P a=s0.first, b=s0.second;\\n P c=s1.first, d=s1.second;\\n int f0 = ccw(a,b,c) * ccw(a,b,d);\\n int f1 = ccw(c,d,a) * ccw(c,d,b);\\n return (f0<=0 && f1<=0);\\n}\\n \\nbool isCrossLS(L l,S s){\\n P a=l.first, b=l.second;\\n P c=s.first, d=s.second;\\n return ( ccw(a,b,c) * ccw(a,b,d) <= 0 );\\n}\\n \\nldouble distLP(L l,P p){\\n P a=l.first, b=l.second;\\n ldouble res = cross(b-a,p-a) / abs(b-a);\\n return abs(res);\\n}\\n \\nldouble distSP(S s,P p){\\n P a=s.first, b=s.second;\\n if( dot(b-a,p-a) < eps )return abs(p-a);\\n if( dot(a-b,p-b) < eps )return abs(p-b);\\n return distLP(s,p);\\n}\\n \\nldouble distSS(S s0,S s1){\\n if( isCrossSS(s0,s1) )return 0;\\n ldouble res0 = min( distSP( s0, s1.first ) , distSP(s0, s1.second) );\\n ldouble res1 = min( distSP( s1, s0.first ) , distSP(s1, s0.second) );\\n return min(res0,res1);\\n}\\n \\nP getCrossLL(L l0,L l1){\\n P a=l0.first, b=l0.second;\\n P c=l1.first, d=l1.second;\\n a-=d;b-=d;c-=d;\\n return d+a+(b-a)*imag(a/c)/imag(a/c-b/c);\\n}\\n \\n \\n \\nint inPolygon(vecP &t,P p){\\n int n=t.size();\\n ldouble sum=0;\\n for(int i=0;i<n;i++){\\n P a=t[i],b=t[(i+1==n?0:i+1)];\\n if( ccw(a,b,p)==0 )return 1;\\n sum+= getArg(a-p,b-p);\\n }\\n if( abs(sum) < eps )return 0;\\n else return 2;\\n}\\n \\nvecP andrewScan(vecP &t){\\n int N=t.size(),C=0;\\n vecP R(N);\\n for(int i=0;i<N;i++){\\n while(2<=C&&ccw(R[C-2],R[C-1],t[i])==-1)C--;\\n R[C++]=t[i];\\n }\\n vecP res(C);\\n for(int i=0;i<C;i++)res[i]=R[i];\\n return res;\\n}\\n \\nvecP convexHull(vecP &t){\\n sort(t.begin(),t.end());\\n vecP u=andrewScan(t);\\n reverse(t.begin(),t.end());\\n vecP l=andrewScan(t);\\n for(int i=1;i+1<(int)l.size();i++)u.push_back(l[i]);\\n return u;\\n}\\n \\nvecP cutConvex(vecP &t,L l){\\n P a=l.first, b=l.second;\\n int N=t.size();\\n vecP res;\\n for(int i=0;i<N;i++){\\n P c=t[i],d=t[(i+1)%N];\\n int C=ccw(a,b,c),D=ccw(a,b,d);\\n if(C!=-1)res.push_back(c);\\n if(C==-D&&abs(C)==1)res.push_back(getCrossLL( l ,L(c,d) ));\\n }\\n return res;\\n}\\n \\nP getVector(const vecP &t, int id){\\n int n=t.size();\\n return t[ (id+1)%n ] - t[id%n];\\n}\\n \\nldouble convex_diameter(vecP &t) {\\n int n = t.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(t[i]) > imag(t[is])) is = i;\\n if (imag(t[i]) < imag(t[js])) js = i;\\n }\\n ldouble maxd = norm(t[is]-t[js]);\\n \\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n \\n if (cross( getVector(t,i), getVector(t,j)) >= 0) j = (j+1) % n;\\n \\n else i = (i+1) % n;\\n if (norm(t[i]-t[j]) > maxd) {\\n maxd = norm(t[i]-t[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}\\n \\nbool compare_y(const P &a,const P &b){\\n return a.imag() < b.imag();\\n}\\n \\nldouble closest_pair(P *a, int n){\\n if(n <= 1) return 1e30;\\n int m = n / 2;\\n ldouble x = a[m].real();\\n ldouble d = min(closest_pair(a, m), closest_pair(a + m, n - m));\\n inplace_merge(a, a + m, a + n, compare_y);\\n vector<P> b;\\n for(int i=0;i<n;i++){\\n if( abs(a[i].real() - x) >= d) continue;\\n for(int j=0;j<(int)b.size();j++){\\n ldouble dx = real(a[i] - b[b.size() - j - 1]);\\n ldouble dy = imag(a[i] - b[b.size() - j - 1]);\\n if(dy >= d) break;\\n d = min(d, sqrt(dx * dx + dy * dy));\\n }\\n b.push_back(a[i]);\\n }\\n return d;\\n}\\n \\nP _pool[200005];\\nldouble minDist(vecP &t){\\n int n=t.size();\\n for(int i=0;i<n;i++)_pool[i]=t[i];\\n sort( _pool, _pool+n);\\n return closest_pair(_pool, n);\\n}\\n \\nint getStateCC(C a,C b){\\n ldouble ar=a.second, br=b.second;\\n ldouble dist=abs(a.first-b.first);\\n if(dist>ar+br+eps)return 4;\\n if(dist>ar+br-eps)return 3;\\n if(dist>abs(ar-br)+eps)return 2;\\n if(dist>abs(ar-br)-eps)return 1;\\n return 0;\\n}\\n \\nP getCrossCC(C a,C b){\\n P p1=a.first, p2=b.first;\\n ldouble r1=a.second, r2=b.second;\\n ldouble cA = (r1*r1+norm(p1-p2)-r2*r2) / (2.0*r1*abs(p1-p2));\\n return p1+(p2-p1)/abs(p1-p2)*r1*P(cA,Sqrt(1.0-cA*cA));\\n}\\n \\nP getTangentCP_(C a,P p,int flg){\\n P base=a.first-p;\\n ldouble ar=a.second;\\n ldouble w=Sqrt(norm(base)-ar*ar);\\n P s=p+base*P(w,ar * flg)/norm(base)*w;\\n return s;\\n}\\n \\nvector<S> getTangentCP(C a,P p){\\n vector<S> res;\\n P s=getTangentCP_(a,p,1);\\n P t=getTangentCP_(a,p,-1);\\n \\n if( eq(s,t) ){\\n res.push_back( S(s, s+(a.first-p)*P(0,1) ) ); \\n }else{\\n res.push_back( S(p,s) );\\n res.push_back( S(p,t) );\\n }\\n return res;\\n}\\n \\nS getInTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble w=ar+br;\\n ldouble h=Sqrt(norm(base)-w*w);\\n P k=base*P(w,h*flg)/norm(base);\\n return S(ap+k*ar,bp-k*br);\\n}\\n \\nS getOutTangent(C a,C b,ldouble flg=1.0){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n P base=bp-ap;\\n ldouble h=br-ar;\\n \\n ldouble w=Sqrt(norm(base)-h*h);\\n P k=base*P(w,h*flg)/norm(base)*P(0,flg);\\n return S(ap+k*ar,bp+k*br);\\n}\\n \\nvector<S> getTangentCC(C a,C b){\\n P ap=a.first,bp=b.first;\\n ldouble ar=a.second,br=b.second;\\n \\n vector<S> res;\\n ldouble dist=abs(ap-bp);\\n \\n if(dist>ar+br+eps)\\n res.push_back(getInTangent(a,b,1));\\n \\n if(dist>ar+br-eps)\\n res.push_back(getInTangent(a,b,-1));\\n \\n if(dist>abs(ar-br)+eps)\\n res.push_back(getOutTangent(a,b,1));\\n \\n if(dist>abs(ar-br)-eps)\\n res.push_back(getOutTangent(a,b,-1));\\n \\n return res;\\n}\\n \\n \\nvecP getCrossCL(C cir,L l){\\n P a=l.first, b=l.second;\\n ldouble cr=cir.second;\\n P cp=cir.first;\\n \\n vecP res;\\n P base=b-a, target=project(a,b,cp);\\n \\n ldouble length=abs(base), h=abs(cp-target);\\n base/=length;\\n \\n if(cr+eps<h)return res;\\n ldouble w=Sqrt(cr*cr-h*h);\\n ldouble L=getTime( normal(b-a) ,target-a)-w, R=L+w*2.0;\\n \\n res.push_back(a+base*L);\\n if( eq(L,R) )return res;\\n res.push_back(a+base*R);\\n \\n return res;\\n}\\n \\nvecP getCrossCS(C cir,S s){\\n vecP tmp=getCrossCL(cir,s);\\n vecP res;\\n for(int i=0;i<(int)tmp.size();i++)\\n // if( ccw(s.first,s.second, tmp[i] ) == 0)\\n if( onSP( s, tmp[i] ) )\\n res.push_back(tmp[i]);\\n return res;\\n}\\n \\nldouble getArea(C c,P a,P b){\\n P cp=c.first;\\n ldouble cr=c.second;\\n \\n P va=cp-a, vb=cp-b;\\n ldouble A=abs(va), B=abs(vb);\\n ldouble f=cross(va,vb), d=distSP( S(a,b) ,cp), res=0;\\n \\n if( eq(0, f ) )return 0;\\n if(A<cr+eps&&B<cr+eps)return f*0.5;\\n if(d>cr-eps)return cr*cr*PI*getArg(va,vb)/PI2;\\n \\n vecP u=getCrossCS(c, S(a,b) );\\n \\n assert( !u.empty() );\\n u.insert(u.begin(), a), u.push_back(b);\\n \\n for(int i=0;i+1<(int)u.size();i++) res+=getArea(c,u[i],u[i+1]);\\n return res;\\n}\\n \\nldouble getCrossArea(vecP t,C c){\\n int n=t.size();\\n if(n<3)return 0;\\n ldouble res=0;\\n for(int i=0;i<n;i++){\\n P a=t[i], b=t[(i+1)%n];\\n res+=getArea(c,a,b);\\n }\\n return res;\\n}\\n \\n \\nldouble calcPolygonArea(const vecP &t){\\n ldouble res=0;\\n int n=t.size();\\n for(int i=0;i<n;i++){\\n res+= cross( t[ (i+1)%n ],t[i] );\\n }\\n return abs(res)*0.5;\\n}\\n\\n\\nbool check(const vector<S> &t,const vector<P> &u, ldouble r){\\n vector<P> targets;\\n for(int i=0;i<(int)t.size();i++){\\n for(int j=0;j<(int)u.size();j++){\\n vector<P> tmp = getCrossCS( C(u[j],r), t[i] );\\n for(int k=0;k<(int)tmp.size();k++)targets.push_back(tmp[k]);\\n targets.push_back(t[i].first);\\n targets.push_back(t[i].second);\\n }\\n }\\n sort( targets.begin(), targets.end() );\\n targets.erase( unique(targets.begin(), targets.end() ), targets.end() );\\n for(int i=0;i<(int)targets.size();i++){\\n\\n ldouble mini=1e9;\\n for(int j=0;j<(int)u.size();j++){\\n ldouble dist=abs(targets[i]-u[j]);\\n mini=min(mini,dist);\\n }\\n if( mini > r - eps )return false;\\n }\\n return true;\\n}\\n\\nldouble solve(const vector<S> &t,const vector<P> &u){\\n ldouble left=0, right=1e6, mid;\\n for(int i=0;i<50;i++){\\n mid=(left+right)*0.5;\\n if( check(t,u,mid) )right=mid;\\n else left=mid;\\n }\\n return left;\\n}\\n\\nint main(){\\n \\n int n;\\n scanf(\\\"%d\\\",&n);\\n P cp=P(0,0);\\n vector< P > t(n);\\n for(int i=0;i<n;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n t[i]=P(x,y);\\n cp+=t[i];\\n }\\n \\n t.push_back( cp / (ldouble)n );\\n \\n \\n int m;\\n scanf(\\\"%d\\\",&m);\\n vector< P > u(m);\\n for(int i=0;i<m;i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n u[i]=P(x,y);\\n }\\n\\n vector< S > w;\\n for(int i=0;i<n;i++){\\n for(int j=0;j<i;j++){\\n w.push_back( S(t[i],t[j]) );\\n }\\n }\\n \\n printf(\\\"%.10f\\\\n\\\", (double)solve(w,u) );\\n return 0;\\n \\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 20,\n \"memory_kb\": 9672,\n \"score_of_the_acc\": -0.9598,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3049_3130760\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<math.h>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<deque>\\n#include<chrono>\\n#include<unordered_map>\\n#include<list>\\n#include<fstream>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef pair<int,int> pi;\\ntypedef pair<double,double> pd;\\nconst ll E=1e18+7;\\n#define F first\\n#define S second\\n#define MK make_pair\\nconst ll MOD=1000000007;\\n\\nconst double EPS=1e-7;\\n#define equals(a,b) (fabs(a-b)<EPS)\\n\\nstruct point{\\n double x,y;\\n \\n point(double x=0,double y=0):x(x),y(y){}\\n \\n point operator + (const point &P) const {\\n return point(x+P.x,y+P.y);\\n }\\n \\n point operator - (const point &P) const {\\n return point(x-P.x,y-P.y);\\n }\\n \\n point operator * (const double &D) const {\\n return point(x*D,y*D);\\n }\\n \\n point operator / (const double &D) const {\\n return point(x/D,y/D);\\n }\\n \\n bool operator == (const point &P) const {\\n if(fabs(x-P.x)<EPS && fabs(y-P.y)<EPS){return true;}\\n if(fabs(x-P.x)/max(fabs(x),fabs(P.x))<EPS && fabs(y-P.y)/max(fabs(y),fabs(P.y))<EPS){return true;}\\n return false;\\n }\\n \\n bool operator != (const point &P) const {\\n return !((*this)==P);\\n }\\n \\n double norm() const {\\n return x*x+y*y;\\n }\\n \\n double abs() const {\\n return sqrt(norm());\\n }\\n \\n //ax=y\\n double equation() const {\\n return y/x;\\n }\\n};\\n\\ndouble dot(const point &a,const point &b){\\n return a.x*b.x+a.y*b.y;\\n}\\n\\ndouble cross(const point &a,const point &b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\npoint mid_point(const point &a,const point &b){\\n return point(a.x+b.x,a.y+b.y)/2;\\n}\\n\\nstruct line{\\n point s,t;\\n \\n line(point s,point t):s(s),t(t){}\\n \\n bool operator == (const line &L) const {\\n return s==L.s && t==L.t;\\n }\\n \\n //ax+b=y\\n pair<double,double> equation() const {\\n double a=(t-s).equation();\\n double b=t.y-t.x*a;\\n return {a,b};\\n }\\n};\\n\\n//直行判定\\nbool isOrthogonal(const point &a,const point &b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(const line &a,const line &b){\\n return isOrthogonal(a.t-a.s,b.t-a.s);\\n}\\n\\n//平行判定\\nbool isParallel(const point &a,const point &b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(const line &a,const line &b){\\n return isParallel(a.t-a.s,b.t-b.s);\\n}\\n\\n//射影\\npoint project(const line &L,const point &P){\\n point base=L.t-L.s;\\n double r=dot(P-L.s,base)/base.norm();\\n return L.s+base*r;\\n}\\n\\n//点と点の距離\\ndouble getDistancePP(const point &a,const point &b){\\n return (a-b).abs();\\n}\\n\\n//直線と点の距離\\ndouble getDistanceLP(const line &L,const point &P){\\n return fabs(cross(L.t-L.s,P-L.s)/(L.t-L.s).abs());\\n}\\n\\n//線分と点の距離\\ndouble getDistanceSP(const line &L,const point &P){\\n if(dot(L.t-L.s,P-L.s)<0.0){return (P-L.s).abs();}\\n if(dot(L.s-L.t,P-L.t)<0.0){return (P-L.t).abs();}\\n return getDistanceLP(L,P);\\n}\\n\\n\\nstatic const int COUNTER_CLOCKWISE=1;\\nstatic const int CLOCKWISE=-1;\\nstatic const int ONLINE_BACK=2;\\nstatic const int ONLINE_FRONT=-2;\\nstatic const int ON_SEGMENT=0;\\n\\nint ccw(const point &p0,const point &p1,const point &p2){\\n point a=p1-p0;\\n point b=p2-p0;\\n if(cross(a,b)>EPS){return COUNTER_CLOCKWISE;}\\n if(cross(a,b)<-EPS){return CLOCKWISE;}\\n if(dot(a,b)<-EPS){return ONLINE_BACK;}\\n if(a.norm()<b.norm()){return ONLINE_FRONT;}\\n return ON_SEGMENT;\\n}\\n\\nbool intersect(const point &p1,const point &p2,const point &p3,const point &p4){\\n return ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 && ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0;\\n}\\n\\n//線分と線分の交差判定\\nbool intersect(const line &a,const line &b){\\n return intersect(a.s,a.t,b.s,b.t);\\n}\\n\\n//線分と線分の交点\\npoint XpointSS(const line &a,const line &b){\\n point base=b.t-b.s;\\n double d1=fabs(cross(base,a.s-b.s));\\n double d2=fabs(cross(base,a.t-b.s));\\n double t=d1/(d1+d2);\\n return a.s+(a.t-a.s)*t;\\n}\\n\\n\\n\\nvoid show(const point &p){cout<<p.x<<\\\" \\\"<<p.y<<endl;}\\n\\n\\n\\ntypedef vector<point> polygon;\\n\\nbool isInConvex(const polygon &poly,const point &P){\\n int sign=ccw(poly[0],poly[1],P);\\n for(int i=2;i<poly.size();i++){\\n if(ccw(poly[i-1],poly[i],P)!=sign){return false;}\\n }\\n if(ccw(poly[poly.size()-1],poly[0],P)!=sign){return false;}\\n return true;\\n}\\n\\n//0::false 1::is_in //2::on_line\\nll is_in_polygon(const polygon &P,const point &a){\\n bool x=false;\\n for(int i=1;i<=P.size();i++){\\n point A=a-P[i-1];\\n point B=a-P[i%P.size()];\\n if(abs(cross(A,B))<EPS && dot(A,B)<EPS){return 0;}\\n if(A.y>B.y){swap(A,B);}\\n if(A.y<EPS && EPS<B.y && cross(A,B)>EPS){x=!x;}\\n }\\n return (x?1:0);\\n}\\n\\nstatic const point err(1e18,1e18);\\n\\n//直交ベクトル\\npoint OrthogonalVector(const line &L){\\n point a=L.t-L.s;\\n return point(a.y,a.x*-1);\\n}\\n\\nline mid_line(const point &a,const point &b){\\n point s=mid_point(a,b);\\n point t=s+OrthogonalVector(line(a,b));\\n return line(s,t);\\n}\\n\\n//線分が直線と交わるか\\nbool XSL(const line &a,const line &b){\\n int A=ccw(b.s,b.t,a.s);\\n int B=ccw(b.s,b.t,a.t);\\n if(A==ONLINE_BACK || A==ONLINE_FRONT){return true;}\\n if(B==ONLINE_BACK || B==ONLINE_FRONT){return true;}\\n if(A*B<=0){return true;}\\n return false;\\n}\\n\\n//直線と直線の交点\\npoint XpointLL(const line &a,const line &b){\\n if(a.s==a.t || b.s==b.t){return err;}\\n if(a.s==b.s || a.s==b.t){return a.s;}\\n if(a.t==b.s || a.t==b.t){return a.t;}\\n if(isParallel(a,b)){return err;}\\n if(isOrthogonal(a,b)){return project(a,b.s);}\\n if(intersect(a,b)){return XpointSS(a,b);}\\n //ccw(a.s,a.t,b.s)*ccw(a.s,a.t,b.t)<=0\\n if(XSL(b,a)){\\n double d1=getDistancePP(project(a,b.s),b.s);\\n double d2=getDistancePP(project(a,b.t),b.t);\\n point base=b.t-b.s;\\n return b.s+base*d1/(d2+d1);\\n }\\n //ccw(b.s,b.t,a.s)*ccw(b.s,b.t,a.t)<=0\\n if(XSL(a,b)){\\n double d1=getDistancePP(project(b,a.s),a.s);\\n double d2=getDistancePP(project(b,a.t),a.t);\\n point base=a.t-a.s;\\n return a.s+base*d1/(d2+d1);\\n }\\n double d1=getDistancePP(project(a,b.s),b.s);\\n double d2=getDistancePP(project(a,b.t),b.t);\\n if(d1<d2){\\n return b.s+(b.s-b.t)*(d1/(d2-d1));\\n }\\n return b.t+(b.t-b.s)*(d2/(d1-d2));\\n}\\n\\n//間に合わせ\\nbool X(const line &a,const point &P){\\n double mix=min(a.s.x,a.t.x);\\n double mxx=max(a.s.x,a.t.x);\\n double miy=min(a.s.y,a.t.y);\\n double mxy=max(a.s.y,a.t.y);\\n if(mxx>=P.x && P.x>=mix && mxy>=P.y && P.y>=miy){return true;}\\n return false;\\n}\\n\\n//線分と直線の交点\\npoint XpointSL(const line &a,const line &b){\\n point ret=XpointLL(b,a);\\n /*\\n if(ret!=XpointLL(a,b)){\\n show(a.s);show(a.t);\\n show(b.s);show(b.t);\\n show(ret);show(XpointLL(a,b));\\n assert(false);\\n }\\n */\\n //assert(ret==XpointLL(a,b));\\n if(ret==err){return err;}\\n if(X(a,ret)){return ret;}\\n //if(ccw(a.s,a.t,ret)==ON_SEGMENT){return ret;}\\n return err;\\n}\\n\\n//外心\\npoint Circumcenter(const point &a,const point &b,const point &c){\\n if(a==b || b==c || c==a){return err;}\\n int w=ccw(a,b,c);\\n if(w!=COUNTER_CLOCKWISE && w!=CLOCKWISE){return err;}\\n line l1=mid_line(a,b);\\n line l2=mid_line(a,c);\\n return XpointLL(l1,l2);\\n}\\n\\ndouble solve(polygon P,polygon C){\\n polygon test=P;\\n for(int i=0;i<C.size();i++){\\n for(int t=i+1;t<C.size();t++){\\n line L=mid_line(C[i],C[t]);\\n for(int j=1;j<P.size();j++){\\n\\tpoint p=XpointSL(line(P[j-1],P[j]),L);\\n\\tif(p!=err){test.push_back(p);}\\n }\\n point p=XpointSL(line(P[P.size()-1],P[0]),L);\\n if(p!=err){test.push_back(p);}\\n }\\n }\\n for(int i=0;i<C.size();i++){\\n for(int t=i+1;t<C.size();t++){\\n for(int h=t+1;h<C.size();h++){\\n\\tpoint p=Circumcenter(C[i],C[t],C[h]);\\n\\tif(p==err){continue;}\\n\\tif(isInConvex(P,p)){test.push_back(p);}\\n }\\n }\\n }\\n double mx=0;\\n for(int i=0;i<test.size();i++){\\n double mi=E;\\n for(int t=0;t<C.size();t++){\\n mi=min(mi,getDistancePP(test[i],C[t]));\\n }\\n mx=max(mx,mi);\\n }\\n return mx;\\n}\\n\\n\\n\\n\\nint main(){\\n cout<<fixed<<setprecision(12);\\n ll n,m;\\n cin>>n;\\n polygon P,C;\\n for(int i=0;i<n;i++){\\n double a,b;\\n cin>>a>>b;\\n P.push_back(point(a,b));\\n }\\n cin>>m;\\n for(int t=0;t<m;t++){\\n double a,b;\\n cin>>a>>b;\\n C.push_back(point(a,b));\\n }\\n cout<<solve(P,C)+0.00001<<endl;\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6240,\n \"score_of_the_acc\": -0.465,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3049_3130755\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<math.h>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<deque>\\n#include<chrono>\\n#include<unordered_map>\\n#include<list>\\n#include<fstream>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef pair<int,int> pi;\\ntypedef pair<double,double> pd;\\nconst ll E=1e18+7;\\n#define F first\\n#define S second\\n#define MK make_pair\\nconst ll MOD=1000000007;\\n\\nconst double EPS=1e-7;\\n#define equals(a,b) (fabs(a-b)<EPS)\\n\\nstruct point{\\n double x,y;\\n \\n point(double x=0,double y=0):x(x),y(y){}\\n \\n point operator + (const point &P) const {\\n return point(x+P.x,y+P.y);\\n }\\n \\n point operator - (const point &P) const {\\n return point(x-P.x,y-P.y);\\n }\\n \\n point operator * (const double &D) const {\\n return point(x*D,y*D);\\n }\\n \\n point operator / (const double &D) const {\\n return point(x/D,y/D);\\n }\\n \\n bool operator == (const point &P) const {\\n if(fabs(x-P.x)<EPS && fabs(y-P.y)<EPS){return true;}\\n if(fabs(x-P.x)/max(fabs(x),fabs(P.x))<EPS && fabs(y-P.y)/max(fabs(y),fabs(P.y))<EPS){return true;}\\n return false;\\n }\\n \\n bool operator != (const point &P) const {\\n return !((*this)==P);\\n }\\n \\n double norm() const {\\n return x*x+y*y;\\n }\\n \\n double abs() const {\\n return sqrt(norm());\\n }\\n \\n //ax=y\\n double equation() const {\\n return y/x;\\n }\\n};\\n\\ndouble dot(const point &a,const point &b){\\n return a.x*b.x+a.y*b.y;\\n}\\n\\ndouble cross(const point &a,const point &b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\npoint mid_point(const point &a,const point &b){\\n return point(a.x+b.x,a.y+b.y)/2;\\n}\\n\\nstruct line{\\n point s,t;\\n \\n line(point s,point t):s(s),t(t){}\\n \\n bool operator == (const line &L) const {\\n return s==L.s && t==L.t;\\n }\\n \\n //ax+b=y\\n pair<double,double> equation() const {\\n double a=(t-s).equation();\\n double b=t.y-t.x*a;\\n return {a,b};\\n }\\n};\\n\\n//直行判定\\nbool isOrthogonal(const point &a,const point &b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(const line &a,const line &b){\\n return isOrthogonal(a.t-a.s,b.t-a.s);\\n}\\n\\n//平行判定\\nbool isParallel(const point &a,const point &b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(const line &a,const line &b){\\n return isParallel(a.t-a.s,b.t-b.s);\\n}\\n\\n//射影\\npoint project(const line &L,const point &P){\\n point base=L.t-L.s;\\n double r=dot(P-L.s,base)/base.norm();\\n return L.s+base*r;\\n}\\n\\n//点と点の距離\\ndouble getDistancePP(const point &a,const point &b){\\n return (a-b).abs();\\n}\\n\\n//直線と点の距離\\ndouble getDistanceLP(const line &L,const point &P){\\n return fabs(cross(L.t-L.s,P-L.s)/(L.t-L.s).abs());\\n}\\n\\n//線分と点の距離\\ndouble getDistanceSP(const line &L,const point &P){\\n if(dot(L.t-L.s,P-L.s)<0.0){return (P-L.s).abs();}\\n if(dot(L.s-L.t,P-L.t)<0.0){return (P-L.t).abs();}\\n return getDistanceLP(L,P);\\n}\\n\\n\\nstatic const int COUNTER_CLOCKWISE=1;\\nstatic const int CLOCKWISE=-1;\\nstatic const int ONLINE_BACK=2;\\nstatic const int ONLINE_FRONT=-2;\\nstatic const int ON_SEGMENT=0;\\n\\nint ccw(const point &p0,const point &p1,const point &p2){\\n point a=p1-p0;\\n point b=p2-p0;\\n if(cross(a,b)>EPS){return COUNTER_CLOCKWISE;}\\n if(cross(a,b)<-EPS){return CLOCKWISE;}\\n if(dot(a,b)<-EPS){return ONLINE_BACK;}\\n if(a.norm()<b.norm()){return ONLINE_FRONT;}\\n return ON_SEGMENT;\\n}\\n\\nbool intersect(const point &p1,const point &p2,const point &p3,const point &p4){\\n return ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 && ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0;\\n}\\n\\n//線分と線分の交差判定\\nbool intersect(const line &a,const line &b){\\n return intersect(a.s,a.t,b.s,b.t);\\n}\\n\\n//線分と線分の交点\\npoint XpointSS(const line &a,const line &b){\\n point base=b.t-b.s;\\n double d1=fabs(cross(base,a.s-b.s));\\n double d2=fabs(cross(base,a.t-b.s));\\n double t=d1/(d1+d2);\\n return a.s+(a.t-a.s)*t;\\n}\\n\\n\\n\\nvoid show(const point &p){cout<<p.x<<\\\" \\\"<<p.y<<endl;}\\n\\n\\n\\ntypedef vector<point> polygon;\\n\\nbool isInConvex(const polygon &poly,const point &P){\\n int sign=ccw(poly[0],poly[1],P);\\n for(int i=2;i<poly.size();i++){\\n if(ccw(poly[i-1],poly[i],P)!=sign){return false;}\\n }\\n if(ccw(poly[poly.size()-1],poly[0],P)!=sign){return false;}\\n return true;\\n}\\n\\n//0::false 1::is_in //2::on_line\\nll is_in_polygon(const polygon &P,const point &a){\\n bool x=false;\\n for(int i=1;i<=P.size();i++){\\n point A=a-P[i-1];\\n point B=a-P[i%P.size()];\\n if(abs(cross(A,B))<EPS && dot(A,B)<EPS){return 0;}\\n if(A.y>B.y){swap(A,B);}\\n if(A.y<EPS && EPS<B.y && cross(A,B)>EPS){x=!x;}\\n }\\n return (x?1:0);\\n}\\n\\nstatic const point err(1e18,1e18);\\n\\n//直交ベクトル\\npoint OrthogonalVector(const line &L){\\n point a=L.t-L.s;\\n return point(a.y,a.x*-1);\\n}\\n\\nline mid_line(const point &a,const point &b){\\n point s=mid_point(a,b);\\n point t=s+OrthogonalVector(line(a,b));\\n return line(s,t);\\n}\\n\\n//線分が直線と交わるか\\nbool XSL(const line &a,const line &b){\\n int A=ccw(b.s,b.t,a.s);\\n int B=ccw(b.s,b.t,a.t);\\n if(A==ONLINE_BACK || A==ONLINE_FRONT){return true;}\\n if(B==ONLINE_BACK || B==ONLINE_FRONT){return true;}\\n if(A*B<=0){return true;}\\n return false;\\n}\\n\\n//直線と直線の交点\\npoint XpointLL(const line &a,const line &b){\\n if(a.s==a.t || b.s==b.t){return err;}\\n if(a.s==b.s || a.s==b.t){return a.s;}\\n if(a.t==b.s || a.t==b.t){return a.t;}\\n if(isParallel(a,b)){return err;}\\n if(isOrthogonal(a,b)){return project(a,b.s);}\\n if(intersect(a,b)){return XpointSS(a,b);}\\n //ccw(a.s,a.t,b.s)*ccw(a.s,a.t,b.t)<=0\\n if(XSL(b,a)){\\n double d1=getDistancePP(project(a,b.s),b.s);\\n double d2=getDistancePP(project(a,b.t),b.t);\\n point base=b.t-b.s;\\n return b.s+base*d1/(d2+d1);\\n }\\n //ccw(b.s,b.t,a.s)*ccw(b.s,b.t,a.t)<=0\\n if(XSL(a,b)){\\n double d1=getDistancePP(project(b,a.s),a.s);\\n double d2=getDistancePP(project(b,a.t),a.t);\\n point base=a.t-a.s;\\n return a.s+base*d1/(d2+d1);\\n }\\n double d1=getDistancePP(project(a,b.s),b.s);\\n double d2=getDistancePP(project(a,b.t),b.t);\\n if(d1<d2){\\n return b.s+(b.s-b.t)*(d1/(d2-d1));\\n }\\n return b.t+(b.t-b.s)*(d2/(d1-d2));\\n}\\n\\n//間に合わせ\\nbool X(const line &a,const point &P){\\n double mix=min(a.s.x,a.t.x);\\n double mxx=max(a.s.x,a.t.x);\\n double miy=min(a.s.y,a.t.y);\\n double mxy=max(a.s.y,a.t.y);\\n if(mxx>=P.x && P.x>=mix && mxy>=P.y && P.y>=miy){return true;}\\n return false;\\n}\\n\\n//線分と直線の交点\\npoint XpointSL(const line &a,const line &b){\\n point ret=XpointLL(b,a);\\n /*\\n if(ret!=XpointLL(a,b)){\\n show(a.s);show(a.t);\\n show(b.s);show(b.t);\\n show(ret);show(XpointLL(a,b));\\n assert(false);\\n }\\n */\\n //assert(ret==XpointLL(a,b));\\n if(ret==err){return err;}\\n if(X(a,ret)){return ret;}\\n //if(ccw(a.s,a.t,ret)==ON_SEGMENT){return ret;}\\n return err;\\n}\\n\\n//外心\\npoint Circumcenter(const point &a,const point &b,const point &c){\\n if(a==b || b==c || c==a){return err;}\\n int w=ccw(a,b,c);\\n if(w!=COUNTER_CLOCKWISE && w!=CLOCKWISE){return err;}\\n line l1=mid_line(a,b);\\n line l2=mid_line(a,c);\\n return XpointLL(l1,l2);\\n}\\n\\ndouble solve(polygon P,polygon C){\\n polygon test=P;\\n for(int i=0;i<C.size();i++){\\n for(int t=i+1;t<C.size();t++){\\n line L=mid_line(C[i],C[t]);\\n for(int j=1;j<P.size();j++){\\n\\tpoint p=XpointSL(line(P[j-1],P[j]),L);\\n\\tif(p!=err){test.push_back(p);}\\n }\\n point p=XpointSL(line(P[P.size()-1],P[0]),L);\\n if(p!=err){test.push_back(p);}\\n }\\n }\\n for(int i=0;i<C.size();i++){\\n for(int t=i+1;t<C.size();t++){\\n for(int h=t+1;h<C.size();h++){\\n\\tpoint p=Circumcenter(C[i],C[t],C[h]);\\n\\tif(p==err){continue;}\\n\\tif(isInConvex(P,p)){test.push_back(p);}\\n }\\n }\\n }\\n double mx=0;\\n for(int i=0;i<test.size();i++){\\n double mi=E;\\n for(int t=0;t<C.size();t++){\\n mi=min(mi,getDistancePP(test[i],C[t]));\\n }\\n mx=max(mx,mi);\\n }\\n return mx;\\n}\\n\\n\\n\\n\\nint main(){\\n //cout<<fixed<<setprecision(12);\\n ll n,m;\\n cin>>n;\\n polygon P,C;\\n for(int i=0;i<n;i++){\\n double a,b;\\n cin>>a>>b;\\n P.push_back(point(a,b));\\n }\\n cin>>m;\\n for(int t=0;t<m;t++){\\n double a,b;\\n cin>>a>>b;\\n C.push_back(point(a,b));\\n }\\n cout<<solve(P,C)<<endl;\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6356,\n \"score_of_the_acc\": -0.4824,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1891,"cells":{"group_id":{"kind":"string","value":"aoj_3035_cpp"},"problem_description":{"kind":"string","value":"Problem J: Matrix\nProblem\n長さ$H$の数列$A$と長さ$W$の数列$B$が与えられる。\n$H$行$W$列からなる行列$C$を以下のように定義する。\n$ C_{i,j} = A_i \\times B_j (1 \\leq i \\leq H, 1 \\leq j \\leq W) $\n以下の四種類のクエリを合計$Q$回処理せよ。\nクエリ1\n$1$ $a$ $b$ $v$\n$ A_i ( a \\leq i \\leq b) $に$v$を加える\nクエリ2\n$2$ $c$ $d$ $v$\n$ B_j ( c \\leq j \\leq d) $に$v$を加える\nクエリ3\n$3$ $a$ $b$ $c$ $d$\n$ C_{i,j} ( a \\leq i \\leq b, c \\leq j \\leq d) $の最小値とその個数を出力する\nクエリ4\n$4$ $a$ $b$ $c$ $d$\n$ C_{i,j} ( a \\leq i \\leq b, c \\leq j \\leq d) $の最大値とその個数を出力する\n詳しくはサンプル入出力を参考にせよ。\nInput\n入力は以下の形式で与えられる。\n$H$ $W$ $Q$\n$A_1$ $A_2$ ... $A_H$\n$B_1$ $B_2$ ... $B_W$\n$query_1$\n$query_2$\n...\n$query_Q$\n各クエリは以下の四種類のいずれかの形式で与えられる。\n$1$ $a$ $b$ $v$\n$2$ $c$ $d$ $v$\n$3$ $a$ $b$ $c$ $d$\n$4$ $a$ $b$ $c$ $d$\n入力はすべて整数で与えられる。\n1行目に$H$, $W$, $Q$が空白区切りで与えられる。\n2行目に数列$A$の要素$A_i$($1 \\leq i \\leq H$)が空白区切りで与えられる。\n3行目に数列$B$の要素$B_j$($1 \\leq j \\leq W$)が空白区切りで与えられる。\n4行目以降の$Q$行にクエリが改行区切りで与えられる。\n各クエリ内の数値は全て空白区切りである。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq H, W, Q\\leq 10^5 $\n$-1000 \\leq A_i \\leq 1000 $\n$-1000 \\leq B_j \\leq 1000 $\n各クエリについて、入力は以下の条件を満たす。\n$1 \\leq a \\leq b \\leq H$\n$1 \\leq c \\leq d \\leq W$\n$-1000 \\leq v \\leq 1000$\nOutput\n各クエリ3及びクエリ4について、値と個数を空白区切りで一行に出力せよ。\nSample Input 1\n4 4 7\n1 2 3 4\n1 2 3 4\n3 2 3 2 3\n4 2 3 2 3\n3 1 1 1 1\n4 1 1 1 1\n1 1 1 1\n3 1 4 1 2\n4 2 3 2 4\nSample Output 1\n4 1\n9 1\n1 1\n1 1\n2 2\n12 1\nクエリ1, 2で指定されている範囲は以下の画像の緑色に塗られた領域である。\nクエリ3, 4で指定されている範囲は以下の画像の橙色に塗られた領域である。\nクエリ5によって$A_1$に1が加えられる。\nクエリ6で指定されている範囲は以下の画像の水色に塗られた領域である。\nクエリ7で指定されている範囲は以下の画像の紫色に塗られた領域である。\nSample Input 2\n4 4 6\n1 1 1 1\n1 1 1 1\n3 1 4 1 4\n4 1 4 1 4\n1 2 3 1\n2 2 3 1\n3 1 4 1 4\n4 1 4 1 4\nSample Output 2\n1 16\n1 16\n1 4\n4 4\n初期状態の$C$は以下のようになる。\nクエリ3, 4以後の$C$は以下のようになる。\nSample Input 3\n4 4 7\n0 1 0 1\n1 0 1 0\n3 2 4 1 3\n4 1 4 1 4\n1 1 4 -1\n3 1 3 1 3\n1 3 3 2\n2 3 3 -2\n3 2 4 2 4\nSample Output 3\n0 5\n1 4\n-1 4\n-1 1\nSample Input 4\n36 4 20\n-523 -460 -536 -885 652 782 513 -558 -521 -808 124 -708 -943 52 -856 -755 -958 913 380 -767 373 -731 -492 213 538 392 -39 509 -840 135 78 -285 -241 522 -572 -915\n-691 -16 812 -385\n4 7 17 4 4\n3 24 33 1 1\n4 3 35 2 4\n3 28 32 4 4\n2 3 3 438\n3 7 15 1 1\n4 2 17 4 4\n3 24 28 2 4\n4 15 16 4 4\n4 18 29 1 1\n3 24 27 2 4\n2 2 3 -828\n3 18 23 3 3\n1 27 31 -701\n2 2 3 298\n1 21 32 237\n2 3 3 -71\n1 14 29 772\n4 13 19 3 3\n3 19 34 1 2\nSample Output 4\n368830 1\n-371758 1\n741356 1\n-195965 1\n-354483 1\n368830 1\n-207130 1\n329560 1\n580440 1\n-207130 1\n-323674 1\n1093565 1\n-1068977 1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3035_10322807","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\n#include<atcoder/lazysegtree>\nusing namespace atcoder;\n\nstruct S{\n\tll v,n;\n};\n\nS opm(S a,S b){\n\tif(a.v==b.v){\n\t\ta.n+=b.n;\n\t\treturn a;\n\t}\n\telse if(a.v<b.v)return a;\n\telse return b;\n}\nS em(){return {ll(1e18),0};}\nS opM(S a,S b){\n\tif(a.v==b.v){\n\t\ta.n+=b.n;\n\t\treturn a;\n\t}\n\telse if(a.v>b.v)return a;\n\telse return b;\n}\nS eM(){return {ll(-1e18),0};}\nS mapping(ll a,S b){\n\tb.v+=a;\n\treturn b;\n}\nll add(ll a,ll b){return a+b;}\nll id(){return 0;}\n\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tll H,W,Q;\n\tcin>>H>>W>>Q;\n\tvector<S> A(H),B(W);\n\tfor(int i=0;i<H;i++){\n\t\tll a;\n\t\tcin>>a;\n\t\tA[i]={a,1};\n\t}\n\tfor(int i=0;i<W;i++){\n\t\tll a;\n\t\tcin>>a;\n\t\tB[i]={a,1};\n\t}\n\tlazy_segtree<S,opm,em,ll,mapping,add,id> segmA(A),segmB(B);\n\tlazy_segtree<S,opM,eM,ll,mapping,add,id> segMA(A),segMB(B);\n\tfor(int q=0;q<Q;q++){\n\t\tint t,a,b;\n\t\tcin>>t>>a>>b;\n\t\tif(t==1){\n\t\t\tll v;\n\t\t\tcin>>v;\n\t\t\ta--;\n\t\t\tsegmA.apply(a,b,v);\n\t\t\tsegMA.apply(a,b,v);\n\t\t}\n\t\telse if(t==2){\n\t\t\tll v;\n\t\t\tcin>>v;\n\t\t\ta--;\n\t\t\tsegmB.apply(a,b,v);\n\t\t\tsegMB.apply(a,b,v);\n\t\t}\n\t\telse if(t==3){\n\t\t\tint c,d;\n\t\t\tcin>>c>>d;\n\t\t\ta--,c--;\n\t\t\tll an=1e18,num=0;\n\t\t\tfor(int i:{0,1}){\n\t\t\t\tif(i==1&&segmA.prod(a,b).v==segMA.prod(a,b).v)continue;\n\t\t\t\tfor(int j:{0,1}){\n\t\t\t\t\tif(j==1&&segmB.prod(c,d).v==segMB.prod(c,d).v)continue;\n\t\t\t\t\tS P,Q;\n\t\t\t\t\tif(i)P=segmA.prod(a,b);\n\t\t\t\t\telse P=segMA.prod(a,b);\n\t\t\t\t\tif(j)Q=segmB.prod(c,d);\n\t\t\t\t\telse Q=segMB.prod(c,d);\n\t\t\t\t\tif(P.v*Q.v<an){\n\t\t\t\t\t\tan=P.v*Q.v;\n\t\t\t\t\t\tnum=0;\n\t\t\t\t\t}\n\t\t\t\t\tif(P.v*Q.v==an){\n\t\t\t\t\t\tnum+=P.n*Q.n;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(an==0){\n\t\t\t\tll s=b-a,t=d-c;\n\t\t\t\tif(segmA.prod(a,b).v==0)s-=segmA.prod(a,b).n;\n\t\t\t\telse if(segMA.prod(a,b).v==0)s-=segMA.prod(a,b).n;\n\t\t\t\tif(segmB.prod(c,d).v==0)t-=segmB.prod(c,d).n;\n\t\t\t\telse if(segMB.prod(c,d).v==0)t-=segMB.prod(c,d).n;\n\t\t\t\tnum=ll(b-a)*ll(d-c)-s*t;\n\t\t\t}\n\t\t\tcout<<an<<\" \"<<num<<endl;\n\t\t}\n\t\telse{\n\t\t\tint c,d;\n\t\t\tcin>>c>>d;\n\t\t\ta--,c--;\n\t\t\tll an=-1e18,num=0;\n\t\t\tfor(int i:{0,1}){\n\t\t\t\tif(i==1&&segmA.prod(a,b).v==segMA.prod(a,b).v)continue;\n\t\t\t\tfor(int j:{0,1}){\n\t\t\t\t\tif(j==1&&segmB.prod(c,d).v==segMB.prod(c,d).v)continue;\n\t\t\t\t\t\n\t\t\t\t\tS P,Q;\n\t\t\t\t\tif(i)P=segmA.prod(a,b);\n\t\t\t\t\telse P=segMA.prod(a,b);\n\t\t\t\t\tif(j)Q=segmB.prod(c,d);\n\t\t\t\t\telse Q=segMB.prod(c,d);\n\t\t\t\t\t// cout<<P.v<<\"m\"<<P.n<<\" \"<<Q.v<<\" \"<<Q.n<<endl;\n\t\t\t\t\tif(P.v*Q.v>an){\n\t\t\t\t\t\tan=P.v*Q.v;\n\t\t\t\t\t\tnum=0;\n\t\t\t\t\t}\n\t\t\t\t\tif(P.v*Q.v==an){\n\t\t\t\t\t\tnum+=P.n*Q.n;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(an==0){\n\t\t\t\tll s=b-a,t=d-c;\n\t\t\t\tif(segmA.prod(a,b).v==0)s-=segmA.prod(a,b).n;\n\t\t\t\telse if(segMA.prod(a,b).v==0)s-=segMA.prod(a,b).n;\n\t\t\t\tif(segmB.prod(c,d).v==0)t-=segmB.prod(c,d).n;\n\t\t\t\telse if(segMB.prod(c,d).v==0)t-=segMB.prod(c,d).n;\n\t\t\t\tnum=ll(b-a)*ll(d-c)-s*t;\n\t\t\t}\n\t\t\tcout<<an<<\" \"<<num<<endl;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":140,"memory_kb":26604,"score_of_the_acc":-1.1398,"final_rank":2},{"submission_id":"aoj_3035_9595724","code_snippet":"#include<iostream>\n#include<vector>\n\nusing namespace std;\nconst int N = 1e5 + 10;\nconst int INF = 1e9 + 7;\n\nstruct Node {\n int mn, mx, cmn, cmx;\n Node() {\n mn = INF, mx = -INF, cmn = 0, cmx = 0;\n }\n Node(int x) {\n mn = mx = x, cmn = cmx = 1;\n }\n};\n\nNode mrg(Node t1, Node t2) {\n Node ans;\n\n if(t1.mn < t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn;\n else if(t1.mn == t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn + t2.cmn;\n else ans.mn = t2.mn, ans.cmn = t2.cmn;\n\n if(t1.mx > t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx;\n else if(t1.mx == t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx + t2.cmx;\n else ans.mx = t2.mx, ans.cmx = t2.cmx;\n\n return ans;\n}\n\nstruct SegTree {\n vector<Node> tree;\n vector<int> d;\n\n SegTree() {\n tree.resize(N * 4, Node());\n d.resize(N * 4, 0);\n }\n\n void build(int tind, int l, int r, vector<int> &a) {\n if(r - l == 1) {\n tree[tind] = Node(a[l]);\n return;\n }\n int m = (r + l) >> 1;\n build(tind * 2 + 1, l, m, a);\n build(tind * 2 + 2, m, r, a);\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\n }\n\n void push(int tind, int l, int r) {\n if(d[tind] == 0) return;\n tree[tind].mn += d[tind], tree[tind].mx += d[tind];\n if(r - l > 1) {\n d[tind * 2 + 1] += d[tind];\n d[tind * 2 + 2] += d[tind];\n }\n d[tind] = 0;\n }\n\n void upd(int tind, int l, int r, int ql, int qr, int x) {\n push(tind, l, r);\n if(ql <= l && r <= qr) {\n d[tind] += x;\n push(tind, l, r);\n return;\n }\n if(ql >= r || l >= qr) return;\n int m = (r + l) >> 1;\n upd(tind * 2 + 1, l, m, ql, qr, x);\n upd(tind * 2 + 2, m, r, ql, qr, x);\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\n }\n\n Node get(int tind, int l, int r, int ql, int qr) {\n push(tind, l, r);\n if(ql <= l && r <= qr) return tree[tind];\n if(ql >= r || l >= qr) return Node();\n int m = (r + l) >> 1;\n return mrg(get(tind * 2 + 1, l, m, ql, qr), get(tind * 2 + 2, m, r, ql, qr));\n }\n};\n\nsigned main() {\n#ifdef LOCAL\n freopen(\"inp.txt\", \"r\", stdin);\n freopen(\"out.txt\", \"w\", stdout);\n#endif\n int h, w, q;\n cin >> h >> w >> q;\n vector<int> a(h), b(w);\n for(int i = 0; i < h; ++i) cin >> a[i];\n for(int i = 0; i < w; ++i) cin >> b[i];\n SegTree A, B;\n A.build(0, 0, h, a);\n B.build(0, 0, w, b);\n\n while(q--) {\n int t;\n cin >> t;\n if(t == 1) {\n int l, r, v;\n cin >> l >> r >> v;\n A.upd(0, 0, h, l - 1, r, v);\n } else if(t == 2) {\n int l, r, v;\n cin >> l >> r >> v;\n B.upd(0, 0, w, l - 1, r, v);\n } else if(t == 3) {\n int l1, r1, l2, r2;\n cin >> l1 >> r1 >> l2 >> r2;\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\n long long v1 = 1LL * t1.mx * t2.mn;\n long long v2 = 1LL * t1.mn * t2.mx;\n long long v3 = 1LL * t1.mn * t2.mn;\n long long v4 = 1LL * t1.mx * t2.mx;\n long long ans = min(min(v1, v2), min(v3, v4));\n long long cnt = 0;\n if(ans == 0) {\n int c10 = 0, c20 = 0;\n if(t1.mn == 0) c10 = t1.cmn;\n if(t1.mx == 0) c10 = t1.cmx;\n if(t2.mn == 0) c20 = t2.cmn;\n if(t2.mx == 0) c20 = t2.cmx;\n cnt += 1LL * c10 * (r2 - l2 + 1);\n cnt += 1LL * c20 * (r1 - l1 + 1);\n cnt -= 1LL * c10 * c20;\n } else {\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\n if(t1.mx == t1.mn) cnt /= 2;\n if(t2.mn == t2.mx) cnt /= 2;\n }\n cout << ans << \" \" << cnt << \"\\n\";\n } else if(t == 4) {\n int l1, r1, l2, r2;\n cin >> l1 >> r1 >> l2 >> r2;\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\n long long v1 = 1LL * t1.mx * t2.mn;\n long long v2 = 1LL * t1.mn * t2.mx;\n long long v3 = 1LL * t1.mn * t2.mn;\n long long v4 = 1LL * t1.mx * t2.mx;\n long long ans = max(max(v1, v2), max(v3, v4));\n long long cnt = 0;\n if(ans == 0) {\n int c10 = 0, c20 = 0;\n if(t1.mn == 0) c10 = t1.cmn;\n if(t1.mx == 0) c10 = t1.cmx;\n if(t2.mn == 0) c20 = t2.cmn;\n if(t2.mx == 0) c20 = t2.cmx;\n cnt += 1LL * c10 * (r2 - l2 + 1);\n cnt += 1LL * c20 * (r1 - l1 + 1);\n cnt -= 1LL * c10 * c20;\n } else {\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\n if(t1.mx == t1.mn) cnt /= 2;\n if(t2.mn == t2.mx) cnt /= 2;\n }\n cout << ans << \" \" << cnt << \"\\n\";\n }\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":19484,"score_of_the_acc":-1.0448,"final_rank":1},{"submission_id":"aoj_3035_9595712","code_snippet":"#include<iostream>\n#include<vector>\n\nusing namespace std;\nconst int N = 1e5 + 10;\nconst int INF = 1e9 + 7;\n\nstruct Node {\n int mn, mx, cmn, cmx;\n Node() {\n mn = INF, mx = -INF, cmn = 0, cmx = 0;\n }\n Node(int x) {\n mn = mx = x, cmn = cmx = 1;\n }\n};\n\nNode mrg(Node t1, Node t2) {\n Node ans;\n\n if(t1.mn < t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn;\n else if(t1.mn == t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn + t2.cmn;\n else ans.mn = t2.mn, ans.cmn = t2.cmn;\n\n if(t1.mx > t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx;\n else if(t1.mx == t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx + t2.cmx;\n else ans.mx = t2.mx, ans.cmx = t2.cmx;\n\n return ans;\n}\n\nstruct SegTree {\n vector<Node> tree;\n vector<int> d;\n\n SegTree() {\n tree.resize(N * 4, Node());\n d.resize(N * 4, 0);\n }\n\n void build(int tind, int l, int r, vector<int> &a) {\n if(r - l == 1) {\n tree[tind] = Node(a[l]);\n return;\n }\n int m = (r + l) >> 1;\n build(tind * 2 + 1, l, m, a);\n build(tind * 2 + 2, m, r, a);\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\n }\n\n void push(int tind, int l, int r) {\n if(d[tind] == 0) return;\n tree[tind].mn += d[tind], tree[tind].mx += d[tind];\n if(r - l > 1) {\n d[tind * 2 + 1] += d[tind];\n d[tind * 2 + 2] += d[tind];\n }\n d[tind] = 0;\n }\n\n void upd(int tind, int l, int r, int ql, int qr, int x) {\n push(tind, l, r);\n if(ql <= l && r <= qr) {\n d[tind] += x;\n push(tind, l, r);\n return;\n }\n if(ql >= r || l >= qr) return;\n int m = (r + l) >> 1;\n upd(tind * 2 + 1, l, m, ql, qr, x);\n upd(tind * 2 + 2, m, r, ql, qr, x);\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\n }\n\n Node get(int tind, int l, int r, int ql, int qr) {\n push(tind, l, r);\n if(ql <= l && r <= qr) return tree[tind];\n if(ql >= r || l >= qr) return Node();\n int m = (r + l) >> 1;\n return mrg(get(tind * 2 + 1, l, m, ql, qr), get(tind * 2 + 2, m, r, ql, qr));\n }\n};\n\nsigned main() {\n#ifdef LOCAL\n freopen(\"inp.txt\", \"r\", stdin);\n freopen(\"out.txt\", \"w\", stdout);\n#endif\n int h, w, q;\n cin >> h >> w >> q;\n vector<int> a(h), b(w);\n for(int i = 0; i < h; ++i) cin >> a[i];\n for(int i = 0; i < w; ++i) cin >> b[i];\n SegTree A, B;\n A.build(0, 0, h, a);\n B.build(0, 0, w, b);\n\n while(q--) {\n int t;\n cin >> t;\n if(t == 1) {\n int l, r, v;\n cin >> l >> r >> v;\n A.upd(0, 0, h, l - 1, r, v);\n } else if(t == 2) {\n int l, r, v;\n cin >> l >> r >> v;\n B.upd(0, 0, w, l - 1, r, v);\n } else if(t == 3) {\n int l1, r1, l2, r2;\n cin >> l1 >> r1 >> l2 >> r2;\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\n long long v1 = 1LL * t1.mx * t2.mn;\n long long v2 = 1LL * t1.mn * t2.mx;\n long long v3 = 1LL * t1.mn * t2.mn;\n long long v4 = 1LL * t1.mx * t2.mx;\n long long ans = min(min(v1, v2), min(v3, v4));\n long long cnt = 0;\n if(ans == 0) {\n if(t1.mn == 0) cnt += 1LL * t1.cmn * (r2 - l2 + 1);\n if(t1.mx == 0) cnt += 1LL * t1.cmx * (r2 - l2 + 1);\n if(t2.mn == 0) {\n cnt += 1LL * t2.cmn * (r1 - l1 + 1);\n cnt -= (t1.mn == 0) + (t1.mx == 0);\n }\n if(t2.mx == 0) {\n cnt += 1LL * t2.cmx * (r1 - l1 + 1);\n cnt -= (t1.mn == 0) + (t1.mx == 0);\n }\n } else {\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\n }\n if(t1.mx == t1.mn) cnt /= 2;\n if(t2.mn == t2.mx) cnt /= 2;\n cout << ans << \" \" << cnt << '\\n';\n } else if(t == 4) {\n int l1, r1, l2, r2;\n cin >> l1 >> r1 >> l2 >> r2;\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\n long long v1 = 1LL * t1.mx * t2.mn;\n long long v2 = 1LL * t1.mn * t2.mx;\n long long v3 = 1LL * t1.mn * t2.mn;\n long long v4 = 1LL * t1.mx * t2.mx;\n long long ans = max(max(v1, v2), max(v3, v4));\n long long cnt = 0;\n if(ans == 0) {\n if(t1.mn == 0) cnt += 1LL * t1.cmn * (r2 - l2 + 1);\n if(t1.mx == 0) cnt += 1LL * t1.cmx * (r2 - l2 + 1);\n if(t2.mn == 0) {\n cnt += 1LL * t2.cmn * (r1 - l1 + 1);\n cnt -= (t1.mn == 0) + (t1.mx == 0);\n }\n if(t2.mx == 0) {\n cnt += 1LL * t2.cmx * (r1 - l1 + 1);\n cnt -= (t1.mn == 0) + (t1.mx == 0);\n }\n } else {\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\n }\n if(t1.mx == t1.mn) cnt /= 2;\n if(t2.mn == t2.mx) cnt /= 2;\n cout << ans << \" \" << cnt << '\\n';\n }\n }\n return 0;\n}","accuracy":0.735632183908046,"time_ms":180,"memory_kb":19480,"score_of_the_acc":-1.0447,"final_rank":8},{"submission_id":"aoj_3035_3407502","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\ntypedef long long ll;\ntypedef pair<int,int> pint;\ntypedef pair<ll,int> pli;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\ntemplate<typename T>\nstruct LazySegmentTree{\nprivate:\n int n;\n vector<T> node;\n vector<int> lazy;\n T E0;\n int E1=0;\n\n inline void updatef(int& lazy,int& value){\n //lazy += value;\n lazy += value;\n //lazy = max(lazy, value);\n //lazy = min(lazy, value);\n }\n inline void calculatef(T& node,int& lazy,int len){\n //node += lazy * len;\n // node += lazy ;\n node.first += lazy ;\n }\n inline T queryf(T& x,T& y){\n //return x + y;\n //return x * y;\n //return max(x, y);\n if(x.first<y.first)return x;\n else if(x.first>y.first)return y;\n else return {x.first, x.second+y.second};\n }\npublic:\n LazySegmentTree(int sz,T nodeE,int lazyE = 0):E0(nodeE), E1(lazyE){\n n=1;\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n }\n\n LazySegmentTree(vector<T>& v,T E0,int E1=0 ):E0(E0),E1(E1){\n n=1;\n int sz=v.size();\n while(n<sz)n<<=1;\n node.resize(2*n-1,E0);\n lazy.resize(2*n-1,E1);\n rep(i,sz)node[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i){\n node[i] = queryf(node[2*i+1],node[2*i+2]);\n }\n }\n\n void eval(int k,int l,int r){\n if(lazy[k]==E1)return ;\n calculatef(node[k], lazy[k], r-l);\n if(r-l>1){\n updatef(lazy[2*k+1], lazy[k]);\n updatef(lazy[2*k+2], lazy[k]);\n }\n lazy[k]=E1;\n }\n\n void update(int a, int b, int x,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return;\n if(a<=l&&r<=b){\n updatef(lazy[k], x);\n eval(k,l,r);\n }\n else {\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n node[k]=queryf(node[2*k+1], node[2*k+2]);\n }\n }\n\n T query(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0)r=n;\n eval(k,l,r);\n if(r<=a||b<=l)return E0;\n if(a<=l&&r<=b)return node[k];\n T xl=query(a,b,2*k+1,l,(l+r)/2);\n T xr=query(a,b,2*k+2,(l+r)/2,r);\n return queryf(xl, xr);\n }\n};\n\npair<ll,ll> fun(pair<ll,ll> p,pair<ll,ll>q){\n if(p.first<q.first)return p;\n if(p.first>q.first)return q;\n else return {p.first,p.second+q.second};\n}\npair<ll,ll> mul(pair<ll,ll> p,pair<ll,ll>q){\n return {p.first*q.first, p.second*q.second};\n}\n\n\nint main(){\n int h,w,q;\n cin>>h>>w>>q;\n vector<pair<ll,ll>> h1(h),h2(h),w1(w),w2(w);\n rep(i,h){\n cin>>h1[i].first;\n h2[i].first=-h1[i].first;\n h1[i].second=h2[i].second=1;\n } \n rep(i,w){\n cin>>w1[i].first;\n w2[i].first=-w1[i].first;\n w1[i].second=w2[i].second=1;\n } \n pair<ll,ll> e={longinf,1};\n LazySegmentTree<pair<ll,ll>> hmin(h1,e),hmax(h2,e),wmin(w1,e),wmax(w2,e);\n while(q--){\n int type;\n cin>>type;\n if(type==1){\n int a,b,c;\n cin>>a>>b>>c;\n hmin.update(a-1,b,c);\n hmax.update(a-1,b,-c);\n }\n else if(type==2){\n int a,b,c;\n cin>>a>>b>>c;\n wmin.update(a-1,b,c);\n wmax.update(a-1,b,-c);\n }\n else if(type==3){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n auto Hmin=hmin.query(a-1, b);\n auto Hmax=hmax.query(a-1, b);\n auto Wmin=wmin.query(c-1, d);\n auto Wmax=wmax.query(c-1, d);\n Hmax.first*=-1;\n Wmax.first*=-1;\n if(Hmin.second==b-a+1)Hmax={Hmin.first,0};\n if(Wmin.second==d-c+1)Wmax={Wmin.first,0};\n pair<ll,ll> ans={longinf,1};\n ans=fun(ans,mul(Hmin,Wmin));\n ans=fun(ans,mul(Hmax,Wmin));\n ans=fun(ans,mul(Hmin,Wmax));\n ans=fun(ans,mul(Hmax,Wmax));\n if(ans.first==0){\n ll cnth=0,cntw=0;\n if(Hmax.first==0)cnth=Hmax.second;\n if(Hmin.first==0)cnth=Hmin.second;\n if(Wmax.first==0)cntw=Wmax.second;\n if(Wmin.first==0)cntw=Wmin.second;\n ans.second=(ll)(d-c+1)*(b-a+1)-(b-a+1-cnth)*(d-c+1-cntw);\n }\n cout<<ans.first<<\" \"<<ans.second<<endl;\n }\n else if(type==4){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n auto Hmin=hmin.query(a-1, b);\n auto Hmax=hmax.query(a-1, b);\n auto Wmin=wmin.query(c-1, d);\n auto Wmax=wmax.query(c-1, d);\n Hmax.first*=-1;\n Wmin.first*=-1;\n if(Hmin.second==b-a+1)Hmax={Hmax.first,0};\n if(Wmin.second==d-c+1)Wmax={Wmax.first,0};\n pair<ll,ll> ans={longinf,1};\n ans=fun(ans,mul(Hmin,Wmin));\n ans=fun(ans,mul(Hmax,Wmin));\n ans=fun(ans,mul(Hmin,Wmax));\n ans=fun(ans,mul(Hmax,Wmax));\n if(ans.first==0){\n ll cnth=0,cntw=0;\n if(Hmax.first==0)cnth=Hmax.second;\n if(Hmin.first==0)cnth=Hmin.second;\n if(Wmax.first==0)cntw=Wmax.second;\n if(Wmin.first==0)cntw=Wmin.second;\n ans.second=(ll)(d-c+1)*(b-a+1)-(b-a+1-cnth)*(d-c+1-cntw);\n }\n cout<<-ans.first<<\" \"<<ans.second<<endl;\n }\n } \n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":28888,"score_of_the_acc":-1.8007,"final_rank":7},{"submission_id":"aoj_3035_3401776","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){}\n \n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n inline T reflect(int k){\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n inline void thrust(int k){\n for(int i=height;i;i--) eval(k>>i);\n }\n inline void recalc(int k){ \n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\n }\n void update(int a,int b,E x){\n thrust(a+=n);\n thrust(b+=n-1);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n recalc(a);\n recalc(b);\n }\n void set_val(int a,T x){\n thrust(a+=n);\n dat[a]=x;laz[a]=ei;\n recalc(a);\n }\n T query(int a,int b){\n thrust(a+=n);\n thrust(b+=n-1);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n struct T{\n Int w,x,y,z;\n T(Int w,Int x,Int y,Int z):w(w),x(x),y(y),z(z){}\n };\n \n auto f=[](T a,T b){\n Int cw=min(a.w,b.w);\n Int cx=(a.w==b.w?a.x+b.x:(a.w<b.w?a.x:b.x));\n Int cy=max(a.y,b.y);\n Int cz=(a.y==b.y?a.z+b.z:(a.y>b.y?a.z:b.z));\n return T(cw,cx,cy,cz);\n };\n auto g=[](T a,Int b){\n return T(a.w+b,a.x,a.y+b,a.z);\n };\n auto h=[](Int a,Int b){return a+b;};\n\n Int H,W,Q;\n scanf(\"%lld %lld %lld\",&H,&W,&Q);\n vector<T> A,B;\n for(Int i=0;i<H;i++){\n Int v;\n scanf(\"%lld\",&v);\n A.emplace_back(v,1,v,1);\n }\n for(Int i=0;i<W;i++){\n Int v;\n scanf(\"%lld\",&v);\n B.emplace_back(v,1,v,1);\n }\n \n const Int INF = 1e17;\n T ti(INF,0,-INF,0);\n SegmentTree<T, Int> segY(f,g,h,ti,0);\n SegmentTree<T, Int> segX(f,g,h,ti,0);\n segY.build(A);\n segX.build(B);\n\n auto calc=[](Int t,T a,T b,Int p,Int q){\n Int res=t==3?\n min({a.w*b.w,a.w*b.y,a.y*b.w,a.y*b.y}):\n max({a.w*b.w,a.w*b.y,a.y*b.w,a.y*b.y});\n Int cnt=0;\n Int n=p-(!a.w?a.x:!a.y?a.z:0ll);\n Int m=q-(!b.w?b.x:!b.y?b.z:0ll);\n if(res==0) cnt=p*q-n*m;\n else{\n if(a.w==a.y) a.z=0;\n if(b.w==b.y) b.z=0;\n if(res==a.w*b.w) cnt+=a.x*b.x;\n if(res==a.w*b.y) cnt+=a.x*b.z;\n if(res==a.y*b.w) cnt+=a.z*b.x;\n if(res==a.y*b.y) cnt+=a.z*b.z;\n }\n printf(\"%lld %lld\\n\",res,cnt);\n };\n \n for(Int i=0;i<Q;i++){\n Int t;\n scanf(\"%lld\",&t);\n if(t==1){\n Int a,b,v;\n scanf(\"%lld %lld %lld\",&a,&b,&v);\n segY.update(--a,b,v);\n }\n if(t==2){\n Int c,d,v;\n scanf(\"%lld %lld %lld\",&c,&d,&v);\n segX.update(--c,d,v);\n }\n if(t==3||t==4){\n Int a,b,c,d;\n scanf(\"%lld %lld %lld %lld\",&a,&b,&c,&d);\n T y=segY.query(--a,b);\n T x=segX.query(--c,d);\n calc(t,y,x,b-a,d-c);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":28896,"score_of_the_acc":-1.2837,"final_rank":3},{"submission_id":"aoj_3035_3203259","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n inline T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n inline void thrust(int k){\n for(int i=height;i;i--) eval(k>>i);\n }\n inline void recalc(int k){ \n while(k>>=1)\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\n }\n void update(int a,int b,E x){\n thrust(a+=n);\n thrust(b+=n-1);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n recalc(a);\n recalc(b);\n }\n void set_val(int a,T x){\n thrust(a+=n);\n dat[a]=x;laz[a]=ei;\n recalc(a);\n }\n T query(int a,int b){\n thrust(a+=n);\n thrust(b+=n-1);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n using T = tuple<Int, Int, Int, Int>;\n \n auto f=[](T a,T b){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n Int bw,bx,by,bz;\n tie(bw,bx,by,bz)=b;\n Int cw=min(aw,bw);\n Int cx=(aw==bw?ax+bx:(aw<bw?ax:bx));\n Int cy=max(ay,by);\n Int cz=(ay==by?az+bz:(ay>by?az:bz));\n return T(cw,cx,cy,cz);\n };\n auto g=[](T a,Int b){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n return T(aw+b,ax,ay+b,az);\n };\n auto h=[](Int a,Int b){return a+b;};\n\n Int H,W,Q;\n scanf(\"%lld %lld %lld\",&H,&W,&Q);\n vector<T> A,B;\n for(Int i=0;i<H;i++){\n Int v;\n scanf(\"%lld\",&v);\n A.emplace_back(v,1,v,1);\n }\n for(Int i=0;i<W;i++){\n Int v;\n scanf(\"%lld\",&v);\n B.emplace_back(v,1,v,1);\n }\n \n const Int INF = 1e17;\n T ti(INF,0,-INF,0);\n SegmentTree<T, Int> segY(H,f,g,h,ti,0);\n SegmentTree<T, Int> segX(W,f,g,h,ti,0);\n segY.build(H,A);\n segX.build(W,B);\n\n auto calc=[](Int t,T a,T b,Int p,Int q){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n Int bw,bx,by,bz;\n tie(bw,bx,by,bz)=b;\n Int res=t==3?\n min({aw*bw,aw*by,ay*bw,ay*by}):\n max({aw*bw,aw*by,ay*bw,ay*by});\n Int cnt=0;\n Int n=p-(!aw?ax:!ay?az:0ll);\n Int m=q-(!bw?bx:!by?bz:0ll);\n if(res==0) cnt=p*q-n*m;\n else{\n if(aw==ay) az=0;\n if(bw==by) bz=0;\n if(res==aw*bw) cnt+=ax*bx;\n if(res==aw*by) cnt+=ax*bz;\n if(res==ay*bw) cnt+=az*bx;\n if(res==ay*by) cnt+=az*bz;\n }\n printf(\"%lld %lld\\n\",res,cnt);\n };\n \n for(Int i=0;i<Q;i++){\n Int t;\n scanf(\"%lld\",&t);\n if(t==1){\n Int a,b,v;\n scanf(\"%lld %lld %lld\",&a,&b,&v);\n segY.update(--a,b,v);\n }\n if(t==2){\n Int c,d,v;\n scanf(\"%lld %lld %lld\",&c,&d,&v);\n segX.update(--c,d,v);\n }\n if(t==3||t==4){\n Int a,b,c,d;\n scanf(\"%lld %lld %lld %lld\",&a,&b,&c,&d);\n T y=segY.query(--a,b);\n T x=segX.query(--c,d);\n calc(t,y,x,b-a,d-c);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":31888,"score_of_the_acc":-1.3816,"final_rank":4},{"submission_id":"aoj_3035_3042312","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n typedef function<T(T,T)> F;\n typedef function<T(T,E)> G;\n typedef function<E(E,E)> H;\n typedef function<E(E,Int)> P;\n Int n;\n F f;\n G g;\n H h;\n T d1;\n E d0;\n P p;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(Int n_,F f,G g,H h,T d1,E d0,\n\t vector<T> v=vector<T>(),\n\t P p=[](E a,Int b){++b;return a;}):\n f(f),g(g),h(h),d1(d1),d0(d0),p(p){\n \n init(n_);\n if(n_==(Int)v.size()) build(n_,v);\n }\n void init(Int n_){\n n=1;\n while(n<n_) n*=2;\n dat.clear();\n dat.resize(2*n-1,d1);\n laz.clear();\n laz.resize(2*n-1,d0);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\n for(Int i=n-2;i>=0;i--)\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\n }\n inline void eval(Int len,Int k){\n if(laz[k]==d0) return;\n if(k*2+1<n*2-1){\n laz[k*2+1]=h(laz[k*2+1],laz[k]);\n laz[k*2+2]=h(laz[k*2+2],laz[k]);\n }\n dat[k]=g(dat[k],p(laz[k],len));\n laz[k]=d0;\n }\n T update(Int a,Int b,E x,Int k,Int l,Int r){\n eval(r-l,k);\n if(r<=a||b<=l) return dat[k];\n if(a<=l&&r<=b){\n laz[k]=h(laz[k],x);\n return g(dat[k],p(laz[k],r-l));\n }\n return dat[k]=f(update(a,b,x,k*2+1,l,(l+r)/2),\n\t\t update(a,b,x,k*2+2,(l+r)/2,r));\n }\n T update(Int a,Int b,E x){\n return update(a,b,x,0,0,n);\n }\n T query(Int a,Int b,Int k,Int l,Int r){\n eval(r-l,k);\n if(r<=a||b<=l) return d1;\n if(a<=l&&r<=b) return dat[k];\n T vl=query(a,b,k*2+1,l,(l+r)/2);\n T vr=query(a,b,k*2+2,(l+r)/2,r);\n return f(vl,vr);\n }\n T query(Int a,Int b){\n return query(a,b,0,0,n);\n }\n void update(Int k,T x){\n query(k,k+1);//evaluate\n k+=n-1;\n dat[k]=x;\n while(k){\n k=(k-1)/2;\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\n }\n }\n};\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n using T = tuple<Int, Int, Int, Int>;\n \n SegmentTree<T, Int>::F f=[](T a,T b){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n Int bw,bx,by,bz;\n tie(bw,bx,by,bz)=b;\n Int cw=min(aw,bw);\n Int cx=(aw==bw?ax+bx:(aw<bw?ax:bx));\n Int cy=max(ay,by);\n Int cz=(ay==by?az+bz:(ay>by?az:bz));\n return T(cw,cx,cy,cz);\n };\n \n SegmentTree<T, Int>::G g=[](T a,Int b){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n return T(aw+b,ax,ay+b,az);\n };\n\n SegmentTree<T, Int>::H h=[](Int a,Int b){\n return a+b;\n };\n\n Int H,W,Q;\n cin>>H>>W>>Q;\n vector<T> A,B;\n for(Int i=0;i<H;i++){\n Int v;\n cin>>v;\n A.emplace_back(v,1,v,1);\n }\n for(Int i=0;i<W;i++){\n Int v;\n cin>>v;\n B.emplace_back(v,1,v,1);\n }\n \n const Int INF = 1e17;\n T d1(INF,0,-INF,0);\n SegmentTree<T, Int> segY(H,f,g,h,d1,0,A);\n SegmentTree<T, Int> segX(W,f,g,h,d1,0,B);\n\n auto calc=[](Int t,T a,T b,Int p,Int q){\n Int aw,ax,ay,az;\n tie(aw,ax,ay,az)=a;\n Int bw,bx,by,bz;\n tie(bw,bx,by,bz)=b;\n Int res=t==3?\n min({aw*bw,aw*by,ay*bw,ay*by}):\n max({aw*bw,aw*by,ay*bw,ay*by});\n Int cnt=0;\n Int n=p-(!aw?ax:!ay?az:0ll);\n Int m=q-(!bw?bx:!by?bz:0ll);\n if(res==0) cnt=p*q-n*m;\n else{\n if(aw==ay) az=0;\n if(bw==by) bz=0;\n if(res==aw*bw) cnt+=ax*bx;\n if(res==aw*by) cnt+=ax*bz;\n if(res==ay*bw) cnt+=az*bx;\n if(res==ay*by) cnt+=az*bz;\n }\n \n cout<<res<<\" \"<<cnt<<endl;\n };\n \n for(Int i=0;i<Q;i++){\n Int t;\n cin>>t;\n if(t==1){\n Int a,b,v;\n cin>>a>>b>>v;\n segY.update(--a,b,v);\n }\n if(t==2){\n Int c,d,v;\n cin>>c>>d>>v;\n segX.update(--c,d,v);\n }\n if(t==3||t==4){\n Int a,b,c,d;\n cin>>a>>b>>c>>d;\n T y=segY.query(--a,b);\n T x=segX.query(--c,d);\n calc(t,y,x,b-a,d-c);\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":34980,"score_of_the_acc":-1.7931,"final_rank":6},{"submission_id":"aoj_3035_2927603","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld =long double;\nconst ld eps = 1e-9;\n\n#define Seg_Max_N (1<<18) \n\nstruct aa {\n\tlong long int amin;\n\tlong long int min_num;\n\n\tlong long int amax;\n\tlong long int max_num;\n};\n\ntypedef aa Value1;\ntypedef long long int Value2;\nconst Value1 Zero1 = aa{ 0,1,0,1 };\nconst Value2 Zero2 =0;\n\nstruct Node {\n\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\n\tValue2 lazy;\t//遅延されている値を保存している\n\tNode() :sum(Zero1) {\n\t\tlazy = Zero2;\n\t}\n};\nstruct lazy_segtree {\n\tint N;\n\tvector<Node>dat;\n\tlazy_segtree(int n) :N(1) {\n\t\twhile (N < n) N *= 2;\n\t\tdat.resize(2 * N);\n\t}\n\n\tValue2 lazy_connect(const Value2 l, const Value2 r) {\n\t\treturn l+r;\n\t}\n\n\tvoid lazy_func(const int k, const int a, const int b) {\n\t\t\n\t\tdat[k].sum.amin += dat[k].lazy;\n\t\tdat[k].sum.amax+=dat[k].lazy;\n\t\t\n\t}\n\n\tValue1 connect(const Value1 l, const Value1 r) {\n\t\taa naa;\n\t\tif (l.amin == r.amin) {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num + r.min_num;\n\t\t}\n\t\telse if (l.amin > r.amin) {\n\t\t\tnaa.amin = r.amin;\n\t\t\tnaa.min_num = r.min_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num;\n\t\t}\n\n\t\tif (l.amax == r.amax) {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num + r.max_num;\n\t\t}\n\t\telse if (l.amax < r.amax) {\n\t\t\tnaa.amax = r.amax;\n\t\t\tnaa.max_num = r.max_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num;\n\t\t}\n\t\treturn naa;\n\t}\n\n\t// inlineつけないと大変なことになるよ!(遅い)\n\tinline void lazy_evaluate_node(int k, int a, int b) {\n\t\tlazy_func(k, a, b);\n\t\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\n\t\t\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\t//次は君が伝搬してね☆って感じ.\n\t\t\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\n\t\t}\n\t\tdat[k].lazy = Zero2;\n\t}\n\n\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\n\t\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\n\n\t}\n\n\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\n\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\t\tif (l < 0 || r < 0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); \t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn;\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\n\t\t\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\n\t\t\treturn;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tupdate(l, r, v, 2 * k, a, m);\n\t\tupdate(l, r, v, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t}\n\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\n\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\n\t\tif (l < 0 || r<0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\n\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\treturn dat[k].sum;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tValue1 vl = get(l, r, 2 * k, a, m);\n\t\tValue1 vr = get(l, r, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t\treturn connect(vl, vr);\n\t}\n};\n\nint main()\n{\n\tint H,W,Q;cin>>H>>W>>Q;\n\tvector<int>as(H),bs(W);\n\tfor(int i=0;i<H;++i)cin>>as[i];\n\tfor(int i=0;i<W;++i)cin>>bs[i];\n\tlazy_segtree aseg(H),bseg(W);\n\tfor (int i = 0; i < H; ++i) {\n\t\taseg.update(i,i+1, as[i]);\n\t}\n\tfor (int i = 0; i < W; ++i) {\n\t\tbseg.update(i,i+1, bs[i]);\n\t}\n\twhile (Q--) {\n\t\tint type;cin>>type;\n\t\tif (type == 1) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\taseg.update(a,b,x);\n\t\t}\n\t\telse if (type == 2) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\tbseg.update(a,b,x);\n\t\t}\n\t\telse {\n\t\t\tint a,b,c,d;cin>>a>>b>>c>>d;\n\t\t\ta--;c--;\n\t\t\tauto a_aa=aseg.get(a,b);\n\t\t\tauto b_aa=bseg.get(c,d);\n\n\t\t\tmap<long long int,long long int>mp;\n\n\t\t\tif (a_aa.amin != a_aa.amax) {\n\t\t\t\tif (b_aa.amin != b_aa.amax) {\n\n\t\t\t\t\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\n\t\t\t\t\tmp[a_aa.amax*b_aa.amin] += a_aa.max_num*b_aa.min_num;\n\t\t\t\t\tmp[a_aa.amin*b_aa.amax] += a_aa.min_num*b_aa.max_num;\n\t\t\t\t\tmp[a_aa.amax*b_aa.amax] += a_aa.max_num*b_aa.max_num;\n\t\t\t\t}\n\t\t\t\telse {\n\n\t\t\t\t\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\n\t\t\t\t\tmp[a_aa.amax*b_aa.amin] += a_aa.max_num*b_aa.min_num;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (b_aa.amin != b_aa.amax) {\n\n\t\t\t\t\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\n\t\t\t\t\tmp[a_aa.amin*b_aa.amax] += a_aa.min_num*b_aa.max_num;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tauto it=mp.begin();\n\t\t\tauto jt=prev(mp.end());\n\n\t\t\tif (type == 3) {\n\t\t\t\tlong long int ans_num,ans_cnt;\n\t\t\t\tif (it->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt=(d-c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if(b_aa.amin==0){\n\t\t\t\t\t\tans_cnt=(b-a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin,a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num,a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt=it->second;\n\t\t\t\t}\n\t\t\t\tcout<<it->first<<\" \"<<ans_cnt<<endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlong long int ans_num, ans_cnt;\n\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\tswap(b_aa.min_num,b_aa.max_num);\n\t\t\t\tif (jt->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin, a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num, a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin, b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt = jt->second;\n\t\t\t\t}\n\t\t\t\tcout << jt->first << \" \" << ans_cnt << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":290,"memory_kb":23944,"score_of_the_acc":-1.57,"final_rank":5},{"submission_id":"aoj_3035_2927600","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld =long double;\nconst ld eps = 1e-9;\n\n#define Seg_Max_N (1<<18) \n\nstruct aa {\n\tlong long int amin;\n\tlong long int min_num;\n\n\tlong long int amax;\n\tlong long int max_num;\n};\n\ntypedef aa Value1;\ntypedef long long int Value2;\nconst Value1 Zero1 = aa{ 0,1,0,1 };\nconst Value2 Zero2 =0;\n\nstruct Node {\n\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\n\tValue2 lazy;\t//遅延されている値を保存している\n\tNode() :sum(Zero1) {\n\t\tlazy = Zero2;\n\t}\n};\nstruct lazy_segtree {\n\tint N;\n\tvector<Node>dat;\n\tlazy_segtree(int n) :N(1) {\n\t\twhile (N < n) N *= 2;\n\t\tdat.resize(2 * N);\n\t}\n\n\tValue2 lazy_connect(const Value2 l, const Value2 r) {\n\t\treturn l+r;\n\t}\n\n\tvoid lazy_func(const int k, const int a, const int b) {\n\t\t\n\t\tdat[k].sum.amin += dat[k].lazy;\n\t\tdat[k].sum.amax+=dat[k].lazy;\n\t\t\n\t}\n\n\tValue1 connect(const Value1 l, const Value1 r) {\n\t\taa naa;\n\t\tif (l.amin == r.amin) {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num + r.min_num;\n\t\t}\n\t\telse if (l.amin > r.amin) {\n\t\t\tnaa.amin = r.amin;\n\t\t\tnaa.min_num = r.min_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num;\n\t\t}\n\n\t\tif (l.amax == r.amax) {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num + r.max_num;\n\t\t}\n\t\telse if (l.amax < r.amax) {\n\t\t\tnaa.amax = r.amax;\n\t\t\tnaa.max_num = r.max_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num;\n\t\t}\n\t\treturn naa;\n\t}\n\n\t// inlineつけないと大変なことになるよ!(遅い)\n\tinline void lazy_evaluate_node(int k, int a, int b) {\n\t\tlazy_func(k, a, b);\n\t\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\n\t\t\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\t//次は君が伝搬してね☆って感じ.\n\t\t\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\n\t\t}\n\t\tdat[k].lazy = Zero2;\n\t}\n\n\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\n\t\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\n\n\t}\n\n\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\n\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\t\tif (l < 0 || r < 0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); \t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn;\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\n\t\t\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\n\t\t\treturn;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tupdate(l, r, v, 2 * k, a, m);\n\t\tupdate(l, r, v, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t}\n\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\n\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\n\t\tif (l < 0 || r<0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\n\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\treturn dat[k].sum;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tValue1 vl = get(l, r, 2 * k, a, m);\n\t\tValue1 vr = get(l, r, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t\treturn connect(vl, vr);\n\t}\n};\n\nint main()\n{\n\tint H,W,Q;cin>>H>>W>>Q;\n\tvector<int>as(H),bs(W);\n\tfor(int i=0;i<H;++i)cin>>as[i];\n\tfor(int i=0;i<W;++i)cin>>bs[i];\n\tlazy_segtree aseg(H),bseg(W);\n\tfor (int i = 0; i < H; ++i) {\n\t\taseg.update(i,i+1, as[i]);\n\t}\n\tfor (int i = 0; i < W; ++i) {\n\t\tbseg.update(i,i+1, bs[i]);\n\t}\n\twhile (Q--) {\n\t\tint type;cin>>type;\n\t\tif (type == 1) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\taseg.update(a,b,x);\n\t\t}\n\t\telse if (type == 2) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\tbseg.update(a,b,x);\n\t\t}\n\t\telse {\n\t\t\tint a,b,c,d;cin>>a>>b>>c>>d;\n\t\t\ta--;c--;\n\t\t\tauto a_aa=aseg.get(a,b);\n\t\t\tauto b_aa=bseg.get(c,d);\n\n\t\t\tmap<long long int,long long int>mp;\n\t\t\tmp[a_aa.amin*b_aa.amin]=a_aa.min_num*b_aa.min_num;\n\t\t\tmp[a_aa.amax*b_aa.amin]=a_aa.max_num*b_aa.min_num;\n\t\t\tmp[a_aa.amin*b_aa.amax]=a_aa.min_num*b_aa.max_num;\n\t\t\tmp[a_aa.amax*b_aa.amax]=a_aa.max_num*b_aa.max_num;\n\n\t\t\tauto it=mp.begin();\n\t\t\tauto jt=prev(mp.end());\n\n\t\t\tif (type == 3) {\n\t\t\t\tlong long int ans_num,ans_cnt;\n\t\t\t\tif (it->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt=(d-c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if(b_aa.amin==0){\n\t\t\t\t\t\tans_cnt=(b-a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin,a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num,a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt=it->second;\n\t\t\t\t}\n\t\t\t\tcout<<it->first<<\" \"<<ans_cnt<<endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlong long int ans_num, ans_cnt;\n\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\tswap(b_aa.min_num,b_aa.max_num);\n\t\t\t\tif (jt->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin, a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num, a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin, b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt = jt->second;\n\t\t\t\t}\n\t\t\t\tcout << jt->first << \" \" << ans_cnt << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.4827586206896552,"time_ms":20,"memory_kb":4416,"score_of_the_acc":-0.0001,"final_rank":10},{"submission_id":"aoj_3035_2927594","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld =long double;\nconst ld eps = 1e-9;\n\n#define Seg_Max_N (1<<18) \n\nstruct aa {\n\tlong long int amin;\n\tlong long int min_num;\n\n\tlong long int amax;\n\tlong long int max_num;\n};\n\ntypedef aa Value1;\ntypedef int Value2;\nconst Value1 Zero1 = aa{ 0,1,0,1 };\nconst Value2 Zero2 =0;\n\nstruct Node {\n\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\n\tValue2 lazy;\t//遅延されている値を保存している\n\tNode() :sum(Zero1) {\n\t\tlazy = Zero2;\n\t}\n};\nstruct lazy_segtree {\n\tint N;\n\tvector<Node>dat;\n\tlazy_segtree(int n) :N(1) {\n\t\twhile (N < n) N *= 2;\n\t\tdat.resize(2 * N);\n\t}\n\n\tValue2 lazy_connect(const Value2 l, const Value2 r) {\n\t\treturn l+r;\n\t}\n\n\tvoid lazy_func(const int k, const int a, const int b) {\n\t\t\n\t\tdat[k].sum.amin += dat[k].lazy;\n\t\tdat[k].sum.amax+=dat[k].lazy;\n\t\t\n\t}\n\n\tValue1 connect(const Value1 l, const Value1 r) {\n\t\taa naa;\n\t\tif (l.amin == r.amin) {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num + r.min_num;\n\t\t}\n\t\telse if (l.amin > r.amin) {\n\t\t\tnaa.amin = r.amin;\n\t\t\tnaa.min_num = r.min_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amin = l.amin;\n\t\t\tnaa.min_num = l.min_num;\n\t\t}\n\n\t\tif (l.amax == r.amax) {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num + r.max_num;\n\t\t}\n\t\telse if (l.amax < r.amax) {\n\t\t\tnaa.amax = r.amax;\n\t\t\tnaa.max_num = r.max_num;\n\t\t}\n\t\telse {\n\t\t\tnaa.amax = l.amax;\n\t\t\tnaa.max_num = l.max_num;\n\t\t}\n\t\treturn naa;\n\t}\n\n\t// inlineつけないと大変なことになるよ!(遅い)\n\tinline void lazy_evaluate_node(int k, int a, int b) {\n\t\tlazy_func(k, a, b);\n\t\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\n\t\t\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\t//次は君が伝搬してね☆って感じ.\n\t\t\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\n\t\t}\n\t\tdat[k].lazy = Zero2;\n\t}\n\n\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\n\t\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\n\n\t}\n\n\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\n\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\t\tif (l < 0 || r < 0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); \t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn;\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\n\t\t\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\n\t\t\treturn;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tupdate(l, r, v, 2 * k, a, m);\n\t\tupdate(l, r, v, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t}\n\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\n\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\n\t\tif (b == -1)b = N;\n\n\t\tif (l < 0 || r<0)assert(false);\n\t\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n\n\t\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\n\t\t\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\n\n\t\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\n\t\t\treturn dat[k].sum;\n\t\t}\n\n\t\tint m = (a + b) / 2;\n\t\tValue1 vl = get(l, r, 2 * k, a, m);\n\t\tValue1 vr = get(l, r, 2 * k + 1, m, b);\n\t\tupdate_node(k);\n\t\treturn connect(vl, vr);\n\t}\n};\n\nint main()\n{\n\tint H,W,Q;cin>>H>>W>>Q;\n\tvector<int>as(H),bs(W);\n\tfor(int i=0;i<H;++i)cin>>as[i];\n\tfor(int i=0;i<W;++i)cin>>bs[i];\n\tlazy_segtree aseg(H),bseg(W);\n\tfor (int i = 0; i < H; ++i) {\n\t\taseg.update(i,i+1, as[i]);\n\t}\n\tfor (int i = 0; i < W; ++i) {\n\t\tbseg.update(i,i+1, bs[i]);\n\t}\n\twhile (Q--) {\n\t\tint type;cin>>type;\n\t\tif (type == 1) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\taseg.update(a,b,x);\n\t\t}\n\t\telse if (type == 2) {\n\t\t\tint a,b,x;cin>>a>>b>>x;a--;\n\t\t\tbseg.update(a,b,x);\n\t\t}\n\t\telse {\n\t\t\tint a,b,c,d;cin>>a>>b>>c>>d;\n\t\t\ta--;c--;\n\t\t\tauto a_aa=aseg.get(a,b);\n\t\t\tauto b_aa=bseg.get(c,d);\n\n\t\t\tmap<long long int,long long int>mp;\n\t\t\tmp[a_aa.amin*b_aa.amin]=a_aa.min_num*b_aa.min_num;\n\t\t\tmp[a_aa.amax*b_aa.amin]=a_aa.max_num*b_aa.min_num;\n\t\t\tmp[a_aa.amin*b_aa.amax]=a_aa.min_num*b_aa.max_num;\n\t\t\tmp[a_aa.amax*b_aa.amax]=a_aa.max_num*b_aa.max_num;\n\n\t\t\tauto it=mp.begin();\n\t\t\tauto jt=prev(mp.end());\n\n\t\t\tif (type == 3) {\n\t\t\t\tlong long int ans_num,ans_cnt;\n\t\t\t\tif (it->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt=(d-c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if(b_aa.amin==0){\n\t\t\t\t\t\tans_cnt=(b-a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin,a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num,a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt=it->second;\n\t\t\t\t}\n\t\t\t\tcout<<it->first<<\" \"<<ans_cnt<<endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlong long int ans_num, ans_cnt;\n\t\t\t\tswap(b_aa.amin,b_aa.amax);\n\t\t\t\tswap(b_aa.min_num,b_aa.max_num);\n\t\t\t\tif (jt->first == 0) {\n\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tswap(a_aa.amin, a_aa.amax);\n\t\t\t\t\t\tswap(a_aa.min_num, a_aa.max_num);\n\t\t\t\t\t\tswap(b_aa.amin, b_aa.amax);\n\t\t\t\t\t\tswap(b_aa.min_num, b_aa.max_num);\n\n\t\t\t\t\t\tif (a_aa.amin == 0 && b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (a_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (d - c)*a_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (b_aa.amin == 0) {\n\t\t\t\t\t\t\tans_cnt = (b - a)*b_aa.min_num;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tassert(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans_cnt = jt->second;\n\t\t\t\t}\n\t\t\t\tcout << jt->first << \" \" << ans_cnt << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.4827586206896552,"time_ms":20,"memory_kb":4412,"score_of_the_acc":0,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_3035_10322807\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long;\\n\\n#include<atcoder/lazysegtree>\\nusing namespace atcoder;\\n\\nstruct S{\\n\\tll v,n;\\n};\\n\\nS opm(S a,S b){\\n\\tif(a.v==b.v){\\n\\t\\ta.n+=b.n;\\n\\t\\treturn a;\\n\\t}\\n\\telse if(a.v<b.v)return a;\\n\\telse return b;\\n}\\nS em(){return {ll(1e18),0};}\\nS opM(S a,S b){\\n\\tif(a.v==b.v){\\n\\t\\ta.n+=b.n;\\n\\t\\treturn a;\\n\\t}\\n\\telse if(a.v>b.v)return a;\\n\\telse return b;\\n}\\nS eM(){return {ll(-1e18),0};}\\nS mapping(ll a,S b){\\n\\tb.v+=a;\\n\\treturn b;\\n}\\nll add(ll a,ll b){return a+b;}\\nll id(){return 0;}\\n\\n\\nint main(){\\n\\t\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tll H,W,Q;\\n\\tcin>>H>>W>>Q;\\n\\tvector<S> A(H),B(W);\\n\\tfor(int i=0;i<H;i++){\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tA[i]={a,1};\\n\\t}\\n\\tfor(int i=0;i<W;i++){\\n\\t\\tll a;\\n\\t\\tcin>>a;\\n\\t\\tB[i]={a,1};\\n\\t}\\n\\tlazy_segtree<S,opm,em,ll,mapping,add,id> segmA(A),segmB(B);\\n\\tlazy_segtree<S,opM,eM,ll,mapping,add,id> segMA(A),segMB(B);\\n\\tfor(int q=0;q<Q;q++){\\n\\t\\tint t,a,b;\\n\\t\\tcin>>t>>a>>b;\\n\\t\\tif(t==1){\\n\\t\\t\\tll v;\\n\\t\\t\\tcin>>v;\\n\\t\\t\\ta--;\\n\\t\\t\\tsegmA.apply(a,b,v);\\n\\t\\t\\tsegMA.apply(a,b,v);\\n\\t\\t}\\n\\t\\telse if(t==2){\\n\\t\\t\\tll v;\\n\\t\\t\\tcin>>v;\\n\\t\\t\\ta--;\\n\\t\\t\\tsegmB.apply(a,b,v);\\n\\t\\t\\tsegMB.apply(a,b,v);\\n\\t\\t}\\n\\t\\telse if(t==3){\\n\\t\\t\\tint c,d;\\n\\t\\t\\tcin>>c>>d;\\n\\t\\t\\ta--,c--;\\n\\t\\t\\tll an=1e18,num=0;\\n\\t\\t\\tfor(int i:{0,1}){\\n\\t\\t\\t\\tif(i==1&&segmA.prod(a,b).v==segMA.prod(a,b).v)continue;\\n\\t\\t\\t\\tfor(int j:{0,1}){\\n\\t\\t\\t\\t\\tif(j==1&&segmB.prod(c,d).v==segMB.prod(c,d).v)continue;\\n\\t\\t\\t\\t\\tS P,Q;\\n\\t\\t\\t\\t\\tif(i)P=segmA.prod(a,b);\\n\\t\\t\\t\\t\\telse P=segMA.prod(a,b);\\n\\t\\t\\t\\t\\tif(j)Q=segmB.prod(c,d);\\n\\t\\t\\t\\t\\telse Q=segMB.prod(c,d);\\n\\t\\t\\t\\t\\tif(P.v*Q.v<an){\\n\\t\\t\\t\\t\\t\\tan=P.v*Q.v;\\n\\t\\t\\t\\t\\t\\tnum=0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(P.v*Q.v==an){\\n\\t\\t\\t\\t\\t\\tnum+=P.n*Q.n;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(an==0){\\n\\t\\t\\t\\tll s=b-a,t=d-c;\\n\\t\\t\\t\\tif(segmA.prod(a,b).v==0)s-=segmA.prod(a,b).n;\\n\\t\\t\\t\\telse if(segMA.prod(a,b).v==0)s-=segMA.prod(a,b).n;\\n\\t\\t\\t\\tif(segmB.prod(c,d).v==0)t-=segmB.prod(c,d).n;\\n\\t\\t\\t\\telse if(segMB.prod(c,d).v==0)t-=segMB.prod(c,d).n;\\n\\t\\t\\t\\tnum=ll(b-a)*ll(d-c)-s*t;\\n\\t\\t\\t}\\n\\t\\t\\tcout<<an<<\\\" \\\"<<num<<endl;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tint c,d;\\n\\t\\t\\tcin>>c>>d;\\n\\t\\t\\ta--,c--;\\n\\t\\t\\tll an=-1e18,num=0;\\n\\t\\t\\tfor(int i:{0,1}){\\n\\t\\t\\t\\tif(i==1&&segmA.prod(a,b).v==segMA.prod(a,b).v)continue;\\n\\t\\t\\t\\tfor(int j:{0,1}){\\n\\t\\t\\t\\t\\tif(j==1&&segmB.prod(c,d).v==segMB.prod(c,d).v)continue;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tS P,Q;\\n\\t\\t\\t\\t\\tif(i)P=segmA.prod(a,b);\\n\\t\\t\\t\\t\\telse P=segMA.prod(a,b);\\n\\t\\t\\t\\t\\tif(j)Q=segmB.prod(c,d);\\n\\t\\t\\t\\t\\telse Q=segMB.prod(c,d);\\n\\t\\t\\t\\t\\t// cout<<P.v<<\\\"m\\\"<<P.n<<\\\" \\\"<<Q.v<<\\\" \\\"<<Q.n<<endl;\\n\\t\\t\\t\\t\\tif(P.v*Q.v>an){\\n\\t\\t\\t\\t\\t\\tan=P.v*Q.v;\\n\\t\\t\\t\\t\\t\\tnum=0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(P.v*Q.v==an){\\n\\t\\t\\t\\t\\t\\tnum+=P.n*Q.n;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(an==0){\\n\\t\\t\\t\\tll s=b-a,t=d-c;\\n\\t\\t\\t\\tif(segmA.prod(a,b).v==0)s-=segmA.prod(a,b).n;\\n\\t\\t\\t\\telse if(segMA.prod(a,b).v==0)s-=segMA.prod(a,b).n;\\n\\t\\t\\t\\tif(segmB.prod(c,d).v==0)t-=segmB.prod(c,d).n;\\n\\t\\t\\t\\telse if(segMB.prod(c,d).v==0)t-=segMB.prod(c,d).n;\\n\\t\\t\\t\\tnum=ll(b-a)*ll(d-c)-s*t;\\n\\t\\t\\t}\\n\\t\\t\\tcout<<an<<\\\" \\\"<<num<<endl;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 26604,\n \"score_of_the_acc\": -1.1398,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3035_9595724\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n\\nusing namespace std;\\nconst int N = 1e5 + 10;\\nconst int INF = 1e9 + 7;\\n\\nstruct Node {\\n int mn, mx, cmn, cmx;\\n Node() {\\n mn = INF, mx = -INF, cmn = 0, cmx = 0;\\n }\\n Node(int x) {\\n mn = mx = x, cmn = cmx = 1;\\n }\\n};\\n\\nNode mrg(Node t1, Node t2) {\\n Node ans;\\n\\n if(t1.mn < t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn;\\n else if(t1.mn == t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn + t2.cmn;\\n else ans.mn = t2.mn, ans.cmn = t2.cmn;\\n\\n if(t1.mx > t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx;\\n else if(t1.mx == t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx + t2.cmx;\\n else ans.mx = t2.mx, ans.cmx = t2.cmx;\\n\\n return ans;\\n}\\n\\nstruct SegTree {\\n vector<Node> tree;\\n vector<int> d;\\n\\n SegTree() {\\n tree.resize(N * 4, Node());\\n d.resize(N * 4, 0);\\n }\\n\\n void build(int tind, int l, int r, vector<int> &a) {\\n if(r - l == 1) {\\n tree[tind] = Node(a[l]);\\n return;\\n }\\n int m = (r + l) >> 1;\\n build(tind * 2 + 1, l, m, a);\\n build(tind * 2 + 2, m, r, a);\\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\\n }\\n\\n void push(int tind, int l, int r) {\\n if(d[tind] == 0) return;\\n tree[tind].mn += d[tind], tree[tind].mx += d[tind];\\n if(r - l > 1) {\\n d[tind * 2 + 1] += d[tind];\\n d[tind * 2 + 2] += d[tind];\\n }\\n d[tind] = 0;\\n }\\n\\n void upd(int tind, int l, int r, int ql, int qr, int x) {\\n push(tind, l, r);\\n if(ql <= l && r <= qr) {\\n d[tind] += x;\\n push(tind, l, r);\\n return;\\n }\\n if(ql >= r || l >= qr) return;\\n int m = (r + l) >> 1;\\n upd(tind * 2 + 1, l, m, ql, qr, x);\\n upd(tind * 2 + 2, m, r, ql, qr, x);\\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\\n }\\n\\n Node get(int tind, int l, int r, int ql, int qr) {\\n push(tind, l, r);\\n if(ql <= l && r <= qr) return tree[tind];\\n if(ql >= r || l >= qr) return Node();\\n int m = (r + l) >> 1;\\n return mrg(get(tind * 2 + 1, l, m, ql, qr), get(tind * 2 + 2, m, r, ql, qr));\\n }\\n};\\n\\nsigned main() {\\n#ifdef LOCAL\\n freopen(\\\"inp.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"out.txt\\\", \\\"w\\\", stdout);\\n#endif\\n int h, w, q;\\n cin >> h >> w >> q;\\n vector<int> a(h), b(w);\\n for(int i = 0; i < h; ++i) cin >> a[i];\\n for(int i = 0; i < w; ++i) cin >> b[i];\\n SegTree A, B;\\n A.build(0, 0, h, a);\\n B.build(0, 0, w, b);\\n\\n while(q--) {\\n int t;\\n cin >> t;\\n if(t == 1) {\\n int l, r, v;\\n cin >> l >> r >> v;\\n A.upd(0, 0, h, l - 1, r, v);\\n } else if(t == 2) {\\n int l, r, v;\\n cin >> l >> r >> v;\\n B.upd(0, 0, w, l - 1, r, v);\\n } else if(t == 3) {\\n int l1, r1, l2, r2;\\n cin >> l1 >> r1 >> l2 >> r2;\\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\\n long long v1 = 1LL * t1.mx * t2.mn;\\n long long v2 = 1LL * t1.mn * t2.mx;\\n long long v3 = 1LL * t1.mn * t2.mn;\\n long long v4 = 1LL * t1.mx * t2.mx;\\n long long ans = min(min(v1, v2), min(v3, v4));\\n long long cnt = 0;\\n if(ans == 0) {\\n int c10 = 0, c20 = 0;\\n if(t1.mn == 0) c10 = t1.cmn;\\n if(t1.mx == 0) c10 = t1.cmx;\\n if(t2.mn == 0) c20 = t2.cmn;\\n if(t2.mx == 0) c20 = t2.cmx;\\n cnt += 1LL * c10 * (r2 - l2 + 1);\\n cnt += 1LL * c20 * (r1 - l1 + 1);\\n cnt -= 1LL * c10 * c20;\\n } else {\\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\\n if(t1.mx == t1.mn) cnt /= 2;\\n if(t2.mn == t2.mx) cnt /= 2;\\n }\\n cout << ans << \\\" \\\" << cnt << \\\"\\\\n\\\";\\n } else if(t == 4) {\\n int l1, r1, l2, r2;\\n cin >> l1 >> r1 >> l2 >> r2;\\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\\n long long v1 = 1LL * t1.mx * t2.mn;\\n long long v2 = 1LL * t1.mn * t2.mx;\\n long long v3 = 1LL * t1.mn * t2.mn;\\n long long v4 = 1LL * t1.mx * t2.mx;\\n long long ans = max(max(v1, v2), max(v3, v4));\\n long long cnt = 0;\\n if(ans == 0) {\\n int c10 = 0, c20 = 0;\\n if(t1.mn == 0) c10 = t1.cmn;\\n if(t1.mx == 0) c10 = t1.cmx;\\n if(t2.mn == 0) c20 = t2.cmn;\\n if(t2.mx == 0) c20 = t2.cmx;\\n cnt += 1LL * c10 * (r2 - l2 + 1);\\n cnt += 1LL * c20 * (r1 - l1 + 1);\\n cnt -= 1LL * c10 * c20;\\n } else {\\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\\n if(t1.mx == t1.mn) cnt /= 2;\\n if(t2.mn == t2.mx) cnt /= 2;\\n }\\n cout << ans << \\\" \\\" << cnt << \\\"\\\\n\\\";\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 19484,\n \"score_of_the_acc\": -1.0448,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3035_9595712\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n\\nusing namespace std;\\nconst int N = 1e5 + 10;\\nconst int INF = 1e9 + 7;\\n\\nstruct Node {\\n int mn, mx, cmn, cmx;\\n Node() {\\n mn = INF, mx = -INF, cmn = 0, cmx = 0;\\n }\\n Node(int x) {\\n mn = mx = x, cmn = cmx = 1;\\n }\\n};\\n\\nNode mrg(Node t1, Node t2) {\\n Node ans;\\n\\n if(t1.mn < t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn;\\n else if(t1.mn == t2.mn) ans.mn = t1.mn, ans.cmn = t1.cmn + t2.cmn;\\n else ans.mn = t2.mn, ans.cmn = t2.cmn;\\n\\n if(t1.mx > t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx;\\n else if(t1.mx == t2.mx) ans.mx = t1.mx, ans.cmx = t1.cmx + t2.cmx;\\n else ans.mx = t2.mx, ans.cmx = t2.cmx;\\n\\n return ans;\\n}\\n\\nstruct SegTree {\\n vector<Node> tree;\\n vector<int> d;\\n\\n SegTree() {\\n tree.resize(N * 4, Node());\\n d.resize(N * 4, 0);\\n }\\n\\n void build(int tind, int l, int r, vector<int> &a) {\\n if(r - l == 1) {\\n tree[tind] = Node(a[l]);\\n return;\\n }\\n int m = (r + l) >> 1;\\n build(tind * 2 + 1, l, m, a);\\n build(tind * 2 + 2, m, r, a);\\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\\n }\\n\\n void push(int tind, int l, int r) {\\n if(d[tind] == 0) return;\\n tree[tind].mn += d[tind], tree[tind].mx += d[tind];\\n if(r - l > 1) {\\n d[tind * 2 + 1] += d[tind];\\n d[tind * 2 + 2] += d[tind];\\n }\\n d[tind] = 0;\\n }\\n\\n void upd(int tind, int l, int r, int ql, int qr, int x) {\\n push(tind, l, r);\\n if(ql <= l && r <= qr) {\\n d[tind] += x;\\n push(tind, l, r);\\n return;\\n }\\n if(ql >= r || l >= qr) return;\\n int m = (r + l) >> 1;\\n upd(tind * 2 + 1, l, m, ql, qr, x);\\n upd(tind * 2 + 2, m, r, ql, qr, x);\\n tree[tind] = mrg(tree[tind * 2 + 1], tree[tind * 2 + 2]);\\n }\\n\\n Node get(int tind, int l, int r, int ql, int qr) {\\n push(tind, l, r);\\n if(ql <= l && r <= qr) return tree[tind];\\n if(ql >= r || l >= qr) return Node();\\n int m = (r + l) >> 1;\\n return mrg(get(tind * 2 + 1, l, m, ql, qr), get(tind * 2 + 2, m, r, ql, qr));\\n }\\n};\\n\\nsigned main() {\\n#ifdef LOCAL\\n freopen(\\\"inp.txt\\\", \\\"r\\\", stdin);\\n freopen(\\\"out.txt\\\", \\\"w\\\", stdout);\\n#endif\\n int h, w, q;\\n cin >> h >> w >> q;\\n vector<int> a(h), b(w);\\n for(int i = 0; i < h; ++i) cin >> a[i];\\n for(int i = 0; i < w; ++i) cin >> b[i];\\n SegTree A, B;\\n A.build(0, 0, h, a);\\n B.build(0, 0, w, b);\\n\\n while(q--) {\\n int t;\\n cin >> t;\\n if(t == 1) {\\n int l, r, v;\\n cin >> l >> r >> v;\\n A.upd(0, 0, h, l - 1, r, v);\\n } else if(t == 2) {\\n int l, r, v;\\n cin >> l >> r >> v;\\n B.upd(0, 0, w, l - 1, r, v);\\n } else if(t == 3) {\\n int l1, r1, l2, r2;\\n cin >> l1 >> r1 >> l2 >> r2;\\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\\n long long v1 = 1LL * t1.mx * t2.mn;\\n long long v2 = 1LL * t1.mn * t2.mx;\\n long long v3 = 1LL * t1.mn * t2.mn;\\n long long v4 = 1LL * t1.mx * t2.mx;\\n long long ans = min(min(v1, v2), min(v3, v4));\\n long long cnt = 0;\\n if(ans == 0) {\\n if(t1.mn == 0) cnt += 1LL * t1.cmn * (r2 - l2 + 1);\\n if(t1.mx == 0) cnt += 1LL * t1.cmx * (r2 - l2 + 1);\\n if(t2.mn == 0) {\\n cnt += 1LL * t2.cmn * (r1 - l1 + 1);\\n cnt -= (t1.mn == 0) + (t1.mx == 0);\\n }\\n if(t2.mx == 0) {\\n cnt += 1LL * t2.cmx * (r1 - l1 + 1);\\n cnt -= (t1.mn == 0) + (t1.mx == 0);\\n }\\n } else {\\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\\n }\\n if(t1.mx == t1.mn) cnt /= 2;\\n if(t2.mn == t2.mx) cnt /= 2;\\n cout << ans << \\\" \\\" << cnt << '\\\\n';\\n } else if(t == 4) {\\n int l1, r1, l2, r2;\\n cin >> l1 >> r1 >> l2 >> r2;\\n Node t1 = A.get(0, 0, h, l1 - 1, r1);\\n Node t2 = B.get(0, 0, w, l2 - 1, r2);\\n long long v1 = 1LL * t1.mx * t2.mn;\\n long long v2 = 1LL * t1.mn * t2.mx;\\n long long v3 = 1LL * t1.mn * t2.mn;\\n long long v4 = 1LL * t1.mx * t2.mx;\\n long long ans = max(max(v1, v2), max(v3, v4));\\n long long cnt = 0;\\n if(ans == 0) {\\n if(t1.mn == 0) cnt += 1LL * t1.cmn * (r2 - l2 + 1);\\n if(t1.mx == 0) cnt += 1LL * t1.cmx * (r2 - l2 + 1);\\n if(t2.mn == 0) {\\n cnt += 1LL * t2.cmn * (r1 - l1 + 1);\\n cnt -= (t1.mn == 0) + (t1.mx == 0);\\n }\\n if(t2.mx == 0) {\\n cnt += 1LL * t2.cmx * (r1 - l1 + 1);\\n cnt -= (t1.mn == 0) + (t1.mx == 0);\\n }\\n } else {\\n if(v1 == ans) cnt += 1LL * t1.cmx * t2.cmn;\\n if(v2 == ans) cnt += 1LL * t1.cmn * t2.cmx;\\n if(v3 == ans) cnt += 1LL * t1.cmn * t2.cmn;\\n if(v4 == ans) cnt += 1LL * t1.cmx * t2.cmx;\\n }\\n if(t1.mx == t1.mn) cnt /= 2;\\n if(t2.mn == t2.mx) cnt /= 2;\\n cout << ans << \\\" \\\" << cnt << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.735632183908046,\n \"time_ms\": 180,\n \"memory_kb\": 19480,\n \"score_of_the_acc\": -1.0447,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3035_3407502\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\ntypedef long long ll;\\ntypedef pair<int,int> pint;\\ntypedef pair<ll,int> pli;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\ntemplate<typename T>\\nstruct LazySegmentTree{\\nprivate:\\n int n;\\n vector<T> node;\\n vector<int> lazy;\\n T E0;\\n int E1=0;\\n\\n inline void updatef(int& lazy,int& value){\\n //lazy += value;\\n lazy += value;\\n //lazy = max(lazy, value);\\n //lazy = min(lazy, value);\\n }\\n inline void calculatef(T& node,int& lazy,int len){\\n //node += lazy * len;\\n // node += lazy ;\\n node.first += lazy ;\\n }\\n inline T queryf(T& x,T& y){\\n //return x + y;\\n //return x * y;\\n //return max(x, y);\\n if(x.first<y.first)return x;\\n else if(x.first>y.first)return y;\\n else return {x.first, x.second+y.second};\\n }\\npublic:\\n LazySegmentTree(int sz,T nodeE,int lazyE = 0):E0(nodeE), E1(lazyE){\\n n=1;\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n }\\n\\n LazySegmentTree(vector<T>& v,T E0,int E1=0 ):E0(E0),E1(E1){\\n n=1;\\n int sz=v.size();\\n while(n<sz)n<<=1;\\n node.resize(2*n-1,E0);\\n lazy.resize(2*n-1,E1);\\n rep(i,sz)node[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i){\\n node[i] = queryf(node[2*i+1],node[2*i+2]);\\n }\\n }\\n\\n void eval(int k,int l,int r){\\n if(lazy[k]==E1)return ;\\n calculatef(node[k], lazy[k], r-l);\\n if(r-l>1){\\n updatef(lazy[2*k+1], lazy[k]);\\n updatef(lazy[2*k+2], lazy[k]);\\n }\\n lazy[k]=E1;\\n }\\n\\n void update(int a, int b, int x,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return;\\n if(a<=l&&r<=b){\\n updatef(lazy[k], x);\\n eval(k,l,r);\\n }\\n else {\\n update(a,b,x,2*k+1,l,(l+r)/2);\\n update(a,b,x,2*k+2,(l+r)/2,r);\\n node[k]=queryf(node[2*k+1], node[2*k+2]);\\n }\\n }\\n\\n T query(int a,int b,int k=0,int l=0,int r=-1){\\n if(r<0)r=n;\\n eval(k,l,r);\\n if(r<=a||b<=l)return E0;\\n if(a<=l&&r<=b)return node[k];\\n T xl=query(a,b,2*k+1,l,(l+r)/2);\\n T xr=query(a,b,2*k+2,(l+r)/2,r);\\n return queryf(xl, xr);\\n }\\n};\\n\\npair<ll,ll> fun(pair<ll,ll> p,pair<ll,ll>q){\\n if(p.first<q.first)return p;\\n if(p.first>q.first)return q;\\n else return {p.first,p.second+q.second};\\n}\\npair<ll,ll> mul(pair<ll,ll> p,pair<ll,ll>q){\\n return {p.first*q.first, p.second*q.second};\\n}\\n\\n\\nint main(){\\n int h,w,q;\\n cin>>h>>w>>q;\\n vector<pair<ll,ll>> h1(h),h2(h),w1(w),w2(w);\\n rep(i,h){\\n cin>>h1[i].first;\\n h2[i].first=-h1[i].first;\\n h1[i].second=h2[i].second=1;\\n } \\n rep(i,w){\\n cin>>w1[i].first;\\n w2[i].first=-w1[i].first;\\n w1[i].second=w2[i].second=1;\\n } \\n pair<ll,ll> e={longinf,1};\\n LazySegmentTree<pair<ll,ll>> hmin(h1,e),hmax(h2,e),wmin(w1,e),wmax(w2,e);\\n while(q--){\\n int type;\\n cin>>type;\\n if(type==1){\\n int a,b,c;\\n cin>>a>>b>>c;\\n hmin.update(a-1,b,c);\\n hmax.update(a-1,b,-c);\\n }\\n else if(type==2){\\n int a,b,c;\\n cin>>a>>b>>c;\\n wmin.update(a-1,b,c);\\n wmax.update(a-1,b,-c);\\n }\\n else if(type==3){\\n int a,b,c,d;\\n cin>>a>>b>>c>>d;\\n auto Hmin=hmin.query(a-1, b);\\n auto Hmax=hmax.query(a-1, b);\\n auto Wmin=wmin.query(c-1, d);\\n auto Wmax=wmax.query(c-1, d);\\n Hmax.first*=-1;\\n Wmax.first*=-1;\\n if(Hmin.second==b-a+1)Hmax={Hmin.first,0};\\n if(Wmin.second==d-c+1)Wmax={Wmin.first,0};\\n pair<ll,ll> ans={longinf,1};\\n ans=fun(ans,mul(Hmin,Wmin));\\n ans=fun(ans,mul(Hmax,Wmin));\\n ans=fun(ans,mul(Hmin,Wmax));\\n ans=fun(ans,mul(Hmax,Wmax));\\n if(ans.first==0){\\n ll cnth=0,cntw=0;\\n if(Hmax.first==0)cnth=Hmax.second;\\n if(Hmin.first==0)cnth=Hmin.second;\\n if(Wmax.first==0)cntw=Wmax.second;\\n if(Wmin.first==0)cntw=Wmin.second;\\n ans.second=(ll)(d-c+1)*(b-a+1)-(b-a+1-cnth)*(d-c+1-cntw);\\n }\\n cout<<ans.first<<\\\" \\\"<<ans.second<<endl;\\n }\\n else if(type==4){\\n int a,b,c,d;\\n cin>>a>>b>>c>>d;\\n auto Hmin=hmin.query(a-1, b);\\n auto Hmax=hmax.query(a-1, b);\\n auto Wmin=wmin.query(c-1, d);\\n auto Wmax=wmax.query(c-1, d);\\n Hmax.first*=-1;\\n Wmin.first*=-1;\\n if(Hmin.second==b-a+1)Hmax={Hmax.first,0};\\n if(Wmin.second==d-c+1)Wmax={Wmax.first,0};\\n pair<ll,ll> ans={longinf,1};\\n ans=fun(ans,mul(Hmin,Wmin));\\n ans=fun(ans,mul(Hmax,Wmin));\\n ans=fun(ans,mul(Hmin,Wmax));\\n ans=fun(ans,mul(Hmax,Wmax));\\n if(ans.first==0){\\n ll cnth=0,cntw=0;\\n if(Hmax.first==0)cnth=Hmax.second;\\n if(Hmin.first==0)cnth=Hmin.second;\\n if(Wmax.first==0)cntw=Wmax.second;\\n if(Wmin.first==0)cntw=Wmin.second;\\n ans.second=(ll)(d-c+1)*(b-a+1)-(b-a+1-cnth)*(d-c+1-cntw);\\n }\\n cout<<-ans.first<<\\\" \\\"<<ans.second<<endl;\\n }\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 28888,\n \"score_of_the_acc\": -1.8007,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3035_3401776\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){}\\n \\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n inline T reflect(int k){\\n return laz[k]==ei?dat[k]:g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n inline void thrust(int k){\\n for(int i=height;i;i--) eval(k>>i);\\n }\\n inline void recalc(int k){ \\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\\n }\\n void update(int a,int b,E x){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n void set_val(int a,T x){\\n thrust(a+=n);\\n dat[a]=x;laz[a]=ei;\\n recalc(a);\\n }\\n T query(int a,int b){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n struct T{\\n Int w,x,y,z;\\n T(Int w,Int x,Int y,Int z):w(w),x(x),y(y),z(z){}\\n };\\n \\n auto f=[](T a,T b){\\n Int cw=min(a.w,b.w);\\n Int cx=(a.w==b.w?a.x+b.x:(a.w<b.w?a.x:b.x));\\n Int cy=max(a.y,b.y);\\n Int cz=(a.y==b.y?a.z+b.z:(a.y>b.y?a.z:b.z));\\n return T(cw,cx,cy,cz);\\n };\\n auto g=[](T a,Int b){\\n return T(a.w+b,a.x,a.y+b,a.z);\\n };\\n auto h=[](Int a,Int b){return a+b;};\\n\\n Int H,W,Q;\\n scanf(\\\"%lld %lld %lld\\\",&H,&W,&Q);\\n vector<T> A,B;\\n for(Int i=0;i<H;i++){\\n Int v;\\n scanf(\\\"%lld\\\",&v);\\n A.emplace_back(v,1,v,1);\\n }\\n for(Int i=0;i<W;i++){\\n Int v;\\n scanf(\\\"%lld\\\",&v);\\n B.emplace_back(v,1,v,1);\\n }\\n \\n const Int INF = 1e17;\\n T ti(INF,0,-INF,0);\\n SegmentTree<T, Int> segY(f,g,h,ti,0);\\n SegmentTree<T, Int> segX(f,g,h,ti,0);\\n segY.build(A);\\n segX.build(B);\\n\\n auto calc=[](Int t,T a,T b,Int p,Int q){\\n Int res=t==3?\\n min({a.w*b.w,a.w*b.y,a.y*b.w,a.y*b.y}):\\n max({a.w*b.w,a.w*b.y,a.y*b.w,a.y*b.y});\\n Int cnt=0;\\n Int n=p-(!a.w?a.x:!a.y?a.z:0ll);\\n Int m=q-(!b.w?b.x:!b.y?b.z:0ll);\\n if(res==0) cnt=p*q-n*m;\\n else{\\n if(a.w==a.y) a.z=0;\\n if(b.w==b.y) b.z=0;\\n if(res==a.w*b.w) cnt+=a.x*b.x;\\n if(res==a.w*b.y) cnt+=a.x*b.z;\\n if(res==a.y*b.w) cnt+=a.z*b.x;\\n if(res==a.y*b.y) cnt+=a.z*b.z;\\n }\\n printf(\\\"%lld %lld\\\\n\\\",res,cnt);\\n };\\n \\n for(Int i=0;i<Q;i++){\\n Int t;\\n scanf(\\\"%lld\\\",&t);\\n if(t==1){\\n Int a,b,v;\\n scanf(\\\"%lld %lld %lld\\\",&a,&b,&v);\\n segY.update(--a,b,v);\\n }\\n if(t==2){\\n Int c,d,v;\\n scanf(\\\"%lld %lld %lld\\\",&c,&d,&v);\\n segX.update(--c,d,v);\\n }\\n if(t==3||t==4){\\n Int a,b,c,d;\\n scanf(\\\"%lld %lld %lld %lld\\\",&a,&b,&c,&d);\\n T y=segY.query(--a,b);\\n T x=segX.query(--c,d);\\n calc(t,y,x,b-a,d-c);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 28896,\n \"score_of_the_acc\": -1.2837,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3035_3203259\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n inline T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n inline void thrust(int k){\\n for(int i=height;i;i--) eval(k>>i);\\n }\\n inline void recalc(int k){ \\n while(k>>=1)\\n dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));\\n }\\n void update(int a,int b,E x){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n recalc(a);\\n recalc(b);\\n }\\n void set_val(int a,T x){\\n thrust(a+=n);\\n dat[a]=x;laz[a]=ei;\\n recalc(a);\\n }\\n T query(int a,int b){\\n thrust(a+=n);\\n thrust(b+=n-1);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n using T = tuple<Int, Int, Int, Int>;\\n \\n auto f=[](T a,T b){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n Int bw,bx,by,bz;\\n tie(bw,bx,by,bz)=b;\\n Int cw=min(aw,bw);\\n Int cx=(aw==bw?ax+bx:(aw<bw?ax:bx));\\n Int cy=max(ay,by);\\n Int cz=(ay==by?az+bz:(ay>by?az:bz));\\n return T(cw,cx,cy,cz);\\n };\\n auto g=[](T a,Int b){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n return T(aw+b,ax,ay+b,az);\\n };\\n auto h=[](Int a,Int b){return a+b;};\\n\\n Int H,W,Q;\\n scanf(\\\"%lld %lld %lld\\\",&H,&W,&Q);\\n vector<T> A,B;\\n for(Int i=0;i<H;i++){\\n Int v;\\n scanf(\\\"%lld\\\",&v);\\n A.emplace_back(v,1,v,1);\\n }\\n for(Int i=0;i<W;i++){\\n Int v;\\n scanf(\\\"%lld\\\",&v);\\n B.emplace_back(v,1,v,1);\\n }\\n \\n const Int INF = 1e17;\\n T ti(INF,0,-INF,0);\\n SegmentTree<T, Int> segY(H,f,g,h,ti,0);\\n SegmentTree<T, Int> segX(W,f,g,h,ti,0);\\n segY.build(H,A);\\n segX.build(W,B);\\n\\n auto calc=[](Int t,T a,T b,Int p,Int q){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n Int bw,bx,by,bz;\\n tie(bw,bx,by,bz)=b;\\n Int res=t==3?\\n min({aw*bw,aw*by,ay*bw,ay*by}):\\n max({aw*bw,aw*by,ay*bw,ay*by});\\n Int cnt=0;\\n Int n=p-(!aw?ax:!ay?az:0ll);\\n Int m=q-(!bw?bx:!by?bz:0ll);\\n if(res==0) cnt=p*q-n*m;\\n else{\\n if(aw==ay) az=0;\\n if(bw==by) bz=0;\\n if(res==aw*bw) cnt+=ax*bx;\\n if(res==aw*by) cnt+=ax*bz;\\n if(res==ay*bw) cnt+=az*bx;\\n if(res==ay*by) cnt+=az*bz;\\n }\\n printf(\\\"%lld %lld\\\\n\\\",res,cnt);\\n };\\n \\n for(Int i=0;i<Q;i++){\\n Int t;\\n scanf(\\\"%lld\\\",&t);\\n if(t==1){\\n Int a,b,v;\\n scanf(\\\"%lld %lld %lld\\\",&a,&b,&v);\\n segY.update(--a,b,v);\\n }\\n if(t==2){\\n Int c,d,v;\\n scanf(\\\"%lld %lld %lld\\\",&c,&d,&v);\\n segX.update(--c,d,v);\\n }\\n if(t==3||t==4){\\n Int a,b,c,d;\\n scanf(\\\"%lld %lld %lld %lld\\\",&a,&b,&c,&d);\\n T y=segY.query(--a,b);\\n T x=segX.query(--c,d);\\n calc(t,y,x,b-a,d-c);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 31888,\n \"score_of_the_acc\": -1.3816,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3035_3042312\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n typedef function<T(T,T)> F;\\n typedef function<T(T,E)> G;\\n typedef function<E(E,E)> H;\\n typedef function<E(E,Int)> P;\\n Int n;\\n F f;\\n G g;\\n H h;\\n T d1;\\n E d0;\\n P p;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(Int n_,F f,G g,H h,T d1,E d0,\\n\\t vector<T> v=vector<T>(),\\n\\t P p=[](E a,Int b){++b;return a;}):\\n f(f),g(g),h(h),d1(d1),d0(d0),p(p){\\n \\n init(n_);\\n if(n_==(Int)v.size()) build(n_,v);\\n }\\n void init(Int n_){\\n n=1;\\n while(n<n_) n*=2;\\n dat.clear();\\n dat.resize(2*n-1,d1);\\n laz.clear();\\n laz.resize(2*n-1,d0);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[i+n-1]=v[i];\\n for(Int i=n-2;i>=0;i--)\\n dat[i]=f(dat[i*2+1],dat[i*2+2]);\\n }\\n inline void eval(Int len,Int k){\\n if(laz[k]==d0) return;\\n if(k*2+1<n*2-1){\\n laz[k*2+1]=h(laz[k*2+1],laz[k]);\\n laz[k*2+2]=h(laz[k*2+2],laz[k]);\\n }\\n dat[k]=g(dat[k],p(laz[k],len));\\n laz[k]=d0;\\n }\\n T update(Int a,Int b,E x,Int k,Int l,Int r){\\n eval(r-l,k);\\n if(r<=a||b<=l) return dat[k];\\n if(a<=l&&r<=b){\\n laz[k]=h(laz[k],x);\\n return g(dat[k],p(laz[k],r-l));\\n }\\n return dat[k]=f(update(a,b,x,k*2+1,l,(l+r)/2),\\n\\t\\t update(a,b,x,k*2+2,(l+r)/2,r));\\n }\\n T update(Int a,Int b,E x){\\n return update(a,b,x,0,0,n);\\n }\\n T query(Int a,Int b,Int k,Int l,Int r){\\n eval(r-l,k);\\n if(r<=a||b<=l) return d1;\\n if(a<=l&&r<=b) return dat[k];\\n T vl=query(a,b,k*2+1,l,(l+r)/2);\\n T vr=query(a,b,k*2+2,(l+r)/2,r);\\n return f(vl,vr);\\n }\\n T query(Int a,Int b){\\n return query(a,b,0,0,n);\\n }\\n void update(Int k,T x){\\n query(k,k+1);//evaluate\\n k+=n-1;\\n dat[k]=x;\\n while(k){\\n k=(k-1)/2;\\n dat[k]=f(dat[k*2+1],dat[k*2+2]);\\n }\\n }\\n};\\n\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n using T = tuple<Int, Int, Int, Int>;\\n \\n SegmentTree<T, Int>::F f=[](T a,T b){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n Int bw,bx,by,bz;\\n tie(bw,bx,by,bz)=b;\\n Int cw=min(aw,bw);\\n Int cx=(aw==bw?ax+bx:(aw<bw?ax:bx));\\n Int cy=max(ay,by);\\n Int cz=(ay==by?az+bz:(ay>by?az:bz));\\n return T(cw,cx,cy,cz);\\n };\\n \\n SegmentTree<T, Int>::G g=[](T a,Int b){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n return T(aw+b,ax,ay+b,az);\\n };\\n\\n SegmentTree<T, Int>::H h=[](Int a,Int b){\\n return a+b;\\n };\\n\\n Int H,W,Q;\\n cin>>H>>W>>Q;\\n vector<T> A,B;\\n for(Int i=0;i<H;i++){\\n Int v;\\n cin>>v;\\n A.emplace_back(v,1,v,1);\\n }\\n for(Int i=0;i<W;i++){\\n Int v;\\n cin>>v;\\n B.emplace_back(v,1,v,1);\\n }\\n \\n const Int INF = 1e17;\\n T d1(INF,0,-INF,0);\\n SegmentTree<T, Int> segY(H,f,g,h,d1,0,A);\\n SegmentTree<T, Int> segX(W,f,g,h,d1,0,B);\\n\\n auto calc=[](Int t,T a,T b,Int p,Int q){\\n Int aw,ax,ay,az;\\n tie(aw,ax,ay,az)=a;\\n Int bw,bx,by,bz;\\n tie(bw,bx,by,bz)=b;\\n Int res=t==3?\\n min({aw*bw,aw*by,ay*bw,ay*by}):\\n max({aw*bw,aw*by,ay*bw,ay*by});\\n Int cnt=0;\\n Int n=p-(!aw?ax:!ay?az:0ll);\\n Int m=q-(!bw?bx:!by?bz:0ll);\\n if(res==0) cnt=p*q-n*m;\\n else{\\n if(aw==ay) az=0;\\n if(bw==by) bz=0;\\n if(res==aw*bw) cnt+=ax*bx;\\n if(res==aw*by) cnt+=ax*bz;\\n if(res==ay*bw) cnt+=az*bx;\\n if(res==ay*by) cnt+=az*bz;\\n }\\n \\n cout<<res<<\\\" \\\"<<cnt<<endl;\\n };\\n \\n for(Int i=0;i<Q;i++){\\n Int t;\\n cin>>t;\\n if(t==1){\\n Int a,b,v;\\n cin>>a>>b>>v;\\n segY.update(--a,b,v);\\n }\\n if(t==2){\\n Int c,d,v;\\n cin>>c>>d>>v;\\n segX.update(--c,d,v);\\n }\\n if(t==3||t==4){\\n Int a,b,c,d;\\n cin>>a>>b>>c>>d;\\n T y=segY.query(--a,b);\\n T x=segX.query(--c,d);\\n calc(t,y,x,b-a,d-c);\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 34980,\n \"score_of_the_acc\": -1.7931,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3035_2927603\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld =long double;\\nconst ld eps = 1e-9;\\n\\n#define Seg_Max_N (1<<18) \\n\\nstruct aa {\\n\\tlong long int amin;\\n\\tlong long int min_num;\\n\\n\\tlong long int amax;\\n\\tlong long int max_num;\\n};\\n\\ntypedef aa Value1;\\ntypedef long long int Value2;\\nconst Value1 Zero1 = aa{ 0,1,0,1 };\\nconst Value2 Zero2 =0;\\n\\nstruct Node {\\n\\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\\n\\tValue2 lazy;\\t//遅延されている値を保存している\\n\\tNode() :sum(Zero1) {\\n\\t\\tlazy = Zero2;\\n\\t}\\n};\\nstruct lazy_segtree {\\n\\tint N;\\n\\tvector<Node>dat;\\n\\tlazy_segtree(int n) :N(1) {\\n\\t\\twhile (N < n) N *= 2;\\n\\t\\tdat.resize(2 * N);\\n\\t}\\n\\n\\tValue2 lazy_connect(const Value2 l, const Value2 r) {\\n\\t\\treturn l+r;\\n\\t}\\n\\n\\tvoid lazy_func(const int k, const int a, const int b) {\\n\\t\\t\\n\\t\\tdat[k].sum.amin += dat[k].lazy;\\n\\t\\tdat[k].sum.amax+=dat[k].lazy;\\n\\t\\t\\n\\t}\\n\\n\\tValue1 connect(const Value1 l, const Value1 r) {\\n\\t\\taa naa;\\n\\t\\tif (l.amin == r.amin) {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num + r.min_num;\\n\\t\\t}\\n\\t\\telse if (l.amin > r.amin) {\\n\\t\\t\\tnaa.amin = r.amin;\\n\\t\\t\\tnaa.min_num = r.min_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num;\\n\\t\\t}\\n\\n\\t\\tif (l.amax == r.amax) {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num + r.max_num;\\n\\t\\t}\\n\\t\\telse if (l.amax < r.amax) {\\n\\t\\t\\tnaa.amax = r.amax;\\n\\t\\t\\tnaa.max_num = r.max_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num;\\n\\t\\t}\\n\\t\\treturn naa;\\n\\t}\\n\\n\\t// inlineつけないと大変なことになるよ!(遅い)\\n\\tinline void lazy_evaluate_node(int k, int a, int b) {\\n\\t\\tlazy_func(k, a, b);\\n\\t\\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\\n\\t\\t\\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\\t//次は君が伝搬してね☆って感じ.\\n\\t\\t\\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\\n\\t\\t}\\n\\t\\tdat[k].lazy = Zero2;\\n\\t}\\n\\n\\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\\n\\t\\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\\n\\n\\t}\\n\\n\\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\\n\\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\t\\tif (l < 0 || r < 0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); \\t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn;\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\\n\\t\\t\\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tupdate(l, r, v, 2 * k, a, m);\\n\\t\\tupdate(l, r, v, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t}\\n\\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\\n\\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\n\\t\\tif (l < 0 || r<0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\\n\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\treturn dat[k].sum;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tValue1 vl = get(l, r, 2 * k, a, m);\\n\\t\\tValue1 vr = get(l, r, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t\\treturn connect(vl, vr);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tint H,W,Q;cin>>H>>W>>Q;\\n\\tvector<int>as(H),bs(W);\\n\\tfor(int i=0;i<H;++i)cin>>as[i];\\n\\tfor(int i=0;i<W;++i)cin>>bs[i];\\n\\tlazy_segtree aseg(H),bseg(W);\\n\\tfor (int i = 0; i < H; ++i) {\\n\\t\\taseg.update(i,i+1, as[i]);\\n\\t}\\n\\tfor (int i = 0; i < W; ++i) {\\n\\t\\tbseg.update(i,i+1, bs[i]);\\n\\t}\\n\\twhile (Q--) {\\n\\t\\tint type;cin>>type;\\n\\t\\tif (type == 1) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\taseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse if (type == 2) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\tbseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint a,b,c,d;cin>>a>>b>>c>>d;\\n\\t\\t\\ta--;c--;\\n\\t\\t\\tauto a_aa=aseg.get(a,b);\\n\\t\\t\\tauto b_aa=bseg.get(c,d);\\n\\n\\t\\t\\tmap<long long int,long long int>mp;\\n\\n\\t\\t\\tif (a_aa.amin != a_aa.amax) {\\n\\t\\t\\t\\tif (b_aa.amin != b_aa.amax) {\\n\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\tmp[a_aa.amax*b_aa.amin] += a_aa.max_num*b_aa.min_num;\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amax] += a_aa.min_num*b_aa.max_num;\\n\\t\\t\\t\\t\\tmp[a_aa.amax*b_aa.amax] += a_aa.max_num*b_aa.max_num;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\tmp[a_aa.amax*b_aa.amin] += a_aa.max_num*b_aa.min_num;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (b_aa.amin != b_aa.amax) {\\n\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amax] += a_aa.min_num*b_aa.max_num;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tmp[a_aa.amin*b_aa.amin] += a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto it=mp.begin();\\n\\t\\t\\tauto jt=prev(mp.end());\\n\\n\\t\\t\\tif (type == 3) {\\n\\t\\t\\t\\tlong long int ans_num,ans_cnt;\\n\\t\\t\\t\\tif (it->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt=(d-c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(b_aa.amin==0){\\n\\t\\t\\t\\t\\t\\tans_cnt=(b-a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin,a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num,a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt=it->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout<<it->first<<\\\" \\\"<<ans_cnt<<endl;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlong long int ans_num, ans_cnt;\\n\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\tswap(b_aa.min_num,b_aa.max_num);\\n\\t\\t\\t\\tif (jt->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin, a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num, a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin, b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt = jt->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << jt->first << \\\" \\\" << ans_cnt << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 23944,\n \"score_of_the_acc\": -1.57,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3035_2927600\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld =long double;\\nconst ld eps = 1e-9;\\n\\n#define Seg_Max_N (1<<18) \\n\\nstruct aa {\\n\\tlong long int amin;\\n\\tlong long int min_num;\\n\\n\\tlong long int amax;\\n\\tlong long int max_num;\\n};\\n\\ntypedef aa Value1;\\ntypedef long long int Value2;\\nconst Value1 Zero1 = aa{ 0,1,0,1 };\\nconst Value2 Zero2 =0;\\n\\nstruct Node {\\n\\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\\n\\tValue2 lazy;\\t//遅延されている値を保存している\\n\\tNode() :sum(Zero1) {\\n\\t\\tlazy = Zero2;\\n\\t}\\n};\\nstruct lazy_segtree {\\n\\tint N;\\n\\tvector<Node>dat;\\n\\tlazy_segtree(int n) :N(1) {\\n\\t\\twhile (N < n) N *= 2;\\n\\t\\tdat.resize(2 * N);\\n\\t}\\n\\n\\tValue2 lazy_connect(const Value2 l, const Value2 r) {\\n\\t\\treturn l+r;\\n\\t}\\n\\n\\tvoid lazy_func(const int k, const int a, const int b) {\\n\\t\\t\\n\\t\\tdat[k].sum.amin += dat[k].lazy;\\n\\t\\tdat[k].sum.amax+=dat[k].lazy;\\n\\t\\t\\n\\t}\\n\\n\\tValue1 connect(const Value1 l, const Value1 r) {\\n\\t\\taa naa;\\n\\t\\tif (l.amin == r.amin) {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num + r.min_num;\\n\\t\\t}\\n\\t\\telse if (l.amin > r.amin) {\\n\\t\\t\\tnaa.amin = r.amin;\\n\\t\\t\\tnaa.min_num = r.min_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num;\\n\\t\\t}\\n\\n\\t\\tif (l.amax == r.amax) {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num + r.max_num;\\n\\t\\t}\\n\\t\\telse if (l.amax < r.amax) {\\n\\t\\t\\tnaa.amax = r.amax;\\n\\t\\t\\tnaa.max_num = r.max_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num;\\n\\t\\t}\\n\\t\\treturn naa;\\n\\t}\\n\\n\\t// inlineつけないと大変なことになるよ!(遅い)\\n\\tinline void lazy_evaluate_node(int k, int a, int b) {\\n\\t\\tlazy_func(k, a, b);\\n\\t\\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\\n\\t\\t\\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\\t//次は君が伝搬してね☆って感じ.\\n\\t\\t\\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\\n\\t\\t}\\n\\t\\tdat[k].lazy = Zero2;\\n\\t}\\n\\n\\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\\n\\t\\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\\n\\n\\t}\\n\\n\\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\\n\\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\t\\tif (l < 0 || r < 0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); \\t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn;\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\\n\\t\\t\\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tupdate(l, r, v, 2 * k, a, m);\\n\\t\\tupdate(l, r, v, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t}\\n\\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\\n\\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\n\\t\\tif (l < 0 || r<0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\\n\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\treturn dat[k].sum;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tValue1 vl = get(l, r, 2 * k, a, m);\\n\\t\\tValue1 vr = get(l, r, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t\\treturn connect(vl, vr);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tint H,W,Q;cin>>H>>W>>Q;\\n\\tvector<int>as(H),bs(W);\\n\\tfor(int i=0;i<H;++i)cin>>as[i];\\n\\tfor(int i=0;i<W;++i)cin>>bs[i];\\n\\tlazy_segtree aseg(H),bseg(W);\\n\\tfor (int i = 0; i < H; ++i) {\\n\\t\\taseg.update(i,i+1, as[i]);\\n\\t}\\n\\tfor (int i = 0; i < W; ++i) {\\n\\t\\tbseg.update(i,i+1, bs[i]);\\n\\t}\\n\\twhile (Q--) {\\n\\t\\tint type;cin>>type;\\n\\t\\tif (type == 1) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\taseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse if (type == 2) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\tbseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint a,b,c,d;cin>>a>>b>>c>>d;\\n\\t\\t\\ta--;c--;\\n\\t\\t\\tauto a_aa=aseg.get(a,b);\\n\\t\\t\\tauto b_aa=bseg.get(c,d);\\n\\n\\t\\t\\tmap<long long int,long long int>mp;\\n\\t\\t\\tmp[a_aa.amin*b_aa.amin]=a_aa.min_num*b_aa.min_num;\\n\\t\\t\\tmp[a_aa.amax*b_aa.amin]=a_aa.max_num*b_aa.min_num;\\n\\t\\t\\tmp[a_aa.amin*b_aa.amax]=a_aa.min_num*b_aa.max_num;\\n\\t\\t\\tmp[a_aa.amax*b_aa.amax]=a_aa.max_num*b_aa.max_num;\\n\\n\\t\\t\\tauto it=mp.begin();\\n\\t\\t\\tauto jt=prev(mp.end());\\n\\n\\t\\t\\tif (type == 3) {\\n\\t\\t\\t\\tlong long int ans_num,ans_cnt;\\n\\t\\t\\t\\tif (it->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt=(d-c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(b_aa.amin==0){\\n\\t\\t\\t\\t\\t\\tans_cnt=(b-a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin,a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num,a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt=it->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout<<it->first<<\\\" \\\"<<ans_cnt<<endl;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlong long int ans_num, ans_cnt;\\n\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\tswap(b_aa.min_num,b_aa.max_num);\\n\\t\\t\\t\\tif (jt->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin, a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num, a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin, b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt = jt->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << jt->first << \\\" \\\" << ans_cnt << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4827586206896552,\n \"time_ms\": 20,\n \"memory_kb\": 4416,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3035_2927594\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld =long double;\\nconst ld eps = 1e-9;\\n\\n#define Seg_Max_N (1<<18) \\n\\nstruct aa {\\n\\tlong long int amin;\\n\\tlong long int min_num;\\n\\n\\tlong long int amax;\\n\\tlong long int max_num;\\n};\\n\\ntypedef aa Value1;\\ntypedef int Value2;\\nconst Value1 Zero1 = aa{ 0,1,0,1 };\\nconst Value2 Zero2 =0;\\n\\nstruct Node {\\n\\tValue1 sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\\n\\tValue2 lazy;\\t//遅延されている値を保存している\\n\\tNode() :sum(Zero1) {\\n\\t\\tlazy = Zero2;\\n\\t}\\n};\\nstruct lazy_segtree {\\n\\tint N;\\n\\tvector<Node>dat;\\n\\tlazy_segtree(int n) :N(1) {\\n\\t\\twhile (N < n) N *= 2;\\n\\t\\tdat.resize(2 * N);\\n\\t}\\n\\n\\tValue2 lazy_connect(const Value2 l, const Value2 r) {\\n\\t\\treturn l+r;\\n\\t}\\n\\n\\tvoid lazy_func(const int k, const int a, const int b) {\\n\\t\\t\\n\\t\\tdat[k].sum.amin += dat[k].lazy;\\n\\t\\tdat[k].sum.amax+=dat[k].lazy;\\n\\t\\t\\n\\t}\\n\\n\\tValue1 connect(const Value1 l, const Value1 r) {\\n\\t\\taa naa;\\n\\t\\tif (l.amin == r.amin) {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num + r.min_num;\\n\\t\\t}\\n\\t\\telse if (l.amin > r.amin) {\\n\\t\\t\\tnaa.amin = r.amin;\\n\\t\\t\\tnaa.min_num = r.min_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amin = l.amin;\\n\\t\\t\\tnaa.min_num = l.min_num;\\n\\t\\t}\\n\\n\\t\\tif (l.amax == r.amax) {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num + r.max_num;\\n\\t\\t}\\n\\t\\telse if (l.amax < r.amax) {\\n\\t\\t\\tnaa.amax = r.amax;\\n\\t\\t\\tnaa.max_num = r.max_num;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tnaa.amax = l.amax;\\n\\t\\t\\tnaa.max_num = l.max_num;\\n\\t\\t}\\n\\t\\treturn naa;\\n\\t}\\n\\n\\t// inlineつけないと大変なことになるよ!(遅い)\\n\\tinline void lazy_evaluate_node(int k, int a, int b) {\\n\\t\\tlazy_func(k, a, b);\\n\\t\\tif (k < N) { // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\\n\\t\\t\\tdat[2 * k].lazy = lazy_connect(dat[2 * k].lazy, dat[k].lazy);\\t//次は君が伝搬してね☆って感じ.\\n\\t\\t\\tdat[2 * k + 1].lazy = lazy_connect(dat[2 * k + 1].lazy, dat[k].lazy);\\n\\t\\t}\\n\\t\\tdat[k].lazy = Zero2;\\n\\t}\\n\\n\\tinline void update_node(int k) { // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\\n\\t\\tdat[k].sum = connect(dat[2 * k].sum, dat[2 * k + 1].sum);\\n\\n\\t}\\n\\n\\t// update(l,r,v) := [l,r)を更新する. 区間は0-indexed.\\n\\tvoid update(int l, int r, Value2 v, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\t\\tif (l < 0 || r < 0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); \\t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn;\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\tdat[k].lazy = lazy_connect(dat[k].lazy, v);\\n\\t\\t\\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tupdate(l, r, v, 2 * k, a, m);\\n\\t\\tupdate(l, r, v, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t}\\n\\t//get(l,r) := [l,r)に対するクエリの答えを得る. 区間は0-indexed.\\n\\tValue1 get(int l, int r, int k = 1, int a = 0, int b = -1) {\\n\\t\\tif (b == -1)b = N;\\n\\n\\t\\tif (l < 0 || r<0)assert(false);\\n\\t\\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n\\n\\t\\tif (b <= l || r <= a) //[a,b)と[l,r)が交差している場合\\n\\t\\t\\treturn aa{static_cast<long long int>(1e18),0,static_cast<long long int>(-1e18),0 };\\n\\n\\t\\tif (l <= a && b <= r) { // [l,r)が[a,b)を完全に含んでいる場合\\n\\t\\t\\treturn dat[k].sum;\\n\\t\\t}\\n\\n\\t\\tint m = (a + b) / 2;\\n\\t\\tValue1 vl = get(l, r, 2 * k, a, m);\\n\\t\\tValue1 vr = get(l, r, 2 * k + 1, m, b);\\n\\t\\tupdate_node(k);\\n\\t\\treturn connect(vl, vr);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tint H,W,Q;cin>>H>>W>>Q;\\n\\tvector<int>as(H),bs(W);\\n\\tfor(int i=0;i<H;++i)cin>>as[i];\\n\\tfor(int i=0;i<W;++i)cin>>bs[i];\\n\\tlazy_segtree aseg(H),bseg(W);\\n\\tfor (int i = 0; i < H; ++i) {\\n\\t\\taseg.update(i,i+1, as[i]);\\n\\t}\\n\\tfor (int i = 0; i < W; ++i) {\\n\\t\\tbseg.update(i,i+1, bs[i]);\\n\\t}\\n\\twhile (Q--) {\\n\\t\\tint type;cin>>type;\\n\\t\\tif (type == 1) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\taseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse if (type == 2) {\\n\\t\\t\\tint a,b,x;cin>>a>>b>>x;a--;\\n\\t\\t\\tbseg.update(a,b,x);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint a,b,c,d;cin>>a>>b>>c>>d;\\n\\t\\t\\ta--;c--;\\n\\t\\t\\tauto a_aa=aseg.get(a,b);\\n\\t\\t\\tauto b_aa=bseg.get(c,d);\\n\\n\\t\\t\\tmap<long long int,long long int>mp;\\n\\t\\t\\tmp[a_aa.amin*b_aa.amin]=a_aa.min_num*b_aa.min_num;\\n\\t\\t\\tmp[a_aa.amax*b_aa.amin]=a_aa.max_num*b_aa.min_num;\\n\\t\\t\\tmp[a_aa.amin*b_aa.amax]=a_aa.min_num*b_aa.max_num;\\n\\t\\t\\tmp[a_aa.amax*b_aa.amax]=a_aa.max_num*b_aa.max_num;\\n\\n\\t\\t\\tauto it=mp.begin();\\n\\t\\t\\tauto jt=prev(mp.end());\\n\\n\\t\\t\\tif (type == 3) {\\n\\t\\t\\t\\tlong long int ans_num,ans_cnt;\\n\\t\\t\\t\\tif (it->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt=(d-c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(b_aa.amin==0){\\n\\t\\t\\t\\t\\t\\tans_cnt=(b-a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin,a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num,a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt=it->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout<<it->first<<\\\" \\\"<<ans_cnt<<endl;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlong long int ans_num, ans_cnt;\\n\\t\\t\\t\\tswap(b_aa.amin,b_aa.amax);\\n\\t\\t\\t\\tswap(b_aa.min_num,b_aa.max_num);\\n\\t\\t\\t\\tif (jt->first == 0) {\\n\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tswap(a_aa.amin, a_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(a_aa.min_num, a_aa.max_num);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.amin, b_aa.amax);\\n\\t\\t\\t\\t\\t\\tswap(b_aa.min_num, b_aa.max_num);\\n\\n\\t\\t\\t\\t\\t\\tif (a_aa.amin == 0 && b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num + (d - c)*a_aa.min_num - a_aa.min_num*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (a_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (d - c)*a_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (b_aa.amin == 0) {\\n\\t\\t\\t\\t\\t\\t\\tans_cnt = (b - a)*b_aa.min_num;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tassert(false);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans_cnt = jt->second;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << jt->first << \\\" \\\" << ans_cnt << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4827586206896552,\n \"time_ms\": 20,\n \"memory_kb\": 4412,\n \"score_of_the_acc\": 0,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1892,"cells":{"group_id":{"kind":"string","value":"aoj_3048_cpp"},"problem_description":{"kind":"string","value":"Problem J: Averaging\nProblem\nアイヅ国には$N$個の島と$N-1$個の橋があり、各島はそれぞれ$1$から$N$までの番号が割り振られている。\n $i$番目の橋は島$u_i$と島$v_i$を双方向に結んでおり、島民は橋を用いて島と島とを行き来することができる。また、橋以外に島と島を行き来する方法はない。\n どの島からどの島へもいくつかの橋を渡ることで到達することができる。\n現在、島$i$には$X_i$人の島民がいる。\n 各島の環境への負荷を分散させるためにアイヅ国は何人かの国民に別の島へ引越してもらうことにした。\n 島$a$に住んでいる人を島$b$に引越しさせるためには島$a$と島$b$の距離と同じ分のコストがかかる。ただし、島$a$と島$b$の距離は島$a$から島$b$へ行くために渡る必要のある橋の数の最小値で定義される。\nどの$2$つの島を選んでもそれらの島民の人数の差の絶対値が$1$以下になるように国民に引越してもらいたい。\n このとき、必要なコストの総和の最小値を求めよ。\nInput\n入力は以下の形式ですべて整数で与えられる。\n$N$\n$X_1$ $X_2$ ... $X_N$\n$u_1$ $v_1$\n$u_2$ $v_2$\n...\n$u_{N-1}$ $v_{N-1}$\n$1$行目に島の数$N$が与えられる。\n$2$行目には各島の島民の人数を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$X_i$は島$i$の島民の人数を表す。\n$3$行目から続く$N-1$行には各橋がつなぐ島の番号が空白区切りで与えられる。$2+i$行目の入力では、$i$番目の橋が島$u_i$と島$v_i$を双方向に結んでいることを表す。\nConstraints\n入力は以下の条件を満たす。\n$2 \\le N \\le 5000$\n$0 \\le X_i \\le 10^9$\n$1 \\le u_i, v_i \\le N$\nどの島からどの島へもいくつかの橋を渡ることで到達することができる\nOutput\nコストの総和の最小値を1行に出力せよ。\nSample Input 1\n5\n4 0 4 0 0\n1 2\n1 3\n1 4\n2 5\nSample Output 1\n7\n島$1$の人が$1$人、島$2$へ、\n島$1$の人が$1$人、島$5$へ、\n島$3$の人が$2$人、島$4$へ引っ越すことでどの$2$つの島を選んでもそれらの島民の人数の差の絶対値が$1$以下になる。\n またこのときのコストの総和は$1+2+2\\times2 = 7$であり、これが最小である。\nSample Input 2\n7\n0 7 2 5 0 3 0\n1 2\n1 3\n1 4\n2 5\n3 6\n3 7\nSample Output 2\n10"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3048_6114054","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> Pi;\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define rrep(i,n) for(ll i=n-1;i>=0;i--)\n#define rFOR(i,a,b) for(ll i=a-1;i>=b;i--)\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define endl \"\\n\"\n\ntemplate<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<\"(\"<<d.real()<<\", \"<<d.imag()<< \")\";}\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<\"(\"<<d.first<<\", \"<<d.second<<\")\";}\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<\" \";}return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<\"{ \";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \", \";}s<<(*itr);}s<<\" }\";return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<\"{ \";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \", \";}s<<(*itr);}s<<\" }\";return s;}\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<\"{\"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<\" \"<<(*itr).first<<\" : \"<<(*itr).second<<endl;}s<<\"}\"<<endl;return s;}\ntemplate<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\ntemplate<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\n\nconst ll mod=1'000'000'007;\nconst ll inf=1'000'000'000'000'000'00;\nconst int INF=1'000'000'000;\nconst double EPS=1e-10;\nconst double PI=acos(-1);\n\nconst int N=5100;\nll dp[N][N],ndp[N][N];\nll sum[N],sz[N];\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n ll n;\n cin>>n;\n vector<ll> x(n);\n ll all=0;\n rep(i,n){\n cin>>x[i];\n all+=x[i];\n }\n vector<vector<ll>> g(n);\n rep(i,n-1){\n ll u,v;\n cin>>u>>v;\n u--,v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n ll k=all%n,num=all/n;\n rep(i,N)rep(j,N) dp[i][j]=inf;\n auto dfs=[&](auto &&dfs,ll v,ll pre)->void{\n vector<ll> tos;\n sz[v]=1;\n sum[v]=x[v];\n for(auto &&to:g[v]){\n if(to==pre) continue;\n dfs(dfs,to,v);\n tos.push_back(to);\n sz[v]+=sz[to];\n sum[v]+=sum[to];\n }\n rep(i,tos.size()+1)rep(j,sz[v]+1) ndp[i][j]=inf;\n ndp[0][0]=0;\n ll cur=1;\n rep(i,tos.size()){\n ll to=tos[i];\n rep(j1,cur+1)rep(j2,sz[to]+1){\n if(ndp[i][j1]==inf || dp[to][j2]==inf) continue;\n if(j1+j2>k) continue;\n chmin(ndp[i+1][j1+j2], ndp[i][j1]+dp[to][j2]);\n }\n cur+=sz[to];\n }\n rep(j,k+1)if(ndp[tos.size()][j]!=inf){\n chmin(dp[v][j], ndp[tos.size()][j]+abs(num*sz[v]+j-sum[v]));\n chmin(dp[v][j+1], ndp[tos.size()][j]+abs(num*sz[v]+j+1-sum[v]));\n }\n };\n dfs(dfs,0,-1);\n cout<<dp[0][k]<<endl;\n}","accuracy":1,"time_ms":90,"memory_kb":408192,"score_of_the_acc":-1.0273,"final_rank":16},{"submission_id":"aoj_3048_6114025","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> Pi;\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define rrep(i,n) for(ll i=n-1;i>=0;i--)\n#define rFOR(i,a,b) for(ll i=a-1;i>=b;i--)\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define endl \"\\n\"\n\ntemplate<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<\"(\"<<d.real()<<\", \"<<d.imag()<< \")\";}\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<\"(\"<<d.first<<\", \"<<d.second<<\")\";}\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<\" \";}return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<\"{ \";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \", \";}s<<(*itr);}s<<\" }\";return s;}\ntemplate<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<\"{ \";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \", \";}s<<(*itr);}s<<\" }\";return s;}\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<\"{\"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<\" \"<<(*itr).first<<\" : \"<<(*itr).second<<endl;}s<<\"}\"<<endl;return s;}\ntemplate<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\ntemplate<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\n\nconst ll mod=1'000'000'007;\nconst ll inf=1'000'000'000'000'000'00;\nconst int INF=1'000'000'000;\nconst double EPS=1e-10;\nconst double PI=acos(-1);\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n ll n;\n cin>>n;\n vector<ll> x(n);\n ll all=0;\n rep(i,n){\n cin>>x[i];\n all+=x[i];\n }\n vector<vector<ll>> g(n);\n rep(i,n-1){\n ll u,v;\n cin>>u>>v;\n u--,v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n ll k=all%n,num=all/n;\n auto dp=make_vec(n,k+2,inf);\n auto sum=make_vec(n,0ll);\n auto sz=make_vec(n,0ll);\n auto dfs=[&](auto &&dfs,ll v,ll pre)->void{\n vector<ll> tos;\n for(auto &&to:g[v]){\n if(to==pre) continue;\n dfs(dfs,to,v);\n tos.push_back(to);\n }\n sz[v]=1;\n sum[v]=x[v];\n auto ndp=make_vec(tos.size()+1,k+1,inf);\n ndp[0][0]=0;\n rep(i,tos.size()){\n ll to=tos[i];\n ll x=sz[v],y=sz[to];\n rep(j1,x+1)rep(j2,y+1){\n if(ndp[i][j1]==inf || dp[to][j2]==inf) continue;\n if(j1+j2>k) continue;\n chmin(ndp[i+1][j1+j2], ndp[i][j1]+dp[to][j2]);\n }\n sum[v]+=sum[to];\n sz[v]+=sz[to];\n }\n rep(j,k+1)if(ndp[tos.size()][j]!=inf){\n chmin(dp[v][j], ndp[tos.size()][j]+abs(num*sz[v]+j-sum[v]));\n chmin(dp[v][j+1], ndp[tos.size()][j]+abs(num*sz[v]+j+1-sum[v]));\n }\n };\n dfs(dfs,0,-1);\n //cout<<dp<<endl;\n cout<<dp[0][k]<<endl;\n}","accuracy":0.7924528301886793,"time_ms":70,"memory_kb":117620,"score_of_the_acc":-0.2991,"final_rank":20},{"submission_id":"aoj_3048_4251112","code_snippet":"#include <iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<map>\n#include<set>\n#include<stack>\n#include<queue>\n#include<math.h>\nusing namespace std;\ntypedef long long ll;\n#define int long long\ntypedef vector<int> VI;\ntypedef pair<int, int> pii;\ntypedef priority_queue<int> PQ;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }\n\n#define fore(i,a) for(auto &i:a)\n#define REP(i,n) for(int i=0;i<n;i++)\n#define eREP(i,n) for(int i=0;i<=n;i++)\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)\n#define SORT(c) sort((c).begin(),(c).end())\n#define rSORT(c) sort((c).rbegin(),(c).rend())\n#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))\n#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))\n#define INF 1000000000\n#define LLINF 8223372036854775807\n#define mod 1000000007\n//vector<vector<int> > dp;\n//vector<vector<vector<int> > > vvvi;\n//dp=vector<vector<int> >(N, vector<int>(M,0));\n//vector<pair<int,int> > v;\n//v.push_back(make_pair(x,y));\n//priority_queue<int,vector<int>, greater<int> > q2;\n\nint N;\nVI X;\nint all, ave, amari;\nint size[5010], sum[5010];\nint dp[5010][5010];\nint sdp[5010][5010];\nvector<VI>G;\n\nvoid solve(int now, int pa) {\n\tVI chs;\n\tsize[now] = 1;\n\tsum[now] = X[now];\n\n\tfore(ch, G[now]) {\n\t\tif (ch == pa)continue;\n\t\tsolve(ch, now);\n\t\tchs.push_back(ch);\n\t\tsize[now] += size[ch];\n\t\tsum[now] += sum[ch];\n\t}\n\teREP(i, chs.size())eREP(j, size[now])sdp[i][j] = LLINF;\n\t\n\tsdp[0][0] = 0;\n\tint cur = 0;\n\n\tREP(i, chs.size()) {\n\t\tint ch = chs[i];\n\t\teREP(j, cur) {\n\t\t\teREP(k, size[ch]) {\n\t\t\t\tchmin(sdp[i + 1][j + k], sdp[i][j] + dp[ch][k]);\n\t\t\t}\n\t\t}\n\t\tcur += size[ch];\n\t}\n\n\teREP(k, size[now]) {\n\t\tchmin(dp[now][k], sdp[chs.size()][k] + abs(ave*size[now] + k - sum[now]));\n\t\tchmin(dp[now][k + 1], sdp[chs.size()][k] + abs(ave*size[now] + k + 1 - sum[now]));\n\t}\n}\n\n\n\n\n\n\nsigned main(){\ncin.tie(0);\nios::sync_with_stdio(false);\n\n\tcin >> N;\n\tX.resize(N);\n\tG.resize(N);\n\tall = 0;\n\tREP(i, N) {\n\t\tcin >> X[i];\n\t\tall += X[i];\n\t}\n\tave = all / N;\n\tamari = all % N;\n\n\tREP(i, N - 1) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tREP(i, N)eREP(j, N)dp[i][j] = LLINF;\n\tsolve(0,-1);\n\tcout << dp[0][amari] << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":394936,"score_of_the_acc":-1.0036,"final_rank":12},{"submission_id":"aoj_3048_3674174","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nconst long long INF = 1LL<<60;\nint N;\nvector<long long> X;\nvector<vector<int>> G;\nlong long all;\nlong long ave;\nint amari;\n\nint size[5100];\nlong long sum[5100];\nlong long dp[5100][5100];\nlong long sdp[5100][5100];\n\nvoid rec(int v, int p = -1) {\n vector<int> chs;\n size[v] = 1;\n sum[v] = X[v];\n for (auto ch : G[v]) {\n if (ch == p) continue;\n rec(ch, v);\n chs.push_back(ch);\n size[v] += size[ch];\n sum[v] += sum[ch];\n }\n\n for (int i = 0; i <= chs.size(); ++i)\n for (int j = 0; j <= size[v]; ++j)\n sdp[i][j] = INF;\n sdp[0][0] = 0;\n int cur = 0;\n for (int i = 0; i < chs.size(); ++i) {\n int ch = chs[i];\n for (int j = 0; j <= cur; ++j) {\n for (int k = 0; k <= size[ch]; ++k) {\n chmin(sdp[i+1][j+k], sdp[i][j] + dp[ch][k]);\n }\n }\n cur += size[ch];\n }\n\n for (int k = 0; k <= size[v]; ++k) {\n chmin(dp[v][k], sdp[chs.size()][k] + abs(ave * size[v] + k - sum[v]));\n chmin(dp[v][k+1], sdp[chs.size()][k] + abs(ave * size[v] + k+1 - sum[v]));\n }\n}\n\nint main() {\n cin >> N;\n X.resize(N);\n all = 0;\n for (int i = 0; i < N; ++i) cin >> X[i], all += X[i];\n ave = all / N;\n amari = all % N;\n G.assign(N, vector<int>());\n for (int i = 0; i < N-1; ++i) {\n int a, b; cin >> a >> b; --a, --b;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n for (int v = 0; v < N; ++v) for (int i = 0; i <= N; ++i) dp[v][i] = INF;\n rec(0);\n\n cout << dp[0][amari] << endl;\n}","accuracy":1,"time_ms":110,"memory_kb":401788,"score_of_the_acc":-1.0205,"final_rank":15},{"submission_id":"aoj_3048_3674168","code_snippet":"#include <iostream>\n#include <vector>\n#include <cstring>\n#include <cmath>\nusing namespace std;\n\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntemplate<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }\ntemplate<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\n}\ntemplate<class T, class V>\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\n t = v;\n}\ntemplate<class T, class V>\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){\n for (auto &e : t) fill(e, v);\n}\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\n\nconst long long INF = 1LL<<60;\nint N;\nvector<long long> X;\nvector<vector<int>> G;\nlong long all;\nlong long ave;\nint amari;\n\nint size[5100];\nlong long sum[5100];\nlong long dp[5100][5100];\nlong long sdp[5100][5100];\n\nvoid rec(int v, int p = -1) {\n vector<int> chs;\n size[v] = 1;\n sum[v] = X[v];\n for (auto ch : G[v]) {\n if (ch == p) continue;\n rec(ch, v);\n chs.push_back(ch);\n size[v] += size[ch];\n sum[v] += sum[ch];\n }\n\n for (int i = 0; i <= chs.size(); ++i)\n for (int j = 0; j <= size[v]; ++j)\n sdp[i][j] = INF;\n sdp[0][0] = 0;\n int cur = 0;\n for (int i = 0; i < chs.size(); ++i) {\n int ch = chs[i];\n for (int j = 0; j <= cur; ++j) {\n for (int k = 0; k <= size[ch]; ++k) {\n chmin(sdp[i+1][j+k], sdp[i][j] + dp[ch][k]);\n }\n }\n cur += size[ch];\n }\n\n for (int k = 0; k <= size[v]; ++k) {\n chmin(dp[v][k], sdp[chs.size()][k] + abs(ave * size[v] + k - sum[v]));\n chmin(dp[v][k+1], sdp[chs.size()][k] + abs(ave * size[v] + k+1 - sum[v]));\n }\n}\n\nint main() {\n cin >> N;\n X.resize(N);\n all = 0;\n for (int i = 0; i < N; ++i) cin >> X[i], all += X[i];\n ave = all / N;\n amari = all % N;\n G.assign(N, vector<int>());\n for (int i = 0; i < N-1; ++i) {\n int a, b; cin >> a >> b; --a, --b;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n for (int v = 0; v < N; ++v) for (int i = 0; i <= N; ++i) dp[v][i] = INF;\n rec(0);\n\n cout << dp[0][amari] << endl;\n}","accuracy":1,"time_ms":110,"memory_kb":401696,"score_of_the_acc":-1.0203,"final_rank":14},{"submission_id":"aoj_3048_3669999","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\nusing ll = long long;\n\n#define REP(i,n) for(ll i =0;i<n;++i)\n\nconstexpr ll INF = 1e9 + 1;\nvector<ll> x, cnt, sum;\nll a;\nvoid init(vector<vector<int>>& g, int i, int p) {\n\tll cnt0 = 1, sum0 = x[i];\n\tREP(j, g[i].size()) {\n\t\tif (g[i][j] == p)continue;\n\t\tinit(g, g[i][j], i);\n\t\tcnt0 += cnt[g[i][j]];\n\t\tsum0 += sum[g[i][j]];\n\t}\n\tcnt[i] = cnt0;\n\tsum[i] = sum0;\n}\n\nll f(int v, int i) {\n\t//cout<<v<<endl;\n\treturn abs(a * cnt[v] + i - sum[v]);\n}\n\nvector<ll> merge(vector<ll>& l, vector<ll>& r, int rv) {\n\t//cout<<l.size()<<\" \"<<r.size()<<endl;\n\tvector<ll> res(l.size() + r.size() - 1, INF * INF);\n\tREP(i, l.size())REP(j, r.size()) {\n\t\tres[i + j] = min(res[i + j], l[i] + r[j] + f(rv, j));\n\t}\n\n\t//cout<<\"end\"<<endl;\n\treturn res;\n\n}\nvoid dfs(vector<vector<int>>& g, vector<vector<ll>>& dp, int v, int p) {\n\tvector<ll> res(2, 0);\n\tREP(i, g[v].size()) {\n\t\tif (g[v][i] == p)continue;\n\t\tdfs(g, dp, g[v][i], v);\n\t\tres = merge(res, dp[g[v][i]], g[v][i]);\n\t\t// cout<<g[v][i]<<endl;\n\t}\n\tdp[v] = res;\n}\nint main() {\n\tint n; cin >> n;\n\tx.resize(n);\n\tcnt.resize(n);\n\tsum.resize(n);\n\tREP(i, n)cin >> x[i];\n\tvector<vector<int>>g(n);\n\tREP(i, n - 1) {\n\t\tint a, b; cin >> a >> b;\n\t\ta--; b--;\n\t\tg[a].push_back(b);\n\t\tg[b].push_back(a);\n\t}\n\tinit(g, 0, -1);\n\ta = sum[0] / n;\n\tvector<vector<ll>> dp(n);\n\tdfs(g, dp, 0, -1);\n\tcout << dp[0][sum[0] % n] << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":107248,"score_of_the_acc":-0.2689,"final_rank":4},{"submission_id":"aoj_3048_3215687","code_snippet":"#include \"bits/stdc++.h\"\n\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\n\ntypedef vector<pair<long long int,long long int>> DP;\n\nDP connect(const DP&l, const DP&r) {\n\tDP k(l.size()+r.size()-1,make_pair(1e18,1e18));\n\tfor (int i = 0; i < l.size(); ++i) {\n\t\tfor (int j = 0; j < r.size(); ++j) {\n\t\t\tauto x = make_pair(l[i].first + r[j].first, l[i].second + r[j].second);\n\n\t\t\tk[i + j] = min(k[i + j], x);\n\n\t\t}\n\t}\n\treturn k;\n}\nDP dfs(const int now, const int from,\n\tconst vector<vector<int>>&edges,vector<int>&overs) {\n\n\tlong long int over_num=overs[now];\n\tDP v(2);\n\tv[0]=make_pair(over_num,0);\n\tv[1]=make_pair(over_num-1,0);\n\n\tvector<vector<pair<long long int,long long int>>>ps;\n\tfor (auto e : edges[now]) {\n\t\tif(e==from)continue;\n\t\tps.push_back(dfs(e,now,edges,overs));\n\t}\n\tsort(ps.begin(), ps.end(), [](const vector < pair<long long int, long long int>>&l, const vector<pair<long long int, long long int>>&r) {\n\t\treturn l.size()<r.size();\n\t});\n\tfor (auto p : ps) {\n\t\tv=connect(v,p);\n\t}\n\tfor (auto &k : v) {\n\t\tk.second+=abs(k.first);\n\t}\n\treturn v;\n}\nint main() {\n\tint N;cin>>N;\n\tvector<int>nums;\n\t{\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint a;cin>>a;\n\t\t\tnums.push_back(a);\n\t\t}\n\t\tlong long int sum=accumulate(nums.begin(),nums.end(),0ll);\n\t\tfor (auto &n : nums) {\n\t\t\tn-=sum/N;\n\t\t}\n\t}\n\tvector<vector<int>>edges(N);\n\tfor (int i = 0; i < N - 1; ++i) {\n\t\tint a,b;cin>>a>>b;a--;b--;\n\t\tedges[a].push_back(b);\n\t\tedges[b].push_back(a);\n\t}\n\tDP ans=dfs(0,-1,edges,nums);\n\tfor (int i = 0; i < ans.size(); ++i) {\n\t\tif(ans[i].first==0)cout<<ans[i].second<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4264,"score_of_the_acc":-0.0094,"final_rank":2},{"submission_id":"aoj_3048_3159541","code_snippet":"#include <bits/stdc++.h>\n#define INF 10000000000000007LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,short> P;\ntypedef pair<int,short> P2;\n\nint n;\nvector<int> G[5005];\nll x[5005];\nint u[5005],v[5005];\nll dp[5005][5005];\nll tmp[5005];\nll subsum[5005];\nint child[5005];\nll sum;\nll min_v=0;\nint tp=0;\n\nll labs(ll v){\n\tif(v<0LL)return -v;\n\treturn v;\n}\n\nll dfs(int v,int p){\n\tll su=x[v];\n\tfor(int i=0;i<G[v].size();i++){\n\t\tint nv=G[v][i];\n\t\tif(nv==p)continue;\n\t\tsu+=dfs(G[v][i],v);\n\t}\n\treturn subsum[v]=su;\n}\n\nint dfs1(int v,int p){\n\tint su=1;\n\tfor(int i=0;i<G[v].size();i++){\n\t\tint nv=G[v][i];\n\t\tif(nv==p)continue;\n\t\tsu+=dfs1(G[v][i],v);\n\t}\n\treturn child[v]=su;\n}\n\nvoid dfs2(int v,int p){\n\tint siz=0;\n\tfor(int i=0;i<G[v].size();i++){\n\t\tint nv=G[v][i];\n\t\tif(nv==p)continue;\n\t\tdfs2(G[v][i],v);\n\t\tfor(int j=0;j<=n;j++){\n\t\t\ttmp[j]=INF;\n\t\t}\n\t\tfor(int j=0;j<=siz;j++){\n\t\t\tfor(int k=0;k<=min(tp,child[nv]);k++){\n\t\t\t\tll nc=labs(subsum[nv]-child[nv]*min_v-k);\n\t\t\t\ttmp[j+k]=min(dp[v][j]+dp[nv][k]+nc,tmp[j+k]);\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=n;j++){\n\t\t\tdp[v][j]=tmp[j];\n\t\t}\n\t\tsiz+=child[nv];\n\t}\n\tfor(int i=n;i>=1;i--){\n\t\tdp[v][i]=min(dp[v][i],dp[v][i-1]);\n\t}\n}\n\nint main(void){\n\tscanf(\"%d\",&n);\n\tint S=n;\n\tint T=n+1;\n\tsum=0;\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\"%lld\",&x[i]);\n\t\tsum+=x[i];\n\t}\n\ttp=(ll)sum%n;\n\tmin_v=(ll)sum/n;\n\tfor(int i=0;i<n-1;i++){\n\t\tscanf(\"%d%d\",&u[i],&v[i]);\n\t\tu[i]--;\n\t\tv[i]--;\n\t\tG[u[i]].push_back(v[i]);\n\t\tG[v[i]].push_back(u[i]);\n\t}\n\tdfs(0,-1);\n\tdfs1(0,-1);\n\tdfs2(0,-1);\n\tprintf(\"%lld\\n\",dp[0][sum%n]);\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":199744,"score_of_the_acc":-0.5296,"final_rank":8},{"submission_id":"aoj_3048_3159406","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 5010\n\nvector<int> tree[SIZE];\n\nint n, x[SIZE];\nll dp[SIZE][SIZE][2];\nll ave, num_plus;\n\npair<int, ll> dfs(int now = 0, int back = -1, int cost = INF){ //{numOfChilds, sumOfChildsX} \n ll numOfChilds = 0, sum = 0;\n\n dp[now][0][0] = 0;\n \n for(int to : tree[now]){\n if(back == to) continue;\n auto res = dfs(to, now, 1);\n\n for(int i=0;i<=numOfChilds;i++){\n for(int j=0;j<=res.first;j++){\n dp[now][i+j][1] = min(dp[now][i+j][1], dp[now][i][0] + dp[to][j][0]);\n }\n }\n\n for(int i=0;i<=numOfChilds+res.first;i++){\n dp[now][i][0] = dp[now][i][1];\n dp[now][i][1] = LLINF;\n }\n \n numOfChilds += res.first;\n sum += res.second;\n }\n\n sum += x[now];\n numOfChilds += 1;\n \n for(int i=numOfChilds;i>=0;i--){\n ll add_cost = abs(sum - (ave*numOfChilds + (i+1))) * cost;\n dp[now][i+1][0] = min(dp[now][i+1][0], dp[now][i][0] + add_cost);\n ll add_cost2 = abs(sum - (ave*numOfChilds + i)) * cost;\n dp[now][i][0] = dp[now][i][0] + add_cost2; \n }\n \n return {numOfChilds, sum};\n}\n\nint main(){\n ll sumx = 0;\n \n scanf(\"%d\", &n);\n\n for(int i=0;i<n;i++){\n scanf(\"%d\", x+i);\n sumx += x[i];\n }\n\n ave = sumx / n;\n num_plus = sumx % n;\n \n for(int i=0;i<n-1;i++){\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--; v--;\n\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n\n for(int i=0;i<=n;i++)\n for(int j=0;j<=n;j++)\n dp[i][j][0] = dp[i][j][1] = LLINF;\n\n dfs();\n\n cout << dp[0][num_plus][0] << endl;\n \n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":395596,"score_of_the_acc":-1.0188,"final_rank":13},{"submission_id":"aoj_3048_3152667","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nll N,X[5001],R[5001],cnt[5001],sumr[5001];\nll dp[5001][5001];\nll dp2[2][5001];\nll tot=0,p=0,K;\nvector<int> g[5001];\n\nvoid dfs(int v,int pre){\n cnt[v]=1; sumr[v]=R[v];\n for(int nv : g[v]){\n if(nv==pre)continue;\n dfs(nv,v);\n cnt[v]+=cnt[nv]; sumr[v]+=sumr[nv];\n }\n int crt=0,nxt=1;\n rep(j,cnt[v]+1)dp2[crt][j]=INF;\n dp2[crt][0]=0;\n for(int nv : g[v]){\n if(nv==pre)continue;\n rep(j,cnt[v]+1)dp2[nxt][j]=INF;\n rep(j,cnt[v]+1){\n if(dp2[crt][j]==INF)break;\n rep(k,cnt[nv]+1){\n if(j+k<=cnt[v])minch(dp2[nxt][j+k],dp2[crt][j]+dp[nv][k]+llabs(sumr[nv]-k));\n else break;\n }\n }\n swap(crt,nxt);\n }\n rep(j,cnt[v]+1){\n dp[v][j]=dp2[crt][j];\n if(j>0)minch(dp[v][j],dp2[crt][j-1]);\n }\n}\n\nint main(){\n scanf(\"%lld\",&N);\n rep(i,N){\n scanf(\"%lld\",X+i);\n p+=X[i]; tot+=X[i];\n }\n p/=N; K=tot-N*p;\n rep(i,N){\n R[i]=X[i]-p;\n }\n rep(i,N-1){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n a--;b--;\n g[a].push_back(b); g[b].push_back(a);\n }\n dfs(0,-1);\n cout<<dp[0][K]<<endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":121020,"score_of_the_acc":-0.3029,"final_rank":5},{"submission_id":"aoj_3048_3152359","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nconst Int MAX = 5050;\nconst Int INF = 1e17;\nInt dp[MAX][MAX];\nsigned main(){\n Int n;\n cin>>n;\n vector<Int> a(n);\n for(Int i=0;i<n;i++) cin>>a[i];\n\n Int s=0;\n for(Int i=0;i<n;i++) s+=a[i];\n Int x=s/n;\n \n vector<vector<Int> > G(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n cin>>a>>b;\n a--;b--;\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n\n vector<Int> sz(n,1);\n function<void(Int, Int)> dfs=\n [&](Int v,Int p){ \n for(Int u:G[v])\n\tif(u!=p) dfs(u,v),a[v]+=a[u];\n \n for(Int i=0;i<MAX;i++) dp[v][i]=INF;\n dp[v][0]=dp[v][1]=0;\n for(Int u:G[v]){\n\tif(u==p) continue;\n\tvector<Int> nx(sz[v]+sz[u]+2,INF);\n\tfor(Int i=0;i<=sz[v];i++)\n\t for(Int j=0;j<=sz[u];j++)\n\t chmin(nx[i+j],dp[v][i]+dp[u][j]+abs(a[u]-((x+1)*j+x*(sz[u]-j))));\n\t\n\tsz[v]+=sz[u];\n\tfor(Int i=0;i<=sz[v];i++) dp[v][i]=nx[i];\n }\n }; \n\n dfs(0,-1); \n cout<<dp[0][s%n]<<endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":201124,"score_of_the_acc":-0.5194,"final_rank":7},{"submission_id":"aoj_3048_3146610","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n\nint n;\nll x[5252];\nvi g[5252];\n\nll sum, a;\n\nint cnt[5252];\nll subsum[5252];\n\nvoid dfs1(int p, int bef){\n cnt[p] = 1;\n subsum[p] = x[p];\n for(int to : g[p])if(to != bef){\n dfs1(to, p);\n cnt[p] += cnt[to];\n subsum[p] += subsum[to];\n }\n}\n\nll dp[5252][5252]; // dp[p][b] := b個がa+1, cnt[p]-b個がaになる時の最小コスト, b<=cnt[p]\nll tmp[5252];\nvoid dfs2(int p, int bef){\n dp[p][0] = dp[p][1] = 0;\n int m = 2;\n for(int to : g[p])if(to != bef){\n dfs2(to, p);\n // merge\n REP(i,cnt[to]+m)tmp[i] = 1ll<<60;\n REP(i,cnt[to]+1)REP(j,m){\n CHMIN(tmp[i+j], dp[to][i]+dp[p][j]);\n }\n REP(i,cnt[to]+m)dp[p][i] = tmp[i];\n m += cnt[to];\n }\n REP(i,m){\n ll sm = a*cnt[p] + i;\n dp[p][i] += abs(sm-subsum[p]);\n }\n}\n\nint main(){\n scanf(\"%d\",&n);\n REP(i,n)scanf(\"%lld\",x+i);\n REP(i,n-1){\n int u,v;\n scanf(\"%d%d\",&u,&v);\n --u;--v;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n sum = accumulate(x,x+n,0ll);\n a = sum/n;\n dfs1(0,-1);\n dfs2(0,-1);\n printf(\"%lld\\n\",dp[0][sum%n]);\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":121424,"score_of_the_acc":-0.3039,"final_rank":6},{"submission_id":"aoj_3048_3145628","code_snippet":"#include <bits/stdc++.h>\n#define INF 10000000000000007LL\n#define INF2 5005LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,int> P;\n\nstruct RadixHeap{\n\tvector<P> v[65];\n\tint sz;\n\tint last;\n\tRadixHeap(){\n\t\tlast=0;\n\t\tsz=0;\n\t}\n\tint bsr(int x){\n\t\tif(x==0)return -1;\n\t\treturn 63-__builtin_clz(x);\n\t}\n\tvoid push(P p){\n\t\tassert(last<=p.first);\n\t\tsz++;\n\t\tv[bsr(p.first^last)+1].push_back(p);\n\t}\n\tP top(){\n\t\treturn pop(false);\n\t}\n\tP pop(bool flag=true){\n\t\tassert(sz);\n\t\tif(!v[0].size()){\n\t\t\tint i=1;\n\t\t\twhile(!v[i].size())i++;\n\t\t\tlast=min_element(v[i].begin(),v[i].end())->first;\n\t\t\tfor(int j=0;j<v[i].size();j++){\n\t\t\t\tv[bsr(v[i][j].first^last)+1].push_back(v[i][j]);\n\t\t\t}\n\t\t\tv[i].clear();\n\t\t}\n\t\tP best=v[0].back();\n\t\tif(flag){\n\t\t\tv[0].pop_back();\n\t\t\tsz--;\n\t\t}\n\t\treturn best;\n\t}\n};\n\n\nstruct edge{\n\tint to,rev;\n\tll cap,cost;\n\tedge(){}\n\tedge(int t,ll c,ll co,int r){\n\t\tto=t;\n\t\tcap=c;\n\t\tcost=co;\n\t\trev=r;\n\t}\n};\n\nstruct mincostflow{\n\tedge G[5005][5005];\n\tint siz[5005];\n\tll h[5005];\n\tll dist[5005];\n\tint prevv[5005],preve[5005];\n\n\tvoid add_edge(int from,int to,ll cap,ll cost){\n\t\t//printf(\"%d %d %lld %lld\\n\",from,to,cap,cost);\n\t\tG[from][siz[from]++]=edge(to,cap,cost,siz[to]);\n\t\tG[to][siz[to]++]=edge(from,0,-cost,siz[from]-1);\n\t}\n\n\tll min_cost_flow(int s,int t,ll f,int V){\n\t\tll res=0;\n\t\tfill(h,h+V,0);\n\t\t//printf(\"%d %d %lld %d\\n\",s,t,f,V);\n\t\twhile(f>0LL){\n\t\t\t//priority_queue<P,vector<P>,greater<P> > que;\n\t\t\tRadixHeap que;\n\t\t\tfill(dist,dist+V,INF);\n\t\t\tdist[s]=0;\n\t\t\tque.push(P(0,s));\n\t\t\twhile(que.sz>0){\n\t\t\t\tP p=que.pop();\n\t\t\t\tint v=p.second;\n\t\t\t\tif(dist[v]<p.first)continue;\n\t\t\t\tfor(int i=0;i<siz[v];i++){\n\t\t\t\t\tedge &e=G[v][i];\n\t\t\t\t\tif(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\n\t\t\t\t\t\tdist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\t\t\t\t\t\tprevv[e.to]=v;\n\t\t\t\t\t\tpreve[e.to]=i;\n\t\t\t\t\t\tque.push(P(dist[e.to],e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(dist[t]==INF)return -1;\n\t\t\tfor(int v=0;v<V;v++){\n\t\t\t\th[v]+=dist[v];\n\t\t\t}\n\t\t\tll d=f;\n\t\t\tfor(int v=t;v!=s;v=prevv[v]){\n\t\t\t\td=min(d,G[prevv[v]][preve[v]].cap);\n\t\t\t}\n\t\t\tf-=d;\n\t\t\tres+=d*h[t];\n\t\t\tfor(int v=t;v!=s;v=prevv[v]){\n\t\t\t\tedge &e=G[prevv[v]][preve[v]];\n\t\t\t\te.cap-=d;\n\t\t\t\tG[v][e.rev].cap+=d;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\n\nmincostflow mi;\n\nint n;\nll x[5005];\nint u[5005],v[5005];\n\nint main(void){\n\tscanf(\"%d\",&n);\n\tint S=n;\n\tint T=n+1;\n\tll sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tscanf(\"%lld\",&x[i]);\n\t\t\n\t\tsum+=x[i];\n\t}\n\tll sum2=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(x[i]>=(sum/n)){\n\t\t\tif(x[i]-sum/n>0)mi.add_edge(S,i,x[i]-(sum/n),0);\n\t\t\tsum2+=sum/n;\n\t\t}\n\t\tif(x[i]<(sum/n)){\n\t\t\tsum2+=x[i];\n\t\t\tmi.add_edge(i,T,(ll)(sum/n)-x[i],0);\n\t\t}\n\t\tmi.add_edge(i,T,1,INF2);\n\t}\n\tfor(int i=0;i<n-1;i++){\n\t\tscanf(\"%d%d\",&u[i],&v[i]);\n\t\tu[i]--;\n\t\tv[i]--;\n\t\tmi.add_edge(u[i],v[i],INF,1);\n\t\tmi.add_edge(v[i],u[i],INF,1);\n\t}\n\t//printf(\"%lld %lld\\n\",sum,sum2);\n\tll ans=mi.min_cost_flow(S,T,sum-sum2,T+1);\n\tprintf(\"%lld\\n\",ans-INF2*(sum-(sum/n)*n));\n\treturn 0;\n}","accuracy":0.8679245283018868,"time_ms":1870,"memory_kb":24044,"score_of_the_acc":-0.8857,"final_rank":19},{"submission_id":"aoj_3048_3145351","code_snippet":"#include<bits/stdc++.h>\n#define X first\n#define Y sevcond\n#define pb emplace_back\n#define eb pb\n#define rep(X,Y) for(int X=0;X<(Y);++X)\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\n#define all(X) (X).begin(),(X).end()\n#define rall(X) (X).rbegin(),(X).rend()\n\nusing namespace std;\nusing ll=long long;\nconst ll INF=1e18;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tvector<int> xs(n);\n\tusing Graph=vector<vector<int>>;\n\tGraph g(n);\n\trep(i,n) cin>>xs[i];\n\tint t;\n\t{\n\t\tll s=accumulate(all(xs),0ll);\n\t\trep(i,n) xs[i]-=s/n;\n\t\tt=s%n;\n\t}\n\trep(i,n-1){\n\t\tint x,y;\n\t\tcin>>x>>y; --x; --y;\n\t\tg[x].pb(y);\n\t\tg[y].pb(x);\n\t}\n\tvector<ll> sum(n),sz(n);\n\t{\n\t\tfunction<void(int,int)> dfs=\n\t\t\t[&](int v,int p){\n\t\t\t\t++sz[v]; sum[v]+=xs[v];\n\t\t\t\tfor(int w:g[v])if(w!=p){\n\t\t\t\t\t\tdfs(w,v);\n\t\t\t\t\t\tsum[v]+=sum[w];\n\t\t\t\t\t\tsz[v]+=sz[v];\n\t\t\t\t\t}\n\t\t\t};\n\t\tdfs(0,-1);\n\t}\n\tvector<vector<ll>> dp(n);\n\tfunction<void(int,int)> dfs=\n\t\t[&](int v,int p){\n\t\t\tdp[v].pb(0);\n\t\t\tfor(int w:g[v])if(w!=p){\n\t\t\t\t\tdfs(w,v);\n\t\t\t\t\tauto tmp=dp[v];\n\t\t\t\t\tdp[v].clear();\n\t\t\t\t\tdp[v].resize(tmp.size()+dp[w].size(),INF);\n\t\t\t\t\trep(i,tmp.size())rep(j,dp[w].size()){\n\t\t\t\t\t\tdp[v][i+j]=min(dp[v][i+j],tmp[i]+dp[w][j]+abs(j-sum[w]));\n\t\t\t\t\t\tdp[v][i+j+1]=min(dp[v][i+j+1],tmp[i]+dp[w][j]+abs(j+1-sum[w]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t};\n\tdfs(0,-1);\n\t// rep(i,n){\n\t// \tcout<<i<<endl;\n\t// \tfor(auto x:dp[i]) cout<<x<<\",\";cout<<endl;\n\t// }\n\tcout<<min(dp[0][t],dp[0][max(0,t-1)])<<endl;\n}","accuracy":1,"time_ms":50,"memory_kb":101832,"score_of_the_acc":-0.2509,"final_rank":3},{"submission_id":"aoj_3048_3145350","code_snippet":"#include<deque>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<set>\n#include<cmath>\n#include<tuple>\n#include<string>\n#include<chrono>\n#include<functional>\n#include<iterator>\n#include<random>\n#include<unordered_set>\n#include<array>\n#include<map>\n#include<iomanip>\n#include<assert.h>\n#include<bitset>\n#include<stack>\n#include<memory>\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/*\ncout<<fixed<<setprecision(20);\ncin.tie(0);\nios::sync_with_stdio(false);\n*/\nconst llint mod=1000000007;\nconst llint big=2.19e18+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-15;\ntemplate <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\nvector<llint>X;\nvector<vector<int>>go;\npair<vector<llint>,llint>dfs(int ter,int per){\n\tllint ofset=X[ter];\n\tvector<llint>ans(2);\n\tint i,j;\n\tfor(auto it:go[ter]){\n\t\tif(it==per){continue;}\n\t\tauto ret=dfs(it,ter);\n\t\tofset+=ret.sec;\n\t\t//ここでマージする、本当は凸性を使ったマージができるが、O(n^2)が間に合うし、凸性使ってもO(n^2)ので使わない\n\t\tvector<llint>iti(ans.size()+ret.fir.size()-1,big);\n\t\tfor(i=0;i<ans.size();i++){\n\t\t\tfor(j=0;j<ret.fir.size();j++){\n\t\t\t\tmineq(iti[i+j],ans[i]+ret.fir[j]);\n\t\t\t}\n\t\t}\n\t\tans=move(iti);\n\t}\n\tfor(i=0;i<ans.size();i++){ans[i]+=abs(ofset-i);}\n\treturn mp(ans,ofset);\n}\nint main(void){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n,i;cin>>n;\n\tX.res(n);\n\tgo.res(n);\n\tllint wa=0;\n\tfor(i=0;i<n;i++){cin>>X[i];wa+=X[i];}\n\tfor(i=0;i<n;i++){X[i]-=wa/n;}\n\tfor(i=0;i<n-1;i++){\n\t\tint u,v;cin>>u>>v;u--;v--;\n\t\tgo[u].pub(v);\n\t\tgo[v].pub(u);\n\t}\n\tcout<<dfs(0,-1).fir[wa%n]<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4164,"score_of_the_acc":-0.0001,"final_rank":1},{"submission_id":"aoj_3048_3145338","code_snippet":"#include<deque>\n#include<queue>\n#include<vector>\n#include<algorithm>\n#include<iostream>\n#include<set>\n#include<cmath>\n#include<tuple>\n#include<string>\n#include<chrono>\n#include<functional>\n#include<iterator>\n#include<random>\n#include<unordered_set>\n#include<array>\n#include<map>\n#include<iomanip>\n#include<assert.h>\n#include<bitset>\n#include<stack>\n#include<memory>\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/*\ncout<<fixed<<setprecision(20);\ncin.tie(0);\nios::sync_with_stdio(false);\n*/\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>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\nvector<llint>X;\nvector<vector<int>>go;\npair<vector<llint>,llint>dfs(int ter,int per){\n\tllint ofset=X[ter];\n\tvector<llint>ans(2);\n\tint i,j;\n\tfor(auto it:go[ter]){\n\t\tif(it==per){continue;}\n\t\tauto ret=dfs(it,ter);\n\t\tofset+=ret.sec;\n\t\t//ここでマージする、本当は凸性を使ったマージができるが、O(n^2)が間に合うし、凸性使ってもO(n^2)ので使わない\n\t\tvector<llint>iti(ans.size()+ret.fir.size()-1,big);\n\t\t\n\t\tfor(i=0;i<ans.size();i++){\n\t\t\tfor(j=0;j<ret.fir.size();j++){\n\t\t\t\tmineq(iti[i+j],ans[i]+ret.fir[j]);\n\t\t\t}\n\t\t}\n\t\tans=move(iti);\n\t}\n\tfor(i=0;i<ans.size();i++){ans[i]+=abs(ofset-i);}\n\treturn mp(ans,ofset);\n}\nint main(void){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n,i;cin>>n;\n\tX.res(n);\n\tgo.res(n);\n\tllint wa=0;\n\tfor(i=0;i<n;i++){cin>>X[i];wa+=X[i];}\n\tfor(i=0;i<n;i++){X[i]-=wa/n;}\n\tfor(i=0;i<n-1;i++){\n\t\tint u,v;cin>>u>>v;u--;v--;\n\t\tgo[u].pub(v);\n\t\tgo[v].pub(u);\n\t}\n\tcout<<dfs(0,-1).fir[wa%n]<<endl;\n\treturn 0;\n}","accuracy":0.9811320754716981,"time_ms":30,"memory_kb":4124,"score_of_the_acc":0,"final_rank":17},{"submission_id":"aoj_3048_3145337","code_snippet":"//これもっと解かれててよくないか\n#include<bits/stdc++.h>\n#define X first\n#define Y sevcond\n#define pb emplace_back\n#define eb pb\n#define rep(X,Y) for(int X=0;X<(Y);++X)\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\n#define all(X) (X).begin(),(X).end()\n#define rall(X) (X).rbegin(),(X).rend()\n\nusing namespace std;\nusing ll=long long;\nconst ll INF=1e15;\n\nint main(){\n\tint n;\n\tcin>>n;\n\tvector<int> xs(n);\n\tusing Graph=vector<vector<int>>;\n\tGraph g(n);\n\trep(i,n) cin>>xs[i];\n\tint t;\n\t{\n\t\tll s=accumulate(all(xs),0ll);\n\t\trep(i,n) xs[i]-=s/n;\n\t\tt=s%n;\n\t}\n\trep(i,n-1){\n\t\tint x,y;\n\t\tcin>>x>>y; --x; --y;\n\t\tg[x].pb(y);\n\t\tg[y].pb(x);\n\t}\n\tvector<ll> sum(n),sz(n);\n\t{\n\t\tfunction<void(int,int)> dfs=\n\t\t\t[&](int v,int p){\n\t\t\t\t++sz[v]; sum[v]+=xs[v];\n\t\t\t\tfor(int w:g[v])if(w!=p){\n\t\t\t\t\t\tdfs(w,v);\n\t\t\t\t\t\tsum[v]+=sum[w];\n\t\t\t\t\t\tsz[v]+=sz[v];\n\t\t\t\t\t}\n\t\t\t};\n\t\tdfs(0,-1);\n\t}\n\tvector<vector<ll>> dp(n);\n\tfunction<void(int,int)> dfs=\n\t\t[&](int v,int p){\n\t\t\tdp[v].pb(0);\n\t\t\tfor(int w:g[v])if(w!=p){\n\t\t\t\t\tdfs(w,v);\n\t\t\t\t\tauto tmp=dp[v];\n\t\t\t\t\tdp[v].clear();\n\t\t\t\t\tdp[v].resize(tmp.size()+dp[w].size(),INF);\n\t\t\t\t\trep(i,tmp.size())rep(j,dp[w].size()){\n\t\t\t\t\t\tdp[v][i+j]=min(dp[v][i+j],tmp[i]+dp[w][j]+abs(j-sum[w]));\n\t\t\t\t\t\tdp[v][i+j+1]=min(dp[v][i+j+1],tmp[i]+dp[w][j]+abs(j+1-sum[w]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t};\n\tdfs(0,-1);\n\t// rep(i,n){\n\t// \tcout<<i<<endl;\n\t// \tfor(auto x:dp[i]) cout<<x<<\",\";cout<<endl;\n\t// }\n\tcout<<min(dp[0][t],dp[0][max(0,t-1)])<<endl;\n}","accuracy":0.9811320754716981,"time_ms":50,"memory_kb":101724,"score_of_the_acc":-0.2506,"final_rank":18},{"submission_id":"aoj_3048_3135486","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\ntypedef long long ll;\nconst int MAX_V = 5005;\n\ntypedef pair< int , int > P;\n\nconst ll INF=1000000000LL;\n\nconst ll capmx=10000000000000LL;\n\nstruct edge { ll to,cap,cost,rev; };\n\nint V;\nvector<edge> G[MAX_V];\nll h[MAX_V];\nint dist[MAX_V];\nll prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\n\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\n}\n\nll min_cost_flow(int s,int t,ll &f){\n ll res = 0;\n fill(h,h+V,0);\n \n while(f>0){\n\n queue<int> que;\n \n memset( dist , 1 , sizeof( dist ) );\n dist[s]=0;\n que.push( s );\n while( !que.empty() ){\n int key = que.front(); que.pop();\n int v = key%MAX_V;\n int cost = key/MAX_V;\n \n if(dist[v]<cost)continue;\n if(v==t)continue;\n \n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(dist[e.to]*MAX_V+e.to);\n }\n }\n }\n if(dist[t]==dist[MAX_V-1]){\n break;\n }\n for(int v=0;v<V;v++){\n h[v]+=dist[v];\n }\n ll d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=(ll)d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n if( prevv[v] == s )break;\n G[v][e.rev].cap += d;\n }\n }\n\n return res;\n}\n\n\n\n\nll In[5000];\nll Out[5000];\nll Size[5000];\nvector<int> g[5000];\nint parent[5000];\n\nvoid dfs(int pos,int prev){\n parent[pos]=prev;\n for(int i=0;i<(int)g[pos].size();i++){\n int to=g[pos][i];\n if(to==prev)continue;\n dfs(to,pos);\n In[pos]+=In[to];\n Out[pos]+=Out[to];\n Size[pos]+=Size[to];\n }\n}\n\n\nint main(){\n ll n, sum=0;\n ll x[5000];\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>x[i];\n sum+=x[i];\n }\n \n int si=n;\n int ti=n+1;\n \n V=ti+1;\n \n for(int i=0;i+1<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\n\n int root = rand() % n;\n \n ll tmp=sum;\n for(int i=0;i<n;i++){\n Size[i]=1;\n In[i]=Out[i]=0;\n \n ll p= min(sum/n , x[i]);\n tmp-=p;\n if(x[i]-p>0){\n add_edge(si,i,x[i]-p,0, true);\n In[i] = x[i]-p;\n }\n\n if( sum/n-p > 0 ){\n add_edge(i,ti, sum/n-p , 0 );\n Out[i] = (sum/n-p);\n }\n }\n \n dfs( root ,-1);\n \n\n for(int i=0;i<n;i++){\n if( i== root )continue;\n \n ll U=In[i]-Out[i];\n // add_edge( i, parent[i], capmx , 1);\n // add_edge( parent[i], i, capmx , 1);\n \n if( U <= 0 ){\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\n\n }else{\n add_edge( i,parent[i] , U , 1);\n \n if( min(sum%n,Size[i])-U >0 ){\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\n }\n }\n \n }\n \n for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\n\n ll ans=min_cost_flow(si,ti,tmp);\n\n ans -= 5000LL * (sum%n);\n\n cout<< ans <<endl;\n return 0;\n}","accuracy":1,"time_ms":1330,"memory_kb":5020,"score_of_the_acc":-0.5931,"final_rank":9},{"submission_id":"aoj_3048_3135469","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned int uint;\n\nint bar(uint x){\n if(x==0)return -1;\n return 31- __builtin_clz(x);\n}\nstruct RadixHeapInt {\n uint v[33][5005];\n uint w[33];\n uint last,sz;\n \n RadixHeapInt() {\n memset( w , 0, sizeof(w) );\n last = sz = 0;\n }\n \n void push(uint x){\n sz++;\n v[ bar(x^last)+1 ][ w[ bar(x^last)+1 ] ]=x;\n w[ bar(x^last)+1 ]++;\n }\n \n uint pop(){\n if( !w[0] ){\n int i=1;\n while( !w[i] )i++;\n uint new_last =\n *min_element(v[i] , v[i]+w[i] );\n \n for(int j=0;j<(int)w[i];j++){\n uint x=v[i][j];\n v[ bar(x^new_last)+1 ][ w[bar(x^new_last)+1] ]=x;\n w[bar(x^new_last)+1]++;\n }\n last = new_last;\n w[i]=0;\n }\n sz--;\n w[0]--;\n return last;\n }\n};\n\ntypedef long long ll;\nconst int MAX_V = 5005;\n\ntypedef pair< int , int > P;\n\nconst ll INF=1000000000LL;\n\nconst ll capmx=10000000000000LL;\n\nstruct edge { ll to,cap,cost,rev; };\n\nint V;\nvector<edge> G[MAX_V];\nll h[MAX_V];\nint dist[MAX_V];\nll prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\n if( flag )return;\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\n}\n\n\nRadixHeapInt que;\n\nll min_cost_flow(int s,int t,ll &f){\n ll mini = INF;\n ll res = 0;\n //fill(h,h+V,0);\n // h[t]=0;\n \n while(f>0){\n // que.last=0;\n\n queue<int> que;\n \n memset( dist , 1 , sizeof( dist ) );\n dist[s]=0;\n que.push( s );\n while( !que.empty() ){\n uint key = que.front(); que.pop();\n int v = key%MAX_V;\n int cost = key/MAX_V;\n if(dist[v]<cost)continue;\n if(v==t)continue;\n \n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\n mini = min( mini , e.cost+h[v]-h[e.to] );\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(dist[e.to]*MAX_V+e.to);\n }\n }\n }\n if(dist[t]==dist[MAX_V-1]){\n break;\n }\n for(int v=0;v<V;v++){\n h[v]+=dist[v];\n }\n ll d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=(ll)d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n if( prevv[v] == s )break;\n G[v][e.rev].cap += d;\n }\n }\n\n return res;\n}\n\n\n\n\nll In[5000];\nll Out[5000];\nll Size[5000];\nvector<int> g[5000];\nint parent[5000];\n\nvoid dfs(int pos,int prev){\n parent[pos]=prev;\n for(int i=0;i<(int)g[pos].size();i++){\n int to=g[pos][i];\n if(to==prev)continue;\n dfs(to,pos);\n In[pos]+=In[to];\n Out[pos]+=Out[to];\n Size[pos]+=Size[to];\n }\n}\n\n\nint main(){\n ll n, sum=0;\n ll x[5000];\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>x[i];\n sum+=x[i];\n }\n \n int si=n;\n int ti=n+1;\n \n V=ti+1;\n \n for(int i=0;i+1<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\n\n int root = rand() % n;\n \n ll tmp=sum;\n for(int i=0;i<n;i++){\n Size[i]=1;\n In[i]=Out[i]=0;\n \n ll p= min(sum/n , x[i]);\n tmp-=p;\n if(x[i]-p>0){\n add_edge(si,i,x[i]-p,0, true);\n In[i] = x[i]-p;\n }\n\n if( sum/n-p > 0 ){\n add_edge(i,ti, sum/n-p , 0 );\n Out[i] = (sum/n-p);\n }\n }\n \n dfs( root ,-1);\n \n\n for(int i=0;i<n;i++){\n if( i== root )continue;\n \n ll U=In[i]-Out[i];\n // add_edge( i, parent[i], capmx , 1);\n // add_edge( parent[i], i, capmx , 1);\n \n if( U <= 0 ){\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\n\n }else{\n add_edge( i,parent[i] , U , 1);\n \n if( min(sum%n,Size[i])-U >0 ){\n //add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\n }\n }\n \n }\n \n // for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\n\n ll ans=min_cost_flow(si,ti,tmp);\n\n \n for(int i=0;i<n;i++) add_edge(i,ti, 1, 0LL);\n\n \n\n for(int i=0;i<n;i++){\n if( i== root )continue;\n ll U=In[i]-Out[i];\n // add_edge( i, parent[i], capmx , 1);\n // add_edge( parent[i], i, capmx , 1);\n if( U <= 0 ){\n // add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\n }else{\n // add_edge( i,parent[i] , U , 1);\n \n if( min(sum%n,Size[i])-U >0 ){\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\n }\n }\n \n }\n ans += min_cost_flow(si,ti,tmp );\n \n //ans -= 5000LL * (sum%n);\n\n cout<< ans <<endl;\n return 0;\n}","accuracy":1,"time_ms":1350,"memory_kb":4980,"score_of_the_acc":-0.6021,"final_rank":10},{"submission_id":"aoj_3048_3135416","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned int uint;\n\nint bar(uint x){\n if(x==0)return -1;\n return 31- __builtin_clz(x);\n}\nstruct RadixHeapInt {\n uint v[33][5005];\n uint w[33];\n uint last,sz;\n \n RadixHeapInt() {\n memset( w , 0, sizeof(w) );\n last = sz = 0;\n }\n \n void push(uint x){\n sz++;\n v[ bar(x^last)+1 ][ w[ bar(x^last)+1 ] ]=x;\n w[ bar(x^last)+1 ]++;\n }\n \n uint pop(){\n if( !w[0] ){\n int i=1;\n while( !w[i] )i++;\n uint new_last =\n *min_element(v[i] , v[i]+w[i] );\n \n for(int j=0;j<(int)w[i];j++){\n uint x=v[i][j];\n v[ bar(x^new_last)+1 ][ w[bar(x^new_last)+1] ]=x;\n w[bar(x^new_last)+1]++;\n }\n last = new_last;\n w[i]=0;\n }\n sz--;\n w[0]--;\n return last;\n }\n};\n\ntypedef long long ll;\nconst int MAX_V = 5005;\n\ntypedef pair< int , int > P;\n\nconst ll INF=1000000000LL;\n\nconst ll capmx=10000000000000LL;\n\nstruct edge { ll to,cap,cost,rev; };\n\nint V;\nvector<edge> G[MAX_V];\nll h[MAX_V];\nint dist[MAX_V];\nll prevv[MAX_V],preve[MAX_V];\n\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\n if( flag )return;\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\n}\n\n\nRadixHeapInt que;\n\nll min_cost_flow(int s,int t,ll &f){\n ll mini = INF;\n ll res = 0;\n //fill(h,h+V,0);\n // h[t]=0;\n // cout<< f << ' ' <<h[t] <<endl;\n // res -= f*h[t];\n \n while(f>0){\n que.last=0;\n memset( dist , 1 , sizeof( dist ) );\n dist[s]=0;\n que.push( s );\n while( que.sz ){\n uint key = que.pop();\n int v = key%MAX_V;\n int cost = key/MAX_V;\n if(dist[v]<cost)continue;\n if(v==t)continue;\n \n for(int i=0;i<(int)G[v].size();i++){\n edge &e = G[v][i];\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n\n mini = min( mini , e.cost+h[v]-h[e.to] );\n prevv[e.to]=v;\n preve[e.to]=i;\n que.push(dist[e.to]*MAX_V+e.to);\n }\n }\n }\n if(dist[t]==dist[MAX_V-1]){\n break;\n }\n for(int v=0;v<V;v++){\n h[v]+=dist[v];\n }\n ll d=f;\n for(int v=t;v!=s;v=prevv[v]){\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\n }\n f-=d;\n res+=(ll)d*h[t];\n for(int v=t;v!=s;v=prevv[v]){\n\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n if( prevv[v] == s )break;\n G[v][e.rev].cap += d;\n }\n }\n // cout<<mini<<endl;\n return res;\n}\n\n\n\n\nll In[5000];\nll Out[5000];\nll Size[5000];\nvector<int> g[5000];\nint parent[5000];\n\nvoid dfs(int pos,int prev){\n parent[pos]=prev;\n for(int i=0;i<(int)g[pos].size();i++){\n int to=g[pos][i];\n if(to==prev)continue;\n dfs(to,pos);\n In[pos]+=In[to];\n Out[pos]+=Out[to];\n Size[pos]+=Size[to];\n }\n}\n\n\nint main(){\n ll n, sum=0;\n ll x[5000];\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>x[i];\n sum+=x[i];\n }\n \n int si=n;\n int ti=n+1;\n \n V=ti+1;\n \n for(int i=0;i+1<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\n\n int root = rand() % n;\n \n ll tmp=sum;\n for(int i=0;i<n;i++){\n Size[i]=1;\n In[i]=Out[i]=0;\n \n ll p= min(sum/n , x[i]);\n tmp-=p;\n if(x[i]-p>0){\n add_edge(si,i,x[i]-p,0, true);\n In[i] = x[i]-p;\n }\n\n if( sum/n-p > 0 ){\n add_edge(i,ti, sum/n-p , 0 );\n Out[i] = (sum/n-p);\n }\n }\n \n dfs( root ,-1);\n \n\n for(int i=0;i<n;i++){\n if( i== root )continue;\n \n ll U=In[i]-Out[i];\n // add_edge( i, parent[i], capmx , 1);\n // add_edge( parent[i], i, capmx , 1);\n \n if( U <= 0 ){\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\n }else{\n add_edge( i,parent[i] , U , 1);\n \n if( min(sum%n,Size[i])-U >0 ){\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\n }\n }\n \n }\n \n // for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\n\n ll ans=min_cost_flow(si,ti,tmp);\n\n for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\n ans += min_cost_flow(si,ti,tmp );\n \n ans -= 5000LL * (sum%n);\n\n cout<< ans <<endl;\n return 0;\n}","accuracy":1,"time_ms":2230,"memory_kb":5116,"score_of_the_acc":-1.0025,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_3048_6114054\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> Pi;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\\n#define rrep(i,n) for(ll i=n-1;i>=0;i--)\\n#define rFOR(i,a,b) for(ll i=a-1;i>=b;i--)\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<\\\"(\\\"<<d.real()<<\\\", \\\"<<d.imag()<< \\\")\\\";}\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<\\\"(\\\"<<d.first<<\\\", \\\"<<d.second<<\\\")\\\";}\\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<\\\" \\\";}return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<\\\"{ \\\";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \\\", \\\";}s<<(*itr);}s<<\\\" }\\\";return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<\\\"{ \\\";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \\\", \\\";}s<<(*itr);}s<<\\\" }\\\";return s;}\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<\\\"{\\\"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<\\\" \\\"<<(*itr).first<<\\\" : \\\"<<(*itr).second<<endl;}s<<\\\"}\\\"<<endl;return s;}\\ntemplate<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\\ntemplate<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\\n\\nconst ll mod=1'000'000'007;\\nconst ll inf=1'000'000'000'000'000'00;\\nconst int INF=1'000'000'000;\\nconst double EPS=1e-10;\\nconst double PI=acos(-1);\\n\\nconst int N=5100;\\nll dp[N][N],ndp[N][N];\\nll sum[N],sz[N];\\n\\nint main(){\\n cin.tie(0);ios::sync_with_stdio(false);\\n ll n;\\n cin>>n;\\n vector<ll> x(n);\\n ll all=0;\\n rep(i,n){\\n cin>>x[i];\\n all+=x[i];\\n }\\n vector<vector<ll>> g(n);\\n rep(i,n-1){\\n ll u,v;\\n cin>>u>>v;\\n u--,v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n ll k=all%n,num=all/n;\\n rep(i,N)rep(j,N) dp[i][j]=inf;\\n auto dfs=[&](auto &&dfs,ll v,ll pre)->void{\\n vector<ll> tos;\\n sz[v]=1;\\n sum[v]=x[v];\\n for(auto &&to:g[v]){\\n if(to==pre) continue;\\n dfs(dfs,to,v);\\n tos.push_back(to);\\n sz[v]+=sz[to];\\n sum[v]+=sum[to];\\n }\\n rep(i,tos.size()+1)rep(j,sz[v]+1) ndp[i][j]=inf;\\n ndp[0][0]=0;\\n ll cur=1;\\n rep(i,tos.size()){\\n ll to=tos[i];\\n rep(j1,cur+1)rep(j2,sz[to]+1){\\n if(ndp[i][j1]==inf || dp[to][j2]==inf) continue;\\n if(j1+j2>k) continue;\\n chmin(ndp[i+1][j1+j2], ndp[i][j1]+dp[to][j2]);\\n }\\n cur+=sz[to];\\n }\\n rep(j,k+1)if(ndp[tos.size()][j]!=inf){\\n chmin(dp[v][j], ndp[tos.size()][j]+abs(num*sz[v]+j-sum[v]));\\n chmin(dp[v][j+1], ndp[tos.size()][j]+abs(num*sz[v]+j+1-sum[v]));\\n }\\n };\\n dfs(dfs,0,-1);\\n cout<<dp[0][k]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 408192,\n \"score_of_the_acc\": -1.0273,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3048_6114025\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> Pi;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\\n#define rrep(i,n) for(ll i=n-1;i>=0;i--)\\n#define rFOR(i,a,b) for(ll i=a-1;i>=b;i--)\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<\\\"(\\\"<<d.real()<<\\\", \\\"<<d.imag()<< \\\")\\\";}\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<\\\"(\\\"<<d.first<<\\\", \\\"<<d.second<<\\\")\\\";}\\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<\\\" \\\";}return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<\\\"{ \\\";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \\\", \\\";}s<<(*itr);}s<<\\\" }\\\";return s;}\\ntemplate<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<\\\"{ \\\";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< \\\", \\\";}s<<(*itr);}s<<\\\" }\\\";return s;}\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<\\\"{\\\"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<\\\" \\\"<<(*itr).first<<\\\" : \\\"<<(*itr).second<<endl;}s<<\\\"}\\\"<<endl;return s;}\\ntemplate<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }\\ntemplate<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }\\n\\nconst ll mod=1'000'000'007;\\nconst ll inf=1'000'000'000'000'000'00;\\nconst int INF=1'000'000'000;\\nconst double EPS=1e-10;\\nconst double PI=acos(-1);\\n\\nint main(){\\n cin.tie(0);ios::sync_with_stdio(false);\\n ll n;\\n cin>>n;\\n vector<ll> x(n);\\n ll all=0;\\n rep(i,n){\\n cin>>x[i];\\n all+=x[i];\\n }\\n vector<vector<ll>> g(n);\\n rep(i,n-1){\\n ll u,v;\\n cin>>u>>v;\\n u--,v--;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n ll k=all%n,num=all/n;\\n auto dp=make_vec(n,k+2,inf);\\n auto sum=make_vec(n,0ll);\\n auto sz=make_vec(n,0ll);\\n auto dfs=[&](auto &&dfs,ll v,ll pre)->void{\\n vector<ll> tos;\\n for(auto &&to:g[v]){\\n if(to==pre) continue;\\n dfs(dfs,to,v);\\n tos.push_back(to);\\n }\\n sz[v]=1;\\n sum[v]=x[v];\\n auto ndp=make_vec(tos.size()+1,k+1,inf);\\n ndp[0][0]=0;\\n rep(i,tos.size()){\\n ll to=tos[i];\\n ll x=sz[v],y=sz[to];\\n rep(j1,x+1)rep(j2,y+1){\\n if(ndp[i][j1]==inf || dp[to][j2]==inf) continue;\\n if(j1+j2>k) continue;\\n chmin(ndp[i+1][j1+j2], ndp[i][j1]+dp[to][j2]);\\n }\\n sum[v]+=sum[to];\\n sz[v]+=sz[to];\\n }\\n rep(j,k+1)if(ndp[tos.size()][j]!=inf){\\n chmin(dp[v][j], ndp[tos.size()][j]+abs(num*sz[v]+j-sum[v]));\\n chmin(dp[v][j+1], ndp[tos.size()][j]+abs(num*sz[v]+j+1-sum[v]));\\n }\\n };\\n dfs(dfs,0,-1);\\n //cout<<dp<<endl;\\n cout<<dp[0][k]<<endl;\\n}\",\n \"accuracy\": 0.7924528301886793,\n \"time_ms\": 70,\n \"memory_kb\": 117620,\n \"score_of_the_acc\": -0.2991,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3048_4251112\",\n \"code_snippet\": \"#include <iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<string>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<queue>\\n#include<math.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define int long long\\ntypedef vector<int> VI;\\ntypedef pair<int, int> pii;\\ntypedef priority_queue<int> PQ;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }\\n\\n#define fore(i,a) for(auto &i:a)\\n#define REP(i,n) for(int i=0;i<n;i++)\\n#define eREP(i,n) for(int i=0;i<=n;i++)\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define rSORT(c) sort((c).rbegin(),(c).rend())\\n#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))\\n#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))\\n#define INF 1000000000\\n#define LLINF 8223372036854775807\\n#define mod 1000000007\\n//vector<vector<int> > dp;\\n//vector<vector<vector<int> > > vvvi;\\n//dp=vector<vector<int> >(N, vector<int>(M,0));\\n//vector<pair<int,int> > v;\\n//v.push_back(make_pair(x,y));\\n//priority_queue<int,vector<int>, greater<int> > q2;\\n\\nint N;\\nVI X;\\nint all, ave, amari;\\nint size[5010], sum[5010];\\nint dp[5010][5010];\\nint sdp[5010][5010];\\nvector<VI>G;\\n\\nvoid solve(int now, int pa) {\\n\\tVI chs;\\n\\tsize[now] = 1;\\n\\tsum[now] = X[now];\\n\\n\\tfore(ch, G[now]) {\\n\\t\\tif (ch == pa)continue;\\n\\t\\tsolve(ch, now);\\n\\t\\tchs.push_back(ch);\\n\\t\\tsize[now] += size[ch];\\n\\t\\tsum[now] += sum[ch];\\n\\t}\\n\\teREP(i, chs.size())eREP(j, size[now])sdp[i][j] = LLINF;\\n\\t\\n\\tsdp[0][0] = 0;\\n\\tint cur = 0;\\n\\n\\tREP(i, chs.size()) {\\n\\t\\tint ch = chs[i];\\n\\t\\teREP(j, cur) {\\n\\t\\t\\teREP(k, size[ch]) {\\n\\t\\t\\t\\tchmin(sdp[i + 1][j + k], sdp[i][j] + dp[ch][k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcur += size[ch];\\n\\t}\\n\\n\\teREP(k, size[now]) {\\n\\t\\tchmin(dp[now][k], sdp[chs.size()][k] + abs(ave*size[now] + k - sum[now]));\\n\\t\\tchmin(dp[now][k + 1], sdp[chs.size()][k] + abs(ave*size[now] + k + 1 - sum[now]));\\n\\t}\\n}\\n\\n\\n\\n\\n\\n\\nsigned main(){\\ncin.tie(0);\\nios::sync_with_stdio(false);\\n\\n\\tcin >> N;\\n\\tX.resize(N);\\n\\tG.resize(N);\\n\\tall = 0;\\n\\tREP(i, N) {\\n\\t\\tcin >> X[i];\\n\\t\\tall += X[i];\\n\\t}\\n\\tave = all / N;\\n\\tamari = all % N;\\n\\n\\tREP(i, N - 1) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tREP(i, N)eREP(j, N)dp[i][j] = LLINF;\\n\\tsolve(0,-1);\\n\\tcout << dp[0][amari] << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 394936,\n \"score_of_the_acc\": -1.0036,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3048_3674174\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nconst long long INF = 1LL<<60;\\nint N;\\nvector<long long> X;\\nvector<vector<int>> G;\\nlong long all;\\nlong long ave;\\nint amari;\\n\\nint size[5100];\\nlong long sum[5100];\\nlong long dp[5100][5100];\\nlong long sdp[5100][5100];\\n\\nvoid rec(int v, int p = -1) {\\n vector<int> chs;\\n size[v] = 1;\\n sum[v] = X[v];\\n for (auto ch : G[v]) {\\n if (ch == p) continue;\\n rec(ch, v);\\n chs.push_back(ch);\\n size[v] += size[ch];\\n sum[v] += sum[ch];\\n }\\n\\n for (int i = 0; i <= chs.size(); ++i)\\n for (int j = 0; j <= size[v]; ++j)\\n sdp[i][j] = INF;\\n sdp[0][0] = 0;\\n int cur = 0;\\n for (int i = 0; i < chs.size(); ++i) {\\n int ch = chs[i];\\n for (int j = 0; j <= cur; ++j) {\\n for (int k = 0; k <= size[ch]; ++k) {\\n chmin(sdp[i+1][j+k], sdp[i][j] + dp[ch][k]);\\n }\\n }\\n cur += size[ch];\\n }\\n\\n for (int k = 0; k <= size[v]; ++k) {\\n chmin(dp[v][k], sdp[chs.size()][k] + abs(ave * size[v] + k - sum[v]));\\n chmin(dp[v][k+1], sdp[chs.size()][k] + abs(ave * size[v] + k+1 - sum[v]));\\n }\\n}\\n\\nint main() {\\n cin >> N;\\n X.resize(N);\\n all = 0;\\n for (int i = 0; i < N; ++i) cin >> X[i], all += X[i];\\n ave = all / N;\\n amari = all % N;\\n G.assign(N, vector<int>());\\n for (int i = 0; i < N-1; ++i) {\\n int a, b; cin >> a >> b; --a, --b;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n\\n for (int v = 0; v < N; ++v) for (int i = 0; i <= N; ++i) dp[v][i] = INF;\\n rec(0);\\n\\n cout << dp[0][amari] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 401788,\n \"score_of_the_acc\": -1.0205,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3048_3674168\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cstring>\\n#include <cmath>\\nusing namespace std;\\n\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\ntemplate<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }\\ntemplate<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {\\n return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));\\n}\\ntemplate<class T, class V>\\ntypename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {\\n t = v;\\n}\\ntemplate<class T, class V>\\ntypename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){\\n for (auto &e : t) fill(e, v);\\n}\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\n\\nconst long long INF = 1LL<<60;\\nint N;\\nvector<long long> X;\\nvector<vector<int>> G;\\nlong long all;\\nlong long ave;\\nint amari;\\n\\nint size[5100];\\nlong long sum[5100];\\nlong long dp[5100][5100];\\nlong long sdp[5100][5100];\\n\\nvoid rec(int v, int p = -1) {\\n vector<int> chs;\\n size[v] = 1;\\n sum[v] = X[v];\\n for (auto ch : G[v]) {\\n if (ch == p) continue;\\n rec(ch, v);\\n chs.push_back(ch);\\n size[v] += size[ch];\\n sum[v] += sum[ch];\\n }\\n\\n for (int i = 0; i <= chs.size(); ++i)\\n for (int j = 0; j <= size[v]; ++j)\\n sdp[i][j] = INF;\\n sdp[0][0] = 0;\\n int cur = 0;\\n for (int i = 0; i < chs.size(); ++i) {\\n int ch = chs[i];\\n for (int j = 0; j <= cur; ++j) {\\n for (int k = 0; k <= size[ch]; ++k) {\\n chmin(sdp[i+1][j+k], sdp[i][j] + dp[ch][k]);\\n }\\n }\\n cur += size[ch];\\n }\\n\\n for (int k = 0; k <= size[v]; ++k) {\\n chmin(dp[v][k], sdp[chs.size()][k] + abs(ave * size[v] + k - sum[v]));\\n chmin(dp[v][k+1], sdp[chs.size()][k] + abs(ave * size[v] + k+1 - sum[v]));\\n }\\n}\\n\\nint main() {\\n cin >> N;\\n X.resize(N);\\n all = 0;\\n for (int i = 0; i < N; ++i) cin >> X[i], all += X[i];\\n ave = all / N;\\n amari = all % N;\\n G.assign(N, vector<int>());\\n for (int i = 0; i < N-1; ++i) {\\n int a, b; cin >> a >> b; --a, --b;\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n\\n for (int v = 0; v < N; ++v) for (int i = 0; i <= N; ++i) dp[v][i] = INF;\\n rec(0);\\n\\n cout << dp[0][amari] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 401696,\n \"score_of_the_acc\": -1.0203,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3048_3669999\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\nusing ll = long long;\\n\\n#define REP(i,n) for(ll i =0;i<n;++i)\\n\\nconstexpr ll INF = 1e9 + 1;\\nvector<ll> x, cnt, sum;\\nll a;\\nvoid init(vector<vector<int>>& g, int i, int p) {\\n\\tll cnt0 = 1, sum0 = x[i];\\n\\tREP(j, g[i].size()) {\\n\\t\\tif (g[i][j] == p)continue;\\n\\t\\tinit(g, g[i][j], i);\\n\\t\\tcnt0 += cnt[g[i][j]];\\n\\t\\tsum0 += sum[g[i][j]];\\n\\t}\\n\\tcnt[i] = cnt0;\\n\\tsum[i] = sum0;\\n}\\n\\nll f(int v, int i) {\\n\\t//cout<<v<<endl;\\n\\treturn abs(a * cnt[v] + i - sum[v]);\\n}\\n\\nvector<ll> merge(vector<ll>& l, vector<ll>& r, int rv) {\\n\\t//cout<<l.size()<<\\\" \\\"<<r.size()<<endl;\\n\\tvector<ll> res(l.size() + r.size() - 1, INF * INF);\\n\\tREP(i, l.size())REP(j, r.size()) {\\n\\t\\tres[i + j] = min(res[i + j], l[i] + r[j] + f(rv, j));\\n\\t}\\n\\n\\t//cout<<\\\"end\\\"<<endl;\\n\\treturn res;\\n\\n}\\nvoid dfs(vector<vector<int>>& g, vector<vector<ll>>& dp, int v, int p) {\\n\\tvector<ll> res(2, 0);\\n\\tREP(i, g[v].size()) {\\n\\t\\tif (g[v][i] == p)continue;\\n\\t\\tdfs(g, dp, g[v][i], v);\\n\\t\\tres = merge(res, dp[g[v][i]], g[v][i]);\\n\\t\\t// cout<<g[v][i]<<endl;\\n\\t}\\n\\tdp[v] = res;\\n}\\nint main() {\\n\\tint n; cin >> n;\\n\\tx.resize(n);\\n\\tcnt.resize(n);\\n\\tsum.resize(n);\\n\\tREP(i, n)cin >> x[i];\\n\\tvector<vector<int>>g(n);\\n\\tREP(i, n - 1) {\\n\\t\\tint a, b; cin >> a >> b;\\n\\t\\ta--; b--;\\n\\t\\tg[a].push_back(b);\\n\\t\\tg[b].push_back(a);\\n\\t}\\n\\tinit(g, 0, -1);\\n\\ta = sum[0] / n;\\n\\tvector<vector<ll>> dp(n);\\n\\tdfs(g, dp, 0, -1);\\n\\tcout << dp[0][sum[0] % n] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 107248,\n \"score_of_the_acc\": -0.2689,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3048_3215687\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\n\\ntypedef vector<pair<long long int,long long int>> DP;\\n\\nDP connect(const DP&l, const DP&r) {\\n\\tDP k(l.size()+r.size()-1,make_pair(1e18,1e18));\\n\\tfor (int i = 0; i < l.size(); ++i) {\\n\\t\\tfor (int j = 0; j < r.size(); ++j) {\\n\\t\\t\\tauto x = make_pair(l[i].first + r[j].first, l[i].second + r[j].second);\\n\\n\\t\\t\\tk[i + j] = min(k[i + j], x);\\n\\n\\t\\t}\\n\\t}\\n\\treturn k;\\n}\\nDP dfs(const int now, const int from,\\n\\tconst vector<vector<int>>&edges,vector<int>&overs) {\\n\\n\\tlong long int over_num=overs[now];\\n\\tDP v(2);\\n\\tv[0]=make_pair(over_num,0);\\n\\tv[1]=make_pair(over_num-1,0);\\n\\n\\tvector<vector<pair<long long int,long long int>>>ps;\\n\\tfor (auto e : edges[now]) {\\n\\t\\tif(e==from)continue;\\n\\t\\tps.push_back(dfs(e,now,edges,overs));\\n\\t}\\n\\tsort(ps.begin(), ps.end(), [](const vector < pair<long long int, long long int>>&l, const vector<pair<long long int, long long int>>&r) {\\n\\t\\treturn l.size()<r.size();\\n\\t});\\n\\tfor (auto p : ps) {\\n\\t\\tv=connect(v,p);\\n\\t}\\n\\tfor (auto &k : v) {\\n\\t\\tk.second+=abs(k.first);\\n\\t}\\n\\treturn v;\\n}\\nint main() {\\n\\tint N;cin>>N;\\n\\tvector<int>nums;\\n\\t{\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint a;cin>>a;\\n\\t\\t\\tnums.push_back(a);\\n\\t\\t}\\n\\t\\tlong long int sum=accumulate(nums.begin(),nums.end(),0ll);\\n\\t\\tfor (auto &n : nums) {\\n\\t\\t\\tn-=sum/N;\\n\\t\\t}\\n\\t}\\n\\tvector<vector<int>>edges(N);\\n\\tfor (int i = 0; i < N - 1; ++i) {\\n\\t\\tint a,b;cin>>a>>b;a--;b--;\\n\\t\\tedges[a].push_back(b);\\n\\t\\tedges[b].push_back(a);\\n\\t}\\n\\tDP ans=dfs(0,-1,edges,nums);\\n\\tfor (int i = 0; i < ans.size(); ++i) {\\n\\t\\tif(ans[i].first==0)cout<<ans[i].second<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4264,\n \"score_of_the_acc\": -0.0094,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3048_3159541\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define INF 10000000000000007LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,short> P;\\ntypedef pair<int,short> P2;\\n\\nint n;\\nvector<int> G[5005];\\nll x[5005];\\nint u[5005],v[5005];\\nll dp[5005][5005];\\nll tmp[5005];\\nll subsum[5005];\\nint child[5005];\\nll sum;\\nll min_v=0;\\nint tp=0;\\n\\nll labs(ll v){\\n\\tif(v<0LL)return -v;\\n\\treturn v;\\n}\\n\\nll dfs(int v,int p){\\n\\tll su=x[v];\\n\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\tint nv=G[v][i];\\n\\t\\tif(nv==p)continue;\\n\\t\\tsu+=dfs(G[v][i],v);\\n\\t}\\n\\treturn subsum[v]=su;\\n}\\n\\nint dfs1(int v,int p){\\n\\tint su=1;\\n\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\tint nv=G[v][i];\\n\\t\\tif(nv==p)continue;\\n\\t\\tsu+=dfs1(G[v][i],v);\\n\\t}\\n\\treturn child[v]=su;\\n}\\n\\nvoid dfs2(int v,int p){\\n\\tint siz=0;\\n\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\tint nv=G[v][i];\\n\\t\\tif(nv==p)continue;\\n\\t\\tdfs2(G[v][i],v);\\n\\t\\tfor(int j=0;j<=n;j++){\\n\\t\\t\\ttmp[j]=INF;\\n\\t\\t}\\n\\t\\tfor(int j=0;j<=siz;j++){\\n\\t\\t\\tfor(int k=0;k<=min(tp,child[nv]);k++){\\n\\t\\t\\t\\tll nc=labs(subsum[nv]-child[nv]*min_v-k);\\n\\t\\t\\t\\ttmp[j+k]=min(dp[v][j]+dp[nv][k]+nc,tmp[j+k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j=0;j<=n;j++){\\n\\t\\t\\tdp[v][j]=tmp[j];\\n\\t\\t}\\n\\t\\tsiz+=child[nv];\\n\\t}\\n\\tfor(int i=n;i>=1;i--){\\n\\t\\tdp[v][i]=min(dp[v][i],dp[v][i-1]);\\n\\t}\\n}\\n\\nint main(void){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tint S=n;\\n\\tint T=n+1;\\n\\tsum=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tscanf(\\\"%lld\\\",&x[i]);\\n\\t\\tsum+=x[i];\\n\\t}\\n\\ttp=(ll)sum%n;\\n\\tmin_v=(ll)sum/n;\\n\\tfor(int i=0;i<n-1;i++){\\n\\t\\tscanf(\\\"%d%d\\\",&u[i],&v[i]);\\n\\t\\tu[i]--;\\n\\t\\tv[i]--;\\n\\t\\tG[u[i]].push_back(v[i]);\\n\\t\\tG[v[i]].push_back(u[i]);\\n\\t}\\n\\tdfs(0,-1);\\n\\tdfs1(0,-1);\\n\\tdfs2(0,-1);\\n\\tprintf(\\\"%lld\\\\n\\\",dp[0][sum%n]);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 199744,\n \"score_of_the_acc\": -0.5296,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3048_3159406\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 5010\\n\\nvector<int> tree[SIZE];\\n\\nint n, x[SIZE];\\nll dp[SIZE][SIZE][2];\\nll ave, num_plus;\\n\\npair<int, ll> dfs(int now = 0, int back = -1, int cost = INF){ //{numOfChilds, sumOfChildsX} \\n ll numOfChilds = 0, sum = 0;\\n\\n dp[now][0][0] = 0;\\n \\n for(int to : tree[now]){\\n if(back == to) continue;\\n auto res = dfs(to, now, 1);\\n\\n for(int i=0;i<=numOfChilds;i++){\\n for(int j=0;j<=res.first;j++){\\n dp[now][i+j][1] = min(dp[now][i+j][1], dp[now][i][0] + dp[to][j][0]);\\n }\\n }\\n\\n for(int i=0;i<=numOfChilds+res.first;i++){\\n dp[now][i][0] = dp[now][i][1];\\n dp[now][i][1] = LLINF;\\n }\\n \\n numOfChilds += res.first;\\n sum += res.second;\\n }\\n\\n sum += x[now];\\n numOfChilds += 1;\\n \\n for(int i=numOfChilds;i>=0;i--){\\n ll add_cost = abs(sum - (ave*numOfChilds + (i+1))) * cost;\\n dp[now][i+1][0] = min(dp[now][i+1][0], dp[now][i][0] + add_cost);\\n ll add_cost2 = abs(sum - (ave*numOfChilds + i)) * cost;\\n dp[now][i][0] = dp[now][i][0] + add_cost2; \\n }\\n \\n return {numOfChilds, sum};\\n}\\n\\nint main(){\\n ll sumx = 0;\\n \\n scanf(\\\"%d\\\", &n);\\n\\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\", x+i);\\n sumx += x[i];\\n }\\n\\n ave = sumx / n;\\n num_plus = sumx % n;\\n \\n for(int i=0;i<n-1;i++){\\n int u, v;\\n scanf(\\\"%d%d\\\", &u, &v);\\n u--; v--;\\n\\n tree[u].push_back(v);\\n tree[v].push_back(u);\\n }\\n\\n for(int i=0;i<=n;i++)\\n for(int j=0;j<=n;j++)\\n dp[i][j][0] = dp[i][j][1] = LLINF;\\n\\n dfs();\\n\\n cout << dp[0][num_plus][0] << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 395596,\n \"score_of_the_acc\": -1.0188,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3048_3152667\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nll N,X[5001],R[5001],cnt[5001],sumr[5001];\\nll dp[5001][5001];\\nll dp2[2][5001];\\nll tot=0,p=0,K;\\nvector<int> g[5001];\\n\\nvoid dfs(int v,int pre){\\n cnt[v]=1; sumr[v]=R[v];\\n for(int nv : g[v]){\\n if(nv==pre)continue;\\n dfs(nv,v);\\n cnt[v]+=cnt[nv]; sumr[v]+=sumr[nv];\\n }\\n int crt=0,nxt=1;\\n rep(j,cnt[v]+1)dp2[crt][j]=INF;\\n dp2[crt][0]=0;\\n for(int nv : g[v]){\\n if(nv==pre)continue;\\n rep(j,cnt[v]+1)dp2[nxt][j]=INF;\\n rep(j,cnt[v]+1){\\n if(dp2[crt][j]==INF)break;\\n rep(k,cnt[nv]+1){\\n if(j+k<=cnt[v])minch(dp2[nxt][j+k],dp2[crt][j]+dp[nv][k]+llabs(sumr[nv]-k));\\n else break;\\n }\\n }\\n swap(crt,nxt);\\n }\\n rep(j,cnt[v]+1){\\n dp[v][j]=dp2[crt][j];\\n if(j>0)minch(dp[v][j],dp2[crt][j-1]);\\n }\\n}\\n\\nint main(){\\n scanf(\\\"%lld\\\",&N);\\n rep(i,N){\\n scanf(\\\"%lld\\\",X+i);\\n p+=X[i]; tot+=X[i];\\n }\\n p/=N; K=tot-N*p;\\n rep(i,N){\\n R[i]=X[i]-p;\\n }\\n rep(i,N-1){\\n int a,b;\\n scanf(\\\"%d%d\\\",&a,&b);\\n a--;b--;\\n g[a].push_back(b); g[b].push_back(a);\\n }\\n dfs(0,-1);\\n cout<<dp[0][K]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 121020,\n \"score_of_the_acc\": -0.3029,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3048_3152359\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n//INSERT ABOVE HERE\\nconst Int MAX = 5050;\\nconst Int INF = 1e17;\\nInt dp[MAX][MAX];\\nsigned main(){\\n Int n;\\n cin>>n;\\n vector<Int> a(n);\\n for(Int i=0;i<n;i++) cin>>a[i];\\n\\n Int s=0;\\n for(Int i=0;i<n;i++) s+=a[i];\\n Int x=s/n;\\n \\n vector<vector<Int> > G(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n cin>>a>>b;\\n a--;b--;\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n\\n vector<Int> sz(n,1);\\n function<void(Int, Int)> dfs=\\n [&](Int v,Int p){ \\n for(Int u:G[v])\\n\\tif(u!=p) dfs(u,v),a[v]+=a[u];\\n \\n for(Int i=0;i<MAX;i++) dp[v][i]=INF;\\n dp[v][0]=dp[v][1]=0;\\n for(Int u:G[v]){\\n\\tif(u==p) continue;\\n\\tvector<Int> nx(sz[v]+sz[u]+2,INF);\\n\\tfor(Int i=0;i<=sz[v];i++)\\n\\t for(Int j=0;j<=sz[u];j++)\\n\\t chmin(nx[i+j],dp[v][i]+dp[u][j]+abs(a[u]-((x+1)*j+x*(sz[u]-j))));\\n\\t\\n\\tsz[v]+=sz[u];\\n\\tfor(Int i=0;i<=sz[v];i++) dp[v][i]=nx[i];\\n }\\n }; \\n\\n dfs(0,-1); \\n cout<<dp[0][s%n]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 201124,\n \"score_of_the_acc\": -0.5194,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3048_3146610\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n\\nint n;\\nll x[5252];\\nvi g[5252];\\n\\nll sum, a;\\n\\nint cnt[5252];\\nll subsum[5252];\\n\\nvoid dfs1(int p, int bef){\\n cnt[p] = 1;\\n subsum[p] = x[p];\\n for(int to : g[p])if(to != bef){\\n dfs1(to, p);\\n cnt[p] += cnt[to];\\n subsum[p] += subsum[to];\\n }\\n}\\n\\nll dp[5252][5252]; // dp[p][b] := b個がa+1, cnt[p]-b個がaになる時の最小コスト, b<=cnt[p]\\nll tmp[5252];\\nvoid dfs2(int p, int bef){\\n dp[p][0] = dp[p][1] = 0;\\n int m = 2;\\n for(int to : g[p])if(to != bef){\\n dfs2(to, p);\\n // merge\\n REP(i,cnt[to]+m)tmp[i] = 1ll<<60;\\n REP(i,cnt[to]+1)REP(j,m){\\n CHMIN(tmp[i+j], dp[to][i]+dp[p][j]);\\n }\\n REP(i,cnt[to]+m)dp[p][i] = tmp[i];\\n m += cnt[to];\\n }\\n REP(i,m){\\n ll sm = a*cnt[p] + i;\\n dp[p][i] += abs(sm-subsum[p]);\\n }\\n}\\n\\nint main(){\\n scanf(\\\"%d\\\",&n);\\n REP(i,n)scanf(\\\"%lld\\\",x+i);\\n REP(i,n-1){\\n int u,v;\\n scanf(\\\"%d%d\\\",&u,&v);\\n --u;--v;\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n sum = accumulate(x,x+n,0ll);\\n a = sum/n;\\n dfs1(0,-1);\\n dfs2(0,-1);\\n printf(\\\"%lld\\\\n\\\",dp[0][sum%n]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 121424,\n \"score_of_the_acc\": -0.3039,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3048_3145628\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define INF 10000000000000007LL\\n#define INF2 5005LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,int> P;\\n\\nstruct RadixHeap{\\n\\tvector<P> v[65];\\n\\tint sz;\\n\\tint last;\\n\\tRadixHeap(){\\n\\t\\tlast=0;\\n\\t\\tsz=0;\\n\\t}\\n\\tint bsr(int x){\\n\\t\\tif(x==0)return -1;\\n\\t\\treturn 63-__builtin_clz(x);\\n\\t}\\n\\tvoid push(P p){\\n\\t\\tassert(last<=p.first);\\n\\t\\tsz++;\\n\\t\\tv[bsr(p.first^last)+1].push_back(p);\\n\\t}\\n\\tP top(){\\n\\t\\treturn pop(false);\\n\\t}\\n\\tP pop(bool flag=true){\\n\\t\\tassert(sz);\\n\\t\\tif(!v[0].size()){\\n\\t\\t\\tint i=1;\\n\\t\\t\\twhile(!v[i].size())i++;\\n\\t\\t\\tlast=min_element(v[i].begin(),v[i].end())->first;\\n\\t\\t\\tfor(int j=0;j<v[i].size();j++){\\n\\t\\t\\t\\tv[bsr(v[i][j].first^last)+1].push_back(v[i][j]);\\n\\t\\t\\t}\\n\\t\\t\\tv[i].clear();\\n\\t\\t}\\n\\t\\tP best=v[0].back();\\n\\t\\tif(flag){\\n\\t\\t\\tv[0].pop_back();\\n\\t\\t\\tsz--;\\n\\t\\t}\\n\\t\\treturn best;\\n\\t}\\n};\\n\\n\\nstruct edge{\\n\\tint to,rev;\\n\\tll cap,cost;\\n\\tedge(){}\\n\\tedge(int t,ll c,ll co,int r){\\n\\t\\tto=t;\\n\\t\\tcap=c;\\n\\t\\tcost=co;\\n\\t\\trev=r;\\n\\t}\\n};\\n\\nstruct mincostflow{\\n\\tedge G[5005][5005];\\n\\tint siz[5005];\\n\\tll h[5005];\\n\\tll dist[5005];\\n\\tint prevv[5005],preve[5005];\\n\\n\\tvoid add_edge(int from,int to,ll cap,ll cost){\\n\\t\\t//printf(\\\"%d %d %lld %lld\\\\n\\\",from,to,cap,cost);\\n\\t\\tG[from][siz[from]++]=edge(to,cap,cost,siz[to]);\\n\\t\\tG[to][siz[to]++]=edge(from,0,-cost,siz[from]-1);\\n\\t}\\n\\n\\tll min_cost_flow(int s,int t,ll f,int V){\\n\\t\\tll res=0;\\n\\t\\tfill(h,h+V,0);\\n\\t\\t//printf(\\\"%d %d %lld %d\\\\n\\\",s,t,f,V);\\n\\t\\twhile(f>0LL){\\n\\t\\t\\t//priority_queue<P,vector<P>,greater<P> > que;\\n\\t\\t\\tRadixHeap que;\\n\\t\\t\\tfill(dist,dist+V,INF);\\n\\t\\t\\tdist[s]=0;\\n\\t\\t\\tque.push(P(0,s));\\n\\t\\t\\twhile(que.sz>0){\\n\\t\\t\\t\\tP p=que.pop();\\n\\t\\t\\t\\tint v=p.second;\\n\\t\\t\\t\\tif(dist[v]<p.first)continue;\\n\\t\\t\\t\\tfor(int i=0;i<siz[v];i++){\\n\\t\\t\\t\\t\\tedge &e=G[v][i];\\n\\t\\t\\t\\t\\tif(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){\\n\\t\\t\\t\\t\\t\\tdist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n\\t\\t\\t\\t\\t\\tprevv[e.to]=v;\\n\\t\\t\\t\\t\\t\\tpreve[e.to]=i;\\n\\t\\t\\t\\t\\t\\tque.push(P(dist[e.to],e.to));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(dist[t]==INF)return -1;\\n\\t\\t\\tfor(int v=0;v<V;v++){\\n\\t\\t\\t\\th[v]+=dist[v];\\n\\t\\t\\t}\\n\\t\\t\\tll d=f;\\n\\t\\t\\tfor(int v=t;v!=s;v=prevv[v]){\\n\\t\\t\\t\\td=min(d,G[prevv[v]][preve[v]].cap);\\n\\t\\t\\t}\\n\\t\\t\\tf-=d;\\n\\t\\t\\tres+=d*h[t];\\n\\t\\t\\tfor(int v=t;v!=s;v=prevv[v]){\\n\\t\\t\\t\\tedge &e=G[prevv[v]][preve[v]];\\n\\t\\t\\t\\te.cap-=d;\\n\\t\\t\\t\\tG[v][e.rev].cap+=d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nmincostflow mi;\\n\\nint n;\\nll x[5005];\\nint u[5005],v[5005];\\n\\nint main(void){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tint S=n;\\n\\tint T=n+1;\\n\\tll sum=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tscanf(\\\"%lld\\\",&x[i]);\\n\\t\\t\\n\\t\\tsum+=x[i];\\n\\t}\\n\\tll sum2=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(x[i]>=(sum/n)){\\n\\t\\t\\tif(x[i]-sum/n>0)mi.add_edge(S,i,x[i]-(sum/n),0);\\n\\t\\t\\tsum2+=sum/n;\\n\\t\\t}\\n\\t\\tif(x[i]<(sum/n)){\\n\\t\\t\\tsum2+=x[i];\\n\\t\\t\\tmi.add_edge(i,T,(ll)(sum/n)-x[i],0);\\n\\t\\t}\\n\\t\\tmi.add_edge(i,T,1,INF2);\\n\\t}\\n\\tfor(int i=0;i<n-1;i++){\\n\\t\\tscanf(\\\"%d%d\\\",&u[i],&v[i]);\\n\\t\\tu[i]--;\\n\\t\\tv[i]--;\\n\\t\\tmi.add_edge(u[i],v[i],INF,1);\\n\\t\\tmi.add_edge(v[i],u[i],INF,1);\\n\\t}\\n\\t//printf(\\\"%lld %lld\\\\n\\\",sum,sum2);\\n\\tll ans=mi.min_cost_flow(S,T,sum-sum2,T+1);\\n\\tprintf(\\\"%lld\\\\n\\\",ans-INF2*(sum-(sum/n)*n));\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8679245283018868,\n \"time_ms\": 1870,\n \"memory_kb\": 24044,\n \"score_of_the_acc\": -0.8857,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3048_3145351\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define X first\\n#define Y sevcond\\n#define pb emplace_back\\n#define eb pb\\n#define rep(X,Y) for(int X=0;X<(Y);++X)\\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n\\nusing namespace std;\\nusing ll=long long;\\nconst ll INF=1e18;\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tvector<int> xs(n);\\n\\tusing Graph=vector<vector<int>>;\\n\\tGraph g(n);\\n\\trep(i,n) cin>>xs[i];\\n\\tint t;\\n\\t{\\n\\t\\tll s=accumulate(all(xs),0ll);\\n\\t\\trep(i,n) xs[i]-=s/n;\\n\\t\\tt=s%n;\\n\\t}\\n\\trep(i,n-1){\\n\\t\\tint x,y;\\n\\t\\tcin>>x>>y; --x; --y;\\n\\t\\tg[x].pb(y);\\n\\t\\tg[y].pb(x);\\n\\t}\\n\\tvector<ll> sum(n),sz(n);\\n\\t{\\n\\t\\tfunction<void(int,int)> dfs=\\n\\t\\t\\t[&](int v,int p){\\n\\t\\t\\t\\t++sz[v]; sum[v]+=xs[v];\\n\\t\\t\\t\\tfor(int w:g[v])if(w!=p){\\n\\t\\t\\t\\t\\t\\tdfs(w,v);\\n\\t\\t\\t\\t\\t\\tsum[v]+=sum[w];\\n\\t\\t\\t\\t\\t\\tsz[v]+=sz[v];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t};\\n\\t\\tdfs(0,-1);\\n\\t}\\n\\tvector<vector<ll>> dp(n);\\n\\tfunction<void(int,int)> dfs=\\n\\t\\t[&](int v,int p){\\n\\t\\t\\tdp[v].pb(0);\\n\\t\\t\\tfor(int w:g[v])if(w!=p){\\n\\t\\t\\t\\t\\tdfs(w,v);\\n\\t\\t\\t\\t\\tauto tmp=dp[v];\\n\\t\\t\\t\\t\\tdp[v].clear();\\n\\t\\t\\t\\t\\tdp[v].resize(tmp.size()+dp[w].size(),INF);\\n\\t\\t\\t\\t\\trep(i,tmp.size())rep(j,dp[w].size()){\\n\\t\\t\\t\\t\\t\\tdp[v][i+j]=min(dp[v][i+j],tmp[i]+dp[w][j]+abs(j-sum[w]));\\n\\t\\t\\t\\t\\t\\tdp[v][i+j+1]=min(dp[v][i+j+1],tmp[i]+dp[w][j]+abs(j+1-sum[w]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t};\\n\\tdfs(0,-1);\\n\\t// rep(i,n){\\n\\t// \\tcout<<i<<endl;\\n\\t// \\tfor(auto x:dp[i]) cout<<x<<\\\",\\\";cout<<endl;\\n\\t// }\\n\\tcout<<min(dp[0][t],dp[0][max(0,t-1)])<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 101832,\n \"score_of_the_acc\": -0.2509,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3048_3145350\",\n \"code_snippet\": \"#include<deque>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<set>\\n#include<cmath>\\n#include<tuple>\\n#include<string>\\n#include<chrono>\\n#include<functional>\\n#include<iterator>\\n#include<random>\\n#include<unordered_set>\\n#include<array>\\n#include<map>\\n#include<iomanip>\\n#include<assert.h>\\n#include<bitset>\\n#include<stack>\\n#include<memory>\\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/*\\ncout<<fixed<<setprecision(20);\\ncin.tie(0);\\nios::sync_with_stdio(false);\\n*/\\nconst llint mod=1000000007;\\nconst llint big=2.19e18+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-15;\\ntemplate <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\nvector<llint>X;\\nvector<vector<int>>go;\\npair<vector<llint>,llint>dfs(int ter,int per){\\n\\tllint ofset=X[ter];\\n\\tvector<llint>ans(2);\\n\\tint i,j;\\n\\tfor(auto it:go[ter]){\\n\\t\\tif(it==per){continue;}\\n\\t\\tauto ret=dfs(it,ter);\\n\\t\\tofset+=ret.sec;\\n\\t\\t//ここでマージする、本当は凸性を使ったマージができるが、O(n^2)が間に合うし、凸性使ってもO(n^2)ので使わない\\n\\t\\tvector<llint>iti(ans.size()+ret.fir.size()-1,big);\\n\\t\\tfor(i=0;i<ans.size();i++){\\n\\t\\t\\tfor(j=0;j<ret.fir.size();j++){\\n\\t\\t\\t\\tmineq(iti[i+j],ans[i]+ret.fir[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans=move(iti);\\n\\t}\\n\\tfor(i=0;i<ans.size();i++){ans[i]+=abs(ofset-i);}\\n\\treturn mp(ans,ofset);\\n}\\nint main(void){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint n,i;cin>>n;\\n\\tX.res(n);\\n\\tgo.res(n);\\n\\tllint wa=0;\\n\\tfor(i=0;i<n;i++){cin>>X[i];wa+=X[i];}\\n\\tfor(i=0;i<n;i++){X[i]-=wa/n;}\\n\\tfor(i=0;i<n-1;i++){\\n\\t\\tint u,v;cin>>u>>v;u--;v--;\\n\\t\\tgo[u].pub(v);\\n\\t\\tgo[v].pub(u);\\n\\t}\\n\\tcout<<dfs(0,-1).fir[wa%n]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4164,\n \"score_of_the_acc\": -0.0001,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3048_3145338\",\n \"code_snippet\": \"#include<deque>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\n#include<iostream>\\n#include<set>\\n#include<cmath>\\n#include<tuple>\\n#include<string>\\n#include<chrono>\\n#include<functional>\\n#include<iterator>\\n#include<random>\\n#include<unordered_set>\\n#include<array>\\n#include<map>\\n#include<iomanip>\\n#include<assert.h>\\n#include<bitset>\\n#include<stack>\\n#include<memory>\\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/*\\ncout<<fixed<<setprecision(20);\\ncin.tie(0);\\nios::sync_with_stdio(false);\\n*/\\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>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\nvector<llint>X;\\nvector<vector<int>>go;\\npair<vector<llint>,llint>dfs(int ter,int per){\\n\\tllint ofset=X[ter];\\n\\tvector<llint>ans(2);\\n\\tint i,j;\\n\\tfor(auto it:go[ter]){\\n\\t\\tif(it==per){continue;}\\n\\t\\tauto ret=dfs(it,ter);\\n\\t\\tofset+=ret.sec;\\n\\t\\t//ここでマージする、本当は凸性を使ったマージができるが、O(n^2)が間に合うし、凸性使ってもO(n^2)ので使わない\\n\\t\\tvector<llint>iti(ans.size()+ret.fir.size()-1,big);\\n\\t\\t\\n\\t\\tfor(i=0;i<ans.size();i++){\\n\\t\\t\\tfor(j=0;j<ret.fir.size();j++){\\n\\t\\t\\t\\tmineq(iti[i+j],ans[i]+ret.fir[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans=move(iti);\\n\\t}\\n\\tfor(i=0;i<ans.size();i++){ans[i]+=abs(ofset-i);}\\n\\treturn mp(ans,ofset);\\n}\\nint main(void){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint n,i;cin>>n;\\n\\tX.res(n);\\n\\tgo.res(n);\\n\\tllint wa=0;\\n\\tfor(i=0;i<n;i++){cin>>X[i];wa+=X[i];}\\n\\tfor(i=0;i<n;i++){X[i]-=wa/n;}\\n\\tfor(i=0;i<n-1;i++){\\n\\t\\tint u,v;cin>>u>>v;u--;v--;\\n\\t\\tgo[u].pub(v);\\n\\t\\tgo[v].pub(u);\\n\\t}\\n\\tcout<<dfs(0,-1).fir[wa%n]<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.9811320754716981,\n \"time_ms\": 30,\n \"memory_kb\": 4124,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3048_3145337\",\n \"code_snippet\": \"//これもっと解かれててよくないか\\n#include<bits/stdc++.h>\\n#define X first\\n#define Y sevcond\\n#define pb emplace_back\\n#define eb pb\\n#define rep(X,Y) for(int X=0;X<(Y);++X)\\n#define reps(X,O,Y) for(int X=(O);X<(Y);++X)\\n#define all(X) (X).begin(),(X).end()\\n#define rall(X) (X).rbegin(),(X).rend()\\n\\nusing namespace std;\\nusing ll=long long;\\nconst ll INF=1e15;\\n\\nint main(){\\n\\tint n;\\n\\tcin>>n;\\n\\tvector<int> xs(n);\\n\\tusing Graph=vector<vector<int>>;\\n\\tGraph g(n);\\n\\trep(i,n) cin>>xs[i];\\n\\tint t;\\n\\t{\\n\\t\\tll s=accumulate(all(xs),0ll);\\n\\t\\trep(i,n) xs[i]-=s/n;\\n\\t\\tt=s%n;\\n\\t}\\n\\trep(i,n-1){\\n\\t\\tint x,y;\\n\\t\\tcin>>x>>y; --x; --y;\\n\\t\\tg[x].pb(y);\\n\\t\\tg[y].pb(x);\\n\\t}\\n\\tvector<ll> sum(n),sz(n);\\n\\t{\\n\\t\\tfunction<void(int,int)> dfs=\\n\\t\\t\\t[&](int v,int p){\\n\\t\\t\\t\\t++sz[v]; sum[v]+=xs[v];\\n\\t\\t\\t\\tfor(int w:g[v])if(w!=p){\\n\\t\\t\\t\\t\\t\\tdfs(w,v);\\n\\t\\t\\t\\t\\t\\tsum[v]+=sum[w];\\n\\t\\t\\t\\t\\t\\tsz[v]+=sz[v];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t};\\n\\t\\tdfs(0,-1);\\n\\t}\\n\\tvector<vector<ll>> dp(n);\\n\\tfunction<void(int,int)> dfs=\\n\\t\\t[&](int v,int p){\\n\\t\\t\\tdp[v].pb(0);\\n\\t\\t\\tfor(int w:g[v])if(w!=p){\\n\\t\\t\\t\\t\\tdfs(w,v);\\n\\t\\t\\t\\t\\tauto tmp=dp[v];\\n\\t\\t\\t\\t\\tdp[v].clear();\\n\\t\\t\\t\\t\\tdp[v].resize(tmp.size()+dp[w].size(),INF);\\n\\t\\t\\t\\t\\trep(i,tmp.size())rep(j,dp[w].size()){\\n\\t\\t\\t\\t\\t\\tdp[v][i+j]=min(dp[v][i+j],tmp[i]+dp[w][j]+abs(j-sum[w]));\\n\\t\\t\\t\\t\\t\\tdp[v][i+j+1]=min(dp[v][i+j+1],tmp[i]+dp[w][j]+abs(j+1-sum[w]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t};\\n\\tdfs(0,-1);\\n\\t// rep(i,n){\\n\\t// \\tcout<<i<<endl;\\n\\t// \\tfor(auto x:dp[i]) cout<<x<<\\\",\\\";cout<<endl;\\n\\t// }\\n\\tcout<<min(dp[0][t],dp[0][max(0,t-1)])<<endl;\\n}\",\n \"accuracy\": 0.9811320754716981,\n \"time_ms\": 50,\n \"memory_kb\": 101724,\n \"score_of_the_acc\": -0.2506,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3048_3135486\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\nconst int MAX_V = 5005;\\n\\ntypedef pair< int , int > P;\\n\\nconst ll INF=1000000000LL;\\n\\nconst ll capmx=10000000000000LL;\\n\\nstruct edge { ll to,cap,cost,rev; };\\n\\nint V;\\nvector<edge> G[MAX_V];\\nll h[MAX_V];\\nint dist[MAX_V];\\nll prevv[MAX_V],preve[MAX_V];\\n\\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\\n\\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\\n}\\n\\nll min_cost_flow(int s,int t,ll &f){\\n ll res = 0;\\n fill(h,h+V,0);\\n \\n while(f>0){\\n\\n queue<int> que;\\n \\n memset( dist , 1 , sizeof( dist ) );\\n dist[s]=0;\\n que.push( s );\\n while( !que.empty() ){\\n int key = que.front(); que.pop();\\n int v = key%MAX_V;\\n int cost = key/MAX_V;\\n \\n if(dist[v]<cost)continue;\\n if(v==t)continue;\\n \\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n que.push(dist[e.to]*MAX_V+e.to);\\n }\\n }\\n }\\n if(dist[t]==dist[MAX_V-1]){\\n break;\\n }\\n for(int v=0;v<V;v++){\\n h[v]+=dist[v];\\n }\\n ll d=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\\n }\\n f-=d;\\n res+=(ll)d*h[t];\\n for(int v=t;v!=s;v=prevv[v]){\\n\\n edge &e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n if( prevv[v] == s )break;\\n G[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n}\\n\\n\\n\\n\\nll In[5000];\\nll Out[5000];\\nll Size[5000];\\nvector<int> g[5000];\\nint parent[5000];\\n\\nvoid dfs(int pos,int prev){\\n parent[pos]=prev;\\n for(int i=0;i<(int)g[pos].size();i++){\\n int to=g[pos][i];\\n if(to==prev)continue;\\n dfs(to,pos);\\n In[pos]+=In[to];\\n Out[pos]+=Out[to];\\n Size[pos]+=Size[to];\\n }\\n}\\n\\n\\nint main(){\\n ll n, sum=0;\\n ll x[5000];\\n cin>>n;\\n for(int i=0;i<n;i++){\\n cin>>x[i];\\n sum+=x[i];\\n }\\n \\n int si=n;\\n int ti=n+1;\\n \\n V=ti+1;\\n \\n for(int i=0;i+1<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\\n\\n int root = rand() % n;\\n \\n ll tmp=sum;\\n for(int i=0;i<n;i++){\\n Size[i]=1;\\n In[i]=Out[i]=0;\\n \\n ll p= min(sum/n , x[i]);\\n tmp-=p;\\n if(x[i]-p>0){\\n add_edge(si,i,x[i]-p,0, true);\\n In[i] = x[i]-p;\\n }\\n\\n if( sum/n-p > 0 ){\\n add_edge(i,ti, sum/n-p , 0 );\\n Out[i] = (sum/n-p);\\n }\\n }\\n \\n dfs( root ,-1);\\n \\n\\n for(int i=0;i<n;i++){\\n if( i== root )continue;\\n \\n ll U=In[i]-Out[i];\\n // add_edge( i, parent[i], capmx , 1);\\n // add_edge( parent[i], i, capmx , 1);\\n \\n if( U <= 0 ){\\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\\n\\n }else{\\n add_edge( i,parent[i] , U , 1);\\n \\n if( min(sum%n,Size[i])-U >0 ){\\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\\n }\\n }\\n \\n }\\n \\n for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\\n\\n ll ans=min_cost_flow(si,ti,tmp);\\n\\n ans -= 5000LL * (sum%n);\\n\\n cout<< ans <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1330,\n \"memory_kb\": 5020,\n \"score_of_the_acc\": -0.5931,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3048_3135469\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned int uint;\\n\\nint bar(uint x){\\n if(x==0)return -1;\\n return 31- __builtin_clz(x);\\n}\\nstruct RadixHeapInt {\\n uint v[33][5005];\\n uint w[33];\\n uint last,sz;\\n \\n RadixHeapInt() {\\n memset( w , 0, sizeof(w) );\\n last = sz = 0;\\n }\\n \\n void push(uint x){\\n sz++;\\n v[ bar(x^last)+1 ][ w[ bar(x^last)+1 ] ]=x;\\n w[ bar(x^last)+1 ]++;\\n }\\n \\n uint pop(){\\n if( !w[0] ){\\n int i=1;\\n while( !w[i] )i++;\\n uint new_last =\\n *min_element(v[i] , v[i]+w[i] );\\n \\n for(int j=0;j<(int)w[i];j++){\\n uint x=v[i][j];\\n v[ bar(x^new_last)+1 ][ w[bar(x^new_last)+1] ]=x;\\n w[bar(x^new_last)+1]++;\\n }\\n last = new_last;\\n w[i]=0;\\n }\\n sz--;\\n w[0]--;\\n return last;\\n }\\n};\\n\\ntypedef long long ll;\\nconst int MAX_V = 5005;\\n\\ntypedef pair< int , int > P;\\n\\nconst ll INF=1000000000LL;\\n\\nconst ll capmx=10000000000000LL;\\n\\nstruct edge { ll to,cap,cost,rev; };\\n\\nint V;\\nvector<edge> G[MAX_V];\\nll h[MAX_V];\\nint dist[MAX_V];\\nll prevv[MAX_V],preve[MAX_V];\\n\\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\\n if( flag )return;\\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\\n}\\n\\n\\nRadixHeapInt que;\\n\\nll min_cost_flow(int s,int t,ll &f){\\n ll mini = INF;\\n ll res = 0;\\n //fill(h,h+V,0);\\n // h[t]=0;\\n \\n while(f>0){\\n // que.last=0;\\n\\n queue<int> que;\\n \\n memset( dist , 1 , sizeof( dist ) );\\n dist[s]=0;\\n que.push( s );\\n while( !que.empty() ){\\n uint key = que.front(); que.pop();\\n int v = key%MAX_V;\\n int cost = key/MAX_V;\\n if(dist[v]<cost)continue;\\n if(v==t)continue;\\n \\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n\\n mini = min( mini , e.cost+h[v]-h[e.to] );\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n que.push(dist[e.to]*MAX_V+e.to);\\n }\\n }\\n }\\n if(dist[t]==dist[MAX_V-1]){\\n break;\\n }\\n for(int v=0;v<V;v++){\\n h[v]+=dist[v];\\n }\\n ll d=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\\n }\\n f-=d;\\n res+=(ll)d*h[t];\\n for(int v=t;v!=s;v=prevv[v]){\\n\\n edge &e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n if( prevv[v] == s )break;\\n G[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n}\\n\\n\\n\\n\\nll In[5000];\\nll Out[5000];\\nll Size[5000];\\nvector<int> g[5000];\\nint parent[5000];\\n\\nvoid dfs(int pos,int prev){\\n parent[pos]=prev;\\n for(int i=0;i<(int)g[pos].size();i++){\\n int to=g[pos][i];\\n if(to==prev)continue;\\n dfs(to,pos);\\n In[pos]+=In[to];\\n Out[pos]+=Out[to];\\n Size[pos]+=Size[to];\\n }\\n}\\n\\n\\nint main(){\\n ll n, sum=0;\\n ll x[5000];\\n cin>>n;\\n for(int i=0;i<n;i++){\\n cin>>x[i];\\n sum+=x[i];\\n }\\n \\n int si=n;\\n int ti=n+1;\\n \\n V=ti+1;\\n \\n for(int i=0;i+1<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\\n\\n int root = rand() % n;\\n \\n ll tmp=sum;\\n for(int i=0;i<n;i++){\\n Size[i]=1;\\n In[i]=Out[i]=0;\\n \\n ll p= min(sum/n , x[i]);\\n tmp-=p;\\n if(x[i]-p>0){\\n add_edge(si,i,x[i]-p,0, true);\\n In[i] = x[i]-p;\\n }\\n\\n if( sum/n-p > 0 ){\\n add_edge(i,ti, sum/n-p , 0 );\\n Out[i] = (sum/n-p);\\n }\\n }\\n \\n dfs( root ,-1);\\n \\n\\n for(int i=0;i<n;i++){\\n if( i== root )continue;\\n \\n ll U=In[i]-Out[i];\\n // add_edge( i, parent[i], capmx , 1);\\n // add_edge( parent[i], i, capmx , 1);\\n \\n if( U <= 0 ){\\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\\n\\n }else{\\n add_edge( i,parent[i] , U , 1);\\n \\n if( min(sum%n,Size[i])-U >0 ){\\n //add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\\n }\\n }\\n \\n }\\n \\n // for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\\n\\n ll ans=min_cost_flow(si,ti,tmp);\\n\\n \\n for(int i=0;i<n;i++) add_edge(i,ti, 1, 0LL);\\n\\n \\n\\n for(int i=0;i<n;i++){\\n if( i== root )continue;\\n ll U=In[i]-Out[i];\\n // add_edge( i, parent[i], capmx , 1);\\n // add_edge( parent[i], i, capmx , 1);\\n if( U <= 0 ){\\n // add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\\n }else{\\n // add_edge( i,parent[i] , U , 1);\\n \\n if( min(sum%n,Size[i])-U >0 ){\\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\\n }\\n }\\n \\n }\\n ans += min_cost_flow(si,ti,tmp );\\n \\n //ans -= 5000LL * (sum%n);\\n\\n cout<< ans <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 4980,\n \"score_of_the_acc\": -0.6021,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3048_3135416\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned int uint;\\n\\nint bar(uint x){\\n if(x==0)return -1;\\n return 31- __builtin_clz(x);\\n}\\nstruct RadixHeapInt {\\n uint v[33][5005];\\n uint w[33];\\n uint last,sz;\\n \\n RadixHeapInt() {\\n memset( w , 0, sizeof(w) );\\n last = sz = 0;\\n }\\n \\n void push(uint x){\\n sz++;\\n v[ bar(x^last)+1 ][ w[ bar(x^last)+1 ] ]=x;\\n w[ bar(x^last)+1 ]++;\\n }\\n \\n uint pop(){\\n if( !w[0] ){\\n int i=1;\\n while( !w[i] )i++;\\n uint new_last =\\n *min_element(v[i] , v[i]+w[i] );\\n \\n for(int j=0;j<(int)w[i];j++){\\n uint x=v[i][j];\\n v[ bar(x^new_last)+1 ][ w[bar(x^new_last)+1] ]=x;\\n w[bar(x^new_last)+1]++;\\n }\\n last = new_last;\\n w[i]=0;\\n }\\n sz--;\\n w[0]--;\\n return last;\\n }\\n};\\n\\ntypedef long long ll;\\nconst int MAX_V = 5005;\\n\\ntypedef pair< int , int > P;\\n\\nconst ll INF=1000000000LL;\\n\\nconst ll capmx=10000000000000LL;\\n\\nstruct edge { ll to,cap,cost,rev; };\\n\\nint V;\\nvector<edge> G[MAX_V];\\nll h[MAX_V];\\nint dist[MAX_V];\\nll prevv[MAX_V],preve[MAX_V];\\n\\nvoid add_edge(ll from,ll to,ll cap,ll cost, bool flag = false){\\n G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});\\n if( flag )return;\\n G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});\\n}\\n\\n\\nRadixHeapInt que;\\n\\nll min_cost_flow(int s,int t,ll &f){\\n ll mini = INF;\\n ll res = 0;\\n //fill(h,h+V,0);\\n // h[t]=0;\\n // cout<< f << ' ' <<h[t] <<endl;\\n // res -= f*h[t];\\n \\n while(f>0){\\n que.last=0;\\n memset( dist , 1 , sizeof( dist ) );\\n dist[s]=0;\\n que.push( s );\\n while( que.sz ){\\n uint key = que.pop();\\n int v = key%MAX_V;\\n int cost = key/MAX_V;\\n if(dist[v]<cost)continue;\\n if(v==t)continue;\\n \\n for(int i=0;i<(int)G[v].size();i++){\\n edge &e = G[v][i];\\n if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n\\n mini = min( mini , e.cost+h[v]-h[e.to] );\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n que.push(dist[e.to]*MAX_V+e.to);\\n }\\n }\\n }\\n if(dist[t]==dist[MAX_V-1]){\\n break;\\n }\\n for(int v=0;v<V;v++){\\n h[v]+=dist[v];\\n }\\n ll d=f;\\n for(int v=t;v!=s;v=prevv[v]){\\n d=min(d,(ll)G[prevv[v]][preve[v]].cap);\\n }\\n f-=d;\\n res+=(ll)d*h[t];\\n for(int v=t;v!=s;v=prevv[v]){\\n\\n edge &e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n if( prevv[v] == s )break;\\n G[v][e.rev].cap += d;\\n }\\n }\\n // cout<<mini<<endl;\\n return res;\\n}\\n\\n\\n\\n\\nll In[5000];\\nll Out[5000];\\nll Size[5000];\\nvector<int> g[5000];\\nint parent[5000];\\n\\nvoid dfs(int pos,int prev){\\n parent[pos]=prev;\\n for(int i=0;i<(int)g[pos].size();i++){\\n int to=g[pos][i];\\n if(to==prev)continue;\\n dfs(to,pos);\\n In[pos]+=In[to];\\n Out[pos]+=Out[to];\\n Size[pos]+=Size[to];\\n }\\n}\\n\\n\\nint main(){\\n ll n, sum=0;\\n ll x[5000];\\n cin>>n;\\n for(int i=0;i<n;i++){\\n cin>>x[i];\\n sum+=x[i];\\n }\\n \\n int si=n;\\n int ti=n+1;\\n \\n V=ti+1;\\n \\n for(int i=0;i+1<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\\n\\n int root = rand() % n;\\n \\n ll tmp=sum;\\n for(int i=0;i<n;i++){\\n Size[i]=1;\\n In[i]=Out[i]=0;\\n \\n ll p= min(sum/n , x[i]);\\n tmp-=p;\\n if(x[i]-p>0){\\n add_edge(si,i,x[i]-p,0, true);\\n In[i] = x[i]-p;\\n }\\n\\n if( sum/n-p > 0 ){\\n add_edge(i,ti, sum/n-p , 0 );\\n Out[i] = (sum/n-p);\\n }\\n }\\n \\n dfs( root ,-1);\\n \\n\\n for(int i=0;i<n;i++){\\n if( i== root )continue;\\n \\n ll U=In[i]-Out[i];\\n // add_edge( i, parent[i], capmx , 1);\\n // add_edge( parent[i], i, capmx , 1);\\n \\n if( U <= 0 ){\\n add_edge( parent[i],i , -U+min(Size[i],sum%n) , 1);\\n }else{\\n add_edge( i,parent[i] , U , 1);\\n \\n if( min(sum%n,Size[i])-U >0 ){\\n add_edge( parent[i], i, min(sum%n,Size[i])-U , 1);\\n }\\n }\\n \\n }\\n \\n // for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\\n\\n ll ans=min_cost_flow(si,ti,tmp);\\n\\n for(int i=0;i<n;i++) add_edge(i,ti, 1, 5000LL);\\n ans += min_cost_flow(si,ti,tmp );\\n \\n ans -= 5000LL * (sum%n);\\n\\n cout<< ans <<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2230,\n \"memory_kb\": 5116,\n \"score_of_the_acc\": -1.0025,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1893,"cells":{"group_id":{"kind":"string","value":"aoj_3050_cpp"},"problem_description":{"kind":"string","value":"Problem L: Tousa Tree\nProblem\n君は一昨日、友人のトウサから一つ、頼み事をされた。なんでも、木に等差数列を飾って誕生日パーティーに使いたいのだが、木が大きすぎて一人ではとてもできないのだという。そこで、優秀なプログラマである君に、効率的に木に等差数列を飾るプログラムを書いてもらいたいそうだ。君とトウサは旧知の親友である。君はトウサの頼み事を受けることにした。\n飾り付けをする$N$ノードの木が与えられる。木のノードには$0$から$N-1$までの番号が振られている。最初、木のノードの点数は全て$0$である。プログラムは、以下の二つのクエリに対応しなければならない。\n$0$.木の指定された区間のノードに書かれた点数の和を求める。\n$1$.木の指定された区間のノードに等差数列を足す。\nトウサの誕生日を祝うために、木を美しく飾ろう。\nInput\n入力は以下の形式で与えられる。\n$N$ $Q$\n$A_0$ $B_0$\n$A_1$ $B_1$\n:\n$A_{N-2}$ $B_{N-2}$\n$COM_0$\n$COM_1$\n:\n$COM_{Q-1}$\n木のノード数$N$とクエリの数$Q$が$1$行に与えられる。続いて$N-1$行に木の辺の情報が与えられる。$A_i$,$B_i$は、ノード$A_i$と$B_i$の間に直接辺があることを示している。その後、$Q$個の命令$COM_j$が与えられる。\n$COM_j$の形式は以下の通りである。\n$0$ $S$ $T$\n$S$、$T$は頂点の番号である。区間の指定は二つのノードによって行われる。$S$から$T$までの最短経路が指定された区間である。区間に含まれているノードに書かれた点数の総和を報告する。ただし、$S$と$T$も区間に含む。答えは非常に大きくなることがあるので、$10^9+7$で割ったあまりを出力すること。\n$1$ $S$ $T$ $K$ $M$\n上と同じく、$S$と$T$で指定された区間に含まれているノードに点数を足す。足す点数は、$S$からの最短距離を$L$として、以下のように算出される。\n$K+L{\\times}M$\nConstraints\n入力は以下の条件を満たす。\n入力はすべては整数\n$1 \\le N,Q \\le 10^5$\n$0 \\le A,B,S,T \\le N-1$\n$0 \\le K,M \\le 10^5$\nOutput\n$0$のクエリのとき、指定された区間に含まれているノードに書かれた点数の総和を一行に出力する。\nSample Input 1\n3 3\n0 2\n1 2\n1 1 0 0 1\n0 0 2\n0 0 1\nSample Output 1\n3\n3\nまず、$1-2-0$の区間に初項$0$、公差$1$の数列を足す。ノードの点数は$0,1,2$の順に$2,0,1$となる。\n次に、$0-2$の区間のノードの点数の和を出力する。$2+1=3$なので、$3$を出力する。\n次に、$0-2-1$の区間のノードの点数の和を出力する。$2+1+0=3$なので、$3$を出力する。\nSample Input 2\n5 6\n1 0\n2 0\n3 2\n4 1\n1 1 4 0 4\n0 4 1\n1 3 0 7 3\n0 2 2\n1 4 1 8 0\n0 4 2\nSample Output 2\n4\n10\n43"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3050_5996221","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n\nstruct TousaSegmentTree {\n int n;\n vector<ll> sum, lastval;\n vector<ll> rangeadd;\n TousaSegmentTree(int _n){\n n = 1;\n while(n<_n+1)n<<=1;\n sum.assign(2*n-1,0ll);\n lastval.assign(2*n-1,0ll);\n rangeadd.assign(2*n-1,0ll);\n }\n void push(int a, int b, int k){\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\n if(k<n-1){\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\n }\n rangeadd[k] = 0;\n }\n void _add(int l, int r, ll x, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return;\n if(l<=a && b<=r){\n (rangeadd[k] += x) %= MOD;\n push(a,b,k);\n }else{\n int m = (a+b)/2;\n _add(l,r,x,a,m,2*k+1);\n _add(l,r,x,m,b,2*k+2);\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\n }\n }\n void addTousa(int l, int r, ll a, ll b){\n _add(l,l+1,a,0,n,0);\n _add(l+1,r,b,0,n,0);\n _add(r,r+1,MOD-(a+(r-l-1)*b)%MOD,0,n,0);\n }\n ll sumTousa(int l, int r, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return 0ll;\n if(l<=a && b<=r){\n return sum[k];\n }else{\n int m = (a+b)/2;\n ll lsum = sumTousa(l,r,a,m,2*k+1);\n ll rsum = sumTousa(l,r,m,b,2*k+2);\n int rcnt = max(0,min(r,b)-max(l,m));\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\n }\n }\n ll sumTousa(int l, int r){\n return sumTousa(l,r,0,n,0);\n }\n};\n\nstruct HeavyLightDecomposition {\n int n;\n vector<vector<int>> g;\n vector<int> depth, parent, csize;\n vector<vector<int>> chains;\n vector<int> chainid, chainpos;\n int root = 0;\n HeavyLightDecomposition(int _n){\n n = _n;\n g.resize(n);\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\n chainid.assign(n,-1); chainpos.assign(n,-1);\n }\n void add_edge(int a, int b){\n g[a].push_back(b);\n g[b].push_back(a);\n }\n void dfs(int p, int bef, int d){\n depth[p] = d;\n csize[p] = 1;\n for(int to : g[p])if(to!=bef){\n dfs(to, p, d+1);\n parent[to] = p;\n csize[p] += csize[to];\n }\n }\n void dfs2(int p, int bef, int id){\n chainid[p] = id;\n chainpos[p] = chains[id].size();\n chains[id].push_back(p);\n for(int to : g[p])if(to!=bef){\n if(csize[to]*2 >= csize[p]){\n // heavy\n dfs2(to, p, id);\n }else{\n // light\n chains.push_back(vector<int>());\n dfs2(to, p, chains.size()-1);\n }\n }\n }\n void construct(){\n dfs(root,-1,0);\n chains.push_back(vector<int>());\n dfs2(root,-1,0);\n }\n int lca(int a, int b){\n while(a != b){\n if(depth[a] < depth[b])swap(a,b);\n if(chainid[a] == chainid[b])return b;\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\n a = chains[chainid[a]].front();\n a = parent[a];\n }\n return a;\n }\n};\n\nint main(){\n int n,q;\n scanf(\"%d%d\",&n,&q);\n HeavyLightDecomposition hld(n);\n REP(i,n-1){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.construct();\n\n vector<TousaSegmentTree> segs;\n REP(i,hld.chains.size()){\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\n }\n\n while(q--){\n int typ,s,t;\n scanf(\"%d%d%d\",&typ,&s,&t);\n int lca = hld.lca(s,t);\n if(typ == 0){\n // sum\n ll ans = 0;\n while(true){\n int id = hld.chainid[s];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n while(true){\n int id = hld.chainid[t];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n printf(\"%lld\\n\",ans);\n }else{\n // add\n ll a,b;\n scanf(\"%lld%lld\",&a,&b);\n while(true){\n int id = hld.chainid[s];\n int r = hld.chainpos[s]+1;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca];\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n (a += (r-l)*b) %= MOD;\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n int rest = hld.depth[t] - hld.depth[lca];\n (a += (rest-1)*b) %= MOD;\n b = MOD-b;\n while(true){\n int id = hld.chainid[t];\n int r = hld.chainpos[t]+1;\n if(t == lca)break;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca] + 1;\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":34100,"score_of_the_acc":-0.1751,"final_rank":2},{"submission_id":"aoj_3050_3154104","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing PII = pair<int, int>;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<V<T>>;\ntemplate <typename T> using VVV = vector<VV<T>>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll INF = (1LL<<60);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nstruct HLDecomposition {\n int n, pos;\n VV<int> g;\n V<int> vid, // HL分解後のグラフでのid\n head, // 頂点が属するheavy-pathのheadのid\n sub, // 部分木のサイズ\n hvy, // heavy-path上での次の頂点のid\n par, // 親のid\n depth, // 深さ\n inv, // HL分解前のグラフのid（添え字が分解後のid）\n type, // 森をHL分解するときの属する木の番号\n ps, // 行きがけ順\n pt; // 帰りがけ順\n\n HLDecomposition(){}\n HLDecomposition(int sz):\n n(sz), pos(0), g(n),\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\n\n // 辺の追加\n void add_edge(int u, int v) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n // HL分解の構築を行う\n void build(V<int> rs=V<int>(1,0)) {\n int c=0;\n for(int r: rs) {\n dfs1(r);\n dfs2(r, c++);\n }\n }\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\n void dfs1(int rt) {\n stack<PII> st;\n par[rt] = -1;\n depth[rt] = 0;\n st.emplace(rt, 0);\n while(st.size()) {\n int v = st.top().first;\n int &i = st.top().second;\n if(i < (int)g[v].size()) {\n \tint u = g[v][i++];\n \tif(u == par[v]) continue;\n \tpar[u] = v;\n \tdepth[u] = depth[v]+1;\n \tst.emplace(u, 0);\n } else {\n \tst.pop();\n \tfor(int &u: g[v]){\n if(u == par[v]) swap(u, g[v].back());\n if(u == par[v]) continue;\n sub[v] += sub[u];\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\n \t}\n }\n }\n }\n // 根r、c番目の木についてchainについての情報をまとめる\n void dfs2(int r, int c) {\n using T = tuple<int, int, int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()) {\n int v,h;\n tie(v,h,ignore)=st.top();\n int &i=get<2>(st.top());\n if(!i) {\n type[v]=c;\n ps[v]=vid[v]=pos++;\n inv[vid[v]]=v;\n head[v]=h;\n hvy[v]=(g[v].empty()?-1:g[v][0]);\n if(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(int)g[v].size()) {\n int u=g[v][i++];\n if(u==par[v]) continue;\n st.emplace(u,(hvy[v]==u?h:u),0);\n } else {\n st.pop();\n pt[v]=pos;\n }\n }\n }\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\n void for_each(int u, int v, const function<void(int,int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\n f(max(vid[head[v]], vid[u]), vid[v]);\n if(head[u]!=head[v]) v = par[head[v]];\n else break;\n }\n }\n // 辺に対する処理 [u,v] 開区間なので注意!!!\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]) {\n\t f(vid[head[v]], vid[v]);\n v = par[head[v]];\n } else {\n\t if(u!=v) f(vid[u]+1, vid[v]);\n\t break;\n }\n }\n }\n // 頂点u, vのLCA\n int lca(int u,int v){\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v = par[head[v]];\n }\n }\n // 頂点u, vの距離\n int distance(int u, int v){\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\n }\n};\n\n/**\n* @brief セグメント木\n* @details 抽象化した遅延セグメント木\\n\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\n\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\n\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\n\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\n\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\n*/\ntemplate <typename T, typename E>\nstruct lazySegTree {\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n using P = function<E(E,int)>;\n F f; G g; H h; P p; T d1; E d0;\n int n;\n vector<T> dat;\n vector<E> lazy;\n\n lazySegTree(){}\n lazySegTree(int n_, F f_, G g_, H h_, \n T d1_, E d0_, P p_=[](E a, int b){return a;})\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \n {\n n = 1; while(n < n_) n *= 2;\n dat.assign(n*2, d1);\n lazy.assign(n*2, d0);\n }\n void build(vector<T> v) {\n REP(i, v.size()) dat[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\n }\n\n // 区間の幅がlenの節点kについて遅延評価\n inline void eval(int len, int k) {\n if(lazy[k] == d0) return;\n if(k*2+1 < n*2-1) {\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\n lazy[2*k+2] = h(lazy[k*2+2], rx);\n }\n dat[k] = g(dat[k],p(lazy[k],len));\n lazy[k] = d0;\n }\n // [a, b)\n T update(int a, int b, E x, int k, int l, int r) {\n eval(r-l, k);\n if(b <= l || r <= a) return dat[k];\n if(a <= l && r <= b) {\n lazy[k] = h(lazy[k], x);\n eval(r-l, k);\n return dat[k];\n }\n int mid = (l+r)/2;\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\n if(left&right) { update(a, b, x, 2*k+1, l, mid); update(a, b, rx, 2*k+2, mid, r); }\n else if(left) update(a, b, x, 2*k+1, l, mid);\n else if(right) update(a, b, rx, 2*k+2, mid, r);\n eval(mid-l, 2*k+1); eval(r-mid, 2*k+2);\n return dat[k] = f(dat[2*k+1], dat[2*k+2]);\n }\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\n // [a, b)\n T query(int a, int b, int k, int l, int r) {\n eval(r-l, k);\n if(a <= l && r <= b) return dat[k];\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\n return query(a, b, 2*k+2, (l+r)/2, r);\n }\n T query(int a, int b) { return query(a, b, 0, 0, n); }\n // デバッグ出力\n void debug() {\n cout << \"---------------------\" << endl;\n int cnt = 0;\n for(int i=1; i<=n; i*=2) {\n REP(j, i) {cout << \"(\" << dat[cnt] << \",\" << lazy[cnt] << \") \"; cnt++;}\n cout << endl;\n }\n cout << \"---------------------\" << endl;\n }\n};\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, q;\n cin >> n >> q;\n HLDecomposition hld(n);\n REP(i, n-1) {\n int a, b;\n cin >> a >> b;\n hld.add_edge(a, b);\n }\n hld.build();\n\n auto f = [&](int a, int b){ return (a+b) % MOD; };\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\n auto h = [&](PII a, PII b){ \n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\n };\n auto p = [&](PII a, int b){ \n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \n };\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\n\n REP(i, q) {\n int type; cin >> type;\n if(type == 0) {\n // sum\n int s, t;\n cin >> s >> t;\n int ans = 0;\n hld.for_each(s, t, [&](int l, int r){\n // cout << \"l=\" << l << \" r=\" << r << endl;\n (ans += seg.query(l, r+1)) %= MOD;\n });\n cout << (ans+MOD)%MOD << endl;\n } else {\n // add\n int s, t, a, d;\n cin >> s >> t >> a >> d;\n hld.for_each(s, t, [&](int l, int r){\n // 初項と公差の正負を求める\n int dist1 = hld.distance(s, hld.inv[l]);\n int dist2 = hld.distance(s, hld.inv[r]);\n int ta = (a + dist1 * d % MOD) % MOD;\n int td = d;\n if(dist1 > dist2) td = MOD-d;\n // cout << \"l=\" << l << \" r=\" << r << \" \" << hld.inv[l] << \" \" << hld.inv[r] << \" \" << ta << \" \" << td << endl;\n seg.update(l, r+1, {ta, td});\n });\n }\n // seg.debug();\n }\n\n return 0;\n}","accuracy":0.14893617021276595,"time_ms":270,"memory_kb":22132,"score_of_the_acc":-0.0389,"final_rank":18},{"submission_id":"aoj_3050_3153942","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing PII = pair<int, int>;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<V<T>>;\ntemplate <typename T> using VVV = vector<VV<T>>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll INF = (1LL<<60);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nstruct HLDecomposition {\n int n, pos;\n VV<int> g;\n V<int> vid, // HL分解後のグラフでのid\n head, // 頂点が属するheavy-pathのheadのid\n sub, // 部分木のサイズ\n hvy, // heavy-path上での次の頂点のid\n par, // 親のid\n depth, // 深さ\n inv, // HL分解前のグラフのid（添え字が分解後のid）\n type, // 森をHL分解するときの属する木の番号\n ps, // 行きがけ順\n pt; // 帰りがけ順\n\n HLDecomposition(){}\n HLDecomposition(int sz):\n n(sz), pos(0), g(n),\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\n\n // 辺の追加\n void add_edge(int u, int v) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n // HL分解の構築を行う\n void build(V<int> rs=V<int>(1,0)) {\n int c=0;\n for(int r: rs) {\n dfs1(r);\n dfs2(r, c++);\n }\n }\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\n void dfs1(int rt) {\n stack<PII> st;\n par[rt] = -1;\n depth[rt] = 0;\n st.emplace(rt, 0);\n while(st.size()) {\n int v = st.top().first;\n int &i = st.top().second;\n if(i < (int)g[v].size()) {\n \tint u = g[v][i++];\n \tif(u == par[v]) continue;\n \tpar[u] = v;\n \tdepth[u] = depth[v]+1;\n \tst.emplace(u, 0);\n } else {\n \tst.pop();\n \tfor(int &u: g[v]){\n if(u == par[v]) swap(u, g[v].back());\n if(u == par[v]) continue;\n sub[v] += sub[u];\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\n \t}\n }\n }\n }\n // 根r、c番目の木についてchainについての情報をまとめる\n void dfs2(int r, int c) {\n using T = tuple<int, int, int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()) {\n int v,h;\n tie(v,h,ignore)=st.top();\n int &i=get<2>(st.top());\n if(!i) {\n type[v]=c;\n ps[v]=vid[v]=pos++;\n inv[vid[v]]=v;\n head[v]=h;\n hvy[v]=(g[v].empty()?-1:g[v][0]);\n if(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(int)g[v].size()) {\n int u=g[v][i++];\n if(u==par[v]) continue;\n st.emplace(u,(hvy[v]==u?h:u),0);\n } else {\n st.pop();\n pt[v]=pos;\n }\n }\n }\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\n void for_each(int u, int v, const function<void(int,int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\n f(max(vid[head[v]], vid[u]), vid[v]);\n if(head[u]!=head[v]) v = par[head[v]];\n else break;\n }\n }\n // 辺に対する処理 [u,v] 開区間なので注意!!!\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]) {\n\t f(vid[head[v]], vid[v]);\n v = par[head[v]];\n } else {\n\t if(u!=v) f(vid[u]+1, vid[v]);\n\t break;\n }\n }\n }\n // 頂点u, vのLCA\n int lca(int u,int v){\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v = par[head[v]];\n }\n }\n // 頂点u, vの距離\n int distance(int u, int v){\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\n }\n};\n\n/**\n* @brief セグメント木\n* @details 抽象化した遅延セグメント木\\n\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\n\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\n\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\n\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\n\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\n*/\ntemplate <typename T, typename E>\nstruct lazySegTree {\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n using P = function<E(E,int)>;\n F f; G g; H h; P p; T d1; E d0;\n int n;\n vector<T> dat;\n vector<E> lazy;\n\n lazySegTree(){}\n lazySegTree(int n_, F f_, G g_, H h_, \n T d1_, E d0_, P p_=[](E a, int b){return a;})\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \n {\n n = 1; while(n < n_) n *= 2;\n dat.assign(n*2, d1);\n lazy.assign(n*2, d0);\n }\n void build(vector<T> v) {\n REP(i, v.size()) dat[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\n }\n\n // 区間の幅がlenの節点kについて遅延評価\n inline void eval(int len, int k) {\n if(lazy[k] == d0) return;\n if(k*2+1 < n*2-1) {\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\n lazy[2*k+2] = h(lazy[k*2+2], rx);\n }\n dat[k] = g(dat[k],p(lazy[k],len));\n lazy[k] = d0;\n }\n // [a, b)\n T update(int a, int b, E x, int k, int l, int r) {\n eval(r-l, k);\n if(b <= l || r <= a) return dat[k];\n if(a <= l && r <= b) {\n lazy[k] = h(lazy[k], x);\n return g(dat[k], p(lazy[k],r-l));\n }\n int mid = (l+r)/2;\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\n update(a, b, rx, 2*k+2, mid, r));\n }\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\n // [a, b)\n T query(int a, int b, int k, int l, int r) {\n eval(r-l, k);\n if(a <= l && r <= b) return dat[k];\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\n return query(a, b, 2*k+2, (l+r)/2, r);\n }\n T query(int a, int b) { return query(a, b, 0, 0, n); }\n // デバッグ出力\n void debug() {\n cout << \"---------------------\" << endl;\n int cnt = 0;\n for(int i=1; i<=n; i*=2) {\n REP(j, i) {cout << \"(\" << dat[cnt] << \",\" << lazy[cnt] << \") \"; cnt++;}\n cout << endl;\n }\n cout << \"---------------------\" << endl;\n }\n};\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, q;\n cin >> n >> q;\n HLDecomposition hld(n);\n REP(i, n-1) {\n int a, b;\n cin >> a >> b;\n hld.add_edge(a, b);\n }\n hld.build();\n\n auto f = [&](int a, int b){ return (a+b) % MOD; };\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\n auto h = [&](PII a, PII b){ \n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\n };\n auto p = [&](PII a, int b){ \n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \n };\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\n\n REP(i, q) {\n int type; cin >> type;\n if(type == 0) {\n // sum\n int s, t;\n cin >> s >> t;\n int ans = 0;\n hld.for_each(s, t, [&](int l, int r){\n (ans += seg.query(l, r+1)) %= MOD;\n });\n cout << (ans+MOD)%MOD << endl;\n } else {\n // add\n int s, t, a, d;\n cin >> s >> t >> a >> d;\n hld.for_each(s, t, [&](int l, int r){\n // 初項と公差の正負を求める\n int dist1 = hld.distance(s, hld.inv[l]);\n int dist2 = hld.distance(s, hld.inv[r]);\n int ta = (a + dist1 * d % MOD) % MOD;\n int td = d;\n if(dist1 > dist2) td = MOD-d;\n // cout << \"l=\" << l << \" r=\" << r << \" \" << ta << \" \" << td << endl;\n seg.update(l, r+1, {ta, td});\n });\n }\n\n // seg.debug();\n }\n\n return 0;\n}","accuracy":0.14893617021276595,"time_ms":270,"memory_kb":21948,"score_of_the_acc":-0.0371,"final_rank":17},{"submission_id":"aoj_3050_3153918","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing PII = pair<int, int>;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<V<T>>;\ntemplate <typename T> using VVV = vector<VV<T>>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll INF = (1LL<<60);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nstruct HLDecomposition {\n int n, pos;\n VV<int> g;\n V<int> vid, // HL分解後のグラフでのid\n head, // 頂点が属するheavy-pathのheadのid\n sub, // 部分木のサイズ\n hvy, // heavy-path上での次の頂点のid\n par, // 親のid\n depth, // 深さ\n inv, // HL分解前のグラフのid（添え字が分解後のid）\n type, // 森をHL分解するときの属する木の番号\n ps, // 行きがけ順\n pt; // 帰りがけ順\n\n HLDecomposition(){}\n HLDecomposition(int sz):\n n(sz), pos(0), g(n),\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\n\n // 辺の追加\n void add_edge(int u, int v) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n // HL分解の構築を行う\n void build(V<int> rs=V<int>(1,0)) {\n int c=0;\n for(int r: rs) {\n dfs1(r);\n dfs2(r, c++);\n }\n }\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\n void dfs1(int rt) {\n stack<PII> st;\n par[rt] = -1;\n depth[rt] = 0;\n st.emplace(rt, 0);\n while(st.size()) {\n int v = st.top().first;\n int &i = st.top().second;\n if(i < (int)g[v].size()) {\n \tint u = g[v][i++];\n \tif(u == par[v]) continue;\n \tpar[u] = v;\n \tdepth[u] = depth[v]+1;\n \tst.emplace(u, 0);\n } else {\n \tst.pop();\n \tfor(int &u: g[v]){\n if(u == par[v]) swap(u, g[v].back());\n if(u == par[v]) continue;\n sub[v] += sub[u];\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\n \t}\n }\n }\n }\n // 根r、c番目の木についてchainについての情報をまとめる\n void dfs2(int r, int c) {\n using T = tuple<int, int, int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()) {\n int v,h;\n tie(v,h,ignore)=st.top();\n int &i=get<2>(st.top());\n if(!i) {\n type[v]=c;\n ps[v]=vid[v]=pos++;\n inv[vid[v]]=v;\n head[v]=h;\n hvy[v]=(g[v].empty()?-1:g[v][0]);\n if(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(int)g[v].size()) {\n int u=g[v][i++];\n if(u==par[v]) continue;\n st.emplace(u,(hvy[v]==u?h:u),0);\n } else {\n st.pop();\n pt[v]=pos;\n }\n }\n }\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\n void for_each(int u, int v, const function<void(int,int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\n f(max(vid[head[v]], vid[u]), vid[v]);\n if(head[u]!=head[v]) v = par[head[v]];\n else break;\n }\n }\n // 辺に対する処理 [u,v] 開区間なので注意!!!\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]) {\n\t f(vid[head[v]], vid[v]);\n v = par[head[v]];\n } else {\n\t if(u!=v) f(vid[u]+1, vid[v]);\n\t break;\n }\n }\n }\n // 頂点u, vのLCA\n int lca(int u,int v){\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v = par[head[v]];\n }\n }\n // 頂点u, vの距離\n int distance(int u, int v){\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\n }\n};\n\n/**\n* @brief セグメント木\n* @details 抽象化した遅延セグメント木\\n\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\n\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\n\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\n\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\n\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\n*/\ntemplate <typename T, typename E>\nstruct lazySegTree {\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n using P = function<E(E,int)>;\n F f; G g; H h; P p; T d1; E d0;\n int n;\n vector<T> dat;\n vector<E> lazy;\n\n lazySegTree(){}\n lazySegTree(int n_, F f_, G g_, H h_, \n T d1_, E d0_, P p_=[](E a, int b){return a;})\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \n {\n n = 1; while(n < n_) n *= 2;\n dat.assign(n*2, d1);\n lazy.assign(n*2, d0);\n }\n void build(vector<T> v) {\n REP(i, v.size()) dat[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\n }\n\n // 区間の幅がlenの節点kについて遅延評価\n inline void eval(int len, int k) {\n if(lazy[k] == d0) return;\n if(k*2+1 < n*2-1) {\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\n lazy[2*k+2] = h(lazy[k*2+2], rx);\n }\n dat[k] = g(dat[k],p(lazy[k],len));\n lazy[k] = d0;\n }\n // [a, b)\n T update(int a, int b, E x, int k, int l, int r) {\n eval(r-l, k);\n if(b <= l || r <= a) return dat[k];\n if(a <= l && r <= b) {\n lazy[k] = h(lazy[k], x);\n return g(dat[k], p(lazy[k],r-l));\n }\n int mid = (l+r)/2;\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\n update(a, b, rx, 2*k+2, mid, r));\n }\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\n // [a, b)\n T query(int a, int b, int k, int l, int r) {\n eval(r-l, k);\n if(a <= l && r <= b) return dat[k];\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\n return query(a, b, 2*k+2, (l+r)/2, r);\n }\n T query(int a, int b) { return query(a, b, 0, 0, n); }\n // デバッグ出力\n void debug() {\n cout << \"---------------------\" << endl;\n int cnt = 0;\n for(int i=1; i<=n; i*=2) {\n REP(j, i) {cout << \"(\" << dat[cnt] << \",\" << lazy[cnt] << \") \"; cnt++;}\n cout << endl;\n }\n cout << \"---------------------\" << endl;\n }\n};\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, q;\n cin >> n >> q;\n HLDecomposition hld(n);\n REP(i, n-1) {\n int a, b;\n cin >> a >> b;\n hld.add_edge(a, b);\n }\n hld.build();\n\n auto f = [&](int a, int b){ return (a+b) % MOD; };\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\n auto h = [&](PII a, PII b){ \n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\n };\n auto p = [&](PII a, int b){ \n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \n };\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\n\n REP(i, q) {\n int type; cin >> type;\n if(type == 0) {\n // sum\n int s, t;\n cin >> s >> t;\n int ans = 0;\n hld.for_each(s, t, [&](int l, int r){\n (ans += seg.query(l, r+1)) %= MOD;\n });\n cout << (ans+MOD)%MOD << endl;\n } else {\n // add\n int s, t, a, d;\n cin >> s >> t >> a >> d;\n hld.for_each(s, t, [&](int l, int r){\n // 初項と公差の正負を求める\n int dist1 = hld.distance(s, hld.inv[l]);\n int dist2 = hld.distance(s, hld.inv[r]);\n int ta = a + dist1 * d;\n int td = d;\n if(dist1 > dist2) td *= -1;\n // cout << \"l=\" << l << \" r=\" << r << \" \" << ta << \" \" << td << endl;\n seg.update(l, r+1, {ta, td});\n });\n }\n\n // seg.debug();\n }\n\n return 0;\n}","accuracy":0.14893617021276595,"time_ms":280,"memory_kb":21944,"score_of_the_acc":-0.0404,"final_rank":19},{"submission_id":"aoj_3050_3153916","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define int ll\nusing PII = pair<int, int>;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<V<T>>;\ntemplate <typename T> using VVV = vector<VV<T>>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define PB push_back\n\nconst ll INF = (1LL<<60);\nconst int MOD = 1000000007;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\ntemplate<class S,class T>\nostream &operator <<(ostream& out,const pair<S,T>& a){\n out<<'('<<a.first<<','<<a.second<<')';\n return out;\n}\ntemplate<class T>\nostream &operator <<(ostream& out,const vector<T>& a){\n out<<'[';\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\n out<<']';\n return out;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nstruct HLDecomposition {\n int n, pos;\n VV<int> g;\n V<int> vid, // HL分解後のグラフでのid\n head, // 頂点が属するheavy-pathのheadのid\n sub, // 部分木のサイズ\n hvy, // heavy-path上での次の頂点のid\n par, // 親のid\n depth, // 深さ\n inv, // HL分解前のグラフのid（添え字が分解後のid）\n type, // 森をHL分解するときの属する木の番号\n ps, // 行きがけ順\n pt; // 帰りがけ順\n\n HLDecomposition(){}\n HLDecomposition(int sz):\n n(sz), pos(0), g(n),\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\n\n // 辺の追加\n void add_edge(int u, int v) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n // HL分解の構築を行う\n void build(V<int> rs=V<int>(1,0)) {\n int c=0;\n for(int r: rs) {\n dfs1(r);\n dfs2(r, c++);\n }\n }\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\n void dfs1(int rt) {\n stack<PII> st;\n par[rt] = -1;\n depth[rt] = 0;\n st.emplace(rt, 0);\n while(st.size()) {\n int v = st.top().first;\n int &i = st.top().second;\n if(i < (int)g[v].size()) {\n \tint u = g[v][i++];\n \tif(u == par[v]) continue;\n \tpar[u] = v;\n \tdepth[u] = depth[v]+1;\n \tst.emplace(u, 0);\n } else {\n \tst.pop();\n \tfor(int &u: g[v]){\n if(u == par[v]) swap(u, g[v].back());\n if(u == par[v]) continue;\n sub[v] += sub[u];\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\n \t}\n }\n }\n }\n // 根r、c番目の木についてchainについての情報をまとめる\n void dfs2(int r, int c) {\n using T = tuple<int, int, int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()) {\n int v,h;\n tie(v,h,ignore)=st.top();\n int &i=get<2>(st.top());\n if(!i) {\n type[v]=c;\n ps[v]=vid[v]=pos++;\n inv[vid[v]]=v;\n head[v]=h;\n hvy[v]=(g[v].empty()?-1:g[v][0]);\n if(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(int)g[v].size()) {\n int u=g[v][i++];\n if(u==par[v]) continue;\n st.emplace(u,(hvy[v]==u?h:u),0);\n } else {\n st.pop();\n pt[v]=pos;\n }\n }\n }\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\n void for_each(int u, int v, const function<void(int,int)>& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\n f(max(vid[head[v]], vid[u]), vid[v]);\n if(head[u]!=head[v]) v = par[head[v]];\n else break;\n }\n }\n // 辺に対する処理 [u,v] 開区間なので注意!!!\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]) {\n\t f(vid[head[v]], vid[v]);\n v = par[head[v]];\n } else {\n\t if(u!=v) f(vid[u]+1, vid[v]);\n\t break;\n }\n }\n }\n // 頂点u, vのLCA\n int lca(int u,int v){\n while(1) {\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v = par[head[v]];\n }\n }\n // 頂点u, vの距離\n int distance(int u, int v){\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\n }\n};\n\n/**\n* @brief セグメント木\n* @details 抽象化した遅延セグメント木\\n\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\n\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\n\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\n\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\n\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\n*/\ntemplate <typename T, typename E>\nstruct lazySegTree {\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n using P = function<E(E,int)>;\n F f; G g; H h; P p; T d1; E d0;\n int n;\n vector<T> dat;\n vector<E> lazy;\n\n lazySegTree(){}\n lazySegTree(int n_, F f_, G g_, H h_, \n T d1_, E d0_, P p_=[](E a, int b){return a;})\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \n {\n n = 1; while(n < n_) n *= 2;\n dat.assign(n*2, d1);\n lazy.assign(n*2, d0);\n }\n void build(vector<T> v) {\n REP(i, v.size()) dat[i+n-1] = v[i];\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\n }\n\n // 区間の幅がlenの節点kについて遅延評価\n inline void eval(int len, int k) {\n if(lazy[k] == d0) return;\n if(k*2+1 < n*2-1) {\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\n lazy[2*k+2] = h(lazy[k*2+2], rx);\n }\n dat[k] = g(dat[k],p(lazy[k],len));\n lazy[k] = d0;\n }\n // [a, b)\n T update(int a, int b, E x, int k, int l, int r) {\n eval(r-l, k);\n if(b <= l || r <= a) return dat[k];\n if(a <= l && r <= b) {\n lazy[k] = h(lazy[k], x);\n return g(dat[k], p(lazy[k],r-l));\n }\n int mid = (l+r)/2;\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\n update(a, b, rx, 2*k+2, mid, r));\n }\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\n // [a, b)\n T query(int a, int b, int k, int l, int r) {\n eval(r-l, k);\n if(a <= l && r <= b) return dat[k];\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\n return query(a, b, 2*k+2, (l+r)/2, r);\n }\n T query(int a, int b) { return query(a, b, 0, 0, n); }\n // デバッグ出力\n void debug() {\n cout << \"---------------------\" << endl;\n int cnt = 0;\n for(int i=1; i<=n; i*=2) {\n REP(j, i) {cout << \"(\" << dat[cnt] << \",\" << lazy[cnt] << \") \"; cnt++;}\n cout << endl;\n }\n cout << \"---------------------\" << endl;\n }\n};\n\nsigned main(void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, q;\n cin >> n >> q;\n HLDecomposition hld(n);\n REP(i, n-1) {\n int a, b;\n cin >> a >> b;\n hld.add_edge(a, b);\n }\n hld.build();\n\n auto f = [&](int a, int b){ return (a+b) % MOD; };\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\n auto h = [&](PII a, PII b){ \n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\n };\n auto p = [&](PII a, int b){ \n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \n };\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\n\n REP(i, q) {\n int type; cin >> type;\n if(type == 0) {\n // sum\n int s, t;\n cin >> s >> t;\n int ans = 0;\n hld.for_each(s, t, [&](int l, int r){\n (ans += seg.query(l, r+1)) %= MOD;\n });\n cout << ans << endl;\n } else {\n // add\n int s, t, a, d;\n cin >> s >> t >> a >> d;\n hld.for_each(s, t, [&](int l, int r){\n // 初項と公差の正負を求める\n int dist1 = hld.distance(s, hld.inv[l]);\n int dist2 = hld.distance(s, hld.inv[r]);\n int ta = a + dist1 * d;\n int td = d;\n if(dist1 > dist2) td *= -1;\n // cout << \"l=\" << l << \" r=\" << r << \" \" << ta << \" \" << td << endl;\n seg.update(l, r+1, {ta, td});\n });\n }\n\n // seg.debug();\n }\n\n return 0;\n}","accuracy":0.14893617021276595,"time_ms":280,"memory_kb":22000,"score_of_the_acc":-0.041,"final_rank":20},{"submission_id":"aoj_3050_3152337","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct HLDecomposition {\n int n,pos;\n vector<vector<int> > G;\n vector<int> vid, head, sub, par, dep, inv, type;\n \n HLDecomposition(){}\n HLDecomposition(int n):\n n(n),pos(0),G(n),vid(n,-1),head(n),sub(n,1),\n par(n,-1),dep(n,0),inv(n),type(n){}\n \n void add_edge(int u, int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n void build(vector<int> rs={0}) {\n int c=0;\n for(int r:rs){\n dfs_sz(r);\n head[r]=r;\n dfs_hld(r,c++);\n }\n }\n \n void dfs_sz(int v) {\n for(int &u:G[v]){\n if(u==par[v]) continue;\n par[u]=v;\n dep[u]=dep[v]+1;\n dfs_sz(u); \n sub[v]+=sub[u]; \n if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]);\n }\n }\n\n void dfs_hld(int v,int c) {\n vid[v]=pos++;\n inv[vid[v]]=v;\n type[v]=c;\n for(int u:G[v]){\n if(u==par[v]) continue;\n head[u]=(u==G[v][0]?head[v]:u);\n dfs_hld(u,c);\n } \n }\n \n // for_each(vertex)\n // [l,r] <- attention!! \n template<typename F>\n void for_each(int u, int v, const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n f(max(vid[head[v]],vid[u]),vid[v]);\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n }\n\n template<typename T,typename Q,typename F>\n T for_each(int u,int v,T ti,const Q &q,const F &f){\n T l=ti,r=ti;\n while(1){\n if(vid[u]>vid[v]){\n\tswap(u,v);\n\tswap(l,r);\n }\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n return f(l,r);\n }\n \n // for_each(edge)\n // [l,r] <- attention!!\n template<typename F>\n void for_each_edge(int u, int v,const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]){\n\tf(vid[head[v]],vid[v]);\n v=par[head[v]];\n }else{\n\tif(u!=v) f(vid[u]+1,vid[v]);\n\tbreak;\n }\n }\n }\n \n int lca(int u,int v){\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v=par[head[v]];\n }\n }\n\n int distance(int u,int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n};\n\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n\ntemplate<int MOD = 1000000007>\nstruct Mint{\n int v;\n Mint():v(0){}\n Mint(int v):v(v){}\n Mint(int v,bool f):v(v){if(f) v%=MOD;}\n\n Mint pow(int k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n \n Mint inv(){return pow(MOD-2);}\n \n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n \n Mint operator+(Mint a){return Mint(v)+=a;};\n Mint operator-(Mint a){return Mint(v)-=a;};\n Mint operator*(Mint a){return Mint(v)*=a;};\n Mint operator/(Mint a){return Mint(v)/=a;};\n\n Mint operator-(){return v?MOD-v:v;}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n \n vector<Mint> fact(int n){\n vector<Mint> res(n+1,1);\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\n return res;\n }\n \n vector<Mint> finv(int n){\n vector<Mint> res(n+1,1);\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\n res[n]=Mint(1)/res[n];\n for(int i=n;i>=1;i--) res[i-1]=res[i]*Mint(i);\n return res;\n }\n\n vector<Mint> invs(vector<Mint> &a,vector<Mint> &b){\n int n=a.size()-1;\n vector<Mint> res(n+1,0);\n for(int i=1;i<=n;i++) res[i]=b[i]*a[i-1];\n return res;\n }\n};\n\ntemplate<int MOD>\nistream& operator>>(istream &is, Mint<MOD>& a){\n is>>a.v;\n return is;\n} \ntemplate<int MOD>\nostream& operator<<(ostream &os, Mint<MOD>& a){\n os<<a.v;\n return os;\n} \n\n//INSERT ABOVE HERE\nconst int MOD = 1e9+7;\nsigned main(){ \n using M = Mint<MOD>;\n \n int n,q;\n scanf(\"%d %d\",&n,&q);\n \n HLDecomposition hld(n);\n for(int i=1;i<n;i++){\n int a,b;\n scanf(\"%d %d\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.build();\n\n \n struct T{\n int l,r;\n M s;\n T(){}\n T(int l,int r,M s):l(l),r(r),s(s){};\n };\n \n struct P{\n M a,b;\n P(){}\n P(M a,M b):a(a),b(b){};\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n auto f=[&](T a,T b){return T(a.l,b.r,a.s+b.s);};\n auto g=[&](T a,P b){\n\t M k(a.r-a.l);\n\t M t(1LL*(a.r-a.l)*(a.r-a.l-1)/2,1);\n\t b.b=(b.b+M(a.l)*b.a)*k;\n\t a.s+=t*b.a+b.b;\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(a.a+b.a,a.b+b.b);};\n \n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,M()),P(M(),M()));\n vector<T> vt(n);\n for(int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\n seg.build(n,vt);\n \n for(int i=0;i<q;i++){\n int c,s,t;\n scanf(\"%d %d %d\",&c,&s,&t);\n int l=hld.lca(s,t);\n \n if(c==1){\n M b,a;\n scanf(\"%d %d\",&b.v,&a.v);\n M up=b-M(hld.dep[s])*-a;\n M dw=b+M(hld.distance(s,t))*a-M(hld.dep[t])*a;\n hld.for_each(l,s,[&](int l,int r){seg.update(l,r+1,P(-a,up));});\n hld.for_each_edge(l,t,[&](int l,int r){seg.update(l,r+1,P(a,dw));}); \n }else{ \n auto ask=[&](int l,int r){return seg.query(l,r+1);};\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\n printf(\"%d\\n\",ans.s.v);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":1200,"memory_kb":22052,"score_of_the_acc":-0.3512,"final_rank":8},{"submission_id":"aoj_3050_3152335","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct HLDecomposition {\n int n,pos;\n vector<vector<int> > G;\n vector<int> vid, head, sub, par, dep, inv, type;\n \n HLDecomposition(){}\n HLDecomposition(int n):\n n(n),pos(0),G(n),vid(n,-1),head(n),sub(n,1),\n par(n,-1),dep(n,0),inv(n),type(n){}\n \n void add_edge(int u, int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n void build(vector<int> rs={0}) {\n int c=0;\n for(int r:rs){\n dfs_sz(r);\n head[r]=r;\n dfs_hld(r,c++);\n }\n }\n \n void dfs_sz(int v) {\n for(int &u:G[v]){\n if(u==par[v]) continue;\n par[u]=v;\n dep[u]=dep[v]+1;\n dfs_sz(u); \n sub[v]+=sub[u]; \n if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]);\n }\n }\n\n void dfs_hld(int v,int c) {\n vid[v]=pos++;\n inv[vid[v]]=v;\n type[v]=c;\n for(int u:G[v]){\n if(u==par[v]) continue;\n head[u]=(u==G[v][0]?head[v]:u);\n dfs_hld(u,c);\n } \n }\n \n // for_each(vertex)\n // [l,r] <- attention!! \n template<typename F>\n void for_each(int u, int v, const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n f(max(vid[head[v]],vid[u]),vid[v]);\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n }\n\n template<typename T,typename Q,typename F>\n T for_each(int u,int v,T ti,const Q &q,const F &f){\n T l=ti,r=ti;\n while(1){\n if(vid[u]>vid[v]){\n\tswap(u,v);\n\tswap(l,r);\n }\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n return f(l,r);\n }\n \n // for_each(edge)\n // [l,r] <- attention!!\n template<typename F>\n void for_each_edge(int u, int v,const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]){\n\tf(vid[head[v]],vid[v]);\n v=par[head[v]];\n }else{\n\tif(u!=v) f(vid[u]+1,vid[v]);\n\tbreak;\n }\n }\n }\n \n int lca(int u,int v){\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v=par[head[v]];\n }\n }\n\n int distance(int u,int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n};\n\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(int n_, vector<T> v){\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(int a,int b,E x){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(int a,int b){\n a+=n;b+=n-1;\n for(int i=height;i;i--) eval(a>>i);\n for(int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n\ntemplate<int MOD = 1000000007>\nstruct Mint{\n int v;\n Mint():v(0){}\n Mint(int v):v(v){}\n Mint(int v,bool f):v(v){if(f) v%=MOD;}\n\n Mint pow(int k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n \n Mint inv(){return pow(MOD-2);}\n \n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n \n Mint operator+(Mint a){return Mint(v)+=a;};\n Mint operator-(Mint a){return Mint(v)-=a;};\n Mint operator*(Mint a){return Mint(v)*=a;};\n Mint operator/(Mint a){return Mint(v)/=a;};\n\n Mint operator-(){return v?MOD-v:v;}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n \n vector<Mint> fact(int n){\n vector<Mint> res(n+1,1);\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\n return res;\n }\n \n vector<Mint> finv(int n){\n vector<Mint> res(n+1,1);\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\n res[n]=Mint(1)/res[n];\n for(int i=n;i>=1;i--) res[i-1]=res[i]*Mint(i);\n return res;\n }\n\n vector<Mint> invs(vector<Mint> &a,vector<Mint> &b){\n int n=a.size()-1;\n vector<Mint> res(n+1,0);\n for(int i=1;i<=n;i++) res[i]=b[i]*a[i-1];\n return res;\n }\n};\n\ntemplate<int MOD>\nistream& operator>>(istream &is, Mint<MOD>& a){\n is>>a.v;\n return is;\n} \ntemplate<int MOD>\nostream& operator<<(ostream &os, Mint<MOD>& a){\n os<<a.v;\n return os;\n} \n\n//INSERT ABOVE HERE\nsigned main(){ \n constexpr int MOD = 1e9+7;\n using M = Mint<MOD>;\n \n int n,q;\n scanf(\"%d %d\",&n,&q);\n \n HLDecomposition hld(n);\n for(int i=1;i<n;i++){\n int a,b;\n scanf(\"%d %d\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.build();\n\n \n struct T{\n int l,r;\n M s;\n T(){}\n T(int l,int r,M s):l(l),r(r),s(s){};\n };\n \n struct P{\n M a,b;\n P(){}\n P(M a,M b):a(a),b(b){};\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n auto f=[&](T a,T b){return T(a.l,b.r,a.s+b.s);};\n auto g=[&](T a,P b){\n\t M k(a.r-a.l);\n\t M t(1LL*(a.r-a.l)*(a.r-a.l-1)/2,1);\n\t b.b=(b.b+M(a.l)*b.a)*k;\n\t a.s+=t*b.a+b.b;\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(a.a+b.a,a.b+b.b);};\n \n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,M()),P(M(),M()));\n vector<T> vt(n);\n for(int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\n seg.build(n,vt);\n \n for(int i=0;i<q;i++){\n int c,s,t;\n scanf(\"%d %d %d\",&c,&s,&t);\n int l=hld.lca(s,t);\n \n if(c==1){\n M b,a;\n scanf(\"%d %d\",&b.v,&a.v);\n M up=b-M(hld.dep[s])*-a;\n M dw=b+M(hld.distance(s,t))*a-M(hld.dep[t])*a;\n hld.for_each(l,s,[&](int l,int r){seg.update(l,r+1,P(-a,up));});\n hld.for_each_edge(l,t,[&](int l,int r){seg.update(l,r+1,P(a,dw));}); \n }else{ \n auto ask=[&](int l,int r){return seg.query(l,r+1);};\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\n printf(\"%d\\n\",ans.s.v);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":1210,"memory_kb":22056,"score_of_the_acc":-0.3547,"final_rank":9},{"submission_id":"aoj_3050_3147910","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct HLDecomposition {\n Int n,pos;\n vector<vector<Int> > G;\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\n \n HLDecomposition(){}\n HLDecomposition(Int sz):\n n(sz),pos(0),G(n),\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\n par(n),dep(n),inv(n),type(n){}\n \n void add_edge(Int u, Int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n void build(vector<Int> rs={0}) {\n Int c=0;\n for(Int r:rs){\n dfs(r);\n bfs(r, c++);\n }\n }\n \n void dfs(Int rt) {\n using T = pair<Int, Int>;\n stack<T> st;\n par[rt]=-1;\n dep[rt]=0;\n st.emplace(rt,0);\n while(!st.empty()){\n Int v=st.top().first;\n Int &i=st.top().second;\n if(i<(Int)G[v].size()){\n\tInt u=G[v][i++];\n\tif(u==par[v]) continue;\n\tpar[u]=v;\n\tdep[u]=dep[v]+1;\n\tst.emplace(u,0);\n }else{\n\tst.pop();\n\tfor(Int j=0;j<(Int)G[v].size();j++){\n\t Int &u=G[v][j];\n\t if(u==par[v]) swap(u,G[v].back());\n\t if(u==par[v]) continue;\n\t sub[v]+=sub[u];\n\t if(sub[u]>sub[G[v].front()]) swap(u,G[v].front());\n\t}\n }\n }\n }\n\n void bfs(Int r,Int c) {\n using T = tuple<Int, Int, Int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()){\n Int v,h;\n tie(v,h,ignore)=st.top();\n Int &i=get<2>(st.top());\n if(!i){\n\ttype[v]=c;\n\tvid[v]=pos++;\n\tinv[vid[v]]=v;\n\thead[v]=h;\n hvy[v]=(G[v].empty()?-1:G[v][0]);\n\tif(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(Int)G[v].size()){\n\tInt u=G[v][i++];\n\tif(u==par[v]) continue;\n\tst.emplace(u,(hvy[v]==u?h:u),0);\n }else{\n\tst.pop();\n }\n }\n }\n \n // for_each(vertex)\n // [l,r] <- attention!! \n template<typename F>\n void for_each(Int u, Int v, const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n f(max(vid[head[v]],vid[u]),vid[v]);\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n }\n\n template<typename T,typename Q,typename F>\n T for_each(Int u,Int v,T ti,const Q &q,const F &f){\n T l=ti,r=ti;\n while(1){\n if(vid[u]>vid[v]){\n\tswap(u,v);\n\tswap(l,r);\n }\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n return f(l,r);\n }\n \n // for_each(edge)\n // [l,r] <- attention!!\n template<typename F>\n void for_each_edge(Int u, Int v,const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]){\n\tf(vid[head[v]],vid[v]);\n v=par[head[v]];\n }else{\n\tif(u!=v) f(vid[u]+1,vid[v]);\n\tbreak;\n }\n }\n }\n\n Int lca(Int u,Int v){\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v=par[head[v]];\n }\n }\n\n Int distance(Int u,Int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n};\n\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n Int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(Int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(Int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[n+i]=v[i];\n for(Int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(Int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(Int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(Int a,Int b,E x){\n a+=n;b+=n-1;\n for(Int i=height;i;i--) eval(a>>i);\n for(Int i=height;i;i--) eval(b>>i);\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(Int a,Int b){\n a+=n;b+=n-1;\n for(Int i=height;i;i--) eval(a>>i);\n for(Int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n//INSERT ABOVE HERE\n\nconst Int MOD = 1e9+7;\n\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n \n HLDecomposition hld(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.build();\n \n auto add=[](Int a,Int b){return (a+b)%MOD;};\n auto mul=[](Int a,Int b){return (a*b)%MOD;};\n\n struct T{\n Int l,r,s;\n T(){}\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\n };\n struct P{\n Int a,b;\n P(){}\n P(Int a,Int b):a(a),b(b){};\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n \n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\n auto g=[&](T a,P b){\n\t Int k=a.r-a.l;\n\t b.b=add(b.b,a.l*b.a)*k;\n\t a.s=add(a.s,add(mul(k*(k-1)/2%MOD,b.a),b.b));\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\n\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,0),P(0,0));\n vector<T> vt(n);\n for(Int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\n seg.build(n,vt);\n \n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=hld.lca(s,t);\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n Int up=(b+MOD-hld.dep[s]*(MOD-a)%MOD)%MOD;\n Int dw=(b+hld.distance(s,t)*a%MOD+MOD-hld.dep[t]*a%MOD)%MOD; \n hld.for_each(l,s,[&](Int l,Int r){seg.update(l,r+1,P(MOD-a,up));});\n hld.for_each_edge(l,t,[&](Int l,Int r){seg.update(l,r+1,P(a,dw));}); \n }else{ \n auto ask=[&](Int l,Int r){return seg.query(l,r+1);};\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\n printf(\"%lld\\n\",(ans.s+MOD)%MOD);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":890,"memory_kb":29720,"score_of_the_acc":-0.3234,"final_rank":7},{"submission_id":"aoj_3050_3147828","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n\nstruct TousaSegmentTree {\n int n;\n vector<ll> sum, lastval;\n vector<ll> rangeadd;\n TousaSegmentTree(int _n){\n n = 1;\n while(n<_n+1)n<<=1;\n sum.assign(2*n-1,0ll);\n lastval.assign(2*n-1,0ll);\n rangeadd.assign(2*n-1,0ll);\n }\n void push(int a, int b, int k){\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\n if(k<n-1){\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\n }\n rangeadd[k] = 0;\n }\n void _add(int l, int r, ll x, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return;\n if(l<=a && b<=r){\n (rangeadd[k] += x) %= MOD;\n push(a,b,k);\n }else{\n int m = (a+b)/2;\n _add(l,r,x,a,m,2*k+1);\n _add(l,r,x,m,b,2*k+2);\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\n }\n }\n void addTousa(int l, int r, ll a, ll b){\n _add(l,l+1,a,0,n,0);\n _add(l+1,r,b,0,n,0);\n _add(r,r+1,MOD-(a+(r-l-1)*b)%MOD,0,n,0);\n }\n ll sumTousa(int l, int r, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return 0ll;\n if(l<=a && b<=r){\n return sum[k];\n }else{\n int m = (a+b)/2;\n ll lsum = sumTousa(l,r,a,m,2*k+1);\n ll rsum = sumTousa(l,r,m,b,2*k+2);\n int rcnt = max(0,min(r,b)-max(l,m));\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\n }\n }\n ll sumTousa(int l, int r){\n return sumTousa(l,r,0,n,0);\n }\n};\n\nstruct HeavyLightDecomposition {\n int n;\n vector<vector<int>> g;\n vector<int> depth, parent, csize;\n vector<vector<int>> chains;\n vector<int> chainid, chainpos;\n int root = 0;\n HeavyLightDecomposition(int _n){\n n = _n;\n g.resize(n);\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\n chainid.assign(n,-1); chainpos.assign(n,-1);\n }\n void add_edge(int a, int b){\n g[a].push_back(b);\n g[b].push_back(a);\n }\n void dfs(int p, int bef, int d){\n depth[p] = d;\n csize[p] = 1;\n for(int to : g[p])if(to!=bef){\n dfs(to, p, d+1);\n parent[to] = p;\n csize[p] += csize[to];\n }\n }\n void dfs2(int p, int bef, int id){\n chainid[p] = id;\n chainpos[p] = chains[id].size();\n chains[id].push_back(p);\n for(int to : g[p])if(to!=bef){\n if(csize[to]*2 >= csize[p]){\n // heavy\n dfs2(to, p, id);\n }else{\n // light\n chains.push_back(vector<int>());\n dfs2(to, p, chains.size()-1);\n }\n }\n }\n void construct(){\n dfs(root,-1,0);\n chains.push_back(vector<int>());\n dfs2(root,-1,0);\n }\n int lca(int a, int b){\n while(a != b){\n if(depth[a] < depth[b])swap(a,b);\n if(chainid[a] == chainid[b])return b;\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\n a = chains[chainid[a]].front();\n a = parent[a];\n }\n return a;\n }\n};\n\nint main(){\n int n,q;\n scanf(\"%d%d\",&n,&q);\n HeavyLightDecomposition hld(n);\n REP(i,n-1){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.construct();\n\n vector<TousaSegmentTree> segs;\n REP(i,hld.chains.size()){\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\n }\n\n while(q--){\n int typ,s,t;\n scanf(\"%d%d%d\",&typ,&s,&t);\n int lca = hld.lca(s,t);\n if(typ == 0){\n // sum\n ll ans = 0;\n while(true){\n int id = hld.chainid[s];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n while(true){\n int id = hld.chainid[t];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n printf(\"%lld\\n\",ans);\n }else{\n // add\n ll a,b;\n scanf(\"%lld%lld\",&a,&b);\n while(true){\n int id = hld.chainid[s];\n int r = hld.chainpos[s]+1;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca];\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n (a += (r-l)*b) %= MOD;\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n int rest = hld.depth[t] - hld.depth[lca];\n (a += (rest-1)*b) %= MOD;\n b = MOD-b;\n while(true){\n int id = hld.chainid[t];\n int r = hld.chainpos[t]+1;\n if(t == lca)break;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca] + 1;\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":440,"memory_kb":36580,"score_of_the_acc":-0.2403,"final_rank":5},{"submission_id":"aoj_3050_3147766","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\n\n#define CHMIN(a,b) (a)=min((a),(b))\n#define CHMAX(a,b) (a)=max((a),(b))\n\n#define MOD 1000000007\n\nstruct TousaSegmentTree {\n int n;\n vector<ll> sum, lastval;\n vector<ll> rangeadd;\n TousaSegmentTree(int _n){\n n = 1;\n while(n<_n+1)n<<=1;\n sum.assign(2*n-1,0ll);\n lastval.assign(2*n-1,0ll);\n rangeadd.assign(2*n-1,0ll);\n }\n void push(int a, int b, int k){\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\n if(k<n-1){\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\n }\n rangeadd[k] = 0;\n }\n void _add(int l, int r, ll x, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return;\n if(l<=a && b<=r){\n (rangeadd[k] += x) %= MOD;\n push(a,b,k);\n }else{\n int m = (a+b)/2;\n _add(l,r,x,a,m,2*k+1);\n _add(l,r,x,m,b,2*k+2);\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\n }\n }\n void addTousa(int l, int r, ll a, ll b){\n _add(l,l+1,a,0,n,0);\n _add(l+1,r,b,0,n,0);\n _add(r,r+1,-a-(r-l-1)*b,0,n,0);\n }\n ll sumTousa(int l, int r, int a, int b, int k){\n push(a,b,k);\n if(r<=a || b<=l)return 0ll;\n if(l<=a && b<=r){\n return sum[k];\n }else{\n int m = (a+b)/2;\n ll lsum = sumTousa(l,r,a,m,2*k+1);\n ll rsum = sumTousa(l,r,m,b,2*k+2);\n int rcnt = max(0,min(r,b)-max(l,m));\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\n }\n }\n ll sumTousa(int l, int r){\n return sumTousa(l,r,0,n,0);\n }\n};\n\nstruct HeavyLightDecomposition {\n int n;\n vector<vector<int>> g;\n vector<int> depth, parent, csize;\n vector<vector<int>> chains;\n vector<int> chainid, chainpos;\n int root = 0;\n HeavyLightDecomposition(int _n){\n n = _n;\n g.resize(n);\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\n chainid.assign(n,-1); chainpos.assign(n,-1);\n }\n void add_edge(int a, int b){\n g[a].push_back(b);\n g[b].push_back(a);\n }\n void dfs(int p, int bef, int d){\n depth[p] = d;\n csize[p] = 1;\n for(int to : g[p])if(to!=bef){\n dfs(to, p, d+1);\n parent[to] = p;\n csize[p] += csize[to];\n }\n }\n void dfs2(int p, int bef, int id){\n chainid[p] = id;\n chainpos[p] = chains[id].size();\n chains[id].push_back(p);\n for(int to : g[p])if(to!=bef){\n if(csize[to]*2 >= csize[p]){\n // heavy\n dfs2(to, p, id);\n }else{\n // light\n chains.push_back(vector<int>());\n dfs2(to, p, chains.size()-1);\n }\n }\n }\n void construct(){\n dfs(root,-1,0);\n chains.push_back(vector<int>());\n dfs2(root,-1,0);\n }\n int lca(int a, int b){\n while(a != b){\n if(depth[a] < depth[b])swap(a,b);\n if(chainid[a] == chainid[b])return b;\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\n a = chains[chainid[a]].front();\n a = parent[a];\n }\n return a;\n }\n};\n\nint main(){\n int n,q;\n scanf(\"%d%d\",&n,&q);\n HeavyLightDecomposition hld(n);\n REP(i,n-1){\n int a,b;\n scanf(\"%d%d\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.construct();\n\n vector<TousaSegmentTree> segs;\n REP(i,hld.chains.size()){\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\n }\n\n while(q--){\n int typ,s,t;\n scanf(\"%d%d%d\",&typ,&s,&t);\n int lca = hld.lca(s,t);\n if(typ == 0){\n // printf(\"%d: %d %d\\n\",typ,s,t);\n // sum\n ll ans = 0;\n while(true){\n int id = hld.chainid[s];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n while(true){\n int id = hld.chainid[t];\n if(id == hld.chainid[lca]){\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\n break;\n }\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n printf(\"%lld\\n\",ans);\n }else{\n // add\n ll a,b;\n scanf(\"%lld%lld\",&a,&b);\n // printf(\"%d: %d %d %lld %lld\\n\",typ,s,t,a,b);\n while(true){\n int id = hld.chainid[s];\n int r = hld.chainpos[s]+1;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca];\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n (a += (r-l)*b) %= MOD;\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n s = hld.chains[id].front();\n s = hld.parent[s];\n }\n int rest = hld.depth[t] - hld.depth[lca];\n (a += (rest-1)*b) %= MOD;\n b = MOD-b;\n while(true){\n int id = hld.chainid[t];\n int r = hld.chainpos[t]+1;\n if(t == lca)break;\n if(id == hld.chainid[lca]){\n int l = hld.chainpos[lca] + 1;\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\n break;\n }\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\n (a += r*b) %= MOD;\n t = hld.chains[id].front();\n t = hld.parent[t];\n }\n }\n }\n return 0;\n}","accuracy":0.3404255319148936,"time_ms":240,"memory_kb":36244,"score_of_the_acc":-0.1696,"final_rank":15},{"submission_id":"aoj_3050_3145827","code_snippet":"#include <limits>\n#include <stack>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <functional>\n#include <iostream>\n#include <queue>\n#include <iterator>\n#include <cstdint>\n#include <utility>\n#include <type_traits>\n#include <cstddef>\nnamespace loquat {\ntemplate <int MOD>\nclass modulus_integer {\npublic:\n\ttypedef modulus_integer<MOD> self_type;\nprivate:\n\tint m_value;\n\tstatic self_type unsafe_construct(int x) noexcept {\n\t\tself_type y;\n\t\ty.m_value = x;\n\t\treturn y;\n\t}\npublic:\n\tmodulus_integer() noexcept\n\t\t: m_value(0)\n\t{ }\n\tmodulus_integer(int x) noexcept\n\t\t: m_value(x % MOD)\n\t{\n\t\tif(m_value < 0){ m_value += MOD; }\n\t}\n\tint operator*() const noexcept { return m_value; }\n\tself_type& operator=(const self_type& x) noexcept {\n\t\tm_value = x.m_value;\n\t\treturn *this;\n\t}\n\tself_type operator-() const noexcept {\n\t\treturn unsafe_construct(m_value > 0 ? MOD - m_value : 0);\n\t}\n\tself_type operator+(const self_type& x) const noexcept {\n\t\tconst int y = m_value + x.m_value;\n\t\treturn unsafe_construct(y >= MOD ? y - MOD : y);\n\t}\n\tself_type operator*(const self_type& x) const noexcept {\n\t\treturn unsafe_construct(\n\t\t\tstatic_cast<long long>(m_value) * x.m_value % MOD);\n\t}\n};\ntemplate <int MOD>\ninline std::ostream& operator<<(\n\tstd::ostream& os, const modulus_integer<MOD>& x)\n{\n\tos << *x;\n\treturn os;\n}\n}\nnamespace loquat {\nnamespace bitmanip {\ntemplate <typename T>\ninline auto clz(T x) noexcept ->\n\ttypename std::enable_if<sizeof(int) < sizeof(T), unsigned int>::type\n{\n\treturn __builtin_clzll(x);\n}\ntemplate <typename T>\ninline T clp2(T x) noexcept {\n\tif(x == 0u){ return 0u; }\n\treturn T(1u) << (sizeof(T) * 8u - clz(x - 1));\n}\n}\n}\nnamespace loquat {\ntemplate <typename Impl>\nclass lazy_range_query_behavior_wrapper {\npublic:\n\tusing value_type = typename Impl::value_type;\n\tusing modifier_type = typename Impl::modifier_type;\nprivate:\n\ttemplate <typename T>\n\tstruct no_reverse_value {\n\tprivate:\n\t\tstatic std::true_type check_unary(...);\n\t\tstatic std::true_type check_binary(...);\n\tpublic:\n\t\tstatic const bool value =\n\t\t\tdecltype(check_unary(std::declval<T>()))::value &&\n\t\t\tdecltype(check_binary(std::declval<T>()))::value;\n\t};\n\tImpl m_impl;\n\ttemplate <typename T>\n\tstatic auto split_modifier_helper(\n\t\tconst T& impl, const modifier_type& m, size_t k)\n\t\t-> decltype(impl.split_modifier(m, k))\n\t{\n\t\treturn impl.split_modifier(m, k);\n\t}\n\ttemplate <typename T>\n\tstatic auto modify_helper(\n\t\tconst T& impl, size_t n, const value_type& v, const modifier_type& m)\n\t\t-> decltype(impl.modify(n, v, m))\n\t{\n\t\treturn impl.modify(n, v, m);\n\t}\n\ttemplate <typename T>\n\tstatic auto reverse_value_helper(const T&, size_t, const value_type& x)\n\t\t-> typename std::enable_if<no_reverse_value<T>::value, value_type>::type\n\t{\n\t\treturn x;\n\t}\n\ttemplate <typename T>\n\tstatic auto reverse_modifier_helper(const T& impl, size_t n, const modifier_type& m)\n\t\t-> decltype(impl.reverse_modifier(n, m))\n\t{\n\t\treturn impl.reverse_modifier(n, m);\n\t}\npublic:\n\tlazy_range_query_behavior_wrapper(Impl impl) : m_impl(std::move(impl)) { }\n\tvalue_type identity_value() const {\n\t\treturn m_impl.identity_value();\n\t}\n\tmodifier_type identity_modifier() const {\n\t\treturn m_impl.identity_modifier();\n\t}\n\tstd::pair<modifier_type, modifier_type>\n\tsplit_modifier(const modifier_type& m, size_t k) const {\n\t\treturn split_modifier_helper(m_impl, m, k);\n\t}\n\tmodifier_type merge_modifier(\n\t\tconst modifier_type& a, const modifier_type& b) const\n\t{\n\t\treturn m_impl.merge_modifier(a, b);\n\t}\n\tvalue_type merge_value(\n\t\tconst value_type& a, const value_type& b) const\n\t{\n\t\treturn m_impl.merge_value(a, b);\n\t}\n\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\n\t\treturn modify_helper(m_impl, n, v, m);\n\t}\n\tvalue_type reverse_value(size_t n, const value_type& m) const {\n\t\treturn reverse_value_helper(m_impl, n, m);\n\t}\n\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\n\t\treturn reverse_modifier_helper(m_impl, n, m);\n\t}\n};\n}\nnamespace loquat {\ntemplate <typename Behavior>\nclass lazy_segment_tree {\npublic:\n\tusing behavior_type = Behavior;\n\tusing value_type = typename behavior_type::value_type;\n\tusing modifier_type = typename behavior_type::modifier_type;\nprivate:\n\tsize_t m_actual_size;\n\tstd::vector<value_type> m_values;\n\tstd::vector<modifier_type> m_modifiers;\n\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\n\tvoid initialize(){\n\t\tconst int n = m_values.size() / 2;\n\t\tfor(int i = n - 1; i >= 0; --i){\n\t\t\tm_values[i] = m_behavior.merge_value(\n\t\t\t\tm_values[i * 2 + 1], m_values[i * 2 + 2]);\n\t\t}\n\t}\n\tvalue_type modify(\n\t\tsize_t a, size_t b, size_t k, size_t l, size_t r,\n\t\tconst modifier_type& modifier)\n\t{\n\t\tif(r <= a || b <= l){\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}else if(a <= l && r <= b){\n\t\t\tm_modifiers[k] =\n\t\t\t\tm_behavior.merge_modifier(m_modifiers[k], modifier);\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}\n\t\tconst size_t c = l + (r - l) / 2;\n\t\tconst size_t lk = k * 2 + 1, rk = lk + 1;\n\t\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\n\t\tm_modifiers[k] = m_behavior.identity_modifier();\n\t\tmodify(l, c, lk, l, c, mp.first);\n\t\tmodify(c, r, rk, c, r, mp.second);\n\t\tconst auto mq = (a < c)\n\t\t\t? m_behavior.split_modifier(modifier, c - std::max(a, l))\n\t\t\t: std::make_pair(m_behavior.identity_modifier(), modifier);\n\t\tconst auto vl = modify(a, b, lk, l, c, mq.first);\n\t\tconst auto vr = modify(a, b, rk, c, r, mq.second);\n\t\tm_values[k] = m_behavior.merge_value(vl, vr);\n\t\treturn m_values[k];\n\t}\n\tvalue_type query(size_t a, size_t b, size_t k, size_t l, size_t r){\n\t\tif(r <= a || b <= l){\n\t\t\treturn m_behavior.identity_value();\n\t\t}else if(a <= l && r <= b){\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}\n\t\tconst size_t c = l + (r - l) / 2;\n\t\tconst size_t lk = k * 2 + 1, rk = k * 2 + 2;\n\t\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\n\t\tm_values[k] = m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\tm_modifiers[k] = m_behavior.identity_modifier();\n\t\tmodify(l, c, lk, l, c, mp.first);\n\t\tmodify(c, r, rk, c, r, mp.second);\n\t\tconst auto vl = query(a, b, lk, l, c);\n\t\tconst auto vr = query(a, b, rk, c, r);\n\t\treturn m_behavior.merge_value(vl, vr);\n\t}\npublic:\n\tlazy_segment_tree(\n\t\tsize_t size,\n\t\tconst behavior_type& behavior = behavior_type())\n\t\t: m_actual_size(size)\n\t\t, m_values(bitmanip::clp2(size) * 2 - 1, behavior.identity_value())\n\t\t, m_modifiers(m_values.size(), behavior.identity_modifier())\n\t\t, m_behavior(behavior)\n\t{\n\t\tinitialize();\n\t}\n\tvoid modify(size_t left, size_t right, const modifier_type& modifier){\n\t\tconst auto clp2_n = (m_values.size() + 1) / 2;\n\t\tmodify(left, right, 0, 0, clp2_n, modifier);\n\t}\n\tvalue_type query(size_t left, size_t right){\n\t\tconst auto clp2_n = (m_values.size() + 1) / 2;\n\t\treturn query(left, right, 0, 0, clp2_n);\n\t}\n};\n}\nnamespace loquat {\nusing vertex_t = size_t;\n}\nnamespace loquat {\nnamespace edge_param {\nstruct to_ {\n\tvertex_t to;\n\texplicit to_(vertex_t t = 0)\n\t\t: to(t)\n\t{ }\n};\n}\nnamespace detail {\ntemplate <typename T, typename... Params>\nstruct edge_param_wrapper : public T, edge_param_wrapper<Params...> {\n};\ntemplate <typename T>\nstruct edge_param_wrapper<T> : public T {\n\ttemplate <typename U>\n\texplicit edge_param_wrapper(U&& x)\n\t\t: T(std::forward<U>(x))\n\t{ }\n};\n}\ntemplate <typename... Params>\nstruct edge : public detail::edge_param_wrapper<edge_param::to_, Params...> {\n\ttemplate <typename... Args>\n\texplicit edge(Args&&... args)\n\t\t: detail::edge_param_wrapper<edge_param::to_, Params...>(\n\t\t\tstd::forward<Args>(args)...)\n\t{ }\n};\n}\nnamespace loquat {\ntemplate <typename EdgeType>\nclass adjacency_list {\npublic:\n\tusing edge_type = EdgeType;\n\tusing edge_list = std::vector<edge_type>;\nprivate:\n\tstd::vector<std::vector<EdgeType>> m_edges;\npublic:\n\texplicit adjacency_list(size_t n)\n\t\t: m_edges(n)\n\t{ }\n\tsize_t size() const {\n\t\treturn m_edges.size();\n\t}\n\tconst edge_list& operator[](vertex_t u) const {\n\t\treturn m_edges[u];\n\t}\n\ttemplate <typename... Args>\n\tvoid add_edge(vertex_t from, Args&&... args){\n\t\tm_edges[from].emplace_back(std::forward<Args>(args)...);\n\t}\n};\n}\nnamespace loquat {\ntemplate <typename EdgeType, typename F>\nvoid breadth_first_search(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root,\n\tstd::vector<bool>& vis,\n\tF func)\n{\n\tstd::queue<vertex_t> q;\n\tq.push(root);\n\tvis[root] = true;\n\twhile(!q.empty()){\n\t\tconst auto u = q.front();\n\t\tq.pop();\n\t\tfor(const auto& e : g[u]){\n\t\t\tconst auto v = e.to;\n\t\t\tif(vis[v]){ continue; }\n\t\t\tfunc(u, e);\n\t\t\tvis[v] = true;\n\t\t\tq.push(v);\n\t\t}\n\t}\n}\ntemplate <typename EdgeType, typename F>\nvoid breadth_first_search(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root,\n\tF func)\n{\n\tstd::vector<bool> vis(g.size());\n\tbreadth_first_search(g, root, vis, func);\n}\n}\nnamespace loquat {\ntemplate <typename EdgeType>\nstd::vector<size_t> compute_subtree_sizes(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root)\n{\n\tconst size_t n = g.size();\n\tstd::vector<vertex_t> order;\n\torder.reserve(n);\n\torder.push_back(root);\n\tbreadth_first_search(g, root, [&order](vertex_t, const EdgeType& e){\n\t\torder.push_back(e.to);\n\t});\n\tstd::vector<size_t> result(n);\n\tstd::reverse(order.begin(), order.end());\n\tfor(const auto u : order){\n\t\tsize_t sum = 1;\n\t\tfor(const auto& e : g[u]){\n\t\t\tsum += result[e.to];\n\t\t}\n\t\tresult[u] = sum;\n\t}\n\treturn result;\n}\n}\nnamespace loquat {\nclass heavy_light_decomposition {\npublic:\n\tusing index_type = size_t;\n\tstruct segment {\n\t\tindex_type path_id;\n\t\tindex_type first;\n\t\tindex_type last;\n\t\tsegment(index_type p, index_type f, index_type l)\n\t\t\t: path_id(p), first(f), last(l)\n\t\t{ }\n\t};\nprivate:\n\tstruct path {\n\t\tvertex_t parent;\n\t\tsize_t rank;\n\t\tstd::vector<vertex_t> vertices;\n\t};\n\tstd::vector<path> m_paths;\n\tstd::vector<index_type> m_vertex2path;\n\tstd::vector<index_type> m_vertex2index;\npublic:\n\ttemplate <typename EdgeType>\n\texplicit heavy_light_decomposition(\n\t\tconst adjacency_list<EdgeType>& graph,\n\t\tvertex_t root = 0)\n\t\t: m_paths()\n\t\t, m_vertex2path(graph.size())\n\t\t, m_vertex2index(graph.size())\n\t{\n\t\tstruct frame_type {\n\t\t\tvertex_t u;\n\t\t\tvertex_t p;\n\t\t\tframe_type() : u(0), p(0) { }\n\t\t\tframe_type(vertex_t u, vertex_t p) : u(u), p(p) { }\n\t\t};\n\t\tconst vertex_t nil = std::numeric_limits<vertex_t>::max();\n\t\tconst auto subtree_sizes = compute_subtree_sizes(graph, root);\n\t\tstd::stack<frame_type> frame_stack;\n\t\tframe_stack.emplace(root, nil);\n\t\twhile(!frame_stack.empty()){\n\t\t\tconst auto f = frame_stack.top();\n\t\t\tframe_stack.pop();\n\t\t\tconst index_type path_id = m_paths.size();\n\t\t\tpath p;\n\t\t\tp.parent = f.p;\n\t\t\tp.rank = (f.p != nil ? m_paths[m_vertex2path[f.p]].rank + 1 : 0);\n\t\t\tvertex_t cur = f.u;\n\t\t\twhile(cur != nil){\n\t\t\t\tconst auto ss = subtree_sizes[cur];\n\t\t\t\tconst auto threshold = ss / 2;\n\t\t\t\tm_vertex2path[cur] = path_id;\n\t\t\t\tm_vertex2index[cur] = p.vertices.size();\n\t\t\t\tp.vertices.push_back(cur);\n\t\t\t\tvertex_t heavy_edge = nil;\n\t\t\t\tfor(const auto& e : graph[cur]){\n\t\t\t\t\tconst auto v = e.to;\n\t\t\t\t\tif(subtree_sizes[v] > subtree_sizes[cur]){ continue; }\n\t\t\t\t\tif(heavy_edge == nil && subtree_sizes[v] >= threshold){\n\t\t\t\t\t\theavy_edge = v;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tframe_stack.emplace(v, cur);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcur = heavy_edge;\n\t\t\t}\n\t\t\tm_paths.push_back(p);\n\t\t}\n\t}\n\tsize_t count_heavy_paths() const {\n\t\treturn m_paths.size();\n\t}\n\tsize_t path_length(index_type p) const {\n\t\treturn m_paths[p].vertices.size();\n\t}\n\tindex_type path_id(vertex_t v) const {\n\t\treturn m_vertex2path[v];\n\t}\n\tindex_type local_index(vertex_t v) const {\n\t\treturn m_vertex2index[v];\n\t}\n\tstd::vector<segment> shortest_path(vertex_t s, vertex_t t) const {\n\t\tstd::vector<segment> s_segments, t_segments;\n\t\tindex_type s_path = path_id(s), s_index = local_index(s);\n\t\tindex_type t_path = path_id(t), t_index = local_index(t);\n\t\twhile(s_path != t_path){\n\t\t\tconst size_t s_rank = m_paths[s_path].rank;\n\t\t\tconst size_t t_rank = m_paths[t_path].rank;\n\t\t\tif(s_rank >= t_rank){\n\t\t\t\tconst auto parent = m_paths[s_path].parent;\n\t\t\t\ts_segments.push_back(segment(s_path, s_index, 0));\n\t\t\t\ts_path = path_id(parent);\n\t\t\t\ts_index = local_index(parent);\n\t\t\t}\n\t\t\tif(t_rank >= s_rank){\n\t\t\t\tconst auto parent = m_paths[t_path].parent;\n\t\t\t\tt_segments.push_back(segment(t_path, 0, t_index));\n\t\t\t\tt_path = path_id(parent);\n\t\t\t\tt_index = local_index(parent);\n\t\t\t}\n\t\t}\n\t\tstd::vector<segment> result(s_segments);\n\t\tresult.emplace_back(s_path, s_index, t_index);\n\t\tstd::reverse(t_segments.begin(), t_segments.end());\n\t\tfor(const auto& s : t_segments){ result.push_back(s); }\n\t\treturn result;\n\t}\n};\ntemplate <typename RangeQueryable>\nclass lazy_vertex_path_queryable_tree {\npublic:\n\tusing range_queryable_type = RangeQueryable;\n\tusing behavior_type = typename range_queryable_type::behavior_type;\n\tusing value_type = typename behavior_type::value_type;\n\tusing modifier_type = typename behavior_type::modifier_type;\nprivate:\n\theavy_light_decomposition m_decomposition;\n\tstd::vector<range_queryable_type> m_range_queryables;\n\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\npublic:\n\ttemplate <typename EdgeType>\n\texplicit lazy_vertex_path_queryable_tree(\n\t\tconst adjacency_list<EdgeType>& graph,\n\t\tvertex_t root = 0,\n\t\tconst behavior_type& behavior = behavior_type())\n\t\t: m_decomposition(graph, root)\n\t\t, m_range_queryables()\n\t\t, m_behavior(behavior)\n\t{\n\t\tconst size_t n_paths = m_decomposition.count_heavy_paths();\n\t\tm_range_queryables.reserve(n_paths);\n\t\tfor(size_t i = 0; i < n_paths; ++i){\n\t\t\tm_range_queryables.emplace_back(\n\t\t\t\tm_decomposition.path_length(i), behavior);\n\t\t}\n\t}\n\tvoid modify(vertex_t s, vertex_t t, const modifier_type& m){\n\t\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\n\t\tmodifier_type modifier = m;\n\t\tfor(const auto& s : shortest_path){\n\t\t\tconst auto path_id = s.path_id;\n\t\t\tconst auto lo = std::min(s.first, s.last);\n\t\t\tconst auto hi = std::max(s.first, s.last) + 1;\n\t\t\tconst auto modifier_pair =\n\t\t\t\tm_behavior.split_modifier(modifier, hi - lo);\n\t\t\tconst auto head_modifier = s.first > s.last\n\t\t\t\t? m_behavior.reverse_modifier(hi - lo, modifier_pair.first)\n\t\t\t\t: modifier_pair.first;\n\t\t\tm_range_queryables[path_id].modify(lo, hi, head_modifier);\n\t\t\tmodifier = modifier_pair.second;\n\t\t}\n\t}\n\tvalue_type query(vertex_t s, vertex_t t){\n\t\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\n\t\tvalue_type acc = m_behavior.identity_value();\n\t\tfor(const auto& s : shortest_path){\n\t\t\tconst auto path_id = s.path_id;\n\t\t\tconst auto lo = std::min(s.first, s.last);\n\t\t\tconst auto hi = std::max(s.first, s.last) + 1;\n\t\t\tconst auto partial = m_range_queryables[path_id].query(lo, hi);\n\t\t\tconst auto directed_partial = s.first > s.last\n\t\t\t\t? m_behavior.reverse_value(hi - lo, partial)\n\t\t\t\t: partial;\n\t\t\tacc = m_behavior.merge_value(acc, directed_partial);\n\t\t}\n\t\treturn acc;\n\t}\n};\n}\nusing namespace std;\nstatic const int MOD = 1000000007;\nusing mint = loquat::modulus_integer<MOD>;\nusing edge = loquat::edge<>;\nstruct lazy_range_query_behavior {\n\tusing value_type = mint;\n\tusing modifier_type = pair<mint, mint>;\n\tvalue_type identity_value() const { return 0; }\n\tmodifier_type identity_modifier() const { return make_pair(0, 0); }\n\tstd::pair<modifier_type, modifier_type>\n\tsplit_modifier(const modifier_type& m, size_t k) const {\n\t\treturn make_pair(\n\t\t\tmodifier_type(m.first, m.second),\n\t\t\tmodifier_type(m.first + m.second * k, m.second));\n\t}\n\tmodifier_type merge_modifier(const modifier_type& a, const modifier_type& b) const {\n\t\treturn modifier_type(a.first + b.first, a.second + b.second);\n\t}\n\tvalue_type merge_value(const value_type& a, const value_type& b) const {\n\t\treturn a + b;\n\t}\n\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\n\t\treturn v + m.first * n + m.second * (n * (n - 1) / 2);\n\t}\n\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\n\t\treturn modifier_type(m.first + m.second * (n - 1), -m.second);\n\t}\n};\nusing lazy_segment_tree = loquat::lazy_segment_tree<lazy_range_query_behavior>;\nint main(){\n\tios_base::sync_with_stdio(false);\n\tint n, q;\n\tcin >> n >> q;\n\tloquat::adjacency_list<edge> g(n);\n\tfor(int i = 1; i < n; ++i){\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tg.add_edge(a, b);\n\t\tg.add_edge(b, a);\n\t}\n\tloquat::lazy_vertex_path_queryable_tree<lazy_segment_tree> lqt(g);\n\twhile(q--){\n\t\tint type;\n\t\tcin >> type;\n\t\tif(type == 0){\n\t\t\tint s, t;\n\t\t\tcin >> s >> t;\n\t\t\tcout << lqt.query(s, t) << endl;\n\t\t}else{\n\t\t\tint s, t, k, m;\n\t\t\tcin >> s >> t >> k >> m;\n\t\t\tlqt.modify(s, t, make_pair(k, m));\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":350,"memory_kb":29344,"score_of_the_acc":-0.1378,"final_rank":1},{"submission_id":"aoj_3050_3145821","code_snippet":"#include <limits>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <queue>\n#include <iterator>\n#include <cstdint>\n#include <algorithm>\n#include <stack>\n#include <type_traits>\n#include <cstddef>\n#include <utility>\nnamespace loquat {\nnamespace bitmanip {\ntemplate <typename T>\ninline auto clz(T x) noexcept ->\n\ttypename std::enable_if<sizeof(int) < sizeof(T), unsigned int>::type\n{\n\treturn __builtin_clzll(x);\n}\ntemplate <typename T>\ninline T clp2(T x) noexcept {\n\tif(x == 0u){ return 0u; }\n\treturn T(1u) << (sizeof(T) * 8u - clz(x - 1));\n}\n}\n}\nnamespace loquat {\ntemplate <typename Impl>\nclass lazy_range_query_behavior_wrapper {\npublic:\n\tusing value_type = typename Impl::value_type;\n\tusing modifier_type = typename Impl::modifier_type;\nprivate:\n\ttemplate <typename T>\n\tstruct no_reverse_value {\n\tprivate:\n\t\tstatic std::true_type check_unary(...);\n\t\tstatic std::true_type check_binary(...);\n\tpublic:\n\t\tstatic const bool value =\n\t\t\tdecltype(check_unary(std::declval<T>()))::value &&\n\t\t\tdecltype(check_binary(std::declval<T>()))::value;\n\t};\n\tImpl m_impl;\n\ttemplate <typename T>\n\tstatic auto split_modifier_helper(\n\t\tconst T& impl, const modifier_type& m, size_t k)\n\t\t-> decltype(impl.split_modifier(m, k))\n\t{\n\t\treturn impl.split_modifier(m, k);\n\t}\n\ttemplate <typename T>\n\tstatic auto modify_helper(\n\t\tconst T& impl, size_t n, const value_type& v, const modifier_type& m)\n\t\t-> decltype(impl.modify(n, v, m))\n\t{\n\t\treturn impl.modify(n, v, m);\n\t}\n\ttemplate <typename T>\n\tstatic auto reverse_value_helper(const T&, size_t, const value_type& x)\n\t\t-> typename std::enable_if<no_reverse_value<T>::value, value_type>::type\n\t{\n\t\treturn x;\n\t}\n\ttemplate <typename T>\n\tstatic auto reverse_modifier_helper(const T& impl, size_t n, const modifier_type& m)\n\t\t-> decltype(impl.reverse_modifier(n, m))\n\t{\n\t\treturn impl.reverse_modifier(n, m);\n\t}\npublic:\n\tlazy_range_query_behavior_wrapper(Impl impl) : m_impl(std::move(impl)) { }\n\tvalue_type identity_value() const {\n\t\treturn m_impl.identity_value();\n\t}\n\tmodifier_type identity_modifier() const {\n\t\treturn m_impl.identity_modifier();\n\t}\n\tstd::pair<modifier_type, modifier_type>\n\tsplit_modifier(const modifier_type& m, size_t k) const {\n\t\treturn split_modifier_helper(m_impl, m, k);\n\t}\n\tmodifier_type merge_modifier(\n\t\tconst modifier_type& a, const modifier_type& b) const\n\t{\n\t\treturn m_impl.merge_modifier(a, b);\n\t}\n\tvalue_type merge_value(\n\t\tconst value_type& a, const value_type& b) const\n\t{\n\t\treturn m_impl.merge_value(a, b);\n\t}\n\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\n\t\treturn modify_helper(m_impl, n, v, m);\n\t}\n\tvalue_type reverse_value(size_t n, const value_type& m) const {\n\t\treturn reverse_value_helper(m_impl, n, m);\n\t}\n\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\n\t\treturn reverse_modifier_helper(m_impl, n, m);\n\t}\n};\n}\nnamespace loquat {\ntemplate <typename Behavior>\nclass lazy_segment_tree {\npublic:\n\tusing behavior_type = Behavior;\n\tusing value_type = typename behavior_type::value_type;\n\tusing modifier_type = typename behavior_type::modifier_type;\nprivate:\n\tsize_t m_actual_size;\n\tstd::vector<value_type> m_values;\n\tstd::vector<modifier_type> m_modifiers;\n\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\n\tvoid initialize(){\n\t\tconst int n = m_values.size() / 2;\n\t\tfor(int i = n - 1; i >= 0; --i){\n\t\t\tm_values[i] = m_behavior.merge_value(\n\t\t\t\tm_values[i * 2 + 1], m_values[i * 2 + 2]);\n\t\t}\n\t}\n\tvalue_type modify(\n\t\tsize_t a, size_t b, size_t k, size_t l, size_t r,\n\t\tconst modifier_type& modifier)\n\t{\n\t\tif(r <= a || b <= l){\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}else if(a <= l && r <= b){\n\t\t\tm_modifiers[k] =\n\t\t\t\tm_behavior.merge_modifier(m_modifiers[k], modifier);\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}\n\t\tconst size_t c = l + (r - l) / 2;\n\t\tconst size_t lk = k * 2 + 1, rk = lk + 1;\n\t\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\n\t\tm_modifiers[k] = m_behavior.identity_modifier();\n\t\tmodify(l, c, lk, l, c, mp.first);\n\t\tmodify(c, r, rk, c, r, mp.second);\n\t\tconst auto mq = (a < c)\n\t\t\t? m_behavior.split_modifier(modifier, c - std::max(a, l))\n\t\t\t: std::make_pair(m_behavior.identity_modifier(), modifier);\n\t\tconst auto vl = modify(a, b, lk, l, c, mq.first);\n\t\tconst auto vr = modify(a, b, rk, c, r, mq.second);\n\t\tm_values[k] = m_behavior.merge_value(vl, vr);\n\t\treturn m_values[k];\n\t}\n\tvalue_type query(size_t a, size_t b, size_t k, size_t l, size_t r){\n\t\tif(r <= a || b <= l){\n\t\t\treturn m_behavior.identity_value();\n\t\t}else if(a <= l && r <= b){\n\t\t\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\t}\n\t\tconst size_t c = l + (r - l) / 2;\n\t\tconst size_t lk = k * 2 + 1, rk = k * 2 + 2;\n\t\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\n\t\tm_values[k] = m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\n\t\tm_modifiers[k] = m_behavior.identity_modifier();\n\t\tmodify(l, c, lk, l, c, mp.first);\n\t\tmodify(c, r, rk, c, r, mp.second);\n\t\tconst auto vl = query(a, b, lk, l, c);\n\t\tconst auto vr = query(a, b, rk, c, r);\n\t\treturn m_behavior.merge_value(vl, vr);\n\t}\npublic:\n\tlazy_segment_tree(\n\t\tsize_t size,\n\t\tconst behavior_type& behavior = behavior_type())\n\t\t: m_actual_size(size)\n\t\t, m_values(bitmanip::clp2(size) * 2 - 1, behavior.identity_value())\n\t\t, m_modifiers(m_values.size(), behavior.identity_modifier())\n\t\t, m_behavior(behavior)\n\t{\n\t\tinitialize();\n\t}\n\tvoid modify(size_t left, size_t right, const modifier_type& modifier){\n\t\tconst auto clp2_n = (m_values.size() + 1) / 2;\n\t\tmodify(left, right, 0, 0, clp2_n, modifier);\n\t}\n\tvalue_type query(size_t left, size_t right){\n\t\tconst auto clp2_n = (m_values.size() + 1) / 2;\n\t\treturn query(left, right, 0, 0, clp2_n);\n\t}\n};\n}\nnamespace loquat {\nusing vertex_t = size_t;\n}\nnamespace loquat {\nnamespace edge_param {\nstruct to_ {\n\tvertex_t to;\n\texplicit to_(vertex_t t = 0)\n\t\t: to(t)\n\t{ }\n};\n}\nnamespace detail {\ntemplate <typename T, typename... Params>\nstruct edge_param_wrapper : public T, edge_param_wrapper<Params...> {\n};\ntemplate <typename T>\nstruct edge_param_wrapper<T> : public T {\n\ttemplate <typename U>\n\texplicit edge_param_wrapper(U&& x)\n\t\t: T(std::forward<U>(x))\n\t{ }\n};\n}\ntemplate <typename... Params>\nstruct edge : public detail::edge_param_wrapper<edge_param::to_, Params...> {\n\ttemplate <typename... Args>\n\texplicit edge(Args&&... args)\n\t\t: detail::edge_param_wrapper<edge_param::to_, Params...>(\n\t\t\tstd::forward<Args>(args)...)\n\t{ }\n};\n}\nnamespace loquat {\ntemplate <typename EdgeType>\nclass adjacency_list {\npublic:\n\tusing edge_type = EdgeType;\n\tusing edge_list = std::vector<edge_type>;\nprivate:\n\tstd::vector<std::vector<EdgeType>> m_edges;\npublic:\n\texplicit adjacency_list(size_t n)\n\t\t: m_edges(n)\n\t{ }\n\tsize_t size() const {\n\t\treturn m_edges.size();\n\t}\n\tconst edge_list& operator[](vertex_t u) const {\n\t\treturn m_edges[u];\n\t}\n\ttemplate <typename... Args>\n\tvoid add_edge(vertex_t from, Args&&... args){\n\t\tm_edges[from].emplace_back(std::forward<Args>(args)...);\n\t}\n};\n}\nnamespace loquat {\ntemplate <typename EdgeType, typename F>\nvoid breadth_first_search(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root,\n\tstd::vector<bool>& vis,\n\tF func)\n{\n\tstd::queue<vertex_t> q;\n\tq.push(root);\n\tvis[root] = true;\n\twhile(!q.empty()){\n\t\tconst auto u = q.front();\n\t\tq.pop();\n\t\tfor(const auto& e : g[u]){\n\t\t\tconst auto v = e.to;\n\t\t\tif(vis[v]){ continue; }\n\t\t\tfunc(u, e);\n\t\t\tvis[v] = true;\n\t\t\tq.push(v);\n\t\t}\n\t}\n}\ntemplate <typename EdgeType, typename F>\nvoid breadth_first_search(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root,\n\tF func)\n{\n\tstd::vector<bool> vis(g.size());\n\tbreadth_first_search(g, root, vis, func);\n}\n}\nnamespace loquat {\ntemplate <typename EdgeType>\nstd::vector<size_t> compute_subtree_sizes(\n\tconst adjacency_list<EdgeType>& g,\n\tvertex_t root)\n{\n\tconst size_t n = g.size();\n\tstd::vector<vertex_t> order;\n\torder.reserve(n);\n\torder.push_back(root);\n\tbreadth_first_search(g, root, [&order](vertex_t, const EdgeType& e){\n\t\torder.push_back(e.to);\n\t});\n\tstd::vector<size_t> result(n);\n\tstd::reverse(order.begin(), order.end());\n\tfor(const auto u : order){\n\t\tsize_t sum = 1;\n\t\tfor(const auto& e : g[u]){\n\t\t\tsum += result[e.to];\n\t\t}\n\t\tresult[u] = sum;\n\t}\n\treturn result;\n}\n}\nnamespace loquat {\nclass heavy_light_decomposition {\npublic:\n\tusing index_type = size_t;\n\tstruct segment {\n\t\tindex_type path_id;\n\t\tindex_type first;\n\t\tindex_type last;\n\t\tsegment(index_type p, index_type f, index_type l)\n\t\t\t: path_id(p), first(f), last(l)\n\t\t{ }\n\t};\nprivate:\n\tstruct path {\n\t\tvertex_t parent;\n\t\tsize_t rank;\n\t\tstd::vector<vertex_t> vertices;\n\t};\n\tstd::vector<path> m_paths;\n\tstd::vector<index_type> m_vertex2path;\n\tstd::vector<index_type> m_vertex2index;\npublic:\n\ttemplate <typename EdgeType>\n\texplicit heavy_light_decomposition(\n\t\tconst adjacency_list<EdgeType>& graph,\n\t\tvertex_t root = 0)\n\t\t: m_paths()\n\t\t, m_vertex2path(graph.size())\n\t\t, m_vertex2index(graph.size())\n\t{\n\t\tstruct frame_type {\n\t\t\tvertex_t u;\n\t\t\tvertex_t p;\n\t\t\tframe_type() : u(0), p(0) { }\n\t\t\tframe_type(vertex_t u, vertex_t p) : u(u), p(p) { }\n\t\t};\n\t\tconst vertex_t nil = std::numeric_limits<vertex_t>::max();\n\t\tconst auto subtree_sizes = compute_subtree_sizes(graph, root);\n\t\tstd::stack<frame_type> frame_stack;\n\t\tframe_stack.emplace(root, nil);\n\t\twhile(!frame_stack.empty()){\n\t\t\tconst auto f = frame_stack.top();\n\t\t\tframe_stack.pop();\n\t\t\tconst index_type path_id = m_paths.size();\n\t\t\tpath p;\n\t\t\tp.parent = f.p;\n\t\t\tp.rank = (f.p != nil ? m_paths[m_vertex2path[f.p]].rank + 1 : 0);\n\t\t\tvertex_t cur = f.u;\n\t\t\twhile(cur != nil){\n\t\t\t\tconst auto ss = subtree_sizes[cur];\n\t\t\t\tconst auto threshold = ss / 2;\n\t\t\t\tm_vertex2path[cur] = path_id;\n\t\t\t\tm_vertex2index[cur] = p.vertices.size();\n\t\t\t\tp.vertices.push_back(cur);\n\t\t\t\tvertex_t heavy_edge = nil;\n\t\t\t\tfor(const auto& e : graph[cur]){\n\t\t\t\t\tconst auto v = e.to;\n\t\t\t\t\tif(subtree_sizes[v] > subtree_sizes[cur]){ continue; }\n\t\t\t\t\tif(heavy_edge == nil && subtree_sizes[v] >= threshold){\n\t\t\t\t\t\theavy_edge = v;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tframe_stack.emplace(v, cur);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcur = heavy_edge;\n\t\t\t}\n\t\t\tm_paths.push_back(p);\n\t\t}\n\t}\n\tsize_t count_heavy_paths() const {\n\t\treturn m_paths.size();\n\t}\n\tsize_t path_length(index_type p) const {\n\t\treturn m_paths[p].vertices.size();\n\t}\n\tindex_type path_id(vertex_t v) const {\n\t\treturn m_vertex2path[v];\n\t}\n\tindex_type local_index(vertex_t v) const {\n\t\treturn m_vertex2index[v];\n\t}\n\tstd::vector<segment> shortest_path(vertex_t s, vertex_t t) const {\n\t\tstd::vector<segment> s_segments, t_segments;\n\t\tindex_type s_path = path_id(s), s_index = local_index(s);\n\t\tindex_type t_path = path_id(t), t_index = local_index(t);\n\t\twhile(s_path != t_path){\n\t\t\tconst size_t s_rank = m_paths[s_path].rank;\n\t\t\tconst size_t t_rank = m_paths[t_path].rank;\n\t\t\tif(s_rank >= t_rank){\n\t\t\t\tconst auto parent = m_paths[s_path].parent;\n\t\t\t\ts_segments.push_back(segment(s_path, s_index, 0));\n\t\t\t\ts_path = path_id(parent);\n\t\t\t\ts_index = local_index(parent);\n\t\t\t}\n\t\t\tif(t_rank >= s_rank){\n\t\t\t\tconst auto parent = m_paths[t_path].parent;\n\t\t\t\tt_segments.push_back(segment(t_path, 0, t_index));\n\t\t\t\tt_path = path_id(parent);\n\t\t\t\tt_index = local_index(parent);\n\t\t\t}\n\t\t}\n\t\tstd::vector<segment> result(s_segments);\n\t\tresult.emplace_back(s_path, s_index, t_index);\n\t\tstd::reverse(t_segments.begin(), t_segments.end());\n\t\tfor(const auto& s : t_segments){ result.push_back(s); }\n\t\treturn result;\n\t}\n};\ntemplate <typename RangeQueryable>\nclass lazy_vertex_path_queryable_tree {\npublic:\n\tusing range_queryable_type = RangeQueryable;\n\tusing behavior_type = typename range_queryable_type::behavior_type;\n\tusing value_type = typename behavior_type::value_type;\n\tusing modifier_type = typename behavior_type::modifier_type;\nprivate:\n\theavy_light_decomposition m_decomposition;\n\tstd::vector<range_queryable_type> m_range_queryables;\n\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\npublic:\n\ttemplate <typename EdgeType>\n\texplicit lazy_vertex_path_queryable_tree(\n\t\tconst adjacency_list<EdgeType>& graph,\n\t\tvertex_t root = 0,\n\t\tconst behavior_type& behavior = behavior_type())\n\t\t: m_decomposition(graph, root)\n\t\t, m_range_queryables()\n\t\t, m_behavior(behavior)\n\t{\n\t\tconst size_t n_paths = m_decomposition.count_heavy_paths();\n\t\tm_range_queryables.reserve(n_paths);\n\t\tfor(size_t i = 0; i < n_paths; ++i){\n\t\t\tm_range_queryables.emplace_back(\n\t\t\t\tm_decomposition.path_length(i), behavior);\n\t\t}\n\t}\n\tvoid modify(vertex_t s, vertex_t t, const modifier_type& m){\n\t\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\n\t\tmodifier_type modifier = m;\n\t\tfor(const auto& s : shortest_path){\n\t\t\tconst auto path_id = s.path_id;\n\t\t\tconst auto lo = std::min(s.first, s.last);\n\t\t\tconst auto hi = std::max(s.first, s.last) + 1;\n\t\t\tconst auto modifier_pair =\n\t\t\t\tm_behavior.split_modifier(modifier, hi - lo);\n\t\t\tconst auto head_modifier = s.first > s.last\n\t\t\t\t? m_behavior.reverse_modifier(hi - lo, modifier_pair.first)\n\t\t\t\t: modifier_pair.first;\n\t\t\tm_range_queryables[path_id].modify(lo, hi, head_modifier);\n\t\t\tmodifier = modifier_pair.second;\n\t\t}\n\t}\n\tvalue_type query(vertex_t s, vertex_t t){\n\t\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\n\t\tvalue_type acc = m_behavior.identity_value();\n\t\tfor(const auto& s : shortest_path){\n\t\t\tconst auto path_id = s.path_id;\n\t\t\tconst auto lo = std::min(s.first, s.last);\n\t\t\tconst auto hi = std::max(s.first, s.last) + 1;\n\t\t\tconst auto partial = m_range_queryables[path_id].query(lo, hi);\n\t\t\tconst auto directed_partial = s.first > s.last\n\t\t\t\t? m_behavior.reverse_value(hi - lo, partial)\n\t\t\t\t: partial;\n\t\t\tacc = m_behavior.merge_value(acc, directed_partial);\n\t\t}\n\t\treturn acc;\n\t}\n};\n}\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\nusing edge = loquat::edge<>;\nstruct lazy_range_query_behavior {\n\tusing value_type = ll;\n\tusing modifier_type = pll;\n\tvalue_type identity_value() const { return 0; }\n\tmodifier_type identity_modifier() const { return pll(0, 0); }\n\tstd::pair<modifier_type, modifier_type>\n\tsplit_modifier(const modifier_type& m, size_t k) const {\n\t\treturn make_pair(\n\t\t\tmodifier_type(m.first, m.second),\n\t\t\tmodifier_type(m.first + m.second * k, m.second));\n\t}\n\tmodifier_type merge_modifier(const modifier_type& a, const modifier_type& b) const {\n\t\treturn modifier_type(a.first + b.first, a.second + b.second);\n\t}\n\tvalue_type merge_value(const value_type& a, const value_type& b) const {\n\t\treturn a + b;\n\t}\n\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\n\t\treturn v + m.first * n + m.second * (n * (n - 1) / 2);\n\t}\n\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\n\t\treturn modifier_type(m.first + m.second * (n - 1), -m.second);\n\t}\n};\nusing lazy_segment_tree = loquat::lazy_segment_tree<lazy_range_query_behavior>;\nint main(){\n\tios_base::sync_with_stdio(false);\n\tint n, q;\n\tcin >> n >> q;\n\tloquat::adjacency_list<edge> g(n);\n\tfor(int i = 1; i < n; ++i){\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tg.add_edge(a, b);\n\t\tg.add_edge(b, a);\n\t}\n\tloquat::lazy_vertex_path_queryable_tree<lazy_segment_tree> lqt(g);\n\twhile(q--){\n\t\tint type;\n\t\tcin >> type;\n\t\tif(type == 0){\n\t\t\tint s, t;\n\t\t\tcin >> s >> t;\n\t\t\tcout << lqt.query(s, t) << endl;\n\t\t}else{\n\t\t\tint s, t, k, m;\n\t\t\tcin >> s >> t >> k >> m;\n\t\t\tlqt.modify(s, t, pll(k, m));\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.14893617021276595,"time_ms":160,"memory_kb":23320,"score_of_the_acc":-0.0137,"final_rank":16},{"submission_id":"aoj_3050_3145579","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n// thanks KAZUMA!!\n\nconst int mod = 1e9 + 7;\n\ntemplate<int MOD>\nstruct mod_int {\n\tstatic const int Mod = MOD;\n\tunsigned x;\n\tmod_int() : x(0) { }\n\tmod_int(int sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\n\tmod_int(long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\n\tint get() const { return (int)x; }\n\n\tmod_int &operator+=(mod_int that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\n\tmod_int &operator-=(mod_int that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\n\tmod_int &operator*=(mod_int that) { x = (unsigned long long)x * that.x % MOD; return *this; }\n\tmod_int &operator/=(mod_int that) { return *this *= that.inverse(); }\n\n\tmod_int operator+(mod_int that) const { return mod_int(*this) += that; }\n\tmod_int operator-(mod_int that) const { return mod_int(*this) -= that; }\n\tmod_int operator*(mod_int that) const { return mod_int(*this) *= that; }\n\tmod_int operator/(mod_int that) const { return mod_int(*this) /= that; }\n\n\tmod_int inverse() const {\n\t\tlong long a = x, b = MOD, u = 1, v = 0;\n\t\twhile (b) {\n\t\t\tlong long t = a / b;\n\t\t\ta -= t * b; swap(a, b);\n\t\t\tu -= t * v; swap(u, v);\n\t\t}\n\t\treturn mod_int(u);\n\t}\n};\n\nusing mint = mod_int<mod>;\n\nstruct RS {\n\tusing type = mint;\n\tstatic type id() { return 0; }\n\tstatic type op(const type& l, const type & r) {\n\t\treturn l + r;\n\t}\n};\n\nclass lct_node {\n\tusing M = RS;\n\tusing T = typename M::type;\n\tusing U = pair<mint, mint>;\n\n\tlct_node *l, *r, *p;\n\tbool rev;\n\tT val, all;\n\tint size;\n\tbool flag;\n\tU lazy;\n\n\tint pos() {\n\t\tif (p && p->l == this) return 1;\n\t\tif (p && p->r == this) return 3;\n\t\treturn 0;\n\t}\n\tvoid update() {\n\t\tsize = (l ? l->size : 0) + (r ? r->size : 0) + 1;\n\t\tall = M::op(l ? l->all : M::id(), M::op(val, r ? r->all : M::id()));\n\t}\n\tvoid update_lazy(const U& v) {\n\t\tif (!flag) lazy = make_pair(0, 0);\n\t\tint ls = !rev ? (l ? l->size : 0) : (r ? r->size : 0);\n\t\tval += v.first + v.second * ls;\n\t\tall += v.first * size + ((v.second * (size - 1)) * size) / 2;\n\t\tlazy = make_pair(M::op(lazy.first, v.first), M::op(lazy.second, v.second));\n\t\tflag = true;\n\t}\n\tvoid rev_data() {\n\t\tlazy = make_pair(lazy.first + lazy.second * (size - 1), mint(0) - lazy.second);\n\t}\n\tvoid push() {\n\t\tif (pos()) p->push();\n\t\tif (rev) {\n\t\t\tswap(l, r);\n\t\t\tif (l) l->rev ^= true, l->rev_data();\n\t\t\tif (r) r->rev ^= true, r->rev_data();\n\t\t\trev = false;\n\t\t}\n\t\tif (flag) {\n\t\t\tif (l) l->update_lazy(lazy);\n\t\t\tif (r) r->update_lazy(make_pair(lazy.first + lazy.second * (l ? l->size + 1 : 1), lazy.second));\n\t\t\tflag = false;\n\t\t}\n\t}\n\tvoid rot() {\n\t\tlct_node *par = p;\n\t\tlct_node *mid;\n\t\tif (p->l == this) {\n\t\t\tmid = r;\n\t\t\tr = par;\n\t\t\tpar->l = mid;\n\t\t}\n\t\telse {\n\t\t\tmid = l;\n\t\t\tl = par;\n\t\t\tpar->r = mid;\n\t\t}\n\t\tif (mid) mid->p = par;\n\t\tp = par->p;\n\t\tpar->p = this;\n\t\tif (p && p->l == par) p->l = this;\n\t\tif (p && p->r == par) p->r = this;\n\t\tpar->update();\n\t\tupdate();\n\t}\n\tvoid splay() {\n\t\tpush();\n\t\twhile (pos()) {\n\t\t\tint st = pos() ^ p->pos();\n\t\t\tif (!st) p->rot(), rot();\n\t\t\telse if (st == 2) rot(), rot();\n\t\t\telse rot();\n\t\t}\n\t}\n\npublic:\n\tlct_node() : l(nullptr), r(nullptr), p(nullptr), rev(false), val(M::id()), all(M::id()), size(1), flag(false) {}\n\tvoid expose() {\n\t\tfor (lct_node *x = this, *y = nullptr; x; y = x, x = x->p) x->splay(), x->r = y, x->update();\n\t\tsplay();\n\t}\n\tvoid link(lct_node *x) {\n\t\tx->expose();\n\t\texpose();\n\t\tp = x;\n\t}\n\tvoid evert() {\n\t\texpose();\n\t\trev = true;\n\t\trev_data();\n\t}\n\tT find() {\n\t\texpose();\n\t\treturn all;\n\t}\n\tvoid update(U v) {\n\t\texpose();\n\t\tupdate_lazy(v);\n\t}\n};\n\nconst int MAX = 1e5+10;\nlct_node lct[MAX];\n\nvoid build(int v, int prev, const vector<vector<int>>& G) {\n\tfor (int to : G[v]) if (to != prev) {\n\t\tlct[to].link(&lct[v]);\n\t\tbuild(to, v, G);\n\t}\n}\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint N, Q;\n\tcin >> N >> Q;\n\tvector<vector<int>> G(N);\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\tG[u].push_back(v);\n\t\tG[v].push_back(u);\n\t}\n\tbuild(0, -1, G);\n\twhile (Q--) {\n\t\tint com, u, v;\n\t\tcin >> com >> u >> v;\n\t\tif (com == 1) {\n\t\t\tint x,y;\n\t\t\tcin >> x>>y;\n\t\t\tlct[u].evert();\n\t\t\tlct[v].update(make_pair(mint(x), mint(y)));\n\t\t}\n\t\telse {\n\t\t\tlct[u].evert();\n\t\t\tprintf(\"%d\\n\", lct[v].find().get());\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":490,"memory_kb":30368,"score_of_the_acc":-0.1951,"final_rank":3},{"submission_id":"aoj_3050_3145319","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int mod = 1e9 + 7;\n\ntemplate<int MOD>\nstruct mod_int {\n\tstatic const int Mod = MOD;\n\tunsigned x;\n\tmod_int() : x(0) { }\n\tmod_int(int sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\n\tmod_int(long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\n\tint get() const { return (int)x; }\n\n\tmod_int &operator+=(mod_int that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\n\tmod_int &operator-=(mod_int that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\n\tmod_int &operator*=(mod_int that) { x = (unsigned long long)x * that.x % MOD; return *this; }\n\tmod_int &operator/=(mod_int that) { return *this *= that.inverse(); }\n\n\tmod_int operator+(mod_int that) const { return mod_int(*this) += that; }\n\tmod_int operator-(mod_int that) const { return mod_int(*this) -= that; }\n\tmod_int operator*(mod_int that) const { return mod_int(*this) *= that; }\n\tmod_int operator/(mod_int that) const { return mod_int(*this) /= that; }\n\n\tmod_int inverse() const {\n\t\tlong long a = x, b = MOD, u = 1, v = 0;\n\t\twhile (b) {\n\t\t\tlong long t = a / b;\n\t\t\ta -= t * b; swap(a, b);\n\t\t\tu -= t * v; swap(u, v);\n\t\t}\n\t\treturn mod_int(u);\n\t}\n};\n\nusing mint = mod_int<mod>;\n\nstruct RS {\n\tusing type = mint;\n\tstatic type id() { return 0; }\n\tstatic type op(const type& l, const type & r) {\n\t\treturn l + r;\n\t}\n};\n\nclass lct_node {\n\tusing M = RS;\n\tusing T = typename M::type;\n\tusing U = pair<mint, mint>;\n\n\tlct_node *l, *r, *p;\n\tbool rev;\n\tT val, all;\n\tint size;\n\tbool flag;\n\tU lazy;\n\n\tint pos() {\n\t\tif (p && p->l == this) return 1;\n\t\tif (p && p->r == this) return 3;\n\t\treturn 0;\n\t}\n\tvoid update() {\n\t\tsize = (l ? l->size : 0) + (r ? r->size : 0) + 1;\n\t\tall = M::op(l ? l->all : M::id(), M::op(val, r ? r->all : M::id()));\n\t}\n\tvoid update_lazy(const U& v) {\n\t\tif (!flag) lazy = make_pair(0, 0);\n\t\tint ls = !rev ? (l ? l->size : 0) : (r ? r->size : 0);\n\t\tval += v.first + v.second * ls;\n\t\tall += v.first * size + ((v.second * (size - 1)) * size) / 2;\n\t\tlazy = make_pair(M::op(lazy.first, v.first), M::op(lazy.second, v.second));\n\t\tflag = true;\n\t}\n\tvoid rev_data() {\n\t\tlazy = make_pair(lazy.first + lazy.second * (size - 1), mint(0) - lazy.second);\n\t}\n\tvoid push() {\n\t\tif (pos()) p->push();\n\t\tif (rev) {\n\t\t\tswap(l, r);\n\t\t\tif (l) l->rev ^= true, l->rev_data();\n\t\t\tif (r) r->rev ^= true, r->rev_data();\n\t\t\trev = false;\n\t\t}\n\t\tif (flag) {\n\t\t\tif (l) l->update_lazy(lazy);\n\t\t\tif (r) r->update_lazy(make_pair(lazy.first + lazy.second * (l ? l->size + 1 : 1), lazy.second));\n\t\t\tflag = false;\n\t\t}\n\t}\n\tvoid rot() {\n\t\tlct_node *par = p;\n\t\tlct_node *mid;\n\t\tif (p->l == this) {\n\t\t\tmid = r;\n\t\t\tr = par;\n\t\t\tpar->l = mid;\n\t\t}\n\t\telse {\n\t\t\tmid = l;\n\t\t\tl = par;\n\t\t\tpar->r = mid;\n\t\t}\n\t\tif (mid) mid->p = par;\n\t\tp = par->p;\n\t\tpar->p = this;\n\t\tif (p && p->l == par) p->l = this;\n\t\tif (p && p->r == par) p->r = this;\n\t\tpar->update();\n\t\tupdate();\n\t}\n\tvoid splay() {\n\t\tpush();\n\t\twhile (pos()) {\n\t\t\tint st = pos() ^ p->pos();\n\t\t\tif (!st) p->rot(), rot();\n\t\t\telse if (st == 2) rot(), rot();\n\t\t\telse rot();\n\t\t}\n\t}\n\npublic:\n\tlct_node() : l(nullptr), r(nullptr), p(nullptr), rev(false), val(M::id()), all(M::id()), size(1), flag(false) {}\n\tvoid expose() {\n\t\tfor (lct_node *x = this, *y = nullptr; x; y = x, x = x->p) x->splay(), x->r = y, x->update();\n\t\tsplay();\n\t}\n\tvoid link(lct_node *x) {\n\t\tx->expose();\n\t\texpose();\n\t\tp = x;\n\t}\n\tvoid evert() {\n\t\texpose();\n\t\trev = true;\n\t\trev_data();\n\t}\n\tT find() {\n\t\texpose();\n\t\treturn all;\n\t}\n\tvoid update(U v) {\n\t\texpose();\n\t\tupdate_lazy(v);\n\t}\n};\n\nconst int MAX = 1e5;\nlct_node lct[MAX];\n\nvoid build(int v, int prev, const vector<vector<int>>& G) {\n\tfor (int to : G[v]) if (to != prev) {\n\t\tlct[to].link(&lct[v]);\n\t\tbuild(to, v, G);\n\t}\n}\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tint N, Q;\n\tcin >> N >> Q;\n\tvector<vector<int>> G(N);\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\tG[u].push_back(v);\n\t\tG[v].push_back(u);\n\t}\n\tbuild(0, -1, G);\n\twhile (Q--) {\n\t\tint com, u, v;\n\t\tcin >> com >> u >> v;\n\t\tif (com == 1) {\n\t\t\tint k, m;\n\t\t\tcin >> k >> m;\n\t\t\tlct[u].evert();\n\t\t\tlct[v].update(make_pair(mint(k), mint(m)));\n\t\t}\n\t\telse {\n\t\t\tlct[u].evert();\n\t\t\tprintf(\"%d\\n\", lct[v].find().get());\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":560,"memory_kb":30500,"score_of_the_acc":-0.22,"final_rank":4},{"submission_id":"aoj_3050_3137235","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\n\ntemplate<typename T,typename E,typename F,typename G,typename H>\nstruct LinkCutTree{\n struct Node{\n Node *l,*r,*p;\n size_t sz;// tree size (only for root)\n Int idx;\n bool rev;\n T val,dat;\n E laz;\n Node():sz(1){}\n Node(Int idx,T val,E laz):\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\n bool is_root(){\n return !p||(p->l!=this&&p->r!=this);\n }\n };\n \n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n using S = function<T(T)>;\n F f;\n G g;\n H h;\n S s;\n T ti;\n E ei;\n \n const size_t LIM = 1e6;\n vector<Node> pool;\n size_t ptr;\n \n \n LinkCutTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\n s=[](T a){return a;};\n }\n \n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\n \n inline Node* create(){\n return &pool[ptr++];\n }\n \n inline Node* create(Int idx,T v){\n return &(pool[ptr++]=Node(idx,v,ei));\n }\n\n void propagate(Node *t,E v){\n t->laz=h(t->laz,v);\n t->val=g(t->val,v);\n t->dat=g(t->dat,v);\n }\n\n void toggle(Node *t){\n swap(t->l,t->r);\n t->dat=s(t->dat);\n t->rev^=1;\n }\n\n void eval(Node *t){\n if(t->laz!=ei){\n if(t->l) propagate(t->l,t->laz);\n if(t->r) propagate(t->r,t->laz);\n t->laz=ei;\n }\n if(t->rev){\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev=false;\n }\n }\n\n void update(Node *t){\n t->dat=t->val;\n if(t->l) t->dat=f(t->l->dat,t->dat);\n if(t->r) t->dat=f(t->dat,t->r->dat);\n }\n\n void rotR(Node *t){\n Node *x=t->p,*y=x->p; \n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \n t->r=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n \n void rotL(Node *t){\n Node *x=t->p,*y=x->p;\n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\n t->l=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n\n void splay(Node *t){\n eval(t);\n while(!t->is_root()){\n Node *q=t->p;\n if(q->is_root()){\n\teval(q);eval(t);\n\tif(q->l==t) rotR(t);\n\telse rotL(t);\n }else{\n\tauto *r=q->p;\n\teval(r);eval(q);eval(t);\n\tif(r->l==q){\n\t if(q->l==t) rotR(q),rotR(t);\n\t else rotL(t),rotR(t);\n\t}else{\t\n\t if(q->r==t) rotL(q),rotL(t);\n\t else rotR(t),rotL(t);\n\t}\n }\n }\n }\n\n Node* expose(Node *t){\n Node *rp=nullptr;\n for(Node *c=t;c;c=c->p){\n splay(c);\n c->r=rp;\n update(c);\n rp=c;\n }\n splay(t);\n return rp;\n }\n\n void link(Node *par,Node *c){\n expose(c);\n expose(par);\n c->p=par;\n par->r=c;\n par->sz+=c->sz;\n }\n\n void cut(Node *c){\n expose(c);\n Node *par=c->l;\n c->l=nullptr;\n par->p=nullptr;\n c->sz-=par->sz;\n }\n\n void evert(Node *t){\n expose(t);\n toggle(t);\n eval(t);\n }\n\n bool is_connected(Node *a,Node *b){\n expose(a);\n while(a->l) a=a->l;\n expose(b);\n while(b->l) b=b->l;\n return a==b;\n }\n\n Node *lca(Node *a,Node *b){\n expose(a);\n return expose(b);\n }\n\n T query(Node *t){\n expose(t);\n return t->dat;\n }\n\n void update(Node *t,E v){\n expose(t);\n propagate(t,v);\n eval(t);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n vector<vector<Int> > G(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n \n constexpr Int MOD = 1e9+7; \n auto add=[](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\n auto mul=[](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\n \n struct T{\n Int l,r,s;\n T(){}\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\n };\n struct P{\n Int a,b;\n P(){}\n P(Int a,Int b):a(a),b(b){};\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n \n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\n auto g=[&](T a,P b){\n\t Int k=a.r-a.l;\n\t b.b=add(b.b,a.l*b.a)*k;\n\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\n \n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\n vector<LCT::Node* > vs(n);\n \n vector<Int> ps(n,-1),dep(n,0);\n {\n queue<pair<Int, Int> > q;\n q.emplace(0,-1);\n while(!q.empty()){\n Int v,p;\n tie(v,p)=q.front();q.pop();\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\n ps[v]=p;\n if(~p) lct.link(vs[p],vs[v]);\n for(Int u:G[v]){\n\tif(u==p) continue;\n\tq.emplace(u,v);\n\tdep[u]=dep[v]+1;\n }\n } \n }\n\n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=lct.lca(vs[s],vs[t])->idx;\n Int p=ps[l];\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n // add ax + b (different from statement)\n\n // [l, s] -> (p, s]\n {\n\tInt a1=MOD-a;\n\tInt b1=add(b,-a1*dep[s]);\n\tlct.update(vs[s],P(a1,b1));\n\tif(~p) lct.update(vs[p],P(-a1,-b1));\n }\n // (l, t]\n {\n\tInt d=dep[s]+dep[t]-2*dep[l];\n\tInt a2=a;\n\tInt b2=add(add(b,a*d),-a2*dep[t]);\n\tlct.update(vs[t],P(a2,b2));\n\tlct.update(vs[l],P(-a2,-b2));\n }\n }else{\n Int ans=0;\n // [l, s] -> (p, s]\n ans=add(ans,lct.query(vs[s]).s);\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\n // (l, t]\n ans=add(ans,lct.query(vs[t]).s);\n ans=add(ans,-lct.query(vs[l]).s);\n \n printf(\"%lld\\n\",ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":122188,"score_of_the_acc":-1.1413,"final_rank":12},{"submission_id":"aoj_3050_3130820","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\nusing T = tuple<Int,Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\ntemplate<class T>void prArr(T a,string s=\" \"){Int i=0;for(auto t:a)cout<<(i++?s:\"\")<<t;cout<<endl;}\n\nclass HLD{\npublic:\n Int V; //ノード数\n Int root; //根の頂点番号\n vector<vector<Int> > G; //Grapth\n vector<Int> par; //parent: par[元の頂点番号]->元の頂点番号\n vector<Int> Hchild; //各ノードから伸びるHeavy Childの頂点番号: Hedge[元の頂点番号]->元の頂点番号\n vector<Int> number; //各ノードに割り当てなおした頂点番号: number[元の頂点番号]->振り直した頂点番号\n vector<Int> id; //割り当て直した数字の元のノード番号: id[振り直した頂点番号]->元の頂点番号\n vector<Int> group; //各ノードが所属するグループ番号: group[元の頂点番号]->元の頂点番号\n vector<Int> depth; //根からの各ノードの深さ: depth[元の頂点番号]\n bool ok; //build()が済んでいるか\n \n HLD(){root = V = -1;}\n HLD(Int V):V(V), root(0), G(V), par(V,-1), Hchild(V,-1), \n number(V,-1),id(V,-1),group(V,-1),depth(V,0),ok(false){}\n \n void add_edge(Int a,Int b){\n assert(a < V && b < V);\n G[a].push_back(b);\n G[b].push_back(a);\n }\n \n void build(Int _root = 0){\n root = _root;\n Int num = 0;\n ok = true;\n dfs1(); numbering(num); dfs2();\n }\n\n Int dfs1(Int pos = -1,Int pre = -1){\n if(pos == -1) pos = root;\n Int mx = -1, weight = 1;\n for(Int to:G[pos]){\n if(to == pre) continue;\n Int cweight = dfs1(to,pos);\n weight += cweight;\n if(mx < cweight) Hchild[pos] = to, mx = cweight;\n }\n return weight;\n }\n \n void dfs2(Int pos = -1,Int pre = -1,Int dep = 0,Int g = -1){\n if(pos == -1) pos = g = root;\n par[pos] = pre;\n depth[pos] = dep;\n group[pos] = g;\n for(Int to:G[pos]) if(to!=pre) dfs2(to,pos,dep+1,Hchild[pos]==to? g:to);\n }\n \n void numbering(Int &cnt,Int pos = -1,Int pre = -1){\n if(pos == -1) pos = root;\n number[pos] = cnt++;\n id[number[pos]] = pos;\n if(Hchild[pos]>=0) numbering(cnt,Hchild[pos],pos);\n for(Int to:G[pos])if(to!=pre && to!=Hchild[pos]) numbering(cnt,to,pos);\n }\n \n typedef pair<Int,Int> P;\n vector<P> paths; //[u,v]間の経路をいくつかの「閉区間の連番の経路」に分解する。(最大logN個に分解される)\n vector<P> Ledges; //paths同士を結ぶライトエッジ\n \n //より浅い区間から追加される。つまりpaths[0].first = number[lca(u,v)];\n void buildPaths(Int u,Int v){\n if(depth[group[u]] < depth[group[v]]) swap(u,v);// 深い方のノードから処理する。\n Int nu=number[u], nv=number[v];\n if(same(u,v)){ paths.push_back(P(min(nu,nv),max(nu,nv)));return;} \n\n Int gu = group[u];\n buildPaths(par[gu],v);\n\n paths.push_back(P(number[gu], number[u]));\n Ledges.push_back(P(number[par[gu]], number[gu]));\n }\n \n //lca(元の頂点番号,元の頂点番号) -> 元の頂点番号\n Int lca(Int u,Int v){\n assert(ok && \"Please Build\");\n if(depth[group[u]] < depth[group[v]]) swap(u,v);\n if(same(u,v)) return depth[u] < depth[v]? u:v;\n return lca(par[group[u]],v);\n }\n \n //getPath(元の頂点番号,元の頂点番号) -> 振り直した頂点番号\n pair<vector<P>, vector<P> > getPath(Int u,Int v){\n assert(ok && \"Please Build\");\n paths.clear();\n Ledges.clear();\n buildPaths(u,v);\n return make_pair(paths,Ledges);\n }\n\n /*(元の頂点番号,元の頂点番号)*/ \n bool same(Int a,Int b){return group[a] == group[b];}\n};\n\nclass Seg{\npublic: \n typedef long long ll;\n\n //マージ可能な主データ型\n struct D{\n ll value;\n D():value(0){} /*適切な値にする!!!!!!*/\n D(ll value):value(value){}\n };\n\n //遅延用の型 \n struct T{\n Int type; //0 - empty , 1 - update\n ll a, d;\n T():type(0), a(0), d(0){}\n T(Int type,ll a, ll d):type(type), a(a) ,d(d){}\n };\n\n \n Int n, n_;\n vector<D> dat;\n vector<T> td;\n HLD hld;\n D returnD = D(0); // 範囲外の時に返す値。\n \n Seg(){n=-1;}\n Seg(Int n_, HLD hld):n_(n_), hld(hld){\n n=1;\n while(n < n_) n *= 2;\n td.resize(2*n-1,T());\n dat.resize(2*n-1,D());\n }\n \n inline D merge(D a,D b){return (a.value%mod + b.value%mod+mod)%mod;}\n inline T merge(T from, T to){\n if(to.type == 0) return from;\n if(from.type == 0) return to;\n return T(1, from.a + to.a, from.d + to.d);\n }\n inline ll sum(Int l, Int r, T x){\n Int dis = hld.depth[hld.id[l]];\n Int n = r - l;\n x.a = (x.a + x.d * dis)%mod;\n return ((x.a + (x.a + x.d * (n - 1))%mod) * n / 2)%mod;\n }\n \n void delay(Int l,Int r, Int k){\n if(td[k].type==0) return;\n Int mid = (l + r) / 2;\n {\n Int i = k*2+1;\n dat[i].value = (dat[i].value + sum(l, mid, td[k]))%mod;\n td[i] = merge(td[i], td[k]);\n }\n\n {\n Int i = k*2+2;\n dat[i].value = (dat[i].value + sum(mid, r, td[k]))%mod;\n td[i] = merge(td[i], td[k]);\n }\n td[k] = T(0,0,0);\n }\n\n D write(Int l,Int r, Int k, T x){\n dat[k].value = (dat[k].value + sum(l, r, x))%mod;\n td[k] = merge(td[k], x);\n return dat[k];\n }\n \n D dfs(Int a, Int b, T x, bool flag, Int k, Int l, Int r){\n if(r <= a||b <= l) return flag? dat[k]:returnD;\n if(a <= l && r <= b) return flag? write(l, r, k, x):dat[k];\n delay(l, r, k);\n D vl = dfs(a, b, x, flag, k*2+1, l, (l+r)/2);\n D vr = dfs(a, b, x, flag, k*2+2, (l+r)/2, r);\n return flag? (dat[k] = merge(vl, vr)):merge(vl, vr);\n }\n\n void add(Int l,Int r,ll a, ll d){\n assert(l <= r);\n assert(0 <= l && l <= n);\n assert(0 <= r && r <= n);\n dfs(l, r, T(1, a, d), true, 0, 0, n);\n }\n \n //[l,r)の合計値を得る find(a,b);\n ll get(Int l,Int r){\n assert(l <= r);\n assert(0 <= l && l <= n);\n assert(0 <= r && r <= n);\n D res = dfs(l, r, T(), false, 0, 0, n);\n return res.value;\n }\n};\n\n\nsigned main(){\n srand((unsigned)time(NULL));\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n Int N, Q;\n scanf(\"%lld %lld\", &N, &Q);\n HLD hld(N);\n for(Int i=0;i<N-1;i++){\n Int a, b;\n scanf(\"%lld %lld\", &a, &b);\n hld.add_edge(a, b);\n }\n hld.build();\n Seg seg(N, hld);\n\n auto query0 = [&](Int S,Int T){\n auto path = hld.getPath(S, T).first;\n Int res = 0;\n for(auto p:path){\n Int l, r; tie(l, r) = p;\n res = (res + seg.get(l, r+1)) % mod;\n }\n return res;\n };\n \n auto query1 = [&](Int S, Int T, Int a, Int d){\n auto add = [&hld,&seg](Int s, Int t, Int a,Int d){\n auto path = hld.getPath(s, t).first;\n for(auto p:path){\n\tInt l,r; tie(l, r) = p;\n\tseg.add(l, r+1, a, d);\n }\n };\n \n Int lca = hld.lca(S, T);\n Int val = a + d * (hld.depth[S] - hld.depth[lca]);\n {\n Int na = d * hld.depth[lca] + val;\n Int nd = -d;\n add(lca, S, na, nd);\n }\n {\n Int na = -d * hld.depth[lca] + val;\n Int nd = d;\n add(lca, T, na, nd);\n }\n {\n Int na = -val;\n Int nd = 0;\n add(lca, lca, na, nd);\n }\n };\n\n while(Q--){\n Int cmd;\n scanf(\"%lld\", &cmd);\n if(cmd == 0){\n Int S, T;\n scanf(\"%lld %lld\", &S, &T);\n Int ans = query0(S, T);\n cout<<ans<<endl;\n }\n else{\n Int S, T, a, d;\n scanf(\"%lld %lld %lld %lld\", &S, &T, &a, &d);\n query1(S, T, a, d);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":73356,"score_of_the_acc":-0.6542,"final_rank":10},{"submission_id":"aoj_3050_3130695","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\n\ntemplate<typename T,typename E,typename F,typename G,typename H>\nstruct LinkCutTree{\n struct Node{\n Node *l,*r,*p;\n size_t sz;// tree size (only for root)\n Int idx;\n bool rev;\n T val,dat;\n E laz;\n Node():sz(1){}\n Node(Int idx,T val,E laz):\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\n bool is_root(){\n return !p||(p->l!=this&&p->r!=this);\n }\n };\n \n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n using S = function<T(T)>;\n F f;\n G g;\n H h;\n S s;\n T ti;\n E ei;\n \n const size_t LIM = 1e6;\n vector<Node> pool;\n size_t ptr;\n \n \n LinkCutTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\n s=[](T a){return a;};\n }\n \n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\n \n inline Node* create(){\n return &pool[ptr++];\n }\n \n inline Node* create(Int idx,T v){\n return &(pool[ptr++]=Node(idx,v,ei));\n }\n\n void propagate(Node *t,E v){\n t->laz=h(t->laz,v);\n t->val=g(t->val,v);\n t->dat=g(t->dat,v);\n }\n\n void toggle(Node *t){\n swap(t->l,t->r);\n t->dat=s(t->dat);\n t->rev^=1;\n }\n\n void eval(Node *t){\n if(t->laz!=ei){\n if(t->l) propagate(t->l,t->laz);\n if(t->r) propagate(t->r,t->laz);\n t->laz=ei;\n }\n if(t->rev){\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev=false;\n }\n }\n\n void update(Node *t){\n t->dat=t->val;\n if(t->l) t->dat=f(t->l->dat,t->dat);\n if(t->r) t->dat=f(t->dat,t->r->dat);\n }\n\n void rotR(Node *t){\n Node *x=t->p,*y=x->p; \n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \n t->r=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n \n void rotL(Node *t){\n Node *x=t->p,*y=x->p;\n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\n t->l=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n\n void splay(Node *t){\n eval(t);\n while(!t->is_root()){\n Node *q=t->p;\n if(q->is_root()){\n\teval(q);eval(t);\n\tif(q->l==t) rotR(t);\n\telse rotL(t);\n }else{\n\tauto *r=q->p;\n\teval(r);eval(q);eval(t);\n\tif(r->l==q){\n\t if(q->l==t) rotR(q),rotR(t);\n\t else rotL(t),rotR(t);\n\t}else{\t\n\t if(q->r==t) rotL(q),rotL(t);\n\t else rotR(t),rotL(t);\n\t}\n }\n }\n }\n\n Node* expose(Node *t){\n Node *rp=nullptr;\n for(Node *c=t;c;c=c->p){\n splay(c);\n c->r=rp;\n update(c);\n rp=c;\n }\n splay(t);\n return rp;\n }\n\n void link(Node *par,Node *c){\n expose(c);\n expose(par);\n c->p=par;\n par->r=c;\n par->sz+=c->sz;\n }\n\n void cut(Node *c){\n expose(c);\n Node *par=c->l;\n c->l=nullptr;\n par->p=nullptr;\n c->sz-=par->sz;\n }\n\n void evert(Node *t){\n expose(t);\n toggle(t);\n eval(t);\n }\n\n bool is_connected(Node *a,Node *b){\n expose(a);\n while(a->l) a=a->l;\n expose(b);\n while(b->l) b=b->l;\n return a==b;\n }\n\n Node *lca(Node *a,Node *b){\n expose(a);\n return expose(b);\n }\n\n T query(Node *t){\n expose(t);\n return t->dat;\n }\n\n void update(Node *t,E v){\n expose(t);\n propagate(t,v);\n eval(t);\n }\n};\n\n//INSERT ABOVE HERE\nconst Int MOD = 1e9+7;\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n vector<vector<Int> > G(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n \n auto add=[](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\n auto mul=[](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\n \n struct T{\n Int l,r,s;\n T(){}\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\n };\n struct P{\n Int a,b;\n P(){}\n P(Int a,Int b):a(a),b(b){};\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n \n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\n auto g=[&](T a,P b){\n\t Int k=a.r-a.l;\n\t b.b=add(b.b,a.l*b.a)*k;\n\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\n \n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\n vector<LCT::Node* > vs(n);\n \n vector<Int> ps(n,-1),dep(n,0);\n {\n queue<pair<Int, Int> > q;\n q.emplace(0,-1);\n while(!q.empty()){\n Int v,p;\n tie(v,p)=q.front();q.pop();\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\n ps[v]=p;\n if(~p) lct.link(vs[p],vs[v]);\n for(Int u:G[v]){\n\tif(u==p) continue;\n\tq.emplace(u,v);\n\tdep[u]=dep[v]+1;\n }\n } \n }\n\n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=lct.lca(vs[s],vs[t])->idx;\n Int p=ps[l];\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n // add ax + b (different from statement)\n\n // [l, s] -> (p, s]\n {\n\tInt a1=MOD-a;\n\tInt b1=add(b,-a1*dep[s]);\n\tlct.update(vs[s],P(a1,b1));\n\tif(~p) lct.update(vs[p],P(-a1,-b1));\n }\n // (l, t]\n {\n\tInt d=dep[s]+dep[t]-2*dep[l];\n\tInt a2=a;\n\tInt b2=add(add(b,a*d),-a2*dep[t]);\n\tlct.update(vs[t],P(a2,b2));\n\tlct.update(vs[l],P(-a2,-b2));\n }\n }else{\n Int ans=0;\n // [l, s] -> (p, s]\n ans=add(ans,lct.query(vs[s]).s);\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\n // (l, t]\n ans=add(ans,lct.query(vs[t]).s);\n ans=add(ans,-lct.query(vs[l]).s);\n \n printf(\"%lld\\n\",ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":122200,"score_of_the_acc":-1.1414,"final_rank":13},{"submission_id":"aoj_3050_3130693","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\n\ntemplate<typename T,typename E,typename F,typename G,typename H>\nstruct LinkCutTree{\n struct Node{\n Node *l,*r,*p;\n size_t sz;// tree size (only for root)\n Int idx;\n bool rev;\n T val,dat;\n E laz;\n Node():sz(1){}\n Node(Int idx,T val,E laz):\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\n bool is_root(){\n return !p||(p->l!=this&&p->r!=this);\n }\n };\n \n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n using S = function<T(T)>;\n F f;\n G g;\n H h;\n S s;\n T ti;\n E ei;\n \n const size_t LIM = 1e6;\n vector<Node> pool;\n size_t ptr;\n \n \n LinkCutTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\n s=[](T a){return a;};\n }\n \n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\n \n inline Node* create(){\n return &pool[ptr++];\n }\n \n inline Node* create(Int idx,T v){\n return &(pool[ptr++]=Node(idx,v,ei));\n }\n\n void propagate(Node *t,E v){\n t->laz=h(t->laz,v);\n t->val=g(t->val,v);\n t->dat=g(t->dat,v);\n }\n\n void toggle(Node *t){\n swap(t->l,t->r);\n t->dat=s(t->dat);\n t->rev^=1;\n }\n\n void eval(Node *t){\n if(t->laz!=ei){\n if(t->l) propagate(t->l,t->laz);\n if(t->r) propagate(t->r,t->laz);\n t->laz=ei;\n }\n if(t->rev){\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev=false;\n }\n }\n\n void update(Node *t){\n t->dat=t->val;\n if(t->l) t->dat=f(t->l->dat,t->dat);\n if(t->r) t->dat=f(t->dat,t->r->dat);\n }\n\n void rotR(Node *t){\n Node *x=t->p,*y=x->p; \n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \n t->r=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n \n void rotL(Node *t){\n Node *x=t->p,*y=x->p;\n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\n t->l=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n\n void splay(Node *t){\n eval(t);\n while(!t->is_root()){\n Node *q=t->p;\n if(q->is_root()){\n\teval(q);eval(t);\n\tif(q->l==t) rotR(t);\n\telse rotL(t);\n }else{\n\tauto *r=q->p;\n\teval(r);eval(q);eval(t);\n\tif(r->l==q){\n\t if(q->l==t) rotR(q),rotR(t);\n\t else rotL(t),rotR(t);\n\t}else{\t\n\t if(q->r==t) rotL(q),rotL(t);\n\t else rotR(t),rotL(t);\n\t}\n }\n }\n }\n\n Node* expose(Node *t){\n Node *rp=nullptr;\n for(Node *c=t;c;c=c->p){\n splay(c);\n c->r=rp;\n update(c);\n rp=c;\n }\n splay(t);\n return rp;\n }\n\n void link(Node *par,Node *c){\n expose(c);\n expose(par);\n c->p=par;\n par->r=c;\n par->sz+=c->sz;\n }\n\n void cut(Node *c){\n expose(c);\n Node *par=c->l;\n c->l=nullptr;\n par->p=nullptr;\n c->sz-=par->sz;\n }\n\n void evert(Node *t){\n expose(t);\n toggle(t);\n eval(t);\n }\n\n bool is_connected(Node *a,Node *b){\n expose(a);\n while(a->l) a=a->l;\n expose(b);\n while(b->l) b=b->l;\n return a==b;\n }\n\n Node *lca(Node *a,Node *b){\n expose(a);\n return expose(b);\n }\n\n T query(Node *t){\n expose(t);\n return t->dat;\n }\n\n void update(Node *t,E v){\n expose(t);\n propagate(t,v);\n eval(t);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n vector<vector<Int> > G(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n \n const Int MOD = 1e9+7;\n auto add=[MOD](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\n auto mul=[MOD](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\n \n struct T{\n Int l,r,s;\n T(){}\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\n };\n struct P{\n Int a,b;\n P(){}\n P(Int a,Int b):a(a),b(b){};\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n \n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\n auto g=[&](T a,P b){\n\t Int k=a.r-a.l;\n\t b.b=add(b.b,a.l*b.a)*k;\n\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\n \n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\n vector<LCT::Node* > vs(n);\n \n vector<Int> ps(n,-1),dep(n,0);\n {\n queue<pair<Int, Int> > q;\n q.emplace(0,-1);\n while(!q.empty()){\n Int v,p;\n tie(v,p)=q.front();q.pop();\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\n ps[v]=p;\n if(~p) lct.link(vs[p],vs[v]);\n for(Int u:G[v]){\n\tif(u==p) continue;\n\tq.emplace(u,v);\n\tdep[u]=dep[v]+1;\n }\n } \n }\n\n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=lct.lca(vs[s],vs[t])->idx;\n Int p=ps[l];\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n // add ax + b (different from statement)\n\n // [l, s] -> (p, s]\n {\n\tInt a1=MOD-a;\n\tInt b1=add(b,-a1*dep[s]);\n\tlct.update(vs[s],P(a1,b1));\n\tif(~p) lct.update(vs[p],P(-a1,-b1));\n }\n // (l, t]\n {\n\tInt d=dep[s]+dep[t]-2*dep[l];\n\tInt a2=a;\n\tInt b2=add(add(b,a*d),-a2*dep[t]);\n\tlct.update(vs[t],P(a2,b2));\n\tlct.update(vs[l],P(-a2,-b2));\n }\n }else{\n Int ans=0;\n // [l, s] -> (p, s]\n ans=add(ans,lct.query(vs[s]).s);\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\n // (l, t]\n ans=add(ans,lct.query(vs[t]).s);\n ans=add(ans,-lct.query(vs[l]).s);\n \n printf(\"%lld\\n\",ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":3130,"memory_kb":122132,"score_of_the_acc":-1.9993,"final_rank":14},{"submission_id":"aoj_3050_3130687","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\nstruct HLDecomposition {\n Int n,pos;\n vector<vector<Int> > G;\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\n \n HLDecomposition(){}\n HLDecomposition(Int sz):\n n(sz),pos(0),G(n),\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\n par(n),dep(n),inv(n),type(n){}\n \n void add_edge(Int u, Int v) {\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n void build(vector<Int> rs={0}) {\n Int c=0;\n for(Int r:rs){\n dfs(r);\n bfs(r, c++);\n }\n }\n \n void dfs(Int rt) {\n using T = pair<Int, Int>;\n stack<T> st;\n par[rt]=-1;\n dep[rt]=0;\n st.emplace(rt,0);\n while(!st.empty()){\n Int v=st.top().first;\n Int &i=st.top().second;\n if(i<(Int)G[v].size()){\n\tInt u=G[v][i++];\n\tif(u==par[v]) continue;\n\tpar[u]=v;\n\tdep[u]=dep[v]+1;\n\tst.emplace(u,0);\n }else{\n\tst.pop();\n\tfor(Int j=0;j<(Int)G[v].size();j++){\n\t Int &u=G[v][j];\n\t if(u==par[v]) swap(u,G[v].back());\n\t if(u==par[v]) continue;\n\t sub[v]+=sub[u];\n\t if(sub[u]>sub[G[v].front()]) swap(u,G[v].front());\n\t}\n }\n }\n }\n\n void bfs(Int r,Int c) {\n using T = tuple<Int, Int, Int>;\n stack<T> st;\n st.emplace(r,r,0);\n while(!st.empty()){\n Int v,h;\n tie(v,h,ignore)=st.top();\n Int &i=get<2>(st.top());\n if(!i){\n\ttype[v]=c;\n\tvid[v]=pos++;\n\tinv[vid[v]]=v;\n\thead[v]=h;\n hvy[v]=(G[v].empty()?-1:G[v][0]);\n\tif(hvy[v]==par[v]) hvy[v]=-1;\n }\n if(i<(Int)G[v].size()){\n\tInt u=G[v][i++];\n\tif(u==par[v]) continue;\n\tst.emplace(u,(hvy[v]==u?h:u),0);\n }else{\n\tst.pop();\n }\n }\n }\n \n // for_each(vertex)\n // [l,r] <- attention!! \n template<typename F>\n void for_each(Int u, Int v, const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n f(max(vid[head[v]],vid[u]),vid[v]);\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n }\n\n template<typename T,typename Q,typename F>\n T for_each(Int u,Int v,T ti,const Q &q,const F &f){\n T l=ti,r=ti;\n while(1){\n if(vid[u]>vid[v]){\n\tswap(u,v);\n\tswap(l,r);\n }\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\n if(head[u]!=head[v]) v=par[head[v]];\n else break;\n }\n return f(l,r);\n }\n \n // for_each(edge)\n // [l,r] <- attention!!\n template<typename F>\n void for_each_edge(Int u, Int v,const F& f) {\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]!=head[v]){\n\tf(vid[head[v]],vid[v]);\n v=par[head[v]];\n }else{\n\tif(u!=v) f(vid[u]+1,vid[v]);\n\tbreak;\n }\n }\n }\n\n Int lca(Int u,Int v){\n while(1){\n if(vid[u]>vid[v]) swap(u,v);\n if(head[u]==head[v]) return u;\n v=par[head[v]];\n }\n }\n\n Int distance(Int u,Int v){\n return dep[u]+dep[v]-2*dep[lca(u,v)];\n }\n};\n\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n Int n,height;\n F f;\n G g;\n H h;\n T ti;\n E ei;\n vector<T> dat;\n vector<E> laz;\n SegmentTree(Int n_,F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\n void init(Int n_){\n n=1;height=0;\n while(n<n_) n<<=1,height++;\n dat.assign(2*n,ti);\n laz.assign(2*n,ei);\n }\n void build(Int n_, vector<T> v){\n for(Int i=0;i<n_;i++) dat[n+i]=v[i];\n for(Int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n T reflect(Int k){\n return g(dat[k],laz[k]);\n }\n inline void eval(Int k){\n if(laz[k]==ei) return;\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\n dat[k]=reflect(k);\n laz[k]=ei;\n }\n void update(Int a,Int b,E x){\n a+=n;b+=n-1;\n for(Int i=height;i;i--) eval(a>>i);\n for(Int i=height;i;i--) eval(b>>i);\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1){\n if(l&1) laz[l]=h(laz[l],x),l++;\n if(r&1) --r,laz[r]=h(laz[r],x);\n }\n while(a>>=1)\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\n while(b>>=1)\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\n }\n T query(Int a,Int b){\n a+=n;b+=n-1;\n for(Int i=height;i;i--) eval(a>>i);\n for(Int i=height;i;i--) eval(b>>i);\n T vl=ti,vr=ti;\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,reflect(l++));\n if(r&1) vr=f(reflect(--r),vr);\n }\n return f(vl,vr);\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n \n HLDecomposition hld(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n hld.add_edge(a,b);\n }\n hld.build();\n \n const Int MOD = 1e9+7;\n using T = tuple<Int, Int, Int>;\n using P = pair<Int, Int>;\n auto f=[](T a,T b){\n\t Int al,ar,as,bl,br,bs;\n\t tie(al,ar,as)=a;\n\t tie(bl,br,bs)=b;\n\t return T(al,br,(as+bs)%MOD);\n\t };\n auto g=[](T a,P b){\n\t Int al,ar,as,ba,bb;\n\t tie(al,ar,as)=a;\n\t tie(ba,bb)=b;\n\t bb+=al*ba%MOD;\n\t Int k=ar-al;\n\t as+=(k*(k-1)/2%MOD*ba%MOD)+(bb*k%MOD);\n\t return T(al,ar,as%MOD);\n\t };\n auto h=[](P a,P b){\n\t return P((a.first+b.first)%MOD,(a.second+b.second)%MOD);\n\t };\n\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,0),P(0,0));\n vector<T> vt(n);\n for(Int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\n seg.build(n,vt);\n \n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=hld.lca(s,t);\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n Int up=(b+MOD-hld.dep[s]*(MOD-a)%MOD)%MOD;\n Int dw=(b+hld.distance(s,t)*a%MOD+MOD-hld.dep[t]*a%MOD)%MOD; \n hld.for_each(l,s,[&](Int l,Int r){seg.update(l,r+1,P(MOD-a,up));});\n hld.for_each_edge(l,t,[&](Int l,Int r){seg.update(l,r+1,P(a,dw));}); \n }else{ \n auto ask=[&](Int l,Int r){return seg.query(l,r+1);};\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\n printf(\"%lld\\n\",get<2>(ans));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":850,"memory_kb":29620,"score_of_the_acc":-0.3089,"final_rank":6},{"submission_id":"aoj_3050_3130685","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\n\ntemplate<typename T,typename E,typename F,typename G,typename H>\nstruct LinkCutTree{\n struct Node{\n Node *l,*r,*p;\n size_t sz;// tree size (only for root)\n Int idx;\n bool rev;\n T val,dat;\n E laz;\n Node():sz(1){}\n Node(Int idx,T val,E laz):\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\n bool is_root(){\n return !p||(p->l!=this&&p->r!=this);\n }\n };\n \n //using F = function<T(T,T)>;\n //using G = function<T(T,E)>;\n //using H = function<E(E,E)>;\n using S = function<T(T)>;\n F f;\n G g;\n H h;\n S s;\n T ti;\n E ei;\n \n const size_t LIM = 1e6;\n vector<Node> pool;\n size_t ptr;\n \n \n LinkCutTree(F f,G g,H h,T ti,E ei):\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\n s=[](T a){return a;};\n }\n \n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\n \n inline Node* create(){\n return &pool[ptr++];\n }\n \n inline Node* create(Int idx,T v){\n return &(pool[ptr++]=Node(idx,v,ei));\n }\n\n void propagate(Node *t,E v){\n t->laz=h(t->laz,v);\n t->val=g(t->val,v);\n t->dat=g(t->dat,v);\n }\n\n void toggle(Node *t){\n swap(t->l,t->r);\n t->dat=s(t->dat);\n t->rev^=1;\n }\n\n void eval(Node *t){\n if(t->laz!=ei){\n if(t->l) propagate(t->l,t->laz);\n if(t->r) propagate(t->r,t->laz);\n t->laz=ei;\n }\n if(t->rev){\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev=false;\n }\n }\n\n void update(Node *t){\n t->dat=t->val;\n if(t->l) t->dat=f(t->l->dat,t->dat);\n if(t->r) t->dat=f(t->dat,t->r->dat);\n }\n\n void rotR(Node *t){\n Node *x=t->p,*y=x->p; \n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \n t->r=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n \n void rotL(Node *t){\n Node *x=t->p,*y=x->p;\n x->sz-=t->sz;\n t->sz+=x->sz;\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\n t->l=x;x->p=t;\n update(x);update(t);\n if((t->p=y)){\n if(y->l==x) y->l=t;\n if(y->r==x) y->r=t;\n update(y);\n }\n }\n\n void splay(Node *t){\n eval(t);\n while(!t->is_root()){\n Node *q=t->p;\n if(q->is_root()){\n\teval(q);eval(t);\n\tif(q->l==t) rotR(t);\n\telse rotL(t);\n }else{\n\tauto *r=q->p;\n\teval(r);eval(q);eval(t);\n\tif(r->l==q){\n\t if(q->l==t) rotR(q),rotR(t);\n\t else rotL(t),rotR(t);\n\t}else{\t\n\t if(q->r==t) rotL(q),rotL(t);\n\t else rotR(t),rotL(t);\n\t}\n }\n }\n }\n\n Node* expose(Node *t){\n Node *rp=nullptr;\n for(Node *c=t;c;c=c->p){\n splay(c);\n c->r=rp;\n update(c);\n rp=c;\n }\n splay(t);\n return rp;\n }\n\n void link(Node *par,Node *c){\n expose(c);\n expose(par);\n c->p=par;\n par->r=c;\n par->sz+=c->sz;\n }\n\n void cut(Node *c){\n expose(c);\n Node *par=c->l;\n c->l=nullptr;\n par->p=nullptr;\n c->sz-=par->sz;\n }\n\n void evert(Node *t){\n expose(t);\n toggle(t);\n eval(t);\n }\n\n bool is_connected(Node *a,Node *b){\n expose(a);\n while(a->l) a=a->l;\n expose(b);\n while(b->l) b=b->l;\n return a==b;\n }\n\n Node *lca(Node *a,Node *b){\n expose(a);\n return expose(b);\n }\n\n T query(Node *t){\n expose(t);\n return t->dat;\n }\n\n void update(Node *t,E v){\n expose(t);\n propagate(t,v);\n eval(t);\n }\n};\n\n//INSERT ABOVE HERE\nconst Int MOD = 1e9+7;\nsigned main(){\n Int n,q;\n scanf(\"%lld %lld\",&n,&q);\n vector<vector<Int> > G(n);\n for(Int i=1;i<n;i++){\n Int a,b;\n scanf(\"%lld %lld\",&a,&b);\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n \n auto add=[](Int a,Int b){return (a+b)%MOD;};\n auto mul=[](Int a,Int b){return (a*b)%MOD;};\n \n struct T{\n Int l,r,s;\n T(){}\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\n };\n struct P{\n Int a,b;\n P(){}\n P(Int a,Int b):a(a),b(b){};\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\n };\n \n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\n auto g=[&](T a,P b){\n\t Int k=a.r-a.l;\n\t b.b=add(b.b,a.l*b.a)*k;\n\t a.s=add(a.s,add(mul(k*(k-1)/2%MOD,b.a),b.b));\n\t return a;\n\t };\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\n \n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\n vector<LCT::Node* > vs(n);\n \n vector<Int> ps(n,-1),dep(n,0);\n {\n queue<pair<Int, Int> > q;\n q.emplace(0,-1);\n while(!q.empty()){\n Int v,p;\n tie(v,p)=q.front();q.pop();\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\n ps[v]=p;\n if(~p) lct.link(vs[p],vs[v]);\n for(Int u:G[v]){\n\tif(u==p) continue;\n\tq.emplace(u,v);\n\tdep[u]=dep[v]+1;\n }\n } \n }\n\n for(Int i=0;i<q;i++){\n Int c,s,t;\n scanf(\"%lld %lld %lld\",&c,&s,&t);\n Int l=lct.lca(vs[s],vs[t])->idx;\n Int p=ps[l];\n \n if(c==1){\n Int b,a;\n scanf(\"%lld %lld\",&b,&a);\n // add ax + b (different from statement)\n\n // [l, s] -> (p, s]\n {\n\tInt a1=MOD-a;\n\tInt b1=add(b,-a1*dep[s]);\n\tlct.update(vs[s],P(a1,b1));\n\tif(~p) lct.update(vs[p],P(-a1,-b1));\n }\n // (l, t]\n {\n\tInt d=dep[s]+dep[t]-2*dep[l];\n\tInt a2=a;\n\tInt b2=add(add(b,a*d),-a2*dep[t]);\n\tlct.update(vs[t],P(a2,b2));\n\tlct.update(vs[l],P(-a2,-b2));\n }\n }else{\n Int ans=0;\n // [l, s] -> (p, s]\n ans=add(ans,lct.query(vs[s]).s);\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\n // (l, t]\n ans=add(ans,lct.query(vs[t]).s);\n ans=add(ans,-lct.query(vs[l]).s);\n\n ans%=MOD;\n ans+=MOD;\n ans%=MOD;\n printf(\"%lld\\n\",ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":430,"memory_kb":122188,"score_of_the_acc":-1.0908,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_3050_5996221\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n\\nstruct TousaSegmentTree {\\n int n;\\n vector<ll> sum, lastval;\\n vector<ll> rangeadd;\\n TousaSegmentTree(int _n){\\n n = 1;\\n while(n<_n+1)n<<=1;\\n sum.assign(2*n-1,0ll);\\n lastval.assign(2*n-1,0ll);\\n rangeadd.assign(2*n-1,0ll);\\n }\\n void push(int a, int b, int k){\\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\\n if(k<n-1){\\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\\n }\\n rangeadd[k] = 0;\\n }\\n void _add(int l, int r, ll x, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return;\\n if(l<=a && b<=r){\\n (rangeadd[k] += x) %= MOD;\\n push(a,b,k);\\n }else{\\n int m = (a+b)/2;\\n _add(l,r,x,a,m,2*k+1);\\n _add(l,r,x,m,b,2*k+2);\\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\\n }\\n }\\n void addTousa(int l, int r, ll a, ll b){\\n _add(l,l+1,a,0,n,0);\\n _add(l+1,r,b,0,n,0);\\n _add(r,r+1,MOD-(a+(r-l-1)*b)%MOD,0,n,0);\\n }\\n ll sumTousa(int l, int r, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return 0ll;\\n if(l<=a && b<=r){\\n return sum[k];\\n }else{\\n int m = (a+b)/2;\\n ll lsum = sumTousa(l,r,a,m,2*k+1);\\n ll rsum = sumTousa(l,r,m,b,2*k+2);\\n int rcnt = max(0,min(r,b)-max(l,m));\\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\\n }\\n }\\n ll sumTousa(int l, int r){\\n return sumTousa(l,r,0,n,0);\\n }\\n};\\n\\nstruct HeavyLightDecomposition {\\n int n;\\n vector<vector<int>> g;\\n vector<int> depth, parent, csize;\\n vector<vector<int>> chains;\\n vector<int> chainid, chainpos;\\n int root = 0;\\n HeavyLightDecomposition(int _n){\\n n = _n;\\n g.resize(n);\\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\\n chainid.assign(n,-1); chainpos.assign(n,-1);\\n }\\n void add_edge(int a, int b){\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n void dfs(int p, int bef, int d){\\n depth[p] = d;\\n csize[p] = 1;\\n for(int to : g[p])if(to!=bef){\\n dfs(to, p, d+1);\\n parent[to] = p;\\n csize[p] += csize[to];\\n }\\n }\\n void dfs2(int p, int bef, int id){\\n chainid[p] = id;\\n chainpos[p] = chains[id].size();\\n chains[id].push_back(p);\\n for(int to : g[p])if(to!=bef){\\n if(csize[to]*2 >= csize[p]){\\n // heavy\\n dfs2(to, p, id);\\n }else{\\n // light\\n chains.push_back(vector<int>());\\n dfs2(to, p, chains.size()-1);\\n }\\n }\\n }\\n void construct(){\\n dfs(root,-1,0);\\n chains.push_back(vector<int>());\\n dfs2(root,-1,0);\\n }\\n int lca(int a, int b){\\n while(a != b){\\n if(depth[a] < depth[b])swap(a,b);\\n if(chainid[a] == chainid[b])return b;\\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\\n a = chains[chainid[a]].front();\\n a = parent[a];\\n }\\n return a;\\n }\\n};\\n\\nint main(){\\n int n,q;\\n scanf(\\\"%d%d\\\",&n,&q);\\n HeavyLightDecomposition hld(n);\\n REP(i,n-1){\\n int a,b;\\n scanf(\\\"%d%d\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.construct();\\n\\n vector<TousaSegmentTree> segs;\\n REP(i,hld.chains.size()){\\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\\n }\\n\\n while(q--){\\n int typ,s,t;\\n scanf(\\\"%d%d%d\\\",&typ,&s,&t);\\n int lca = hld.lca(s,t);\\n if(typ == 0){\\n // sum\\n ll ans = 0;\\n while(true){\\n int id = hld.chainid[s];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n while(true){\\n int id = hld.chainid[t];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }else{\\n // add\\n ll a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n while(true){\\n int id = hld.chainid[s];\\n int r = hld.chainpos[s]+1;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca];\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n (a += (r-l)*b) %= MOD;\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n int rest = hld.depth[t] - hld.depth[lca];\\n (a += (rest-1)*b) %= MOD;\\n b = MOD-b;\\n while(true){\\n int id = hld.chainid[t];\\n int r = hld.chainpos[t]+1;\\n if(t == lca)break;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca] + 1;\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 34100,\n \"score_of_the_acc\": -0.1751,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3050_3154104\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing PII = pair<int, int>;\\ntemplate <typename T> using V = vector<T>;\\ntemplate <typename T> using VV = vector<V<T>>;\\ntemplate <typename T> using VVV = vector<VV<T>>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll INF = (1LL<<60);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nstruct HLDecomposition {\\n int n, pos;\\n VV<int> g;\\n V<int> vid, // HL分解後のグラフでのid\\n head, // 頂点が属するheavy-pathのheadのid\\n sub, // 部分木のサイズ\\n hvy, // heavy-path上での次の頂点のid\\n par, // 親のid\\n depth, // 深さ\\n inv, // HL分解前のグラフのid（添え字が分解後のid）\\n type, // 森をHL分解するときの属する木の番号\\n ps, // 行きがけ順\\n pt; // 帰りがけ順\\n\\n HLDecomposition(){}\\n HLDecomposition(int sz):\\n n(sz), pos(0), g(n),\\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\\n\\n // 辺の追加\\n void add_edge(int u, int v) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n // HL分解の構築を行う\\n void build(V<int> rs=V<int>(1,0)) {\\n int c=0;\\n for(int r: rs) {\\n dfs1(r);\\n dfs2(r, c++);\\n }\\n }\\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\\n void dfs1(int rt) {\\n stack<PII> st;\\n par[rt] = -1;\\n depth[rt] = 0;\\n st.emplace(rt, 0);\\n while(st.size()) {\\n int v = st.top().first;\\n int &i = st.top().second;\\n if(i < (int)g[v].size()) {\\n \\tint u = g[v][i++];\\n \\tif(u == par[v]) continue;\\n \\tpar[u] = v;\\n \\tdepth[u] = depth[v]+1;\\n \\tst.emplace(u, 0);\\n } else {\\n \\tst.pop();\\n \\tfor(int &u: g[v]){\\n if(u == par[v]) swap(u, g[v].back());\\n if(u == par[v]) continue;\\n sub[v] += sub[u];\\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\\n \\t}\\n }\\n }\\n }\\n // 根r、c番目の木についてchainについての情報をまとめる\\n void dfs2(int r, int c) {\\n using T = tuple<int, int, int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()) {\\n int v,h;\\n tie(v,h,ignore)=st.top();\\n int &i=get<2>(st.top());\\n if(!i) {\\n type[v]=c;\\n ps[v]=vid[v]=pos++;\\n inv[vid[v]]=v;\\n head[v]=h;\\n hvy[v]=(g[v].empty()?-1:g[v][0]);\\n if(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(int)g[v].size()) {\\n int u=g[v][i++];\\n if(u==par[v]) continue;\\n st.emplace(u,(hvy[v]==u?h:u),0);\\n } else {\\n st.pop();\\n pt[v]=pos;\\n }\\n }\\n }\\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\\n void for_each(int u, int v, const function<void(int,int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\\n f(max(vid[head[v]], vid[u]), vid[v]);\\n if(head[u]!=head[v]) v = par[head[v]];\\n else break;\\n }\\n }\\n // 辺に対する処理 [u,v] 開区間なので注意!!!\\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]) {\\n\\t f(vid[head[v]], vid[v]);\\n v = par[head[v]];\\n } else {\\n\\t if(u!=v) f(vid[u]+1, vid[v]);\\n\\t break;\\n }\\n }\\n }\\n // 頂点u, vのLCA\\n int lca(int u,int v){\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n // 頂点u, vの距離\\n int distance(int u, int v){\\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\\n }\\n};\\n\\n/**\\n* @brief セグメント木\\n* @details 抽象化した遅延セグメント木\\\\n\\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\\\n\\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\\\n\\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\\\n\\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\\\n\\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\\n*/\\ntemplate <typename T, typename E>\\nstruct lazySegTree {\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n using P = function<E(E,int)>;\\n F f; G g; H h; P p; T d1; E d0;\\n int n;\\n vector<T> dat;\\n vector<E> lazy;\\n\\n lazySegTree(){}\\n lazySegTree(int n_, F f_, G g_, H h_, \\n T d1_, E d0_, P p_=[](E a, int b){return a;})\\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \\n {\\n n = 1; while(n < n_) n *= 2;\\n dat.assign(n*2, d1);\\n lazy.assign(n*2, d0);\\n }\\n void build(vector<T> v) {\\n REP(i, v.size()) dat[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\\n }\\n\\n // 区間の幅がlenの節点kについて遅延評価\\n inline void eval(int len, int k) {\\n if(lazy[k] == d0) return;\\n if(k*2+1 < n*2-1) {\\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\\n lazy[2*k+2] = h(lazy[k*2+2], rx);\\n }\\n dat[k] = g(dat[k],p(lazy[k],len));\\n lazy[k] = d0;\\n }\\n // [a, b)\\n T update(int a, int b, E x, int k, int l, int r) {\\n eval(r-l, k);\\n if(b <= l || r <= a) return dat[k];\\n if(a <= l && r <= b) {\\n lazy[k] = h(lazy[k], x);\\n eval(r-l, k);\\n return dat[k];\\n }\\n int mid = (l+r)/2;\\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\\n if(left&right) { update(a, b, x, 2*k+1, l, mid); update(a, b, rx, 2*k+2, mid, r); }\\n else if(left) update(a, b, x, 2*k+1, l, mid);\\n else if(right) update(a, b, rx, 2*k+2, mid, r);\\n eval(mid-l, 2*k+1); eval(r-mid, 2*k+2);\\n return dat[k] = f(dat[2*k+1], dat[2*k+2]);\\n }\\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\\n // [a, b)\\n T query(int a, int b, int k, int l, int r) {\\n eval(r-l, k);\\n if(a <= l && r <= b) return dat[k];\\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\\n return query(a, b, 2*k+2, (l+r)/2, r);\\n }\\n T query(int a, int b) { return query(a, b, 0, 0, n); }\\n // デバッグ出力\\n void debug() {\\n cout << \\\"---------------------\\\" << endl;\\n int cnt = 0;\\n for(int i=1; i<=n; i*=2) {\\n REP(j, i) {cout << \\\"(\\\" << dat[cnt] << \\\",\\\" << lazy[cnt] << \\\") \\\"; cnt++;}\\n cout << endl;\\n }\\n cout << \\\"---------------------\\\" << endl;\\n }\\n};\\n\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n, q;\\n cin >> n >> q;\\n HLDecomposition hld(n);\\n REP(i, n-1) {\\n int a, b;\\n cin >> a >> b;\\n hld.add_edge(a, b);\\n }\\n hld.build();\\n\\n auto f = [&](int a, int b){ return (a+b) % MOD; };\\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\\n auto h = [&](PII a, PII b){ \\n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\\n };\\n auto p = [&](PII a, int b){ \\n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \\n };\\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\\n\\n REP(i, q) {\\n int type; cin >> type;\\n if(type == 0) {\\n // sum\\n int s, t;\\n cin >> s >> t;\\n int ans = 0;\\n hld.for_each(s, t, [&](int l, int r){\\n // cout << \\\"l=\\\" << l << \\\" r=\\\" << r << endl;\\n (ans += seg.query(l, r+1)) %= MOD;\\n });\\n cout << (ans+MOD)%MOD << endl;\\n } else {\\n // add\\n int s, t, a, d;\\n cin >> s >> t >> a >> d;\\n hld.for_each(s, t, [&](int l, int r){\\n // 初項と公差の正負を求める\\n int dist1 = hld.distance(s, hld.inv[l]);\\n int dist2 = hld.distance(s, hld.inv[r]);\\n int ta = (a + dist1 * d % MOD) % MOD;\\n int td = d;\\n if(dist1 > dist2) td = MOD-d;\\n // cout << \\\"l=\\\" << l << \\\" r=\\\" << r << \\\" \\\" << hld.inv[l] << \\\" \\\" << hld.inv[r] << \\\" \\\" << ta << \\\" \\\" << td << endl;\\n seg.update(l, r+1, {ta, td});\\n });\\n }\\n // seg.debug();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14893617021276595,\n \"time_ms\": 270,\n \"memory_kb\": 22132,\n \"score_of_the_acc\": -0.0389,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3050_3153942\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing PII = pair<int, int>;\\ntemplate <typename T> using V = vector<T>;\\ntemplate <typename T> using VV = vector<V<T>>;\\ntemplate <typename T> using VVV = vector<VV<T>>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll INF = (1LL<<60);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nstruct HLDecomposition {\\n int n, pos;\\n VV<int> g;\\n V<int> vid, // HL分解後のグラフでのid\\n head, // 頂点が属するheavy-pathのheadのid\\n sub, // 部分木のサイズ\\n hvy, // heavy-path上での次の頂点のid\\n par, // 親のid\\n depth, // 深さ\\n inv, // HL分解前のグラフのid（添え字が分解後のid）\\n type, // 森をHL分解するときの属する木の番号\\n ps, // 行きがけ順\\n pt; // 帰りがけ順\\n\\n HLDecomposition(){}\\n HLDecomposition(int sz):\\n n(sz), pos(0), g(n),\\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\\n\\n // 辺の追加\\n void add_edge(int u, int v) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n // HL分解の構築を行う\\n void build(V<int> rs=V<int>(1,0)) {\\n int c=0;\\n for(int r: rs) {\\n dfs1(r);\\n dfs2(r, c++);\\n }\\n }\\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\\n void dfs1(int rt) {\\n stack<PII> st;\\n par[rt] = -1;\\n depth[rt] = 0;\\n st.emplace(rt, 0);\\n while(st.size()) {\\n int v = st.top().first;\\n int &i = st.top().second;\\n if(i < (int)g[v].size()) {\\n \\tint u = g[v][i++];\\n \\tif(u == par[v]) continue;\\n \\tpar[u] = v;\\n \\tdepth[u] = depth[v]+1;\\n \\tst.emplace(u, 0);\\n } else {\\n \\tst.pop();\\n \\tfor(int &u: g[v]){\\n if(u == par[v]) swap(u, g[v].back());\\n if(u == par[v]) continue;\\n sub[v] += sub[u];\\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\\n \\t}\\n }\\n }\\n }\\n // 根r、c番目の木についてchainについての情報をまとめる\\n void dfs2(int r, int c) {\\n using T = tuple<int, int, int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()) {\\n int v,h;\\n tie(v,h,ignore)=st.top();\\n int &i=get<2>(st.top());\\n if(!i) {\\n type[v]=c;\\n ps[v]=vid[v]=pos++;\\n inv[vid[v]]=v;\\n head[v]=h;\\n hvy[v]=(g[v].empty()?-1:g[v][0]);\\n if(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(int)g[v].size()) {\\n int u=g[v][i++];\\n if(u==par[v]) continue;\\n st.emplace(u,(hvy[v]==u?h:u),0);\\n } else {\\n st.pop();\\n pt[v]=pos;\\n }\\n }\\n }\\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\\n void for_each(int u, int v, const function<void(int,int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\\n f(max(vid[head[v]], vid[u]), vid[v]);\\n if(head[u]!=head[v]) v = par[head[v]];\\n else break;\\n }\\n }\\n // 辺に対する処理 [u,v] 開区間なので注意!!!\\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]) {\\n\\t f(vid[head[v]], vid[v]);\\n v = par[head[v]];\\n } else {\\n\\t if(u!=v) f(vid[u]+1, vid[v]);\\n\\t break;\\n }\\n }\\n }\\n // 頂点u, vのLCA\\n int lca(int u,int v){\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n // 頂点u, vの距離\\n int distance(int u, int v){\\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\\n }\\n};\\n\\n/**\\n* @brief セグメント木\\n* @details 抽象化した遅延セグメント木\\\\n\\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\\\n\\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\\\n\\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\\\n\\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\\\n\\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\\n*/\\ntemplate <typename T, typename E>\\nstruct lazySegTree {\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n using P = function<E(E,int)>;\\n F f; G g; H h; P p; T d1; E d0;\\n int n;\\n vector<T> dat;\\n vector<E> lazy;\\n\\n lazySegTree(){}\\n lazySegTree(int n_, F f_, G g_, H h_, \\n T d1_, E d0_, P p_=[](E a, int b){return a;})\\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \\n {\\n n = 1; while(n < n_) n *= 2;\\n dat.assign(n*2, d1);\\n lazy.assign(n*2, d0);\\n }\\n void build(vector<T> v) {\\n REP(i, v.size()) dat[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\\n }\\n\\n // 区間の幅がlenの節点kについて遅延評価\\n inline void eval(int len, int k) {\\n if(lazy[k] == d0) return;\\n if(k*2+1 < n*2-1) {\\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\\n lazy[2*k+2] = h(lazy[k*2+2], rx);\\n }\\n dat[k] = g(dat[k],p(lazy[k],len));\\n lazy[k] = d0;\\n }\\n // [a, b)\\n T update(int a, int b, E x, int k, int l, int r) {\\n eval(r-l, k);\\n if(b <= l || r <= a) return dat[k];\\n if(a <= l && r <= b) {\\n lazy[k] = h(lazy[k], x);\\n return g(dat[k], p(lazy[k],r-l));\\n }\\n int mid = (l+r)/2;\\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\\n update(a, b, rx, 2*k+2, mid, r));\\n }\\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\\n // [a, b)\\n T query(int a, int b, int k, int l, int r) {\\n eval(r-l, k);\\n if(a <= l && r <= b) return dat[k];\\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\\n return query(a, b, 2*k+2, (l+r)/2, r);\\n }\\n T query(int a, int b) { return query(a, b, 0, 0, n); }\\n // デバッグ出力\\n void debug() {\\n cout << \\\"---------------------\\\" << endl;\\n int cnt = 0;\\n for(int i=1; i<=n; i*=2) {\\n REP(j, i) {cout << \\\"(\\\" << dat[cnt] << \\\",\\\" << lazy[cnt] << \\\") \\\"; cnt++;}\\n cout << endl;\\n }\\n cout << \\\"---------------------\\\" << endl;\\n }\\n};\\n\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n, q;\\n cin >> n >> q;\\n HLDecomposition hld(n);\\n REP(i, n-1) {\\n int a, b;\\n cin >> a >> b;\\n hld.add_edge(a, b);\\n }\\n hld.build();\\n\\n auto f = [&](int a, int b){ return (a+b) % MOD; };\\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\\n auto h = [&](PII a, PII b){ \\n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\\n };\\n auto p = [&](PII a, int b){ \\n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \\n };\\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\\n\\n REP(i, q) {\\n int type; cin >> type;\\n if(type == 0) {\\n // sum\\n int s, t;\\n cin >> s >> t;\\n int ans = 0;\\n hld.for_each(s, t, [&](int l, int r){\\n (ans += seg.query(l, r+1)) %= MOD;\\n });\\n cout << (ans+MOD)%MOD << endl;\\n } else {\\n // add\\n int s, t, a, d;\\n cin >> s >> t >> a >> d;\\n hld.for_each(s, t, [&](int l, int r){\\n // 初項と公差の正負を求める\\n int dist1 = hld.distance(s, hld.inv[l]);\\n int dist2 = hld.distance(s, hld.inv[r]);\\n int ta = (a + dist1 * d % MOD) % MOD;\\n int td = d;\\n if(dist1 > dist2) td = MOD-d;\\n // cout << \\\"l=\\\" << l << \\\" r=\\\" << r << \\\" \\\" << ta << \\\" \\\" << td << endl;\\n seg.update(l, r+1, {ta, td});\\n });\\n }\\n\\n // seg.debug();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14893617021276595,\n \"time_ms\": 270,\n \"memory_kb\": 21948,\n \"score_of_the_acc\": -0.0371,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3050_3153918\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing PII = pair<int, int>;\\ntemplate <typename T> using V = vector<T>;\\ntemplate <typename T> using VV = vector<V<T>>;\\ntemplate <typename T> using VVV = vector<VV<T>>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll INF = (1LL<<60);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nstruct HLDecomposition {\\n int n, pos;\\n VV<int> g;\\n V<int> vid, // HL分解後のグラフでのid\\n head, // 頂点が属するheavy-pathのheadのid\\n sub, // 部分木のサイズ\\n hvy, // heavy-path上での次の頂点のid\\n par, // 親のid\\n depth, // 深さ\\n inv, // HL分解前のグラフのid（添え字が分解後のid）\\n type, // 森をHL分解するときの属する木の番号\\n ps, // 行きがけ順\\n pt; // 帰りがけ順\\n\\n HLDecomposition(){}\\n HLDecomposition(int sz):\\n n(sz), pos(0), g(n),\\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\\n\\n // 辺の追加\\n void add_edge(int u, int v) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n // HL分解の構築を行う\\n void build(V<int> rs=V<int>(1,0)) {\\n int c=0;\\n for(int r: rs) {\\n dfs1(r);\\n dfs2(r, c++);\\n }\\n }\\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\\n void dfs1(int rt) {\\n stack<PII> st;\\n par[rt] = -1;\\n depth[rt] = 0;\\n st.emplace(rt, 0);\\n while(st.size()) {\\n int v = st.top().first;\\n int &i = st.top().second;\\n if(i < (int)g[v].size()) {\\n \\tint u = g[v][i++];\\n \\tif(u == par[v]) continue;\\n \\tpar[u] = v;\\n \\tdepth[u] = depth[v]+1;\\n \\tst.emplace(u, 0);\\n } else {\\n \\tst.pop();\\n \\tfor(int &u: g[v]){\\n if(u == par[v]) swap(u, g[v].back());\\n if(u == par[v]) continue;\\n sub[v] += sub[u];\\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\\n \\t}\\n }\\n }\\n }\\n // 根r、c番目の木についてchainについての情報をまとめる\\n void dfs2(int r, int c) {\\n using T = tuple<int, int, int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()) {\\n int v,h;\\n tie(v,h,ignore)=st.top();\\n int &i=get<2>(st.top());\\n if(!i) {\\n type[v]=c;\\n ps[v]=vid[v]=pos++;\\n inv[vid[v]]=v;\\n head[v]=h;\\n hvy[v]=(g[v].empty()?-1:g[v][0]);\\n if(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(int)g[v].size()) {\\n int u=g[v][i++];\\n if(u==par[v]) continue;\\n st.emplace(u,(hvy[v]==u?h:u),0);\\n } else {\\n st.pop();\\n pt[v]=pos;\\n }\\n }\\n }\\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\\n void for_each(int u, int v, const function<void(int,int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\\n f(max(vid[head[v]], vid[u]), vid[v]);\\n if(head[u]!=head[v]) v = par[head[v]];\\n else break;\\n }\\n }\\n // 辺に対する処理 [u,v] 開区間なので注意!!!\\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]) {\\n\\t f(vid[head[v]], vid[v]);\\n v = par[head[v]];\\n } else {\\n\\t if(u!=v) f(vid[u]+1, vid[v]);\\n\\t break;\\n }\\n }\\n }\\n // 頂点u, vのLCA\\n int lca(int u,int v){\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n // 頂点u, vの距離\\n int distance(int u, int v){\\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\\n }\\n};\\n\\n/**\\n* @brief セグメント木\\n* @details 抽象化した遅延セグメント木\\\\n\\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\\\n\\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\\\n\\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\\\n\\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\\\n\\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\\n*/\\ntemplate <typename T, typename E>\\nstruct lazySegTree {\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n using P = function<E(E,int)>;\\n F f; G g; H h; P p; T d1; E d0;\\n int n;\\n vector<T> dat;\\n vector<E> lazy;\\n\\n lazySegTree(){}\\n lazySegTree(int n_, F f_, G g_, H h_, \\n T d1_, E d0_, P p_=[](E a, int b){return a;})\\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \\n {\\n n = 1; while(n < n_) n *= 2;\\n dat.assign(n*2, d1);\\n lazy.assign(n*2, d0);\\n }\\n void build(vector<T> v) {\\n REP(i, v.size()) dat[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\\n }\\n\\n // 区間の幅がlenの節点kについて遅延評価\\n inline void eval(int len, int k) {\\n if(lazy[k] == d0) return;\\n if(k*2+1 < n*2-1) {\\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\\n lazy[2*k+2] = h(lazy[k*2+2], rx);\\n }\\n dat[k] = g(dat[k],p(lazy[k],len));\\n lazy[k] = d0;\\n }\\n // [a, b)\\n T update(int a, int b, E x, int k, int l, int r) {\\n eval(r-l, k);\\n if(b <= l || r <= a) return dat[k];\\n if(a <= l && r <= b) {\\n lazy[k] = h(lazy[k], x);\\n return g(dat[k], p(lazy[k],r-l));\\n }\\n int mid = (l+r)/2;\\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\\n update(a, b, rx, 2*k+2, mid, r));\\n }\\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\\n // [a, b)\\n T query(int a, int b, int k, int l, int r) {\\n eval(r-l, k);\\n if(a <= l && r <= b) return dat[k];\\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\\n return query(a, b, 2*k+2, (l+r)/2, r);\\n }\\n T query(int a, int b) { return query(a, b, 0, 0, n); }\\n // デバッグ出力\\n void debug() {\\n cout << \\\"---------------------\\\" << endl;\\n int cnt = 0;\\n for(int i=1; i<=n; i*=2) {\\n REP(j, i) {cout << \\\"(\\\" << dat[cnt] << \\\",\\\" << lazy[cnt] << \\\") \\\"; cnt++;}\\n cout << endl;\\n }\\n cout << \\\"---------------------\\\" << endl;\\n }\\n};\\n\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n, q;\\n cin >> n >> q;\\n HLDecomposition hld(n);\\n REP(i, n-1) {\\n int a, b;\\n cin >> a >> b;\\n hld.add_edge(a, b);\\n }\\n hld.build();\\n\\n auto f = [&](int a, int b){ return (a+b) % MOD; };\\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\\n auto h = [&](PII a, PII b){ \\n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\\n };\\n auto p = [&](PII a, int b){ \\n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \\n };\\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\\n\\n REP(i, q) {\\n int type; cin >> type;\\n if(type == 0) {\\n // sum\\n int s, t;\\n cin >> s >> t;\\n int ans = 0;\\n hld.for_each(s, t, [&](int l, int r){\\n (ans += seg.query(l, r+1)) %= MOD;\\n });\\n cout << (ans+MOD)%MOD << endl;\\n } else {\\n // add\\n int s, t, a, d;\\n cin >> s >> t >> a >> d;\\n hld.for_each(s, t, [&](int l, int r){\\n // 初項と公差の正負を求める\\n int dist1 = hld.distance(s, hld.inv[l]);\\n int dist2 = hld.distance(s, hld.inv[r]);\\n int ta = a + dist1 * d;\\n int td = d;\\n if(dist1 > dist2) td *= -1;\\n // cout << \\\"l=\\\" << l << \\\" r=\\\" << r << \\\" \\\" << ta << \\\" \\\" << td << endl;\\n seg.update(l, r+1, {ta, td});\\n });\\n }\\n\\n // seg.debug();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14893617021276595,\n \"time_ms\": 280,\n \"memory_kb\": 21944,\n \"score_of_the_acc\": -0.0404,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3050_3153916\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define int ll\\nusing PII = pair<int, int>;\\ntemplate <typename T> using V = vector<T>;\\ntemplate <typename T> using VV = vector<V<T>>;\\ntemplate <typename T> using VVV = vector<VV<T>>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define PB push_back\\n\\nconst ll INF = (1LL<<60);\\nconst int MOD = 1000000007;\\n\\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }\\ntemplate<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }\\ntemplate<class S,class T>\\nostream &operator <<(ostream& out,const pair<S,T>& a){\\n out<<'('<<a.first<<','<<a.second<<')';\\n return out;\\n}\\ntemplate<class T>\\nostream &operator <<(ostream& out,const vector<T>& a){\\n out<<'[';\\n REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}\\n out<<']';\\n return out;\\n}\\n\\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\\n\\nstruct HLDecomposition {\\n int n, pos;\\n VV<int> g;\\n V<int> vid, // HL分解後のグラフでのid\\n head, // 頂点が属するheavy-pathのheadのid\\n sub, // 部分木のサイズ\\n hvy, // heavy-path上での次の頂点のid\\n par, // 親のid\\n depth, // 深さ\\n inv, // HL分解前のグラフのid（添え字が分解後のid）\\n type, // 森をHL分解するときの属する木の番号\\n ps, // 行きがけ順\\n pt; // 帰りがけ順\\n\\n HLDecomposition(){}\\n HLDecomposition(int sz):\\n n(sz), pos(0), g(n),\\n vid(n,-1), head(n), sub(n,1), hvy(n,-1),\\n par(n), depth(n), inv(n), type(n), ps(n), pt(n) {}\\n\\n // 辺の追加\\n void add_edge(int u, int v) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n // HL分解の構築を行う\\n void build(V<int> rs=V<int>(1,0)) {\\n int c=0;\\n for(int r: rs) {\\n dfs1(r);\\n dfs2(r, c++);\\n }\\n }\\n // 根rtからdfsして部分木の大きさ、heavy-edgeの判定などをする\\n void dfs1(int rt) {\\n stack<PII> st;\\n par[rt] = -1;\\n depth[rt] = 0;\\n st.emplace(rt, 0);\\n while(st.size()) {\\n int v = st.top().first;\\n int &i = st.top().second;\\n if(i < (int)g[v].size()) {\\n \\tint u = g[v][i++];\\n \\tif(u == par[v]) continue;\\n \\tpar[u] = v;\\n \\tdepth[u] = depth[v]+1;\\n \\tst.emplace(u, 0);\\n } else {\\n \\tst.pop();\\n \\tfor(int &u: g[v]){\\n if(u == par[v]) swap(u, g[v].back());\\n if(u == par[v]) continue;\\n sub[v] += sub[u];\\n if(sub[u]>sub[g[v].front()]) swap(u, g[v].front());\\n \\t}\\n }\\n }\\n }\\n // 根r、c番目の木についてchainについての情報をまとめる\\n void dfs2(int r, int c) {\\n using T = tuple<int, int, int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()) {\\n int v,h;\\n tie(v,h,ignore)=st.top();\\n int &i=get<2>(st.top());\\n if(!i) {\\n type[v]=c;\\n ps[v]=vid[v]=pos++;\\n inv[vid[v]]=v;\\n head[v]=h;\\n hvy[v]=(g[v].empty()?-1:g[v][0]);\\n if(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(int)g[v].size()) {\\n int u=g[v][i++];\\n if(u==par[v]) continue;\\n st.emplace(u,(hvy[v]==u?h:u),0);\\n } else {\\n st.pop();\\n pt[v]=pos;\\n }\\n }\\n }\\n // 頂点に対する処理 [u,v] 開区間なので注意!!!\\n void for_each(int u, int v, const function<void(int,int)>& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n // [max(vid[head[v]],vid[u]), vid[v]] の区間についての操作を行う\\n f(max(vid[head[v]], vid[u]), vid[v]);\\n if(head[u]!=head[v]) v = par[head[v]];\\n else break;\\n }\\n }\\n // 辺に対する処理 [u,v] 開区間なので注意!!!\\n void for_each_edge(int u, int v, const function<void(int,int)>& f) {\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]) {\\n\\t f(vid[head[v]], vid[v]);\\n v = par[head[v]];\\n } else {\\n\\t if(u!=v) f(vid[u]+1, vid[v]);\\n\\t break;\\n }\\n }\\n }\\n // 頂点u, vのLCA\\n int lca(int u,int v){\\n while(1) {\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n // 頂点u, vの距離\\n int distance(int u, int v){\\n return depth[u] + depth[v] - 2*depth[lca(u,v)];\\n }\\n};\\n\\n/**\\n* @brief セグメント木\\n* @details 抽象化した遅延セグメント木\\\\n\\n* 区間更新区間max d1=d0=INT_MAX f=max(a,b) g=h=(b==INT_MAX?a:b)\\\\n\\n* 区間加算区間和 d1=d0=0 f=g=h=a+b p=a*b\\\\n\\n* 区間加算区間min d1=d0=0 f=min(a,b) g=h=a+b\\\\n\\n* 区間更新区間和 d1=d0=0 f=a+b g=h=(b==0?a:b) p=a*b\\\\n\\n* 区間xor区間和 d1=d0=0 f=a+b g=(b>=1?b-a:a) h=a^b p=a*b\\n*/\\ntemplate <typename T, typename E>\\nstruct lazySegTree {\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n using P = function<E(E,int)>;\\n F f; G g; H h; P p; T d1; E d0;\\n int n;\\n vector<T> dat;\\n vector<E> lazy;\\n\\n lazySegTree(){}\\n lazySegTree(int n_, F f_, G g_, H h_, \\n T d1_, E d0_, P p_=[](E a, int b){return a;})\\n : f(f_), g(g_), h(h_), p(p_), d1(d1_), d0(d0_) \\n {\\n n = 1; while(n < n_) n *= 2;\\n dat.assign(n*2, d1);\\n lazy.assign(n*2, d0);\\n }\\n void build(vector<T> v) {\\n REP(i, v.size()) dat[i+n-1] = v[i];\\n for(int i=n-2; i>=0; --i) dat[i] = f(dat[i*2+1], dat[i*2+2]);\\n }\\n\\n // 区間の幅がlenの節点kについて遅延評価\\n inline void eval(int len, int k) {\\n if(lazy[k] == d0) return;\\n if(k*2+1 < n*2-1) {\\n lazy[2*k+1] = h(lazy[k*2+1], lazy[k]);\\n E rx = {(lazy[k].first + len/2*lazy[k].second%MOD) % MOD, lazy[k].second};\\n lazy[2*k+2] = h(lazy[k*2+2], rx);\\n }\\n dat[k] = g(dat[k],p(lazy[k],len));\\n lazy[k] = d0;\\n }\\n // [a, b)\\n T update(int a, int b, E x, int k, int l, int r) {\\n eval(r-l, k);\\n if(b <= l || r <= a) return dat[k];\\n if(a <= l && r <= b) {\\n lazy[k] = h(lazy[k], x);\\n return g(dat[k], p(lazy[k],r-l));\\n }\\n int mid = (l+r)/2;\\n E rx = {(x.first + max(0LL, mid-a)*x.second%MOD)%MOD, x.second};\\n return dat[k] = f(update(a, b, x, 2*k+1, l, mid),\\n update(a, b, rx, 2*k+2, mid, r));\\n }\\n T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }\\n // [a, b)\\n T query(int a, int b, int k, int l, int r) {\\n eval(r-l, k);\\n if(a <= l && r <= b) return dat[k];\\n bool left = !((l+r)/2 <= a || b <= l), right = !(r <= 1 || b <= (l+r)/2);\\n if(left&&right) return f(query(a, b, 2*k+1, l, (l+r)/2), query(a, b, 2*k+2, (l+r)/2, r));\\n if(left) return query(a, b, 2*k+1, l, (l+r)/2);\\n return query(a, b, 2*k+2, (l+r)/2, r);\\n }\\n T query(int a, int b) { return query(a, b, 0, 0, n); }\\n // デバッグ出力\\n void debug() {\\n cout << \\\"---------------------\\\" << endl;\\n int cnt = 0;\\n for(int i=1; i<=n; i*=2) {\\n REP(j, i) {cout << \\\"(\\\" << dat[cnt] << \\\",\\\" << lazy[cnt] << \\\") \\\"; cnt++;}\\n cout << endl;\\n }\\n cout << \\\"---------------------\\\" << endl;\\n }\\n};\\n\\nsigned main(void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n, q;\\n cin >> n >> q;\\n HLDecomposition hld(n);\\n REP(i, n-1) {\\n int a, b;\\n cin >> a >> b;\\n hld.add_edge(a, b);\\n }\\n hld.build();\\n\\n auto f = [&](int a, int b){ return (a+b) % MOD; };\\n auto g = [&](int a, PII b){ return (a+b.first) % MOD; };\\n auto h = [&](PII a, PII b){ \\n return make_pair((a.first+b.first)%MOD, (a.second+b.second)%MOD);\\n };\\n auto p = [&](PII a, int b){ \\n return make_pair((a.first*b%MOD + b*(b-1)/2%MOD*a.second%MOD) % MOD, 0LL); \\n };\\n lazySegTree<int, PII> seg(n, f, g, h, 0, {0, 0}, p);\\n\\n REP(i, q) {\\n int type; cin >> type;\\n if(type == 0) {\\n // sum\\n int s, t;\\n cin >> s >> t;\\n int ans = 0;\\n hld.for_each(s, t, [&](int l, int r){\\n (ans += seg.query(l, r+1)) %= MOD;\\n });\\n cout << ans << endl;\\n } else {\\n // add\\n int s, t, a, d;\\n cin >> s >> t >> a >> d;\\n hld.for_each(s, t, [&](int l, int r){\\n // 初項と公差の正負を求める\\n int dist1 = hld.distance(s, hld.inv[l]);\\n int dist2 = hld.distance(s, hld.inv[r]);\\n int ta = a + dist1 * d;\\n int td = d;\\n if(dist1 > dist2) td *= -1;\\n // cout << \\\"l=\\\" << l << \\\" r=\\\" << r << \\\" \\\" << ta << \\\" \\\" << td << endl;\\n seg.update(l, r+1, {ta, td});\\n });\\n }\\n\\n // seg.debug();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.14893617021276595,\n \"time_ms\": 280,\n \"memory_kb\": 22000,\n \"score_of_the_acc\": -0.041,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3050_3152337\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct HLDecomposition {\\n int n,pos;\\n vector<vector<int> > G;\\n vector<int> vid, head, sub, par, dep, inv, type;\\n \\n HLDecomposition(){}\\n HLDecomposition(int n):\\n n(n),pos(0),G(n),vid(n,-1),head(n),sub(n,1),\\n par(n,-1),dep(n,0),inv(n),type(n){}\\n \\n void add_edge(int u, int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n void build(vector<int> rs={0}) {\\n int c=0;\\n for(int r:rs){\\n dfs_sz(r);\\n head[r]=r;\\n dfs_hld(r,c++);\\n }\\n }\\n \\n void dfs_sz(int v) {\\n for(int &u:G[v]){\\n if(u==par[v]) continue;\\n par[u]=v;\\n dep[u]=dep[v]+1;\\n dfs_sz(u); \\n sub[v]+=sub[u]; \\n if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]);\\n }\\n }\\n\\n void dfs_hld(int v,int c) {\\n vid[v]=pos++;\\n inv[vid[v]]=v;\\n type[v]=c;\\n for(int u:G[v]){\\n if(u==par[v]) continue;\\n head[u]=(u==G[v][0]?head[v]:u);\\n dfs_hld(u,c);\\n } \\n }\\n \\n // for_each(vertex)\\n // [l,r] <- attention!! \\n template<typename F>\\n void for_each(int u, int v, const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n f(max(vid[head[v]],vid[u]),vid[v]);\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n }\\n\\n template<typename T,typename Q,typename F>\\n T for_each(int u,int v,T ti,const Q &q,const F &f){\\n T l=ti,r=ti;\\n while(1){\\n if(vid[u]>vid[v]){\\n\\tswap(u,v);\\n\\tswap(l,r);\\n }\\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n return f(l,r);\\n }\\n \\n // for_each(edge)\\n // [l,r] <- attention!!\\n template<typename F>\\n void for_each_edge(int u, int v,const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]){\\n\\tf(vid[head[v]],vid[v]);\\n v=par[head[v]];\\n }else{\\n\\tif(u!=v) f(vid[u]+1,vid[v]);\\n\\tbreak;\\n }\\n }\\n }\\n \\n int lca(int u,int v){\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v=par[head[v]];\\n }\\n }\\n\\n int distance(int u,int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n};\\n\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n\\ntemplate<int MOD = 1000000007>\\nstruct Mint{\\n int v;\\n Mint():v(0){}\\n Mint(int v):v(v){}\\n Mint(int v,bool f):v(v){if(f) v%=MOD;}\\n\\n Mint pow(int k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n \\n Mint inv(){return pow(MOD-2);}\\n \\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n \\n Mint operator+(Mint a){return Mint(v)+=a;};\\n Mint operator-(Mint a){return Mint(v)-=a;};\\n Mint operator*(Mint a){return Mint(v)*=a;};\\n Mint operator/(Mint a){return Mint(v)/=a;};\\n\\n Mint operator-(){return v?MOD-v:v;}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n \\n vector<Mint> fact(int n){\\n vector<Mint> res(n+1,1);\\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\\n return res;\\n }\\n \\n vector<Mint> finv(int n){\\n vector<Mint> res(n+1,1);\\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\\n res[n]=Mint(1)/res[n];\\n for(int i=n;i>=1;i--) res[i-1]=res[i]*Mint(i);\\n return res;\\n }\\n\\n vector<Mint> invs(vector<Mint> &a,vector<Mint> &b){\\n int n=a.size()-1;\\n vector<Mint> res(n+1,0);\\n for(int i=1;i<=n;i++) res[i]=b[i]*a[i-1];\\n return res;\\n }\\n};\\n\\ntemplate<int MOD>\\nistream& operator>>(istream &is, Mint<MOD>& a){\\n is>>a.v;\\n return is;\\n} \\ntemplate<int MOD>\\nostream& operator<<(ostream &os, Mint<MOD>& a){\\n os<<a.v;\\n return os;\\n} \\n\\n//INSERT ABOVE HERE\\nconst int MOD = 1e9+7;\\nsigned main(){ \\n using M = Mint<MOD>;\\n \\n int n,q;\\n scanf(\\\"%d %d\\\",&n,&q);\\n \\n HLDecomposition hld(n);\\n for(int i=1;i<n;i++){\\n int a,b;\\n scanf(\\\"%d %d\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.build();\\n\\n \\n struct T{\\n int l,r;\\n M s;\\n T(){}\\n T(int l,int r,M s):l(l),r(r),s(s){};\\n };\\n \\n struct P{\\n M a,b;\\n P(){}\\n P(M a,M b):a(a),b(b){};\\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n auto f=[&](T a,T b){return T(a.l,b.r,a.s+b.s);};\\n auto g=[&](T a,P b){\\n\\t M k(a.r-a.l);\\n\\t M t(1LL*(a.r-a.l)*(a.r-a.l-1)/2,1);\\n\\t b.b=(b.b+M(a.l)*b.a)*k;\\n\\t a.s+=t*b.a+b.b;\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(a.a+b.a,a.b+b.b);};\\n \\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,M()),P(M(),M()));\\n vector<T> vt(n);\\n for(int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\\n seg.build(n,vt);\\n \\n for(int i=0;i<q;i++){\\n int c,s,t;\\n scanf(\\\"%d %d %d\\\",&c,&s,&t);\\n int l=hld.lca(s,t);\\n \\n if(c==1){\\n M b,a;\\n scanf(\\\"%d %d\\\",&b.v,&a.v);\\n M up=b-M(hld.dep[s])*-a;\\n M dw=b+M(hld.distance(s,t))*a-M(hld.dep[t])*a;\\n hld.for_each(l,s,[&](int l,int r){seg.update(l,r+1,P(-a,up));});\\n hld.for_each_edge(l,t,[&](int l,int r){seg.update(l,r+1,P(a,dw));}); \\n }else{ \\n auto ask=[&](int l,int r){return seg.query(l,r+1);};\\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\\n printf(\\\"%d\\\\n\\\",ans.s.v);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 22052,\n \"score_of_the_acc\": -0.3512,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3050_3152335\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct HLDecomposition {\\n int n,pos;\\n vector<vector<int> > G;\\n vector<int> vid, head, sub, par, dep, inv, type;\\n \\n HLDecomposition(){}\\n HLDecomposition(int n):\\n n(n),pos(0),G(n),vid(n,-1),head(n),sub(n,1),\\n par(n,-1),dep(n,0),inv(n),type(n){}\\n \\n void add_edge(int u, int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n void build(vector<int> rs={0}) {\\n int c=0;\\n for(int r:rs){\\n dfs_sz(r);\\n head[r]=r;\\n dfs_hld(r,c++);\\n }\\n }\\n \\n void dfs_sz(int v) {\\n for(int &u:G[v]){\\n if(u==par[v]) continue;\\n par[u]=v;\\n dep[u]=dep[v]+1;\\n dfs_sz(u); \\n sub[v]+=sub[u]; \\n if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]);\\n }\\n }\\n\\n void dfs_hld(int v,int c) {\\n vid[v]=pos++;\\n inv[vid[v]]=v;\\n type[v]=c;\\n for(int u:G[v]){\\n if(u==par[v]) continue;\\n head[u]=(u==G[v][0]?head[v]:u);\\n dfs_hld(u,c);\\n } \\n }\\n \\n // for_each(vertex)\\n // [l,r] <- attention!! \\n template<typename F>\\n void for_each(int u, int v, const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n f(max(vid[head[v]],vid[u]),vid[v]);\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n }\\n\\n template<typename T,typename Q,typename F>\\n T for_each(int u,int v,T ti,const Q &q,const F &f){\\n T l=ti,r=ti;\\n while(1){\\n if(vid[u]>vid[v]){\\n\\tswap(u,v);\\n\\tswap(l,r);\\n }\\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n return f(l,r);\\n }\\n \\n // for_each(edge)\\n // [l,r] <- attention!!\\n template<typename F>\\n void for_each_edge(int u, int v,const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]){\\n\\tf(vid[head[v]],vid[v]);\\n v=par[head[v]];\\n }else{\\n\\tif(u!=v) f(vid[u]+1,vid[v]);\\n\\tbreak;\\n }\\n }\\n }\\n \\n int lca(int u,int v){\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v=par[head[v]];\\n }\\n }\\n\\n int distance(int u,int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n};\\n\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(int n_, vector<T> v){\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(int a,int b,E x){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(int a,int b){\\n a+=n;b+=n-1;\\n for(int i=height;i;i--) eval(a>>i);\\n for(int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n\\ntemplate<int MOD = 1000000007>\\nstruct Mint{\\n int v;\\n Mint():v(0){}\\n Mint(int v):v(v){}\\n Mint(int v,bool f):v(v){if(f) v%=MOD;}\\n\\n Mint pow(int k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n \\n Mint inv(){return pow(MOD-2);}\\n \\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n \\n Mint operator+(Mint a){return Mint(v)+=a;};\\n Mint operator-(Mint a){return Mint(v)-=a;};\\n Mint operator*(Mint a){return Mint(v)*=a;};\\n Mint operator/(Mint a){return Mint(v)/=a;};\\n\\n Mint operator-(){return v?MOD-v:v;}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n \\n vector<Mint> fact(int n){\\n vector<Mint> res(n+1,1);\\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\\n return res;\\n }\\n \\n vector<Mint> finv(int n){\\n vector<Mint> res(n+1,1);\\n for(int i=1;i<=n;i++) res[i]=res[i-1]*Mint(i);\\n res[n]=Mint(1)/res[n];\\n for(int i=n;i>=1;i--) res[i-1]=res[i]*Mint(i);\\n return res;\\n }\\n\\n vector<Mint> invs(vector<Mint> &a,vector<Mint> &b){\\n int n=a.size()-1;\\n vector<Mint> res(n+1,0);\\n for(int i=1;i<=n;i++) res[i]=b[i]*a[i-1];\\n return res;\\n }\\n};\\n\\ntemplate<int MOD>\\nistream& operator>>(istream &is, Mint<MOD>& a){\\n is>>a.v;\\n return is;\\n} \\ntemplate<int MOD>\\nostream& operator<<(ostream &os, Mint<MOD>& a){\\n os<<a.v;\\n return os;\\n} \\n\\n//INSERT ABOVE HERE\\nsigned main(){ \\n constexpr int MOD = 1e9+7;\\n using M = Mint<MOD>;\\n \\n int n,q;\\n scanf(\\\"%d %d\\\",&n,&q);\\n \\n HLDecomposition hld(n);\\n for(int i=1;i<n;i++){\\n int a,b;\\n scanf(\\\"%d %d\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.build();\\n\\n \\n struct T{\\n int l,r;\\n M s;\\n T(){}\\n T(int l,int r,M s):l(l),r(r),s(s){};\\n };\\n \\n struct P{\\n M a,b;\\n P(){}\\n P(M a,M b):a(a),b(b){};\\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n auto f=[&](T a,T b){return T(a.l,b.r,a.s+b.s);};\\n auto g=[&](T a,P b){\\n\\t M k(a.r-a.l);\\n\\t M t(1LL*(a.r-a.l)*(a.r-a.l-1)/2,1);\\n\\t b.b=(b.b+M(a.l)*b.a)*k;\\n\\t a.s+=t*b.a+b.b;\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(a.a+b.a,a.b+b.b);};\\n \\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,M()),P(M(),M()));\\n vector<T> vt(n);\\n for(int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\\n seg.build(n,vt);\\n \\n for(int i=0;i<q;i++){\\n int c,s,t;\\n scanf(\\\"%d %d %d\\\",&c,&s,&t);\\n int l=hld.lca(s,t);\\n \\n if(c==1){\\n M b,a;\\n scanf(\\\"%d %d\\\",&b.v,&a.v);\\n M up=b-M(hld.dep[s])*-a;\\n M dw=b+M(hld.distance(s,t))*a-M(hld.dep[t])*a;\\n hld.for_each(l,s,[&](int l,int r){seg.update(l,r+1,P(-a,up));});\\n hld.for_each_edge(l,t,[&](int l,int r){seg.update(l,r+1,P(a,dw));}); \\n }else{ \\n auto ask=[&](int l,int r){return seg.query(l,r+1);};\\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\\n printf(\\\"%d\\\\n\\\",ans.s.v);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 22056,\n \"score_of_the_acc\": -0.3547,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3050_3147910\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct HLDecomposition {\\n Int n,pos;\\n vector<vector<Int> > G;\\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\\n \\n HLDecomposition(){}\\n HLDecomposition(Int sz):\\n n(sz),pos(0),G(n),\\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\\n par(n),dep(n),inv(n),type(n){}\\n \\n void add_edge(Int u, Int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n void build(vector<Int> rs={0}) {\\n Int c=0;\\n for(Int r:rs){\\n dfs(r);\\n bfs(r, c++);\\n }\\n }\\n \\n void dfs(Int rt) {\\n using T = pair<Int, Int>;\\n stack<T> st;\\n par[rt]=-1;\\n dep[rt]=0;\\n st.emplace(rt,0);\\n while(!st.empty()){\\n Int v=st.top().first;\\n Int &i=st.top().second;\\n if(i<(Int)G[v].size()){\\n\\tInt u=G[v][i++];\\n\\tif(u==par[v]) continue;\\n\\tpar[u]=v;\\n\\tdep[u]=dep[v]+1;\\n\\tst.emplace(u,0);\\n }else{\\n\\tst.pop();\\n\\tfor(Int j=0;j<(Int)G[v].size();j++){\\n\\t Int &u=G[v][j];\\n\\t if(u==par[v]) swap(u,G[v].back());\\n\\t if(u==par[v]) continue;\\n\\t sub[v]+=sub[u];\\n\\t if(sub[u]>sub[G[v].front()]) swap(u,G[v].front());\\n\\t}\\n }\\n }\\n }\\n\\n void bfs(Int r,Int c) {\\n using T = tuple<Int, Int, Int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()){\\n Int v,h;\\n tie(v,h,ignore)=st.top();\\n Int &i=get<2>(st.top());\\n if(!i){\\n\\ttype[v]=c;\\n\\tvid[v]=pos++;\\n\\tinv[vid[v]]=v;\\n\\thead[v]=h;\\n hvy[v]=(G[v].empty()?-1:G[v][0]);\\n\\tif(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(Int)G[v].size()){\\n\\tInt u=G[v][i++];\\n\\tif(u==par[v]) continue;\\n\\tst.emplace(u,(hvy[v]==u?h:u),0);\\n }else{\\n\\tst.pop();\\n }\\n }\\n }\\n \\n // for_each(vertex)\\n // [l,r] <- attention!! \\n template<typename F>\\n void for_each(Int u, Int v, const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n f(max(vid[head[v]],vid[u]),vid[v]);\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n }\\n\\n template<typename T,typename Q,typename F>\\n T for_each(Int u,Int v,T ti,const Q &q,const F &f){\\n T l=ti,r=ti;\\n while(1){\\n if(vid[u]>vid[v]){\\n\\tswap(u,v);\\n\\tswap(l,r);\\n }\\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n return f(l,r);\\n }\\n \\n // for_each(edge)\\n // [l,r] <- attention!!\\n template<typename F>\\n void for_each_edge(Int u, Int v,const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]){\\n\\tf(vid[head[v]],vid[v]);\\n v=par[head[v]];\\n }else{\\n\\tif(u!=v) f(vid[u]+1,vid[v]);\\n\\tbreak;\\n }\\n }\\n }\\n\\n Int lca(Int u,Int v){\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v=par[head[v]];\\n }\\n }\\n\\n Int distance(Int u,Int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n};\\n\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n Int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(Int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(Int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(Int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(Int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(Int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(Int a,Int b,E x){\\n a+=n;b+=n-1;\\n for(Int i=height;i;i--) eval(a>>i);\\n for(Int i=height;i;i--) eval(b>>i);\\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(Int a,Int b){\\n a+=n;b+=n-1;\\n for(Int i=height;i;i--) eval(a>>i);\\n for(Int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\n\\nconst Int MOD = 1e9+7;\\n\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n \\n HLDecomposition hld(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.build();\\n \\n auto add=[](Int a,Int b){return (a+b)%MOD;};\\n auto mul=[](Int a,Int b){return (a*b)%MOD;};\\n\\n struct T{\\n Int l,r,s;\\n T(){}\\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\\n };\\n struct P{\\n Int a,b;\\n P(){}\\n P(Int a,Int b):a(a),b(b){};\\n bool operator==(const P &x)const{return a==x.a&&b==x.b;}\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n \\n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\\n auto g=[&](T a,P b){\\n\\t Int k=a.r-a.l;\\n\\t b.b=add(b.b,a.l*b.a)*k;\\n\\t a.s=add(a.s,add(mul(k*(k-1)/2%MOD,b.a),b.b));\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\\n\\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,0),P(0,0));\\n vector<T> vt(n);\\n for(Int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\\n seg.build(n,vt);\\n \\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=hld.lca(s,t);\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n Int up=(b+MOD-hld.dep[s]*(MOD-a)%MOD)%MOD;\\n Int dw=(b+hld.distance(s,t)*a%MOD+MOD-hld.dep[t]*a%MOD)%MOD; \\n hld.for_each(l,s,[&](Int l,Int r){seg.update(l,r+1,P(MOD-a,up));});\\n hld.for_each_edge(l,t,[&](Int l,Int r){seg.update(l,r+1,P(a,dw));}); \\n }else{ \\n auto ask=[&](Int l,Int r){return seg.query(l,r+1);};\\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\\n printf(\\\"%lld\\\\n\\\",(ans.s+MOD)%MOD);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 29720,\n \"score_of_the_acc\": -0.3234,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3050_3147828\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n\\nstruct TousaSegmentTree {\\n int n;\\n vector<ll> sum, lastval;\\n vector<ll> rangeadd;\\n TousaSegmentTree(int _n){\\n n = 1;\\n while(n<_n+1)n<<=1;\\n sum.assign(2*n-1,0ll);\\n lastval.assign(2*n-1,0ll);\\n rangeadd.assign(2*n-1,0ll);\\n }\\n void push(int a, int b, int k){\\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\\n if(k<n-1){\\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\\n }\\n rangeadd[k] = 0;\\n }\\n void _add(int l, int r, ll x, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return;\\n if(l<=a && b<=r){\\n (rangeadd[k] += x) %= MOD;\\n push(a,b,k);\\n }else{\\n int m = (a+b)/2;\\n _add(l,r,x,a,m,2*k+1);\\n _add(l,r,x,m,b,2*k+2);\\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\\n }\\n }\\n void addTousa(int l, int r, ll a, ll b){\\n _add(l,l+1,a,0,n,0);\\n _add(l+1,r,b,0,n,0);\\n _add(r,r+1,MOD-(a+(r-l-1)*b)%MOD,0,n,0);\\n }\\n ll sumTousa(int l, int r, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return 0ll;\\n if(l<=a && b<=r){\\n return sum[k];\\n }else{\\n int m = (a+b)/2;\\n ll lsum = sumTousa(l,r,a,m,2*k+1);\\n ll rsum = sumTousa(l,r,m,b,2*k+2);\\n int rcnt = max(0,min(r,b)-max(l,m));\\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\\n }\\n }\\n ll sumTousa(int l, int r){\\n return sumTousa(l,r,0,n,0);\\n }\\n};\\n\\nstruct HeavyLightDecomposition {\\n int n;\\n vector<vector<int>> g;\\n vector<int> depth, parent, csize;\\n vector<vector<int>> chains;\\n vector<int> chainid, chainpos;\\n int root = 0;\\n HeavyLightDecomposition(int _n){\\n n = _n;\\n g.resize(n);\\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\\n chainid.assign(n,-1); chainpos.assign(n,-1);\\n }\\n void add_edge(int a, int b){\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n void dfs(int p, int bef, int d){\\n depth[p] = d;\\n csize[p] = 1;\\n for(int to : g[p])if(to!=bef){\\n dfs(to, p, d+1);\\n parent[to] = p;\\n csize[p] += csize[to];\\n }\\n }\\n void dfs2(int p, int bef, int id){\\n chainid[p] = id;\\n chainpos[p] = chains[id].size();\\n chains[id].push_back(p);\\n for(int to : g[p])if(to!=bef){\\n if(csize[to]*2 >= csize[p]){\\n // heavy\\n dfs2(to, p, id);\\n }else{\\n // light\\n chains.push_back(vector<int>());\\n dfs2(to, p, chains.size()-1);\\n }\\n }\\n }\\n void construct(){\\n dfs(root,-1,0);\\n chains.push_back(vector<int>());\\n dfs2(root,-1,0);\\n }\\n int lca(int a, int b){\\n while(a != b){\\n if(depth[a] < depth[b])swap(a,b);\\n if(chainid[a] == chainid[b])return b;\\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\\n a = chains[chainid[a]].front();\\n a = parent[a];\\n }\\n return a;\\n }\\n};\\n\\nint main(){\\n int n,q;\\n scanf(\\\"%d%d\\\",&n,&q);\\n HeavyLightDecomposition hld(n);\\n REP(i,n-1){\\n int a,b;\\n scanf(\\\"%d%d\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.construct();\\n\\n vector<TousaSegmentTree> segs;\\n REP(i,hld.chains.size()){\\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\\n }\\n\\n while(q--){\\n int typ,s,t;\\n scanf(\\\"%d%d%d\\\",&typ,&s,&t);\\n int lca = hld.lca(s,t);\\n if(typ == 0){\\n // sum\\n ll ans = 0;\\n while(true){\\n int id = hld.chainid[s];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n while(true){\\n int id = hld.chainid[t];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }else{\\n // add\\n ll a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n while(true){\\n int id = hld.chainid[s];\\n int r = hld.chainpos[s]+1;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca];\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n (a += (r-l)*b) %= MOD;\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n int rest = hld.depth[t] - hld.depth[lca];\\n (a += (rest-1)*b) %= MOD;\\n b = MOD-b;\\n while(true){\\n int id = hld.chainid[t];\\n int r = hld.chainpos[t]+1;\\n if(t == lca)break;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca] + 1;\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 36580,\n \"score_of_the_acc\": -0.2403,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3050_3147766\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)\\n\\n#define CHMIN(a,b) (a)=min((a),(b))\\n#define CHMAX(a,b) (a)=max((a),(b))\\n\\n#define MOD 1000000007\\n\\nstruct TousaSegmentTree {\\n int n;\\n vector<ll> sum, lastval;\\n vector<ll> rangeadd;\\n TousaSegmentTree(int _n){\\n n = 1;\\n while(n<_n+1)n<<=1;\\n sum.assign(2*n-1,0ll);\\n lastval.assign(2*n-1,0ll);\\n rangeadd.assign(2*n-1,0ll);\\n }\\n void push(int a, int b, int k){\\n (sum[k] += (ll)(b-a) * (b-a+1) / 2 % MOD * rangeadd[k] % MOD) %= MOD;\\n (lastval[k] += (ll)(b-a) * rangeadd[k]) %= MOD;\\n if(k<n-1){\\n (rangeadd[2*k+1] += rangeadd[k]) %= MOD;\\n (rangeadd[2*k+2] += rangeadd[k]) %= MOD;\\n }\\n rangeadd[k] = 0;\\n }\\n void _add(int l, int r, ll x, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return;\\n if(l<=a && b<=r){\\n (rangeadd[k] += x) %= MOD;\\n push(a,b,k);\\n }else{\\n int m = (a+b)/2;\\n _add(l,r,x,a,m,2*k+1);\\n _add(l,r,x,m,b,2*k+2);\\n (sum[k] = sum[2*k+1] + sum[2*k+2] + lastval[2*k+1]*(b-m)) %= MOD;\\n (lastval[k] = lastval[2*k+1] + lastval[2*k+2]) %= MOD;\\n }\\n }\\n void addTousa(int l, int r, ll a, ll b){\\n _add(l,l+1,a,0,n,0);\\n _add(l+1,r,b,0,n,0);\\n _add(r,r+1,-a-(r-l-1)*b,0,n,0);\\n }\\n ll sumTousa(int l, int r, int a, int b, int k){\\n push(a,b,k);\\n if(r<=a || b<=l)return 0ll;\\n if(l<=a && b<=r){\\n return sum[k];\\n }else{\\n int m = (a+b)/2;\\n ll lsum = sumTousa(l,r,a,m,2*k+1);\\n ll rsum = sumTousa(l,r,m,b,2*k+2);\\n int rcnt = max(0,min(r,b)-max(l,m));\\n return (lsum + rsum + lastval[2*k+1]*rcnt) % MOD;\\n }\\n }\\n ll sumTousa(int l, int r){\\n return sumTousa(l,r,0,n,0);\\n }\\n};\\n\\nstruct HeavyLightDecomposition {\\n int n;\\n vector<vector<int>> g;\\n vector<int> depth, parent, csize;\\n vector<vector<int>> chains;\\n vector<int> chainid, chainpos;\\n int root = 0;\\n HeavyLightDecomposition(int _n){\\n n = _n;\\n g.resize(n);\\n depth.assign(n,-1); parent.assign(n,-1); csize.assign(n,0);\\n chainid.assign(n,-1); chainpos.assign(n,-1);\\n }\\n void add_edge(int a, int b){\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n void dfs(int p, int bef, int d){\\n depth[p] = d;\\n csize[p] = 1;\\n for(int to : g[p])if(to!=bef){\\n dfs(to, p, d+1);\\n parent[to] = p;\\n csize[p] += csize[to];\\n }\\n }\\n void dfs2(int p, int bef, int id){\\n chainid[p] = id;\\n chainpos[p] = chains[id].size();\\n chains[id].push_back(p);\\n for(int to : g[p])if(to!=bef){\\n if(csize[to]*2 >= csize[p]){\\n // heavy\\n dfs2(to, p, id);\\n }else{\\n // light\\n chains.push_back(vector<int>());\\n dfs2(to, p, chains.size()-1);\\n }\\n }\\n }\\n void construct(){\\n dfs(root,-1,0);\\n chains.push_back(vector<int>());\\n dfs2(root,-1,0);\\n }\\n int lca(int a, int b){\\n while(a != b){\\n if(depth[a] < depth[b])swap(a,b);\\n if(chainid[a] == chainid[b])return b;\\n if(depth[chains[chainid[a]].front()] < depth[chains[chainid[b]].front()])swap(a,b);\\n a = chains[chainid[a]].front();\\n a = parent[a];\\n }\\n return a;\\n }\\n};\\n\\nint main(){\\n int n,q;\\n scanf(\\\"%d%d\\\",&n,&q);\\n HeavyLightDecomposition hld(n);\\n REP(i,n-1){\\n int a,b;\\n scanf(\\\"%d%d\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.construct();\\n\\n vector<TousaSegmentTree> segs;\\n REP(i,hld.chains.size()){\\n segs.push_back(TousaSegmentTree(hld.chains[i].size()));\\n }\\n\\n while(q--){\\n int typ,s,t;\\n scanf(\\\"%d%d%d\\\",&typ,&s,&t);\\n int lca = hld.lca(s,t);\\n if(typ == 0){\\n // printf(\\\"%d: %d %d\\\\n\\\",typ,s,t);\\n // sum\\n ll ans = 0;\\n while(true){\\n int id = hld.chainid[s];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca], hld.chainpos[s]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[s]+1)) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n while(true){\\n int id = hld.chainid[t];\\n if(id == hld.chainid[lca]){\\n (ans += segs[id].sumTousa(hld.chainpos[lca]+1, hld.chainpos[t]+1)) %= MOD;\\n break;\\n }\\n (ans += segs[id].sumTousa(0, hld.chainpos[t]+1)) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n printf(\\\"%lld\\\\n\\\",ans);\\n }else{\\n // add\\n ll a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n // printf(\\\"%d: %d %d %lld %lld\\\\n\\\",typ,s,t,a,b);\\n while(true){\\n int id = hld.chainid[s];\\n int r = hld.chainpos[s]+1;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca];\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n (a += (r-l)*b) %= MOD;\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n s = hld.chains[id].front();\\n s = hld.parent[s];\\n }\\n int rest = hld.depth[t] - hld.depth[lca];\\n (a += (rest-1)*b) %= MOD;\\n b = MOD-b;\\n while(true){\\n int id = hld.chainid[t];\\n int r = hld.chainpos[t]+1;\\n if(t == lca)break;\\n if(id == hld.chainid[lca]){\\n int l = hld.chainpos[lca] + 1;\\n segs[id].addTousa(l, r, (a+(r-l-1)*b)%MOD, MOD-b);\\n break;\\n }\\n segs[id].addTousa(0, r, (a+(r-1)*b)%MOD, MOD-b);\\n (a += r*b) %= MOD;\\n t = hld.chains[id].front();\\n t = hld.parent[t];\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3404255319148936,\n \"time_ms\": 240,\n \"memory_kb\": 36244,\n \"score_of_the_acc\": -0.1696,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3050_3145827\",\n \"code_snippet\": \"#include <limits>\\n#include <stack>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <functional>\\n#include <iostream>\\n#include <queue>\\n#include <iterator>\\n#include <cstdint>\\n#include <utility>\\n#include <type_traits>\\n#include <cstddef>\\nnamespace loquat {\\ntemplate <int MOD>\\nclass modulus_integer {\\npublic:\\n\\ttypedef modulus_integer<MOD> self_type;\\nprivate:\\n\\tint m_value;\\n\\tstatic self_type unsafe_construct(int x) noexcept {\\n\\t\\tself_type y;\\n\\t\\ty.m_value = x;\\n\\t\\treturn y;\\n\\t}\\npublic:\\n\\tmodulus_integer() noexcept\\n\\t\\t: m_value(0)\\n\\t{ }\\n\\tmodulus_integer(int x) noexcept\\n\\t\\t: m_value(x % MOD)\\n\\t{\\n\\t\\tif(m_value < 0){ m_value += MOD; }\\n\\t}\\n\\tint operator*() const noexcept { return m_value; }\\n\\tself_type& operator=(const self_type& x) noexcept {\\n\\t\\tm_value = x.m_value;\\n\\t\\treturn *this;\\n\\t}\\n\\tself_type operator-() const noexcept {\\n\\t\\treturn unsafe_construct(m_value > 0 ? MOD - m_value : 0);\\n\\t}\\n\\tself_type operator+(const self_type& x) const noexcept {\\n\\t\\tconst int y = m_value + x.m_value;\\n\\t\\treturn unsafe_construct(y >= MOD ? y - MOD : y);\\n\\t}\\n\\tself_type operator*(const self_type& x) const noexcept {\\n\\t\\treturn unsafe_construct(\\n\\t\\t\\tstatic_cast<long long>(m_value) * x.m_value % MOD);\\n\\t}\\n};\\ntemplate <int MOD>\\ninline std::ostream& operator<<(\\n\\tstd::ostream& os, const modulus_integer<MOD>& x)\\n{\\n\\tos << *x;\\n\\treturn os;\\n}\\n}\\nnamespace loquat {\\nnamespace bitmanip {\\ntemplate <typename T>\\ninline auto clz(T x) noexcept ->\\n\\ttypename std::enable_if<sizeof(int) < sizeof(T), unsigned int>::type\\n{\\n\\treturn __builtin_clzll(x);\\n}\\ntemplate <typename T>\\ninline T clp2(T x) noexcept {\\n\\tif(x == 0u){ return 0u; }\\n\\treturn T(1u) << (sizeof(T) * 8u - clz(x - 1));\\n}\\n}\\n}\\nnamespace loquat {\\ntemplate <typename Impl>\\nclass lazy_range_query_behavior_wrapper {\\npublic:\\n\\tusing value_type = typename Impl::value_type;\\n\\tusing modifier_type = typename Impl::modifier_type;\\nprivate:\\n\\ttemplate <typename T>\\n\\tstruct no_reverse_value {\\n\\tprivate:\\n\\t\\tstatic std::true_type check_unary(...);\\n\\t\\tstatic std::true_type check_binary(...);\\n\\tpublic:\\n\\t\\tstatic const bool value =\\n\\t\\t\\tdecltype(check_unary(std::declval<T>()))::value &&\\n\\t\\t\\tdecltype(check_binary(std::declval<T>()))::value;\\n\\t};\\n\\tImpl m_impl;\\n\\ttemplate <typename T>\\n\\tstatic auto split_modifier_helper(\\n\\t\\tconst T& impl, const modifier_type& m, size_t k)\\n\\t\\t-> decltype(impl.split_modifier(m, k))\\n\\t{\\n\\t\\treturn impl.split_modifier(m, k);\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto modify_helper(\\n\\t\\tconst T& impl, size_t n, const value_type& v, const modifier_type& m)\\n\\t\\t-> decltype(impl.modify(n, v, m))\\n\\t{\\n\\t\\treturn impl.modify(n, v, m);\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto reverse_value_helper(const T&, size_t, const value_type& x)\\n\\t\\t-> typename std::enable_if<no_reverse_value<T>::value, value_type>::type\\n\\t{\\n\\t\\treturn x;\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto reverse_modifier_helper(const T& impl, size_t n, const modifier_type& m)\\n\\t\\t-> decltype(impl.reverse_modifier(n, m))\\n\\t{\\n\\t\\treturn impl.reverse_modifier(n, m);\\n\\t}\\npublic:\\n\\tlazy_range_query_behavior_wrapper(Impl impl) : m_impl(std::move(impl)) { }\\n\\tvalue_type identity_value() const {\\n\\t\\treturn m_impl.identity_value();\\n\\t}\\n\\tmodifier_type identity_modifier() const {\\n\\t\\treturn m_impl.identity_modifier();\\n\\t}\\n\\tstd::pair<modifier_type, modifier_type>\\n\\tsplit_modifier(const modifier_type& m, size_t k) const {\\n\\t\\treturn split_modifier_helper(m_impl, m, k);\\n\\t}\\n\\tmodifier_type merge_modifier(\\n\\t\\tconst modifier_type& a, const modifier_type& b) const\\n\\t{\\n\\t\\treturn m_impl.merge_modifier(a, b);\\n\\t}\\n\\tvalue_type merge_value(\\n\\t\\tconst value_type& a, const value_type& b) const\\n\\t{\\n\\t\\treturn m_impl.merge_value(a, b);\\n\\t}\\n\\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\\n\\t\\treturn modify_helper(m_impl, n, v, m);\\n\\t}\\n\\tvalue_type reverse_value(size_t n, const value_type& m) const {\\n\\t\\treturn reverse_value_helper(m_impl, n, m);\\n\\t}\\n\\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\\n\\t\\treturn reverse_modifier_helper(m_impl, n, m);\\n\\t}\\n};\\n}\\nnamespace loquat {\\ntemplate <typename Behavior>\\nclass lazy_segment_tree {\\npublic:\\n\\tusing behavior_type = Behavior;\\n\\tusing value_type = typename behavior_type::value_type;\\n\\tusing modifier_type = typename behavior_type::modifier_type;\\nprivate:\\n\\tsize_t m_actual_size;\\n\\tstd::vector<value_type> m_values;\\n\\tstd::vector<modifier_type> m_modifiers;\\n\\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\\n\\tvoid initialize(){\\n\\t\\tconst int n = m_values.size() / 2;\\n\\t\\tfor(int i = n - 1; i >= 0; --i){\\n\\t\\t\\tm_values[i] = m_behavior.merge_value(\\n\\t\\t\\t\\tm_values[i * 2 + 1], m_values[i * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tvalue_type modify(\\n\\t\\tsize_t a, size_t b, size_t k, size_t l, size_t r,\\n\\t\\tconst modifier_type& modifier)\\n\\t{\\n\\t\\tif(r <= a || b <= l){\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}else if(a <= l && r <= b){\\n\\t\\t\\tm_modifiers[k] =\\n\\t\\t\\t\\tm_behavior.merge_modifier(m_modifiers[k], modifier);\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}\\n\\t\\tconst size_t c = l + (r - l) / 2;\\n\\t\\tconst size_t lk = k * 2 + 1, rk = lk + 1;\\n\\t\\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\\n\\t\\tm_modifiers[k] = m_behavior.identity_modifier();\\n\\t\\tmodify(l, c, lk, l, c, mp.first);\\n\\t\\tmodify(c, r, rk, c, r, mp.second);\\n\\t\\tconst auto mq = (a < c)\\n\\t\\t\\t? m_behavior.split_modifier(modifier, c - std::max(a, l))\\n\\t\\t\\t: std::make_pair(m_behavior.identity_modifier(), modifier);\\n\\t\\tconst auto vl = modify(a, b, lk, l, c, mq.first);\\n\\t\\tconst auto vr = modify(a, b, rk, c, r, mq.second);\\n\\t\\tm_values[k] = m_behavior.merge_value(vl, vr);\\n\\t\\treturn m_values[k];\\n\\t}\\n\\tvalue_type query(size_t a, size_t b, size_t k, size_t l, size_t r){\\n\\t\\tif(r <= a || b <= l){\\n\\t\\t\\treturn m_behavior.identity_value();\\n\\t\\t}else if(a <= l && r <= b){\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}\\n\\t\\tconst size_t c = l + (r - l) / 2;\\n\\t\\tconst size_t lk = k * 2 + 1, rk = k * 2 + 2;\\n\\t\\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\\n\\t\\tm_values[k] = m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\tm_modifiers[k] = m_behavior.identity_modifier();\\n\\t\\tmodify(l, c, lk, l, c, mp.first);\\n\\t\\tmodify(c, r, rk, c, r, mp.second);\\n\\t\\tconst auto vl = query(a, b, lk, l, c);\\n\\t\\tconst auto vr = query(a, b, rk, c, r);\\n\\t\\treturn m_behavior.merge_value(vl, vr);\\n\\t}\\npublic:\\n\\tlazy_segment_tree(\\n\\t\\tsize_t size,\\n\\t\\tconst behavior_type& behavior = behavior_type())\\n\\t\\t: m_actual_size(size)\\n\\t\\t, m_values(bitmanip::clp2(size) * 2 - 1, behavior.identity_value())\\n\\t\\t, m_modifiers(m_values.size(), behavior.identity_modifier())\\n\\t\\t, m_behavior(behavior)\\n\\t{\\n\\t\\tinitialize();\\n\\t}\\n\\tvoid modify(size_t left, size_t right, const modifier_type& modifier){\\n\\t\\tconst auto clp2_n = (m_values.size() + 1) / 2;\\n\\t\\tmodify(left, right, 0, 0, clp2_n, modifier);\\n\\t}\\n\\tvalue_type query(size_t left, size_t right){\\n\\t\\tconst auto clp2_n = (m_values.size() + 1) / 2;\\n\\t\\treturn query(left, right, 0, 0, clp2_n);\\n\\t}\\n};\\n}\\nnamespace loquat {\\nusing vertex_t = size_t;\\n}\\nnamespace loquat {\\nnamespace edge_param {\\nstruct to_ {\\n\\tvertex_t to;\\n\\texplicit to_(vertex_t t = 0)\\n\\t\\t: to(t)\\n\\t{ }\\n};\\n}\\nnamespace detail {\\ntemplate <typename T, typename... Params>\\nstruct edge_param_wrapper : public T, edge_param_wrapper<Params...> {\\n};\\ntemplate <typename T>\\nstruct edge_param_wrapper<T> : public T {\\n\\ttemplate <typename U>\\n\\texplicit edge_param_wrapper(U&& x)\\n\\t\\t: T(std::forward<U>(x))\\n\\t{ }\\n};\\n}\\ntemplate <typename... Params>\\nstruct edge : public detail::edge_param_wrapper<edge_param::to_, Params...> {\\n\\ttemplate <typename... Args>\\n\\texplicit edge(Args&&... args)\\n\\t\\t: detail::edge_param_wrapper<edge_param::to_, Params...>(\\n\\t\\t\\tstd::forward<Args>(args)...)\\n\\t{ }\\n};\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType>\\nclass adjacency_list {\\npublic:\\n\\tusing edge_type = EdgeType;\\n\\tusing edge_list = std::vector<edge_type>;\\nprivate:\\n\\tstd::vector<std::vector<EdgeType>> m_edges;\\npublic:\\n\\texplicit adjacency_list(size_t n)\\n\\t\\t: m_edges(n)\\n\\t{ }\\n\\tsize_t size() const {\\n\\t\\treturn m_edges.size();\\n\\t}\\n\\tconst edge_list& operator[](vertex_t u) const {\\n\\t\\treturn m_edges[u];\\n\\t}\\n\\ttemplate <typename... Args>\\n\\tvoid add_edge(vertex_t from, Args&&... args){\\n\\t\\tm_edges[from].emplace_back(std::forward<Args>(args)...);\\n\\t}\\n};\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType, typename F>\\nvoid breadth_first_search(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root,\\n\\tstd::vector<bool>& vis,\\n\\tF func)\\n{\\n\\tstd::queue<vertex_t> q;\\n\\tq.push(root);\\n\\tvis[root] = true;\\n\\twhile(!q.empty()){\\n\\t\\tconst auto u = q.front();\\n\\t\\tq.pop();\\n\\t\\tfor(const auto& e : g[u]){\\n\\t\\t\\tconst auto v = e.to;\\n\\t\\t\\tif(vis[v]){ continue; }\\n\\t\\t\\tfunc(u, e);\\n\\t\\t\\tvis[v] = true;\\n\\t\\t\\tq.push(v);\\n\\t\\t}\\n\\t}\\n}\\ntemplate <typename EdgeType, typename F>\\nvoid breadth_first_search(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root,\\n\\tF func)\\n{\\n\\tstd::vector<bool> vis(g.size());\\n\\tbreadth_first_search(g, root, vis, func);\\n}\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType>\\nstd::vector<size_t> compute_subtree_sizes(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root)\\n{\\n\\tconst size_t n = g.size();\\n\\tstd::vector<vertex_t> order;\\n\\torder.reserve(n);\\n\\torder.push_back(root);\\n\\tbreadth_first_search(g, root, [&order](vertex_t, const EdgeType& e){\\n\\t\\torder.push_back(e.to);\\n\\t});\\n\\tstd::vector<size_t> result(n);\\n\\tstd::reverse(order.begin(), order.end());\\n\\tfor(const auto u : order){\\n\\t\\tsize_t sum = 1;\\n\\t\\tfor(const auto& e : g[u]){\\n\\t\\t\\tsum += result[e.to];\\n\\t\\t}\\n\\t\\tresult[u] = sum;\\n\\t}\\n\\treturn result;\\n}\\n}\\nnamespace loquat {\\nclass heavy_light_decomposition {\\npublic:\\n\\tusing index_type = size_t;\\n\\tstruct segment {\\n\\t\\tindex_type path_id;\\n\\t\\tindex_type first;\\n\\t\\tindex_type last;\\n\\t\\tsegment(index_type p, index_type f, index_type l)\\n\\t\\t\\t: path_id(p), first(f), last(l)\\n\\t\\t{ }\\n\\t};\\nprivate:\\n\\tstruct path {\\n\\t\\tvertex_t parent;\\n\\t\\tsize_t rank;\\n\\t\\tstd::vector<vertex_t> vertices;\\n\\t};\\n\\tstd::vector<path> m_paths;\\n\\tstd::vector<index_type> m_vertex2path;\\n\\tstd::vector<index_type> m_vertex2index;\\npublic:\\n\\ttemplate <typename EdgeType>\\n\\texplicit heavy_light_decomposition(\\n\\t\\tconst adjacency_list<EdgeType>& graph,\\n\\t\\tvertex_t root = 0)\\n\\t\\t: m_paths()\\n\\t\\t, m_vertex2path(graph.size())\\n\\t\\t, m_vertex2index(graph.size())\\n\\t{\\n\\t\\tstruct frame_type {\\n\\t\\t\\tvertex_t u;\\n\\t\\t\\tvertex_t p;\\n\\t\\t\\tframe_type() : u(0), p(0) { }\\n\\t\\t\\tframe_type(vertex_t u, vertex_t p) : u(u), p(p) { }\\n\\t\\t};\\n\\t\\tconst vertex_t nil = std::numeric_limits<vertex_t>::max();\\n\\t\\tconst auto subtree_sizes = compute_subtree_sizes(graph, root);\\n\\t\\tstd::stack<frame_type> frame_stack;\\n\\t\\tframe_stack.emplace(root, nil);\\n\\t\\twhile(!frame_stack.empty()){\\n\\t\\t\\tconst auto f = frame_stack.top();\\n\\t\\t\\tframe_stack.pop();\\n\\t\\t\\tconst index_type path_id = m_paths.size();\\n\\t\\t\\tpath p;\\n\\t\\t\\tp.parent = f.p;\\n\\t\\t\\tp.rank = (f.p != nil ? m_paths[m_vertex2path[f.p]].rank + 1 : 0);\\n\\t\\t\\tvertex_t cur = f.u;\\n\\t\\t\\twhile(cur != nil){\\n\\t\\t\\t\\tconst auto ss = subtree_sizes[cur];\\n\\t\\t\\t\\tconst auto threshold = ss / 2;\\n\\t\\t\\t\\tm_vertex2path[cur] = path_id;\\n\\t\\t\\t\\tm_vertex2index[cur] = p.vertices.size();\\n\\t\\t\\t\\tp.vertices.push_back(cur);\\n\\t\\t\\t\\tvertex_t heavy_edge = nil;\\n\\t\\t\\t\\tfor(const auto& e : graph[cur]){\\n\\t\\t\\t\\t\\tconst auto v = e.to;\\n\\t\\t\\t\\t\\tif(subtree_sizes[v] > subtree_sizes[cur]){ continue; }\\n\\t\\t\\t\\t\\tif(heavy_edge == nil && subtree_sizes[v] >= threshold){\\n\\t\\t\\t\\t\\t\\theavy_edge = v;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tframe_stack.emplace(v, cur);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcur = heavy_edge;\\n\\t\\t\\t}\\n\\t\\t\\tm_paths.push_back(p);\\n\\t\\t}\\n\\t}\\n\\tsize_t count_heavy_paths() const {\\n\\t\\treturn m_paths.size();\\n\\t}\\n\\tsize_t path_length(index_type p) const {\\n\\t\\treturn m_paths[p].vertices.size();\\n\\t}\\n\\tindex_type path_id(vertex_t v) const {\\n\\t\\treturn m_vertex2path[v];\\n\\t}\\n\\tindex_type local_index(vertex_t v) const {\\n\\t\\treturn m_vertex2index[v];\\n\\t}\\n\\tstd::vector<segment> shortest_path(vertex_t s, vertex_t t) const {\\n\\t\\tstd::vector<segment> s_segments, t_segments;\\n\\t\\tindex_type s_path = path_id(s), s_index = local_index(s);\\n\\t\\tindex_type t_path = path_id(t), t_index = local_index(t);\\n\\t\\twhile(s_path != t_path){\\n\\t\\t\\tconst size_t s_rank = m_paths[s_path].rank;\\n\\t\\t\\tconst size_t t_rank = m_paths[t_path].rank;\\n\\t\\t\\tif(s_rank >= t_rank){\\n\\t\\t\\t\\tconst auto parent = m_paths[s_path].parent;\\n\\t\\t\\t\\ts_segments.push_back(segment(s_path, s_index, 0));\\n\\t\\t\\t\\ts_path = path_id(parent);\\n\\t\\t\\t\\ts_index = local_index(parent);\\n\\t\\t\\t}\\n\\t\\t\\tif(t_rank >= s_rank){\\n\\t\\t\\t\\tconst auto parent = m_paths[t_path].parent;\\n\\t\\t\\t\\tt_segments.push_back(segment(t_path, 0, t_index));\\n\\t\\t\\t\\tt_path = path_id(parent);\\n\\t\\t\\t\\tt_index = local_index(parent);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::vector<segment> result(s_segments);\\n\\t\\tresult.emplace_back(s_path, s_index, t_index);\\n\\t\\tstd::reverse(t_segments.begin(), t_segments.end());\\n\\t\\tfor(const auto& s : t_segments){ result.push_back(s); }\\n\\t\\treturn result;\\n\\t}\\n};\\ntemplate <typename RangeQueryable>\\nclass lazy_vertex_path_queryable_tree {\\npublic:\\n\\tusing range_queryable_type = RangeQueryable;\\n\\tusing behavior_type = typename range_queryable_type::behavior_type;\\n\\tusing value_type = typename behavior_type::value_type;\\n\\tusing modifier_type = typename behavior_type::modifier_type;\\nprivate:\\n\\theavy_light_decomposition m_decomposition;\\n\\tstd::vector<range_queryable_type> m_range_queryables;\\n\\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\\npublic:\\n\\ttemplate <typename EdgeType>\\n\\texplicit lazy_vertex_path_queryable_tree(\\n\\t\\tconst adjacency_list<EdgeType>& graph,\\n\\t\\tvertex_t root = 0,\\n\\t\\tconst behavior_type& behavior = behavior_type())\\n\\t\\t: m_decomposition(graph, root)\\n\\t\\t, m_range_queryables()\\n\\t\\t, m_behavior(behavior)\\n\\t{\\n\\t\\tconst size_t n_paths = m_decomposition.count_heavy_paths();\\n\\t\\tm_range_queryables.reserve(n_paths);\\n\\t\\tfor(size_t i = 0; i < n_paths; ++i){\\n\\t\\t\\tm_range_queryables.emplace_back(\\n\\t\\t\\t\\tm_decomposition.path_length(i), behavior);\\n\\t\\t}\\n\\t}\\n\\tvoid modify(vertex_t s, vertex_t t, const modifier_type& m){\\n\\t\\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\\n\\t\\tmodifier_type modifier = m;\\n\\t\\tfor(const auto& s : shortest_path){\\n\\t\\t\\tconst auto path_id = s.path_id;\\n\\t\\t\\tconst auto lo = std::min(s.first, s.last);\\n\\t\\t\\tconst auto hi = std::max(s.first, s.last) + 1;\\n\\t\\t\\tconst auto modifier_pair =\\n\\t\\t\\t\\tm_behavior.split_modifier(modifier, hi - lo);\\n\\t\\t\\tconst auto head_modifier = s.first > s.last\\n\\t\\t\\t\\t? m_behavior.reverse_modifier(hi - lo, modifier_pair.first)\\n\\t\\t\\t\\t: modifier_pair.first;\\n\\t\\t\\tm_range_queryables[path_id].modify(lo, hi, head_modifier);\\n\\t\\t\\tmodifier = modifier_pair.second;\\n\\t\\t}\\n\\t}\\n\\tvalue_type query(vertex_t s, vertex_t t){\\n\\t\\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\\n\\t\\tvalue_type acc = m_behavior.identity_value();\\n\\t\\tfor(const auto& s : shortest_path){\\n\\t\\t\\tconst auto path_id = s.path_id;\\n\\t\\t\\tconst auto lo = std::min(s.first, s.last);\\n\\t\\t\\tconst auto hi = std::max(s.first, s.last) + 1;\\n\\t\\t\\tconst auto partial = m_range_queryables[path_id].query(lo, hi);\\n\\t\\t\\tconst auto directed_partial = s.first > s.last\\n\\t\\t\\t\\t? m_behavior.reverse_value(hi - lo, partial)\\n\\t\\t\\t\\t: partial;\\n\\t\\t\\tacc = m_behavior.merge_value(acc, directed_partial);\\n\\t\\t}\\n\\t\\treturn acc;\\n\\t}\\n};\\n}\\nusing namespace std;\\nstatic const int MOD = 1000000007;\\nusing mint = loquat::modulus_integer<MOD>;\\nusing edge = loquat::edge<>;\\nstruct lazy_range_query_behavior {\\n\\tusing value_type = mint;\\n\\tusing modifier_type = pair<mint, mint>;\\n\\tvalue_type identity_value() const { return 0; }\\n\\tmodifier_type identity_modifier() const { return make_pair(0, 0); }\\n\\tstd::pair<modifier_type, modifier_type>\\n\\tsplit_modifier(const modifier_type& m, size_t k) const {\\n\\t\\treturn make_pair(\\n\\t\\t\\tmodifier_type(m.first, m.second),\\n\\t\\t\\tmodifier_type(m.first + m.second * k, m.second));\\n\\t}\\n\\tmodifier_type merge_modifier(const modifier_type& a, const modifier_type& b) const {\\n\\t\\treturn modifier_type(a.first + b.first, a.second + b.second);\\n\\t}\\n\\tvalue_type merge_value(const value_type& a, const value_type& b) const {\\n\\t\\treturn a + b;\\n\\t}\\n\\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\\n\\t\\treturn v + m.first * n + m.second * (n * (n - 1) / 2);\\n\\t}\\n\\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\\n\\t\\treturn modifier_type(m.first + m.second * (n - 1), -m.second);\\n\\t}\\n};\\nusing lazy_segment_tree = loquat::lazy_segment_tree<lazy_range_query_behavior>;\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tint n, q;\\n\\tcin >> n >> q;\\n\\tloquat::adjacency_list<edge> g(n);\\n\\tfor(int i = 1; i < n; ++i){\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tg.add_edge(a, b);\\n\\t\\tg.add_edge(b, a);\\n\\t}\\n\\tloquat::lazy_vertex_path_queryable_tree<lazy_segment_tree> lqt(g);\\n\\twhile(q--){\\n\\t\\tint type;\\n\\t\\tcin >> type;\\n\\t\\tif(type == 0){\\n\\t\\t\\tint s, t;\\n\\t\\t\\tcin >> s >> t;\\n\\t\\t\\tcout << lqt.query(s, t) << endl;\\n\\t\\t}else{\\n\\t\\t\\tint s, t, k, m;\\n\\t\\t\\tcin >> s >> t >> k >> m;\\n\\t\\t\\tlqt.modify(s, t, make_pair(k, m));\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 29344,\n \"score_of_the_acc\": -0.1378,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3050_3145821\",\n \"code_snippet\": \"#include <limits>\\n#include <string>\\n#include <vector>\\n#include <iostream>\\n#include <queue>\\n#include <iterator>\\n#include <cstdint>\\n#include <algorithm>\\n#include <stack>\\n#include <type_traits>\\n#include <cstddef>\\n#include <utility>\\nnamespace loquat {\\nnamespace bitmanip {\\ntemplate <typename T>\\ninline auto clz(T x) noexcept ->\\n\\ttypename std::enable_if<sizeof(int) < sizeof(T), unsigned int>::type\\n{\\n\\treturn __builtin_clzll(x);\\n}\\ntemplate <typename T>\\ninline T clp2(T x) noexcept {\\n\\tif(x == 0u){ return 0u; }\\n\\treturn T(1u) << (sizeof(T) * 8u - clz(x - 1));\\n}\\n}\\n}\\nnamespace loquat {\\ntemplate <typename Impl>\\nclass lazy_range_query_behavior_wrapper {\\npublic:\\n\\tusing value_type = typename Impl::value_type;\\n\\tusing modifier_type = typename Impl::modifier_type;\\nprivate:\\n\\ttemplate <typename T>\\n\\tstruct no_reverse_value {\\n\\tprivate:\\n\\t\\tstatic std::true_type check_unary(...);\\n\\t\\tstatic std::true_type check_binary(...);\\n\\tpublic:\\n\\t\\tstatic const bool value =\\n\\t\\t\\tdecltype(check_unary(std::declval<T>()))::value &&\\n\\t\\t\\tdecltype(check_binary(std::declval<T>()))::value;\\n\\t};\\n\\tImpl m_impl;\\n\\ttemplate <typename T>\\n\\tstatic auto split_modifier_helper(\\n\\t\\tconst T& impl, const modifier_type& m, size_t k)\\n\\t\\t-> decltype(impl.split_modifier(m, k))\\n\\t{\\n\\t\\treturn impl.split_modifier(m, k);\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto modify_helper(\\n\\t\\tconst T& impl, size_t n, const value_type& v, const modifier_type& m)\\n\\t\\t-> decltype(impl.modify(n, v, m))\\n\\t{\\n\\t\\treturn impl.modify(n, v, m);\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto reverse_value_helper(const T&, size_t, const value_type& x)\\n\\t\\t-> typename std::enable_if<no_reverse_value<T>::value, value_type>::type\\n\\t{\\n\\t\\treturn x;\\n\\t}\\n\\ttemplate <typename T>\\n\\tstatic auto reverse_modifier_helper(const T& impl, size_t n, const modifier_type& m)\\n\\t\\t-> decltype(impl.reverse_modifier(n, m))\\n\\t{\\n\\t\\treturn impl.reverse_modifier(n, m);\\n\\t}\\npublic:\\n\\tlazy_range_query_behavior_wrapper(Impl impl) : m_impl(std::move(impl)) { }\\n\\tvalue_type identity_value() const {\\n\\t\\treturn m_impl.identity_value();\\n\\t}\\n\\tmodifier_type identity_modifier() const {\\n\\t\\treturn m_impl.identity_modifier();\\n\\t}\\n\\tstd::pair<modifier_type, modifier_type>\\n\\tsplit_modifier(const modifier_type& m, size_t k) const {\\n\\t\\treturn split_modifier_helper(m_impl, m, k);\\n\\t}\\n\\tmodifier_type merge_modifier(\\n\\t\\tconst modifier_type& a, const modifier_type& b) const\\n\\t{\\n\\t\\treturn m_impl.merge_modifier(a, b);\\n\\t}\\n\\tvalue_type merge_value(\\n\\t\\tconst value_type& a, const value_type& b) const\\n\\t{\\n\\t\\treturn m_impl.merge_value(a, b);\\n\\t}\\n\\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\\n\\t\\treturn modify_helper(m_impl, n, v, m);\\n\\t}\\n\\tvalue_type reverse_value(size_t n, const value_type& m) const {\\n\\t\\treturn reverse_value_helper(m_impl, n, m);\\n\\t}\\n\\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\\n\\t\\treturn reverse_modifier_helper(m_impl, n, m);\\n\\t}\\n};\\n}\\nnamespace loquat {\\ntemplate <typename Behavior>\\nclass lazy_segment_tree {\\npublic:\\n\\tusing behavior_type = Behavior;\\n\\tusing value_type = typename behavior_type::value_type;\\n\\tusing modifier_type = typename behavior_type::modifier_type;\\nprivate:\\n\\tsize_t m_actual_size;\\n\\tstd::vector<value_type> m_values;\\n\\tstd::vector<modifier_type> m_modifiers;\\n\\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\\n\\tvoid initialize(){\\n\\t\\tconst int n = m_values.size() / 2;\\n\\t\\tfor(int i = n - 1; i >= 0; --i){\\n\\t\\t\\tm_values[i] = m_behavior.merge_value(\\n\\t\\t\\t\\tm_values[i * 2 + 1], m_values[i * 2 + 2]);\\n\\t\\t}\\n\\t}\\n\\tvalue_type modify(\\n\\t\\tsize_t a, size_t b, size_t k, size_t l, size_t r,\\n\\t\\tconst modifier_type& modifier)\\n\\t{\\n\\t\\tif(r <= a || b <= l){\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}else if(a <= l && r <= b){\\n\\t\\t\\tm_modifiers[k] =\\n\\t\\t\\t\\tm_behavior.merge_modifier(m_modifiers[k], modifier);\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}\\n\\t\\tconst size_t c = l + (r - l) / 2;\\n\\t\\tconst size_t lk = k * 2 + 1, rk = lk + 1;\\n\\t\\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\\n\\t\\tm_modifiers[k] = m_behavior.identity_modifier();\\n\\t\\tmodify(l, c, lk, l, c, mp.first);\\n\\t\\tmodify(c, r, rk, c, r, mp.second);\\n\\t\\tconst auto mq = (a < c)\\n\\t\\t\\t? m_behavior.split_modifier(modifier, c - std::max(a, l))\\n\\t\\t\\t: std::make_pair(m_behavior.identity_modifier(), modifier);\\n\\t\\tconst auto vl = modify(a, b, lk, l, c, mq.first);\\n\\t\\tconst auto vr = modify(a, b, rk, c, r, mq.second);\\n\\t\\tm_values[k] = m_behavior.merge_value(vl, vr);\\n\\t\\treturn m_values[k];\\n\\t}\\n\\tvalue_type query(size_t a, size_t b, size_t k, size_t l, size_t r){\\n\\t\\tif(r <= a || b <= l){\\n\\t\\t\\treturn m_behavior.identity_value();\\n\\t\\t}else if(a <= l && r <= b){\\n\\t\\t\\treturn m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\t}\\n\\t\\tconst size_t c = l + (r - l) / 2;\\n\\t\\tconst size_t lk = k * 2 + 1, rk = k * 2 + 2;\\n\\t\\tconst auto mp = m_behavior.split_modifier(m_modifiers[k], c - l);\\n\\t\\tm_values[k] = m_behavior.modify(r - l, m_values[k], m_modifiers[k]);\\n\\t\\tm_modifiers[k] = m_behavior.identity_modifier();\\n\\t\\tmodify(l, c, lk, l, c, mp.first);\\n\\t\\tmodify(c, r, rk, c, r, mp.second);\\n\\t\\tconst auto vl = query(a, b, lk, l, c);\\n\\t\\tconst auto vr = query(a, b, rk, c, r);\\n\\t\\treturn m_behavior.merge_value(vl, vr);\\n\\t}\\npublic:\\n\\tlazy_segment_tree(\\n\\t\\tsize_t size,\\n\\t\\tconst behavior_type& behavior = behavior_type())\\n\\t\\t: m_actual_size(size)\\n\\t\\t, m_values(bitmanip::clp2(size) * 2 - 1, behavior.identity_value())\\n\\t\\t, m_modifiers(m_values.size(), behavior.identity_modifier())\\n\\t\\t, m_behavior(behavior)\\n\\t{\\n\\t\\tinitialize();\\n\\t}\\n\\tvoid modify(size_t left, size_t right, const modifier_type& modifier){\\n\\t\\tconst auto clp2_n = (m_values.size() + 1) / 2;\\n\\t\\tmodify(left, right, 0, 0, clp2_n, modifier);\\n\\t}\\n\\tvalue_type query(size_t left, size_t right){\\n\\t\\tconst auto clp2_n = (m_values.size() + 1) / 2;\\n\\t\\treturn query(left, right, 0, 0, clp2_n);\\n\\t}\\n};\\n}\\nnamespace loquat {\\nusing vertex_t = size_t;\\n}\\nnamespace loquat {\\nnamespace edge_param {\\nstruct to_ {\\n\\tvertex_t to;\\n\\texplicit to_(vertex_t t = 0)\\n\\t\\t: to(t)\\n\\t{ }\\n};\\n}\\nnamespace detail {\\ntemplate <typename T, typename... Params>\\nstruct edge_param_wrapper : public T, edge_param_wrapper<Params...> {\\n};\\ntemplate <typename T>\\nstruct edge_param_wrapper<T> : public T {\\n\\ttemplate <typename U>\\n\\texplicit edge_param_wrapper(U&& x)\\n\\t\\t: T(std::forward<U>(x))\\n\\t{ }\\n};\\n}\\ntemplate <typename... Params>\\nstruct edge : public detail::edge_param_wrapper<edge_param::to_, Params...> {\\n\\ttemplate <typename... Args>\\n\\texplicit edge(Args&&... args)\\n\\t\\t: detail::edge_param_wrapper<edge_param::to_, Params...>(\\n\\t\\t\\tstd::forward<Args>(args)...)\\n\\t{ }\\n};\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType>\\nclass adjacency_list {\\npublic:\\n\\tusing edge_type = EdgeType;\\n\\tusing edge_list = std::vector<edge_type>;\\nprivate:\\n\\tstd::vector<std::vector<EdgeType>> m_edges;\\npublic:\\n\\texplicit adjacency_list(size_t n)\\n\\t\\t: m_edges(n)\\n\\t{ }\\n\\tsize_t size() const {\\n\\t\\treturn m_edges.size();\\n\\t}\\n\\tconst edge_list& operator[](vertex_t u) const {\\n\\t\\treturn m_edges[u];\\n\\t}\\n\\ttemplate <typename... Args>\\n\\tvoid add_edge(vertex_t from, Args&&... args){\\n\\t\\tm_edges[from].emplace_back(std::forward<Args>(args)...);\\n\\t}\\n};\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType, typename F>\\nvoid breadth_first_search(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root,\\n\\tstd::vector<bool>& vis,\\n\\tF func)\\n{\\n\\tstd::queue<vertex_t> q;\\n\\tq.push(root);\\n\\tvis[root] = true;\\n\\twhile(!q.empty()){\\n\\t\\tconst auto u = q.front();\\n\\t\\tq.pop();\\n\\t\\tfor(const auto& e : g[u]){\\n\\t\\t\\tconst auto v = e.to;\\n\\t\\t\\tif(vis[v]){ continue; }\\n\\t\\t\\tfunc(u, e);\\n\\t\\t\\tvis[v] = true;\\n\\t\\t\\tq.push(v);\\n\\t\\t}\\n\\t}\\n}\\ntemplate <typename EdgeType, typename F>\\nvoid breadth_first_search(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root,\\n\\tF func)\\n{\\n\\tstd::vector<bool> vis(g.size());\\n\\tbreadth_first_search(g, root, vis, func);\\n}\\n}\\nnamespace loquat {\\ntemplate <typename EdgeType>\\nstd::vector<size_t> compute_subtree_sizes(\\n\\tconst adjacency_list<EdgeType>& g,\\n\\tvertex_t root)\\n{\\n\\tconst size_t n = g.size();\\n\\tstd::vector<vertex_t> order;\\n\\torder.reserve(n);\\n\\torder.push_back(root);\\n\\tbreadth_first_search(g, root, [&order](vertex_t, const EdgeType& e){\\n\\t\\torder.push_back(e.to);\\n\\t});\\n\\tstd::vector<size_t> result(n);\\n\\tstd::reverse(order.begin(), order.end());\\n\\tfor(const auto u : order){\\n\\t\\tsize_t sum = 1;\\n\\t\\tfor(const auto& e : g[u]){\\n\\t\\t\\tsum += result[e.to];\\n\\t\\t}\\n\\t\\tresult[u] = sum;\\n\\t}\\n\\treturn result;\\n}\\n}\\nnamespace loquat {\\nclass heavy_light_decomposition {\\npublic:\\n\\tusing index_type = size_t;\\n\\tstruct segment {\\n\\t\\tindex_type path_id;\\n\\t\\tindex_type first;\\n\\t\\tindex_type last;\\n\\t\\tsegment(index_type p, index_type f, index_type l)\\n\\t\\t\\t: path_id(p), first(f), last(l)\\n\\t\\t{ }\\n\\t};\\nprivate:\\n\\tstruct path {\\n\\t\\tvertex_t parent;\\n\\t\\tsize_t rank;\\n\\t\\tstd::vector<vertex_t> vertices;\\n\\t};\\n\\tstd::vector<path> m_paths;\\n\\tstd::vector<index_type> m_vertex2path;\\n\\tstd::vector<index_type> m_vertex2index;\\npublic:\\n\\ttemplate <typename EdgeType>\\n\\texplicit heavy_light_decomposition(\\n\\t\\tconst adjacency_list<EdgeType>& graph,\\n\\t\\tvertex_t root = 0)\\n\\t\\t: m_paths()\\n\\t\\t, m_vertex2path(graph.size())\\n\\t\\t, m_vertex2index(graph.size())\\n\\t{\\n\\t\\tstruct frame_type {\\n\\t\\t\\tvertex_t u;\\n\\t\\t\\tvertex_t p;\\n\\t\\t\\tframe_type() : u(0), p(0) { }\\n\\t\\t\\tframe_type(vertex_t u, vertex_t p) : u(u), p(p) { }\\n\\t\\t};\\n\\t\\tconst vertex_t nil = std::numeric_limits<vertex_t>::max();\\n\\t\\tconst auto subtree_sizes = compute_subtree_sizes(graph, root);\\n\\t\\tstd::stack<frame_type> frame_stack;\\n\\t\\tframe_stack.emplace(root, nil);\\n\\t\\twhile(!frame_stack.empty()){\\n\\t\\t\\tconst auto f = frame_stack.top();\\n\\t\\t\\tframe_stack.pop();\\n\\t\\t\\tconst index_type path_id = m_paths.size();\\n\\t\\t\\tpath p;\\n\\t\\t\\tp.parent = f.p;\\n\\t\\t\\tp.rank = (f.p != nil ? m_paths[m_vertex2path[f.p]].rank + 1 : 0);\\n\\t\\t\\tvertex_t cur = f.u;\\n\\t\\t\\twhile(cur != nil){\\n\\t\\t\\t\\tconst auto ss = subtree_sizes[cur];\\n\\t\\t\\t\\tconst auto threshold = ss / 2;\\n\\t\\t\\t\\tm_vertex2path[cur] = path_id;\\n\\t\\t\\t\\tm_vertex2index[cur] = p.vertices.size();\\n\\t\\t\\t\\tp.vertices.push_back(cur);\\n\\t\\t\\t\\tvertex_t heavy_edge = nil;\\n\\t\\t\\t\\tfor(const auto& e : graph[cur]){\\n\\t\\t\\t\\t\\tconst auto v = e.to;\\n\\t\\t\\t\\t\\tif(subtree_sizes[v] > subtree_sizes[cur]){ continue; }\\n\\t\\t\\t\\t\\tif(heavy_edge == nil && subtree_sizes[v] >= threshold){\\n\\t\\t\\t\\t\\t\\theavy_edge = v;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tframe_stack.emplace(v, cur);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcur = heavy_edge;\\n\\t\\t\\t}\\n\\t\\t\\tm_paths.push_back(p);\\n\\t\\t}\\n\\t}\\n\\tsize_t count_heavy_paths() const {\\n\\t\\treturn m_paths.size();\\n\\t}\\n\\tsize_t path_length(index_type p) const {\\n\\t\\treturn m_paths[p].vertices.size();\\n\\t}\\n\\tindex_type path_id(vertex_t v) const {\\n\\t\\treturn m_vertex2path[v];\\n\\t}\\n\\tindex_type local_index(vertex_t v) const {\\n\\t\\treturn m_vertex2index[v];\\n\\t}\\n\\tstd::vector<segment> shortest_path(vertex_t s, vertex_t t) const {\\n\\t\\tstd::vector<segment> s_segments, t_segments;\\n\\t\\tindex_type s_path = path_id(s), s_index = local_index(s);\\n\\t\\tindex_type t_path = path_id(t), t_index = local_index(t);\\n\\t\\twhile(s_path != t_path){\\n\\t\\t\\tconst size_t s_rank = m_paths[s_path].rank;\\n\\t\\t\\tconst size_t t_rank = m_paths[t_path].rank;\\n\\t\\t\\tif(s_rank >= t_rank){\\n\\t\\t\\t\\tconst auto parent = m_paths[s_path].parent;\\n\\t\\t\\t\\ts_segments.push_back(segment(s_path, s_index, 0));\\n\\t\\t\\t\\ts_path = path_id(parent);\\n\\t\\t\\t\\ts_index = local_index(parent);\\n\\t\\t\\t}\\n\\t\\t\\tif(t_rank >= s_rank){\\n\\t\\t\\t\\tconst auto parent = m_paths[t_path].parent;\\n\\t\\t\\t\\tt_segments.push_back(segment(t_path, 0, t_index));\\n\\t\\t\\t\\tt_path = path_id(parent);\\n\\t\\t\\t\\tt_index = local_index(parent);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::vector<segment> result(s_segments);\\n\\t\\tresult.emplace_back(s_path, s_index, t_index);\\n\\t\\tstd::reverse(t_segments.begin(), t_segments.end());\\n\\t\\tfor(const auto& s : t_segments){ result.push_back(s); }\\n\\t\\treturn result;\\n\\t}\\n};\\ntemplate <typename RangeQueryable>\\nclass lazy_vertex_path_queryable_tree {\\npublic:\\n\\tusing range_queryable_type = RangeQueryable;\\n\\tusing behavior_type = typename range_queryable_type::behavior_type;\\n\\tusing value_type = typename behavior_type::value_type;\\n\\tusing modifier_type = typename behavior_type::modifier_type;\\nprivate:\\n\\theavy_light_decomposition m_decomposition;\\n\\tstd::vector<range_queryable_type> m_range_queryables;\\n\\tlazy_range_query_behavior_wrapper<behavior_type> m_behavior;\\npublic:\\n\\ttemplate <typename EdgeType>\\n\\texplicit lazy_vertex_path_queryable_tree(\\n\\t\\tconst adjacency_list<EdgeType>& graph,\\n\\t\\tvertex_t root = 0,\\n\\t\\tconst behavior_type& behavior = behavior_type())\\n\\t\\t: m_decomposition(graph, root)\\n\\t\\t, m_range_queryables()\\n\\t\\t, m_behavior(behavior)\\n\\t{\\n\\t\\tconst size_t n_paths = m_decomposition.count_heavy_paths();\\n\\t\\tm_range_queryables.reserve(n_paths);\\n\\t\\tfor(size_t i = 0; i < n_paths; ++i){\\n\\t\\t\\tm_range_queryables.emplace_back(\\n\\t\\t\\t\\tm_decomposition.path_length(i), behavior);\\n\\t\\t}\\n\\t}\\n\\tvoid modify(vertex_t s, vertex_t t, const modifier_type& m){\\n\\t\\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\\n\\t\\tmodifier_type modifier = m;\\n\\t\\tfor(const auto& s : shortest_path){\\n\\t\\t\\tconst auto path_id = s.path_id;\\n\\t\\t\\tconst auto lo = std::min(s.first, s.last);\\n\\t\\t\\tconst auto hi = std::max(s.first, s.last) + 1;\\n\\t\\t\\tconst auto modifier_pair =\\n\\t\\t\\t\\tm_behavior.split_modifier(modifier, hi - lo);\\n\\t\\t\\tconst auto head_modifier = s.first > s.last\\n\\t\\t\\t\\t? m_behavior.reverse_modifier(hi - lo, modifier_pair.first)\\n\\t\\t\\t\\t: modifier_pair.first;\\n\\t\\t\\tm_range_queryables[path_id].modify(lo, hi, head_modifier);\\n\\t\\t\\tmodifier = modifier_pair.second;\\n\\t\\t}\\n\\t}\\n\\tvalue_type query(vertex_t s, vertex_t t){\\n\\t\\tconst auto shortest_path = m_decomposition.shortest_path(s, t);\\n\\t\\tvalue_type acc = m_behavior.identity_value();\\n\\t\\tfor(const auto& s : shortest_path){\\n\\t\\t\\tconst auto path_id = s.path_id;\\n\\t\\t\\tconst auto lo = std::min(s.first, s.last);\\n\\t\\t\\tconst auto hi = std::max(s.first, s.last) + 1;\\n\\t\\t\\tconst auto partial = m_range_queryables[path_id].query(lo, hi);\\n\\t\\t\\tconst auto directed_partial = s.first > s.last\\n\\t\\t\\t\\t? m_behavior.reverse_value(hi - lo, partial)\\n\\t\\t\\t\\t: partial;\\n\\t\\t\\tacc = m_behavior.merge_value(acc, directed_partial);\\n\\t\\t}\\n\\t\\treturn acc;\\n\\t}\\n};\\n}\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\nusing edge = loquat::edge<>;\\nstruct lazy_range_query_behavior {\\n\\tusing value_type = ll;\\n\\tusing modifier_type = pll;\\n\\tvalue_type identity_value() const { return 0; }\\n\\tmodifier_type identity_modifier() const { return pll(0, 0); }\\n\\tstd::pair<modifier_type, modifier_type>\\n\\tsplit_modifier(const modifier_type& m, size_t k) const {\\n\\t\\treturn make_pair(\\n\\t\\t\\tmodifier_type(m.first, m.second),\\n\\t\\t\\tmodifier_type(m.first + m.second * k, m.second));\\n\\t}\\n\\tmodifier_type merge_modifier(const modifier_type& a, const modifier_type& b) const {\\n\\t\\treturn modifier_type(a.first + b.first, a.second + b.second);\\n\\t}\\n\\tvalue_type merge_value(const value_type& a, const value_type& b) const {\\n\\t\\treturn a + b;\\n\\t}\\n\\tvalue_type modify(size_t n, const value_type& v, const modifier_type& m) const {\\n\\t\\treturn v + m.first * n + m.second * (n * (n - 1) / 2);\\n\\t}\\n\\tmodifier_type reverse_modifier(size_t n, const modifier_type& m) const {\\n\\t\\treturn modifier_type(m.first + m.second * (n - 1), -m.second);\\n\\t}\\n};\\nusing lazy_segment_tree = loquat::lazy_segment_tree<lazy_range_query_behavior>;\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tint n, q;\\n\\tcin >> n >> q;\\n\\tloquat::adjacency_list<edge> g(n);\\n\\tfor(int i = 1; i < n; ++i){\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tg.add_edge(a, b);\\n\\t\\tg.add_edge(b, a);\\n\\t}\\n\\tloquat::lazy_vertex_path_queryable_tree<lazy_segment_tree> lqt(g);\\n\\twhile(q--){\\n\\t\\tint type;\\n\\t\\tcin >> type;\\n\\t\\tif(type == 0){\\n\\t\\t\\tint s, t;\\n\\t\\t\\tcin >> s >> t;\\n\\t\\t\\tcout << lqt.query(s, t) << endl;\\n\\t\\t}else{\\n\\t\\t\\tint s, t, k, m;\\n\\t\\t\\tcin >> s >> t >> k >> m;\\n\\t\\t\\tlqt.modify(s, t, pll(k, m));\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.14893617021276595,\n \"time_ms\": 160,\n \"memory_kb\": 23320,\n \"score_of_the_acc\": -0.0137,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3050_3145579\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n// thanks KAZUMA!!\\n\\nconst int mod = 1e9 + 7;\\n\\ntemplate<int MOD>\\nstruct mod_int {\\n\\tstatic const int Mod = MOD;\\n\\tunsigned x;\\n\\tmod_int() : x(0) { }\\n\\tmod_int(int sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\\n\\tmod_int(long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\\n\\tint get() const { return (int)x; }\\n\\n\\tmod_int &operator+=(mod_int that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\\n\\tmod_int &operator-=(mod_int that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\\n\\tmod_int &operator*=(mod_int that) { x = (unsigned long long)x * that.x % MOD; return *this; }\\n\\tmod_int &operator/=(mod_int that) { return *this *= that.inverse(); }\\n\\n\\tmod_int operator+(mod_int that) const { return mod_int(*this) += that; }\\n\\tmod_int operator-(mod_int that) const { return mod_int(*this) -= that; }\\n\\tmod_int operator*(mod_int that) const { return mod_int(*this) *= that; }\\n\\tmod_int operator/(mod_int that) const { return mod_int(*this) /= that; }\\n\\n\\tmod_int inverse() const {\\n\\t\\tlong long a = x, b = MOD, u = 1, v = 0;\\n\\t\\twhile (b) {\\n\\t\\t\\tlong long t = a / b;\\n\\t\\t\\ta -= t * b; swap(a, b);\\n\\t\\t\\tu -= t * v; swap(u, v);\\n\\t\\t}\\n\\t\\treturn mod_int(u);\\n\\t}\\n};\\n\\nusing mint = mod_int<mod>;\\n\\nstruct RS {\\n\\tusing type = mint;\\n\\tstatic type id() { return 0; }\\n\\tstatic type op(const type& l, const type & r) {\\n\\t\\treturn l + r;\\n\\t}\\n};\\n\\nclass lct_node {\\n\\tusing M = RS;\\n\\tusing T = typename M::type;\\n\\tusing U = pair<mint, mint>;\\n\\n\\tlct_node *l, *r, *p;\\n\\tbool rev;\\n\\tT val, all;\\n\\tint size;\\n\\tbool flag;\\n\\tU lazy;\\n\\n\\tint pos() {\\n\\t\\tif (p && p->l == this) return 1;\\n\\t\\tif (p && p->r == this) return 3;\\n\\t\\treturn 0;\\n\\t}\\n\\tvoid update() {\\n\\t\\tsize = (l ? l->size : 0) + (r ? r->size : 0) + 1;\\n\\t\\tall = M::op(l ? l->all : M::id(), M::op(val, r ? r->all : M::id()));\\n\\t}\\n\\tvoid update_lazy(const U& v) {\\n\\t\\tif (!flag) lazy = make_pair(0, 0);\\n\\t\\tint ls = !rev ? (l ? l->size : 0) : (r ? r->size : 0);\\n\\t\\tval += v.first + v.second * ls;\\n\\t\\tall += v.first * size + ((v.second * (size - 1)) * size) / 2;\\n\\t\\tlazy = make_pair(M::op(lazy.first, v.first), M::op(lazy.second, v.second));\\n\\t\\tflag = true;\\n\\t}\\n\\tvoid rev_data() {\\n\\t\\tlazy = make_pair(lazy.first + lazy.second * (size - 1), mint(0) - lazy.second);\\n\\t}\\n\\tvoid push() {\\n\\t\\tif (pos()) p->push();\\n\\t\\tif (rev) {\\n\\t\\t\\tswap(l, r);\\n\\t\\t\\tif (l) l->rev ^= true, l->rev_data();\\n\\t\\t\\tif (r) r->rev ^= true, r->rev_data();\\n\\t\\t\\trev = false;\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tif (l) l->update_lazy(lazy);\\n\\t\\t\\tif (r) r->update_lazy(make_pair(lazy.first + lazy.second * (l ? l->size + 1 : 1), lazy.second));\\n\\t\\t\\tflag = false;\\n\\t\\t}\\n\\t}\\n\\tvoid rot() {\\n\\t\\tlct_node *par = p;\\n\\t\\tlct_node *mid;\\n\\t\\tif (p->l == this) {\\n\\t\\t\\tmid = r;\\n\\t\\t\\tr = par;\\n\\t\\t\\tpar->l = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmid = l;\\n\\t\\t\\tl = par;\\n\\t\\t\\tpar->r = mid;\\n\\t\\t}\\n\\t\\tif (mid) mid->p = par;\\n\\t\\tp = par->p;\\n\\t\\tpar->p = this;\\n\\t\\tif (p && p->l == par) p->l = this;\\n\\t\\tif (p && p->r == par) p->r = this;\\n\\t\\tpar->update();\\n\\t\\tupdate();\\n\\t}\\n\\tvoid splay() {\\n\\t\\tpush();\\n\\t\\twhile (pos()) {\\n\\t\\t\\tint st = pos() ^ p->pos();\\n\\t\\t\\tif (!st) p->rot(), rot();\\n\\t\\t\\telse if (st == 2) rot(), rot();\\n\\t\\t\\telse rot();\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\tlct_node() : l(nullptr), r(nullptr), p(nullptr), rev(false), val(M::id()), all(M::id()), size(1), flag(false) {}\\n\\tvoid expose() {\\n\\t\\tfor (lct_node *x = this, *y = nullptr; x; y = x, x = x->p) x->splay(), x->r = y, x->update();\\n\\t\\tsplay();\\n\\t}\\n\\tvoid link(lct_node *x) {\\n\\t\\tx->expose();\\n\\t\\texpose();\\n\\t\\tp = x;\\n\\t}\\n\\tvoid evert() {\\n\\t\\texpose();\\n\\t\\trev = true;\\n\\t\\trev_data();\\n\\t}\\n\\tT find() {\\n\\t\\texpose();\\n\\t\\treturn all;\\n\\t}\\n\\tvoid update(U v) {\\n\\t\\texpose();\\n\\t\\tupdate_lazy(v);\\n\\t}\\n};\\n\\nconst int MAX = 1e5+10;\\nlct_node lct[MAX];\\n\\nvoid build(int v, int prev, const vector<vector<int>>& G) {\\n\\tfor (int to : G[v]) if (to != prev) {\\n\\t\\tlct[to].link(&lct[v]);\\n\\t\\tbuild(to, v, G);\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(false), cin.tie(0);\\n\\tint N, Q;\\n\\tcin >> N >> Q;\\n\\tvector<vector<int>> G(N);\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\tG[u].push_back(v);\\n\\t\\tG[v].push_back(u);\\n\\t}\\n\\tbuild(0, -1, G);\\n\\twhile (Q--) {\\n\\t\\tint com, u, v;\\n\\t\\tcin >> com >> u >> v;\\n\\t\\tif (com == 1) {\\n\\t\\t\\tint x,y;\\n\\t\\t\\tcin >> x>>y;\\n\\t\\t\\tlct[u].evert();\\n\\t\\t\\tlct[v].update(make_pair(mint(x), mint(y)));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tlct[u].evert();\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\", lct[v].find().get());\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 30368,\n \"score_of_the_acc\": -0.1951,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3050_3145319\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nconst int mod = 1e9 + 7;\\n\\ntemplate<int MOD>\\nstruct mod_int {\\n\\tstatic const int Mod = MOD;\\n\\tunsigned x;\\n\\tmod_int() : x(0) { }\\n\\tmod_int(int sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\\n\\tmod_int(long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\\n\\tint get() const { return (int)x; }\\n\\n\\tmod_int &operator+=(mod_int that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }\\n\\tmod_int &operator-=(mod_int that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }\\n\\tmod_int &operator*=(mod_int that) { x = (unsigned long long)x * that.x % MOD; return *this; }\\n\\tmod_int &operator/=(mod_int that) { return *this *= that.inverse(); }\\n\\n\\tmod_int operator+(mod_int that) const { return mod_int(*this) += that; }\\n\\tmod_int operator-(mod_int that) const { return mod_int(*this) -= that; }\\n\\tmod_int operator*(mod_int that) const { return mod_int(*this) *= that; }\\n\\tmod_int operator/(mod_int that) const { return mod_int(*this) /= that; }\\n\\n\\tmod_int inverse() const {\\n\\t\\tlong long a = x, b = MOD, u = 1, v = 0;\\n\\t\\twhile (b) {\\n\\t\\t\\tlong long t = a / b;\\n\\t\\t\\ta -= t * b; swap(a, b);\\n\\t\\t\\tu -= t * v; swap(u, v);\\n\\t\\t}\\n\\t\\treturn mod_int(u);\\n\\t}\\n};\\n\\nusing mint = mod_int<mod>;\\n\\nstruct RS {\\n\\tusing type = mint;\\n\\tstatic type id() { return 0; }\\n\\tstatic type op(const type& l, const type & r) {\\n\\t\\treturn l + r;\\n\\t}\\n};\\n\\nclass lct_node {\\n\\tusing M = RS;\\n\\tusing T = typename M::type;\\n\\tusing U = pair<mint, mint>;\\n\\n\\tlct_node *l, *r, *p;\\n\\tbool rev;\\n\\tT val, all;\\n\\tint size;\\n\\tbool flag;\\n\\tU lazy;\\n\\n\\tint pos() {\\n\\t\\tif (p && p->l == this) return 1;\\n\\t\\tif (p && p->r == this) return 3;\\n\\t\\treturn 0;\\n\\t}\\n\\tvoid update() {\\n\\t\\tsize = (l ? l->size : 0) + (r ? r->size : 0) + 1;\\n\\t\\tall = M::op(l ? l->all : M::id(), M::op(val, r ? r->all : M::id()));\\n\\t}\\n\\tvoid update_lazy(const U& v) {\\n\\t\\tif (!flag) lazy = make_pair(0, 0);\\n\\t\\tint ls = !rev ? (l ? l->size : 0) : (r ? r->size : 0);\\n\\t\\tval += v.first + v.second * ls;\\n\\t\\tall += v.first * size + ((v.second * (size - 1)) * size) / 2;\\n\\t\\tlazy = make_pair(M::op(lazy.first, v.first), M::op(lazy.second, v.second));\\n\\t\\tflag = true;\\n\\t}\\n\\tvoid rev_data() {\\n\\t\\tlazy = make_pair(lazy.first + lazy.second * (size - 1), mint(0) - lazy.second);\\n\\t}\\n\\tvoid push() {\\n\\t\\tif (pos()) p->push();\\n\\t\\tif (rev) {\\n\\t\\t\\tswap(l, r);\\n\\t\\t\\tif (l) l->rev ^= true, l->rev_data();\\n\\t\\t\\tif (r) r->rev ^= true, r->rev_data();\\n\\t\\t\\trev = false;\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tif (l) l->update_lazy(lazy);\\n\\t\\t\\tif (r) r->update_lazy(make_pair(lazy.first + lazy.second * (l ? l->size + 1 : 1), lazy.second));\\n\\t\\t\\tflag = false;\\n\\t\\t}\\n\\t}\\n\\tvoid rot() {\\n\\t\\tlct_node *par = p;\\n\\t\\tlct_node *mid;\\n\\t\\tif (p->l == this) {\\n\\t\\t\\tmid = r;\\n\\t\\t\\tr = par;\\n\\t\\t\\tpar->l = mid;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmid = l;\\n\\t\\t\\tl = par;\\n\\t\\t\\tpar->r = mid;\\n\\t\\t}\\n\\t\\tif (mid) mid->p = par;\\n\\t\\tp = par->p;\\n\\t\\tpar->p = this;\\n\\t\\tif (p && p->l == par) p->l = this;\\n\\t\\tif (p && p->r == par) p->r = this;\\n\\t\\tpar->update();\\n\\t\\tupdate();\\n\\t}\\n\\tvoid splay() {\\n\\t\\tpush();\\n\\t\\twhile (pos()) {\\n\\t\\t\\tint st = pos() ^ p->pos();\\n\\t\\t\\tif (!st) p->rot(), rot();\\n\\t\\t\\telse if (st == 2) rot(), rot();\\n\\t\\t\\telse rot();\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\tlct_node() : l(nullptr), r(nullptr), p(nullptr), rev(false), val(M::id()), all(M::id()), size(1), flag(false) {}\\n\\tvoid expose() {\\n\\t\\tfor (lct_node *x = this, *y = nullptr; x; y = x, x = x->p) x->splay(), x->r = y, x->update();\\n\\t\\tsplay();\\n\\t}\\n\\tvoid link(lct_node *x) {\\n\\t\\tx->expose();\\n\\t\\texpose();\\n\\t\\tp = x;\\n\\t}\\n\\tvoid evert() {\\n\\t\\texpose();\\n\\t\\trev = true;\\n\\t\\trev_data();\\n\\t}\\n\\tT find() {\\n\\t\\texpose();\\n\\t\\treturn all;\\n\\t}\\n\\tvoid update(U v) {\\n\\t\\texpose();\\n\\t\\tupdate_lazy(v);\\n\\t}\\n};\\n\\nconst int MAX = 1e5;\\nlct_node lct[MAX];\\n\\nvoid build(int v, int prev, const vector<vector<int>>& G) {\\n\\tfor (int to : G[v]) if (to != prev) {\\n\\t\\tlct[to].link(&lct[v]);\\n\\t\\tbuild(to, v, G);\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(false), cin.tie(0);\\n\\tint N, Q;\\n\\tcin >> N >> Q;\\n\\tvector<vector<int>> G(N);\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\tG[u].push_back(v);\\n\\t\\tG[v].push_back(u);\\n\\t}\\n\\tbuild(0, -1, G);\\n\\twhile (Q--) {\\n\\t\\tint com, u, v;\\n\\t\\tcin >> com >> u >> v;\\n\\t\\tif (com == 1) {\\n\\t\\t\\tint k, m;\\n\\t\\t\\tcin >> k >> m;\\n\\t\\t\\tlct[u].evert();\\n\\t\\t\\tlct[v].update(make_pair(mint(k), mint(m)));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tlct[u].evert();\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\", lct[v].find().get());\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 30500,\n \"score_of_the_acc\": -0.22,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3050_3137235\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\n\\ntemplate<typename T,typename E,typename F,typename G,typename H>\\nstruct LinkCutTree{\\n struct Node{\\n Node *l,*r,*p;\\n size_t sz;// tree size (only for root)\\n Int idx;\\n bool rev;\\n T val,dat;\\n E laz;\\n Node():sz(1){}\\n Node(Int idx,T val,E laz):\\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\\n bool is_root(){\\n return !p||(p->l!=this&&p->r!=this);\\n }\\n };\\n \\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n using S = function<T(T)>;\\n F f;\\n G g;\\n H h;\\n S s;\\n T ti;\\n E ei;\\n \\n const size_t LIM = 1e6;\\n vector<Node> pool;\\n size_t ptr;\\n \\n \\n LinkCutTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\\n s=[](T a){return a;};\\n }\\n \\n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\\n \\n inline Node* create(){\\n return &pool[ptr++];\\n }\\n \\n inline Node* create(Int idx,T v){\\n return &(pool[ptr++]=Node(idx,v,ei));\\n }\\n\\n void propagate(Node *t,E v){\\n t->laz=h(t->laz,v);\\n t->val=g(t->val,v);\\n t->dat=g(t->dat,v);\\n }\\n\\n void toggle(Node *t){\\n swap(t->l,t->r);\\n t->dat=s(t->dat);\\n t->rev^=1;\\n }\\n\\n void eval(Node *t){\\n if(t->laz!=ei){\\n if(t->l) propagate(t->l,t->laz);\\n if(t->r) propagate(t->r,t->laz);\\n t->laz=ei;\\n }\\n if(t->rev){\\n if(t->l) toggle(t->l);\\n if(t->r) toggle(t->r);\\n t->rev=false;\\n }\\n }\\n\\n void update(Node *t){\\n t->dat=t->val;\\n if(t->l) t->dat=f(t->l->dat,t->dat);\\n if(t->r) t->dat=f(t->dat,t->r->dat);\\n }\\n\\n void rotR(Node *t){\\n Node *x=t->p,*y=x->p; \\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \\n t->r=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n \\n void rotL(Node *t){\\n Node *x=t->p,*y=x->p;\\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\\n t->l=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n\\n void splay(Node *t){\\n eval(t);\\n while(!t->is_root()){\\n Node *q=t->p;\\n if(q->is_root()){\\n\\teval(q);eval(t);\\n\\tif(q->l==t) rotR(t);\\n\\telse rotL(t);\\n }else{\\n\\tauto *r=q->p;\\n\\teval(r);eval(q);eval(t);\\n\\tif(r->l==q){\\n\\t if(q->l==t) rotR(q),rotR(t);\\n\\t else rotL(t),rotR(t);\\n\\t}else{\\t\\n\\t if(q->r==t) rotL(q),rotL(t);\\n\\t else rotR(t),rotL(t);\\n\\t}\\n }\\n }\\n }\\n\\n Node* expose(Node *t){\\n Node *rp=nullptr;\\n for(Node *c=t;c;c=c->p){\\n splay(c);\\n c->r=rp;\\n update(c);\\n rp=c;\\n }\\n splay(t);\\n return rp;\\n }\\n\\n void link(Node *par,Node *c){\\n expose(c);\\n expose(par);\\n c->p=par;\\n par->r=c;\\n par->sz+=c->sz;\\n }\\n\\n void cut(Node *c){\\n expose(c);\\n Node *par=c->l;\\n c->l=nullptr;\\n par->p=nullptr;\\n c->sz-=par->sz;\\n }\\n\\n void evert(Node *t){\\n expose(t);\\n toggle(t);\\n eval(t);\\n }\\n\\n bool is_connected(Node *a,Node *b){\\n expose(a);\\n while(a->l) a=a->l;\\n expose(b);\\n while(b->l) b=b->l;\\n return a==b;\\n }\\n\\n Node *lca(Node *a,Node *b){\\n expose(a);\\n return expose(b);\\n }\\n\\n T query(Node *t){\\n expose(t);\\n return t->dat;\\n }\\n\\n void update(Node *t,E v){\\n expose(t);\\n propagate(t,v);\\n eval(t);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n vector<vector<Int> > G(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n \\n constexpr Int MOD = 1e9+7; \\n auto add=[](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\\n auto mul=[](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\\n \\n struct T{\\n Int l,r,s;\\n T(){}\\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\\n };\\n struct P{\\n Int a,b;\\n P(){}\\n P(Int a,Int b):a(a),b(b){};\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n \\n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\\n auto g=[&](T a,P b){\\n\\t Int k=a.r-a.l;\\n\\t b.b=add(b.b,a.l*b.a)*k;\\n\\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\\n \\n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\\n vector<LCT::Node* > vs(n);\\n \\n vector<Int> ps(n,-1),dep(n,0);\\n {\\n queue<pair<Int, Int> > q;\\n q.emplace(0,-1);\\n while(!q.empty()){\\n Int v,p;\\n tie(v,p)=q.front();q.pop();\\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\\n ps[v]=p;\\n if(~p) lct.link(vs[p],vs[v]);\\n for(Int u:G[v]){\\n\\tif(u==p) continue;\\n\\tq.emplace(u,v);\\n\\tdep[u]=dep[v]+1;\\n }\\n } \\n }\\n\\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=lct.lca(vs[s],vs[t])->idx;\\n Int p=ps[l];\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n // add ax + b (different from statement)\\n\\n // [l, s] -> (p, s]\\n {\\n\\tInt a1=MOD-a;\\n\\tInt b1=add(b,-a1*dep[s]);\\n\\tlct.update(vs[s],P(a1,b1));\\n\\tif(~p) lct.update(vs[p],P(-a1,-b1));\\n }\\n // (l, t]\\n {\\n\\tInt d=dep[s]+dep[t]-2*dep[l];\\n\\tInt a2=a;\\n\\tInt b2=add(add(b,a*d),-a2*dep[t]);\\n\\tlct.update(vs[t],P(a2,b2));\\n\\tlct.update(vs[l],P(-a2,-b2));\\n }\\n }else{\\n Int ans=0;\\n // [l, s] -> (p, s]\\n ans=add(ans,lct.query(vs[s]).s);\\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\\n // (l, t]\\n ans=add(ans,lct.query(vs[t]).s);\\n ans=add(ans,-lct.query(vs[l]).s);\\n \\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 122188,\n \"score_of_the_acc\": -1.1413,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3050_3130820\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)<<\\\" \\\"\\n#define pr2(a,b) pr1(a)<<pr1(b)\\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\\nusing namespace std;\\nusing Int = long long;\\nusing _int = int;\\nusing ll = long long;\\nusing Double = long double;\\nconst Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16\\nconst Int mod = (1e9)+7;\\nconst Double EPS = 1e-8;\\nconst Double PI = 6.0 * asin((Double)0.5);\\nusing P = pair<Int,Int>;\\nusing T = tuple<Int,Int,Int>;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\\n return o<<\\\"(\\\"<<get<0>(t)<<\\\",\\\"<<get<1>(t)<<\\\",\\\"<<get<2>(t)<<\\\")\\\";}\\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\\ntemplate<class T>void prArr(T a,string s=\\\" \\\"){Int i=0;for(auto t:a)cout<<(i++?s:\\\"\\\")<<t;cout<<endl;}\\n\\nclass HLD{\\npublic:\\n Int V; //ノード数\\n Int root; //根の頂点番号\\n vector<vector<Int> > G; //Grapth\\n vector<Int> par; //parent: par[元の頂点番号]->元の頂点番号\\n vector<Int> Hchild; //各ノードから伸びるHeavy Childの頂点番号: Hedge[元の頂点番号]->元の頂点番号\\n vector<Int> number; //各ノードに割り当てなおした頂点番号: number[元の頂点番号]->振り直した頂点番号\\n vector<Int> id; //割り当て直した数字の元のノード番号: id[振り直した頂点番号]->元の頂点番号\\n vector<Int> group; //各ノードが所属するグループ番号: group[元の頂点番号]->元の頂点番号\\n vector<Int> depth; //根からの各ノードの深さ: depth[元の頂点番号]\\n bool ok; //build()が済んでいるか\\n \\n HLD(){root = V = -1;}\\n HLD(Int V):V(V), root(0), G(V), par(V,-1), Hchild(V,-1), \\n number(V,-1),id(V,-1),group(V,-1),depth(V,0),ok(false){}\\n \\n void add_edge(Int a,Int b){\\n assert(a < V && b < V);\\n G[a].push_back(b);\\n G[b].push_back(a);\\n }\\n \\n void build(Int _root = 0){\\n root = _root;\\n Int num = 0;\\n ok = true;\\n dfs1(); numbering(num); dfs2();\\n }\\n\\n Int dfs1(Int pos = -1,Int pre = -1){\\n if(pos == -1) pos = root;\\n Int mx = -1, weight = 1;\\n for(Int to:G[pos]){\\n if(to == pre) continue;\\n Int cweight = dfs1(to,pos);\\n weight += cweight;\\n if(mx < cweight) Hchild[pos] = to, mx = cweight;\\n }\\n return weight;\\n }\\n \\n void dfs2(Int pos = -1,Int pre = -1,Int dep = 0,Int g = -1){\\n if(pos == -1) pos = g = root;\\n par[pos] = pre;\\n depth[pos] = dep;\\n group[pos] = g;\\n for(Int to:G[pos]) if(to!=pre) dfs2(to,pos,dep+1,Hchild[pos]==to? g:to);\\n }\\n \\n void numbering(Int &cnt,Int pos = -1,Int pre = -1){\\n if(pos == -1) pos = root;\\n number[pos] = cnt++;\\n id[number[pos]] = pos;\\n if(Hchild[pos]>=0) numbering(cnt,Hchild[pos],pos);\\n for(Int to:G[pos])if(to!=pre && to!=Hchild[pos]) numbering(cnt,to,pos);\\n }\\n \\n typedef pair<Int,Int> P;\\n vector<P> paths; //[u,v]間の経路をいくつかの「閉区間の連番の経路」に分解する。(最大logN個に分解される)\\n vector<P> Ledges; //paths同士を結ぶライトエッジ\\n \\n //より浅い区間から追加される。つまりpaths[0].first = number[lca(u,v)];\\n void buildPaths(Int u,Int v){\\n if(depth[group[u]] < depth[group[v]]) swap(u,v);// 深い方のノードから処理する。\\n Int nu=number[u], nv=number[v];\\n if(same(u,v)){ paths.push_back(P(min(nu,nv),max(nu,nv)));return;} \\n\\n Int gu = group[u];\\n buildPaths(par[gu],v);\\n\\n paths.push_back(P(number[gu], number[u]));\\n Ledges.push_back(P(number[par[gu]], number[gu]));\\n }\\n \\n //lca(元の頂点番号,元の頂点番号) -> 元の頂点番号\\n Int lca(Int u,Int v){\\n assert(ok && \\\"Please Build\\\");\\n if(depth[group[u]] < depth[group[v]]) swap(u,v);\\n if(same(u,v)) return depth[u] < depth[v]? u:v;\\n return lca(par[group[u]],v);\\n }\\n \\n //getPath(元の頂点番号,元の頂点番号) -> 振り直した頂点番号\\n pair<vector<P>, vector<P> > getPath(Int u,Int v){\\n assert(ok && \\\"Please Build\\\");\\n paths.clear();\\n Ledges.clear();\\n buildPaths(u,v);\\n return make_pair(paths,Ledges);\\n }\\n\\n /*(元の頂点番号,元の頂点番号)*/ \\n bool same(Int a,Int b){return group[a] == group[b];}\\n};\\n\\nclass Seg{\\npublic: \\n typedef long long ll;\\n\\n //マージ可能な主データ型\\n struct D{\\n ll value;\\n D():value(0){} /*適切な値にする!!!!!!*/\\n D(ll value):value(value){}\\n };\\n\\n //遅延用の型 \\n struct T{\\n Int type; //0 - empty , 1 - update\\n ll a, d;\\n T():type(0), a(0), d(0){}\\n T(Int type,ll a, ll d):type(type), a(a) ,d(d){}\\n };\\n\\n \\n Int n, n_;\\n vector<D> dat;\\n vector<T> td;\\n HLD hld;\\n D returnD = D(0); // 範囲外の時に返す値。\\n \\n Seg(){n=-1;}\\n Seg(Int n_, HLD hld):n_(n_), hld(hld){\\n n=1;\\n while(n < n_) n *= 2;\\n td.resize(2*n-1,T());\\n dat.resize(2*n-1,D());\\n }\\n \\n inline D merge(D a,D b){return (a.value%mod + b.value%mod+mod)%mod;}\\n inline T merge(T from, T to){\\n if(to.type == 0) return from;\\n if(from.type == 0) return to;\\n return T(1, from.a + to.a, from.d + to.d);\\n }\\n inline ll sum(Int l, Int r, T x){\\n Int dis = hld.depth[hld.id[l]];\\n Int n = r - l;\\n x.a = (x.a + x.d * dis)%mod;\\n return ((x.a + (x.a + x.d * (n - 1))%mod) * n / 2)%mod;\\n }\\n \\n void delay(Int l,Int r, Int k){\\n if(td[k].type==0) return;\\n Int mid = (l + r) / 2;\\n {\\n Int i = k*2+1;\\n dat[i].value = (dat[i].value + sum(l, mid, td[k]))%mod;\\n td[i] = merge(td[i], td[k]);\\n }\\n\\n {\\n Int i = k*2+2;\\n dat[i].value = (dat[i].value + sum(mid, r, td[k]))%mod;\\n td[i] = merge(td[i], td[k]);\\n }\\n td[k] = T(0,0,0);\\n }\\n\\n D write(Int l,Int r, Int k, T x){\\n dat[k].value = (dat[k].value + sum(l, r, x))%mod;\\n td[k] = merge(td[k], x);\\n return dat[k];\\n }\\n \\n D dfs(Int a, Int b, T x, bool flag, Int k, Int l, Int r){\\n if(r <= a||b <= l) return flag? dat[k]:returnD;\\n if(a <= l && r <= b) return flag? write(l, r, k, x):dat[k];\\n delay(l, r, k);\\n D vl = dfs(a, b, x, flag, k*2+1, l, (l+r)/2);\\n D vr = dfs(a, b, x, flag, k*2+2, (l+r)/2, r);\\n return flag? (dat[k] = merge(vl, vr)):merge(vl, vr);\\n }\\n\\n void add(Int l,Int r,ll a, ll d){\\n assert(l <= r);\\n assert(0 <= l && l <= n);\\n assert(0 <= r && r <= n);\\n dfs(l, r, T(1, a, d), true, 0, 0, n);\\n }\\n \\n //[l,r)の合計値を得る find(a,b);\\n ll get(Int l,Int r){\\n assert(l <= r);\\n assert(0 <= l && l <= n);\\n assert(0 <= r && r <= n);\\n D res = dfs(l, r, T(), false, 0, 0, n);\\n return res.value;\\n }\\n};\\n\\n\\nsigned main(){\\n srand((unsigned)time(NULL));\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n Int N, Q;\\n scanf(\\\"%lld %lld\\\", &N, &Q);\\n HLD hld(N);\\n for(Int i=0;i<N-1;i++){\\n Int a, b;\\n scanf(\\\"%lld %lld\\\", &a, &b);\\n hld.add_edge(a, b);\\n }\\n hld.build();\\n Seg seg(N, hld);\\n\\n auto query0 = [&](Int S,Int T){\\n auto path = hld.getPath(S, T).first;\\n Int res = 0;\\n for(auto p:path){\\n Int l, r; tie(l, r) = p;\\n res = (res + seg.get(l, r+1)) % mod;\\n }\\n return res;\\n };\\n \\n auto query1 = [&](Int S, Int T, Int a, Int d){\\n auto add = [&hld,&seg](Int s, Int t, Int a,Int d){\\n auto path = hld.getPath(s, t).first;\\n for(auto p:path){\\n\\tInt l,r; tie(l, r) = p;\\n\\tseg.add(l, r+1, a, d);\\n }\\n };\\n \\n Int lca = hld.lca(S, T);\\n Int val = a + d * (hld.depth[S] - hld.depth[lca]);\\n {\\n Int na = d * hld.depth[lca] + val;\\n Int nd = -d;\\n add(lca, S, na, nd);\\n }\\n {\\n Int na = -d * hld.depth[lca] + val;\\n Int nd = d;\\n add(lca, T, na, nd);\\n }\\n {\\n Int na = -val;\\n Int nd = 0;\\n add(lca, lca, na, nd);\\n }\\n };\\n\\n while(Q--){\\n Int cmd;\\n scanf(\\\"%lld\\\", &cmd);\\n if(cmd == 0){\\n Int S, T;\\n scanf(\\\"%lld %lld\\\", &S, &T);\\n Int ans = query0(S, T);\\n cout<<ans<<endl;\\n }\\n else{\\n Int S, T, a, d;\\n scanf(\\\"%lld %lld %lld %lld\\\", &S, &T, &a, &d);\\n query1(S, T, a, d);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 73356,\n \"score_of_the_acc\": -0.6542,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3050_3130695\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\n\\ntemplate<typename T,typename E,typename F,typename G,typename H>\\nstruct LinkCutTree{\\n struct Node{\\n Node *l,*r,*p;\\n size_t sz;// tree size (only for root)\\n Int idx;\\n bool rev;\\n T val,dat;\\n E laz;\\n Node():sz(1){}\\n Node(Int idx,T val,E laz):\\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\\n bool is_root(){\\n return !p||(p->l!=this&&p->r!=this);\\n }\\n };\\n \\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n using S = function<T(T)>;\\n F f;\\n G g;\\n H h;\\n S s;\\n T ti;\\n E ei;\\n \\n const size_t LIM = 1e6;\\n vector<Node> pool;\\n size_t ptr;\\n \\n \\n LinkCutTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\\n s=[](T a){return a;};\\n }\\n \\n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\\n \\n inline Node* create(){\\n return &pool[ptr++];\\n }\\n \\n inline Node* create(Int idx,T v){\\n return &(pool[ptr++]=Node(idx,v,ei));\\n }\\n\\n void propagate(Node *t,E v){\\n t->laz=h(t->laz,v);\\n t->val=g(t->val,v);\\n t->dat=g(t->dat,v);\\n }\\n\\n void toggle(Node *t){\\n swap(t->l,t->r);\\n t->dat=s(t->dat);\\n t->rev^=1;\\n }\\n\\n void eval(Node *t){\\n if(t->laz!=ei){\\n if(t->l) propagate(t->l,t->laz);\\n if(t->r) propagate(t->r,t->laz);\\n t->laz=ei;\\n }\\n if(t->rev){\\n if(t->l) toggle(t->l);\\n if(t->r) toggle(t->r);\\n t->rev=false;\\n }\\n }\\n\\n void update(Node *t){\\n t->dat=t->val;\\n if(t->l) t->dat=f(t->l->dat,t->dat);\\n if(t->r) t->dat=f(t->dat,t->r->dat);\\n }\\n\\n void rotR(Node *t){\\n Node *x=t->p,*y=x->p; \\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \\n t->r=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n \\n void rotL(Node *t){\\n Node *x=t->p,*y=x->p;\\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\\n t->l=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n\\n void splay(Node *t){\\n eval(t);\\n while(!t->is_root()){\\n Node *q=t->p;\\n if(q->is_root()){\\n\\teval(q);eval(t);\\n\\tif(q->l==t) rotR(t);\\n\\telse rotL(t);\\n }else{\\n\\tauto *r=q->p;\\n\\teval(r);eval(q);eval(t);\\n\\tif(r->l==q){\\n\\t if(q->l==t) rotR(q),rotR(t);\\n\\t else rotL(t),rotR(t);\\n\\t}else{\\t\\n\\t if(q->r==t) rotL(q),rotL(t);\\n\\t else rotR(t),rotL(t);\\n\\t}\\n }\\n }\\n }\\n\\n Node* expose(Node *t){\\n Node *rp=nullptr;\\n for(Node *c=t;c;c=c->p){\\n splay(c);\\n c->r=rp;\\n update(c);\\n rp=c;\\n }\\n splay(t);\\n return rp;\\n }\\n\\n void link(Node *par,Node *c){\\n expose(c);\\n expose(par);\\n c->p=par;\\n par->r=c;\\n par->sz+=c->sz;\\n }\\n\\n void cut(Node *c){\\n expose(c);\\n Node *par=c->l;\\n c->l=nullptr;\\n par->p=nullptr;\\n c->sz-=par->sz;\\n }\\n\\n void evert(Node *t){\\n expose(t);\\n toggle(t);\\n eval(t);\\n }\\n\\n bool is_connected(Node *a,Node *b){\\n expose(a);\\n while(a->l) a=a->l;\\n expose(b);\\n while(b->l) b=b->l;\\n return a==b;\\n }\\n\\n Node *lca(Node *a,Node *b){\\n expose(a);\\n return expose(b);\\n }\\n\\n T query(Node *t){\\n expose(t);\\n return t->dat;\\n }\\n\\n void update(Node *t,E v){\\n expose(t);\\n propagate(t,v);\\n eval(t);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nconst Int MOD = 1e9+7;\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n vector<vector<Int> > G(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n \\n auto add=[](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\\n auto mul=[](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\\n \\n struct T{\\n Int l,r,s;\\n T(){}\\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\\n };\\n struct P{\\n Int a,b;\\n P(){}\\n P(Int a,Int b):a(a),b(b){};\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n \\n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\\n auto g=[&](T a,P b){\\n\\t Int k=a.r-a.l;\\n\\t b.b=add(b.b,a.l*b.a)*k;\\n\\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\\n \\n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\\n vector<LCT::Node* > vs(n);\\n \\n vector<Int> ps(n,-1),dep(n,0);\\n {\\n queue<pair<Int, Int> > q;\\n q.emplace(0,-1);\\n while(!q.empty()){\\n Int v,p;\\n tie(v,p)=q.front();q.pop();\\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\\n ps[v]=p;\\n if(~p) lct.link(vs[p],vs[v]);\\n for(Int u:G[v]){\\n\\tif(u==p) continue;\\n\\tq.emplace(u,v);\\n\\tdep[u]=dep[v]+1;\\n }\\n } \\n }\\n\\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=lct.lca(vs[s],vs[t])->idx;\\n Int p=ps[l];\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n // add ax + b (different from statement)\\n\\n // [l, s] -> (p, s]\\n {\\n\\tInt a1=MOD-a;\\n\\tInt b1=add(b,-a1*dep[s]);\\n\\tlct.update(vs[s],P(a1,b1));\\n\\tif(~p) lct.update(vs[p],P(-a1,-b1));\\n }\\n // (l, t]\\n {\\n\\tInt d=dep[s]+dep[t]-2*dep[l];\\n\\tInt a2=a;\\n\\tInt b2=add(add(b,a*d),-a2*dep[t]);\\n\\tlct.update(vs[t],P(a2,b2));\\n\\tlct.update(vs[l],P(-a2,-b2));\\n }\\n }else{\\n Int ans=0;\\n // [l, s] -> (p, s]\\n ans=add(ans,lct.query(vs[s]).s);\\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\\n // (l, t]\\n ans=add(ans,lct.query(vs[t]).s);\\n ans=add(ans,-lct.query(vs[l]).s);\\n \\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 122200,\n \"score_of_the_acc\": -1.1414,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3050_3130693\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\n\\ntemplate<typename T,typename E,typename F,typename G,typename H>\\nstruct LinkCutTree{\\n struct Node{\\n Node *l,*r,*p;\\n size_t sz;// tree size (only for root)\\n Int idx;\\n bool rev;\\n T val,dat;\\n E laz;\\n Node():sz(1){}\\n Node(Int idx,T val,E laz):\\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\\n bool is_root(){\\n return !p||(p->l!=this&&p->r!=this);\\n }\\n };\\n \\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n using S = function<T(T)>;\\n F f;\\n G g;\\n H h;\\n S s;\\n T ti;\\n E ei;\\n \\n const size_t LIM = 1e6;\\n vector<Node> pool;\\n size_t ptr;\\n \\n \\n LinkCutTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\\n s=[](T a){return a;};\\n }\\n \\n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\\n \\n inline Node* create(){\\n return &pool[ptr++];\\n }\\n \\n inline Node* create(Int idx,T v){\\n return &(pool[ptr++]=Node(idx,v,ei));\\n }\\n\\n void propagate(Node *t,E v){\\n t->laz=h(t->laz,v);\\n t->val=g(t->val,v);\\n t->dat=g(t->dat,v);\\n }\\n\\n void toggle(Node *t){\\n swap(t->l,t->r);\\n t->dat=s(t->dat);\\n t->rev^=1;\\n }\\n\\n void eval(Node *t){\\n if(t->laz!=ei){\\n if(t->l) propagate(t->l,t->laz);\\n if(t->r) propagate(t->r,t->laz);\\n t->laz=ei;\\n }\\n if(t->rev){\\n if(t->l) toggle(t->l);\\n if(t->r) toggle(t->r);\\n t->rev=false;\\n }\\n }\\n\\n void update(Node *t){\\n t->dat=t->val;\\n if(t->l) t->dat=f(t->l->dat,t->dat);\\n if(t->r) t->dat=f(t->dat,t->r->dat);\\n }\\n\\n void rotR(Node *t){\\n Node *x=t->p,*y=x->p; \\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \\n t->r=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n \\n void rotL(Node *t){\\n Node *x=t->p,*y=x->p;\\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\\n t->l=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n\\n void splay(Node *t){\\n eval(t);\\n while(!t->is_root()){\\n Node *q=t->p;\\n if(q->is_root()){\\n\\teval(q);eval(t);\\n\\tif(q->l==t) rotR(t);\\n\\telse rotL(t);\\n }else{\\n\\tauto *r=q->p;\\n\\teval(r);eval(q);eval(t);\\n\\tif(r->l==q){\\n\\t if(q->l==t) rotR(q),rotR(t);\\n\\t else rotL(t),rotR(t);\\n\\t}else{\\t\\n\\t if(q->r==t) rotL(q),rotL(t);\\n\\t else rotR(t),rotL(t);\\n\\t}\\n }\\n }\\n }\\n\\n Node* expose(Node *t){\\n Node *rp=nullptr;\\n for(Node *c=t;c;c=c->p){\\n splay(c);\\n c->r=rp;\\n update(c);\\n rp=c;\\n }\\n splay(t);\\n return rp;\\n }\\n\\n void link(Node *par,Node *c){\\n expose(c);\\n expose(par);\\n c->p=par;\\n par->r=c;\\n par->sz+=c->sz;\\n }\\n\\n void cut(Node *c){\\n expose(c);\\n Node *par=c->l;\\n c->l=nullptr;\\n par->p=nullptr;\\n c->sz-=par->sz;\\n }\\n\\n void evert(Node *t){\\n expose(t);\\n toggle(t);\\n eval(t);\\n }\\n\\n bool is_connected(Node *a,Node *b){\\n expose(a);\\n while(a->l) a=a->l;\\n expose(b);\\n while(b->l) b=b->l;\\n return a==b;\\n }\\n\\n Node *lca(Node *a,Node *b){\\n expose(a);\\n return expose(b);\\n }\\n\\n T query(Node *t){\\n expose(t);\\n return t->dat;\\n }\\n\\n void update(Node *t,E v){\\n expose(t);\\n propagate(t,v);\\n eval(t);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n vector<vector<Int> > G(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n \\n const Int MOD = 1e9+7;\\n auto add=[MOD](Int a,Int b){return ((a%MOD+MOD)+(b%MOD+MOD))%MOD;};\\n auto mul=[MOD](Int a,Int b){return ((a%MOD)*(b%MOD)%MOD+MOD)%MOD;};\\n \\n struct T{\\n Int l,r,s;\\n T(){}\\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\\n };\\n struct P{\\n Int a,b;\\n P(){}\\n P(Int a,Int b):a(a),b(b){};\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n \\n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\\n auto g=[&](T a,P b){\\n\\t Int k=a.r-a.l;\\n\\t b.b=add(b.b,a.l*b.a)*k;\\n\\t a.s=add(a.s,add(mul(k*(k-1)/2,b.a),b.b));\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\\n \\n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\\n vector<LCT::Node* > vs(n);\\n \\n vector<Int> ps(n,-1),dep(n,0);\\n {\\n queue<pair<Int, Int> > q;\\n q.emplace(0,-1);\\n while(!q.empty()){\\n Int v,p;\\n tie(v,p)=q.front();q.pop();\\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\\n ps[v]=p;\\n if(~p) lct.link(vs[p],vs[v]);\\n for(Int u:G[v]){\\n\\tif(u==p) continue;\\n\\tq.emplace(u,v);\\n\\tdep[u]=dep[v]+1;\\n }\\n } \\n }\\n\\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=lct.lca(vs[s],vs[t])->idx;\\n Int p=ps[l];\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n // add ax + b (different from statement)\\n\\n // [l, s] -> (p, s]\\n {\\n\\tInt a1=MOD-a;\\n\\tInt b1=add(b,-a1*dep[s]);\\n\\tlct.update(vs[s],P(a1,b1));\\n\\tif(~p) lct.update(vs[p],P(-a1,-b1));\\n }\\n // (l, t]\\n {\\n\\tInt d=dep[s]+dep[t]-2*dep[l];\\n\\tInt a2=a;\\n\\tInt b2=add(add(b,a*d),-a2*dep[t]);\\n\\tlct.update(vs[t],P(a2,b2));\\n\\tlct.update(vs[l],P(-a2,-b2));\\n }\\n }else{\\n Int ans=0;\\n // [l, s] -> (p, s]\\n ans=add(ans,lct.query(vs[s]).s);\\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\\n // (l, t]\\n ans=add(ans,lct.query(vs[t]).s);\\n ans=add(ans,-lct.query(vs[l]).s);\\n \\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3130,\n \"memory_kb\": 122132,\n \"score_of_the_acc\": -1.9993,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3050_3130687\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\nstruct HLDecomposition {\\n Int n,pos;\\n vector<vector<Int> > G;\\n vector<Int> vid, head, sub, hvy, par, dep, inv, type;\\n \\n HLDecomposition(){}\\n HLDecomposition(Int sz):\\n n(sz),pos(0),G(n),\\n vid(n,-1),head(n),sub(n,1),hvy(n,-1),\\n par(n),dep(n),inv(n),type(n){}\\n \\n void add_edge(Int u, Int v) {\\n G[u].push_back(v);\\n G[v].push_back(u);\\n }\\n\\n void build(vector<Int> rs={0}) {\\n Int c=0;\\n for(Int r:rs){\\n dfs(r);\\n bfs(r, c++);\\n }\\n }\\n \\n void dfs(Int rt) {\\n using T = pair<Int, Int>;\\n stack<T> st;\\n par[rt]=-1;\\n dep[rt]=0;\\n st.emplace(rt,0);\\n while(!st.empty()){\\n Int v=st.top().first;\\n Int &i=st.top().second;\\n if(i<(Int)G[v].size()){\\n\\tInt u=G[v][i++];\\n\\tif(u==par[v]) continue;\\n\\tpar[u]=v;\\n\\tdep[u]=dep[v]+1;\\n\\tst.emplace(u,0);\\n }else{\\n\\tst.pop();\\n\\tfor(Int j=0;j<(Int)G[v].size();j++){\\n\\t Int &u=G[v][j];\\n\\t if(u==par[v]) swap(u,G[v].back());\\n\\t if(u==par[v]) continue;\\n\\t sub[v]+=sub[u];\\n\\t if(sub[u]>sub[G[v].front()]) swap(u,G[v].front());\\n\\t}\\n }\\n }\\n }\\n\\n void bfs(Int r,Int c) {\\n using T = tuple<Int, Int, Int>;\\n stack<T> st;\\n st.emplace(r,r,0);\\n while(!st.empty()){\\n Int v,h;\\n tie(v,h,ignore)=st.top();\\n Int &i=get<2>(st.top());\\n if(!i){\\n\\ttype[v]=c;\\n\\tvid[v]=pos++;\\n\\tinv[vid[v]]=v;\\n\\thead[v]=h;\\n hvy[v]=(G[v].empty()?-1:G[v][0]);\\n\\tif(hvy[v]==par[v]) hvy[v]=-1;\\n }\\n if(i<(Int)G[v].size()){\\n\\tInt u=G[v][i++];\\n\\tif(u==par[v]) continue;\\n\\tst.emplace(u,(hvy[v]==u?h:u),0);\\n }else{\\n\\tst.pop();\\n }\\n }\\n }\\n \\n // for_each(vertex)\\n // [l,r] <- attention!! \\n template<typename F>\\n void for_each(Int u, Int v, const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n f(max(vid[head[v]],vid[u]),vid[v]);\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n }\\n\\n template<typename T,typename Q,typename F>\\n T for_each(Int u,Int v,T ti,const Q &q,const F &f){\\n T l=ti,r=ti;\\n while(1){\\n if(vid[u]>vid[v]){\\n\\tswap(u,v);\\n\\tswap(l,r);\\n }\\n l=f(l,q(max(vid[head[v]],vid[u]),vid[v]));\\n if(head[u]!=head[v]) v=par[head[v]];\\n else break;\\n }\\n return f(l,r);\\n }\\n \\n // for_each(edge)\\n // [l,r] <- attention!!\\n template<typename F>\\n void for_each_edge(Int u, Int v,const F& f) {\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]!=head[v]){\\n\\tf(vid[head[v]],vid[v]);\\n v=par[head[v]];\\n }else{\\n\\tif(u!=v) f(vid[u]+1,vid[v]);\\n\\tbreak;\\n }\\n }\\n }\\n\\n Int lca(Int u,Int v){\\n while(1){\\n if(vid[u]>vid[v]) swap(u,v);\\n if(head[u]==head[v]) return u;\\n v=par[head[v]];\\n }\\n }\\n\\n Int distance(Int u,Int v){\\n return dep[u]+dep[v]-2*dep[lca(u,v)];\\n }\\n};\\n\\n\\ntemplate <typename T,typename E>\\nstruct SegmentTree{\\n using F = function<T(T,T)>;\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n Int n,height;\\n F f;\\n G g;\\n H h;\\n T ti;\\n E ei;\\n vector<T> dat;\\n vector<E> laz;\\n SegmentTree(Int n_,F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei){init(n_);}\\n void init(Int n_){\\n n=1;height=0;\\n while(n<n_) n<<=1,height++;\\n dat.assign(2*n,ti);\\n laz.assign(2*n,ei);\\n }\\n void build(Int n_, vector<T> v){\\n for(Int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(Int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n T reflect(Int k){\\n return g(dat[k],laz[k]);\\n }\\n inline void eval(Int k){\\n if(laz[k]==ei) return;\\n laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);\\n laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);\\n dat[k]=reflect(k);\\n laz[k]=ei;\\n }\\n void update(Int a,Int b,E x){\\n a+=n;b+=n-1;\\n for(Int i=height;i;i--) eval(a>>i);\\n for(Int i=height;i;i--) eval(b>>i);\\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1){\\n if(l&1) laz[l]=h(laz[l],x),l++;\\n if(r&1) --r,laz[r]=h(laz[r],x);\\n }\\n while(a>>=1)\\n dat[a]=f(reflect((a<<1)|0),reflect((a<<1)|1));\\n while(b>>=1)\\n dat[b]=f(reflect((b<<1)|0),reflect((b<<1)|1));\\n }\\n T query(Int a,Int b){\\n a+=n;b+=n-1;\\n for(Int i=height;i;i--) eval(a>>i);\\n for(Int i=height;i;i--) eval(b>>i);\\n T vl=ti,vr=ti;\\n for(Int l=a,r=b+1;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,reflect(l++));\\n if(r&1) vr=f(reflect(--r),vr);\\n }\\n return f(vl,vr);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n \\n HLDecomposition hld(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n hld.add_edge(a,b);\\n }\\n hld.build();\\n \\n const Int MOD = 1e9+7;\\n using T = tuple<Int, Int, Int>;\\n using P = pair<Int, Int>;\\n auto f=[](T a,T b){\\n\\t Int al,ar,as,bl,br,bs;\\n\\t tie(al,ar,as)=a;\\n\\t tie(bl,br,bs)=b;\\n\\t return T(al,br,(as+bs)%MOD);\\n\\t };\\n auto g=[](T a,P b){\\n\\t Int al,ar,as,ba,bb;\\n\\t tie(al,ar,as)=a;\\n\\t tie(ba,bb)=b;\\n\\t bb+=al*ba%MOD;\\n\\t Int k=ar-al;\\n\\t as+=(k*(k-1)/2%MOD*ba%MOD)+(bb*k%MOD);\\n\\t return T(al,ar,as%MOD);\\n\\t };\\n auto h=[](P a,P b){\\n\\t return P((a.first+b.first)%MOD,(a.second+b.second)%MOD);\\n\\t };\\n\\n SegmentTree<T, P> seg(n,f,g,h,T(-1,-1,0),P(0,0));\\n vector<T> vt(n);\\n for(Int i=0;i<n;i++) vt[hld.vid[i]]=T(hld.dep[i],hld.dep[i]+1,0);\\n seg.build(n,vt);\\n \\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=hld.lca(s,t);\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n Int up=(b+MOD-hld.dep[s]*(MOD-a)%MOD)%MOD;\\n Int dw=(b+hld.distance(s,t)*a%MOD+MOD-hld.dep[t]*a%MOD)%MOD; \\n hld.for_each(l,s,[&](Int l,Int r){seg.update(l,r+1,P(MOD-a,up));});\\n hld.for_each_edge(l,t,[&](Int l,Int r){seg.update(l,r+1,P(a,dw));}); \\n }else{ \\n auto ask=[&](Int l,Int r){return seg.query(l,r+1);};\\n T ans=hld.for_each(s,t,T(0,0,0),ask,f);\\n printf(\\\"%lld\\\\n\\\",get<2>(ans));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 29620,\n \"score_of_the_acc\": -0.3089,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3050_3130685\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\n\\n\\ntemplate<typename T,typename E,typename F,typename G,typename H>\\nstruct LinkCutTree{\\n struct Node{\\n Node *l,*r,*p;\\n size_t sz;// tree size (only for root)\\n Int idx;\\n bool rev;\\n T val,dat;\\n E laz;\\n Node():sz(1){}\\n Node(Int idx,T val,E laz):\\n sz(1),idx(idx),rev(0),val(val),dat(val),laz(laz){l=r=p=nullptr;}\\n bool is_root(){\\n return !p||(p->l!=this&&p->r!=this);\\n }\\n };\\n \\n //using F = function<T(T,T)>;\\n //using G = function<T(T,E)>;\\n //using H = function<E(E,E)>;\\n using S = function<T(T)>;\\n F f;\\n G g;\\n H h;\\n S s;\\n T ti;\\n E ei;\\n \\n const size_t LIM = 1e6;\\n vector<Node> pool;\\n size_t ptr;\\n \\n \\n LinkCutTree(F f,G g,H h,T ti,E ei):\\n f(f),g(g),h(h),ti(ti),ei(ei),pool(LIM),ptr(0){\\n s=[](T a){return a;};\\n }\\n \\n LinkCutTree(F f,G g,H h,S s,T ti,E ei):\\n f(f),g(g),h(h),s(s),ti(ti),ei(ei),pool(LIM),ptr(0){}\\n \\n inline Node* create(){\\n return &pool[ptr++];\\n }\\n \\n inline Node* create(Int idx,T v){\\n return &(pool[ptr++]=Node(idx,v,ei));\\n }\\n\\n void propagate(Node *t,E v){\\n t->laz=h(t->laz,v);\\n t->val=g(t->val,v);\\n t->dat=g(t->dat,v);\\n }\\n\\n void toggle(Node *t){\\n swap(t->l,t->r);\\n t->dat=s(t->dat);\\n t->rev^=1;\\n }\\n\\n void eval(Node *t){\\n if(t->laz!=ei){\\n if(t->l) propagate(t->l,t->laz);\\n if(t->r) propagate(t->r,t->laz);\\n t->laz=ei;\\n }\\n if(t->rev){\\n if(t->l) toggle(t->l);\\n if(t->r) toggle(t->r);\\n t->rev=false;\\n }\\n }\\n\\n void update(Node *t){\\n t->dat=t->val;\\n if(t->l) t->dat=f(t->l->dat,t->dat);\\n if(t->r) t->dat=f(t->dat,t->r->dat);\\n }\\n\\n void rotR(Node *t){\\n Node *x=t->p,*y=x->p; \\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->l=t->r)) t->r->p=x,x->sz+=x->l->sz; \\n t->r=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n \\n void rotL(Node *t){\\n Node *x=t->p,*y=x->p;\\n x->sz-=t->sz;\\n t->sz+=x->sz;\\n if((x->r=t->l)) t->l->p=x,x->sz+=x->r->sz;\\n t->l=x;x->p=t;\\n update(x);update(t);\\n if((t->p=y)){\\n if(y->l==x) y->l=t;\\n if(y->r==x) y->r=t;\\n update(y);\\n }\\n }\\n\\n void splay(Node *t){\\n eval(t);\\n while(!t->is_root()){\\n Node *q=t->p;\\n if(q->is_root()){\\n\\teval(q);eval(t);\\n\\tif(q->l==t) rotR(t);\\n\\telse rotL(t);\\n }else{\\n\\tauto *r=q->p;\\n\\teval(r);eval(q);eval(t);\\n\\tif(r->l==q){\\n\\t if(q->l==t) rotR(q),rotR(t);\\n\\t else rotL(t),rotR(t);\\n\\t}else{\\t\\n\\t if(q->r==t) rotL(q),rotL(t);\\n\\t else rotR(t),rotL(t);\\n\\t}\\n }\\n }\\n }\\n\\n Node* expose(Node *t){\\n Node *rp=nullptr;\\n for(Node *c=t;c;c=c->p){\\n splay(c);\\n c->r=rp;\\n update(c);\\n rp=c;\\n }\\n splay(t);\\n return rp;\\n }\\n\\n void link(Node *par,Node *c){\\n expose(c);\\n expose(par);\\n c->p=par;\\n par->r=c;\\n par->sz+=c->sz;\\n }\\n\\n void cut(Node *c){\\n expose(c);\\n Node *par=c->l;\\n c->l=nullptr;\\n par->p=nullptr;\\n c->sz-=par->sz;\\n }\\n\\n void evert(Node *t){\\n expose(t);\\n toggle(t);\\n eval(t);\\n }\\n\\n bool is_connected(Node *a,Node *b){\\n expose(a);\\n while(a->l) a=a->l;\\n expose(b);\\n while(b->l) b=b->l;\\n return a==b;\\n }\\n\\n Node *lca(Node *a,Node *b){\\n expose(a);\\n return expose(b);\\n }\\n\\n T query(Node *t){\\n expose(t);\\n return t->dat;\\n }\\n\\n void update(Node *t,E v){\\n expose(t);\\n propagate(t,v);\\n eval(t);\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nconst Int MOD = 1e9+7;\\nsigned main(){\\n Int n,q;\\n scanf(\\\"%lld %lld\\\",&n,&q);\\n vector<vector<Int> > G(n);\\n for(Int i=1;i<n;i++){\\n Int a,b;\\n scanf(\\\"%lld %lld\\\",&a,&b);\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n \\n auto add=[](Int a,Int b){return (a+b)%MOD;};\\n auto mul=[](Int a,Int b){return (a*b)%MOD;};\\n \\n struct T{\\n Int l,r,s;\\n T(){}\\n T(Int l,Int r,Int s):l(l),r(r),s(s){};\\n };\\n struct P{\\n Int a,b;\\n P(){}\\n P(Int a,Int b):a(a),b(b){};\\n bool operator!=(const P &x)const{return a!=x.a||b!=x.b;}\\n };\\n \\n auto f=[&](T a,T b){return T(a.l,b.r,add(a.s,b.s));};\\n auto g=[&](T a,P b){\\n\\t Int k=a.r-a.l;\\n\\t b.b=add(b.b,a.l*b.a)*k;\\n\\t a.s=add(a.s,add(mul(k*(k-1)/2%MOD,b.a),b.b));\\n\\t return a;\\n\\t };\\n auto h=[&](P a,P b){return P(add(a.a,b.a),add(a.b,b.b));};\\n \\n using LCT = LinkCutTree<T, P, decltype(f), decltype(g), decltype(h)>;\\n LCT lct(f,g,h,T(-1,-1,0),P(0,0));\\n vector<LCT::Node* > vs(n);\\n \\n vector<Int> ps(n,-1),dep(n,0);\\n {\\n queue<pair<Int, Int> > q;\\n q.emplace(0,-1);\\n while(!q.empty()){\\n Int v,p;\\n tie(v,p)=q.front();q.pop();\\n vs[v]=lct.create(v,T(dep[v],dep[v]+1,0));\\n ps[v]=p;\\n if(~p) lct.link(vs[p],vs[v]);\\n for(Int u:G[v]){\\n\\tif(u==p) continue;\\n\\tq.emplace(u,v);\\n\\tdep[u]=dep[v]+1;\\n }\\n } \\n }\\n\\n for(Int i=0;i<q;i++){\\n Int c,s,t;\\n scanf(\\\"%lld %lld %lld\\\",&c,&s,&t);\\n Int l=lct.lca(vs[s],vs[t])->idx;\\n Int p=ps[l];\\n \\n if(c==1){\\n Int b,a;\\n scanf(\\\"%lld %lld\\\",&b,&a);\\n // add ax + b (different from statement)\\n\\n // [l, s] -> (p, s]\\n {\\n\\tInt a1=MOD-a;\\n\\tInt b1=add(b,-a1*dep[s]);\\n\\tlct.update(vs[s],P(a1,b1));\\n\\tif(~p) lct.update(vs[p],P(-a1,-b1));\\n }\\n // (l, t]\\n {\\n\\tInt d=dep[s]+dep[t]-2*dep[l];\\n\\tInt a2=a;\\n\\tInt b2=add(add(b,a*d),-a2*dep[t]);\\n\\tlct.update(vs[t],P(a2,b2));\\n\\tlct.update(vs[l],P(-a2,-b2));\\n }\\n }else{\\n Int ans=0;\\n // [l, s] -> (p, s]\\n ans=add(ans,lct.query(vs[s]).s);\\n if(~p) ans=add(ans,-lct.query(vs[p]).s);\\n // (l, t]\\n ans=add(ans,lct.query(vs[t]).s);\\n ans=add(ans,-lct.query(vs[l]).s);\\n\\n ans%=MOD;\\n ans+=MOD;\\n ans%=MOD;\\n printf(\\\"%lld\\\\n\\\",ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 122188,\n \"score_of_the_acc\": -1.0908,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1894,"cells":{"group_id":{"kind":"string","value":"aoj_3053_cpp"},"problem_description":{"kind":"string","value":"Problem C: Phone Number\nProblem\n株式会社ウクニキアの電話番、デンさんは毎日とても長い電話番号を電話に入力しています。\nある日余りにも疲れたデンさんは、疲れからか驚くべき考えに至りました。\n「電話のボタンの配置を並べ替えたら少しでも楽できるのでは？！」\n電話には$3 \\times 3$で等間隔に区切られた正方形があり、9個のマスには並べ替えることのできる1から9までのボタンがそれぞれ1つずつついています。\n電話番号を打つ際、デンさんは片手だけを使って、次の二つの操作を行うことができます。\n人差し指を今触れているボタンに辺で隣接するいずれかのボタンに触れるように移動させる。\n人差し指が触れているボタンを押す。\n最初、人差し指は1から9までのいずれかのボタンに触れるように置くことができます。\nデンさんは、最初のボタンを押してから最後のボタンを押し終わるまでの、人差し指の移動回数を最も小さくできる配置を効率的と考えています。\nさて、ここに長さ$N$のお得意先の電話番号があります。\nお得意先の電話番号だけ考えた時に、どのような配置が一番効率的でしょうか？\nボタンを並び替えることで、その配置を作ってください。\nInput\n入力は以下の形式で与えられる。\n$N$\n$S$\n1行目にお得意先の電話番号の長さ$N$が与えられる。\n2行目にお得意先の電話番号が1行に与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\leq N \\leq 10^5 $\n$S$は1から9までのいずれかの数字からなる文字列\nOutput\n最も効率的な配置を、3行に空白を入れずに出力せよ。\n但し、解答となり得る配置が複数ある場合は、左上の枠から\n123\n456\n789\nの順序で数字を並べた際に辞書順で最小となるようなものを出力せよ。\nSample Input 1\n10\n1236547896\nSample Output 1\n123\n456\n789\nSample Input 2\n11\n31415926535\nSample Output 2\n137\n456\n892"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3053_10892714","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nvoid solve(){\n ll N; cin >> N;\n string S; cin >> S;\n vv<ll> cnt(9, vl(9, 0));\n rep(i, N-1){\n ll u = S[i] - '1', v = S[i+1] - '1';\n if(u == v) continue;\n if(u > v) swap(u, v);\n cnt[u][v]++;\n }\n vl vec(9); iota(all(vec), 0);\n ll ans = 4e18;\n vl V;\n do{\n vl idx(9);\n rep(i, 9){\n idx[vec[i]] = i;\n }\n vv<ll> dist(9, vl(9));\n ll tmp = 0;\n rep(i, 9){\n rep(k, i){\n dist[k][i] = abs(idx[i] / 3 - idx[k]/3) + abs(idx[i] % 3 - idx[k] % 3);\n tmp += dist[k][i] * cnt[k][i];\n }\n }\n if(chmin(ans, tmp)) V = vec;\n }while(next_permutation(all(vec)));\n rep(i, 9){\n V[i]++;\n }\n rep(i, 3){\n cout << V[i*3] << V[i*3+1] << V[i*3+2] << endl;\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":1,"time_ms":90,"memory_kb":3592,"score_of_the_acc":-0.2189,"final_rank":13},{"submission_id":"aoj_3053_10892649","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nvoid solve(){\n ll N; cin >> N;\n string S; cin >> S;\n vv<ll> cnt(9, vl(9, 0));\n rep(i, N-1){\n ll u = S[i] - '1', v = S[i+1] - '1';\n cnt[min(u, v)][max(u, v)]++;\n }\n vl vec(9); iota(all(vec), 0);\n ll ans = 4e18;\n vl perm;\n do{\n ll tmp = 0;\n rep(i, 9){\n rep(k, i){\n tmp += cnt[k][i] * (abs(vec[i] / 3 - vec[k] / 3) + abs(vec[i] % 3 - vec[k] % 3));\n }\n }\n if(chmin(ans, tmp)) perm = vec;\n }while(next_permutation(all(vec)));\n vl V(9);\n rep(i, 9){\n V[perm[i]] = i+1;\n }\n cout << V[0] << V[1] << V[2] << endl;\n cout << V[3] << V[4] << V[5] << endl;\n cout << V[6] << V[7] << V[8] << endl;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":0.08333333333333333,"time_ms":20,"memory_kb":3440,"score_of_the_acc":-0.0445,"final_rank":20},{"submission_id":"aoj_3053_10892549","code_snippet":"#line 2 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\nusing namespace std;\n\n#include<bits/stdc++.h>\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\"\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p){\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n int s = (int)v.size();\n for (int i = 0; i < s; i++) os << (i ? \" \" : \"\") << v[i];\n return os;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v){\n for (auto &x : v) is >> x;\n return is;\n}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\n#line 6 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << std::min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(std::vector<T> &v){\n std::sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\n\nvoid solve(){\n int n; in(n);\n string s; in(s);\n int sz = s.size();\n vector<int> a(sz);\n rep(i,sz){\n a[i] = (int)(s[i] - '0') - 1;\n }\n vector b(9,vector<int>(9));\n rep(i,sz-1){\n b[a[i]][a[i+1]]++;\n }\n vector<int> p(9); iota(all(p),0);\n int mi = iinf;\n vector<int> ans(9,10);\n do {\n vector<int> pos(9);\n rep(i,9){\n pos[p[i]] = i;\n }\n int cur = 0;\n rep(u,9) rep(v,9){\n int ix = pos[u] / 3, iy = pos[u] % 3;\n int jx = pos[v] / 3, jy = pos[v] % 3;\n cur += (abs(ix - jx) + abs(iy - jy)) * b[u][v];\n }\n if (chmin(mi,cur)){\n ans = p;\n }\n }while(next_permutation(all(p)));\n rep(i,3){\n rep(j,3){\n int d = ans[i*3+j]+1;\n cout << d;\n }\n cout << '\\n';\n }\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":40,"memory_kb":3968,"score_of_the_acc":-0.1311,"final_rank":9},{"submission_id":"aoj_3053_10891047","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n int N;\n cin >> N;\n const int M = 9;\n vector<int> p(N);\n vector G(M, vector<int>(M));\n rep(i, 0, N){\n char c;\n cin >> c;\n p[i] = c - '1';\n if (i) G[p[i - 1]][p[i]]++;\n }\n vector C(M, vector<int>(M));\n rep(i, 0, M) rep(j, 0, M){\n C[i][j] = abs(i / 3 - j / 3) + abs(i % 3 - j % 3);\n }\n vector<int> order(M);\n rep(i, 0, M) order[i] = i;\n int cost = INF;\n vector<int> ans;\n do{\n vector<int> inv(M);\n rep(i, 0, M) inv[order[i]] = i;\n int tmp = 0;\n rep(i, 0, M) rep(j, 0, M) tmp += C[inv[i]][inv[j]] * G[i][j];\n if (chmin(cost, tmp)) ans = order;\n }while (next_permutation(all(order)));\n rep(i, 0, 3){\n rep(j, 0, 3) cout << ans[i * 3 + j] + 1;\n cout << \"\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3496,"score_of_the_acc":-0.0488,"final_rank":5},{"submission_id":"aoj_3053_7020428","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <string>\n#include <bitset>\n#include <assert.h>\n#include <functional>\n\n// #define _GLIBCXX_DEBUG\n// #define _LIBCPP_DEBUG 0\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define revrep(i, n) for(int i = (int)(n - 1); i >= 0; --i)\n#define range(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrange(i, s, t) for(int i = (int)(t - 1); i >= (int)(s); --i)\n#define srange(i, s, t, step) for(int i = (int)(s); i < (int)(t); i+=int(step))\n#define popcnt(x) __builtin_popcountll(x)\n#define hayai std::ios::sync_with_stdio(false);std::cin.tie(nullptr)\n\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\ninline bool inside(int x, int y, int h, int w) { return (x >= 0 && x < h && y >= 0 && y < w); }\nint dx[] = {0, -1, 0, 1};\nint dy[] = {-1, 0, 1, 0};\n\nconst ll mod = 1e9+7;\n\nint main() {\n int n; \n cin >> n;\n string s;\n cin >> s;\n\n map<pii, int> cnt;\n rep(i, n-1) {\n int x = s[i] - '1';\n int y = s[i + 1] - '1';\n cnt[make_pair(x, y)]++;\n }\n\n int cost = 1e9;\n vector<int> perm(9), answer(9);\n iota(perm.begin(), perm.end(), 0);\n do {\n vector<pii> loc(9);\n rep(i, 9) {\n loc[perm[i]].first = i / 3;\n loc[perm[i]].second = i % 3;\n }\n int now_cost = 0;\n for (auto [p, c]: cnt) {\n now_cost += c * abs(loc[p.first].first - loc[p.second].first);\n now_cost += c * abs(loc[p.first].second - loc[p.second].second);\n }\n if (now_cost < cost) {\n cost = now_cost;\n copy(perm.begin(), perm.end(), answer.begin());\n }\n } while(next_permutation(perm.begin(), perm.end()));\n\n rep(i, 3) {\n rep(j, 3) {\n cout << answer[i * 3 + j] + 1;\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":100,"memory_kb":3488,"score_of_the_acc":-0.2342,"final_rank":14},{"submission_id":"aoj_3053_7015306","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nint main(){\n int n; cin >> n;\n string s; cin >> s;\n\n vector<int> vec, ans;\n int mincost = 1 << 30;\n for(int i = 1; i <= 9; i++){\n vec.emplace_back(i);\n ans.emplace_back(i);\n }\n\n vector<vector<int>> cnt(10, vector<int>(10, 0));\n for(int i = 1; i < n; i++) cnt[s[i-1]-'0'][s[i]-'0']++;\n\n do{\n vector<vector<int>> cost(10, vector<int>(10));\n for(int i = 0; i < 9; i++){\n for(int j = 0; j < 9; j++){\n int ix = i/3, iy = i%3;\n int jx = j/3, jy = j%3;\n cost[vec[i]][vec[j]] = abs(ix-jx)+abs(iy-jy);\n }\n }\n int res = 0;\n for(int i = 1; i <= 9; i++){\n for(int j = 1; j <= 9; j++){\n res += cost[i][j]*cnt[i][j];\n }\n }\n if(mincost > res){\n mincost = res;\n ans = vec;\n }\n }while(next_permutation(vec.begin(), vec.end()));\n\n for(int i = 0; i < 9; i++){\n cout << ans[i];\n if(i%3 == 2) cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3556,"score_of_the_acc":-0.2626,"final_rank":15},{"submission_id":"aoj_3053_5092471","code_snippet":"#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tauto N=in();\n\tstring S=in<string>();\n\t\n\tvvll C(10,vll(10,0));\n\tREP(i,N-1){\n\t\tll L=S[i]-'0';\n\t\tll R=S[i+1]-'0';\n\t\tC[R][L]++;\n\t}\n\n\tvll P(9),AP;\n\tiota(ALL(P),1);\n\tll A=1ll<<60;\n\tdo{\n\t\tvll T(9);\n\t\tREP(i,9){\n\t\t\tT[P[i]-1]=i;\n\t\t}\n\t\tll sum=0;\n\t\tREP(i,9){\n\t\t\tll v=T[i];\n\t\t\tREP(j,9){\n\t\t\t\tll u=T[j];\n\t\t\t\tll F=abs((v%3)-(u%3))+abs((v/3)-(u/3));\n\t\t\t\tsum += C[i+1][j+1]*F;\n\t\t\t}\n\t\t}\n\t\tif(sum<A){\n\t\t\tA=sum;\n\t\t\tAP=P;\n\t\t}\n\t\telse if(sum==A){\n\t\t\tif(lexicographical_compare(ALL(P),ALL(AP))){\n\t\t\t\tAP=P;\n\t\t\t}\n\t\t}\n\t} while(next_permutation(ALL(P)));\n\n\tcout << AP[0] << AP[1] << AP[2] << endl;\n\tcout << AP[3] << AP[4] << AP[5] << endl;\n\tcout << AP[6] << AP[7] << AP[8] << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3588,"score_of_the_acc":-0.1255,"final_rank":7},{"submission_id":"aoj_3053_4942747","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-7, PI = acos(-1);\n//ここから編集\n\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n int N; cin >> N;\n string s; cin >> s;\n \n map<string, int> mp;\n for(int i=0; i<s.size()-1; i++){\n string t=\"\";\n t += s[i];\n t += s[i+1];\n mp[t]++;\n }\n\n vector<pair<int, string>> vp;\n for(int i=1; i<10; i++){\n for(int j=1; j<10; j++){\n string t = \"\";\n t += (char)('0' + i);\n t += (char)('0' + j);\n mp[t];\n }\n }\n \n vector<int> arr;\n for(int i=1; i<10; i++) arr.push_back(i);\n ll tmp = INT_MAX;\n vector<int> ans;\n do{\n ll cost = 0;\n vector<vector<int>> dist(10, vector<int>(10));\n for(int i=0; i<9; i++){\n for(int j=0; j<9; j++){\n int ty = i/3, tx = i%3;\n int sy = j/3, sx = j%3;\n dist[arr[i]][arr[j]] = abs(ty-sy) + abs(tx-sx); \n }\n }\n for(auto e: mp){\n cost += e.second * dist[e.first[0]-'0'][e.first[1]-'0'];\n }\n if(tmp > cost) {\n tmp = cost;\n ans = arr;\n }else if(tmp == cost){\n bool f = true;\n for(int i=0; i<9; i++){\n if(arr[i] > ans[i]){\n f = false;\n break;\n }\n if(arr[i] < ans[i]){\n f = true;\n break;\n }\n }\n if(f){\n ans = arr;\n }\n }\n }while(next_permutation(all(arr)));\n REP(i,9){\n cout << ans[i];\n if(i%3 == 2) cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":3528,"score_of_the_acc":-0.8187,"final_rank":17},{"submission_id":"aoj_3053_4579490","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <map>\nusing namespace std;\nconst static int INFTY = (1 << 30);\nint nums[10][10];\nint xs[10], ys[10];\nmap<int, pair<int, int> > dist;\nchar a[100001];\n\nint main()\n{\n int N, curr, next;\n int test[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};\n int finalNum[10];\n scanf(\"%d\", &N);\n scanf(\"%s\", a);\n memset(nums, 0, sizeof (nums));\n curr = int(a[0] - '0');\n for (int i = 1; i < N; i++) {\n next = int(a[i] - '0');\n nums[curr][next]++;\n curr = next;\n }\n int global_min = INFTY;\n do {\n curr = 0;\n int idx = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) xs[test[idx]] = i, ys[test[idx++]] = j;\n }\n\n for (int i = 1; i <= 9; i++) {\n for (int j = 1; j <= 9; j++) {\n if (nums[i][j]) curr += nums[i][j] * (abs(xs[i] - xs[j]) + abs(ys[i] - ys[j]));\n }\n }\n if (curr < global_min) {\n for (int i = 0; i < 9; i++) finalNum[i] = test[i];\n global_min = curr;\n }\n\n } while (next_permutation(test, test+9));\n\n int idx = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) printf(\"%d\", finalNum[idx++]);\n printf(\"\\n\");\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2852,"score_of_the_acc":-0.0465,"final_rank":4},{"submission_id":"aoj_3053_4037119","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3053\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename F>\nvoid all_permutations(int n,F f){\n vector<int> vs(n);\n iota(vs.begin(),vs.end(),0);\n do f(vs); while(next_permutation(vs.begin(),vs.end()));\n}\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned ABC054_C(){\n int n,m;\n cin>>n>>m;\n int es[10][10]={};\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n es[a][b]=es[b][a]=1;\n }\n int ans=0;\n auto f=\n [&](const auto &vs){\n if(!es[0][vs[0]+1]) return;\n for(int i=0;i+1<n-1;i++)\n if(!es[vs[i]+1][vs[i+1]+1]) return;\n ans++;\n };\n all_permutations(n-1,f);\n cout<<ans<<endl;\n return 0;\n}\n/*\n verified on 2019/12/09\n https://atcoder.jp/contests/abc054/tasks/abc054_c\n*/\n\nsigned main(){\n ABC054_C();\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n int n;\n string s;\n cin>>n>>s;\n\n int c[10][10]={};\n for(int i=0;i+1<n;i++){\n int a=s[i]-'0',b=s[i+1]-'0';\n c[a][b]++;\n }\n\n int ans=n*100;\n vector<int> us;\n auto f=\n [&](auto vs){\n int x[10],y[10];\n for(int i=0;i<9;i++){\n x[vs[i]+1]=i%3;\n y[vs[i]+1]=i/3;\n }\n\n int res=0;\n for(int i=1;i<=9;i++)\n for(int j=1;j<=9;j++)\n res+=c[i][j]*(abs(x[i]-x[j])+abs(y[i]-y[j]));\n\n if(res<ans) ans=res,us=vs;\n };\n all_permutations(9,f);\n\n for(int i=0;i<9;i++){\n cout<<us[i]+1;\n if(i%3==2) cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3344,"score_of_the_acc":-0.107,"final_rank":6},{"submission_id":"aoj_3053_3894635","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3053.cc: \n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int M = 9;\nconst int W = 3;\nconst int INF = 1 << 30;\n\n/* typedef */\n\n/* global variables */\n\nchar s[MAX_N + 4];\nint mvs[M][M], ds[M][M], ps[M];\n\n/* subroutines */\n\ninline int ps2i(int ps[]) {\n int sum = 0;\n for (int i = 0; i < M; i++) sum = sum * 10 + ps[i];\n return sum;\n}\n\ninline void pos2xy(int pos, int &x, int &y) { x = pos % W, y = pos / W; }\ninline int xy2pos(int x, int y) { return y * W + x; }\n\ninline int dist(int pi, int pj) {\n int xi, yi, xj, yj;\n pos2xy(pi, xi, yi), pos2xy(pj, xj, yj);\n return abs(xj - xi) + abs(yj - yi);\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d%s\", &n, s);\n\n for (int i = 0, j = 1; j < n; i++, j++)\n if (s[i] != s[j]) {\n int di = s[i] - '1', dj = s[j] - '1';\n mvs[di][dj]++;\n }\n\n for (int i = 0; i < M; i++)\n for (int j = 0; j < M; j++) ds[i][j] = dist(i, j);\n for (int i = 0; i < M; i++) ps[i] = i;\n\n int mind = INF, minph = 0;\n\n do {\n //printf(\"%09d\\n\", ps2i(ps));\n int d = 0;\n for (int i = 0; i < M; i++)\n for (int j = 0; j < M; j++)\n\td += mvs[ps[i]][ps[j]] * ds[i][j];\n\n if (mind > d)\n mind = d, minph = ps2i(ps);\n else if (mind == d) {\n int ph = ps2i(ps);\n if (minph > ph) minph = ph;\n }\n } while (next_permutation(ps, ps + M));\n //printf(\"%09d\\n\", minph);\n\n for (int y = 0, e = 100000000; y < W; y++) {\n for (int x = 0; x < W; x++, e /= 10)\n putchar('1' + (minph / e) % 10);\n putchar('\\n');\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3260,"score_of_the_acc":-0.0309,"final_rank":1},{"submission_id":"aoj_3053_3776349","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define repr(i, n) REPR(i, n, 0)\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\n#define pb push_back\n#define all(r) r.begin(),r.end()\n#define rall(r) r.rbegin(),r.rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst int INF = 1e9;\nconst ll MOD = 1e9 + 7;\ndouble EPS = 1e-8;\n\nint cnt[9][9];\nint dist[9][9];\n\nint dx[] = {0, -1, 0, 1};\nint dy[] = {-1, 0, 1, 0};\n\nint main(){\n rep(i, 9) rep(j, 9) dist[i][j] = INF;\n rep(i, 9) dist[i][i] = 0;\n rep(y, 3) rep(x, 3) {\n int cur = y * 3 + x;\n rep(i, 4) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n if(nx < 0 || nx >= 3 || ny < 0 || ny >= 3) continue;\n int nxt = ny * 3 + nx;\n dist[cur][nxt] = 1;\n }\n }\n rep(k, 9) rep(i, 9) rep(j, 9) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n\n // rep(i, 9) {\n // rep(j, 9) cout << dist[i][j] << \" \";\n // cout << endl;\n // }\n\n // cout << endl;\n // rep(i, 9) {\n // rep(j, 9) cout << cnt[i][j] << \" \";\n // cout << endl;\n // }\n\n int n;\n string s;\n cin >> n >> s;\n rep(i, n-1) {\n cnt[s[i]-'1'][s[i+1]-'1']++;\n }\n // cout << n << endl << s << endl;\n\n\n // cout << endl;\n // rep(i, 9) {\n // rep(j, 9) cout << cnt[i][j] << \" \";\n // cout << endl;\n // }\n\n auto calc = [&](const vector<int>& a) {\n int ret = 0;\n rep(i, 9) rep(j, 9) ret += cnt[a[i]][a[j]] * dist[i][j];\n return ret;\n };\n\n vi a(9);\n rep(i, 9) a[i] = i;\n\n vi ans;\n int ans_cnt = INF;\n do {\n int tmp = calc(a);\n if(tmp < ans_cnt) {\n ans_cnt = tmp;\n ans = a;\n }\n // for(auto&& x : a) cout << \" \" << x;\n // cout << \" -> \" << tmp << endl;\n }while(next_permutation(all(a)));\n rep(i, 3) {\n rep(j, 3) {\n cout << ans[i*3+j]+1;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3340,"score_of_the_acc":-0.037,"final_rank":3},{"submission_id":"aoj_3053_3764547","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\nusing namespace std;\n\nint di[9] = {0, 0, 0, 1, 1, 1, 2, 2, 2};\nint dj[9] = {0, 1, 2, 0, 1, 2, 0, 1, 2};\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n int cnt[9][9] = {};\n for(int i = 1; i < s.length(); i++){\n int from = s[i-1]-'1', to = s[i]-'1';\n cnt[from][to]++;\n cnt[to][from]++;\n }\n vector<int> ans(9), arr(9);\n for(int i = 0; i < 9; i++) arr[i] = i;\n int ma = 1<<30;\n do{\n int rev[9];\n for(int i = 0; i < 9; i++){\n rev[arr[i]] = i;\n }\n int tmp = 0;\n for(int i = 0; i < 9; i++){\n for(int j = i+1; j < 9; j++){\n int dist = abs(di[rev[i]]-di[rev[j]])+abs(dj[rev[i]]-dj[rev[j]]);\n tmp += dist * cnt[i][j];\n }\n }\n if(tmp < ma){\n ma = tmp;\n ans = arr;\n }\n }while(next_permutation(arr.begin(), arr.end()));\n for(int i = 0; i < 3; i++){\n for(int j = 0; j < 3; j++){\n cout << ans[i*3+j]+1;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3284,"score_of_the_acc":-0.0327,"final_rank":2},{"submission_id":"aoj_3053_3764533","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\nusing namespace std;\n\nint di[9] = {0, 0, 0, 1, 1, 1, 2, 2, 2};\nint dj[9] = {0, 1, 2, 0, 1, 2, 0, 1, 2};\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n int cnt[9][9] = {};\n for(int i = 1; i < s.length(); i++){\n int from = s[i-1]-'1', to = s[i]-'1';\n cnt[from][to]++;\n cnt[to][from]++;\n }\n vector<int> ans(9), arr(9);\n for(int i = 0; i < 9; i++) arr[i] = i;\n int ma = 1<<30;\n do{\n map<int,int> m;\n for(int i = 0; i < 9; i++){\n m[arr[i]] = i;\n }\n int tmp = 0;\n for(int i = 0; i < 9; i++){\n for(int j = i+1; j < 9; j++){\n int dist = abs(di[m[i]]-di[m[j]])+abs(dj[m[i]]-dj[m[j]]);\n tmp += dist * cnt[i][j];\n }\n }\n if(tmp < ma){\n ma = tmp;\n ans = arr;\n }\n }while(next_permutation(arr.begin(), arr.end()));\n for(int i = 0; i < 3; i++){\n for(int j = 0; j < 3; j++){\n cout << ans[i*3+j]+1;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":450,"memory_kb":3256,"score_of_the_acc":-1.0306,"final_rank":18},{"submission_id":"aoj_3053_3659285","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n string s;\n cin>>n>>s;\n\n int c[10][10]={};\n for(int i=0;i+1<n;i++){\n int a=s[i]-'0',b=s[i+1]-'0';\n c[a][b]++;\n }\n\n vector<int> v(9);\n iota(v.begin(),v.end(),1);\n\n int ans=n*100;\n vector<int> u;\n do{\n int x[10],y[10];\n for(int i=0;i<9;i++){\n x[v[i]]=i%3;\n y[v[i]]=i/3;\n }\n\n int res=0;\n for(int i=1;i<=9;i++)\n for(int j=1;j<=9;j++)\n res+=c[i][j]*(abs(x[i]-x[j])+abs(y[i]-y[j]));\n\n if(res<ans) ans=res,u=v;\n }while(next_permutation(v.begin(),v.end()));\n\n for(int i=0;i<9;i++){\n cout<<u[i];\n if(i%3==2) cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3332,"score_of_the_acc":-0.1759,"final_rank":10},{"submission_id":"aoj_3053_3640708","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100005\n\nstruct LOC{\n\tvoid set(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nint LENGTH;\nint min_change;\n\nint table_index;\nint table[362880][9];\nint tmp_array[9],phone[3][3],ans[3][3],adj[10][10];\nbool used[10];\nchar buf[NUM];\nLOC loc[10];\n\nvoid recursive(int index){\n\n\tif(index == 9){\n\n\t\tfor(int i = 0; i < 9; i++){\n\t\t\ttable[table_index][i] = tmp_array[i];\n\t\t}\n\t\ttable_index++;\n\n\t\treturn;\n\t}\n\n\tfor(int i = 1; i <= 9; i++){\n\n\t\tif(used[i])continue;\n\t\ttmp_array[index] = i;\n\t\tused[i] = true;\n\t\trecursive(index+1);\n\t\tused[i] = false;\n\t}\n}\n\nvoid calc(int num_index){\n\n\tint index = 0;\n\n\t//電話を作成\n\tfor(int row = 0; row < 3; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tphone[row][col] = table[num_index][index++];\n\t\t\tloc[phone[row][col]].set(row,col);\n\t\t}\n\t}\n\n\tint count = 0;\n\t//指は最初の数字に合わせておく\n\n\tfor(int i = 1; i <= 9; i++){\n\t\tfor(int k = 1; k <= 9; k++){\n\t\t\tcount += (abs(loc[i].row-loc[k].row)+abs(loc[i].col-loc[k].col))*adj[i][k];\n\t\t}\n\t}\n\n\tif(count < min_change){\n\t\tfor(int row = 0; row < 3; row++){\n\t\t\tfor(int col = 0; col < 3; col++){\n\t\t\t\tans[row][col] = phone[row][col];\n\t\t\t}\n\t\t}\n\t\tmin_change = count;\n\t}\n}\n\n\n\nint main(){\n\n\tscanf(\"%d\",&LENGTH);\n\tscanf(\"%s\",buf);\n\n\tfor(int i = 1; i <= 9; i++){\n\t\tfor(int k = 1; k <= 9; k++){\n\t\t\tadj[i][k] = 0;\n\t\t}\n\t}\n\n\t//隣接回数を数える\n\tfor(int i = 1; i < LENGTH; i++){\n\n\t\tadj[buf[i]-'0'][buf[i-1]-'0']++;\n\t}\n\n\ttable_index = 0;\n\n\tfor(int i = 1; i <= 9; i++)used[i] = false;\n\n\t//9!の数列を作る\n\tfor(int i = 1; i <= 9; i++){\n\n\t\ttmp_array[0] = i;\n\t\tused[i] = true;\n\t\trecursive(1);\n\n\t\tused[i] = false;\n\t}\n\n\tmin_change = BIG_NUM;\n\n\tfor(int i = 0; i < table_index; i++){\n\n\t\tcalc(i);\n\t}\n\n\n\tfor(int row = 0; row < 3; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tprintf(\"%d\",ans[row][col]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":16052,"score_of_the_acc":-1.0698,"final_rank":19},{"submission_id":"aoj_3053_3512989","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\n\n\nsigned main(void) {\n int n;\n cin >> n;\n string s;\n cin >> s;\n int num[10][10] = {};\n rep(i,n-1)num[s[i]-'0'][s[i+1]-'0']++;\n vi v(9);\n rep(i,9)v[i] = i+1;\n vector<vi> ans(3,vi(3));\n int sum = LINF;\n do{\n int t = 0;\n rep(i,9)rep(j,9){\n int xa = i/3, ya = i%3;\n int xb = j/3, yb = j%3;\n t += num[v[i]][v[j]] * (abs(xa-xb) + abs(ya-yb));\n }\n if(t < sum){\n sum = t;\n rep(i,3)rep(j,3)ans[i][j] = v[i*3+j];\n }\n }while(next_permutation(all(v)));\n rep(i,3){\n rep(j,3)cout << ans[i][j];\n cout << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3304,"score_of_the_acc":-0.1273,"final_rank":8},{"submission_id":"aoj_3053_3481585","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\npair<int,string> v=make_pair(19191919,\"1919\");\nstring A=\"123456789\";\nchar pat[114514];\nint n,cnt[10][10];\n\nint cal(string s){\n int a[3][3],x[10],y[10],sum=0;\n r(i,3){\n r(j,3){\n int p=(s[i*3+j]-'0');\n a[i][j]=p;\n x[p]=j;\n y[p]=i;\n }\n }\n r(i,10){\n r(j,10){\n int X=abs(x[i]-x[j]);\n int Y=abs(y[i]-y[j]);\n sum += (X+Y)*cnt[i][j];\n }\n }\n return sum;\n}\n\nint main(){\n scanf(\"%d%s\",&n,pat);\n r(i,n-1){\n cnt[pat[i]-'0'][pat[i+1]-'0']++;\n }\n do{\n v=min(v,make_pair(cal(A),A));\n }while(next_permutation(A.begin(),A.end()));\n\n cout<<v.second.substr(0,3)<<endl;\n cout<<v.second.substr(3,3)<<endl;\n cout<<v.second.substr(6,3)<<endl;\n}","accuracy":1,"time_ms":80,"memory_kb":3340,"score_of_the_acc":-0.1765,"final_rank":11},{"submission_id":"aoj_3053_3424428","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef long double ld;\nconst int INF=1e9,MOD=1e9+7;\nconst ll LINF=1e18;\nusing namespace std;\n#define int long long\n//template\nint d[10][10];\n//main\nsigned main(){\n int N;string s;cin>>N>>s;\n std::vector<int> ans(9);\n memset(d,0,sizeof(d));\n for(int i=1;i<N;i++)d[s[i-1]-'0'][s[i]-'0']++;\n std::vector<int> v(9);\n for(int i=0;i<9;i++)v[i]=i+1;\n int mi=1e9;\n do{\n int res=0;\n for(int i=0;i<9;i++){\n for(int j=0;j<9;j++){\n res+=(abs(i/3-j/3)+abs(i%3-j%3))*d[v[i]][v[j]];\n }\n }\n if(res<mi){\n mi=res;\n for(int i=0;i<9;i++)ans[i]=v[i];\n }\n }while (std::next_permutation(v.begin(), v.end()));\n for(int i=0;i<9;i++){\n cout<<ans[i];\n if(i%3==2)cout<<endl;\n }\n /*\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++)cout<<d[i][j]<<\" \";\n cout<<endl;\n }\n */\n}","accuracy":1,"time_ms":80,"memory_kb":3368,"score_of_the_acc":-0.1786,"final_rank":12},{"submission_id":"aoj_3053_3423371","code_snippet":"#include <bits/stdc++.h>\n#define chmin(a, b) ((a)=min((a), (b)))\n#define chmax(a, b) ((a)=max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD=1e9+7;\nconst ll INF=1e18;\nconst double pi=acos(-1);\nconst double eps=1e-10;\n\nint dx[]={1, -1, 0, 0};\nint dy[]={0, 0, 1, -1};\n\nint main(){\n int n; cin>>n;\n string s; cin>>s;\n\n // count i -> j \n int num[10][10];\n memset(num, 0, sizeof(num));\n for(int i=0; i<n-1; i++){\n num[s[i]-'0'][s[i+1]-'0']++;\n }\n\n vector<int> v(9);\n iota(v.begin(), v.end(), 1);\n\n ll costmin=INF;\n vector<int> ans(9);\n do{\n int phone[3][3];\n for(int i=0; i<9; i++){\n phone[i/3][i%3]=v[i];\n }\n\n int cost[10][10];\n for(int i=0; i<9; i++){\n for(int j=0; j<9; j++){\n cost[phone[i/3][i%3]][phone[j/3][j%3]]=abs(i/3-j/3)+abs(i%3-j%3);\n }\n }\n\n ll sum=0;\n for(int i=1; i<=9; i++){\n for(int j=1; j<=9; j++){\n sum+=cost[i][j]*num[i][j];\n }\n }\n\n if(sum<costmin){\n costmin=sum;\n ans=v;\n }\n\n }while(next_permutation(v.begin(), v.end()));\n\n for(int i=0; i<9; i++){\n cout << ans[i];\n if((i+1)%3==0) cout << endl;\n }\n}","accuracy":1,"time_ms":130,"memory_kb":3368,"score_of_the_acc":-0.2949,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_3053_10892714\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nvoid solve(){\\n ll N; cin >> N;\\n string S; cin >> S;\\n vv<ll> cnt(9, vl(9, 0));\\n rep(i, N-1){\\n ll u = S[i] - '1', v = S[i+1] - '1';\\n if(u == v) continue;\\n if(u > v) swap(u, v);\\n cnt[u][v]++;\\n }\\n vl vec(9); iota(all(vec), 0);\\n ll ans = 4e18;\\n vl V;\\n do{\\n vl idx(9);\\n rep(i, 9){\\n idx[vec[i]] = i;\\n }\\n vv<ll> dist(9, vl(9));\\n ll tmp = 0;\\n rep(i, 9){\\n rep(k, i){\\n dist[k][i] = abs(idx[i] / 3 - idx[k]/3) + abs(idx[i] % 3 - idx[k] % 3);\\n tmp += dist[k][i] * cnt[k][i];\\n }\\n }\\n if(chmin(ans, tmp)) V = vec;\\n }while(next_permutation(all(vec)));\\n rep(i, 9){\\n V[i]++;\\n }\\n rep(i, 3){\\n cout << V[i*3] << V[i*3+1] << V[i*3+2] << endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.2189,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3053_10892649\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nvoid solve(){\\n ll N; cin >> N;\\n string S; cin >> S;\\n vv<ll> cnt(9, vl(9, 0));\\n rep(i, N-1){\\n ll u = S[i] - '1', v = S[i+1] - '1';\\n cnt[min(u, v)][max(u, v)]++;\\n }\\n vl vec(9); iota(all(vec), 0);\\n ll ans = 4e18;\\n vl perm;\\n do{\\n ll tmp = 0;\\n rep(i, 9){\\n rep(k, i){\\n tmp += cnt[k][i] * (abs(vec[i] / 3 - vec[k] / 3) + abs(vec[i] % 3 - vec[k] % 3));\\n }\\n }\\n if(chmin(ans, tmp)) perm = vec;\\n }while(next_permutation(all(vec)));\\n vl V(9);\\n rep(i, 9){\\n V[perm[i]] = i+1;\\n }\\n cout << V[0] << V[1] << V[2] << endl;\\n cout << V[3] << V[4] << V[5] << endl;\\n cout << V[6] << V[7] << V[8] << endl;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 20,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0445,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3053_10892549\",\n \"code_snippet\": \"#line 2 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\nusing namespace std;\\n\\n#include<bits/stdc++.h>\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\\\"\\nnamespace noya2 {\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &p){\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p){\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v){\\n int s = (int)v.size();\\n for (int i = 0; i < s; i++) os << (i ? \\\" \\\" : \\\"\\\") << v[i];\\n return os;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v){\\n for (auto &x : v) is >> x;\\n return is;\\n}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\n#line 6 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << std::min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(std::vector<T> &v){\\n std::sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\n\\nvoid solve(){\\n int n; in(n);\\n string s; in(s);\\n int sz = s.size();\\n vector<int> a(sz);\\n rep(i,sz){\\n a[i] = (int)(s[i] - '0') - 1;\\n }\\n vector b(9,vector<int>(9));\\n rep(i,sz-1){\\n b[a[i]][a[i+1]]++;\\n }\\n vector<int> p(9); iota(all(p),0);\\n int mi = iinf;\\n vector<int> ans(9,10);\\n do {\\n vector<int> pos(9);\\n rep(i,9){\\n pos[p[i]] = i;\\n }\\n int cur = 0;\\n rep(u,9) rep(v,9){\\n int ix = pos[u] / 3, iy = pos[u] % 3;\\n int jx = pos[v] / 3, jy = pos[v] % 3;\\n cur += (abs(ix - jx) + abs(iy - jy)) * b[u][v];\\n }\\n if (chmin(mi,cur)){\\n ans = p;\\n }\\n }while(next_permutation(all(p)));\\n rep(i,3){\\n rep(j,3){\\n int d = ans[i*3+j]+1;\\n cout << d;\\n }\\n cout << '\\\\n';\\n }\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.1311,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3053_10891047\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n int N;\\n cin >> N;\\n const int M = 9;\\n vector<int> p(N);\\n vector G(M, vector<int>(M));\\n rep(i, 0, N){\\n char c;\\n cin >> c;\\n p[i] = c - '1';\\n if (i) G[p[i - 1]][p[i]]++;\\n }\\n vector C(M, vector<int>(M));\\n rep(i, 0, M) rep(j, 0, M){\\n C[i][j] = abs(i / 3 - j / 3) + abs(i % 3 - j % 3);\\n }\\n vector<int> order(M);\\n rep(i, 0, M) order[i] = i;\\n int cost = INF;\\n vector<int> ans;\\n do{\\n vector<int> inv(M);\\n rep(i, 0, M) inv[order[i]] = i;\\n int tmp = 0;\\n rep(i, 0, M) rep(j, 0, M) tmp += C[inv[i]][inv[j]] * G[i][j];\\n if (chmin(cost, tmp)) ans = order;\\n }while (next_permutation(all(order)));\\n rep(i, 0, 3){\\n rep(j, 0, 3) cout << ans[i * 3 + j] + 1;\\n cout << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0488,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3053_7020428\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <numeric>\\n#include <string>\\n#include <bitset>\\n#include <assert.h>\\n#include <functional>\\n\\n// #define _GLIBCXX_DEBUG\\n// #define _LIBCPP_DEBUG 0\\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\\n#define revrep(i, n) for(int i = (int)(n - 1); i >= 0; --i)\\n#define range(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrange(i, s, t) for(int i = (int)(t - 1); i >= (int)(s); --i)\\n#define srange(i, s, t, step) for(int i = (int)(s); i < (int)(t); i+=int(step))\\n#define popcnt(x) __builtin_popcountll(x)\\n#define hayai std::ios::sync_with_stdio(false);std::cin.tie(nullptr)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, long long>;\\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\\ninline bool inside(int x, int y, int h, int w) { return (x >= 0 && x < h && y >= 0 && y < w); }\\nint dx[] = {0, -1, 0, 1};\\nint dy[] = {-1, 0, 1, 0};\\n\\nconst ll mod = 1e9+7;\\n\\nint main() {\\n int n; \\n cin >> n;\\n string s;\\n cin >> s;\\n\\n map<pii, int> cnt;\\n rep(i, n-1) {\\n int x = s[i] - '1';\\n int y = s[i + 1] - '1';\\n cnt[make_pair(x, y)]++;\\n }\\n\\n int cost = 1e9;\\n vector<int> perm(9), answer(9);\\n iota(perm.begin(), perm.end(), 0);\\n do {\\n vector<pii> loc(9);\\n rep(i, 9) {\\n loc[perm[i]].first = i / 3;\\n loc[perm[i]].second = i % 3;\\n }\\n int now_cost = 0;\\n for (auto [p, c]: cnt) {\\n now_cost += c * abs(loc[p.first].first - loc[p.second].first);\\n now_cost += c * abs(loc[p.first].second - loc[p.second].second);\\n }\\n if (now_cost < cost) {\\n cost = now_cost;\\n copy(perm.begin(), perm.end(), answer.begin());\\n }\\n } while(next_permutation(perm.begin(), perm.end()));\\n\\n rep(i, 3) {\\n rep(j, 3) {\\n cout << answer[i * 3 + j] + 1;\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.2342,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3053_7015306\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(){\\n int n; cin >> n;\\n string s; cin >> s;\\n\\n vector<int> vec, ans;\\n int mincost = 1 << 30;\\n for(int i = 1; i <= 9; i++){\\n vec.emplace_back(i);\\n ans.emplace_back(i);\\n }\\n\\n vector<vector<int>> cnt(10, vector<int>(10, 0));\\n for(int i = 1; i < n; i++) cnt[s[i-1]-'0'][s[i]-'0']++;\\n\\n do{\\n vector<vector<int>> cost(10, vector<int>(10));\\n for(int i = 0; i < 9; i++){\\n for(int j = 0; j < 9; j++){\\n int ix = i/3, iy = i%3;\\n int jx = j/3, jy = j%3;\\n cost[vec[i]][vec[j]] = abs(ix-jx)+abs(iy-jy);\\n }\\n }\\n int res = 0;\\n for(int i = 1; i <= 9; i++){\\n for(int j = 1; j <= 9; j++){\\n res += cost[i][j]*cnt[i][j];\\n }\\n }\\n if(mincost > res){\\n mincost = res;\\n ans = vec;\\n }\\n }while(next_permutation(vec.begin(), vec.end()));\\n\\n for(int i = 0; i < 9; i++){\\n cout << ans[i];\\n if(i%3 == 2) cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.2626,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3053_5092471\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#define REP(i,num) for(ll i=0;i<(num);++i)\\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\\n#define LOOP(i) while(i--)\\n#define ALL(c) c.begin(),c.end()\\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\\n\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\n\\nconstexpr ll atcoder_mod = 1e9+7;\\n\\ntemplate<typename T=ll>\\nT in(){ T x; cin >> x; return (x); }\\ntemplate<typename T=ll,typename C=vector<T>>\\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\\n\\nvoid vout(){ cout << endl; }\\ntemplate<typename Head,typename... Tail>\\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\\nvoid out(){ cout << endl; }\\ntemplate<typename Head,typename... Tail>\\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\\n\\ntemplate<typename T>\\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\\ntemplate<typename T>\\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(10);\\n\\n\\tauto N=in();\\n\\tstring S=in<string>();\\n\\t\\n\\tvvll C(10,vll(10,0));\\n\\tREP(i,N-1){\\n\\t\\tll L=S[i]-'0';\\n\\t\\tll R=S[i+1]-'0';\\n\\t\\tC[R][L]++;\\n\\t}\\n\\n\\tvll P(9),AP;\\n\\tiota(ALL(P),1);\\n\\tll A=1ll<<60;\\n\\tdo{\\n\\t\\tvll T(9);\\n\\t\\tREP(i,9){\\n\\t\\t\\tT[P[i]-1]=i;\\n\\t\\t}\\n\\t\\tll sum=0;\\n\\t\\tREP(i,9){\\n\\t\\t\\tll v=T[i];\\n\\t\\t\\tREP(j,9){\\n\\t\\t\\t\\tll u=T[j];\\n\\t\\t\\t\\tll F=abs((v%3)-(u%3))+abs((v/3)-(u/3));\\n\\t\\t\\t\\tsum += C[i+1][j+1]*F;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(sum<A){\\n\\t\\t\\tA=sum;\\n\\t\\t\\tAP=P;\\n\\t\\t}\\n\\t\\telse if(sum==A){\\n\\t\\t\\tif(lexicographical_compare(ALL(P),ALL(AP))){\\n\\t\\t\\t\\tAP=P;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} while(next_permutation(ALL(P)));\\n\\n\\tcout << AP[0] << AP[1] << AP[2] << endl;\\n\\tcout << AP[3] << AP[4] << AP[5] << endl;\\n\\tcout << AP[6] << AP[7] << AP[8] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.1255,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3053_4942747\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-7, PI = acos(-1);\\n//ここから編集\\n\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n int N; cin >> N;\\n string s; cin >> s;\\n \\n map<string, int> mp;\\n for(int i=0; i<s.size()-1; i++){\\n string t=\\\"\\\";\\n t += s[i];\\n t += s[i+1];\\n mp[t]++;\\n }\\n\\n vector<pair<int, string>> vp;\\n for(int i=1; i<10; i++){\\n for(int j=1; j<10; j++){\\n string t = \\\"\\\";\\n t += (char)('0' + i);\\n t += (char)('0' + j);\\n mp[t];\\n }\\n }\\n \\n vector<int> arr;\\n for(int i=1; i<10; i++) arr.push_back(i);\\n ll tmp = INT_MAX;\\n vector<int> ans;\\n do{\\n ll cost = 0;\\n vector<vector<int>> dist(10, vector<int>(10));\\n for(int i=0; i<9; i++){\\n for(int j=0; j<9; j++){\\n int ty = i/3, tx = i%3;\\n int sy = j/3, sx = j%3;\\n dist[arr[i]][arr[j]] = abs(ty-sy) + abs(tx-sx); \\n }\\n }\\n for(auto e: mp){\\n cost += e.second * dist[e.first[0]-'0'][e.first[1]-'0'];\\n }\\n if(tmp > cost) {\\n tmp = cost;\\n ans = arr;\\n }else if(tmp == cost){\\n bool f = true;\\n for(int i=0; i<9; i++){\\n if(arr[i] > ans[i]){\\n f = false;\\n break;\\n }\\n if(arr[i] < ans[i]){\\n f = true;\\n break;\\n }\\n }\\n if(f){\\n ans = arr;\\n }\\n }\\n }while(next_permutation(all(arr)));\\n REP(i,9){\\n cout << ans[i];\\n if(i%3 == 2) cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.8187,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3053_4579490\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\nconst static int INFTY = (1 << 30);\\nint nums[10][10];\\nint xs[10], ys[10];\\nmap<int, pair<int, int> > dist;\\nchar a[100001];\\n\\nint main()\\n{\\n int N, curr, next;\\n int test[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};\\n int finalNum[10];\\n scanf(\\\"%d\\\", &N);\\n scanf(\\\"%s\\\", a);\\n memset(nums, 0, sizeof (nums));\\n curr = int(a[0] - '0');\\n for (int i = 1; i < N; i++) {\\n next = int(a[i] - '0');\\n nums[curr][next]++;\\n curr = next;\\n }\\n int global_min = INFTY;\\n do {\\n curr = 0;\\n int idx = 0;\\n for (int i = 0; i < 3; i++) {\\n for (int j = 0; j < 3; j++) xs[test[idx]] = i, ys[test[idx++]] = j;\\n }\\n\\n for (int i = 1; i <= 9; i++) {\\n for (int j = 1; j <= 9; j++) {\\n if (nums[i][j]) curr += nums[i][j] * (abs(xs[i] - xs[j]) + abs(ys[i] - ys[j]));\\n }\\n }\\n if (curr < global_min) {\\n for (int i = 0; i < 9; i++) finalNum[i] = test[i];\\n global_min = curr;\\n }\\n\\n } while (next_permutation(test, test+9));\\n\\n int idx = 0;\\n for (int i = 0; i < 3; i++) {\\n for (int j = 0; j < 3; j++) printf(\\\"%d\\\", finalNum[idx++]);\\n printf(\\\"\\\\n\\\");\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2852,\n \"score_of_the_acc\": -0.0465,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3053_4037119\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3053\\\"\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename F>\\nvoid all_permutations(int n,F f){\\n vector<int> vs(n);\\n iota(vs.begin(),vs.end(),0);\\n do f(vs); while(next_permutation(vs.begin(),vs.end()));\\n}\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned ABC054_C(){\\n int n,m;\\n cin>>n>>m;\\n int es[10][10]={};\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n es[a][b]=es[b][a]=1;\\n }\\n int ans=0;\\n auto f=\\n [&](const auto &vs){\\n if(!es[0][vs[0]+1]) return;\\n for(int i=0;i+1<n-1;i++)\\n if(!es[vs[i]+1][vs[i+1]+1]) return;\\n ans++;\\n };\\n all_permutations(n-1,f);\\n cout<<ans<<endl;\\n return 0;\\n}\\n/*\\n verified on 2019/12/09\\n https://atcoder.jp/contests/abc054/tasks/abc054_c\\n*/\\n\\nsigned main(){\\n ABC054_C();\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n int n;\\n string s;\\n cin>>n>>s;\\n\\n int c[10][10]={};\\n for(int i=0;i+1<n;i++){\\n int a=s[i]-'0',b=s[i+1]-'0';\\n c[a][b]++;\\n }\\n\\n int ans=n*100;\\n vector<int> us;\\n auto f=\\n [&](auto vs){\\n int x[10],y[10];\\n for(int i=0;i<9;i++){\\n x[vs[i]+1]=i%3;\\n y[vs[i]+1]=i/3;\\n }\\n\\n int res=0;\\n for(int i=1;i<=9;i++)\\n for(int j=1;j<=9;j++)\\n res+=c[i][j]*(abs(x[i]-x[j])+abs(y[i]-y[j]));\\n\\n if(res<ans) ans=res,us=vs;\\n };\\n all_permutations(9,f);\\n\\n for(int i=0;i<9;i++){\\n cout<<us[i]+1;\\n if(i%3==2) cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.107,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3053_3894635\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3053.cc: \\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int M = 9;\\nconst int W = 3;\\nconst int INF = 1 << 30;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nchar s[MAX_N + 4];\\nint mvs[M][M], ds[M][M], ps[M];\\n\\n/* subroutines */\\n\\ninline int ps2i(int ps[]) {\\n int sum = 0;\\n for (int i = 0; i < M; i++) sum = sum * 10 + ps[i];\\n return sum;\\n}\\n\\ninline void pos2xy(int pos, int &x, int &y) { x = pos % W, y = pos / W; }\\ninline int xy2pos(int x, int y) { return y * W + x; }\\n\\ninline int dist(int pi, int pj) {\\n int xi, yi, xj, yj;\\n pos2xy(pi, xi, yi), pos2xy(pj, xj, yj);\\n return abs(xj - xi) + abs(yj - yi);\\n}\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d%s\\\", &n, s);\\n\\n for (int i = 0, j = 1; j < n; i++, j++)\\n if (s[i] != s[j]) {\\n int di = s[i] - '1', dj = s[j] - '1';\\n mvs[di][dj]++;\\n }\\n\\n for (int i = 0; i < M; i++)\\n for (int j = 0; j < M; j++) ds[i][j] = dist(i, j);\\n for (int i = 0; i < M; i++) ps[i] = i;\\n\\n int mind = INF, minph = 0;\\n\\n do {\\n //printf(\\\"%09d\\\\n\\\", ps2i(ps));\\n int d = 0;\\n for (int i = 0; i < M; i++)\\n for (int j = 0; j < M; j++)\\n\\td += mvs[ps[i]][ps[j]] * ds[i][j];\\n\\n if (mind > d)\\n mind = d, minph = ps2i(ps);\\n else if (mind == d) {\\n int ph = ps2i(ps);\\n if (minph > ph) minph = ph;\\n }\\n } while (next_permutation(ps, ps + M));\\n //printf(\\\"%09d\\\\n\\\", minph);\\n\\n for (int y = 0, e = 100000000; y < W; y++) {\\n for (int x = 0; x < W; x++, e /= 10)\\n putchar('1' + (minph / e) % 10);\\n putchar('\\\\n');\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.0309,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3053_3776349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define rep(i,n) REP(i,0,n)\\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\\n#define repr(i, n) REPR(i, n, 0)\\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\\n#define pb push_back\\n#define all(r) r.begin(),r.end()\\n#define rall(r) r.rbegin(),r.rend()\\n#define fi first\\n#define se second\\n \\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n \\nconst int INF = 1e9;\\nconst ll MOD = 1e9 + 7;\\ndouble EPS = 1e-8;\\n\\nint cnt[9][9];\\nint dist[9][9];\\n\\nint dx[] = {0, -1, 0, 1};\\nint dy[] = {-1, 0, 1, 0};\\n\\nint main(){\\n rep(i, 9) rep(j, 9) dist[i][j] = INF;\\n rep(i, 9) dist[i][i] = 0;\\n rep(y, 3) rep(x, 3) {\\n int cur = y * 3 + x;\\n rep(i, 4) {\\n int nx = x + dx[i];\\n int ny = y + dy[i];\\n if(nx < 0 || nx >= 3 || ny < 0 || ny >= 3) continue;\\n int nxt = ny * 3 + nx;\\n dist[cur][nxt] = 1;\\n }\\n }\\n rep(k, 9) rep(i, 9) rep(j, 9) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n\\n // rep(i, 9) {\\n // rep(j, 9) cout << dist[i][j] << \\\" \\\";\\n // cout << endl;\\n // }\\n\\n // cout << endl;\\n // rep(i, 9) {\\n // rep(j, 9) cout << cnt[i][j] << \\\" \\\";\\n // cout << endl;\\n // }\\n\\n int n;\\n string s;\\n cin >> n >> s;\\n rep(i, n-1) {\\n cnt[s[i]-'1'][s[i+1]-'1']++;\\n }\\n // cout << n << endl << s << endl;\\n\\n\\n // cout << endl;\\n // rep(i, 9) {\\n // rep(j, 9) cout << cnt[i][j] << \\\" \\\";\\n // cout << endl;\\n // }\\n\\n auto calc = [&](const vector<int>& a) {\\n int ret = 0;\\n rep(i, 9) rep(j, 9) ret += cnt[a[i]][a[j]] * dist[i][j];\\n return ret;\\n };\\n\\n vi a(9);\\n rep(i, 9) a[i] = i;\\n\\n vi ans;\\n int ans_cnt = INF;\\n do {\\n int tmp = calc(a);\\n if(tmp < ans_cnt) {\\n ans_cnt = tmp;\\n ans = a;\\n }\\n // for(auto&& x : a) cout << \\\" \\\" << x;\\n // cout << \\\" -> \\\" << tmp << endl;\\n }while(next_permutation(all(a)));\\n rep(i, 3) {\\n rep(j, 3) {\\n cout << ans[i*3+j]+1;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.037,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3053_3764547\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\n\\nint di[9] = {0, 0, 0, 1, 1, 1, 2, 2, 2};\\nint dj[9] = {0, 1, 2, 0, 1, 2, 0, 1, 2};\\n\\nint main(){\\n int n;\\n cin >> n;\\n string s;\\n cin >> s;\\n int cnt[9][9] = {};\\n for(int i = 1; i < s.length(); i++){\\n int from = s[i-1]-'1', to = s[i]-'1';\\n cnt[from][to]++;\\n cnt[to][from]++;\\n }\\n vector<int> ans(9), arr(9);\\n for(int i = 0; i < 9; i++) arr[i] = i;\\n int ma = 1<<30;\\n do{\\n int rev[9];\\n for(int i = 0; i < 9; i++){\\n rev[arr[i]] = i;\\n }\\n int tmp = 0;\\n for(int i = 0; i < 9; i++){\\n for(int j = i+1; j < 9; j++){\\n int dist = abs(di[rev[i]]-di[rev[j]])+abs(dj[rev[i]]-dj[rev[j]]);\\n tmp += dist * cnt[i][j];\\n }\\n }\\n if(tmp < ma){\\n ma = tmp;\\n ans = arr;\\n }\\n }while(next_permutation(arr.begin(), arr.end()));\\n for(int i = 0; i < 3; i++){\\n for(int j = 0; j < 3; j++){\\n cout << ans[i*3+j]+1;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.0327,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3053_3764533\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\n\\nint di[9] = {0, 0, 0, 1, 1, 1, 2, 2, 2};\\nint dj[9] = {0, 1, 2, 0, 1, 2, 0, 1, 2};\\n\\nint main(){\\n int n;\\n cin >> n;\\n string s;\\n cin >> s;\\n int cnt[9][9] = {};\\n for(int i = 1; i < s.length(); i++){\\n int from = s[i-1]-'1', to = s[i]-'1';\\n cnt[from][to]++;\\n cnt[to][from]++;\\n }\\n vector<int> ans(9), arr(9);\\n for(int i = 0; i < 9; i++) arr[i] = i;\\n int ma = 1<<30;\\n do{\\n map<int,int> m;\\n for(int i = 0; i < 9; i++){\\n m[arr[i]] = i;\\n }\\n int tmp = 0;\\n for(int i = 0; i < 9; i++){\\n for(int j = i+1; j < 9; j++){\\n int dist = abs(di[m[i]]-di[m[j]])+abs(dj[m[i]]-dj[m[j]]);\\n tmp += dist * cnt[i][j];\\n }\\n }\\n if(tmp < ma){\\n ma = tmp;\\n ans = arr;\\n }\\n }while(next_permutation(arr.begin(), arr.end()));\\n for(int i = 0; i < 3; i++){\\n for(int j = 0; j < 3; j++){\\n cout << ans[i*3+j]+1;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -1.0306,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3053_3659285\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n string s;\\n cin>>n>>s;\\n\\n int c[10][10]={};\\n for(int i=0;i+1<n;i++){\\n int a=s[i]-'0',b=s[i+1]-'0';\\n c[a][b]++;\\n }\\n\\n vector<int> v(9);\\n iota(v.begin(),v.end(),1);\\n\\n int ans=n*100;\\n vector<int> u;\\n do{\\n int x[10],y[10];\\n for(int i=0;i<9;i++){\\n x[v[i]]=i%3;\\n y[v[i]]=i/3;\\n }\\n\\n int res=0;\\n for(int i=1;i<=9;i++)\\n for(int j=1;j<=9;j++)\\n res+=c[i][j]*(abs(x[i]-x[j])+abs(y[i]-y[j]));\\n\\n if(res<ans) ans=res,u=v;\\n }while(next_permutation(v.begin(),v.end()));\\n\\n for(int i=0;i<9;i++){\\n cout<<u[i];\\n if(i%3==2) cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.1759,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3053_3640708\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100005\\n\\nstruct LOC{\\n\\tvoid set(int arg_row,int arg_col){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t}\\n\\tint row,col;\\n};\\n\\nint LENGTH;\\nint min_change;\\n\\nint table_index;\\nint table[362880][9];\\nint tmp_array[9],phone[3][3],ans[3][3],adj[10][10];\\nbool used[10];\\nchar buf[NUM];\\nLOC loc[10];\\n\\nvoid recursive(int index){\\n\\n\\tif(index == 9){\\n\\n\\t\\tfor(int i = 0; i < 9; i++){\\n\\t\\t\\ttable[table_index][i] = tmp_array[i];\\n\\t\\t}\\n\\t\\ttable_index++;\\n\\n\\t\\treturn;\\n\\t}\\n\\n\\tfor(int i = 1; i <= 9; i++){\\n\\n\\t\\tif(used[i])continue;\\n\\t\\ttmp_array[index] = i;\\n\\t\\tused[i] = true;\\n\\t\\trecursive(index+1);\\n\\t\\tused[i] = false;\\n\\t}\\n}\\n\\nvoid calc(int num_index){\\n\\n\\tint index = 0;\\n\\n\\t//電話を作成\\n\\tfor(int row = 0; row < 3; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tphone[row][col] = table[num_index][index++];\\n\\t\\t\\tloc[phone[row][col]].set(row,col);\\n\\t\\t}\\n\\t}\\n\\n\\tint count = 0;\\n\\t//指は最初の数字に合わせておく\\n\\n\\tfor(int i = 1; i <= 9; i++){\\n\\t\\tfor(int k = 1; k <= 9; k++){\\n\\t\\t\\tcount += (abs(loc[i].row-loc[k].row)+abs(loc[i].col-loc[k].col))*adj[i][k];\\n\\t\\t}\\n\\t}\\n\\n\\tif(count < min_change){\\n\\t\\tfor(int row = 0; row < 3; row++){\\n\\t\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\t\\tans[row][col] = phone[row][col];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmin_change = count;\\n\\t}\\n}\\n\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&LENGTH);\\n\\tscanf(\\\"%s\\\",buf);\\n\\n\\tfor(int i = 1; i <= 9; i++){\\n\\t\\tfor(int k = 1; k <= 9; k++){\\n\\t\\t\\tadj[i][k] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\t//隣接回数を数える\\n\\tfor(int i = 1; i < LENGTH; i++){\\n\\n\\t\\tadj[buf[i]-'0'][buf[i-1]-'0']++;\\n\\t}\\n\\n\\ttable_index = 0;\\n\\n\\tfor(int i = 1; i <= 9; i++)used[i] = false;\\n\\n\\t//9!の数列を作る\\n\\tfor(int i = 1; i <= 9; i++){\\n\\n\\t\\ttmp_array[0] = i;\\n\\t\\tused[i] = true;\\n\\t\\trecursive(1);\\n\\n\\t\\tused[i] = false;\\n\\t}\\n\\n\\tmin_change = BIG_NUM;\\n\\n\\tfor(int i = 0; i < table_index; i++){\\n\\n\\t\\tcalc(i);\\n\\t}\\n\\n\\n\\tfor(int row = 0; row < 3; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tprintf(\\\"%d\\\",ans[row][col]);\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 16052,\n \"score_of_the_acc\": -1.0698,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3053_3512989\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<cctype>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define LINF (ll)INF*INF\\n#define MOD 1000000007\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define loop(i,a,n) for(int i=a;i<(n);i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\n\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vp;\\n\\nint gcd(int a, int b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\nint lcm(int a, int b){\\n return a/gcd(a,b)*b;\\n}\\n\\n\\nsigned main(void) {\\n int n;\\n cin >> n;\\n string s;\\n cin >> s;\\n int num[10][10] = {};\\n rep(i,n-1)num[s[i]-'0'][s[i+1]-'0']++;\\n vi v(9);\\n rep(i,9)v[i] = i+1;\\n vector<vi> ans(3,vi(3));\\n int sum = LINF;\\n do{\\n int t = 0;\\n rep(i,9)rep(j,9){\\n int xa = i/3, ya = i%3;\\n int xb = j/3, yb = j%3;\\n t += num[v[i]][v[j]] * (abs(xa-xb) + abs(ya-yb));\\n }\\n if(t < sum){\\n sum = t;\\n rep(i,3)rep(j,3)ans[i][j] = v[i*3+j];\\n }\\n }while(next_permutation(all(v)));\\n rep(i,3){\\n rep(j,3)cout << ans[i][j];\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.1273,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3053_3481585\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\npair<int,string> v=make_pair(19191919,\\\"1919\\\");\\nstring A=\\\"123456789\\\";\\nchar pat[114514];\\nint n,cnt[10][10];\\n\\nint cal(string s){\\n int a[3][3],x[10],y[10],sum=0;\\n r(i,3){\\n r(j,3){\\n int p=(s[i*3+j]-'0');\\n a[i][j]=p;\\n x[p]=j;\\n y[p]=i;\\n }\\n }\\n r(i,10){\\n r(j,10){\\n int X=abs(x[i]-x[j]);\\n int Y=abs(y[i]-y[j]);\\n sum += (X+Y)*cnt[i][j];\\n }\\n }\\n return sum;\\n}\\n\\nint main(){\\n scanf(\\\"%d%s\\\",&n,pat);\\n r(i,n-1){\\n cnt[pat[i]-'0'][pat[i+1]-'0']++;\\n }\\n do{\\n v=min(v,make_pair(cal(A),A));\\n }while(next_permutation(A.begin(),A.end()));\\n\\n cout<<v.second.substr(0,3)<<endl;\\n cout<<v.second.substr(3,3)<<endl;\\n cout<<v.second.substr(6,3)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.1765,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3053_3424428\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef long double ld;\\nconst int INF=1e9,MOD=1e9+7;\\nconst ll LINF=1e18;\\nusing namespace std;\\n#define int long long\\n//template\\nint d[10][10];\\n//main\\nsigned main(){\\n int N;string s;cin>>N>>s;\\n std::vector<int> ans(9);\\n memset(d,0,sizeof(d));\\n for(int i=1;i<N;i++)d[s[i-1]-'0'][s[i]-'0']++;\\n std::vector<int> v(9);\\n for(int i=0;i<9;i++)v[i]=i+1;\\n int mi=1e9;\\n do{\\n int res=0;\\n for(int i=0;i<9;i++){\\n for(int j=0;j<9;j++){\\n res+=(abs(i/3-j/3)+abs(i%3-j%3))*d[v[i]][v[j]];\\n }\\n }\\n if(res<mi){\\n mi=res;\\n for(int i=0;i<9;i++)ans[i]=v[i];\\n }\\n }while (std::next_permutation(v.begin(), v.end()));\\n for(int i=0;i<9;i++){\\n cout<<ans[i];\\n if(i%3==2)cout<<endl;\\n }\\n /*\\n for(int i=0;i<10;i++){\\n for(int j=0;j<10;j++)cout<<d[i][j]<<\\\" \\\";\\n cout<<endl;\\n }\\n */\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.1786,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3053_3423371\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define chmin(a, b) ((a)=min((a), (b)))\\n#define chmax(a, b) ((a)=max((a), (b)))\\n#define fs first\\n#define sc second\\n#define eb emplace_back\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef tuple<int, int, int> T;\\n\\nconst ll MOD=1e9+7;\\nconst ll INF=1e18;\\nconst double pi=acos(-1);\\nconst double eps=1e-10;\\n\\nint dx[]={1, -1, 0, 0};\\nint dy[]={0, 0, 1, -1};\\n\\nint main(){\\n int n; cin>>n;\\n string s; cin>>s;\\n\\n // count i -> j \\n int num[10][10];\\n memset(num, 0, sizeof(num));\\n for(int i=0; i<n-1; i++){\\n num[s[i]-'0'][s[i+1]-'0']++;\\n }\\n\\n vector<int> v(9);\\n iota(v.begin(), v.end(), 1);\\n\\n ll costmin=INF;\\n vector<int> ans(9);\\n do{\\n int phone[3][3];\\n for(int i=0; i<9; i++){\\n phone[i/3][i%3]=v[i];\\n }\\n\\n int cost[10][10];\\n for(int i=0; i<9; i++){\\n for(int j=0; j<9; j++){\\n cost[phone[i/3][i%3]][phone[j/3][j%3]]=abs(i/3-j/3)+abs(i%3-j%3);\\n }\\n }\\n\\n ll sum=0;\\n for(int i=1; i<=9; i++){\\n for(int j=1; j<=9; j++){\\n sum+=cost[i][j]*num[i][j];\\n }\\n }\\n\\n if(sum<costmin){\\n costmin=sum;\\n ans=v;\\n }\\n\\n }while(next_permutation(v.begin(), v.end()));\\n\\n for(int i=0; i<9; i++){\\n cout << ans[i];\\n if((i+1)%3==0) cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.2949,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1895,"cells":{"group_id":{"kind":"string","value":"aoj_3056_cpp"},"problem_description":{"kind":"string","value":"Problem F: Equilateral Triangle\nProblem\n$N$個の頂点からなる凸多角形が与えられる。\nその凸多角形の全ての頂点を含む正三角形を考えるとき、その正三角形の一辺の長さの最小値を求めよ。\nInput\n入力は以下の形式ですべて整数で与えられる。\n$N$\n$px_1$ $py_1$\n$px_2$ $py_2$\n$\\vdots$\n$px_N$ $py_N$\n$1$行目には凸多角形の頂点数を表す整数$N$が与えられる。\n続く$N$行には凸多角形の各頂点の情報が反時計周りの順で与えられる。\n$1+i$行目には$i$番目の頂点の座標を表す$px_i$,$py_i$が空白区切りで与えられる。\nConstraints\n入力は以下の条件を満たす。\n$3 \\le N \\le 10000$\n$-10^9 \\le px_i, py_i \\le 10^9$\n凸多角形の頂点のうちどの3点を選んでも、同一直線上には存在しない\nOutput\n条件を満たす正三角形の一辺の長さの最小値を出力せよ。\nただし、$10^{-5}$ までの絶対誤差または相対誤差は許容される。\nSample Input 1\n4\n2 3\n1 2\n2 1\n3 2\nSample Output 1\n3.04720672\nSample Input 2\n7\n-96469 25422\n-55204 -45592\n-29140 -72981\n98837 -86795\n92303 63297\n19059 96012\n-67980 70342\nSample Output 2\n310622.35426197"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3056_10891318","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\nusing ld = long double;\nconst ld pi = acos(-1);\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n int N;\n cin >> N;\n vector<ll> X(N), Y(N);\n rep(i, 0, N) cin >> X[i] >> Y[i];\n rep(i, 0, N * 2) X.push_back(X[i]), Y.push_back(Y[i]);\n auto f = [&](ld deg) -> ld {\n ld A = -sinl(deg);\n ld B = cosl(deg);\n ld res = INF;\n rep(i, 0, N) chmin(res, A * (ld)X[i] + B * (ld)Y[i]);\n return -res;\n };\n ld ans = ILL;\n rep(i, 0, N){\n ll dx = X[i + 1] - X[i];\n ll dy = Y[i + 1] - Y[i];\n ld deg = 0;\n if (dx == 0){\n if (dy > 0) deg = pi / 2;\n else deg = pi + pi / 2;\n }\n else if (dy == 0){\n if (dx > 0) deg = 0;\n else deg = pi;\n }\n else{\n deg = atan((ld)(dy) / (ld)(dx));\n if (dx < 0) deg += pi;\n }\n ld sum = 0;\n rep(j, 0, 3){\n sum += f(deg + (pi * 2 * j) / 3);\n }\n chmin(ans, sum);\n }\n ans /= sqrtl(3);\n ans *= 2;\n cout << fixed << setprecision(20) << ans << \"\\n\";\n}","accuracy":1,"time_ms":670,"memory_kb":4196,"score_of_the_acc":-0.5913,"final_rank":11},{"submission_id":"aoj_3056_10891280","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\nusing ld = long double;\nconst ld pi = acos(-1);\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n int N;\n cin >> N;\n vector<ll> X(N), Y(N);\n rep(i, 0, N) cin >> X[i] >> Y[i];\n rep(i, 0, N * 2) X.push_back(X[i]), Y.push_back(Y[i]);\n auto f = [&](ld deg) -> ld {\n ld A = sinl(deg);\n ld B = cosl(deg);\n ld res = INF;\n rep(i, 0, N) chmin(res, A * X[i] + B * Y[i]);\n return -res;\n };\n ld ans = INF;\n rep(i, 0, N){\n ll dx = X[i + 1] - X[i];\n ll dy = Y[i + 1] - Y[i];\n ld deg = 0;\n if (dx == 0){\n if (dy > 0) deg = pi / 2;\n else deg = pi + pi / 2;\n }\n else if (dy == 0){\n if (dx > 0) deg = 0;\n else deg = pi;\n }\n else{\n deg = atan((ld)(dy) / (ld)(dx));\n if (dx < 0) deg = pi - deg;\n else if (dy < 0) deg += pi * 2;\n }\n ld sum = 0;\n rep(j, 0, 3){\n sum += f(deg + (pi * 2 * j) / 3);\n }\n chmin(ans, sum);\n }\n ans /= sqrtl(3);\n ans *= 2;\n cout << fixed << setprecision(20) << ans << \"\\n\";\n}\n// わかっていない","accuracy":0.375,"time_ms":650,"memory_kb":4212,"score_of_the_acc":-0.5907,"final_rank":17},{"submission_id":"aoj_3056_5931720","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 10005\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nPoint point[SIZE];\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\t//move = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\t//ret = ret+base;\n\n\treturn ret;\n}\n\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\n\tfor(int i = 0; i < N; i++){\n\n\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t}\n\n\tdouble ans = HUGE_NUM;\n\n\tPoint center = Point(0,0);\n\n\tdouble num = sqrt(3);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tPoint base = point[i];\n\t\tint k = (i+1)%N;\n\n\t\tdouble rad = calc_rad(point[k]-base);\n\n\t\tdouble L = 0,R = 0;\n\n\t\tfor(int a = 0; a < N; a++){\n\n\t\t\tPoint tmp_p = point[a]-base;\n\t\t\ttmp_p = rotate(center,tmp_p,-rad);\n\n\t\t\t//左下方向60度の直線とx軸の交点\n\t\t\tdouble tmp_L = (num*tmp_p.x-tmp_p.y)/num;\n\t\t\tL = min(L,tmp_L);\n\n\t\t\t//右下方向60度の直線とx軸の交点\n\t\t\tdouble tmp_R = (num*tmp_p.x+tmp_p.y)/num;\n\t\t\tR = max(R,tmp_R);\n\t\t}\n\n\t\tans = min(ans,R-L);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":2860,"memory_kb":3908,"score_of_the_acc":-1.2435,"final_rank":16},{"submission_id":"aoj_3056_4805965","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\nstruct P{\n double X;\n double Y;\n P(double x=0.0, double y=0.0): X(x),Y(y){}\n\n inline const P inv() const { return P(X/(X*X+Y*Y), -Y/(X*X+Y*Y)); }\n inline const P operator -() const { return P(-X, -Y); }\n inline const P operator +(const P& a) const { return P(X+a.X, Y+a.Y); }\n inline const P operator -(const P& a) const { return P(X-a.X, Y-a.Y); }\n inline const P operator *(const P& a) const { return P(X*a.X -Y*a.Y, X*a.Y +Y*a.X); }\n inline const P operator /(const P& a) const { return *this *a.inv(); }\n inline const P operator *(const double& c) const { return P(c*X, c*Y); }\n inline const P operator /(const double& c) const { return P(X/c, Y/c); }\n\n inline P& operator +=(const P& a){ X+=a.X; Y+=a.Y; return *this; }\n inline P& operator -=(const P& a){ X-=a.X; Y-=a.Y; return *this; }\n inline P& operator *=(const P& a){ double nX=X*a.X-Y*a.Y; Y=X*a.Y+Y*a.X; X=nX; return *this; }\n inline P& operator /=(const P& a){ double d=a.X*a.X+a.Y*a.Y; double nX=(X*a.X+Y*a.Y)/d; Y=(-X*a.Y+Y*a.X)/d; X=nX; return *this; }\n inline P& operator *=(const double& c){ X*=c; Y*=c; return *this; }\n inline P& operator /=(const double& c){ X/=c; Y/=c; return *this; }\n\n inline bool operator ==(const P& a) const { return EQ(X,a.X) and EQ(Y,a.Y); }\n inline bool operator !=(const P& a) const { return !(*this==a); }\n inline bool operator <(const P& a) const { return !EQ(X,a.X)? X<a.X: Y+EPS<a.Y; }\n inline bool operator <=(const P& a) const { return *this<a or *this==a; }\n inline bool operator >(const P& a) const { return !(*this<=a); }\n inline bool operator >=(const P& a) const { return !(*this<a); }\n};\nP operator *(const double& c, const P& p){ return P(c*p.X, c*p.Y); }\ndouble norm(const P& a){ return a.X*a.X +a.Y*a.Y; }\ndouble abs(const P& a){ return sqrt(a.X*a.X +a.Y*a.Y); }\ndouble arg(const P& a){ return atan2(a.X, a.Y); }\ndouble dot(const P& a, const P& b){ return a.X*b.X +a.Y*b.Y; }\ndouble cross(const P& a, const P& b){ return a.X*b.Y -a.Y*b.X; }\nstd::ostream& operator <<(std::ostream& lhs, const P& rhs){\n lhs << \"(\" << rhs.X << \", \" << rhs.Y << \")\";\n return lhs;\n}\n\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(dot(b,c-b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\nP unit(const P &p){\n return p/abs(p);\n}\nP rotate(const P &p, double rad){\n return p *P(cos(rad), sin(rad));\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint main(){\n int n;\n cin >> n;\n VP p(n);\n for(int i=0; i<n; i++){\n cin >> p[i].X >> p[i].Y;\n }\n double ans = INF;\n for(int i=0; i<n; i++){\n L edge(p[i], p[(i+1)%n]);\n P lmin = edge[0];\n P lmax = edge[0];\n P ldir = rotate(edge[1]-edge[0], PI/3.0);\n for(int j=0; j<n; j++){\n P cp = crosspointLL(edge, L(p[j], p[j]+ldir));\n lmin = min(lmin, cp);\n lmax = max(lmax, cp);\n }\n P rmin = edge[0];\n P rmax = edge[0];\n P rdir = rotate(edge[1]-edge[0], PI*2.0/3.0);\n for(int j=0; j<n; j++){\n P cp = crosspointLL(edge, L(p[j], p[j]+rdir));\n rmin = min(rmin, cp);\n rmax = max(rmax, cp);\n }\n ans = min(ans, max(abs(lmin-rmax), abs(lmax-rmin)));\n }\n cout << fixed << setprecision(10);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":1980,"memory_kb":3516,"score_of_the_acc":-0.7767,"final_rank":13},{"submission_id":"aoj_3056_3939871","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\n\n#define EPS (1e-10)\n#define equals(a,b) (fabs((a)-(b)) < EPS)\n#define PI 3.141592653589793238\n \n// COUNTER CLOCKWISE\nstatic const Int CCW_COUNTER_CLOCKWISE = 1;\nstatic const Int CCW_CLOCKWISE = -1;\nstatic const Int CCW_ONLINE_BACK = 2;\nstatic const Int CCW_ONLINE_FRONT = -2;\nstatic const Int CCW_ON_SEGMENT = 0;\n\nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) :x(x),y(y){}\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\n Point operator*(double k){return Point(x*k,y*k);}\n Point operator/(double k){return Point(x/k,y/k);}\n double norm(){return x*x+y*y;}\n double abs(){return sqrt(norm());}\n\n bool operator < (const Point &p) const{\n return x!=p.x?x<p.x:y<p.y;\n //grid-point only\n //return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\n }\n\n bool operator == (const Point &p) const{\n return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n }\n};\n\nstruct EndPoint{\n Point p;\n Int seg,st;\n EndPoint(){}\n EndPoint(Point p,Int seg,Int st):p(p),seg(seg),st(st){}\n bool operator<(const EndPoint &ep)const{\n if(p.y==ep.p.y) return st<ep.st;\n return p.y<ep.p.y;\n }\n};\n\nistream &operator >> (istream &is,Point &p){\n is>>p.x>>p.y;\n return is;\n}\n\nostream &operator << (ostream &os,Point p){\n os<<fixed<<setprecision(12)<<p.x<<\" \"<<p.y;\n return os;\n}\n\nbool sort_x(Point a,Point b){\n return a.x!=b.x?a.x<b.x:a.y<b.y;\n}\n\nbool sort_y(Point a,Point b){\n return a.y!=b.y?a.y<b.y:a.x<b.x;\n}\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nistream &operator >> (istream &is,Polygon &p){\n for(Int i=0;i<(Int)p.size();i++) is>>p[i];\n return is;\n}\n\nstruct Segment{\n Point p1,p2;\n Segment(){}\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\n\nistream &operator >> (istream &is,Segment &s){\n is>>s.p1>>s.p2;\n return is;\n}\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\ndouble dot(Vector a,Vector b){\n return a.x*b.x+a.y*b.y;\n}\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nPoint orth(Point p){return Point(-p.y,p.x);}\n\nPoint project(Segment s,Point p){\n Vector base=s.p2-s.p1;\n double r=dot(p-s.p1,base)/norm(base);\n return s.p1+base*r;\n}\n\nPoint reflect(Segment s,Point p){\n return p+(project(s,p)-p)*2.0;\n}\n\ndouble arg(Vector p){\n return atan2(p.y,p.x);\n}\n\nVector polar(double a,double r){\n return Point(cos(r)*a,sin(r)*a);\n}\n\nInt ccw(Point p0,Point p1,Point p2){\n Vector a = p1-p0;\n Vector b = p2-p0;\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\n if(a.norm()<b.norm()) return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n}\n\nbool intersectSS(Point p1,Point p2,Point p3,Point p4){\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 &&\n ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0 );\n}\n\nbool intersectSS(Segment s1,Segment s2){\n return intersectSS(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool intersectPS(Polygon p,Segment l){\n Int n=p.size();\n for(Int i=0;i<n;i++)\n if(intersectSS(Segment(p[i],p[(i+1)%n]),l)) return 1;\n return 0;\n}\n\ndouble getDistanceLP(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\ndouble getDistanceSP(Segment s,Point p){\n if(dot(s.p2-s.p1,p-s.p1) < 0.0 ) return abs(p-s.p1);\n if(dot(s.p1-s.p2,p-s.p2) < 0.0 ) return abs(p-s.p2);\n return getDistanceLP(s,p);\n}\n\ndouble getDistanceSS(Segment s1,Segment s2){\n if(intersectSS(s1,s2)) return 0.0;\n return min(min(getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2)),\n min(getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)));\n}\n\nPoint getCrossPointSS(Segment s1,Segment s2){\n for(Int k=0;k<2;k++){\n if(getDistanceSP(s1,s2.p1)<EPS) return s2.p1; \n if(getDistanceSP(s1,s2.p2)<EPS) return s2.p2;\n swap(s1,s2);\n }\n Vector base=s2.p2-s2.p1;\n double d1=abs(cross(base,s1.p1-s2.p1));\n double d2=abs(cross(base,s1.p2-s2.p1));\n double t=d1/(d1+d2);\n return s1.p1+(s1.p2-s1.p1)*t;\n}\n\nPoint getCrossPointLL(Line l1,Line l2){\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\n return l2.p1+(l2.p2-l2.p1)*(b/a);\n}\n\n// IN:2 ON:1 OUT:0\nInt contains(Polygon g,Point p){\n Int n=g.size();\n bool x=false;\n for(Int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(fabs(cross(a,b)) < EPS && dot(a,b) < EPS) return 1;\n if(a.y>b.y) swap(a,b);\n if(a.y < EPS && EPS < b.y && cross(a,b) > EPS ) x = !x;\n }\n return (x?2:0);\n}\n\nVector translate(Vector v,double theta){\n Vector res;\n res.x=cos(theta)*v.x-sin(theta)*v.y;\n res.y=sin(theta)*v.x+cos(theta)*v.y;\n return res;\n}\n\n\nstruct Precision{\n Precision(){\n cout<<fixed<<setprecision(12);\n }\n}precision_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n cin>>n;\n Polygon ps(n);\n for(Int i=0;i<n;i++) cin>>ps[i];\n for(Int i=0;i<n;i++) ps.push_back(Point(ps[i]));\n for(Int i=0;i<n;i++) ps.push_back(Point(ps[i]));\n\n double ans=1e18;\n Int l=n,r=n+1;\n for(Int i=n;i<n+n;i++){\n while(r<i+1) r++;\n double th=arg(ps[i+1]-ps[i]);\n Vector v1=polar(100,th+2*PI/3);\n Vector v2=polar(100,th+4*PI/3);\n\n Line b(ps[i],ps[i+1]);\n\n auto calc=\n [&](Int k,Vector v,Int w)->double{\n Point p=getCrossPointLL(b,Line(ps[k],ps[k]+v));\n if(abs(p-ps[i+w])<abs(p-ps[i+!w])) return -1;\n return abs(p-ps[i+w]); \n };\n \n while(calc(l,v2,1)<0) l++;\n while(calc(l,v2,1)<calc(l-1,v2,1)) l--;\n while(calc(l,v2,1)<calc(l+1,v2,1)) l++;\n while(calc(r,v1,0)<calc(r-1,v1,0)) r--;\n while(calc(r,v1,0)<calc(r+1,v1,0)) r++;\n\n Point p1=getCrossPointLL(b,Line(ps[r],ps[r]+v1));\n Point p2=getCrossPointLL(b,Line(ps[l],ps[l]+v2));\n chmin(ans,abs(p1-p2));\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3728,"score_of_the_acc":-0.171,"final_rank":7},{"submission_id":"aoj_3056_3895290","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3056.cc: Equilateral Triangle\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 10000;\nconst double PI = acos(-1.0);\nconst double TH60 = PI * 2 * 60 / 360;\nconst double C60 = cos(TH60), S60 = sin(TH60);\nconst double DINF = 1e60;\n\n/* typedef */\n\ntemplate <typename T>\nstruct Pt {\n T x, y;\n\n Pt() {}\n Pt(T _x, T _y) : x(_x), y(_y) {}\n Pt(const Pt<T> &pt) : x(pt.x), y(pt.y) {}\n\n Pt<T> operator+(const Pt<T> pt) const { return Pt<T>(x + pt.x, y + pt.y); }\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\n Pt<T> operator-(const Pt<T> pt) const { return Pt<T>(x - pt.x, y - pt.y); }\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\n T d2() { return x * x + y * y; }\n double d() { return sqrt(d2()); }\n\n Pt<T> rot60() { return Pt<T>(C60 * x - S60 * y, S60 * x + C60 * y); }\n Pt<T> rot300() { return Pt<T>(C60 * x + S60 * y, -S60 * x + C60 * y); }\n\n Pt<T> normalize() {\n double d0 = d();\n return (d0 != 0.0) ? Pt<T>(x / d0, y / d0) : *this;\n }\n\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\n bool operator<(const Pt<T> &pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n\n bool read() { return (scanf(\"%lf%lf\", &x, &y) == 2); }\n void print() { printf(\"(%lf,%lf)\", x, y); }\n};\n\ntypedef Pt<double> pt;\n\nstruct CL {\n pt p;\n double t0, t1;\n CL() {}\n CL(const pt& _p, double _t0, double _t1) : p(_p), t0(_t0), t1(_t1) {}\n};\n\n/* global variables */\n\npt ps[MAX_N];\n\n/* subroutines */\n\nbool cross_lines(const pt& ap, const pt av, const pt& bp, const pt bv,\n\t\t CL& cl) {\n double op01 = av.cross(bv);\n //if (op01 == 0.0) return false; /* need to handle parallel?? */\n\n if (op01 == 0.0) {\n pt v = bp - ap;\n if (v.cross(av) != 0.0) return false;\n\n pt a1 = ap + av;\n pt b1 = bp + bv;\n\n return\n ((bp - ap).dot(b1 - ap) <= 0.0 ||\n (bp - a1).dot(b1 - a1) <= 0.0 ||\n (ap - bp).dot(a1 - bp) <= 0.0 ||\n (ap - b1).dot(a1 - b1) <= 0.0);\n }\n\n pt v = bp - ap;\n double op0 = v.cross(av);\n double op1 = v.cross(bv);\n\n double t0 = op1 / op01;\n double t1 = op0 / op01;\n\n cl.p = bv * t1 + bp;\n cl.t0 = t0;\n cl.t1 = t1;\n\n return true;\n //return (0.0 <= cl.t0 && cl.t0 <= 1.0 && 0.0 <= cl.t1 && cl.t1 <= 1.0);\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) ps[i].read();\n\n double minl = DINF;\n for (int i = 0; i < n; i++) {\n pt &p0 = ps[i], &p1 = ps[(i + 1) % n];\n pt v0 = (p1 - p0).normalize();\n pt v1 = v0.rot60(), v2 = v0.rot300();\n double mint = 0.0, maxt = 0.0;\n\n for (int j = 0; j < n; j++) {\n CL cl1, cl2;\n cross_lines(p0, v0, ps[j], v1, cl1);\n cross_lines(p0, v0, ps[j], v2, cl2);\n if (mint > cl1.t0) mint = cl1.t0;\n if (maxt < cl2.t0) maxt = cl2.t0;\n }\n double l = maxt - mint;\n if (minl > l) minl = l;\n }\n\n printf(\"%.8lf\\n\", minl);\n return 0;\n}","accuracy":1,"time_ms":1380,"memory_kb":3364,"score_of_the_acc":-0.5049,"final_rank":10},{"submission_id":"aoj_3056_3780784","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <climits>\n#include <iomanip>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <tuple>\n#include <iostream>\n#include <deque>\n#include <array>\n#include <set>\n#include <functional>\n#include <memory>\n#include <stack>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n\nstruct Point;\nstruct Vector;\nstruct Angle;\nclass Line;\nstruct Point {\n\tlong double x, y;\n\tlong double distance(const Point& that) const;\n\tVector operator-(const Point& that) const;\n};\nstruct Vector {\n\tlong double x, y;\n\tAngle angle_from(const Vector& that) const;\n\tAngle angle() const;\n\tlong double length() const;\n\tlong double cross(const Vector& that) const;\n\tlong double dot(const Vector& that) const;\n};\nstruct Angle {\n\tstatic const long double Pi;\n\tstatic const Angle degree0;\n\tstatic const Angle degree120;\n\tstatic const Angle degree240;\n\tlong double sin, cos;\n\tAngle operator+(const Angle& that) const;\n\tAngle operator-(const Angle& that) const;\n\tlong double radian() const;\n\tbool near_enough(const Angle& that) const;\n};\nconst Angle Angle::degree0 = Angle{ 0, 1 };\nconst Angle Angle::degree120 = Angle{ std::sqrt(3.0) / 2, -1.0 / 2 };\nconst Angle Angle::degree240 = Angle{ -std::sqrt(3.0) / 2, -1.0 / 2 };\nstruct AngleRange {\n\tAngle from, to;\n\tbool contains(const Angle& that) const;\n};\nclass Line {\n\tlong double a, b, c;\npublic:\n\tLine(const Point& point, const Angle& angle) :a{ angle.sin }, b{ -angle.cos }, c{ -point.x * angle.sin + point.y * angle.cos }{}\n\tLine(const Point& point, const Vector& vec) :Line(point, vec.angle()) {}\n\tPoint cross_point(const Line& that) const;\n};\ntemplate<typename T>\nclass RingArray {\n\tstd::vector<T> array;\npublic:\n\tRingArray() {};\n\tRingArray(const int size) : array(size) {};\n\tvoid push_back(const T& value);\n\tconst T& operator[](const int index) const;\n\tT& operator[](const int index);\n};\n\nlong double Point::distance(const Point& that) const\n{\n\treturn (*this - that).length();\n}\nVector Point::operator-(const Point& that) const {\n\treturn Vector{ x - that.x, y - that.y };\n}\n\nAngle Vector::angle_from(const Vector& that) const\n{\n\tauto len = length() * that.length();\n\tauto sin = cross(that) / len;\n\tauto cos = dot(that) / len;\n\treturn Angle{ sin, cos };\n}\n\nAngle Vector::angle() const\n{\n\tauto len = length();\n\treturn Angle{ y / len, x / len };\n}\n\nlong double Vector::length() const\n{\n\treturn std::sqrt(x * x + y * y);\n}\n\nlong double Vector::cross(const Vector& that) const\n{\n\treturn x * that.y - y * that.x;\n}\n\nlong double Vector::dot(const Vector& that) const\n{\n\treturn x * that.x + y * that.y;\n}\nconst long double Angle::Pi = std::acos(-1.0);\nAngle Angle::operator+(const Angle& that) const\n{\n\treturn Angle{ sin * that.cos + cos * that.sin, cos * that.cos - sin * that.sin };\n}\n\nAngle Angle::operator-(const Angle& that) const\n{\n\treturn Angle{ sin * that.cos - cos * that.sin, cos * that.cos + sin * that.sin };\n}\n\nlong double Angle::radian() const\n{\n\tif (cos >= 1) return 0;\n\telse if (cos <= -1) return Pi;\n\telse if (sin >= 0) return std::acos(cos);\n\telse return Pi * 2 - std::acos(cos);\n}\n\nbool Angle::near_enough(const Angle& that) const\n{\n\treturn (*this - that).cos + 0.0000001 >= 1;\n}\n\nbool AngleRange::contains(const Angle& that) const\n{\n\treturn to.near_enough(that) || from.near_enough(that) || (to - from).radian() + LDBL_EPSILON >= (that - from).radian();\n}\n\nPoint Line::cross_point(const Line& that) const\n{\n\tconst auto d = a * that.b - b * that.a;\n\treturn Point{ (b * that.c - c * that.b) / d, (c * that.a - a * that.c) / d };\n}\n\ntemplate<typename T>\nvoid RingArray<T>::push_back(const T& value)\n{\n\tarray.push_back(value);\n}\n\ntemplate<typename T>\nconst T& RingArray<T>::operator[](const int index) const\n{\n\treturn array[index % array.size()];\n}\n\ntemplate<typename T>\nT& RingArray<T>::operator[](const int index)\n{\n\treturn array[index % array.size()];\n}\nint main() {\n\tint n; std::cin >> n;\n\tRingArray<Point> points(n);\n\tfor (auto i = 0; i < n; ++i) std::cin >> points[i].x >> points[i].y;\n\tAngleRange first_angle{ Angle::degree0, Angle::degree120 }, second_angle{ Angle::degree0, Angle::degree240 };\n\tstd::queue<int> first_suspect, second_suspect;\n\tfor (auto i = 1; i < n; ++i) {\n\t\tfirst_suspect.push(i); second_suspect.push(i);\n\t}\n\tint first{ 0 }, second{ 0 };\n\tlong double min = LDBL_MAX;\n\tfor (auto i = 0; i < n; ++i) {\n\t\tfirst_suspect.push(i); second_suspect.push(i);\n\t\tauto base = points[i + 1] - points[i];\n\t\twhile (first_angle.contains(base.angle_from(points[first + 1] - points[first])) && !first_suspect.empty()) {\n\t\t\tfirst = first_suspect.front(); first_suspect.pop();\n\t\t}\n\t\twhile (second_angle.contains(base.angle_from(points[second + 1] - points[second])) && !second_suspect.empty()) {\n\t\t\tsecond = second_suspect.front(); second_suspect.pop();\n\t\t}\n\t\tauto base_line = Line(points[i], base);\n\t\tauto crosspoint_first = base_line.cross_point(Line(points[first], base.angle() + Angle::degree120));\n\t\tauto crosspoint_second = base_line.cross_point(Line(points[second], base.angle() + Angle::degree240));\n\t\tauto len = crosspoint_first.distance(crosspoint_second);\n\t\tif (min > len) min = len;\n\t}\n\tstd::cout << std::setprecision(10) << std::fixed << min << std::endl;\n}","accuracy":0.0625,"time_ms":10,"memory_kb":3500,"score_of_the_acc":-0.079,"final_rank":18},{"submission_id":"aoj_3056_3416730","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\ntypedef long double ld;\nconst ld INF = (ld)10000000000;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-7;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\ntypedef pair<ld, ld> LDP;\n\n//外心を求める。3点が同一直線上だとRE\nLDP cent(LDP a[3]) {\n\tld x[2], y[2];\n\trep(i, 2) {\n\t\tx[i] = a[i + 1].first - a[0].first;\n\t\ty[i] = a[i + 1].second - a[0].second;\n\t}\n\tld bunbo = 2 * (x[0] * y[1] - y[0] * x[1]);\n\tld cx = (x[0] * x[0] * y[1] + y[0] * y[0] * y[1] - y[0] * x[1] * x[1] - y[0] * y[1] * y[1]) / bunbo;\n\tld cy = (x[0] * x[1] * x[1] + x[0] * y[1] * y[1] - x[0] * x[0] * x[1] - y[0] * y[0] * x[1]) / bunbo;\n\treturn { cx + a[0].first,cy + a[0].second };\n}\n\n\nbool eq(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n//内積\nld dot(Point a, Point b) {\n\treturn real(conj(a)*b);\n}\n//外積\nld cross(Point a, Point b) {\n\treturn imag(conj(a)*b);\n}\n//線分\n//直線にするなら十分通い２点を端点とすればよい\nclass Line {\npublic:\n\tPoint a, b;\n};\n//円\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n};\n//3点の位置関係\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\n\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\n\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\n\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\n\treturn 0;//a,c,bの順に一直線\n}\n//2直線の交差判定\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n//直線と線分の交差判定\nbool isis_ls(Line l, Line s) {\n\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\n}\n//点が直線上に存在するか\nbool isis_lp(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n//点が線分上に存在するか\nbool isis_sp(Line s, Point p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n//線分と線分の交差判定\nbool isis_ss(Line s, Line t) {\n\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\n\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\n}\n//点から直線への垂線の足\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n//直線と直線の交点\n//平行な２直線に対しては使うな！！！！\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n//直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n//直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n//線分と直線の距離\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n//線分と点の距離\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\n}\n//線分と線分の距離\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t))return 0;\n\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\n}\n\nint n;\nPoint p[10001];\nconst ld th = pi / 3;\nint main() {\n\tcout << fixed << setprecision(6);\n\tcin >> n;\n\trep(i, n) {\n\t\tld x, y; cin >> x >> y;\n\t\tp[i] = { x,y };\n\t}\n\tp[n] = p[0];\n\tld out = INF;\n\tint l = 1, r = 1;\n\trep(i, n) {\n\t\tPoint d = p[i + 1] - p[i];\n\t\tPoint d1 = d * Point{ cos(th),sin(th) };\n\t\tPoint d2 = d * Point{ cos(-th),sin(-th) };\n\t\tPoint x1 = p[i] + Point{ -INF * real(d1),-INF * imag(d1) };\n\t\tPoint x2 = p[i] + Point{ INF * real(d1),INF * imag(d1) };\n\t\tPoint y1 = p[i + 1] + Point{ -INF * real(d2),-INF * imag(d2) };\n\t\tPoint y2 = p[i + 1] + Point{ INF*real(d2),INF*imag(d2) };\n\t\tLine l1 = { x1,x2 }, l2 = { y1,y2 };\n\t\twhile (r!=i&&ccw(x1, p[r], x2) != -1) {\n\t\t\tr = (r + 1) % n;\n\t\t}\n\t\twhile (r != i) {\n\t\t\tld le = dist_lp(l1, p[r]);\n\t\t\tld ri = dist_lp(l1, p[(r+1)%n]);\n\t\t\tif (le < ri)r = (r + 1) % n;\n\t\t\telse break;\n\t\t}\n\t\tld ans = abs(p[i + 1] - p[i]);\n\t\tans += max((ld)0,dist_lp(l1,p[r]) * 2 / sqrt(3.0));\n\t\t/*while (l != i + 1 && ccw(y1, p[l], y2) != -1) {\n\t\t\tl = (l - 1+n) % n;\n\t\t}*/\n\t\tif (l == i)l = (l + 1) % n;\n\t\twhile (ccw(y1, p[(l + 1) % n],y2) == -1) {\n\t\t\tld le = dist_lp(l2, p[l]);\n\t\t\tld ri = dist_lp(l2, p[(l + 1) % n]);\n\t\t\tif (le < ri)l = (l + 1) % n;\n\t\t\telse break;\n\t\t}\n\t\tans += max(ld(0),dist_lp(l2,p[l]) * 2 / sqrt(3.0));\n\t\tout = min(out, ans);\n\t}\n\tcout << out << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3688,"score_of_the_acc":-0.1548,"final_rank":6},{"submission_id":"aoj_3056_3414996","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <cmath>\nusing namespace std;\n\n////////////////////////////\n// 基本要素 (点, 線分)\n////////////////////////////\n\nusing DD = double;\nconst DD INF = 1LL<<35; // to be set appropriately\nconst DD EPS = 1e-6; // to be set appropriately\nconst DD PI = acos(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n\nDD solve(int i, const vector<Point> &vp) {\n // vp[i] が原点に、辺 (vp[i], vp[i+1]) が x 軸上正の向きに来るように回転する\n int N = vp.size();\n Point p = vp[i];\n Point q = vp[(i+1) % N];\n DD th = atan2(q.y - p.y, q.x - p.x);\n vector<Point> nvp = vp;\n for (int i = 0; i < N; ++i) {\n nvp[i] = nvp[i] - p;\n nvp[i] = rot(nvp[i], -th);\n }\n\n // 各頂点から左右に 60 度の方向にビームを打つ\n DD mi = 0, ma = 0;\n for (int i = 0; i < N; ++i) {\n mi = min(mi, nvp[i].x - nvp[i].y / sqrt(3.0));\n ma = max(ma, nvp[i].x + nvp[i].y / sqrt(3.0));\n }\n return ma - mi;\n}\n\n\nint main() {\n int N; cin >> N;\n vector<Point> vp(N);\n for (int i = 0; i < N; ++i) cin >> vp[i].x >> vp[i].y;\n\n DD res = INF;\n for (int i = 0; i < N; ++i) res = min(res, solve(i, vp));\n cout << fixed << setprecision(10) << res << endl;\n}","accuracy":1,"time_ms":560,"memory_kb":3840,"score_of_the_acc":-0.4091,"final_rank":8},{"submission_id":"aoj_3056_3413551","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef int _loop_int;\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define CHMIN(a,b) a=min((a),(b))\n#define CHMAX(a,b) a=max((a),(b))\n\n// mod\nconst ll MOD = 1000000007ll;\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\n// floating\ntypedef double Real;\nconst Real EPS = 1e-11;\n#define EQ0(x) (abs(x)<EPS)\n#define EQ(a,b) (abs(a-b)<EPS)\ntypedef complex<Real> P;\n\nint n;\nP pts[12525];\nconst Real PI = 4.0*atan(1.0);\n\nReal dot(P a, P b){return real(a*conj(b));}\nReal cross(P a, P b){return imag(a*conj(b));}\n\nP getPoint(P s, P v1, P t, P v2){\n P n = v2*exp(P(0,PI/2.0));\n Real x = dot(n,t-s) / dot(n,v1);\n return s + v1*x;\n}\n\nReal f(Real th, int id){\n return cos(th)*pts[id].real() + sin(th)*pts[id].imag();\n}\n\nint main(){\n double rnd = rand() / 65536.0;\n scanf(\"%d\",&n);\n REP(i,n){\n int x,y;\n scanf(\"%d%d\",&x,&y);\n pts[i] = P(x,y) * exp(P(0,rnd));\n }\n vector<double> queries;\n map<double,int> qans;\n REP(i,n){\n P a = pts[i], b = pts[(i+1)%n];\n P v = b-a;\n v *= exp(P(0,-PI/2.0));\n double th = arg(v);\n queries.push_back(th);\n th += PI*2.0/3.0;\n while(th>PI)th -= 2.0*PI;\n queries.push_back(th);\n th += PI*2.0/3.0;\n while(th>PI)th -= 2.0*PI;\n queries.push_back(th);\n }\n sort(ALL(queries));\n // query\n int cur = 0;\n REP(i,n)if(pts[i].real() < pts[cur].real()){\n cur = i;\n }\n REP(i,queries.size()){\n double th = queries[i];\n while(true){\n int ni = (cur + 1) % n;\n if(f(th,cur) < f(th,ni)){\n cur = ni;\n }else{\n break;\n }\n }\n qans[th] = cur;\n }\n // calc\n double ans = 1e25;\n REP(i,n){\n P a = pts[i], b = pts[(i+1)%n];\n P v = b-a;\n v *= exp(P(0,-PI/2.0));\n double th = arg(v);\n int sid = qans[th];\n double th2 = th + PI*2.0/3.0;\n while(th2>PI)th2 -= 2.0*PI;\n int tid = qans[th2];\n double th3 = th2 + PI*2.0/3.0;\n while(th3>PI)th3 -= 2.0*PI;\n int uid = qans[th3];\n P c1 = getPoint(pts[sid], exp(P(0,th+PI/2.0)), pts[tid], exp(P(0,th2+PI/2.0)));\n P c2 = getPoint(pts[sid], exp(P(0,th+PI/2.0)), pts[uid], exp(P(0,th3+PI/2.0)));\n CHMIN(ans, abs(c1-c2));\n }\n printf(\"%.9f\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5784,"score_of_the_acc":-1,"final_rank":14},{"submission_id":"aoj_3056_3413503","code_snippet":"#include<iostream>\n#include<iomanip>\n#include<vector>\n#include<cmath>\nusing namespace std;\nstruct Point{\n\tdouble x,y;\n};\nint n;\nPoint a[11111];\nPoint b[11111];\nvoid conv(double theta)\n{\n\tdouble C=cos(-theta);\n\tdouble S=sin(-theta);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tb[i].x=a[i].x*C-a[i].y*S;\n\t\tb[i].y=a[i].x*S+a[i].y*C;\n\t}\n}\nmain()\n{\n\tcin>>n;\n\tfor(int i=0;i<n;i++)cin>>a[i].x>>a[i].y;\n\tdouble ans=1e150;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint I=(i+1)%n;\n\t\tdouble now=hypot(a[I].x-a[i].x,a[I].y-a[i].y);\n\t\tdouble theta=atan2(a[I].y-a[i].y,a[I].x-a[i].x);\n\t\t//cout<<theta<<endl;\n\t\tconv(theta+5*M_PI/6);\n\t\tif(0&&i==0)\n\t\t{\n\t\t\tcout<<endl<<\"debug\"<<endl;\n\t\t\tfor(int j=0;j<n;j++)cout<<b[j].x<<\" \"<<b[j].y<<endl;\n\t\t\tcout<<\"debug\"<<endl;\n\t\t}\n\t\t//double mx=1e150;\n\t\t//for(int j=0;j<n;j++)mx=min(mx,i==j?1e150:b[j].x-b[i].x);\n\t\tdouble mx=0;\n\t\tfor(int j=0;j<n;j++)mx=max(mx,b[j].x-b[i].x);\n\t\t//cout<<mx<<\" \";\n\t\tnow+=mx/cos(M_PI/6);\n\t\tconv(theta+M_PI/6);\n\t\tif(0&&i==0)\n\t\t{\n\t\t\tcout<<endl<<\"debug\"<<endl;\n\t\t\tfor(int j=0;j<n;j++)cout<<b[j].x<<\" \"<<b[j].y<<endl;\n\t\t\tcout<<\"debug\"<<endl;\n\t\t}\n\t\tmx=0;\n\t\tfor(int j=0;j<n;j++)mx=max(mx,I==j?0:b[j].x-b[I].x);\n\t\t//cout<<mx<<endl;\n\t\tnow+=mx/cos(M_PI/6);\n\t\tans=min(ans,now);\n\t}\n\tcout<<fixed<<setprecision(9)<<ans<<endl;\n}","accuracy":1,"time_ms":380,"memory_kb":4028,"score_of_the_acc":-0.4218,"final_rank":9},{"submission_id":"aoj_3056_3413443","code_snippet":"#include <iostream>\n#include <cmath>\n#include <iomanip>\n\nusing namespace std;\n#define double long double\ndouble px[10000], py[10000];\nint N;\nint argmax(double* arr) {\n double maxval;\n int maxindex = -1;\n for (int i=0; i<N; i++) {\n if (maxindex == -1 || maxval < arr[i]) {\n maxval = arr[i];\n maxindex = i;\n }\n }\n return maxindex;\n}\n\ndouble solve(double ax, double ay, double ux, double uy, double bx, double by, double vx, double vy) {\n // solve a + su = b + tv\n // su - tv = b - a\n // (s, t) = (u, -v).inv @ (b-a)\n double mat[2][2] = {\n { ux, -vx },\n { uy, -vy }\n };\n double det = mat[0][0] * mat[1][1] - mat[0][1] * mat[1][0];\n //cout << \"det:\" << det << endl;\n double idet = 1 / det;\n double inv[2][2] = {\n { idet * mat[1][1], -idet * mat[0][1] },\n { -idet * mat[1][0], idet*mat[0][0] }};\n double s = inv[0][0] * (bx-ax) + inv[0][1] * (by-ay);\n double t = inv[1][0] * (bx-ax) + inv[1][1] * (by-ay);\n //cout << \"st\" << s << \" \" << t << endl;\n double xx = ax + s * ux;\n double yy = ay + s * uy;\n //cerr << xx << \" \" << yy << endl;\n //cerr << bx+t*vx << \" \" << by+t*vy << endl;\n return sqrt((xx-ax) * (xx-ax) + (yy-ay)*(yy-ay));\n\n}\n\ndouble calc(double base_rad) {\n double farA[10000], farB[10000], farC[10000];\n\n double cosA = cos(base_rad + M_PI*2/3);\n double sinA = sin(base_rad + M_PI*2/3);\n double cosB = cos(base_rad - M_PI*2/3);\n double sinB = sin(base_rad - M_PI*2/3);\n double cosC = cos(base_rad);\n double sinC = sin(base_rad);\n // transform\n for (int i=0; i<N; i++) {\n farA[i] = px[i] * cosA + py[i] * sinA;\n farB[i] = px[i] * cosB + py[i] * sinB;\n farC[i] = px[i] * cosC + py[i] * sinC;\n //cout << farA[i] << endl;\n //cout << farB[i] << endl;\n //cout << farC[i] << endl;\n //cout << endl;\n }\n int maxAindex = argmax(farA);\n int maxBindex = argmax(farB);\n int maxCindex = argmax(farC);\n double pax = px[maxAindex];\n double pay = py[maxAindex];\n double pbx = px[maxBindex];\n double pby = py[maxBindex];\n double pcx = px[maxCindex];\n double pcy = py[maxCindex];\n double vecAx = -sinA;\n double vecAy = cosA;\n double vecBx = -sinB;\n double vecBy = cosB;\n double vecCx = -sinC;\n double vecCy = cosC;\n //cout << \"vecC \" << vecCx << \",\" << vecCy << endl;\n double val = solve(pcx, pcy, vecCx, vecCy, pbx, pby, vecBx, vecBy) + solve(pcx, pcy, vecCx, vecCy, pax, pay, vecAx, vecAy);\n return val;\n}\n\nint main() {\n cin >> N;\n for (int i=0; i<N; i++) cin >> px[i] >> py[i];\n\n const int try_n = 10000;\n const int try2_n = 10000;\n double minval = -1;\n double minrad = 0;\n\n for (int try_i = 0; try_i < try_n; try_i++) {\n double base_rad = try_i * M_PI * 2 / 3 / try_n;\n double val = calc(base_rad);\n if (minval == -1 || val < minval) {\n minval = val;\n minrad = base_rad;\n }\n }\n double rad_from = minrad - M_PI * 2 / 3 / try_n;\n double rad_to = minrad + M_PI * 2 / 3 / try_n;\n for (int try_i = 0; try_i < try2_n; try_i++) {\n double base_rad = rad_from + (rad_to - rad_from) * try_i / try2_n;\n double val = calc(base_rad);\n if (minval == -1 || val < minval) {\n minval = val;\n minrad = base_rad;\n }\n }\n cout << setprecision(15) << minval << endl;\n \n return 0;\n}","accuracy":1,"time_ms":1910,"memory_kb":4340,"score_of_the_acc":-1.0844,"final_rank":15},{"submission_id":"aoj_3056_3413182","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n#define double long double\n\n/* 基本要素 */\ntypedef complex<double> Point;\ntypedef pair<Point, Point> Line;\ntypedef vector<Point> VP;\nconst double PI = acos(-1);\nconst double EPS = 1e-6; // 許容誤差^2\nconst double INF = 1e9;\n#define X real()\n#define Y imag()\n#define LE(n,m) ((n) - (m) < EPS)\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 2直線の交点\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\n double d1 = cross(b2-b1, b1-a1);\n double d2 = cross(b2-b1, a2-a1);\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\n assert(!EQ(d2, 0)); // 交点がない\n return a1 + d1/d2 * (a2-a1);\n}\n\nusing Vector = Point;\n\nPoint READ(){\n double x,y;\n cin >>x >>y;\n return Point(x,y);\n}\n\ndouble calct(Point a, Point b, Point c, Vector u){\n Vector v = b-a;\n Point cp = crosspointLL(a,b,c,c+u);\n\n double t;\n if(EQ(v.X, 0)){\n if( EQ(v.Y, 0) ){\n while(1){}\n }\n\n t = (cp.Y - a.Y)/v.Y;\n }\n else{\n t = (cp.X - a.X)/v.X;\n }\n return t;\n}\n\nint main(){\n int n;\n cin >>n;\n\n VP p(n);\n rep(i,n) p[i] = READ();\n\n double ans = 1e12;\n int min_idx = 0, max_idx = 0;\n double mnt = INF, mxt = -INF;\n rep(i,n){\n Point a = p[0], b = p[1];\n Vector v = b-a;\n\n Vector mnv = v * polar((double)1.0, -2*PI/3);\n Vector mxv = v * polar((double)1.0, -PI/3);\n\n Point c = p[i];\n\n double tt = calct(a,b,c,mnv);\n if(tt < mnt){\n mnt = tt;\n min_idx = i;\n }\n\n tt = calct(a,b,c,mxv);\n if(tt > mxt){\n mxt = tt;\n max_idx = i;\n }\n ans = abs( (a+mnt*v) - (a+mxt*v) );\n }\n\n // dbg(ans);\n // printf(\" 0 : min %d max %d\\n\", min_idx, max_idx);\n\n for(int i=1; i<n; ++i){\n Point a = p[i], b = p[(i+1)%n];\n Vector v = b-a;\n\n Vector mnv = v * polar((double)1.0, -2*PI/3);\n Vector mxv = v * polar((double)1.0, -PI/3);\n // dbg(v);\n // dbg(mnv);\n // dbg(mxv);\n\n rep(loop,n){\n double pt = calct(a,b,p[min_idx],mnv);\n double qt = calct(a,b,p[(min_idx+1)%n],mnv);\n\n if(qt > pt+EPS) break;\n min_idx = (min_idx+1)%n;\n }\n\n rep(loop,n){\n double pt = calct(a,b,p[max_idx],mxv);\n double qt = calct(a,b,p[(max_idx+1)%n],mxv);\n\n if(qt < pt-EPS) break;\n max_idx = (max_idx+1)%n;\n }\n\n // printf(\" %d : min %d max %d\\n\", i,min_idx, max_idx);\n\n mnt = calct(a,b,p[min_idx],mnv);\n mxt = calct(a,b,p[max_idx],mxv);\n double dd = abs( (a+mnt*v) - (a+mxt*v) );\n ans = min(ans, dd);\n }\n\n printf(\"%.10Lf\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3336,"score_of_the_acc":-0.0129,"final_rank":3},{"submission_id":"aoj_3056_3413010","code_snippet":"#include<iostream>\n#include<complex>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef int Def;\ntypedef pair<double,double> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\n//#define mt make_tuple\n//typedef tuple<double,int,double> tp;\n//typedef vector<tp> vt;\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\nconst double PI=acos(-1);\nconst double EPS=1e-7;\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\ntypedef complex<double> P;\ntypedef vector<P> G;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\n\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\nstruct C{\n\tP c;double r;\n\tC(const P &c,double r):c(c),r(r){}\n};\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n#define diff(P, i) (next(P, i) - curr(P, i))\nnamespace std {\n\tbool operator < (const P& a, const P& b) {\n\t\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n\t\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \n\t}\n\tbool operator == (const P& a, const P& b) {\n\t\treturn a.real()==b.real()&&a.imag()==b.imag();\n\t}\n}\nP pin(){\n\tdouble x,y;\n\tchar d;\n\tcin>>x>>y;\n\tP p(x,y);\n\treturn p;\n}\nvoid PIN(P* a,int n){\n\trep(i,n)a[i]=pin();\n}\ndouble dot(P a,P b){\n\treturn real(conj(a)*b);\n}\ndouble cross(P a,P b){\n\treturn imag(conj(a)*b);\n}\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0; // a--c--b on line\n}\nP projection(L a,P p){\n\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\n\treturn a[0]+t*(a[0]-a[1]);\n}\nP reflection(L a,P p){\n\treturn p+2.0*(projection(a,p)-p);\n}\nbool intersectLL(const L &l, const L &m) {\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nbool intersectLP(const L &l, const P &p) {\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\nbool intersectSS(const L &s, const L &t) {\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\nbool intersectSP(const L &s, const P &p) {\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\n}\ndouble distanceLP(const L &l, const P &p) {\n\treturn abs(p - projection(l, p));\n}\ndouble distanceLL(const L &l, const L &m) {\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\ndouble distanceLS(const L &l, const L &s) {\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\ndouble distanceSP(const L &s, const P &p) {\n const P r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\ndouble distanceSS(const L &s, const L &t) {\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n/*bool intersectCS(C c,const L &l){\n return (distanceLP(l,c.c) < c.r+EPS &&\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\n}*/\nint intersectCS(C c,L l){\n\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\n\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\n\tif(d1<c.r+EPS&&d2<c.r+EPS)return 0;\n\tif(d1<c.r-EPS&&d2>c.r+EPS||d1>c.r+EPS&&d2<c.r-EPS)return 1;\n\tconst P h=projection(l,c.c);\n\tif(dot(l[0]-h,l[1]-h)<0)return 2;\n\treturn 0;\n}\nP crosspointSS(L a,L b){\n\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\n\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\n\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\n}\nL crosspointCL(C c,L l){\n\tP pr=projection(l,c.c);\n\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\n\tdouble tmp=c.r*c.r-norm(pr-c.c);\n\tif(abs(tmp)<EPS)tmp=0;\n\tdouble t=sqrt(tmp);\n\tP a=pr+t*e;\n\tP b=pr-t*e;\n\tif(b<a)swap(a,b);\n\treturn L(a,b);\n}\nL crosspointCS(C c,L l){\n\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\n\tL ret=crosspointCL(c,l);\n\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\n\telse ret[0]=ret[1];\n\treturn ret;\n}\nL crosspointCC(C a,C b){\n\tP tmp=b.c-a.c;\n\tdouble d=abs(tmp);\n\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\n\tP p1=a.c+polar(a.r,t+q);\n\tP p2=a.c+polar(a.r,t-q);\n\tif(p2<p1)swap(p1,p2);\n\treturn L(p1,p2);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1] - l[0], m[1] - m[0]);\n double B = cross(l[1] - l[0], l[1] - m[0]);\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n return m[0] + B / A * (m[1] - m[0]);\n}\ndouble area(const G &g){\n double S =0;\n for(int i =0;i <g.size();i++){\n S +=(cross(g[i],g[(i+1)%g.size()]));\n }\n return abs(S/2.0);\n}\nbool isconvex(const G &g){\n\tint n=g.size();\n\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\n\treturn true;\n}\nint inconvex(const G& g, const P& p) {\n\tbool in = false;\n\tint n=g.size();\n\trep(i,n){\n\t\tP a=g[i%n]-p;\n\t\tP b=g[(i+1)%n]-p;\n\t\tif(imag(a)>imag(b))swap(a, b);\n\t\tif(imag(a)<EPS&&0<imag(b))if(cross(a,b)<0)in=!in;\n\t\tif(abs(cross(a,b))<EPS&&dot(a,b)<EPS)return 1;//ON\n\t}\n\treturn in?2:0;//IN : OUT;\n}\nG convex_hull(G &ps) {\n int n=ps.size(),k=0;\n\tsort(ps.begin(), ps.end());\n\tG ch(2*n);\n\tfor(int i=0;i<n;ch[k++]=ps[i++])//lower-hull\n\t\twhile(k>=2&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//<=0 -> ==-1\n\tfor(int i=n-2,t=k+1;i>=0;ch[k++]=ps[i--])//upper-hull\n\t\twhile(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//\n\tch.resize(k-1);\n\treturn ch;\n}\ndouble convex_diameter(const G &pt) {\n const int n = pt.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(pt[i]) > imag(pt[is])) is = i;\n if (imag(pt[i]) < imag(pt[js])) js = i;\n }\n double maxd = norm(pt[is]-pt[js]);\n\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do {\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (norm(pt[i]-pt[j]) > maxd) {\n maxd = norm(pt[i]-pt[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\n}//convex_diameter(g)\nG convex_cut(const G& g, const L& l) {\n G Q;\n for (int i = 0; i < g.size(); ++i) {\n P a= curr(g, i), b= next(g, i);\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\n Q.push_back(crosspointLL(L(a,b), l));\n }\n return Q;\n}\nP turn(P p,double t){\n\treturn p*exp(P(.0,t*PI/180.0));\n}\nP turn2(P p,double t){\n\treturn p*exp(P(.0,t));\n}\nvector<L> tangentCC(C a,C b){\n\tif(a.r<b.r)swap(a,b);\n\tdouble d=abs(a.c-b.c);\n\tvector<L>l;\n\tif(d<EPS)return l;\n\tif(a.r+b.r<d-EPS){//hanareteiru\n\t\tdouble t=acos((a.r+b.r)/d);\n\t\tt=t*180/PI;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\n\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\n\t\tdouble t1=acos((a.r-b.r)/d);\n\t\tt1=t1*180/PI;\n\t\tdouble t2=180-t1;\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\n\t\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\n\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\n\t\tP p=a.c+a.r/d*(b.c-a.c);\n\t\tl.pb(L(p,p+turn(b.c-a.c,90)));\n\t}\n\treturn l;\n}\nvoid printL(const L &out){\n\tprintf(\"%0.9f %0.9f %0.9f %0.9f\\n\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\n}\nC CIN(){\n\tP p=pin();\n\tdouble r;\n\tcin>>r;\n\treturn C(p,r);\n}\nbool para(L a,L b){\n\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\n}\n//余弦定理\ndouble LawOfCosines(double a,double b,double c){\n\treturn acos((b*b+c*c-a*a)/(2.*b*c));\n}\n//外接円\npair<P,double> circumccircle(P a,P b,P c){\n\tdouble dA=abs(b-c),dB=abs(a-c),dC=abs(a-b);\n\tdouble angA=LawOfCosines(dA,dB,dC);\n\tdouble angB=LawOfCosines(dB,dC,dA);\n\tdouble angC=LawOfCosines(dC,dA,dB);\n\tdouble A=sin(2.*angA),B=sin(2.*angB),C=sin(2.*angC);\n\tdouble x=(a.real()*A+b.real()*B+c.real()*C)/(A+B+C);\n\tdouble y=(a.imag()*A+b.imag()*B+c.imag()*C)/(A+B+C);\n\tP p(x,y);\n\tdouble r=dA/sin(angA)/2.;\n\treturn {p,r};\n}\n//内接円\npair<P,double> incircle(P a,P b,P c){\n\tdouble dA=abs(b-c),dB=abs(a-c),dC=abs(a-b);\n\tL l1(a,b+dC/(dB+dC)*(c-b));\n\tL l2(b,a+dC/(dA+dC)*(c-a));\n\tP p=crosspointLL(l1,l2);\n\tdouble r=abs(p-projection(L(a,b),p));\n\treturn {p,r};\n}\nint n;\nG g;\npii f(int i,int it){\n\tL l(g[i],g[(i+1)%n]);\n\tpii out;\n\tP b=(g[(i+1)%n]-g[i])/abs(g[(i+1)%n]-g[i]);\n\t{\n\t\tP p=projection(l,g[it])-g[it];\n\t\tp=turn(p,-30);\n\t\tout.first=dot(b,crosspointLL(l,L(g[it],g[it]+p))-g[i]);\n\t}\n\t{\n\t\tP p=projection(l,g[it])-g[it];\n\t\tp=turn(p,30);\n\t\tout.second=dot(b,crosspointLL(l,L(g[it],g[it]+p))-g[i]);\n\t}\n\treturn out;\n}\nint main(){\n\tcin>>n;\n\tg=G(n);\n\trep(i,n)g[i]=pin();\n\t\n\tint lit=-1,rit=-1;\n\tpii t;\n\trep(j,n){\n\t\tpii w=f(0,j);\n\t\tcmax(t.first,-w.first);\n\t\tcmax(t.second,w.second);\n\t}\n\trep(j,n){\n\t\tpii w=f(0,j);\n\t\tif(abs(t.first+w.first)<EPS)lit=j;\n\t\tif(abs(t.second-w.second)<EPS)rit=j;\n\t}\n\tdouble out=t.first+t.second;\n\tloop(i,1,n){\n\t\twhile(1){\n\t\t\tif(f(i,lit).first>f(i,(lit+1)%n).first)(lit+=1)%=n;\n\t\t\telse break;\n\t\t}\n\t\twhile(1){\n\t\t\tif(f(i,rit).second<f(i,(rit+1)%n).second)(rit+=1)%=n;\n\t\t\telse break;\n\t\t}\n\t\tcmin(out,-f(i,lit).first+f(i,rit).second);\n\t}\n\tcout<<shosu(9)<<out<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3336,"score_of_the_acc":-0.0199,"final_rank":4},{"submission_id":"aoj_3056_3412990","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\ntypedef long double ld;\nconst ld INF = (ld)10000000000;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-7;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\ntypedef pair<ld, ld> LDP;\n\n//外心を求める。3点が同一直線上だとRE\nLDP cent(LDP a[3]) {\n\tld x[2], y[2];\n\trep(i, 2) {\n\t\tx[i] = a[i + 1].first - a[0].first;\n\t\ty[i] = a[i + 1].second - a[0].second;\n\t}\n\tld bunbo = 2 * (x[0] * y[1] - y[0] * x[1]);\n\tld cx = (x[0] * x[0] * y[1] + y[0] * y[0] * y[1] - y[0] * x[1] * x[1] - y[0] * y[1] * y[1]) / bunbo;\n\tld cy = (x[0] * x[1] * x[1] + x[0] * y[1] * y[1] - x[0] * x[0] * x[1] - y[0] * y[0] * x[1]) / bunbo;\n\treturn { cx + a[0].first,cy + a[0].second };\n}\n\n\nbool eq(ld a, ld b) {\n\treturn (abs(a - b) < eps);\n}\n//内積\nld dot(Point a, Point b) {\n\treturn real(conj(a)*b);\n}\n//外積\nld cross(Point a, Point b) {\n\treturn imag(conj(a)*b);\n}\n//線分\n//直線にするなら十分通い２点を端点とすればよい\nclass Line {\npublic:\n\tPoint a, b;\n};\n//円\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n};\n//3点の位置関係\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\n\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\n\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\n\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\n\treturn 0;//a,c,bの順に一直線\n}\n//2直線の交差判定\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n//直線と線分の交差判定\nbool isis_ls(Line l, Line s) {\n\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\n}\n//点が直線上に存在するか\nbool isis_lp(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n//点が線分上に存在するか\nbool isis_sp(Line s, Point p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n//線分と線分の交差判定\nbool isis_ss(Line s, Line t) {\n\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\n\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\n}\n//点から直線への垂線の足\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n//直線と直線の交点\n//平行な２直線に対しては使うな！！！！\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n//直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n//直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n//線分と直線の距離\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n//線分と点の距離\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\n}\n//線分と線分の距離\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t))return 0;\n\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\n}\n\nint n;\nPoint p[10001];\nconst ld th = pi / 3;\nint main() {\n\tcout << fixed << setprecision(6);\n\tcin >> n;\n\trep(i, n) {\n\t\tld x, y; cin >> x >> y;\n\t\tp[i] = { x,y };\n\t}\n\tp[n] = p[0];\n\tld out = INF;\n\tint l = 1, r = 1;\n\trep(i, n) {\n\t\tPoint d = p[i + 1] - p[i];\n\t\tPoint d1 = d * Point{ cos(th),sin(th) };\n\t\tPoint d2 = d * Point{ cos(-th),sin(-th) };\n\t\tPoint x1 = p[i] + Point{ -INF * real(d1),-INF * imag(d1) };\n\t\tPoint x2 = p[i] + Point{ INF * real(d1),INF * imag(d1) };\n\t\tPoint y1 = p[i + 1] + Point{ -INF * real(d2),-INF * imag(d2) };\n\t\tPoint y2 = p[i + 1] + Point{ INF*real(d2),INF*imag(d2) };\n\t\tLine l1 = { x1,x2 }, l2 = { y1,y2 };\n\t\twhile (r!=i&&ccw(x1, p[r], x2) != -1) {\n\t\t\tr = (r + 1) % n;\n\t\t}\n\t\twhile (r != i) {\n\t\t\tld le = dist_lp(l1, p[r]);\n\t\t\tld ri = dist_lp(l1, p[(r+1)%n]);\n\t\t\tif (le < ri)r = (r + 1) % n;\n\t\t\telse break;\n\t\t}\n\t\tld ans = abs(p[i + 1] - p[i]);\n\t\tans += max((ld)0,dist_lp(l1,p[r]) * 2 / sqrt(3.0));\n\t\t/*while (l != i + 1 && ccw(y1, p[l], y2) != -1) {\n\t\t\tl = (l - 1+n) % n;\n\t\t}*/\n\t\tif (l == i)l = (l + 1) % n;\n\t\twhile (ccw(y1, p[(l + 1) % n],y2) == -1) {\n\t\t\tld le = dist_lp(l2, p[l]);\n\t\t\tld ri = dist_lp(l2, p[(l + 1) % n]);\n\t\t\tif (le < ri)l = (l + 1) % n;\n\t\t\telse break;\n\t\t}\n\t\tans += max(ld(0),dist_lp(l2,p[l]) * 2 / sqrt(3.0));\n\t\tout = min(out, ans);\n\t}\n\tcout << out << endl;\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3636,"score_of_the_acc":-0.1339,"final_rank":5},{"submission_id":"aoj_3056_3412922","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <complex>\n#include <cstdio>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef complex<double> P;\ntypedef pair<P,P> L;\ntypedef pair<P,double> C;\ntypedef vector<P> Poly;\n#define X real()\n#define Y imag()\nconst double EPS = (1e-10), pi = acos(-1);\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\n }\n bool cmp_y(const P &a, const P &b){\n return a.Y != b.Y ? a.Y < b.Y : a.X < b.X;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\ndouble cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\nP projection(P a, P b){ return dot(a, b)/abs(b)/abs(b)*b;}\n\nP intersection(L a, L b){\n //直線aと直線bの交点\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\n}\n\nint main(){\n int N;\n cin >> N;\n Poly pol;\n for(int i = 0; i < N; ++i){\n double x, y;\n cin >> x >> y;\n pol.emplace_back(x,y);\n }\n double ans = 1e18;\n P r(cos(-pi/3),sin(-pi/3));\n for(int i = 0; i < N; ++i){\n L l(pol[i],pol[(i+1)%N]);\n P d = pol[(i+1)%N]-pol[i];\n //cerr << d << endl\n double ma = abs(d), mi = 0;\n d /= abs(d);\n for(int j = 0; j < N; ++j){\n if(j == i or j == (i+1)%N) continue;\n L l1(pol[j],pol[j]+d*r), l2(pol[j],pol[j]+d*r*r);\n P a = intersection(l,l1), b = intersection(l,l2);\n\n ma = max(ma,dot(a-pol[i],d));\n ma = max(ma,dot(b-pol[i],d));\n mi = min(mi,dot(a-pol[i],d));\n mi = min(mi,dot(b-pol[i],d));\n }\n ans = min(ans,ma-mi);\n }\n printf(\"%.12f\\n\",ans);\n}","accuracy":1,"time_ms":1650,"memory_kb":3352,"score_of_the_acc":-0.5948,"final_rank":12},{"submission_id":"aoj_3056_3407934","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\ntypedef pair<double,ll> pdl;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\n\ntypedef complex<double> Point;\n\nconst double A=(double)1/sqrt(3);\n\ndouble R_cul(Point a,Point b,Point p){\n p-=a;\n b-=a;\n b/=abs(b);\n p/=b;\n return p.real()+A*p.imag();\n}\n\ndouble L_cul(Point a,Point b,Point p){\n p-=b;\n a-=b;\n a/=abs(a);\n p/=a;\n return p.real()-A*p.imag();\n}\n\n\nint main(){\n ll n;\n cin>>n;\n vector<Point> P(n); //反時計回りを仮定\n for(auto &I:P){\n double x,y;\n cin>>x>>y;\n I={x,y};\n }\n ll l=0,r=1;\n while(R_cul(P[0],P[1],P[r])<=R_cul(P[0],P[1],P[(r+1)%n])){r=(r+1)%n;}\n while(L_cul(P[0],P[1],P[l])<=L_cul(P[0],P[1],P[(l+n-1)%n])){l=(l+n-1)%n;}\n double ans=R_cul(P[0],P[1],P[r])+L_cul(P[0],P[1],P[l])-abs(P[1]-P[0]);\n for(ll i=1;i<n;i++){\n while(R_cul(P[i],P[(i+1)%n],P[r])<=R_cul(P[i],P[(i+1)%n],P[(r+1)%n])){r=(r+1)%n;}\n while(L_cul(P[i],P[(i+1)%n],P[l])<=L_cul(P[i],P[(i+1)%n],P[(l+1)%n])){l=(l+1)%n;}\n ans=min(ans,R_cul(P[i],P[(i+1)%n],P[r])+L_cul(P[i],P[(i+1)%n],P[l])-abs(P[i]-P[(i+1)%n]));\n }\n cout<<fixed<<setprecision(12)<<ans<<endl;\n \n \n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3304,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3056_3406359","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\ntypedef pair<double,ll> pdl;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\n\n\ntypedef complex<double> Point;\n\nconst double A=(double)1/sqrt(3);\n\ndouble R_cul(Point a,Point b,Point p){\n p-=a;\n b-=a;\n b/=abs(b);\n p/=b;\n return p.real()+A*p.imag();\n}\n\ndouble L_cul(Point a,Point b,Point p){\n p-=b;\n a-=b;\n a/=abs(a);\n p/=a;\n return p.real()-A*p.imag();\n}\n\n\nint main(){\n ll n;\n cin>>n;\n vector<Point> P(n); //反時計回りを仮定\n for(auto &I:P){\n double x,y;\n cin>>x>>y;\n I={x,y};\n }\n ll l=0,r=1;\n while(R_cul(P[0],P[1],P[r])<=R_cul(P[0],P[1],P[(r+1)%n])){r=(r+1)%n;}\n while(L_cul(P[0],P[1],P[l])<=L_cul(P[0],P[1],P[(l+n-1)%n])){l=(l+n-1)%n;}\n double ans=R_cul(P[0],P[1],P[r])+L_cul(P[0],P[1],P[l])-abs(P[1]-P[0]);\n for(ll i=1;i<n;i++){\n while(R_cul(P[i],P[(i+1)%n],P[r])<=R_cul(P[i],P[(i+1)%n],P[(r+1)%n])){r=(r+1)%n;}\n while(L_cul(P[i],P[(i+1)%n],P[l])<=L_cul(P[i],P[(i+1)%n],P[(l+1)%n])){l=(l+1)%n;}\n ans=min(ans,R_cul(P[i],P[(i+1)%n],P[r])+L_cul(P[i],P[(i+1)%n],P[l])-abs(P[i]-P[(i+1)%n]));\n }\n cout<<fixed<<setprecision(12)<<ans<<endl;\n \n \n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3304,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_3056_10891318\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\nusing ld = long double;\\nconst ld pi = acos(-1);\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n int N;\\n cin >> N;\\n vector<ll> X(N), Y(N);\\n rep(i, 0, N) cin >> X[i] >> Y[i];\\n rep(i, 0, N * 2) X.push_back(X[i]), Y.push_back(Y[i]);\\n auto f = [&](ld deg) -> ld {\\n ld A = -sinl(deg);\\n ld B = cosl(deg);\\n ld res = INF;\\n rep(i, 0, N) chmin(res, A * (ld)X[i] + B * (ld)Y[i]);\\n return -res;\\n };\\n ld ans = ILL;\\n rep(i, 0, N){\\n ll dx = X[i + 1] - X[i];\\n ll dy = Y[i + 1] - Y[i];\\n ld deg = 0;\\n if (dx == 0){\\n if (dy > 0) deg = pi / 2;\\n else deg = pi + pi / 2;\\n }\\n else if (dy == 0){\\n if (dx > 0) deg = 0;\\n else deg = pi;\\n }\\n else{\\n deg = atan((ld)(dy) / (ld)(dx));\\n if (dx < 0) deg += pi;\\n }\\n ld sum = 0;\\n rep(j, 0, 3){\\n sum += f(deg + (pi * 2 * j) / 3);\\n }\\n chmin(ans, sum);\\n }\\n ans /= sqrtl(3);\\n ans *= 2;\\n cout << fixed << setprecision(20) << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.5913,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3056_10891280\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\nusing ld = long double;\\nconst ld pi = acos(-1);\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n int N;\\n cin >> N;\\n vector<ll> X(N), Y(N);\\n rep(i, 0, N) cin >> X[i] >> Y[i];\\n rep(i, 0, N * 2) X.push_back(X[i]), Y.push_back(Y[i]);\\n auto f = [&](ld deg) -> ld {\\n ld A = sinl(deg);\\n ld B = cosl(deg);\\n ld res = INF;\\n rep(i, 0, N) chmin(res, A * X[i] + B * Y[i]);\\n return -res;\\n };\\n ld ans = INF;\\n rep(i, 0, N){\\n ll dx = X[i + 1] - X[i];\\n ll dy = Y[i + 1] - Y[i];\\n ld deg = 0;\\n if (dx == 0){\\n if (dy > 0) deg = pi / 2;\\n else deg = pi + pi / 2;\\n }\\n else if (dy == 0){\\n if (dx > 0) deg = 0;\\n else deg = pi;\\n }\\n else{\\n deg = atan((ld)(dy) / (ld)(dx));\\n if (dx < 0) deg = pi - deg;\\n else if (dy < 0) deg += pi * 2;\\n }\\n ld sum = 0;\\n rep(j, 0, 3){\\n sum += f(deg + (pi * 2 * j) / 3);\\n }\\n chmin(ans, sum);\\n }\\n ans /= sqrtl(3);\\n ans *= 2;\\n cout << fixed << setprecision(20) << ans << \\\"\\\\n\\\";\\n}\\n// わかっていない\",\n \"accuracy\": 0.375,\n \"time_ms\": 650,\n \"memory_kb\": 4212,\n \"score_of_the_acc\": -0.5907,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3056_5931720\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n\\n#define SIZE 10005\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint p[2];\\n};\\n\\nPoint point[SIZE];\\n\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\t//move = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\t//ret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tPoint center = Point(0,0);\\n\\n\\tdouble num = sqrt(3);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tPoint base = point[i];\\n\\t\\tint k = (i+1)%N;\\n\\n\\t\\tdouble rad = calc_rad(point[k]-base);\\n\\n\\t\\tdouble L = 0,R = 0;\\n\\n\\t\\tfor(int a = 0; a < N; a++){\\n\\n\\t\\t\\tPoint tmp_p = point[a]-base;\\n\\t\\t\\ttmp_p = rotate(center,tmp_p,-rad);\\n\\n\\t\\t\\t//左下方向60度の直線とx軸の交点\\n\\t\\t\\tdouble tmp_L = (num*tmp_p.x-tmp_p.y)/num;\\n\\t\\t\\tL = min(L,tmp_L);\\n\\n\\t\\t\\t//右下方向60度の直線とx軸の交点\\n\\t\\t\\tdouble tmp_R = (num*tmp_p.x+tmp_p.y)/num;\\n\\t\\t\\tR = max(R,tmp_R);\\n\\t\\t}\\n\\n\\t\\tans = min(ans,R-L);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2860,\n \"memory_kb\": 3908,\n \"score_of_the_acc\": -1.2435,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3056_4805965\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\nconst double PI = acos(-1);\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\nstruct P{\\n double X;\\n double Y;\\n P(double x=0.0, double y=0.0): X(x),Y(y){}\\n\\n inline const P inv() const { return P(X/(X*X+Y*Y), -Y/(X*X+Y*Y)); }\\n inline const P operator -() const { return P(-X, -Y); }\\n inline const P operator +(const P& a) const { return P(X+a.X, Y+a.Y); }\\n inline const P operator -(const P& a) const { return P(X-a.X, Y-a.Y); }\\n inline const P operator *(const P& a) const { return P(X*a.X -Y*a.Y, X*a.Y +Y*a.X); }\\n inline const P operator /(const P& a) const { return *this *a.inv(); }\\n inline const P operator *(const double& c) const { return P(c*X, c*Y); }\\n inline const P operator /(const double& c) const { return P(X/c, Y/c); }\\n\\n inline P& operator +=(const P& a){ X+=a.X; Y+=a.Y; return *this; }\\n inline P& operator -=(const P& a){ X-=a.X; Y-=a.Y; return *this; }\\n inline P& operator *=(const P& a){ double nX=X*a.X-Y*a.Y; Y=X*a.Y+Y*a.X; X=nX; return *this; }\\n inline P& operator /=(const P& a){ double d=a.X*a.X+a.Y*a.Y; double nX=(X*a.X+Y*a.Y)/d; Y=(-X*a.Y+Y*a.X)/d; X=nX; return *this; }\\n inline P& operator *=(const double& c){ X*=c; Y*=c; return *this; }\\n inline P& operator /=(const double& c){ X/=c; Y/=c; return *this; }\\n\\n inline bool operator ==(const P& a) const { return EQ(X,a.X) and EQ(Y,a.Y); }\\n inline bool operator !=(const P& a) const { return !(*this==a); }\\n inline bool operator <(const P& a) const { return !EQ(X,a.X)? X<a.X: Y+EPS<a.Y; }\\n inline bool operator <=(const P& a) const { return *this<a or *this==a; }\\n inline bool operator >(const P& a) const { return !(*this<=a); }\\n inline bool operator >=(const P& a) const { return !(*this<a); }\\n};\\nP operator *(const double& c, const P& p){ return P(c*p.X, c*p.Y); }\\ndouble norm(const P& a){ return a.X*a.X +a.Y*a.Y; }\\ndouble abs(const P& a){ return sqrt(a.X*a.X +a.Y*a.Y); }\\ndouble arg(const P& a){ return atan2(a.X, a.Y); }\\ndouble dot(const P& a, const P& b){ return a.X*b.X +a.Y*b.Y; }\\ndouble cross(const P& a, const P& b){ return a.X*b.Y -a.Y*b.X; }\\nstd::ostream& operator <<(std::ostream& lhs, const P& rhs){\\n lhs << \\\"(\\\" << rhs.X << \\\", \\\" << rhs.Y << \\\")\\\";\\n return lhs;\\n}\\n\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(dot(b,c-b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint main(){\\n int n;\\n cin >> n;\\n VP p(n);\\n for(int i=0; i<n; i++){\\n cin >> p[i].X >> p[i].Y;\\n }\\n double ans = INF;\\n for(int i=0; i<n; i++){\\n L edge(p[i], p[(i+1)%n]);\\n P lmin = edge[0];\\n P lmax = edge[0];\\n P ldir = rotate(edge[1]-edge[0], PI/3.0);\\n for(int j=0; j<n; j++){\\n P cp = crosspointLL(edge, L(p[j], p[j]+ldir));\\n lmin = min(lmin, cp);\\n lmax = max(lmax, cp);\\n }\\n P rmin = edge[0];\\n P rmax = edge[0];\\n P rdir = rotate(edge[1]-edge[0], PI*2.0/3.0);\\n for(int j=0; j<n; j++){\\n P cp = crosspointLL(edge, L(p[j], p[j]+rdir));\\n rmin = min(rmin, cp);\\n rmax = max(rmax, cp);\\n }\\n ans = min(ans, max(abs(lmin-rmax), abs(lmax-rmin)));\\n }\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1980,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.7767,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3056_3939871\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n\\n\\n#define EPS (1e-10)\\n#define equals(a,b) (fabs((a)-(b)) < EPS)\\n#define PI 3.141592653589793238\\n \\n// COUNTER CLOCKWISE\\nstatic const Int CCW_COUNTER_CLOCKWISE = 1;\\nstatic const Int CCW_CLOCKWISE = -1;\\nstatic const Int CCW_ONLINE_BACK = 2;\\nstatic const Int CCW_ONLINE_FRONT = -2;\\nstatic const Int CCW_ON_SEGMENT = 0;\\n\\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) :x(x),y(y){}\\n Point operator+(Point p) {return Point(x+p.x,y+p.y);}\\n Point operator-(Point p) {return Point(x-p.x,y-p.y);}\\n Point operator*(double k){return Point(x*k,y*k);}\\n Point operator/(double k){return Point(x/k,y/k);}\\n double norm(){return x*x+y*y;}\\n double abs(){return sqrt(norm());}\\n\\n bool operator < (const Point &p) const{\\n return x!=p.x?x<p.x:y<p.y;\\n //grid-point only\\n //return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\\n }\\n\\n bool operator == (const Point &p) const{\\n return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\\n }\\n};\\n\\nstruct EndPoint{\\n Point p;\\n Int seg,st;\\n EndPoint(){}\\n EndPoint(Point p,Int seg,Int st):p(p),seg(seg),st(st){}\\n bool operator<(const EndPoint &ep)const{\\n if(p.y==ep.p.y) return st<ep.st;\\n return p.y<ep.p.y;\\n }\\n};\\n\\nistream &operator >> (istream &is,Point &p){\\n is>>p.x>>p.y;\\n return is;\\n}\\n\\nostream &operator << (ostream &os,Point p){\\n os<<fixed<<setprecision(12)<<p.x<<\\\" \\\"<<p.y;\\n return os;\\n}\\n\\nbool sort_x(Point a,Point b){\\n return a.x!=b.x?a.x<b.x:a.y<b.y;\\n}\\n\\nbool sort_y(Point a,Point b){\\n return a.y!=b.y?a.y<b.y:a.x<b.x;\\n}\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nistream &operator >> (istream &is,Polygon &p){\\n for(Int i=0;i<(Int)p.size();i++) is>>p[i];\\n return is;\\n}\\n\\nstruct Segment{\\n Point p1,p2;\\n Segment(){}\\n Segment(Point p1, Point p2):p1(p1),p2(p2){}\\n};\\ntypedef Segment Line;\\n\\nistream &operator >> (istream &is,Segment &s){\\n is>>s.p1>>s.p2;\\n return is;\\n}\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\n}\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x+a.y*b.y;\\n}\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nPoint orth(Point p){return Point(-p.y,p.x);}\\n\\nPoint project(Segment s,Point p){\\n Vector base=s.p2-s.p1;\\n double r=dot(p-s.p1,base)/norm(base);\\n return s.p1+base*r;\\n}\\n\\nPoint reflect(Segment s,Point p){\\n return p+(project(s,p)-p)*2.0;\\n}\\n\\ndouble arg(Vector p){\\n return atan2(p.y,p.x);\\n}\\n\\nVector polar(double a,double r){\\n return Point(cos(r)*a,sin(r)*a);\\n}\\n\\nInt ccw(Point p0,Point p1,Point p2){\\n Vector a = p1-p0;\\n Vector b = p2-p0;\\n if(cross(a,b) > EPS) return CCW_COUNTER_CLOCKWISE;\\n if(cross(a,b) < -EPS) return CCW_CLOCKWISE;\\n if(dot(a,b) < -EPS) return CCW_ONLINE_BACK;\\n if(a.norm()<b.norm()) return CCW_ONLINE_FRONT;\\n return CCW_ON_SEGMENT;\\n}\\n\\nbool intersectSS(Point p1,Point p2,Point p3,Point p4){\\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 &&\\n ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0 );\\n}\\n\\nbool intersectSS(Segment s1,Segment s2){\\n return intersectSS(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool intersectPS(Polygon p,Segment l){\\n Int n=p.size();\\n for(Int i=0;i<n;i++)\\n if(intersectSS(Segment(p[i],p[(i+1)%n]),l)) return 1;\\n return 0;\\n}\\n\\ndouble getDistanceLP(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\ndouble getDistanceSP(Segment s,Point p){\\n if(dot(s.p2-s.p1,p-s.p1) < 0.0 ) return abs(p-s.p1);\\n if(dot(s.p1-s.p2,p-s.p2) < 0.0 ) return abs(p-s.p2);\\n return getDistanceLP(s,p);\\n}\\n\\ndouble getDistanceSS(Segment s1,Segment s2){\\n if(intersectSS(s1,s2)) return 0.0;\\n return min(min(getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2)),\\n min(getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)));\\n}\\n\\nPoint getCrossPointSS(Segment s1,Segment s2){\\n for(Int k=0;k<2;k++){\\n if(getDistanceSP(s1,s2.p1)<EPS) return s2.p1; \\n if(getDistanceSP(s1,s2.p2)<EPS) return s2.p2;\\n swap(s1,s2);\\n }\\n Vector base=s2.p2-s2.p1;\\n double d1=abs(cross(base,s1.p1-s2.p1));\\n double d2=abs(cross(base,s1.p2-s2.p1));\\n double t=d1/(d1+d2);\\n return s1.p1+(s1.p2-s1.p1)*t;\\n}\\n\\nPoint getCrossPointLL(Line l1,Line l2){\\n double a=cross(l1.p2-l1.p1,l2.p2-l2.p1);\\n double b=cross(l1.p2-l1.p1,l1.p2-l2.p1);\\n if(abs(a)<EPS&&abs(b)<EPS) return l2.p1;\\n return l2.p1+(l2.p2-l2.p1)*(b/a);\\n}\\n\\n// IN:2 ON:1 OUT:0\\nInt contains(Polygon g,Point p){\\n Int n=g.size();\\n bool x=false;\\n for(Int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(fabs(cross(a,b)) < EPS && dot(a,b) < EPS) return 1;\\n if(a.y>b.y) swap(a,b);\\n if(a.y < EPS && EPS < b.y && cross(a,b) > EPS ) x = !x;\\n }\\n return (x?2:0);\\n}\\n\\nVector translate(Vector v,double theta){\\n Vector res;\\n res.x=cos(theta)*v.x-sin(theta)*v.y;\\n res.y=sin(theta)*v.x+cos(theta)*v.y;\\n return res;\\n}\\n\\n\\nstruct Precision{\\n Precision(){\\n cout<<fixed<<setprecision(12);\\n }\\n}precision_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n;\\n cin>>n;\\n Polygon ps(n);\\n for(Int i=0;i<n;i++) cin>>ps[i];\\n for(Int i=0;i<n;i++) ps.push_back(Point(ps[i]));\\n for(Int i=0;i<n;i++) ps.push_back(Point(ps[i]));\\n\\n double ans=1e18;\\n Int l=n,r=n+1;\\n for(Int i=n;i<n+n;i++){\\n while(r<i+1) r++;\\n double th=arg(ps[i+1]-ps[i]);\\n Vector v1=polar(100,th+2*PI/3);\\n Vector v2=polar(100,th+4*PI/3);\\n\\n Line b(ps[i],ps[i+1]);\\n\\n auto calc=\\n [&](Int k,Vector v,Int w)->double{\\n Point p=getCrossPointLL(b,Line(ps[k],ps[k]+v));\\n if(abs(p-ps[i+w])<abs(p-ps[i+!w])) return -1;\\n return abs(p-ps[i+w]); \\n };\\n \\n while(calc(l,v2,1)<0) l++;\\n while(calc(l,v2,1)<calc(l-1,v2,1)) l--;\\n while(calc(l,v2,1)<calc(l+1,v2,1)) l++;\\n while(calc(r,v1,0)<calc(r-1,v1,0)) r--;\\n while(calc(r,v1,0)<calc(r+1,v1,0)) r++;\\n\\n Point p1=getCrossPointLL(b,Line(ps[r],ps[r]+v1));\\n Point p2=getCrossPointLL(b,Line(ps[l],ps[l]+v2));\\n chmin(ans,abs(p1-p2));\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": -0.171,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3056_3895290\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3056.cc: Equilateral Triangle\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 10000;\\nconst double PI = acos(-1.0);\\nconst double TH60 = PI * 2 * 60 / 360;\\nconst double C60 = cos(TH60), S60 = sin(TH60);\\nconst double DINF = 1e60;\\n\\n/* typedef */\\n\\ntemplate <typename T>\\nstruct Pt {\\n T x, y;\\n\\n Pt() {}\\n Pt(T _x, T _y) : x(_x), y(_y) {}\\n Pt(const Pt<T> &pt) : x(pt.x), y(pt.y) {}\\n\\n Pt<T> operator+(const Pt<T> pt) const { return Pt<T>(x + pt.x, y + pt.y); }\\n Pt<T> operator-() const { return Pt<T>(-x, -y); }\\n Pt<T> operator-(const Pt<T> pt) const { return Pt<T>(x - pt.x, y - pt.y); }\\n Pt<T> operator*(T t) const { return Pt<T>(x * t, y * t); }\\n Pt<T> operator/(T t) const { return Pt<T>(x / t, y / t); }\\n T dot(Pt<T> v) const { return x * v.x + y * v.y; }\\n T cross(Pt<T> v) const { return x * v.y - y * v.x; }\\n T d2() { return x * x + y * y; }\\n double d() { return sqrt(d2()); }\\n\\n Pt<T> rot60() { return Pt<T>(C60 * x - S60 * y, S60 * x + C60 * y); }\\n Pt<T> rot300() { return Pt<T>(C60 * x + S60 * y, -S60 * x + C60 * y); }\\n\\n Pt<T> normalize() {\\n double d0 = d();\\n return (d0 != 0.0) ? Pt<T>(x / d0, y / d0) : *this;\\n }\\n\\n bool operator==(const Pt<T> pt) const { return x == pt.x && y == pt.y; }\\n bool operator<(const Pt<T> &pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n\\n bool read() { return (scanf(\\\"%lf%lf\\\", &x, &y) == 2); }\\n void print() { printf(\\\"(%lf,%lf)\\\", x, y); }\\n};\\n\\ntypedef Pt<double> pt;\\n\\nstruct CL {\\n pt p;\\n double t0, t1;\\n CL() {}\\n CL(const pt& _p, double _t0, double _t1) : p(_p), t0(_t0), t1(_t1) {}\\n};\\n\\n/* global variables */\\n\\npt ps[MAX_N];\\n\\n/* subroutines */\\n\\nbool cross_lines(const pt& ap, const pt av, const pt& bp, const pt bv,\\n\\t\\t CL& cl) {\\n double op01 = av.cross(bv);\\n //if (op01 == 0.0) return false; /* need to handle parallel?? */\\n\\n if (op01 == 0.0) {\\n pt v = bp - ap;\\n if (v.cross(av) != 0.0) return false;\\n\\n pt a1 = ap + av;\\n pt b1 = bp + bv;\\n\\n return\\n ((bp - ap).dot(b1 - ap) <= 0.0 ||\\n (bp - a1).dot(b1 - a1) <= 0.0 ||\\n (ap - bp).dot(a1 - bp) <= 0.0 ||\\n (ap - b1).dot(a1 - b1) <= 0.0);\\n }\\n\\n pt v = bp - ap;\\n double op0 = v.cross(av);\\n double op1 = v.cross(bv);\\n\\n double t0 = op1 / op01;\\n double t1 = op0 / op01;\\n\\n cl.p = bv * t1 + bp;\\n cl.t0 = t0;\\n cl.t1 = t1;\\n\\n return true;\\n //return (0.0 <= cl.t0 && cl.t0 <= 1.0 && 0.0 <= cl.t1 && cl.t1 <= 1.0);\\n}\\n\\n/* main */\\n\\nint main() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++) ps[i].read();\\n\\n double minl = DINF;\\n for (int i = 0; i < n; i++) {\\n pt &p0 = ps[i], &p1 = ps[(i + 1) % n];\\n pt v0 = (p1 - p0).normalize();\\n pt v1 = v0.rot60(), v2 = v0.rot300();\\n double mint = 0.0, maxt = 0.0;\\n\\n for (int j = 0; j < n; j++) {\\n CL cl1, cl2;\\n cross_lines(p0, v0, ps[j], v1, cl1);\\n cross_lines(p0, v0, ps[j], v2, cl2);\\n if (mint > cl1.t0) mint = cl1.t0;\\n if (maxt < cl2.t0) maxt = cl2.t0;\\n }\\n double l = maxt - mint;\\n if (minl > l) minl = l;\\n }\\n\\n printf(\\\"%.8lf\\\\n\\\", minl);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1380,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.5049,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3056_3780784\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <string>\\n#include <climits>\\n#include <iomanip>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <tuple>\\n#include <iostream>\\n#include <deque>\\n#include <array>\\n#include <set>\\n#include <functional>\\n#include <memory>\\n#include <stack>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\n\\nstruct Point;\\nstruct Vector;\\nstruct Angle;\\nclass Line;\\nstruct Point {\\n\\tlong double x, y;\\n\\tlong double distance(const Point& that) const;\\n\\tVector operator-(const Point& that) const;\\n};\\nstruct Vector {\\n\\tlong double x, y;\\n\\tAngle angle_from(const Vector& that) const;\\n\\tAngle angle() const;\\n\\tlong double length() const;\\n\\tlong double cross(const Vector& that) const;\\n\\tlong double dot(const Vector& that) const;\\n};\\nstruct Angle {\\n\\tstatic const long double Pi;\\n\\tstatic const Angle degree0;\\n\\tstatic const Angle degree120;\\n\\tstatic const Angle degree240;\\n\\tlong double sin, cos;\\n\\tAngle operator+(const Angle& that) const;\\n\\tAngle operator-(const Angle& that) const;\\n\\tlong double radian() const;\\n\\tbool near_enough(const Angle& that) const;\\n};\\nconst Angle Angle::degree0 = Angle{ 0, 1 };\\nconst Angle Angle::degree120 = Angle{ std::sqrt(3.0) / 2, -1.0 / 2 };\\nconst Angle Angle::degree240 = Angle{ -std::sqrt(3.0) / 2, -1.0 / 2 };\\nstruct AngleRange {\\n\\tAngle from, to;\\n\\tbool contains(const Angle& that) const;\\n};\\nclass Line {\\n\\tlong double a, b, c;\\npublic:\\n\\tLine(const Point& point, const Angle& angle) :a{ angle.sin }, b{ -angle.cos }, c{ -point.x * angle.sin + point.y * angle.cos }{}\\n\\tLine(const Point& point, const Vector& vec) :Line(point, vec.angle()) {}\\n\\tPoint cross_point(const Line& that) const;\\n};\\ntemplate<typename T>\\nclass RingArray {\\n\\tstd::vector<T> array;\\npublic:\\n\\tRingArray() {};\\n\\tRingArray(const int size) : array(size) {};\\n\\tvoid push_back(const T& value);\\n\\tconst T& operator[](const int index) const;\\n\\tT& operator[](const int index);\\n};\\n\\nlong double Point::distance(const Point& that) const\\n{\\n\\treturn (*this - that).length();\\n}\\nVector Point::operator-(const Point& that) const {\\n\\treturn Vector{ x - that.x, y - that.y };\\n}\\n\\nAngle Vector::angle_from(const Vector& that) const\\n{\\n\\tauto len = length() * that.length();\\n\\tauto sin = cross(that) / len;\\n\\tauto cos = dot(that) / len;\\n\\treturn Angle{ sin, cos };\\n}\\n\\nAngle Vector::angle() const\\n{\\n\\tauto len = length();\\n\\treturn Angle{ y / len, x / len };\\n}\\n\\nlong double Vector::length() const\\n{\\n\\treturn std::sqrt(x * x + y * y);\\n}\\n\\nlong double Vector::cross(const Vector& that) const\\n{\\n\\treturn x * that.y - y * that.x;\\n}\\n\\nlong double Vector::dot(const Vector& that) const\\n{\\n\\treturn x * that.x + y * that.y;\\n}\\nconst long double Angle::Pi = std::acos(-1.0);\\nAngle Angle::operator+(const Angle& that) const\\n{\\n\\treturn Angle{ sin * that.cos + cos * that.sin, cos * that.cos - sin * that.sin };\\n}\\n\\nAngle Angle::operator-(const Angle& that) const\\n{\\n\\treturn Angle{ sin * that.cos - cos * that.sin, cos * that.cos + sin * that.sin };\\n}\\n\\nlong double Angle::radian() const\\n{\\n\\tif (cos >= 1) return 0;\\n\\telse if (cos <= -1) return Pi;\\n\\telse if (sin >= 0) return std::acos(cos);\\n\\telse return Pi * 2 - std::acos(cos);\\n}\\n\\nbool Angle::near_enough(const Angle& that) const\\n{\\n\\treturn (*this - that).cos + 0.0000001 >= 1;\\n}\\n\\nbool AngleRange::contains(const Angle& that) const\\n{\\n\\treturn to.near_enough(that) || from.near_enough(that) || (to - from).radian() + LDBL_EPSILON >= (that - from).radian();\\n}\\n\\nPoint Line::cross_point(const Line& that) const\\n{\\n\\tconst auto d = a * that.b - b * that.a;\\n\\treturn Point{ (b * that.c - c * that.b) / d, (c * that.a - a * that.c) / d };\\n}\\n\\ntemplate<typename T>\\nvoid RingArray<T>::push_back(const T& value)\\n{\\n\\tarray.push_back(value);\\n}\\n\\ntemplate<typename T>\\nconst T& RingArray<T>::operator[](const int index) const\\n{\\n\\treturn array[index % array.size()];\\n}\\n\\ntemplate<typename T>\\nT& RingArray<T>::operator[](const int index)\\n{\\n\\treturn array[index % array.size()];\\n}\\nint main() {\\n\\tint n; std::cin >> n;\\n\\tRingArray<Point> points(n);\\n\\tfor (auto i = 0; i < n; ++i) std::cin >> points[i].x >> points[i].y;\\n\\tAngleRange first_angle{ Angle::degree0, Angle::degree120 }, second_angle{ Angle::degree0, Angle::degree240 };\\n\\tstd::queue<int> first_suspect, second_suspect;\\n\\tfor (auto i = 1; i < n; ++i) {\\n\\t\\tfirst_suspect.push(i); second_suspect.push(i);\\n\\t}\\n\\tint first{ 0 }, second{ 0 };\\n\\tlong double min = LDBL_MAX;\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tfirst_suspect.push(i); second_suspect.push(i);\\n\\t\\tauto base = points[i + 1] - points[i];\\n\\t\\twhile (first_angle.contains(base.angle_from(points[first + 1] - points[first])) && !first_suspect.empty()) {\\n\\t\\t\\tfirst = first_suspect.front(); first_suspect.pop();\\n\\t\\t}\\n\\t\\twhile (second_angle.contains(base.angle_from(points[second + 1] - points[second])) && !second_suspect.empty()) {\\n\\t\\t\\tsecond = second_suspect.front(); second_suspect.pop();\\n\\t\\t}\\n\\t\\tauto base_line = Line(points[i], base);\\n\\t\\tauto crosspoint_first = base_line.cross_point(Line(points[first], base.angle() + Angle::degree120));\\n\\t\\tauto crosspoint_second = base_line.cross_point(Line(points[second], base.angle() + Angle::degree240));\\n\\t\\tauto len = crosspoint_first.distance(crosspoint_second);\\n\\t\\tif (min > len) min = len;\\n\\t}\\n\\tstd::cout << std::setprecision(10) << std::fixed << min << std::endl;\\n}\",\n \"accuracy\": 0.0625,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.079,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3056_3416730\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\ntypedef long double ld;\\nconst ld INF = (ld)10000000000;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-7;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\ntypedef pair<ld, ld> LDP;\\n\\n//外心を求める。3点が同一直線上だとRE\\nLDP cent(LDP a[3]) {\\n\\tld x[2], y[2];\\n\\trep(i, 2) {\\n\\t\\tx[i] = a[i + 1].first - a[0].first;\\n\\t\\ty[i] = a[i + 1].second - a[0].second;\\n\\t}\\n\\tld bunbo = 2 * (x[0] * y[1] - y[0] * x[1]);\\n\\tld cx = (x[0] * x[0] * y[1] + y[0] * y[0] * y[1] - y[0] * x[1] * x[1] - y[0] * y[1] * y[1]) / bunbo;\\n\\tld cy = (x[0] * x[1] * x[1] + x[0] * y[1] * y[1] - x[0] * x[0] * x[1] - y[0] * y[0] * x[1]) / bunbo;\\n\\treturn { cx + a[0].first,cy + a[0].second };\\n}\\n\\n\\nbool eq(ld a, ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n//内積\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a)*b);\\n}\\n//外積\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a)*b);\\n}\\n//線分\\n//直線にするなら十分通い２点を端点とすればよい\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\n//円\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n};\\n//3点の位置関係\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\\n\\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\\n\\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\\n\\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\\n\\treturn 0;//a,c,bの順に一直線\\n}\\n//2直線の交差判定\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n//直線と線分の交差判定\\nbool isis_ls(Line l, Line s) {\\n\\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n//点が直線上に存在するか\\nbool isis_lp(Line l, Point p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n//点が線分上に存在するか\\nbool isis_sp(Line s, Point p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n//線分と線分の交差判定\\nbool isis_ss(Line s, Line t) {\\n\\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\\n\\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\\n}\\n//点から直線への垂線の足\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n//直線と直線の交点\\n//平行な２直線に対しては使うな！！！！\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n//直線と点の距離\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n//直線と直線の距離\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n//線分と直線の距離\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n//線分と点の距離\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\\n}\\n//線分と線分の距離\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t))return 0;\\n\\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\\n}\\n\\nint n;\\nPoint p[10001];\\nconst ld th = pi / 3;\\nint main() {\\n\\tcout << fixed << setprecision(6);\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tld x, y; cin >> x >> y;\\n\\t\\tp[i] = { x,y };\\n\\t}\\n\\tp[n] = p[0];\\n\\tld out = INF;\\n\\tint l = 1, r = 1;\\n\\trep(i, n) {\\n\\t\\tPoint d = p[i + 1] - p[i];\\n\\t\\tPoint d1 = d * Point{ cos(th),sin(th) };\\n\\t\\tPoint d2 = d * Point{ cos(-th),sin(-th) };\\n\\t\\tPoint x1 = p[i] + Point{ -INF * real(d1),-INF * imag(d1) };\\n\\t\\tPoint x2 = p[i] + Point{ INF * real(d1),INF * imag(d1) };\\n\\t\\tPoint y1 = p[i + 1] + Point{ -INF * real(d2),-INF * imag(d2) };\\n\\t\\tPoint y2 = p[i + 1] + Point{ INF*real(d2),INF*imag(d2) };\\n\\t\\tLine l1 = { x1,x2 }, l2 = { y1,y2 };\\n\\t\\twhile (r!=i&&ccw(x1, p[r], x2) != -1) {\\n\\t\\t\\tr = (r + 1) % n;\\n\\t\\t}\\n\\t\\twhile (r != i) {\\n\\t\\t\\tld le = dist_lp(l1, p[r]);\\n\\t\\t\\tld ri = dist_lp(l1, p[(r+1)%n]);\\n\\t\\t\\tif (le < ri)r = (r + 1) % n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tld ans = abs(p[i + 1] - p[i]);\\n\\t\\tans += max((ld)0,dist_lp(l1,p[r]) * 2 / sqrt(3.0));\\n\\t\\t/*while (l != i + 1 && ccw(y1, p[l], y2) != -1) {\\n\\t\\t\\tl = (l - 1+n) % n;\\n\\t\\t}*/\\n\\t\\tif (l == i)l = (l + 1) % n;\\n\\t\\twhile (ccw(y1, p[(l + 1) % n],y2) == -1) {\\n\\t\\t\\tld le = dist_lp(l2, p[l]);\\n\\t\\t\\tld ri = dist_lp(l2, p[(l + 1) % n]);\\n\\t\\t\\tif (le < ri)l = (l + 1) % n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tans += max(ld(0),dist_lp(l2,p[l]) * 2 / sqrt(3.0));\\n\\t\\tout = min(out, ans);\\n\\t}\\n\\tcout << out << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.1548,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3056_3414996\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\n#include <cmath>\\nusing namespace std;\\n\\n////////////////////////////\\n// 基本要素 (点, 線分)\\n////////////////////////////\\n\\nusing DD = double;\\nconst DD INF = 1LL<<35; // to be set appropriately\\nconst DD EPS = 1e-6; // to be set appropriately\\nconst DD PI = acos(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n\\nDD solve(int i, const vector<Point> &vp) {\\n // vp[i] が原点に、辺 (vp[i], vp[i+1]) が x 軸上正の向きに来るように回転する\\n int N = vp.size();\\n Point p = vp[i];\\n Point q = vp[(i+1) % N];\\n DD th = atan2(q.y - p.y, q.x - p.x);\\n vector<Point> nvp = vp;\\n for (int i = 0; i < N; ++i) {\\n nvp[i] = nvp[i] - p;\\n nvp[i] = rot(nvp[i], -th);\\n }\\n\\n // 各頂点から左右に 60 度の方向にビームを打つ\\n DD mi = 0, ma = 0;\\n for (int i = 0; i < N; ++i) {\\n mi = min(mi, nvp[i].x - nvp[i].y / sqrt(3.0));\\n ma = max(ma, nvp[i].x + nvp[i].y / sqrt(3.0));\\n }\\n return ma - mi;\\n}\\n\\n\\nint main() {\\n int N; cin >> N;\\n vector<Point> vp(N);\\n for (int i = 0; i < N; ++i) cin >> vp[i].x >> vp[i].y;\\n\\n DD res = INF;\\n for (int i = 0; i < N; ++i) res = min(res, solve(i, vp));\\n cout << fixed << setprecision(10) << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.4091,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3056_3413551\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef int _loop_int;\\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define CHMIN(a,b) a=min((a),(b))\\n#define CHMAX(a,b) a=max((a),(b))\\n\\n// mod\\nconst ll MOD = 1000000007ll;\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\n// floating\\ntypedef double Real;\\nconst Real EPS = 1e-11;\\n#define EQ0(x) (abs(x)<EPS)\\n#define EQ(a,b) (abs(a-b)<EPS)\\ntypedef complex<Real> P;\\n\\nint n;\\nP pts[12525];\\nconst Real PI = 4.0*atan(1.0);\\n\\nReal dot(P a, P b){return real(a*conj(b));}\\nReal cross(P a, P b){return imag(a*conj(b));}\\n\\nP getPoint(P s, P v1, P t, P v2){\\n P n = v2*exp(P(0,PI/2.0));\\n Real x = dot(n,t-s) / dot(n,v1);\\n return s + v1*x;\\n}\\n\\nReal f(Real th, int id){\\n return cos(th)*pts[id].real() + sin(th)*pts[id].imag();\\n}\\n\\nint main(){\\n double rnd = rand() / 65536.0;\\n scanf(\\\"%d\\\",&n);\\n REP(i,n){\\n int x,y;\\n scanf(\\\"%d%d\\\",&x,&y);\\n pts[i] = P(x,y) * exp(P(0,rnd));\\n }\\n vector<double> queries;\\n map<double,int> qans;\\n REP(i,n){\\n P a = pts[i], b = pts[(i+1)%n];\\n P v = b-a;\\n v *= exp(P(0,-PI/2.0));\\n double th = arg(v);\\n queries.push_back(th);\\n th += PI*2.0/3.0;\\n while(th>PI)th -= 2.0*PI;\\n queries.push_back(th);\\n th += PI*2.0/3.0;\\n while(th>PI)th -= 2.0*PI;\\n queries.push_back(th);\\n }\\n sort(ALL(queries));\\n // query\\n int cur = 0;\\n REP(i,n)if(pts[i].real() < pts[cur].real()){\\n cur = i;\\n }\\n REP(i,queries.size()){\\n double th = queries[i];\\n while(true){\\n int ni = (cur + 1) % n;\\n if(f(th,cur) < f(th,ni)){\\n cur = ni;\\n }else{\\n break;\\n }\\n }\\n qans[th] = cur;\\n }\\n // calc\\n double ans = 1e25;\\n REP(i,n){\\n P a = pts[i], b = pts[(i+1)%n];\\n P v = b-a;\\n v *= exp(P(0,-PI/2.0));\\n double th = arg(v);\\n int sid = qans[th];\\n double th2 = th + PI*2.0/3.0;\\n while(th2>PI)th2 -= 2.0*PI;\\n int tid = qans[th2];\\n double th3 = th2 + PI*2.0/3.0;\\n while(th3>PI)th3 -= 2.0*PI;\\n int uid = qans[th3];\\n P c1 = getPoint(pts[sid], exp(P(0,th+PI/2.0)), pts[tid], exp(P(0,th2+PI/2.0)));\\n P c2 = getPoint(pts[sid], exp(P(0,th+PI/2.0)), pts[uid], exp(P(0,th3+PI/2.0)));\\n CHMIN(ans, abs(c1-c2));\\n }\\n printf(\\\"%.9f\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5784,\n \"score_of_the_acc\": -1,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3056_3413503\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\n#include<vector>\\n#include<cmath>\\nusing namespace std;\\nstruct Point{\\n\\tdouble x,y;\\n};\\nint n;\\nPoint a[11111];\\nPoint b[11111];\\nvoid conv(double theta)\\n{\\n\\tdouble C=cos(-theta);\\n\\tdouble S=sin(-theta);\\n\\tfor(int i=0;i<n;i++)\\n\\t{\\n\\t\\tb[i].x=a[i].x*C-a[i].y*S;\\n\\t\\tb[i].y=a[i].x*S+a[i].y*C;\\n\\t}\\n}\\nmain()\\n{\\n\\tcin>>n;\\n\\tfor(int i=0;i<n;i++)cin>>a[i].x>>a[i].y;\\n\\tdouble ans=1e150;\\n\\tfor(int i=0;i<n;i++)\\n\\t{\\n\\t\\tint I=(i+1)%n;\\n\\t\\tdouble now=hypot(a[I].x-a[i].x,a[I].y-a[i].y);\\n\\t\\tdouble theta=atan2(a[I].y-a[i].y,a[I].x-a[i].x);\\n\\t\\t//cout<<theta<<endl;\\n\\t\\tconv(theta+5*M_PI/6);\\n\\t\\tif(0&&i==0)\\n\\t\\t{\\n\\t\\t\\tcout<<endl<<\\\"debug\\\"<<endl;\\n\\t\\t\\tfor(int j=0;j<n;j++)cout<<b[j].x<<\\\" \\\"<<b[j].y<<endl;\\n\\t\\t\\tcout<<\\\"debug\\\"<<endl;\\n\\t\\t}\\n\\t\\t//double mx=1e150;\\n\\t\\t//for(int j=0;j<n;j++)mx=min(mx,i==j?1e150:b[j].x-b[i].x);\\n\\t\\tdouble mx=0;\\n\\t\\tfor(int j=0;j<n;j++)mx=max(mx,b[j].x-b[i].x);\\n\\t\\t//cout<<mx<<\\\" \\\";\\n\\t\\tnow+=mx/cos(M_PI/6);\\n\\t\\tconv(theta+M_PI/6);\\n\\t\\tif(0&&i==0)\\n\\t\\t{\\n\\t\\t\\tcout<<endl<<\\\"debug\\\"<<endl;\\n\\t\\t\\tfor(int j=0;j<n;j++)cout<<b[j].x<<\\\" \\\"<<b[j].y<<endl;\\n\\t\\t\\tcout<<\\\"debug\\\"<<endl;\\n\\t\\t}\\n\\t\\tmx=0;\\n\\t\\tfor(int j=0;j<n;j++)mx=max(mx,I==j?0:b[j].x-b[I].x);\\n\\t\\t//cout<<mx<<endl;\\n\\t\\tnow+=mx/cos(M_PI/6);\\n\\t\\tans=min(ans,now);\\n\\t}\\n\\tcout<<fixed<<setprecision(9)<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 4028,\n \"score_of_the_acc\": -0.4218,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3056_3413443\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <iomanip>\\n\\nusing namespace std;\\n#define double long double\\ndouble px[10000], py[10000];\\nint N;\\nint argmax(double* arr) {\\n double maxval;\\n int maxindex = -1;\\n for (int i=0; i<N; i++) {\\n if (maxindex == -1 || maxval < arr[i]) {\\n maxval = arr[i];\\n maxindex = i;\\n }\\n }\\n return maxindex;\\n}\\n\\ndouble solve(double ax, double ay, double ux, double uy, double bx, double by, double vx, double vy) {\\n // solve a + su = b + tv\\n // su - tv = b - a\\n // (s, t) = (u, -v).inv @ (b-a)\\n double mat[2][2] = {\\n { ux, -vx },\\n { uy, -vy }\\n };\\n double det = mat[0][0] * mat[1][1] - mat[0][1] * mat[1][0];\\n //cout << \\\"det:\\\" << det << endl;\\n double idet = 1 / det;\\n double inv[2][2] = {\\n { idet * mat[1][1], -idet * mat[0][1] },\\n { -idet * mat[1][0], idet*mat[0][0] }};\\n double s = inv[0][0] * (bx-ax) + inv[0][1] * (by-ay);\\n double t = inv[1][0] * (bx-ax) + inv[1][1] * (by-ay);\\n //cout << \\\"st\\\" << s << \\\" \\\" << t << endl;\\n double xx = ax + s * ux;\\n double yy = ay + s * uy;\\n //cerr << xx << \\\" \\\" << yy << endl;\\n //cerr << bx+t*vx << \\\" \\\" << by+t*vy << endl;\\n return sqrt((xx-ax) * (xx-ax) + (yy-ay)*(yy-ay));\\n\\n}\\n\\ndouble calc(double base_rad) {\\n double farA[10000], farB[10000], farC[10000];\\n\\n double cosA = cos(base_rad + M_PI*2/3);\\n double sinA = sin(base_rad + M_PI*2/3);\\n double cosB = cos(base_rad - M_PI*2/3);\\n double sinB = sin(base_rad - M_PI*2/3);\\n double cosC = cos(base_rad);\\n double sinC = sin(base_rad);\\n // transform\\n for (int i=0; i<N; i++) {\\n farA[i] = px[i] * cosA + py[i] * sinA;\\n farB[i] = px[i] * cosB + py[i] * sinB;\\n farC[i] = px[i] * cosC + py[i] * sinC;\\n //cout << farA[i] << endl;\\n //cout << farB[i] << endl;\\n //cout << farC[i] << endl;\\n //cout << endl;\\n }\\n int maxAindex = argmax(farA);\\n int maxBindex = argmax(farB);\\n int maxCindex = argmax(farC);\\n double pax = px[maxAindex];\\n double pay = py[maxAindex];\\n double pbx = px[maxBindex];\\n double pby = py[maxBindex];\\n double pcx = px[maxCindex];\\n double pcy = py[maxCindex];\\n double vecAx = -sinA;\\n double vecAy = cosA;\\n double vecBx = -sinB;\\n double vecBy = cosB;\\n double vecCx = -sinC;\\n double vecCy = cosC;\\n //cout << \\\"vecC \\\" << vecCx << \\\",\\\" << vecCy << endl;\\n double val = solve(pcx, pcy, vecCx, vecCy, pbx, pby, vecBx, vecBy) + solve(pcx, pcy, vecCx, vecCy, pax, pay, vecAx, vecAy);\\n return val;\\n}\\n\\nint main() {\\n cin >> N;\\n for (int i=0; i<N; i++) cin >> px[i] >> py[i];\\n\\n const int try_n = 10000;\\n const int try2_n = 10000;\\n double minval = -1;\\n double minrad = 0;\\n\\n for (int try_i = 0; try_i < try_n; try_i++) {\\n double base_rad = try_i * M_PI * 2 / 3 / try_n;\\n double val = calc(base_rad);\\n if (minval == -1 || val < minval) {\\n minval = val;\\n minrad = base_rad;\\n }\\n }\\n double rad_from = minrad - M_PI * 2 / 3 / try_n;\\n double rad_to = minrad + M_PI * 2 / 3 / try_n;\\n for (int try_i = 0; try_i < try2_n; try_i++) {\\n double base_rad = rad_from + (rad_to - rad_from) * try_i / try2_n;\\n double val = calc(base_rad);\\n if (minval == -1 || val < minval) {\\n minval = val;\\n minrad = base_rad;\\n }\\n }\\n cout << setprecision(15) << minval << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1910,\n \"memory_kb\": 4340,\n \"score_of_the_acc\": -1.0844,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3056_3413182\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\n#define double long double\\n\\n/* 基本要素 */\\ntypedef complex<double> Point;\\ntypedef pair<Point, Point> Line;\\ntypedef vector<Point> VP;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-6; // 許容誤差^2\\nconst double INF = 1e9;\\n#define X real()\\n#define Y imag()\\n#define LE(n,m) ((n) - (m) < EPS)\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 2直線の交点\\nPoint crosspointLL(Point a1, Point a2, Point b1, Point b2) {\\n double d1 = cross(b2-b1, b1-a1);\\n double d2 = cross(b2-b1, a2-a1);\\n if (EQ(d1, 0) && EQ(d2, 0)) return a1; // same line\\n assert(!EQ(d2, 0)); // 交点がない\\n return a1 + d1/d2 * (a2-a1);\\n}\\n\\nusing Vector = Point;\\n\\nPoint READ(){\\n double x,y;\\n cin >>x >>y;\\n return Point(x,y);\\n}\\n\\ndouble calct(Point a, Point b, Point c, Vector u){\\n Vector v = b-a;\\n Point cp = crosspointLL(a,b,c,c+u);\\n\\n double t;\\n if(EQ(v.X, 0)){\\n if( EQ(v.Y, 0) ){\\n while(1){}\\n }\\n\\n t = (cp.Y - a.Y)/v.Y;\\n }\\n else{\\n t = (cp.X - a.X)/v.X;\\n }\\n return t;\\n}\\n\\nint main(){\\n int n;\\n cin >>n;\\n\\n VP p(n);\\n rep(i,n) p[i] = READ();\\n\\n double ans = 1e12;\\n int min_idx = 0, max_idx = 0;\\n double mnt = INF, mxt = -INF;\\n rep(i,n){\\n Point a = p[0], b = p[1];\\n Vector v = b-a;\\n\\n Vector mnv = v * polar((double)1.0, -2*PI/3);\\n Vector mxv = v * polar((double)1.0, -PI/3);\\n\\n Point c = p[i];\\n\\n double tt = calct(a,b,c,mnv);\\n if(tt < mnt){\\n mnt = tt;\\n min_idx = i;\\n }\\n\\n tt = calct(a,b,c,mxv);\\n if(tt > mxt){\\n mxt = tt;\\n max_idx = i;\\n }\\n ans = abs( (a+mnt*v) - (a+mxt*v) );\\n }\\n\\n // dbg(ans);\\n // printf(\\\" 0 : min %d max %d\\\\n\\\", min_idx, max_idx);\\n\\n for(int i=1; i<n; ++i){\\n Point a = p[i], b = p[(i+1)%n];\\n Vector v = b-a;\\n\\n Vector mnv = v * polar((double)1.0, -2*PI/3);\\n Vector mxv = v * polar((double)1.0, -PI/3);\\n // dbg(v);\\n // dbg(mnv);\\n // dbg(mxv);\\n\\n rep(loop,n){\\n double pt = calct(a,b,p[min_idx],mnv);\\n double qt = calct(a,b,p[(min_idx+1)%n],mnv);\\n\\n if(qt > pt+EPS) break;\\n min_idx = (min_idx+1)%n;\\n }\\n\\n rep(loop,n){\\n double pt = calct(a,b,p[max_idx],mxv);\\n double qt = calct(a,b,p[(max_idx+1)%n],mxv);\\n\\n if(qt < pt-EPS) break;\\n max_idx = (max_idx+1)%n;\\n }\\n\\n // printf(\\\" %d : min %d max %d\\\\n\\\", i,min_idx, max_idx);\\n\\n mnt = calct(a,b,p[min_idx],mnv);\\n mxt = calct(a,b,p[max_idx],mxv);\\n double dd = abs( (a+mnt*v) - (a+mxt*v) );\\n ans = min(ans, dd);\\n }\\n\\n printf(\\\"%.10Lf\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.0129,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3056_3413010\",\n \"code_snippet\": \"#include<iostream>\\n#include<complex>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\t\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<stack>\\n#include<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#include<assert.h>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef int Def;\\ntypedef pair<double,double> pii;\\ntypedef vector<Def> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef vector<string> vs;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef pair<Def,pii> pip;\\ntypedef vector<pip>vip;\\n//#define mt make_tuple\\n//typedef tuple<double,int,double> tp;\\n//typedef vector<tp> vt;\\ntemplate<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}\\ntemplate<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}\\nconst double PI=acos(-1);\\nconst double EPS=1e-7;\\nDef inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;\\nint dx[]={0,1,0,-1};\\nint dy[]={1,0,-1,0};\\ntypedef complex<double> P;\\ntypedef vector<P> G;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\n\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n};\\nstruct C{\\n\\tP c;double r;\\n\\tC(const P &c,double r):c(c),r(r){}\\n};\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\n#define diff(P, i) (next(P, i) - curr(P, i))\\nnamespace std {\\n\\tbool operator < (const P& a, const P& b) {\\n\\t\\treturn real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n\\t\\t//return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b); \\n\\t}\\n\\tbool operator == (const P& a, const P& b) {\\n\\t\\treturn a.real()==b.real()&&a.imag()==b.imag();\\n\\t}\\n}\\nP pin(){\\n\\tdouble x,y;\\n\\tchar d;\\n\\tcin>>x>>y;\\n\\tP p(x,y);\\n\\treturn p;\\n}\\nvoid PIN(P* a,int n){\\n\\trep(i,n)a[i]=pin();\\n}\\ndouble dot(P a,P b){\\n\\treturn real(conj(a)*b);\\n}\\ndouble cross(P a,P b){\\n\\treturn imag(conj(a)*b);\\n}\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0; // a--c--b on line\\n}\\nP projection(L a,P p){\\n\\tdouble t=dot(p-a[0],a[0]-a[1])/norm(a[0]-a[1]);\\n\\treturn a[0]+t*(a[0]-a[1]);\\n}\\nP reflection(L a,P p){\\n\\treturn p+2.0*(projection(a,p)-p);\\n}\\nbool intersectLL(const L &l, const L &m) {\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel\\n abs(cross(l[1]-l[0], m[0]-l[0])) < EPS; // same line\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nbool intersectLP(const L &l, const P &p) {\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\nbool intersectSS(const L &s, const L &t) {\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&\\n ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\nbool intersectSP(const L &s, const P &p) {\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality\\n}\\ndouble distanceLP(const L &l, const P &p) {\\n\\treturn abs(p - projection(l, p));\\n}\\ndouble distanceLL(const L &l, const L &m) {\\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\ndouble distanceLS(const L &l, const L &s) {\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\ndouble distanceSP(const L &s, const P &p) {\\n const P r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s[0] - p), abs(s[1] - p));\\n}\\ndouble distanceSS(const L &s, const L &t) {\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),\\n min(distanceSP(t, s[0]), distanceSP(t, s[1])));\\n}\\n/*bool intersectCS(C c,const L &l){\\n return (distanceLP(l,c.c) < c.r+EPS &&\\n (c.r < abs(c.c-l[0]) + EPS || c.r < abs(c.c-l[1]) + EPS));\\n}*/\\nint intersectCS(C c,L l){\\n\\tif(norm(projection(l,c.c)-c.c)-c.r*c.r>EPS)return 0;\\n\\tconst double d1=abs(c.c-l[0]),d2=abs(c.c-l[1]);\\n\\tif(d1<c.r+EPS&&d2<c.r+EPS)return 0;\\n\\tif(d1<c.r-EPS&&d2>c.r+EPS||d1>c.r+EPS&&d2<c.r-EPS)return 1;\\n\\tconst P h=projection(l,c.c);\\n\\tif(dot(l[0]-h,l[1]-h)<0)return 2;\\n\\treturn 0;\\n}\\nP crosspointSS(L a,L b){\\n\\tdouble t1=abs(cross(a[1]-a[0],b[0]-a[0]));\\n\\tdouble t2=abs(cross(a[1]-a[0],b[1]-a[0]));\\n\\treturn b[0]+(b[1]-b[0])*t1/(t1+t2);\\n}\\nL crosspointCL(C c,L l){\\n\\tP pr=projection(l,c.c);\\n\\tP e=(l[1]-l[0])/abs(l[1]-l[0]);\\n\\tdouble tmp=c.r*c.r-norm(pr-c.c);\\n\\tif(abs(tmp)<EPS)tmp=0;\\n\\tdouble t=sqrt(tmp);\\n\\tP a=pr+t*e;\\n\\tP b=pr-t*e;\\n\\tif(b<a)swap(a,b);\\n\\treturn L(a,b);\\n}\\nL crosspointCS(C c,L l){\\n\\tif(intersectCS(c,l)==2)return crosspointCL(c,l);\\n\\tL ret=crosspointCL(c,l);\\n\\tif(dot(l[0]-ret[0],l[1]-ret[0])<0)ret[1]=ret[0];\\n\\telse ret[0]=ret[1];\\n\\treturn ret;\\n}\\nL crosspointCC(C a,C b){\\n\\tP tmp=b.c-a.c;\\n\\tdouble d=abs(tmp);\\n\\tdouble q=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\\n\\tdouble t=arg(tmp);//atan(tmp.imag()/tmp.real());\\n\\tP p1=a.c+polar(a.r,t+q);\\n\\tP p2=a.c+polar(a.r,t-q);\\n\\tif(p2<p1)swap(p1,p2);\\n\\treturn L(p1,p2);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1] - l[0], m[1] - m[0]);\\n double B = cross(l[1] - l[0], l[1] - m[0]);\\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\ndouble area(const G &g){\\n double S =0;\\n for(int i =0;i <g.size();i++){\\n S +=(cross(g[i],g[(i+1)%g.size()]));\\n }\\n return abs(S/2.0);\\n}\\nbool isconvex(const G &g){\\n\\tint n=g.size();\\n\\trep(i,n)if(ccw(g[(i+n-1)%n],g[i%n],g[(i+1)%n])==-1)return false;\\n\\treturn true;\\n}\\nint inconvex(const G& g, const P& p) {\\n\\tbool in = false;\\n\\tint n=g.size();\\n\\trep(i,n){\\n\\t\\tP a=g[i%n]-p;\\n\\t\\tP b=g[(i+1)%n]-p;\\n\\t\\tif(imag(a)>imag(b))swap(a, b);\\n\\t\\tif(imag(a)<EPS&&0<imag(b))if(cross(a,b)<0)in=!in;\\n\\t\\tif(abs(cross(a,b))<EPS&&dot(a,b)<EPS)return 1;//ON\\n\\t}\\n\\treturn in?2:0;//IN : OUT;\\n}\\nG convex_hull(G &ps) {\\n int n=ps.size(),k=0;\\n\\tsort(ps.begin(), ps.end());\\n\\tG ch(2*n);\\n\\tfor(int i=0;i<n;ch[k++]=ps[i++])//lower-hull\\n\\t\\twhile(k>=2&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//<=0 -> ==-1\\n\\tfor(int i=n-2,t=k+1;i>=0;ch[k++]=ps[i--])//upper-hull\\n\\t\\twhile(k>=t&&ccw(ch[k-2],ch[k-1],ps[i])==-1)--k;//\\n\\tch.resize(k-1);\\n\\treturn ch;\\n}\\ndouble convex_diameter(const G &pt) {\\n const int n = pt.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(pt[i]) > imag(pt[is])) is = i;\\n if (imag(pt[i]) < imag(pt[js])) js = i;\\n }\\n double maxd = norm(pt[is]-pt[js]);\\n\\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do {\\n if (cross(diff(pt,i), diff(pt,j)) >= 0) j = (j+1) % n;\\n else i = (i+1) % n;\\n if (norm(pt[i]-pt[j]) > maxd) {\\n maxd = norm(pt[i]-pt[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return sqrt(maxd); /* farthest pair is (maxi, maxj). */\\n}//convex_diameter(g)\\nG convex_cut(const G& g, const L& l) {\\n G Q;\\n for (int i = 0; i < g.size(); ++i) {\\n P a= curr(g, i), b= next(g, i);\\n if (ccw(l[0], l[1], a) != -1) Q.push_back(a);\\n if (ccw(l[0], l[1], a)*ccw(l[0], l[1], b) < 0)\\n Q.push_back(crosspointLL(L(a,b), l));\\n }\\n return Q;\\n}\\nP turn(P p,double t){\\n\\treturn p*exp(P(.0,t*PI/180.0));\\n}\\nP turn2(P p,double t){\\n\\treturn p*exp(P(.0,t));\\n}\\nvector<L> tangentCC(C a,C b){\\n\\tif(a.r<b.r)swap(a,b);\\n\\tdouble d=abs(a.c-b.c);\\n\\tvector<L>l;\\n\\tif(d<EPS)return l;\\n\\tif(a.r+b.r<d-EPS){//hanareteiru\\n\\t\\tdouble t=acos((a.r+b.r)/d);\\n\\t\\tt=t*180/PI;\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t),b.c+turn(b.r/d*(a.c-b.c),t)));\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t),b.c+turn(b.r/d*(a.c-b.c),-t)));\\n\\t}else if(a.r+b.r<d+EPS){//kuttuiteiru soto\\n\\t\\tP p=a.c+a.r/d*(b.c-a.c);\\n\\t\\tl.pb(L(p,p+turn(b.c-a.c,90)));\\n\\t}\\n\\tif(abs(a.r-b.r)<d-EPS){//majiwatteiru\\n\\t\\tdouble t1=acos((a.r-b.r)/d);\\n\\t\\tt1=t1*180/PI;\\n\\t\\tdouble t2=180-t1;\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),t1),b.c+turn(b.r/d*(a.c-b.c),-t2)));\\n\\t\\tl.pb(L(a.c+turn(a.r/d*(b.c-a.c),-t1),b.c+turn(b.r/d*(a.c-b.c),t2)));\\n\\t}else if(abs(a.r-b.r)<d+EPS){//kuttuiteiru uti\\n\\t\\tP p=a.c+a.r/d*(b.c-a.c);\\n\\t\\tl.pb(L(p,p+turn(b.c-a.c,90)));\\n\\t}\\n\\treturn l;\\n}\\nvoid printL(const L &out){\\n\\tprintf(\\\"%0.9f %0.9f %0.9f %0.9f\\\\n\\\",out[0].real(),out[0].imag(),out[1].real(),out[1].imag());\\n}\\nC CIN(){\\n\\tP p=pin();\\n\\tdouble r;\\n\\tcin>>r;\\n\\treturn C(p,r);\\n}\\nbool para(L a,L b){\\n\\treturn (abs(cross(a[1]-a[0],b[1]-b[0]))<EPS);\\n}\\n//余弦定理\\ndouble LawOfCosines(double a,double b,double c){\\n\\treturn acos((b*b+c*c-a*a)/(2.*b*c));\\n}\\n//外接円\\npair<P,double> circumccircle(P a,P b,P c){\\n\\tdouble dA=abs(b-c),dB=abs(a-c),dC=abs(a-b);\\n\\tdouble angA=LawOfCosines(dA,dB,dC);\\n\\tdouble angB=LawOfCosines(dB,dC,dA);\\n\\tdouble angC=LawOfCosines(dC,dA,dB);\\n\\tdouble A=sin(2.*angA),B=sin(2.*angB),C=sin(2.*angC);\\n\\tdouble x=(a.real()*A+b.real()*B+c.real()*C)/(A+B+C);\\n\\tdouble y=(a.imag()*A+b.imag()*B+c.imag()*C)/(A+B+C);\\n\\tP p(x,y);\\n\\tdouble r=dA/sin(angA)/2.;\\n\\treturn {p,r};\\n}\\n//内接円\\npair<P,double> incircle(P a,P b,P c){\\n\\tdouble dA=abs(b-c),dB=abs(a-c),dC=abs(a-b);\\n\\tL l1(a,b+dC/(dB+dC)*(c-b));\\n\\tL l2(b,a+dC/(dA+dC)*(c-a));\\n\\tP p=crosspointLL(l1,l2);\\n\\tdouble r=abs(p-projection(L(a,b),p));\\n\\treturn {p,r};\\n}\\nint n;\\nG g;\\npii f(int i,int it){\\n\\tL l(g[i],g[(i+1)%n]);\\n\\tpii out;\\n\\tP b=(g[(i+1)%n]-g[i])/abs(g[(i+1)%n]-g[i]);\\n\\t{\\n\\t\\tP p=projection(l,g[it])-g[it];\\n\\t\\tp=turn(p,-30);\\n\\t\\tout.first=dot(b,crosspointLL(l,L(g[it],g[it]+p))-g[i]);\\n\\t}\\n\\t{\\n\\t\\tP p=projection(l,g[it])-g[it];\\n\\t\\tp=turn(p,30);\\n\\t\\tout.second=dot(b,crosspointLL(l,L(g[it],g[it]+p))-g[i]);\\n\\t}\\n\\treturn out;\\n}\\nint main(){\\n\\tcin>>n;\\n\\tg=G(n);\\n\\trep(i,n)g[i]=pin();\\n\\t\\n\\tint lit=-1,rit=-1;\\n\\tpii t;\\n\\trep(j,n){\\n\\t\\tpii w=f(0,j);\\n\\t\\tcmax(t.first,-w.first);\\n\\t\\tcmax(t.second,w.second);\\n\\t}\\n\\trep(j,n){\\n\\t\\tpii w=f(0,j);\\n\\t\\tif(abs(t.first+w.first)<EPS)lit=j;\\n\\t\\tif(abs(t.second-w.second)<EPS)rit=j;\\n\\t}\\n\\tdouble out=t.first+t.second;\\n\\tloop(i,1,n){\\n\\t\\twhile(1){\\n\\t\\t\\tif(f(i,lit).first>f(i,(lit+1)%n).first)(lit+=1)%=n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\twhile(1){\\n\\t\\t\\tif(f(i,rit).second<f(i,(rit+1)%n).second)(rit+=1)%=n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tcmin(out,-f(i,lit).first+f(i,rit).second);\\n\\t}\\n\\tcout<<shosu(9)<<out<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.0199,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3056_3412990\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\ntypedef long double ld;\\nconst ld INF = (ld)10000000000;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-7;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\ntypedef pair<ld, ld> LDP;\\n\\n//外心を求める。3点が同一直線上だとRE\\nLDP cent(LDP a[3]) {\\n\\tld x[2], y[2];\\n\\trep(i, 2) {\\n\\t\\tx[i] = a[i + 1].first - a[0].first;\\n\\t\\ty[i] = a[i + 1].second - a[0].second;\\n\\t}\\n\\tld bunbo = 2 * (x[0] * y[1] - y[0] * x[1]);\\n\\tld cx = (x[0] * x[0] * y[1] + y[0] * y[0] * y[1] - y[0] * x[1] * x[1] - y[0] * y[1] * y[1]) / bunbo;\\n\\tld cy = (x[0] * x[1] * x[1] + x[0] * y[1] * y[1] - x[0] * x[0] * x[1] - y[0] * y[0] * x[1]) / bunbo;\\n\\treturn { cx + a[0].first,cy + a[0].second };\\n}\\n\\n\\nbool eq(ld a, ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n//内積\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a)*b);\\n}\\n//外積\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a)*b);\\n}\\n//線分\\n//直線にするなら十分通い２点を端点とすればよい\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\n//円\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n};\\n//3点の位置関係\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//a,b,cが反時計回り\\n\\tif (cross(b, c) < -eps)return -1;//a,b,cが時計回り\\n\\tif (dot(b, c) < 0)return 2;//c,a,bの順に一直線\\n\\tif (norm(b) < norm(c))return -2;//a,b,cの順に一直線\\n\\treturn 0;//a,c,bの順に一直線\\n}\\n//2直線の交差判定\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n//直線と線分の交差判定\\nbool isis_ls(Line l, Line s) {\\n\\treturn (cross(l.b - l.a, s.a - l.a)*cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n//点が直線上に存在するか\\nbool isis_lp(Line l, Point p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n//点が線分上に存在するか\\nbool isis_sp(Line s, Point p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n//線分と線分の交差判定\\nbool isis_ss(Line s, Line t) {\\n\\tif (isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a) || isis_sp(t, s.b))return true;\\n\\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\\n}\\n//点から直線への垂線の足\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n//直線と直線の交点\\n//平行な２直線に対しては使うな！！！！\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n//直線と点の距離\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n//直線と直線の距離\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n//線分と直線の距離\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n//線分と点の距離\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\\n}\\n//線分と線分の距離\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t))return 0;\\n\\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\\n}\\n\\nint n;\\nPoint p[10001];\\nconst ld th = pi / 3;\\nint main() {\\n\\tcout << fixed << setprecision(6);\\n\\tcin >> n;\\n\\trep(i, n) {\\n\\t\\tld x, y; cin >> x >> y;\\n\\t\\tp[i] = { x,y };\\n\\t}\\n\\tp[n] = p[0];\\n\\tld out = INF;\\n\\tint l = 1, r = 1;\\n\\trep(i, n) {\\n\\t\\tPoint d = p[i + 1] - p[i];\\n\\t\\tPoint d1 = d * Point{ cos(th),sin(th) };\\n\\t\\tPoint d2 = d * Point{ cos(-th),sin(-th) };\\n\\t\\tPoint x1 = p[i] + Point{ -INF * real(d1),-INF * imag(d1) };\\n\\t\\tPoint x2 = p[i] + Point{ INF * real(d1),INF * imag(d1) };\\n\\t\\tPoint y1 = p[i + 1] + Point{ -INF * real(d2),-INF * imag(d2) };\\n\\t\\tPoint y2 = p[i + 1] + Point{ INF*real(d2),INF*imag(d2) };\\n\\t\\tLine l1 = { x1,x2 }, l2 = { y1,y2 };\\n\\t\\twhile (r!=i&&ccw(x1, p[r], x2) != -1) {\\n\\t\\t\\tr = (r + 1) % n;\\n\\t\\t}\\n\\t\\twhile (r != i) {\\n\\t\\t\\tld le = dist_lp(l1, p[r]);\\n\\t\\t\\tld ri = dist_lp(l1, p[(r+1)%n]);\\n\\t\\t\\tif (le < ri)r = (r + 1) % n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tld ans = abs(p[i + 1] - p[i]);\\n\\t\\tans += max((ld)0,dist_lp(l1,p[r]) * 2 / sqrt(3.0));\\n\\t\\t/*while (l != i + 1 && ccw(y1, p[l], y2) != -1) {\\n\\t\\t\\tl = (l - 1+n) % n;\\n\\t\\t}*/\\n\\t\\tif (l == i)l = (l + 1) % n;\\n\\t\\twhile (ccw(y1, p[(l + 1) % n],y2) == -1) {\\n\\t\\t\\tld le = dist_lp(l2, p[l]);\\n\\t\\t\\tld ri = dist_lp(l2, p[(l + 1) % n]);\\n\\t\\t\\tif (le < ri)l = (l + 1) % n;\\n\\t\\t\\telse break;\\n\\t\\t}\\n\\t\\tans += max(ld(0),dist_lp(l2,p[l]) * 2 / sqrt(3.0));\\n\\t\\tout = min(out, ans);\\n\\t}\\n\\tcout << out << endl;\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.1339,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3056_3412922\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <complex>\\n#include <cstdio>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef complex<double> P;\\ntypedef pair<P,P> L;\\ntypedef pair<P,double> C;\\ntypedef vector<P> Poly;\\n#define X real()\\n#define Y imag()\\nconst double EPS = (1e-10), pi = acos(-1);\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return a.X != b.X ? a.X < b.X : a.Y < b.Y;\\n }\\n bool cmp_y(const P &a, const P &b){\\n return a.Y != b.Y ? a.Y < b.Y : a.X < b.X;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){ return a.X * b.X + a.Y * b.Y;}\\ndouble cross(P a, P b){ return a.X * b.Y - a.Y * b.X;}\\nP projection(P a, P b){ return dot(a, b)/abs(b)/abs(b)*b;}\\n\\nP intersection(L a, L b){\\n //直線aと直線bの交点\\n P af = a.first, as = a.second, bf = b.first, bs = b.second;\\n return af + cross(bs-bf,af-bf)/(-cross(bs-bf,as-bf)+cross(bs-bf,af-bf))*(as-af);\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n Poly pol;\\n for(int i = 0; i < N; ++i){\\n double x, y;\\n cin >> x >> y;\\n pol.emplace_back(x,y);\\n }\\n double ans = 1e18;\\n P r(cos(-pi/3),sin(-pi/3));\\n for(int i = 0; i < N; ++i){\\n L l(pol[i],pol[(i+1)%N]);\\n P d = pol[(i+1)%N]-pol[i];\\n //cerr << d << endl\\n double ma = abs(d), mi = 0;\\n d /= abs(d);\\n for(int j = 0; j < N; ++j){\\n if(j == i or j == (i+1)%N) continue;\\n L l1(pol[j],pol[j]+d*r), l2(pol[j],pol[j]+d*r*r);\\n P a = intersection(l,l1), b = intersection(l,l2);\\n\\n ma = max(ma,dot(a-pol[i],d));\\n ma = max(ma,dot(b-pol[i],d));\\n mi = min(mi,dot(a-pol[i],d));\\n mi = min(mi,dot(b-pol[i],d));\\n }\\n ans = min(ans,ma-mi);\\n }\\n printf(\\\"%.12f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1650,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.5948,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3056_3407934\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<chrono>\\n#include<unordered_map>\\n#include<fstream>\\n#include<list>\\n#include<functional>\\n#include<bitset>\\n#include<complex>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef pair<int,int> pi;\\ntypedef pair<double,double> pd;\\ntypedef pair<double,ll> pdl;\\n#define F first\\n#define S second\\nconst ll E=1e18+7;\\nconst ll MOD=1000000007;\\n\\n\\n\\ntypedef complex<double> Point;\\n\\nconst double A=(double)1/sqrt(3);\\n\\ndouble R_cul(Point a,Point b,Point p){\\n p-=a;\\n b-=a;\\n b/=abs(b);\\n p/=b;\\n return p.real()+A*p.imag();\\n}\\n\\ndouble L_cul(Point a,Point b,Point p){\\n p-=b;\\n a-=b;\\n a/=abs(a);\\n p/=a;\\n return p.real()-A*p.imag();\\n}\\n\\n\\nint main(){\\n ll n;\\n cin>>n;\\n vector<Point> P(n); //反時計回りを仮定\\n for(auto &I:P){\\n double x,y;\\n cin>>x>>y;\\n I={x,y};\\n }\\n ll l=0,r=1;\\n while(R_cul(P[0],P[1],P[r])<=R_cul(P[0],P[1],P[(r+1)%n])){r=(r+1)%n;}\\n while(L_cul(P[0],P[1],P[l])<=L_cul(P[0],P[1],P[(l+n-1)%n])){l=(l+n-1)%n;}\\n double ans=R_cul(P[0],P[1],P[r])+L_cul(P[0],P[1],P[l])-abs(P[1]-P[0]);\\n for(ll i=1;i<n;i++){\\n while(R_cul(P[i],P[(i+1)%n],P[r])<=R_cul(P[i],P[(i+1)%n],P[(r+1)%n])){r=(r+1)%n;}\\n while(L_cul(P[i],P[(i+1)%n],P[l])<=L_cul(P[i],P[(i+1)%n],P[(l+1)%n])){l=(l+1)%n;}\\n ans=min(ans,R_cul(P[i],P[(i+1)%n],P[r])+L_cul(P[i],P[(i+1)%n],P[l])-abs(P[i]-P[(i+1)%n]));\\n }\\n cout<<fixed<<setprecision(12)<<ans<<endl;\\n \\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3056_3406359\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<chrono>\\n#include<unordered_map>\\n#include<fstream>\\n#include<list>\\n#include<functional>\\n#include<bitset>\\n#include<complex>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef pair<int,int> pi;\\ntypedef pair<double,double> pd;\\ntypedef pair<double,ll> pdl;\\n#define F first\\n#define S second\\nconst ll E=1e18+7;\\nconst ll MOD=1000000007;\\n\\n\\n\\ntypedef complex<double> Point;\\n\\nconst double A=(double)1/sqrt(3);\\n\\ndouble R_cul(Point a,Point b,Point p){\\n p-=a;\\n b-=a;\\n b/=abs(b);\\n p/=b;\\n return p.real()+A*p.imag();\\n}\\n\\ndouble L_cul(Point a,Point b,Point p){\\n p-=b;\\n a-=b;\\n a/=abs(a);\\n p/=a;\\n return p.real()-A*p.imag();\\n}\\n\\n\\nint main(){\\n ll n;\\n cin>>n;\\n vector<Point> P(n); //反時計回りを仮定\\n for(auto &I:P){\\n double x,y;\\n cin>>x>>y;\\n I={x,y};\\n }\\n ll l=0,r=1;\\n while(R_cul(P[0],P[1],P[r])<=R_cul(P[0],P[1],P[(r+1)%n])){r=(r+1)%n;}\\n while(L_cul(P[0],P[1],P[l])<=L_cul(P[0],P[1],P[(l+n-1)%n])){l=(l+n-1)%n;}\\n double ans=R_cul(P[0],P[1],P[r])+L_cul(P[0],P[1],P[l])-abs(P[1]-P[0]);\\n for(ll i=1;i<n;i++){\\n while(R_cul(P[i],P[(i+1)%n],P[r])<=R_cul(P[i],P[(i+1)%n],P[(r+1)%n])){r=(r+1)%n;}\\n while(L_cul(P[i],P[(i+1)%n],P[l])<=L_cul(P[i],P[(i+1)%n],P[(l+1)%n])){l=(l+1)%n;}\\n ans=min(ans,R_cul(P[i],P[(i+1)%n],P[r])+L_cul(P[i],P[(i+1)%n],P[l])-abs(P[i]-P[(i+1)%n]));\\n }\\n cout<<fixed<<setprecision(12)<<ans<<endl;\\n \\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1896,"cells":{"group_id":{"kind":"string","value":"aoj_3055_cpp"},"problem_description":{"kind":"string","value":"Problem E: こたつがめを燃やさないで\nProblem\nこたつがめは甲羅がこたつの亀です。\nこたつがめはぽきた(起床する事)途端、格子状の区画に区切られているステージに閉じ込められました。このステージには、ただ一つの出口があります。\n 区画は道、塀または爆弾のいずれかであり、こたつがめは上下左右に移動することで、道または爆弾の区画に侵入することができます。\n 斜めには移動できません。また、塀の区画は通ることができません。ステージの外にも道の区画が無限に広がっていますが亀の天敵であるワニがいる為、通る事はできません。\nこたつがめはさっさと帰宅してねね(睡眠する事)を行いたいので、このステージの出口に向かおうと思いました。\nこたつの赤外線を自在に操る事ができるこたつがめは、自身の周囲8区画を同時に道に変える能力を持っています。\n しかし、その8区画と自身がいるいずれかの区画が爆弾の区画の場合、誘爆してこたつがめは炎上し、ねねどころか有名SNS「カメったー」すら出来なくなってしまうので能力を発動する事ができません。\n例を図示します。イラストが配置されていない区画とこたつがめがいる区画は道の区画です。\n こたつがめの周囲8区画とはオレンジ色の区画を指します。左の図ではこたつがめの周囲8区画、および自身がいる区画に爆弾の区画は含まれていない為、能力を発動できます。\n しかし、右の図では周囲8区画、および自身がいる区画のいずれかに爆弾の区画が含まれている為、能力を発動する事ができません。\n移動するコストは1区画の移動ごとに$A$、能力を発動するコストは1回あたり$B$です。道に変えた塀あたりのコストではない事に注意してください。開始地点とステージの出口は道です。\n 開始地点からステージの出口に着くまでの移動するコストと能力を発動するコストの合計の最小値を出力してください。ただし、ステージの出口に到達できない場合は代わりに\"INF\"と出力してください。\nInput\n入力は以下の形式で与えられる。\n$H$ $W$ $A$ $B$\n$c_{1,1} \\cdots c_{1,W}$\n$\\vdots$\n$c_{H,1} \\cdots c_{H,W}$\n入力は$H+1$行からなる。\n$1$行目には上下の長さを表す整数$H$、左右の長さを表す整数$W$、移動するコストを表す整数$A$、能力を発動するコストを表す整数$B$がそれぞれ空白区切りで与えられる。\n$2$行目からの$H$行には、こたつがめが閉じ込められたステージの各区画における状態$c_{i,j}$が与えられる。\n$c_{i,j}$はそれぞれ's','g','.','#','*'のいずれかからなり、区画$(i,j)$が下記のような状態であることを表す。\n's' : その区画が開始地点であることを表す。\n'g' : その区画がステージの出口であることを表す。\n'.' : その区画が道であることを表す。\n'#' : その区画が塀であることを表す。\n'*' : その区画が爆弾であることを表す。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le H,W,A,B \\le 1000$\n$3 \\le H+W$\n$c_{i,j} \\in${'s','g','.','#','*'}\n's','g'はそれぞれ1回ずつ出現する\nOutput\n開始地点からステージの出口に着くまでの移動するコストと能力を発動するコストの合計の最小値を出力してください。ただし、ステージの出口に到達できない場合は代わりに\"INF\"と出力してください。\nSample input 1\n4 4 1 1\ng#..\n#...\n.*..\n...s\nSample output 1\n7\nSample input 2\n4 4 1 1\ng#..\n#*..\n....\n...s\nSample output 2\nINF\nSample input 3\n2 4 1 1\n###g\ns###\nSample output 3\n6\nSample input 4\n3 3 1 10\ng..\n##.\ns..\nSample output 4\n6\nSample input 5\n3 3 10 1\ng..\n##.\ns..\nSample output 5\n21"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3055_10892732","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nvoid solve(){\n ll H, W, A, B; cin >> H >> W >> A >> B;\n vec<string> S(H); rep(i, H) cin >> S[i];\n const vl dx = {1, 1, 0, -1, -1, -1, 0, 1}, dy = {0, 1, 1, 1, 0, -1, -1, -1};\n vv<bool> bomb(H, vec<bool>(W, 0));\n auto check = [&](ll h, ll w)->bool{\n return (0 <= w && w < W && 0 <= h && h < H);\n };\n pll s, g;\n rep(i, H){\n rep(k, W){\n if(S[i][k] == 's') s = {i, k};\n if(S[i][k] == 'g') g = {i, k};\n if(S[i][k] == '*'){\n bomb[i][k] = 1;\n rep(t, 8){\n ll h = i + dx[t], w = k + dy[t];\n if(check(h, w)) bomb[h][w] = 1;\n }\n }\n }\n }\n auto idx = [&](pll p)->ll{\n return p.first * W + p.second;\n };\n vv<ll> dis(H, vl(W, 4e18));\n vv<bool> vis(H, vec<bool>(W, 0));\n dis[s.first][s.second] = 0;\n minpq<pll> pQ;\n pQ.push({0ll, idx(s)});\n while(pQ.size()){\n pll p = pQ.top(); pQ.pop();\n ll h = p.second / W, w = p.second % W, d = p.first;\n if(vis[h][w]) continue;\n vis[h][w] = 1;\n rep(t, 4){\n ll hh = h + dx[t*2], ww = w + dy[t*2];\n if(check(hh, ww)){\n if(S[hh][ww] == '#') continue;\n if(chmin(dis[hh][ww], d + A)){\n pQ.push({d+A, hh*W+ww});\n }\n }\n }\n if(!bomb[h][w]){\n rep(t, 8){\n ll hh = h + dx[t], ww = w + dy[t];\n if(check(hh,ww)){\n if(chmin(dis[hh][ww], d + B + A * (1 + t % 2))){\n pQ.push({d + B + A * (1 + t % 2), hh * W + ww});\n }\n }\n }\n }\n }\n if(!vis[g.first][g.second]){\n cout << \"INF\" << endl;\n return;\n }\n cout << dis[g.first][g.second] << endl;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":1,"time_ms":100,"memory_kb":12648,"score_of_the_acc":-0.0982,"final_rank":5},{"submission_id":"aoj_3055_10892691","code_snippet":"#line 2 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\nusing namespace std;\n\n#include<bits/stdc++.h>\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\"\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p){\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n int s = (int)v.size();\n for (int i = 0; i < s; i++) os << (i ? \" \" : \"\") << v[i];\n return os;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v){\n for (auto &x : v) is >> x;\n return is;\n}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\n} // namespace noya2\n#line 1 \"/Users/noya2/Desktop/Noya2_library/template/const.hpp\"\nnamespace noya2{\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n} // namespace noya2\n#line 2 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\n#line 6 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\nnamespace noya2{\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << std::min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(std::vector<T> &v){\n std::sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n#line 8 \"/Users/noya2/Desktop/Noya2_library/template/template.hpp\"\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#line 2 \"c.cpp\"\n\nstruct grid {\n int h, w;\n grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}\n int idx(int x, int y) const {\n return x * w + y;\n }\n std::pair<int,int> pos(int id) const {\n return {id / w, id % w};\n }\n bool operator()(int x, int y) const {\n return 0 <= x && x < h && 0 <= y && y < w;\n }\n bool operator()(int id) const {\n return operator()(id / w, id % w);\n }\n static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};\n auto adj4(int x, int y) const {\n return dxys | std::views::transform([x, y](std::pair<int,int> dxy){\n return std::pair<int,int>(dxy.first + x, dxy.second + y);\n }) | std::views::filter([this](std::pair<int,int> xy){\n return operator()(xy.first, xy.second);\n });\n }\n auto adj4(int id) const {\n return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){\n return idx(xy.first, xy.second);\n });\n }\n static constexpr std::array<std::pair<int,int>, 8> dxys8 = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}, {1,1},{1,-1},{-1,1},{-1,-1}};\n auto adj8(int x, int y) const {\n return dxys8 | std::views::transform([x, y](std::pair<int,int> dxy){\n return std::pair<int,int>(dxy.first + x, dxy.second + y);\n }) | std::views::filter([this](std::pair<int,int> xy){\n return operator()(xy.first, xy.second);\n });\n }\n};\n\nvoid solve(){\n int h, w; in(h,w);\n grid gr(h,w);\n int a, b; in(a,b);\n vector<string> g(h); in(g);\n auto find = [&](char c){\n rep(i,h) rep(j,w){\n if (g[i][j] == c){\n return pii(i,j);\n }\n }\n abort();\n };\n auto [sx, sy] = find('s');\n auto [gx, gy] = find('g');\n // out(sx,sy,gx,gy);\n priority_queue<pli,vector<pli>,greater<pli>> pque;\n vector<ll> dist(h*w,linf);\n dist[gr.idx(sx,sy)] = 0;\n pque.emplace(0,gr.idx(sx,sy));\n while (!pque.empty()){\n auto [d, xy] = pque.top(); pque.pop();\n if (dist[xy] < d) continue;\n auto [x, y] = gr.pos(xy);\n for (auto [nx, ny] : gr.adj4(x,y)){\n if (g[nx][ny] == '#') continue;\n int nxy = gr.idx(nx,ny);\n if (chmin(dist[nxy],d+a)){\n pque.emplace(dist[nxy],nxy);\n }\n }\n bool ok = true;\n for (auto [nx, ny] : gr.adj8(x,y)){\n if (g[nx][ny] == '*') ok = false;\n }\n if (ok && g[x][y] != '*'){\n for (auto [nx, ny] : gr.adj8(x,y)){\n int nxy = gr.idx(nx,ny);\n int cost = (abs(x-nx)+abs(y-ny))*a + b;\n // out(x,y,nx,ny,cost);\n if (chmin(dist[nxy],d+cost)){\n pque.emplace(dist[nxy],nxy);\n }\n }\n }\n }\n int gxy = gr.idx(gx,gy);\n if (dist[gxy] == linf){\n out(\"INF\");\n return ;\n }\n out(dist[gxy]);\n // out(dist);\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":70,"memory_kb":12332,"score_of_the_acc":-0.033,"final_rank":1},{"submission_id":"aoj_3055_10891077","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n int H, W, A, B;\n cin >> H >> W >> A >> B;\n vector<string> S(H);\n rep(i, 0, H) cin >> S[i];\n _pq<pair<int, pair<int, int>>> pq;\n vector seen(H, vector<int>(W, INF));\n rep(i, 0, H) rep(j, 0, W) if (S[i][j] == 's') pq.push({0, {i, j}}), seen[i][j] = 0;\n vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1, 0};\n vector<int> dy = {1, -1, 0, 0, 1, -1, 1, -1, 0};\n auto f = [&](int a, int b) -> bool {\n return 0 <= a && a < H && 0 <= b && b < W;\n };\n while (!pq.empty()){\n auto [c, pos] = pq.top();\n pq.pop();\n auto [x, y] = pos;\n if (seen[x][y] != c) continue;\n // cout << c << \" \" << x << \" \" << y << endl;\n rep(k, 0, 4){\n int a = dx[k] + x;\n int b = dy[k] + y;\n if (f(a, b) && S[a][b] != '#' && chmin(seen[a][b], c + A)){\n pq.push({seen[a][b], {a, b}});\n }\n }\n {\n bool ok = true;\n rep(k, 0, 9){\n int a = dx[k] + x;\n int b = dy[k] + y;\n if (f(a, b) && S[a][b] == '*') ok = false;\n }\n if (ok) rep(k, 0, 8){\n int a = dx[k] + x;\n int b = dy[k] + y;\n if (f(a, b)){\n int tmp = c + B + A * (abs(dx[k]) + abs(dy[k]));\n if (chmin(seen[a][b], tmp)){\n pq.push({seen[a][b], {a, b}});\n }\n }\n }\n }\n }\n rep(i, 0, H) rep(j, 0, W) if (S[i][j] == 'g'){\n if (seen[i][j] == INF) cout << \"INF\\n\";\n else cout << seen[i][j] << \"\\n\";\n }\n}","accuracy":1,"time_ms":100,"memory_kb":8080,"score_of_the_acc":-0.0783,"final_rank":3},{"submission_id":"aoj_3055_7008309","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, int>;\n\nint main(){\n int h, w, a, b; cin >> h >> w >> a >> b;\n vector<string> s(h);\n for(auto &it: s) cin >> it;\n\n vector<vector<ll>> mem(h, vector<ll>(w, 1LL << 60));\n priority_queue<P, vector<P>, greater<P>> Q;\n auto enc = [&w](int i, int j){\n return i*w+j;\n };\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(s[i][j] == 's'){\n mem[i][j] = 0;\n Q.emplace(0, enc(i, j));\n }\n }\n }\n const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}, dy = {1, 0, -1, 0, -1, 1, -1, 1};\n auto isin = [&h, &w](int i, int j){\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n while(!Q.empty()){\n auto c = Q.top(); Q.pop();\n int ci = c.second/w, cj = c.second%w;\n for(int k = 0; k < 4; k++){\n int ni = ci+dx[k], nj = cj+dy[k];\n if(!isin(ni, nj) || s[ni][nj] == '#') continue;\n if(mem[ni][nj] > mem[ci][cj]+a){\n mem[ni][nj] = mem[ci][cj]+a;\n Q.emplace(mem[ni][nj], enc(ni, nj));\n }\n }\n bool isbeam = true;\n if(s[ci][cj] == '*') isbeam = false;\n for(int k = 0; k < 8; k++){\n int ni = ci+dx[k], nj = cj+dy[k];\n if(isin(ni, nj) && s[ni][nj] == '*') isbeam = false;\n }\n if(!isbeam) continue;\n for(int kk = 0; kk < 2; kk++){\n for(int k = 0; k < 4; k++){\n int ni = ci+dx[k+kk*4], nj = cj+dy[k+kk*4];\n if(!isin(ni, nj)) continue;\n if(mem[ni][nj] > mem[ci][cj]+a*(kk+1)+b){\n mem[ni][nj] = mem[ci][cj]+a*(kk+1)+b;\n Q.emplace(mem[ni][nj], enc(ni, nj));\n }\n }\n }\n }\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(s[i][j] == 'g'){\n if(mem[i][j] == 1LL << 60) cout << \"INF\" << endl;\n else cout << mem[i][j] << endl;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":12700,"score_of_the_acc":-0.141,"final_rank":9},{"submission_id":"aoj_3055_4963130","code_snippet":"#include <cstdio>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <complex>\n\nusing namespace std;\n\nint H,W,A,B;\n\nchar maze[1003][1003];\nbool visited[1003][1003];\n\nstruct S{\n int d;\n complex<int> p;\n};\n\nint operator > (const S& a,const S& b){\n return a.d>b.d;\n}\n\nint main(){\n\n scanf(\"%d%d%d%d\",&H,&W,&A,&B);\n\n for(int i=1;i<=H;i++) scanf(\"%s\",maze[i]+1);\n complex<int> s,g;\n for(int i=1;i<=H;i++)\n for(int j=1;j<=W;j++)\n if (maze[i][j]=='s') s={i,j},maze[i][j]='.';\n else if (maze[i][j]=='g') g={i,j},maze[i][j]='.';\n\n complex<int> d[]={{0,-1},{0,1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};\n priority_queue<S,vector<S>,greater<S>> q;\n\n q.push(S{0,s});\n\n while(!q.empty()){\n auto cur=q.top();\n auto p=cur.p;\n\n if (p==g) break;\n q.pop();\n\n auto &vis=visited[p.real()][p.imag()];\n if (vis) continue;\n vis=true;\n\n bool bomb=false;\n for(int i=-1;i<=1;i++) \n for(int j=-1;j<=1;j++){\n complex<int> diff{i,j};\n auto c=p+diff;\n if (maze[c.real()][c.imag()]=='*') bomb=true;\n }\n\n for(int i=0;i<4;i++) {\n auto diff=d[i];\n auto c=p+diff;\n auto m=maze[c.real()][c.imag()];\n auto dist=abs(diff.real())+abs(diff.imag());\n if (m=='.'||m=='*') {\n q.push(S{cur.d+A,c});\n }\n }\n\n for(int i=0;i<8&&!bomb;i++) {\n auto diff=d[i];\n auto c=p+diff;\n auto m=maze[c.real()][c.imag()];\n auto dist=abs(diff.real())+abs(diff.imag());\n \n if (m)\n q.push(S{cur.d+A*dist+B,c});\n \n }\n\n }\n\n if (q.empty()) puts(\"INF\");\n else printf(\"%d\\n\",q.top().d);\n\n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":4756,"score_of_the_acc":-0.8936,"final_rank":16},{"submission_id":"aoj_3055_4942862","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-7, PI = acos(-1);\n//ここから編集\n\nint dxy[5] = {-1,0,1,0,-1};\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n ll h, w, a, b; cin >> h >> w >> a >> b;\n vector<string> f;\n\n int sy,sx,gy,gx;\n REP(i,h){\n string s; cin >> s;\n f.push_back(s);\n REP(j,w){\n if(s[j] == 's'){\n sy = i;\n sx = j;\n }else if(s[j] == 'g'){\n gy = i;\n gx = j;\n }\n }\n }\n\n vector<vector<ll>> dist(h, vector<ll>(w, INT_MAX));\n\n dist[sy][sx] = 0;\n priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;\n pq.push(make_pair(0, sy*w+sx));\n\n while(pq.size()){\n auto p = pq.top();\n pq.pop();\n\n int y = p.second/w, x = p.second%w;\n if(dist[y][x] < p.first) continue;\n\n for(int i=0; i<4; i++){\n int ny = y + dxy[i], nx = x + dxy[i+1];\n if(ny >= 0 && ny < h && nx >= 0 && nx < w && f[ny][nx] != '#'){\n if(dist[ny][nx] > dist[y][x] + a){\n dist[ny][nx] = dist[y][x] + a;\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\n }\n }\n }\n\n bool check = true;\n for(int i=-1; i<=1; i++){\n for(int j=-1; j<=1; j++){\n int ny = y+i, nx = x+j;\n if(ny >= 0 && ny < h && nx >= 0 && nx < w){\n if(f[ny][nx] == '*') check = false;\n }\n }\n }\n if(check){\n for(int i=-1; i<=1; i++){\n for(int j=-1; j<=1; j++){\n int ny = y+i, nx = x+j;\n if(ny >= 0 && ny < h && nx >= 0 && nx < w){\n if(abs(i) == 1 && abs(j) == 1){\n if(dist[ny][nx] > dist[y][x] + b + 2*a){\n dist[ny][nx] = dist[y][x] + b + 2*a;\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\n }\n }else{\n if(dist[ny][nx] > dist[y][x] + b + a){\n dist[ny][nx] = dist[y][x] + b + a;\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\n }\n }\n }\n }\n }\n }\n }\n\n if(dist[gy][gx] == INT_MAX) cout << \"INF\" << endl;\n else cout << dist[gy][gx] << endl;\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":11968,"score_of_the_acc":-0.1165,"final_rank":7},{"submission_id":"aoj_3055_4239827","code_snippet":"#include<iostream>\n#include<string>\n#include<iomanip>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n#include<queue>\n\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(int i = 0; i < (n); i++)\n#define INF ((long long)1e18)\n#define MOD ((int)1e9+7)\n#define endl \"\\n\"\n\n#define yn(f) ((f)?\"Yes\":\"No\")\n#define YN(f) ((f)?\"YES\":\"NO\")\n\n#define MAX 1100\n\nint cost[MAX][MAX];\nstring mp[MAX];\nint sy, sx, gy, gx;\nint H, W, A, B;\nint dxy[4] = {1,-1,0,0};\n\nstring solve(){\n\tpriority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>, greater<pair<int,pair<int,int>>>> Q;\n\t\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int j = 0; j < W; j++){\n\t\t\tcost[i][j] = INF;\n\t\t}\n\t}\n\t\n\tQ.push(make_pair(0,make_pair(sy,sx)));\n\t\n\tcost[sy][sx] = 0;\n\t\n\twhile(!Q.empty()){\n\t\tpair<int,pair<int,int>> P = Q.top(); Q.pop();\n\t\tint y = P.second.first, x = P.second.second, tcost = P.first;\n\t\tbool b = false, w = false;\n\t\t\n\t\t// cout<<y<<\" \"<<x<<endl;\n\t\t// cout<<\" cost \"<<tcost<<\" \"<<mp[y][x]<<endl;\n\t\tif(tcost < cost[y][x]) continue;\n\t\tif(y == gy && x == gx) return to_string(tcost);\n\t\t\n\t\tfor(int i = -1; i <= 1; i++){\n\t\t\tfor(int j = -1; j <= 1; j++){\n\t\t\t\tif(y+i < 0 || y+i >= H || x+j < 0 || x+j >= W) continue;\n\t\t\t\t// cout<<y+i<<\" TTT \"<<x+j<<endl;\n\t\t\t\tif(mp[y+i][x+j] == '*') b = true;\n\t\t\t}\n\t\t}\n\t\t// cout<<\"GGGGG \"<<endl;\n\t\tfor(int i = 0; i < 4; i++){\n\t\t\tint ny = y + dxy[i], nx = x + dxy[3-i];\n\t\t\t// cout<<\" ny nx \"<<ny<<\" \"<<nx<<endl;\n\t\t\tif(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\n\t\t\t\n\t\t\t// if(mp[ny][nx] == '#' || mp[ny][nx] == '*') continue;\n\t\t\tif(mp[ny][nx] == '#') continue;\n\t\t\t\n\t\t\t// cout<<cost[ny][nx]<<\" cost\"<<cost[y][x] + A<<endl;\n\t\t\tif(cost[ny][nx] <= cost[y][x] + A) continue;\n\t\t\t\n\t\t\tQ.push(make_pair(cost[y][x] + A,make_pair(ny,nx)));\n\t\t\t\n\t\t\tcost[ny][nx] = cost[y][x] + A;\n\t\t}\n\t\t\n\t\tif(b == true) continue;\n\t\t// cout<<\"FFFFF\"<<endl;\n\t\tfor(int i = -1; i <= 1; i++){\n\t\t\tfor(int j = -1; j <= 1; j++){\n\t\t\t\tif(i == j && i == 0) continue;\n\t\t\t\tint ny = y + i, nx = x + j, co = A+B;\n\t\t\t\n\t\t\t\tif(i&&j) co += A;\n\t\t\t\t\n\t\t\t\tif(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\n\t\t\t\n\t\t\t\tif(cost[ny][nx] <= cost[y][x] + co) continue;\n\t\t\t\n\t\t\t\tQ.push(make_pair(cost[y][x] + co,make_pair(ny,nx)));\n\t\t\t\n\t\t\t\tcost[ny][nx] = cost[y][x] + co;\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\treturn \"INF\";\n}\n\nsigned main(){\n\t// cin.tie(0);\n\t// ios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\t\n\t\n\tcin>>H>>W>>A>>B;\n\t\n\tfor(int i = 0; i < H; i++){\n\t\tcin>>mp[i];\n\t\tfor(int j = 0; j < W; j++){\n\t\t\tif(mp[i][j] == 's'){\n\t\t\t\tsy = i, sx = j;\n\t\t\t}\n\t\t\tif(mp[i][j] == 'g'){\n\t\t\t\tgy = i, gx = j;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<solve()<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":140,"memory_kb":12728,"score_of_the_acc":-0.1837,"final_rank":14},{"submission_id":"aoj_3055_3894963","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3055.cc: Don't Burn Kotatsu Turtle\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_H = 1000;\nconst int MAX_W = 1000;\nconst int INF = (int)((1LL << 31) - 1);\n\nconst int dxs[] = { 1, 1, 0, -1, -1, -1, 0, 1 };\nconst int dys[] = { 0, -1, -1, -1, 0, 1, 1, 1 };\n\n/* typedef */\n\nstruct Stat {\n int d, x, y;\n Stat() {}\n Stat(int _d, int _x, int _y): d(_d), x(_x), y(_y) {}\n bool operator<(const Stat &s) const { return d > s.d; }\n void print() { printf(\"Stat(%d,%d,%d)\\n\", d, x, y); }\n};\n\n/* global variables */\n\nchar flds[MAX_H][MAX_W + 4];\nint ds[MAX_H][MAX_W], dis[8];\n\n/* subroutines */\n\ninline bool inside(int x, int y, int w, int h) {\n return (x >= 0 && x < w && y >= 0 && y < h);\n}\n\n/* main */\n\nint main() {\n int h, w, a, b;\n scanf(\"%d%d%d%d\", &h, &w, &a, &b);\n\n int sx, sy, gx, gy;\n for (int y = 0; y < h; y++) {\n scanf(\"%s\", flds[y]);\n for (int x = 0; x < w; x++)\n switch (flds[y][x]) {\n case 's': flds[y][x] = '.', sx = x, sy = y; break;\n case 'g': flds[y][x] = '.', gx = x, gy = y; break;\n }\n fill(ds[y], ds[y] + w, INF);\n }\n\n ds[sy][sx] = 0;\n priority_queue<Stat> q;\n q.push(Stat(0, sx, sy));\n\n while (! q.empty()) {\n Stat u = q.top(); q.pop();\n //u.print();\n if (u.d != ds[u.y][u.x]) continue;\n if (u.x == gx && u.y == gy) break;\n\n int vd = u.d + a, din = 0;\n bool bmb = (flds[u.y][u.x] == '*');\n for (int di = 0; di < 8; di++) {\n int vx = u.x + dxs[di], vy = u.y + dys[di];\n if (inside(vx, vy, w, h)) {\n\tchar &vf = flds[vy][vx];\n\t// normal move\n\tif (! (di & 1) && vf != '#' && ds[vy][vx] > vd) {\n\t ds[vy][vx] = vd;\n\t q.push(Stat(vd, vx, vy));\n\t}\n\n\t// bomb\n\tif (vf == '*') bmb = true;\n\telse if (vf == '#')\n\t dis[din++] = di;\n }\n }\n //printf(\" bmb=%d\\n\", bmb);\n\n if (! bmb)\n for (int i = 0; i < din; i++) {\n\tint di = dis[i];\n\tint vx = u.x + dxs[di], vy = u.y + dys[di];\n\tint vd = u.d + ((di & 1) + 1) * a + b;\n\n\tif (ds[vy][vx] > vd) {\n\t ds[vy][vx] = vd;\n\t q.push(Stat(vd, vx, vy));\n\t}\n }\n }\n\n if (ds[gy][gx] >= INF) puts(\"INF\");\n else printf(\"%d\\n\", ds[gy][gx]);\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":8140,"score_of_the_acc":-0.036,"final_rank":2},{"submission_id":"aoj_3055_3659291","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nconst int MAX = 1010;\nint dp[MAX][MAX];\nint bm[MAX][MAX];\n\nsigned main(){\n int h,w,p,q;\n cin>>h>>w>>p>>q;\n vector<string> st(h);\n for(int i=0;i<h;i++) cin>>st[i];\n\n memset(bm,0,sizeof(dp));\n\n auto in=[&](int y,int x){return 0<=y&&y<h&&0<=x&&x<w;};\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(st[i][j]!='*') continue;\n for(int a=-1;a<=1;a++)\n for(int b=-1;b<=1;b++)\n if(in(i+a,j+b)) bm[i+a][j+b]=1;\n }\n }\n \n memset(dp,-1,sizeof(dp));\n struct T{\n int y,x,d;\n T(){}\n T(int y,int x,int d):y(y),x(x),d(d){}\n bool operator<(const T &a)const{return d>a.d;};\n };\n\n priority_queue<T> pq;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n if(st[i][j]=='s') pq.emplace(i,j,dp[i][j]=0);\n\n int dy[]={1,-1,0,0};\n int dx[]={0,0,1,-1};\n auto cmp=[&](int a,int b){return a<0||b<a;};\n while(!pq.empty()){\n T s=pq.top();pq.pop();\n int y=s.y,x=s.x,d=s.d;\n //cout<<y<<\" \"<<x<<\":\"<<d<<endl;\n if(dp[y][x]<d) continue;\n if(st[y][x]=='g'){\n cout<<d<<endl;\n return 0;\n }\n \n auto check=\n [&](int ny,int nx,int nd)->void{\n if(!in(ny,nx)||!cmp(dp[ny][nx],nd)) return;\n dp[ny][nx]=nd;\n pq.emplace(ny,nx,dp[ny][nx]);\n };\n \n for(int k=0;k<4;k++){\n int ny=y+dy[k],nx=x+dx[k];\n if(in(ny,nx)&&st[ny][nx]!='#') check(ny,nx,d+p);\n }\n \n if(bm[y][x]) continue;\n \n for(int a=-1;a<=1;a++)\n for(int b=-1;b<=1;b++)\n check(y+a,x+b,d+(abs(a)+abs(b))*p+q);\n }\n cout<<\"INF\"<<endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":12088,"score_of_the_acc":-0.0958,"final_rank":4},{"submission_id":"aoj_3055_3646033","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 1005\n\nstruct Edge{\n\n\tEdge(int arg_to_row,int arg_to_col, ll arg_cost){\n\t\tto_row = arg_to_row;\n\t\tto_col = arg_to_col;\n\t\tcost = arg_cost;\n\t}\n\n\tint to_row,to_col;\n\tint cost;\n};\n\nstruct Info{\n\tInfo(int arg_row,int arg_col, ll arg_sum_cost){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_cost = arg_sum_cost;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\t\treturn sum_cost > arg.sum_cost; //総コストの昇順(PQ)\n\t}\n\n\tint row,col;\n\tll sum_cost;\n};\n\nint H,W;\nint start_row,start_col,goal_row,goal_col;\nint diff_row[9] = {-1,-1,-1,0,0,0,1,1,1},diff_col[9] = {-1,0,1,-1,0,1,-1,0,1};\nint A,B;\nchar table[NUM][NUM];\nvector<Edge> G[NUM][NUM];\nint min_dist[NUM][NUM];\n\n\nbool rangeCheck(int row,int col){\n\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\n\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\nint main(){\n\n\tscanf(\"%d %d %d %d\",&H,&W,&A,&B);\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(table[row][col] == 's'){\n\n\t\t\t\tstart_row = row;\n\t\t\t\tstart_col = col;\n\t\t\t\ttable[row][col] = '.';\n\n\t\t\t}else if(table[row][col] == 'g'){\n\n\t\t\t\tgoal_row = row;\n\t\t\t\tgoal_col = col;\n\t\t\t\ttable[row][col] = '.';\n\t\t\t}\n\t\t}\n\t}\n\n\t//各セルから、他のセルへエッジを張る\n\tbool is_bomb;\n\tint adj_row,adj_col;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tis_bomb = false;\n\n\t\t\t//隣接9区間に爆弾があるか調べる\n\t\t\tfor(int i = 0; i < 9; i++){\n\t\t\t\tadj_row = row+diff_row[i];\n\t\t\t\tadj_col = col+diff_col[i];\n\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tif(table[adj_row][adj_col] == '*'){\n\t\t\t\t\tis_bomb = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < 9; i++){\n\n\t\t\t\tadj_row = row+diff_row[i];\n\t\t\t\tadj_col = col+diff_col[i];\n\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tswitch(table[adj_row][adj_col]){\n\t\t\t\tcase '.':\n\n\t\t\t\t\tif((abs(row-adj_row)+abs(col-adj_col) == 1)){ //隣\n\n\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,A));\n\n\t\t\t\t\t}else{ //壁があって行けない場合あり\n\n\t\t\t\t\t\tif(table[row][adj_col] != '#' || table[adj_row][col] != '#'){\n\t\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,2*A));\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(!is_bomb){\n\t\t\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,2*A+B));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\tcase '*':\n\t\t\t\t\tif((abs(row-adj_row)+abs(col-adj_col) == 1)){ //隣\n\n\t\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,A));\n\n\t\t\t\t\t\t}else{ //壁があって行けない場合あり\n\n\t\t\t\t\t\t\tif(table[row][adj_col] != '#' || table[adj_row][col] != '#'){\n\t\t\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,2*A));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase '#':\n\t\t\t\t\tif(!is_bomb){\n\t\t\t\t\t\tG[row][col].push_back(Edge(adj_row,adj_col,A*(abs(row-adj_row)+abs(col-adj_col))+B));\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tmin_dist[row][col] = HUGE_NUM;\n\t\t}\n\t}\n\n\tpriority_queue<Info> Q;\n\tmin_dist[start_row][start_col] = 0;\n\n\tQ.push(Info(start_row,start_col,0));\n\n\tint next_row,next_col,next_cost;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().row == goal_row && Q.top().col == goal_col){\n\n\t\t\tprintf(\"%d\\n\",Q.top().sum_cost);\n\t\t\treturn 0;\n\n\t\t}else if(Q.top().sum_cost > min_dist[Q.top().row][Q.top().col]){\n\n\t\t\tQ.pop();\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().row][Q.top().col].size(); i++){\n\n\t\t\t\tnext_row = G[Q.top().row][Q.top().col][i].to_row;\n\t\t\t\tnext_col = G[Q.top().row][Q.top().col][i].to_col;\n\t\t\t\tnext_cost = Q.top().sum_cost+G[Q.top().row][Q.top().col][i].cost;\n\n\t\t\t\tif(min_dist[next_row][next_col] > next_cost){\n\t\t\t\t\tmin_dist[next_row][next_col] = next_cost;\n\t\t\t\t\tQ.push(Info(next_row,next_col,next_cost));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tprintf(\"INF\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":470,"memory_kb":234288,"score_of_the_acc":-1.8511,"final_rank":20},{"submission_id":"aoj_3055_3481587","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\ntypedef pair<int,P>P2;\n\npriority_queue<P2,vector<P2>,greater<P2> >q;\nint dx[]={0,1,1,1,0,-1,-1,-1};\nint dy[]={-1,-1,0,1,1,1,0,-1};\nint dc[]={1,2,1,2,1,2,1,2};\nint off[]={1,-1};\nint h,w,A,B,dp[1005][1005];\nint sx,sy,gx,gy;\nchar s[1005][1005];\n\nsigned main(){\n\tr(i,1005)r(j,1005) dp[i][j] = 2000000000;\n\n\tcin>>h>>w>>A>>B;\n\tr(i,8) dc[i] = ( i%2? A*2:A );\n\tr(i,h) scanf(\"%s\",s[i]);\n\n\tr(i,h)r(j,w){\n\t\tif( s[i][j] == 's' ) sx=j , sy=i;\n\t\tif( s[i][j] == 'g' ) gx=j , gy=i;\n\t}\n\n\tq.push(P2(0,P(sx,sy)));\n\tdp[sy][sx] = 0;\n\n\twhile(!q.empty()){\n\t\tP2 p=q.top();q.pop();\n\t\tint x = p.second.first , y = p.second.second;\n\t\tint cost = p.first , f2 = (s[y][x]=='*');\n\t\tif( dp[y][x] < cost )continue;\n\t\tr(i,8){\n\t\t\tint nx = x+dx[i] , ny = y+dy[i];\n\t\t\tint ncos = cost+dc[i] , flag = 0;\n\n\t\t\tif( ny<0 || nx<0 || ny>=h || nx>=w )continue;\n\t\t\tif( s[ny][nx] == '*' )f2++;\n\n\t\t\tif(i%2)r(j,2){\n\t\t\t\tint T = (i+off[j]+8)%8;\n\t\t\t\tint tx = x+dx[T] , ty = y+dy[T];\n\t\t\t\tif( tx<0 || ty<0 || tx>=w || ty>=h || s[ty][tx]=='#' ) flag++;\n\t\t\t}\n\n\t\t\tif( flag == 2 )continue;\n\t\t\tif( dp[ny][nx] <= ncos )continue;\n\t\t\tif( s[ny][nx] == '#' )continue;\n\n\t\t\tdp[ny][nx] = ncos;\n\t\t\tq.push(P2(ncos,P(nx,ny)));\n\t\t}\n\t\tif( f2 )continue;\n\t\tr(i,8){\n\t\t\tint nx = x+dx[i] , ny = y+dy[i];\n\t\t\tint ncos = cost+dc[i]+B;\n\n\t\t\tif( ny<0 || nx<0 || ny>=h || nx>=w )continue;\n\t\t\tif( dp[ny][nx] <= ncos )continue;\n\t\t\t\n\t\t\tdp[ny][nx] = ncos;\n\t\t\tq.push(P2(ncos,P(nx,ny)));\n\t\t}\n\t}\n\tif( dp[gy][gx] == 2000000000 )cout<<\"INF\"<<endl;\n\telse cout<<dp[gy][gx]<<endl;\n}","accuracy":1,"time_ms":120,"memory_kb":12100,"score_of_the_acc":-0.1384,"final_rank":8},{"submission_id":"aoj_3055_3425190","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef long double ld;\nconst int INF=1e9,MOD=1e9+7;\nconst ll LINF=1e18;\nusing namespace std;\n#define int long long\n//template\nint d[1002][1002];\n//main\nsigned main(){\n int H,W,A,B;cin>>H>>W>>A>>B;\n std::vector<string> s(H);\n for(int i=0;i<H;i++)cin>>s[i];\n int sx,sy,gx,gy;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(s[i][j]=='s'){sx=j;sy=i;}\n if(s[i][j]=='g'){gx=j;gy=i;}\n }\n }\n typedef pair<int,int> P;\n for(int i=0;i<1002;i++)for(int j=0;j<1002;j++)d[i][j]=LINF;\n queue<P> que;\n int x[8]={1,-1,0,0,1,1,-1,-1};\n int y[8]={0,0,1,-1,1,-1,1,-1};\n que.push(P(sy,sx));\n d[sy][sx]=0;\n while(que.size()){\n P p=que.front();que.pop();\n int pf=p.first,ps=p.second;\n bool bom=false;\n for(int i=max(0LL,pf-1);i<=min(H-1,pf+1);i++){\n for(int j=max(0LL,ps-1);j<=min(W-1,ps+1);j++){\n if(s[i][j]=='*')bom=true;\n }\n }\n //x[i]とy[i]逆に使った気がするけど問題はないので無視\n if(bom){\n for(int i=0;i<4;i++){\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\n if(s[pf+x[i]][ps+y[i]]!='#'&&d[pf+x[i]][ps+y[i]]>d[pf][ps]+A){\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A;\n que.push(P(pf+x[i],ps+y[i]));\n }\n }\n }\n else{\n for(int i=0;i<4;i++){\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\n if(s[pf+x[i]][ps+y[i]]!='#'&&d[pf+x[i]][ps+y[i]]>d[pf][ps]+A){\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A;\n que.push(P(pf+x[i],ps+y[i]));\n }\n }\n for(int i=0;i<4;i++){\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\n if(d[pf+x[i]][ps+y[i]]>d[pf][ps]+A+B){\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A+B;\n que.push(P(pf+x[i],ps+y[i]));\n }\n }\n for(int i=4;i<8;i++){\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\n if(d[pf+x[i]][ps+y[i]]>d[pf][ps]+A+A+B){\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A+A+B;\n que.push(P(pf+x[i],ps+y[i]));\n }\n }\n }\n }\n if(d[gy][gx]>100000000000000000)cout<<\"INF\"<<endl;\n else cout<<d[gy][gx]<<endl;\n}","accuracy":1,"time_ms":140,"memory_kb":11996,"score_of_the_acc":-0.1805,"final_rank":12},{"submission_id":"aoj_3055_3425186","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n#define chmin(a, b) ((a)=min((a), (b)))\n#define chmax(a, b) ((a)=max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD=1e9+7;\nconst ll INF=1e18;\nconst double pi=acos(-1);\nconst double eps=1e-10;\n\nint dx[]={1, 1, 0, -1, -1, -1, 0, 1};\nint dy[]={0, -1, -1, -1, 0, 1, 1, 1};\n\nconst int MAX_N=1002000;\n\nvector<vector<P>> g(MAX_N);\nvector<ll> dist(MAX_N, INF);\nvoid dijkstra(int s){\n priority_queue<P, vector<P>, greater<P>> que;\n dist[s]=0;\n que.push(P(0, s));\n\n while(!que.empty()){\n P p=que.top(); que.pop();\n ll pcost=p.first, pv=p.second;\n if(dist[pv] < pcost) continue;\n\n for(int i=0; i<g[pv].size(); i++){\n P p2=g[pv][i];\n ll nv=p2.first, ncost=p2.second;\n if(dist[nv] > dist[pv] + ncost){\n dist[nv] = dist[pv] + ncost;\n que.push(P(dist[nv], nv));\n }\n }\n }\n}\n\nint main(){\n int h, w, a, b; cin>>h>>w>>a>>b;\n vector<string> c(h);\n for(int i=0; i<h; i++) cin>>c[i];\n\n int sy, sx, gy, gx;\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n if(c[i][j]=='s'){\n sy=i, sx=j;\n c[i][j]='.';\n }\n if(c[i][j]=='g'){\n gy=i, gx=j;\n c[i][j]='.';\n }\n }\n }\n\n for(int i=0; i<h; i++){\n for(int j=0; j<w; j++){\n int cur=1000*i+j;\n\n bool isBomb=false;\n if(c[i][j]=='*') isBomb=true;\n for(int k=0; k<8; k++){\n int ny=i+dy[k], nx=j+dx[k];\n if(0<=ny && ny<h && 0<=nx && nx<w){\n if(c[ny][nx]=='*') isBomb=true;\n }\n }\n\n for(int k=0; k<8; k++){\n int ny=i+dy[k], nx=j+dx[k];\n int nxt=1000*ny+nx;\n \n if(0<=ny && ny<h && 0<=nx && nx<w){\n if(k%2==0){\n // 上下左右の移動\n if(c[ny][nx]=='#'){\n if(isBomb) continue;\n g[cur].push_back(P(nxt, a+b));\n }\n else{\n g[cur].push_back(P(nxt, a));\n }\n }\n else{\n // 斜め移動\n int pny=i+dy[k-1], pnx=j+dx[k-1];\n int nny=i+dy[(k+1)%8], nnx=j+dx[(k+1)%8];\n if(c[ny][nx]=='#' || c[pny][pnx]=='#' || c[nny][nnx]=='#'){\n if(isBomb) continue;\n g[cur].push_back(P(nxt, 2*a+b));\n }\n else{\n g[cur].push_back(P(nxt, 2*a));\n }\n }\n }\n }\n }\n }\n\n dijkstra(1000*sy+sx);\n \n if(dist[1000*gy+gx]==INF) cout << \"INF\" << endl;\n else cout << dist[gy*1000+gx] << endl; \n}","accuracy":1,"time_ms":410,"memory_kb":176016,"score_of_the_acc":-1.4695,"final_rank":19},{"submission_id":"aoj_3055_3420193","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\nusing namespace std;\nusing pint = pair<int,int>;\nconst int INF = 1<<29;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nbool chmin(int &a, int b) { if (a > b) {a = b; return true;} return false; }\n\nint H, W, A, B;\nvector<string> fi;\n\nint main() {\n cin >> H >> W >> A >> B;\n fi.resize(H);\n for (int i = 0; i < H; ++i) cin >> fi[i];\n int sx, sy, tx, ty;\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n if (fi[i][j] == 's') sx = i, sy = j;\n if (fi[i][j] == 'g') tx = i, ty = j;\n }\n \n priority_queue<pair<int,pint>, vector<pair<int,pint> >,\n greater<pair<int,pint> > > que;\n que.push({0, pint(sx, sy)});\n vector<vector<int> > dp(H, vector<int>(W, INF));\n dp[sx][sy] = 0;\n while (!que.empty()) {\n auto cur = que.top(); que.pop();\n int cur_dist = cur.first;\n int x = cur.second.first;\n int y = cur.second.second;\n if (cur_dist > dp[x][y]) continue;\n\n //cout << x << \", \" << y << \": \" << cur_dist << endl;\n\n // 通常の移動\n for (int dir = 0; dir < 4; ++dir) {\n int nx = x + dx[dir], ny = y + dy[dir];\n if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\n if (fi[nx][ny] == '#') continue;\n if (chmin(dp[nx][ny], dp[x][y] + A)) que.push({dp[nx][ny], pint(nx, ny)});\n }\n\n // 魔法\n bool can = true;\n for (int i = x-1; i <= x+1; ++i)\n for (int j = y-1; j <= y+1; ++j) {\n if (i < 0 || i >= H || j < 0 || j >= W) continue;\n if (fi[i][j] == '*') can = false;\n }\n if (can) {\n for (int i = x-1; i <= x+1; ++i)\n for (int j = y-1; j <= y+1; ++j) {\n if (i < 0 || i >= H || j < 0 || j >= W) continue;\n if (i == x && j == y) continue;\n if (fi[i][j] != '#') continue;\n if (chmin(dp[i][j], dp[x][y] + B + A * (abs(i-x) + abs(j-y))))\n que.push({dp[i][j], pint(i, j)});\n } \n }\n }\n if (dp[tx][ty] < INF) cout << dp[tx][ty] << endl;\n else cout << \"INF\" << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":7744,"score_of_the_acc":-0.1832,"final_rank":13},{"submission_id":"aoj_3055_3419049","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\n//#pragma GCC optimize (\"-O3\")\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\n\n\n\n\n\n\n\n\n\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\nint H, W, A, B;\nstring C[1010];\nint vis[1010][1010]; ll dis[1010][1010];\nmin_priority_queue<pair<ll, int>> que;\nenum { UP = 0, UP_RIGHT, RIGHT, DOWN_RIGHT, DOWN, DOWN_LEFT, LEFT, UP_LEFT };\nint dx[8] = { 0,1,1,1,0,-1,-1,-1 };\nint dy[8] = { -1,-1,0,1,1,1,0,-1 };\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n cin >> H >> W >> A >> B;\n rep(y, 0, H) cin >> C[y];\n\n rep(y, 0, H) rep(x, 0, W) dis[y][x] = infl;\n\n int sx, sy;\n rep(y, 0, H) rep(x, 0, W) if (C[y][x] == 's') {\n sx = x;\n sy = y;\n }\n\n dis[sy][sx] = 0;\n que.push({ 0, sy * 1010 + sx });\n\n while (!que.empty()) {\n auto q = que.top(); que.pop();\n\n ll c = q.first;\n int x = q.second % 1010;\n int y = q.second / 1010;\n\n if (C[y][x] == 'g') {\n cout << dis[y][x] << endl;\n return;\n }\n\n if (vis[y][x]) continue;\n vis[y][x] = 1;\n\n rep(i, 0, 8) if ((i & 1) == 0) {\n int xx = x + dx[i];\n int yy = y + dy[i];\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\n if (C[yy][xx] == '#') continue;\n if (chmin(dis[yy][xx], c + A)) que.push({ dis[yy][xx], yy * 1010 + xx });\n }\n\n int ok = 1;\n if (C[y][x] == '*') ok = 0;\n rep(i, 0, 8) {\n int xx = x + dx[i];\n int yy = y + dy[i];\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\n if (C[yy][xx] == '*') ok = 0;\n }\n\n if (ok) {\n rep(i, 0, 8) {\n int xx = x + dx[i];\n int yy = y + dy[i];\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\n int d = abs(x - xx) + abs(y - yy);\n if (chmin(dis[yy][xx], c + B + A * d)) que.push({ dis[yy][xx], yy * 1010 + xx });\n }\n }\n }\n\n cout << \"INF\" << endl;\n}","accuracy":1,"time_ms":120,"memory_kb":16028,"score_of_the_acc":-0.1555,"final_rank":11},{"submission_id":"aoj_3055_3418755","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)\n#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)\n#define ALL(obj) begin(obj), end(obj)\n#define RALL(obj) rbegin(obj), rend(obj)\n#define fi first\n#define se second\nusing ii = pair<int, int>;\ntemplate <class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate <class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }\n\n// debug\ntemplate <class T> ostream& operator<<(ostream &s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? \"\" : \" \"); return s; }\ntemplate <class T> ostream& operator<<(ostream &s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? \"\" : \"\\n\"); return s; }\ntemplate <class T, class S> ostream& operator<<(ostream &s, pair<T, S>& p) { s << \"{\" << p.first << \", \" << p.second << \"}\"; return s; }\ntemplate <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? \"\" : \"\\n\"); } return s; }\n#ifdef _MY_DEBUG\n #define dump(...) cerr << \"/* \" << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << endl, dump_func(__VA_ARGS__), cerr << \"*/\\n\\n\";\n#else\n #define dump(...)\n#endif\nvoid dump_func() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? \"\" : \", \"), dump_func(forward<Tail>(t)...); }\n\nstruct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;\nmt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\nconstexpr int MOD = 1000000007;\n// *************** TEMPLATE END *************** \n\nclass DirectedGraph {\n struct Edge { int to, cost; };\npublic:\n vector<vector<Edge>> G;\n int V;\n DirectedGraph(int V) : G(V), V(V) {}\n void add_edge(int u, int v, int cost) {\n G[u].push_back({v, cost});\n // G[v].push_back({u, cost});\n }\n vector<int> dijkstra(int s) {\n vector<int> d(V, 1e18); d[s] = 0;\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> que; // {dist, v}\n que.push({0, s});\n while (!que.empty()) {\n pair<int, int> p = que.top(); que.pop();\n int v = p.second;\n if (d[v] < p.first) continue; // 定数倍枝刈り\n for (Edge e: G[v]) {\n int tmp = d[v] + e.cost;\n if (d[e.to] <= tmp) continue;\n d[e.to] = tmp;\n que.push({tmp, e.to});\n }\n }\n return d;\n }\n};\n\nvector<ii> dirs = {\n {1, 0}, {0, 1}, {-1, 0}, {0, -1}, // 4方向\n {1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // 斜め\n {0, 0}, // 自身\n};\n\nsigned main() {\n int h, w, a, b; cin >> h >> w >> a >> b;\n vector<string> t(h); REP (i, h) cin >> t[i];\n ii s, g;\n REP (i, h) {\n REP (j, w) {\n if (t[i][j] == 's') s = {i, j};\n if (t[i][j] == 'g') g = {i, j};\n }\n }\n auto i2ii = [&](int i) { return ii({i / w, i % w}); };\n auto ii2i = [&](ii p) { return p.fi * w + p.se; };\n auto valid = [&](ii p) {\n return 0 <= p.fi && p.fi < h && 0 <= p.se && p.se < w;\n };\n auto around_bomb = [&](ii p) {\n for (ii dir: dirs) {\n ii to = {p.fi + dir.fi, p.se + dir.se};\n if (!valid(to)) continue;\n if (t[to.fi][to.se] == '*') return true;\n }\n return false;\n };\n\n DirectedGraph G(h * w);\n REP (i, h) {\n REP (j, w) {\n bool bomb = around_bomb({i, j});\n for (ii dir: dirs) {\n ii to = {i + dir.fi, j + dir.se};\n if (!valid(to)) continue;\n if (abs(dir.fi) + abs(dir.se) == 1) {\n int cost = a;\n if (t[to.fi][to.se] == '#') {\n if (bomb) continue;\n cost += b;\n }\n G.add_edge(ii2i({i, j}), ii2i(to), cost);\n } else if (abs(dir.fi) + abs(dir.se) == 2) {\n int cost = 2 * a;\n if (t[to.fi][to.se] == '#' || (t[i + dir.fi][j] == '#' && t[i][j + dir.se] == '#')) {\n if (bomb) continue;\n cost += b;\n }\n G.add_edge(ii2i({i, j}), ii2i(to), cost);\n }\n }\n }\n }\n vector<int> d = G.dijkstra(ii2i(s));\n if (d[ii2i(g)] == 1e18) {\n cout << \"INF\" << endl;\n } else {\n cout << d[ii2i(g)] << endl;\n }\n}","accuracy":1,"time_ms":400,"memory_kb":175720,"score_of_the_acc":-1.447,"final_rank":18},{"submission_id":"aoj_3055_3414995","code_snippet":"#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define inf 2100000000\nusing namespace std;\n\nint h, w, a, b, ans = inf;\nstring c[1005];\nint memo[1005][1005] = {0};\nbool ch[1005][1005] = {0};\npair<int, int> s, g;\nint d[4] = {0, 1, 0, -1};\nint ds[4] = {1, -1, -1, 1};\n\nvoid solve();\n\nint main() {\n cin >> h >> w >> a >> b;\n for(int i = 0; i < h; ++i) cin >> c[i];\n for(int i = 0; i < h; ++i)\n for(int j = 0; j < w; ++j) memo[i][j] = inf;\n for(int i = 0; i < h; ++i)\n for(int j = 0; j < w; ++j) {\n if(c[i][j] == 's') {\n s = {i, j};\n c[i][j] = '.';\n memo[i][j] = 0;\n }\n if(c[i][j] == 'g') {\n g = {i, j};\n c[i][j] = '.';\n }\n }\n for(int i = 0; i < h; ++i)\n for(int j = 0; j < w; ++j) {\n bool nowch = 1, block = 0;\n for(int k = -1; k <= 1; ++k)\n for(int l = -1; l <= 1; ++l)\n if(k + i >= 0 && k + i < h && l + j >= 0 &&\n l + j < w) {\n if(c[k + i][l + j] == '*') nowch = 0;\n if(c[k + i][l + j] == '#') block = 1;\n }\n ch[i][j] = nowch & block;\n }\n solve();\n if(ans == inf)\n cout << \"INF\" << endl;\n else\n cout << ans << endl;\n return 0;\n}\n\nvoid solve() {\n priority_queue<pair<int, pair<int, int>>,\n vector<pair<int, pair<int, int>>>,\n greater<pair<int, pair<int, int>>>>\n pq;\n pq.push({0, {s.fi, s.se}});\n while(!pq.empty()) {\n pair<int, pair<int, int>> now, nextp;\n now = pq.top();\n pq.pop();\n if(memo[now.se.fi][now.se.se] < now.fi) continue;\n for(int i = 0; i < 4; ++i) {\n nextp = now;\n nextp.se.fi += d[i];\n nextp.se.se += d[i ^ 1];\n nextp.fi += a;\n if(nextp.se.fi < 0 || nextp.se.fi >= h ||\n nextp.se.se < 0 || nextp.se.se >= w ||\n memo[nextp.se.fi][nextp.se.se] <= nextp.fi)\n continue;\n if(c[nextp.se.fi][nextp.se.se] == '#') {\n if(ch[now.se.fi][now.se.se] &&\n memo[nextp.se.fi][nextp.se.se] > nextp.fi + b)\n nextp.fi += b;\n else\n continue;\n }\n memo[nextp.se.fi][nextp.se.se] = nextp.fi;\n pq.push(nextp);\n }\n if(!ch[now.se.fi][now.se.se]) continue;\n for(int i = 0; i < 4; ++i) {\n nextp = now;\n nextp.se.fi += ds[i];\n nextp.se.se += ds[(i + 1) % 4];\n nextp.fi += 2 * a + b;\n if(nextp.se.fi < 0 || nextp.se.fi >= h ||\n nextp.se.se < 0 || nextp.se.se >= w ||\n c[nextp.se.fi][nextp.se.se] != '#' ||\n memo[nextp.se.fi][nextp.se.se] <= nextp.fi)\n continue;\n memo[nextp.se.fi][nextp.se.se] = nextp.fi;\n pq.push(nextp);\n }\n }\n ans = memo[g.fi][g.se];\n}","accuracy":1,"time_ms":130,"memory_kb":8956,"score_of_the_acc":-0.146,"final_rank":10},{"submission_id":"aoj_3055_3414810","code_snippet":"#include <bits/stdc++.h>\n\n#define fst(t) std::get<0>(t)\n#define snd(t) std::get<1>(t)\n#define thd(t) std::get<2>(t)\n#define unless(p) if(!(p))\n#define until(p) while(!(p))\n\nusing ll = std::int64_t;\nusing T = std::tuple<int,int,int>;\n\nconst int dx[] = {-1, +1, 0, 0, -1, -1, +1, +1, 0}, dy[] = {0, 0, -1, +1, -1, +1, -1, +1, 0};\nconstexpr int INF = 2001001001;\n\nint H, W, A, B;\nstd::string m[1100];\nint sy, sx, gy, gx;\nbool has[1100][1100];\nint dist[1100][1100];\nstd::priority_queue<T, std::vector<T>, std::greater<T>> pq;\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n std::cin >> H >> W >> A >> B;\n\n for(int i=0;i<H;++i){\n std::cin >> m[i];\n\n for(int j=0;j<W;++j){\n if(m[i][j] == 's'){\n sy = i;\n sx = j;\n }else if(m[i][j] == 'g'){\n gy = i;\n gx = j;\n }\n }\n }\n\n for(int i=0;i<H;++i){\n for(int j=0;j<W;++j){\n if(m[i][j] == '*'){\n for(int k=0;k<9;++k){\n int y = i + dy[k], x = j + dx[k];\n\n if(0 <= y && y < H && 0 <= x && x < W){\n has[y][x] = true;\n }\n }\n }\n }\n }\n\n std::fill(&dist[0][0], &dist[0][0] + 1100 * 1100, INF);\n dist[sy][sx] = 0;\n pq.emplace(0, sy, sx);\n\n until(pq.empty()){\n int d, y, x;\n std::tie(d, y, x) = pq.top();\n pq.pop();\n\n if(d > dist[y][x]){\n continue;\n }\n\n for(int i=0;i<4;++i){\n int ny = y + dy[i], nx = x + dx[i];\n\n if(0 <= ny && ny < H && 0 <= nx && nx < W && m[ny][nx] != '#'){\n if(d + A < dist[ny][nx]){\n dist[ny][nx] = d + A;\n pq.emplace(dist[ny][nx], ny, nx);\n }\n }\n }\n\n unless(has[y][x]){\n for(int i=0;i<8;++i){\n int ny = y + dy[i], nx = x + dx[i];\n\n if(0 <= ny && ny < H && 0 <= nx && nx < W && m[ny][nx] == '#'){\n int ma = std::abs(ny - y) + std::abs(nx - x);\n\n if(d + ma * A + B < dist[ny][nx]){\n dist[ny][nx] = d + ma * A + B;\n pq.emplace(dist[ny][nx], ny, nx);\n }\n }\n }\n }\n }\n\n if(dist[gy][gx] < INF){\n std::cout << dist[gy][gx] << std::endl;\n }else{\n std::cout << \"INF\" << std::endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":9792,"score_of_the_acc":-0.107,"final_rank":6},{"submission_id":"aoj_3055_3414656","code_snippet":"#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\nconst ll INF = 1LL << 60;\n\nstruct state {\n ll y, x, d;\n\npublic:\n bool operator<(const state &s) const {\n return d > s.d;\n }\n};\n\nll dy1[4] = { -1, +0, +1, +0 };\nll dx1[4] = { +0, -1, +0, +1 };\n\nll dy2[4] = { -1, -1, +1, +1 };\nll dx2[4] = { -1, +1, -1, +1 };\n\nint main(void) {\n ll H, W, A, B;\n cin >> H >> W >> A >> B;\n vector<string> S(H);\n REP(i, 0, H) cin >> S[i];\n\n ll sy, sx, gy, gx;\n REP(i, 0, H) REP(j, 0, W) {\n if (S[i][j] == 's') {\n sy = i;\n sx = j;\n }\n if (S[i][j] == 'g') {\n gy = i;\n gx = j;\n }\n }\n\n vector<vector<ll>> dp(H, vector<ll>(W, INF));\n priority_queue<state> q;\n q.push((state) { sy, sx, 0 });\n\n while (q.size()) {\n ll y = q.top().y, x = q.top().x, d = q.top().d;\n q.pop();\n\n if (dp[y][x] <= d) continue;\n dp[y][x] = d;\n\n REP(i, 0, 4) {\n ll ny = y + dy1[i], nx = x + dx1[i];\n if (0 <= ny && ny < H && 0 <= nx && nx < W && S[ny][nx] != '#') {\n q.push((state) { ny, nx, d + A });\n }\n }\n\n bool ok = true;\n REP(i, -1, 2) REP(j, -1, 2) {\n ll ny = y + i, nx = x + j;\n if (0 <= ny && ny < H && 0 <= nx && nx < W && S[ny][nx] == '*') {\n ok = false;\n }\n }\n if (ok) {\n REP(i, 0, 4) {\n ll ny = y + dy1[i], nx = x + dx1[i];\n if (0 <= ny && ny < H && 0 <= nx && nx < W) {\n q.push((state) { ny, nx, d + A + B });\n }\n }\n REP(i, 0, 4) {\n ll ny = y + dy2[i], nx = x + dx2[i];\n if (0 <= ny && ny < H && 0 <= nx && nx < W) {\n q.push((state) { ny, nx, d + A * 2 + B });\n }\n }\n }\n }\n\n if (dp[gy][gx] == INF) {\n cout << \"INF\" << endl;\n } else {\n cout << dp[gy][gx] << endl;\n }\n}","accuracy":1,"time_ms":540,"memory_kb":12436,"score_of_the_acc":-1.0335,"final_rank":17},{"submission_id":"aoj_3055_3414201","code_snippet":"//実装が重そうな問題はある程度考えてから書く\n//初期化を忘れずに（特に二分探索とか）\n//コーナーケースを考えて（特に場合分けとか）\n//不可解すぎるバグは配列外参照（配列の長さ）を検討\n#include \"bits/stdc++.h\"\n#define YES \"YES\"\n#define NO \"NO\"\n#define YESNO OUT(three(solve(),YES,NO))\n#define ECHO OUT(solve())\n#define three(A,B,C) ((A)?(B):(C))\n#define FOR(i,a,b) for(LL i=(a);i< (LL)(b);i++)\n#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)\n#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)\n#define REP(i,b) FOR(i,zero,b)\n#define EREP(i,b) EFOR(i,zero,b)\n#define RREP(i,b) RFOR(i,b-1,zero)\n#define ALL(c) c.begin(),c.end()\n#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())\n#define MAX(c) (*max_element(ALL(c)))\n#define MIN(c) (*min_element(ALL(c)))\n#define MP make_pair\n#define FI first\n#define SE second\n#define SI(x) (LL(x.size()))\n#define PB emplace_back\n#define DEBUG(a) OUT(a)\n#define DEBUG2(a,b) OUT2(a,b)\n#define cat cout << __LINE__ << endl\n#define OUT(a) cout << (a) << endl\n#define OUT2(a,b) cout << (a) <<\" \"<<(b) << endl\n#define int long long\n#define zero 0LL\n#define pb PB\nusing namespace std;\ntemplate<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }\ntemplate<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }\ntemplate<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }\ntypedef long long LL;\ntypedef double ld;\ntypedef LL ut;\ntypedef vector<ut> VI;\ntypedef vector<VI> VII;\ntypedef pair<ut, ut> pr;\ntypedef pair<ut, pr> ppr;\ntypedef vector<pr> Vpr;\ntypedef vector<ppr> Vppr;\ntypedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;\ninline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, \" \", \"\") << x[i]; }OUT(\"\"); }\nint dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };\nconst int SIZE1 =3e5 + 1000;\nconst int SIZE2 = 2010;\nconst int SIZE3 = 22;\nconst int SIZE = SIZE1;\nconst LL p = 7 + 1e9;\nconst LL INF = 1LL << 60;\nconst long double EPS = 1e-7;\nut N, M, K, X, L, Y,H,W,Q,D;\n// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;\nVI edges[SIZE];\nLL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;\n//LL A[SIZE], B[SIZE];\nbool nable[SIZE2][SIZE2];\nLL cost[SIZE2][SIZE2];\nLL A, B;\nLL sy, sx, gy, gx;\nLL solve() {\n\tcin >> H >> W >> A >> B;\n\tstring s;\n\tREP(i, SIZE2) REP(j, SIZE2) cost[i][j] = INF;\n\tREP(i, H) {\n\t\tcin >> s;\n\t\tREP(j, W) {\n\t\t\tLL h=i+1, w=j+1;\n\t\t\tmaps[h][w]=s[j]=='.';\n\t\t\t//cout << maps[i+1][j+1] << endl;\n\t\t\tif (s[j] == '*') {\n\t\t\t\tmaps[h][w] = 1;\n\t\t\t\tEFOR(k, -1, 1) EFOR(l, -1, 1)\n\t\t\t\t\tnable[h + k][w + l] = true;\n\t\t\t}\n\t\t\tif (s[j] == 'g') {\n\t\t\t\tmaps[h][w] = true;\n\t\t\t\tgy = h;\n\t\t\t\tgx = w;\n\t\t\t}\n\t\t\telse if (s[j] == 's') {\n\t\t\t\tmaps[h][w] = true;\n\t\t\t\tsy = h;\n\t\t\t\tsx = w;\n\n\t\t\t}\n\t\t}\n\t}\n\tPQ qu;\n\tcost[sy][sx] = 0;\n\tqu.emplace(cost[sy][sx], pr(sy, sx));\n\t\n\twhile (!qu.empty()) {\n\t\tpr now = qu.top().second;\n\t\tLL co = qu.top().first;\n\t\tqu.pop();\n\t\tLL h = now.first;\n\t\tLL w = now.second;\n\t\tif (h <= 0 or h> H or w <= 0 or w> W) continue;\n\t\tassert(co >= cost[h][w]);\n\t\tif (co != cost[h][w]) continue;\n\t\tREP(i, 8) {\n\t\t\tint ny = dy[i] + h, nx = dx[i] + w;\n\t\t\tif (i < 4 and maps[ny][nx]) {\n\t\t\t\tif(MN(cost[ny][nx],co+A))\n\t\t\t\t\tqu.emplace(cost[ny][nx],pr(ny,nx));\n\n\t\t\t}\n\t\t\telse if (!nable[h][w]) {\n\t\t\t\tif (i < 4) {\n\t\t\t\t\tif (MN(cost[ny][nx], co + B+A))\n\t\t\t\t\t\tqu.emplace(cost[ny][nx],pr(ny,nx));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (MN(cost[ny][nx], co + B + A+A))\n\t\t\t\t\t\tqu.emplace(cost[ny][nx],pr(ny,nx));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t}\n\tif (cost[gy][gx] >= INF/2) {\n\t\tcout << \"INF\" << endl;\n\t\treturn 0;\n\t}\n\tcout << cost[gy][gx] << endl;\n\n\treturn 0;\n}\nsigned main() {\n\tios_base::sync_with_stdio(false);\n\tcout << fixed << setprecision(10);\n\tsolve();\n\t//\tcin >> N;\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":55428,"score_of_the_acc":-0.3271,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_3055_10892732\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nvoid solve(){\\n ll H, W, A, B; cin >> H >> W >> A >> B;\\n vec<string> S(H); rep(i, H) cin >> S[i];\\n const vl dx = {1, 1, 0, -1, -1, -1, 0, 1}, dy = {0, 1, 1, 1, 0, -1, -1, -1};\\n vv<bool> bomb(H, vec<bool>(W, 0));\\n auto check = [&](ll h, ll w)->bool{\\n return (0 <= w && w < W && 0 <= h && h < H);\\n };\\n pll s, g;\\n rep(i, H){\\n rep(k, W){\\n if(S[i][k] == 's') s = {i, k};\\n if(S[i][k] == 'g') g = {i, k};\\n if(S[i][k] == '*'){\\n bomb[i][k] = 1;\\n rep(t, 8){\\n ll h = i + dx[t], w = k + dy[t];\\n if(check(h, w)) bomb[h][w] = 1;\\n }\\n }\\n }\\n }\\n auto idx = [&](pll p)->ll{\\n return p.first * W + p.second;\\n };\\n vv<ll> dis(H, vl(W, 4e18));\\n vv<bool> vis(H, vec<bool>(W, 0));\\n dis[s.first][s.second] = 0;\\n minpq<pll> pQ;\\n pQ.push({0ll, idx(s)});\\n while(pQ.size()){\\n pll p = pQ.top(); pQ.pop();\\n ll h = p.second / W, w = p.second % W, d = p.first;\\n if(vis[h][w]) continue;\\n vis[h][w] = 1;\\n rep(t, 4){\\n ll hh = h + dx[t*2], ww = w + dy[t*2];\\n if(check(hh, ww)){\\n if(S[hh][ww] == '#') continue;\\n if(chmin(dis[hh][ww], d + A)){\\n pQ.push({d+A, hh*W+ww});\\n }\\n }\\n }\\n if(!bomb[h][w]){\\n rep(t, 8){\\n ll hh = h + dx[t], ww = w + dy[t];\\n if(check(hh,ww)){\\n if(chmin(dis[hh][ww], d + B + A * (1 + t % 2))){\\n pQ.push({d + B + A * (1 + t % 2), hh * W + ww});\\n }\\n }\\n }\\n }\\n }\\n if(!vis[g.first][g.second]){\\n cout << \\\"INF\\\" << endl;\\n return;\\n }\\n cout << dis[g.first][g.second] << endl;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 12648,\n \"score_of_the_acc\": -0.0982,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3055_10892691\",\n \"code_snippet\": \"#line 2 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\nusing namespace std;\\n\\n#include<bits/stdc++.h>\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp\\\"\\nnamespace noya2 {\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &p){\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p){\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v){\\n int s = (int)v.size();\\n for (int i = 0; i < s; i++) os << (i ? \\\" \\\" : \\\"\\\") << v[i];\\n return os;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v){\\n for (auto &x : v) is >> x;\\n return is;\\n}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\n} // namespace noya2\\n#line 1 \\\"/Users/noya2/Desktop/Noya2_library/template/const.hpp\\\"\\nnamespace noya2{\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n} // namespace noya2\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\n#line 6 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\nnamespace noya2{\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << std::min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(std::vector<T> &v){\\n std::sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n#line 8 \\\"/Users/noya2/Desktop/Noya2_library/template/template.hpp\\\"\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#line 2 \\\"c.cpp\\\"\\n\\nstruct grid {\\n int h, w;\\n grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}\\n int idx(int x, int y) const {\\n return x * w + y;\\n }\\n std::pair<int,int> pos(int id) const {\\n return {id / w, id % w};\\n }\\n bool operator()(int x, int y) const {\\n return 0 <= x && x < h && 0 <= y && y < w;\\n }\\n bool operator()(int id) const {\\n return operator()(id / w, id % w);\\n }\\n static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};\\n auto adj4(int x, int y) const {\\n return dxys | std::views::transform([x, y](std::pair<int,int> dxy){\\n return std::pair<int,int>(dxy.first + x, dxy.second + y);\\n }) | std::views::filter([this](std::pair<int,int> xy){\\n return operator()(xy.first, xy.second);\\n });\\n }\\n auto adj4(int id) const {\\n return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){\\n return idx(xy.first, xy.second);\\n });\\n }\\n static constexpr std::array<std::pair<int,int>, 8> dxys8 = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}, {1,1},{1,-1},{-1,1},{-1,-1}};\\n auto adj8(int x, int y) const {\\n return dxys8 | std::views::transform([x, y](std::pair<int,int> dxy){\\n return std::pair<int,int>(dxy.first + x, dxy.second + y);\\n }) | std::views::filter([this](std::pair<int,int> xy){\\n return operator()(xy.first, xy.second);\\n });\\n }\\n};\\n\\nvoid solve(){\\n int h, w; in(h,w);\\n grid gr(h,w);\\n int a, b; in(a,b);\\n vector<string> g(h); in(g);\\n auto find = [&](char c){\\n rep(i,h) rep(j,w){\\n if (g[i][j] == c){\\n return pii(i,j);\\n }\\n }\\n abort();\\n };\\n auto [sx, sy] = find('s');\\n auto [gx, gy] = find('g');\\n // out(sx,sy,gx,gy);\\n priority_queue<pli,vector<pli>,greater<pli>> pque;\\n vector<ll> dist(h*w,linf);\\n dist[gr.idx(sx,sy)] = 0;\\n pque.emplace(0,gr.idx(sx,sy));\\n while (!pque.empty()){\\n auto [d, xy] = pque.top(); pque.pop();\\n if (dist[xy] < d) continue;\\n auto [x, y] = gr.pos(xy);\\n for (auto [nx, ny] : gr.adj4(x,y)){\\n if (g[nx][ny] == '#') continue;\\n int nxy = gr.idx(nx,ny);\\n if (chmin(dist[nxy],d+a)){\\n pque.emplace(dist[nxy],nxy);\\n }\\n }\\n bool ok = true;\\n for (auto [nx, ny] : gr.adj8(x,y)){\\n if (g[nx][ny] == '*') ok = false;\\n }\\n if (ok && g[x][y] != '*'){\\n for (auto [nx, ny] : gr.adj8(x,y)){\\n int nxy = gr.idx(nx,ny);\\n int cost = (abs(x-nx)+abs(y-ny))*a + b;\\n // out(x,y,nx,ny,cost);\\n if (chmin(dist[nxy],d+cost)){\\n pque.emplace(dist[nxy],nxy);\\n }\\n }\\n }\\n }\\n int gxy = gr.idx(gx,gy);\\n if (dist[gxy] == linf){\\n out(\\\"INF\\\");\\n return ;\\n }\\n out(dist[gxy]);\\n // out(dist);\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 12332,\n \"score_of_the_acc\": -0.033,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3055_10891077\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n int H, W, A, B;\\n cin >> H >> W >> A >> B;\\n vector<string> S(H);\\n rep(i, 0, H) cin >> S[i];\\n _pq<pair<int, pair<int, int>>> pq;\\n vector seen(H, vector<int>(W, INF));\\n rep(i, 0, H) rep(j, 0, W) if (S[i][j] == 's') pq.push({0, {i, j}}), seen[i][j] = 0;\\n vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1, 0};\\n vector<int> dy = {1, -1, 0, 0, 1, -1, 1, -1, 0};\\n auto f = [&](int a, int b) -> bool {\\n return 0 <= a && a < H && 0 <= b && b < W;\\n };\\n while (!pq.empty()){\\n auto [c, pos] = pq.top();\\n pq.pop();\\n auto [x, y] = pos;\\n if (seen[x][y] != c) continue;\\n // cout << c << \\\" \\\" << x << \\\" \\\" << y << endl;\\n rep(k, 0, 4){\\n int a = dx[k] + x;\\n int b = dy[k] + y;\\n if (f(a, b) && S[a][b] != '#' && chmin(seen[a][b], c + A)){\\n pq.push({seen[a][b], {a, b}});\\n }\\n }\\n {\\n bool ok = true;\\n rep(k, 0, 9){\\n int a = dx[k] + x;\\n int b = dy[k] + y;\\n if (f(a, b) && S[a][b] == '*') ok = false;\\n }\\n if (ok) rep(k, 0, 8){\\n int a = dx[k] + x;\\n int b = dy[k] + y;\\n if (f(a, b)){\\n int tmp = c + B + A * (abs(dx[k]) + abs(dy[k]));\\n if (chmin(seen[a][b], tmp)){\\n pq.push({seen[a][b], {a, b}});\\n }\\n }\\n }\\n }\\n }\\n rep(i, 0, H) rep(j, 0, W) if (S[i][j] == 'g'){\\n if (seen[i][j] == INF) cout << \\\"INF\\\\n\\\";\\n else cout << seen[i][j] << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 8080,\n \"score_of_the_acc\": -0.0783,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3055_7008309\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\n#include <queue>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, int>;\\n\\nint main(){\\n int h, w, a, b; cin >> h >> w >> a >> b;\\n vector<string> s(h);\\n for(auto &it: s) cin >> it;\\n\\n vector<vector<ll>> mem(h, vector<ll>(w, 1LL << 60));\\n priority_queue<P, vector<P>, greater<P>> Q;\\n auto enc = [&w](int i, int j){\\n return i*w+j;\\n };\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n if(s[i][j] == 's'){\\n mem[i][j] = 0;\\n Q.emplace(0, enc(i, j));\\n }\\n }\\n }\\n const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}, dy = {1, 0, -1, 0, -1, 1, -1, 1};\\n auto isin = [&h, &w](int i, int j){\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n while(!Q.empty()){\\n auto c = Q.top(); Q.pop();\\n int ci = c.second/w, cj = c.second%w;\\n for(int k = 0; k < 4; k++){\\n int ni = ci+dx[k], nj = cj+dy[k];\\n if(!isin(ni, nj) || s[ni][nj] == '#') continue;\\n if(mem[ni][nj] > mem[ci][cj]+a){\\n mem[ni][nj] = mem[ci][cj]+a;\\n Q.emplace(mem[ni][nj], enc(ni, nj));\\n }\\n }\\n bool isbeam = true;\\n if(s[ci][cj] == '*') isbeam = false;\\n for(int k = 0; k < 8; k++){\\n int ni = ci+dx[k], nj = cj+dy[k];\\n if(isin(ni, nj) && s[ni][nj] == '*') isbeam = false;\\n }\\n if(!isbeam) continue;\\n for(int kk = 0; kk < 2; kk++){\\n for(int k = 0; k < 4; k++){\\n int ni = ci+dx[k+kk*4], nj = cj+dy[k+kk*4];\\n if(!isin(ni, nj)) continue;\\n if(mem[ni][nj] > mem[ci][cj]+a*(kk+1)+b){\\n mem[ni][nj] = mem[ci][cj]+a*(kk+1)+b;\\n Q.emplace(mem[ni][nj], enc(ni, nj));\\n }\\n }\\n }\\n }\\n\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n if(s[i][j] == 'g'){\\n if(mem[i][j] == 1LL << 60) cout << \\\"INF\\\" << endl;\\n else cout << mem[i][j] << endl;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 12700,\n \"score_of_the_acc\": -0.141,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3055_4963130\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <queue>\\n#include <utility>\\n#include <complex>\\n\\nusing namespace std;\\n\\nint H,W,A,B;\\n\\nchar maze[1003][1003];\\nbool visited[1003][1003];\\n\\nstruct S{\\n int d;\\n complex<int> p;\\n};\\n\\nint operator > (const S& a,const S& b){\\n return a.d>b.d;\\n}\\n\\nint main(){\\n\\n scanf(\\\"%d%d%d%d\\\",&H,&W,&A,&B);\\n\\n for(int i=1;i<=H;i++) scanf(\\\"%s\\\",maze[i]+1);\\n complex<int> s,g;\\n for(int i=1;i<=H;i++)\\n for(int j=1;j<=W;j++)\\n if (maze[i][j]=='s') s={i,j},maze[i][j]='.';\\n else if (maze[i][j]=='g') g={i,j},maze[i][j]='.';\\n\\n complex<int> d[]={{0,-1},{0,1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};\\n priority_queue<S,vector<S>,greater<S>> q;\\n\\n q.push(S{0,s});\\n\\n while(!q.empty()){\\n auto cur=q.top();\\n auto p=cur.p;\\n\\n if (p==g) break;\\n q.pop();\\n\\n auto &vis=visited[p.real()][p.imag()];\\n if (vis) continue;\\n vis=true;\\n\\n bool bomb=false;\\n for(int i=-1;i<=1;i++) \\n for(int j=-1;j<=1;j++){\\n complex<int> diff{i,j};\\n auto c=p+diff;\\n if (maze[c.real()][c.imag()]=='*') bomb=true;\\n }\\n\\n for(int i=0;i<4;i++) {\\n auto diff=d[i];\\n auto c=p+diff;\\n auto m=maze[c.real()][c.imag()];\\n auto dist=abs(diff.real())+abs(diff.imag());\\n if (m=='.'||m=='*') {\\n q.push(S{cur.d+A,c});\\n }\\n }\\n\\n for(int i=0;i<8&&!bomb;i++) {\\n auto diff=d[i];\\n auto c=p+diff;\\n auto m=maze[c.real()][c.imag()];\\n auto dist=abs(diff.real())+abs(diff.imag());\\n \\n if (m)\\n q.push(S{cur.d+A*dist+B,c});\\n \\n }\\n\\n }\\n\\n if (q.empty()) puts(\\\"INF\\\");\\n else printf(\\\"%d\\\\n\\\",q.top().d);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 4756,\n \"score_of_the_acc\": -0.8936,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3055_4942862\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-7, PI = acos(-1);\\n//ここから編集\\n\\nint dxy[5] = {-1,0,1,0,-1};\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n ll h, w, a, b; cin >> h >> w >> a >> b;\\n vector<string> f;\\n\\n int sy,sx,gy,gx;\\n REP(i,h){\\n string s; cin >> s;\\n f.push_back(s);\\n REP(j,w){\\n if(s[j] == 's'){\\n sy = i;\\n sx = j;\\n }else if(s[j] == 'g'){\\n gy = i;\\n gx = j;\\n }\\n }\\n }\\n\\n vector<vector<ll>> dist(h, vector<ll>(w, INT_MAX));\\n\\n dist[sy][sx] = 0;\\n priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;\\n pq.push(make_pair(0, sy*w+sx));\\n\\n while(pq.size()){\\n auto p = pq.top();\\n pq.pop();\\n\\n int y = p.second/w, x = p.second%w;\\n if(dist[y][x] < p.first) continue;\\n\\n for(int i=0; i<4; i++){\\n int ny = y + dxy[i], nx = x + dxy[i+1];\\n if(ny >= 0 && ny < h && nx >= 0 && nx < w && f[ny][nx] != '#'){\\n if(dist[ny][nx] > dist[y][x] + a){\\n dist[ny][nx] = dist[y][x] + a;\\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\\n }\\n }\\n }\\n\\n bool check = true;\\n for(int i=-1; i<=1; i++){\\n for(int j=-1; j<=1; j++){\\n int ny = y+i, nx = x+j;\\n if(ny >= 0 && ny < h && nx >= 0 && nx < w){\\n if(f[ny][nx] == '*') check = false;\\n }\\n }\\n }\\n if(check){\\n for(int i=-1; i<=1; i++){\\n for(int j=-1; j<=1; j++){\\n int ny = y+i, nx = x+j;\\n if(ny >= 0 && ny < h && nx >= 0 && nx < w){\\n if(abs(i) == 1 && abs(j) == 1){\\n if(dist[ny][nx] > dist[y][x] + b + 2*a){\\n dist[ny][nx] = dist[y][x] + b + 2*a;\\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\\n }\\n }else{\\n if(dist[ny][nx] > dist[y][x] + b + a){\\n dist[ny][nx] = dist[y][x] + b + a;\\n pq.push(make_pair(dist[ny][nx], ny*w+nx));\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n if(dist[gy][gx] == INT_MAX) cout << \\\"INF\\\" << endl;\\n else cout << dist[gy][gx] << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 11968,\n \"score_of_the_acc\": -0.1165,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3055_4239827\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<iomanip>\\n#include<cmath>\\n#include<vector>\\n#include<algorithm>\\n#include<queue>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\n#define INF ((long long)1e18)\\n#define MOD ((int)1e9+7)\\n#define endl \\\"\\\\n\\\"\\n\\n#define yn(f) ((f)?\\\"Yes\\\":\\\"No\\\")\\n#define YN(f) ((f)?\\\"YES\\\":\\\"NO\\\")\\n\\n#define MAX 1100\\n\\nint cost[MAX][MAX];\\nstring mp[MAX];\\nint sy, sx, gy, gx;\\nint H, W, A, B;\\nint dxy[4] = {1,-1,0,0};\\n\\nstring solve(){\\n\\tpriority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>, greater<pair<int,pair<int,int>>>> Q;\\n\\t\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int j = 0; j < W; j++){\\n\\t\\t\\tcost[i][j] = INF;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tQ.push(make_pair(0,make_pair(sy,sx)));\\n\\t\\n\\tcost[sy][sx] = 0;\\n\\t\\n\\twhile(!Q.empty()){\\n\\t\\tpair<int,pair<int,int>> P = Q.top(); Q.pop();\\n\\t\\tint y = P.second.first, x = P.second.second, tcost = P.first;\\n\\t\\tbool b = false, w = false;\\n\\t\\t\\n\\t\\t// cout<<y<<\\\" \\\"<<x<<endl;\\n\\t\\t// cout<<\\\" cost \\\"<<tcost<<\\\" \\\"<<mp[y][x]<<endl;\\n\\t\\tif(tcost < cost[y][x]) continue;\\n\\t\\tif(y == gy && x == gx) return to_string(tcost);\\n\\t\\t\\n\\t\\tfor(int i = -1; i <= 1; i++){\\n\\t\\t\\tfor(int j = -1; j <= 1; j++){\\n\\t\\t\\t\\tif(y+i < 0 || y+i >= H || x+j < 0 || x+j >= W) continue;\\n\\t\\t\\t\\t// cout<<y+i<<\\\" TTT \\\"<<x+j<<endl;\\n\\t\\t\\t\\tif(mp[y+i][x+j] == '*') b = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// cout<<\\\"GGGGG \\\"<<endl;\\n\\t\\tfor(int i = 0; i < 4; i++){\\n\\t\\t\\tint ny = y + dxy[i], nx = x + dxy[3-i];\\n\\t\\t\\t// cout<<\\\" ny nx \\\"<<ny<<\\\" \\\"<<nx<<endl;\\n\\t\\t\\tif(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\\n\\t\\t\\t\\n\\t\\t\\t// if(mp[ny][nx] == '#' || mp[ny][nx] == '*') continue;\\n\\t\\t\\tif(mp[ny][nx] == '#') continue;\\n\\t\\t\\t\\n\\t\\t\\t// cout<<cost[ny][nx]<<\\\" cost\\\"<<cost[y][x] + A<<endl;\\n\\t\\t\\tif(cost[ny][nx] <= cost[y][x] + A) continue;\\n\\t\\t\\t\\n\\t\\t\\tQ.push(make_pair(cost[y][x] + A,make_pair(ny,nx)));\\n\\t\\t\\t\\n\\t\\t\\tcost[ny][nx] = cost[y][x] + A;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(b == true) continue;\\n\\t\\t// cout<<\\\"FFFFF\\\"<<endl;\\n\\t\\tfor(int i = -1; i <= 1; i++){\\n\\t\\t\\tfor(int j = -1; j <= 1; j++){\\n\\t\\t\\t\\tif(i == j && i == 0) continue;\\n\\t\\t\\t\\tint ny = y + i, nx = x + j, co = A+B;\\n\\t\\t\\t\\n\\t\\t\\t\\tif(i&&j) co += A;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\\n\\t\\t\\t\\n\\t\\t\\t\\tif(cost[ny][nx] <= cost[y][x] + co) continue;\\n\\t\\t\\t\\n\\t\\t\\t\\tQ.push(make_pair(cost[y][x] + co,make_pair(ny,nx)));\\n\\t\\t\\t\\n\\t\\t\\t\\tcost[ny][nx] = cost[y][x] + co;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\treturn \\\"INF\\\";\\n}\\n\\nsigned main(){\\n\\t// cin.tie(0);\\n\\t// ios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(10);\\n\\t\\n\\t\\n\\tcin>>H>>W>>A>>B;\\n\\t\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tcin>>mp[i];\\n\\t\\tfor(int j = 0; j < W; j++){\\n\\t\\t\\tif(mp[i][j] == 's'){\\n\\t\\t\\t\\tsy = i, sx = j;\\n\\t\\t\\t}\\n\\t\\t\\tif(mp[i][j] == 'g'){\\n\\t\\t\\t\\tgy = i, gx = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<solve()<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 12728,\n \"score_of_the_acc\": -0.1837,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3055_3894963\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3055.cc: Don't Burn Kotatsu Turtle\\n */\\n\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_H = 1000;\\nconst int MAX_W = 1000;\\nconst int INF = (int)((1LL << 31) - 1);\\n\\nconst int dxs[] = { 1, 1, 0, -1, -1, -1, 0, 1 };\\nconst int dys[] = { 0, -1, -1, -1, 0, 1, 1, 1 };\\n\\n/* typedef */\\n\\nstruct Stat {\\n int d, x, y;\\n Stat() {}\\n Stat(int _d, int _x, int _y): d(_d), x(_x), y(_y) {}\\n bool operator<(const Stat &s) const { return d > s.d; }\\n void print() { printf(\\\"Stat(%d,%d,%d)\\\\n\\\", d, x, y); }\\n};\\n\\n/* global variables */\\n\\nchar flds[MAX_H][MAX_W + 4];\\nint ds[MAX_H][MAX_W], dis[8];\\n\\n/* subroutines */\\n\\ninline bool inside(int x, int y, int w, int h) {\\n return (x >= 0 && x < w && y >= 0 && y < h);\\n}\\n\\n/* main */\\n\\nint main() {\\n int h, w, a, b;\\n scanf(\\\"%d%d%d%d\\\", &h, &w, &a, &b);\\n\\n int sx, sy, gx, gy;\\n for (int y = 0; y < h; y++) {\\n scanf(\\\"%s\\\", flds[y]);\\n for (int x = 0; x < w; x++)\\n switch (flds[y][x]) {\\n case 's': flds[y][x] = '.', sx = x, sy = y; break;\\n case 'g': flds[y][x] = '.', gx = x, gy = y; break;\\n }\\n fill(ds[y], ds[y] + w, INF);\\n }\\n\\n ds[sy][sx] = 0;\\n priority_queue<Stat> q;\\n q.push(Stat(0, sx, sy));\\n\\n while (! q.empty()) {\\n Stat u = q.top(); q.pop();\\n //u.print();\\n if (u.d != ds[u.y][u.x]) continue;\\n if (u.x == gx && u.y == gy) break;\\n\\n int vd = u.d + a, din = 0;\\n bool bmb = (flds[u.y][u.x] == '*');\\n for (int di = 0; di < 8; di++) {\\n int vx = u.x + dxs[di], vy = u.y + dys[di];\\n if (inside(vx, vy, w, h)) {\\n\\tchar &vf = flds[vy][vx];\\n\\t// normal move\\n\\tif (! (di & 1) && vf != '#' && ds[vy][vx] > vd) {\\n\\t ds[vy][vx] = vd;\\n\\t q.push(Stat(vd, vx, vy));\\n\\t}\\n\\n\\t// bomb\\n\\tif (vf == '*') bmb = true;\\n\\telse if (vf == '#')\\n\\t dis[din++] = di;\\n }\\n }\\n //printf(\\\" bmb=%d\\\\n\\\", bmb);\\n\\n if (! bmb)\\n for (int i = 0; i < din; i++) {\\n\\tint di = dis[i];\\n\\tint vx = u.x + dxs[di], vy = u.y + dys[di];\\n\\tint vd = u.d + ((di & 1) + 1) * a + b;\\n\\n\\tif (ds[vy][vx] > vd) {\\n\\t ds[vy][vx] = vd;\\n\\t q.push(Stat(vd, vx, vy));\\n\\t}\\n }\\n }\\n\\n if (ds[gy][gx] >= INF) puts(\\\"INF\\\");\\n else printf(\\\"%d\\\\n\\\", ds[gy][gx]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 8140,\n \"score_of_the_acc\": -0.036,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3055_3659291\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n//INSERT ABOVE HERE\\nconst int MAX = 1010;\\nint dp[MAX][MAX];\\nint bm[MAX][MAX];\\n\\nsigned main(){\\n int h,w,p,q;\\n cin>>h>>w>>p>>q;\\n vector<string> st(h);\\n for(int i=0;i<h;i++) cin>>st[i];\\n\\n memset(bm,0,sizeof(dp));\\n\\n auto in=[&](int y,int x){return 0<=y&&y<h&&0<=x&&x<w;};\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n if(st[i][j]!='*') continue;\\n for(int a=-1;a<=1;a++)\\n for(int b=-1;b<=1;b++)\\n if(in(i+a,j+b)) bm[i+a][j+b]=1;\\n }\\n }\\n \\n memset(dp,-1,sizeof(dp));\\n struct T{\\n int y,x,d;\\n T(){}\\n T(int y,int x,int d):y(y),x(x),d(d){}\\n bool operator<(const T &a)const{return d>a.d;};\\n };\\n\\n priority_queue<T> pq;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n if(st[i][j]=='s') pq.emplace(i,j,dp[i][j]=0);\\n\\n int dy[]={1,-1,0,0};\\n int dx[]={0,0,1,-1};\\n auto cmp=[&](int a,int b){return a<0||b<a;};\\n while(!pq.empty()){\\n T s=pq.top();pq.pop();\\n int y=s.y,x=s.x,d=s.d;\\n //cout<<y<<\\\" \\\"<<x<<\\\":\\\"<<d<<endl;\\n if(dp[y][x]<d) continue;\\n if(st[y][x]=='g'){\\n cout<<d<<endl;\\n return 0;\\n }\\n \\n auto check=\\n [&](int ny,int nx,int nd)->void{\\n if(!in(ny,nx)||!cmp(dp[ny][nx],nd)) return;\\n dp[ny][nx]=nd;\\n pq.emplace(ny,nx,dp[ny][nx]);\\n };\\n \\n for(int k=0;k<4;k++){\\n int ny=y+dy[k],nx=x+dx[k];\\n if(in(ny,nx)&&st[ny][nx]!='#') check(ny,nx,d+p);\\n }\\n \\n if(bm[y][x]) continue;\\n \\n for(int a=-1;a<=1;a++)\\n for(int b=-1;b<=1;b++)\\n check(y+a,x+b,d+(abs(a)+abs(b))*p+q);\\n }\\n cout<<\\\"INF\\\"<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 12088,\n \"score_of_the_acc\": -0.0958,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3055_3646033\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 1005\\n\\nstruct Edge{\\n\\n\\tEdge(int arg_to_row,int arg_to_col, ll arg_cost){\\n\\t\\tto_row = arg_to_row;\\n\\t\\tto_col = arg_to_col;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\n\\tint to_row,to_col;\\n\\tint cost;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col, ll arg_sum_cost){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tsum_cost = arg_sum_cost;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\treturn sum_cost > arg.sum_cost; //総コストの昇順(PQ)\\n\\t}\\n\\n\\tint row,col;\\n\\tll sum_cost;\\n};\\n\\nint H,W;\\nint start_row,start_col,goal_row,goal_col;\\nint diff_row[9] = {-1,-1,-1,0,0,0,1,1,1},diff_col[9] = {-1,0,1,-1,0,1,-1,0,1};\\nint A,B;\\nchar table[NUM][NUM];\\nvector<Edge> G[NUM][NUM];\\nint min_dist[NUM][NUM];\\n\\n\\nbool rangeCheck(int row,int col){\\n\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\\n\\n\\t\\treturn true;\\n\\t}else{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d %d %d\\\",&H,&W,&A,&B);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tif(table[row][col] == 's'){\\n\\n\\t\\t\\t\\tstart_row = row;\\n\\t\\t\\t\\tstart_col = col;\\n\\t\\t\\t\\ttable[row][col] = '.';\\n\\n\\t\\t\\t}else if(table[row][col] == 'g'){\\n\\n\\t\\t\\t\\tgoal_row = row;\\n\\t\\t\\t\\tgoal_col = col;\\n\\t\\t\\t\\ttable[row][col] = '.';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//各セルから、他のセルへエッジを張る\\n\\tbool is_bomb;\\n\\tint adj_row,adj_col;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tis_bomb = false;\\n\\n\\t\\t\\t//隣接9区間に爆弾があるか調べる\\n\\t\\t\\tfor(int i = 0; i < 9; i++){\\n\\t\\t\\t\\tadj_row = row+diff_row[i];\\n\\t\\t\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(!rangeCheck(adj_row,adj_col))continue;\\n\\n\\t\\t\\t\\tif(table[adj_row][adj_col] == '*'){\\n\\t\\t\\t\\t\\tis_bomb = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < 9; i++){\\n\\n\\t\\t\\t\\tadj_row = row+diff_row[i];\\n\\t\\t\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(!rangeCheck(adj_row,adj_col))continue;\\n\\n\\t\\t\\t\\tswitch(table[adj_row][adj_col]){\\n\\t\\t\\t\\tcase '.':\\n\\n\\t\\t\\t\\t\\tif((abs(row-adj_row)+abs(col-adj_col) == 1)){ //隣\\n\\n\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,A));\\n\\n\\t\\t\\t\\t\\t}else{ //壁があって行けない場合あり\\n\\n\\t\\t\\t\\t\\t\\tif(table[row][adj_col] != '#' || table[adj_row][col] != '#'){\\n\\t\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,2*A));\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tif(!is_bomb){\\n\\t\\t\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,2*A+B));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '*':\\n\\t\\t\\t\\t\\tif((abs(row-adj_row)+abs(col-adj_col) == 1)){ //隣\\n\\n\\t\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,A));\\n\\n\\t\\t\\t\\t\\t\\t}else{ //壁があって行けない場合あり\\n\\n\\t\\t\\t\\t\\t\\t\\tif(table[row][adj_col] != '#' || table[adj_row][col] != '#'){\\n\\t\\t\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,2*A));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase '#':\\n\\t\\t\\t\\t\\tif(!is_bomb){\\n\\t\\t\\t\\t\\t\\tG[row][col].push_back(Edge(adj_row,adj_col,A*(abs(row-adj_row)+abs(col-adj_col))+B));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tmin_dist[row][col] = HUGE_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tpriority_queue<Info> Q;\\n\\tmin_dist[start_row][start_col] = 0;\\n\\n\\tQ.push(Info(start_row,start_col,0));\\n\\n\\tint next_row,next_col,next_cost;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().row == goal_row && Q.top().col == goal_col){\\n\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",Q.top().sum_cost);\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else if(Q.top().sum_cost > min_dist[Q.top().row][Q.top().col]){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().row][Q.top().col].size(); i++){\\n\\n\\t\\t\\t\\tnext_row = G[Q.top().row][Q.top().col][i].to_row;\\n\\t\\t\\t\\tnext_col = G[Q.top().row][Q.top().col][i].to_col;\\n\\t\\t\\t\\tnext_cost = Q.top().sum_cost+G[Q.top().row][Q.top().col][i].cost;\\n\\n\\t\\t\\t\\tif(min_dist[next_row][next_col] > next_cost){\\n\\t\\t\\t\\t\\tmin_dist[next_row][next_col] = next_cost;\\n\\t\\t\\t\\t\\tQ.push(Info(next_row,next_col,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"INF\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 234288,\n \"score_of_the_acc\": -1.8511,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3055_3481587\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define int long long\\nusing namespace std;\\ntypedef pair<int,int>P;\\ntypedef pair<int,P>P2;\\n\\npriority_queue<P2,vector<P2>,greater<P2> >q;\\nint dx[]={0,1,1,1,0,-1,-1,-1};\\nint dy[]={-1,-1,0,1,1,1,0,-1};\\nint dc[]={1,2,1,2,1,2,1,2};\\nint off[]={1,-1};\\nint h,w,A,B,dp[1005][1005];\\nint sx,sy,gx,gy;\\nchar s[1005][1005];\\n\\nsigned main(){\\n\\tr(i,1005)r(j,1005) dp[i][j] = 2000000000;\\n\\n\\tcin>>h>>w>>A>>B;\\n\\tr(i,8) dc[i] = ( i%2? A*2:A );\\n\\tr(i,h) scanf(\\\"%s\\\",s[i]);\\n\\n\\tr(i,h)r(j,w){\\n\\t\\tif( s[i][j] == 's' ) sx=j , sy=i;\\n\\t\\tif( s[i][j] == 'g' ) gx=j , gy=i;\\n\\t}\\n\\n\\tq.push(P2(0,P(sx,sy)));\\n\\tdp[sy][sx] = 0;\\n\\n\\twhile(!q.empty()){\\n\\t\\tP2 p=q.top();q.pop();\\n\\t\\tint x = p.second.first , y = p.second.second;\\n\\t\\tint cost = p.first , f2 = (s[y][x]=='*');\\n\\t\\tif( dp[y][x] < cost )continue;\\n\\t\\tr(i,8){\\n\\t\\t\\tint nx = x+dx[i] , ny = y+dy[i];\\n\\t\\t\\tint ncos = cost+dc[i] , flag = 0;\\n\\n\\t\\t\\tif( ny<0 || nx<0 || ny>=h || nx>=w )continue;\\n\\t\\t\\tif( s[ny][nx] == '*' )f2++;\\n\\n\\t\\t\\tif(i%2)r(j,2){\\n\\t\\t\\t\\tint T = (i+off[j]+8)%8;\\n\\t\\t\\t\\tint tx = x+dx[T] , ty = y+dy[T];\\n\\t\\t\\t\\tif( tx<0 || ty<0 || tx>=w || ty>=h || s[ty][tx]=='#' ) flag++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif( flag == 2 )continue;\\n\\t\\t\\tif( dp[ny][nx] <= ncos )continue;\\n\\t\\t\\tif( s[ny][nx] == '#' )continue;\\n\\n\\t\\t\\tdp[ny][nx] = ncos;\\n\\t\\t\\tq.push(P2(ncos,P(nx,ny)));\\n\\t\\t}\\n\\t\\tif( f2 )continue;\\n\\t\\tr(i,8){\\n\\t\\t\\tint nx = x+dx[i] , ny = y+dy[i];\\n\\t\\t\\tint ncos = cost+dc[i]+B;\\n\\n\\t\\t\\tif( ny<0 || nx<0 || ny>=h || nx>=w )continue;\\n\\t\\t\\tif( dp[ny][nx] <= ncos )continue;\\n\\t\\t\\t\\n\\t\\t\\tdp[ny][nx] = ncos;\\n\\t\\t\\tq.push(P2(ncos,P(nx,ny)));\\n\\t\\t}\\n\\t}\\n\\tif( dp[gy][gx] == 2000000000 )cout<<\\\"INF\\\"<<endl;\\n\\telse cout<<dp[gy][gx]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 12100,\n \"score_of_the_acc\": -0.1384,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3055_3425190\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef long double ld;\\nconst int INF=1e9,MOD=1e9+7;\\nconst ll LINF=1e18;\\nusing namespace std;\\n#define int long long\\n//template\\nint d[1002][1002];\\n//main\\nsigned main(){\\n int H,W,A,B;cin>>H>>W>>A>>B;\\n std::vector<string> s(H);\\n for(int i=0;i<H;i++)cin>>s[i];\\n int sx,sy,gx,gy;\\n for(int i=0;i<H;i++){\\n for(int j=0;j<W;j++){\\n if(s[i][j]=='s'){sx=j;sy=i;}\\n if(s[i][j]=='g'){gx=j;gy=i;}\\n }\\n }\\n typedef pair<int,int> P;\\n for(int i=0;i<1002;i++)for(int j=0;j<1002;j++)d[i][j]=LINF;\\n queue<P> que;\\n int x[8]={1,-1,0,0,1,1,-1,-1};\\n int y[8]={0,0,1,-1,1,-1,1,-1};\\n que.push(P(sy,sx));\\n d[sy][sx]=0;\\n while(que.size()){\\n P p=que.front();que.pop();\\n int pf=p.first,ps=p.second;\\n bool bom=false;\\n for(int i=max(0LL,pf-1);i<=min(H-1,pf+1);i++){\\n for(int j=max(0LL,ps-1);j<=min(W-1,ps+1);j++){\\n if(s[i][j]=='*')bom=true;\\n }\\n }\\n //x[i]とy[i]逆に使った気がするけど問題はないので無視\\n if(bom){\\n for(int i=0;i<4;i++){\\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\\n if(s[pf+x[i]][ps+y[i]]!='#'&&d[pf+x[i]][ps+y[i]]>d[pf][ps]+A){\\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A;\\n que.push(P(pf+x[i],ps+y[i]));\\n }\\n }\\n }\\n else{\\n for(int i=0;i<4;i++){\\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\\n if(s[pf+x[i]][ps+y[i]]!='#'&&d[pf+x[i]][ps+y[i]]>d[pf][ps]+A){\\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A;\\n que.push(P(pf+x[i],ps+y[i]));\\n }\\n }\\n for(int i=0;i<4;i++){\\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\\n if(d[pf+x[i]][ps+y[i]]>d[pf][ps]+A+B){\\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A+B;\\n que.push(P(pf+x[i],ps+y[i]));\\n }\\n }\\n for(int i=4;i<8;i++){\\n if(pf+x[i]<0||pf+x[i]>=H||ps+y[i]<0||ps+y[i]>=W)continue;\\n if(d[pf+x[i]][ps+y[i]]>d[pf][ps]+A+A+B){\\n d[pf+x[i]][ps+y[i]]=d[pf][ps]+A+A+B;\\n que.push(P(pf+x[i],ps+y[i]));\\n }\\n }\\n }\\n }\\n if(d[gy][gx]>100000000000000000)cout<<\\\"INF\\\"<<endl;\\n else cout<<d[gy][gx]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 11996,\n \"score_of_the_acc\": -0.1805,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3055_3425186\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\n#define chmin(a, b) ((a)=min((a), (b)))\\n#define chmax(a, b) ((a)=max((a), (b)))\\n#define fs first\\n#define sc second\\n#define eb emplace_back\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef tuple<int, int, int> T;\\n\\nconst ll MOD=1e9+7;\\nconst ll INF=1e18;\\nconst double pi=acos(-1);\\nconst double eps=1e-10;\\n\\nint dx[]={1, 1, 0, -1, -1, -1, 0, 1};\\nint dy[]={0, -1, -1, -1, 0, 1, 1, 1};\\n\\nconst int MAX_N=1002000;\\n\\nvector<vector<P>> g(MAX_N);\\nvector<ll> dist(MAX_N, INF);\\nvoid dijkstra(int s){\\n priority_queue<P, vector<P>, greater<P>> que;\\n dist[s]=0;\\n que.push(P(0, s));\\n\\n while(!que.empty()){\\n P p=que.top(); que.pop();\\n ll pcost=p.first, pv=p.second;\\n if(dist[pv] < pcost) continue;\\n\\n for(int i=0; i<g[pv].size(); i++){\\n P p2=g[pv][i];\\n ll nv=p2.first, ncost=p2.second;\\n if(dist[nv] > dist[pv] + ncost){\\n dist[nv] = dist[pv] + ncost;\\n que.push(P(dist[nv], nv));\\n }\\n }\\n }\\n}\\n\\nint main(){\\n int h, w, a, b; cin>>h>>w>>a>>b;\\n vector<string> c(h);\\n for(int i=0; i<h; i++) cin>>c[i];\\n\\n int sy, sx, gy, gx;\\n for(int i=0; i<h; i++){\\n for(int j=0; j<w; j++){\\n if(c[i][j]=='s'){\\n sy=i, sx=j;\\n c[i][j]='.';\\n }\\n if(c[i][j]=='g'){\\n gy=i, gx=j;\\n c[i][j]='.';\\n }\\n }\\n }\\n\\n for(int i=0; i<h; i++){\\n for(int j=0; j<w; j++){\\n int cur=1000*i+j;\\n\\n bool isBomb=false;\\n if(c[i][j]=='*') isBomb=true;\\n for(int k=0; k<8; k++){\\n int ny=i+dy[k], nx=j+dx[k];\\n if(0<=ny && ny<h && 0<=nx && nx<w){\\n if(c[ny][nx]=='*') isBomb=true;\\n }\\n }\\n\\n for(int k=0; k<8; k++){\\n int ny=i+dy[k], nx=j+dx[k];\\n int nxt=1000*ny+nx;\\n \\n if(0<=ny && ny<h && 0<=nx && nx<w){\\n if(k%2==0){\\n // 上下左右の移動\\n if(c[ny][nx]=='#'){\\n if(isBomb) continue;\\n g[cur].push_back(P(nxt, a+b));\\n }\\n else{\\n g[cur].push_back(P(nxt, a));\\n }\\n }\\n else{\\n // 斜め移動\\n int pny=i+dy[k-1], pnx=j+dx[k-1];\\n int nny=i+dy[(k+1)%8], nnx=j+dx[(k+1)%8];\\n if(c[ny][nx]=='#' || c[pny][pnx]=='#' || c[nny][nnx]=='#'){\\n if(isBomb) continue;\\n g[cur].push_back(P(nxt, 2*a+b));\\n }\\n else{\\n g[cur].push_back(P(nxt, 2*a));\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n dijkstra(1000*sy+sx);\\n \\n if(dist[1000*gy+gx]==INF) cout << \\\"INF\\\" << endl;\\n else cout << dist[gy*1000+gx] << endl; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 176016,\n \"score_of_the_acc\": -1.4695,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3055_3420193\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <queue>\\nusing namespace std;\\nusing pint = pair<int,int>;\\nconst int INF = 1<<29;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nbool chmin(int &a, int b) { if (a > b) {a = b; return true;} return false; }\\n\\nint H, W, A, B;\\nvector<string> fi;\\n\\nint main() {\\n cin >> H >> W >> A >> B;\\n fi.resize(H);\\n for (int i = 0; i < H; ++i) cin >> fi[i];\\n int sx, sy, tx, ty;\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n if (fi[i][j] == 's') sx = i, sy = j;\\n if (fi[i][j] == 'g') tx = i, ty = j;\\n }\\n \\n priority_queue<pair<int,pint>, vector<pair<int,pint> >,\\n greater<pair<int,pint> > > que;\\n que.push({0, pint(sx, sy)});\\n vector<vector<int> > dp(H, vector<int>(W, INF));\\n dp[sx][sy] = 0;\\n while (!que.empty()) {\\n auto cur = que.top(); que.pop();\\n int cur_dist = cur.first;\\n int x = cur.second.first;\\n int y = cur.second.second;\\n if (cur_dist > dp[x][y]) continue;\\n\\n //cout << x << \\\", \\\" << y << \\\": \\\" << cur_dist << endl;\\n\\n // 通常の移動\\n for (int dir = 0; dir < 4; ++dir) {\\n int nx = x + dx[dir], ny = y + dy[dir];\\n if (nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\\n if (fi[nx][ny] == '#') continue;\\n if (chmin(dp[nx][ny], dp[x][y] + A)) que.push({dp[nx][ny], pint(nx, ny)});\\n }\\n\\n // 魔法\\n bool can = true;\\n for (int i = x-1; i <= x+1; ++i)\\n for (int j = y-1; j <= y+1; ++j) {\\n if (i < 0 || i >= H || j < 0 || j >= W) continue;\\n if (fi[i][j] == '*') can = false;\\n }\\n if (can) {\\n for (int i = x-1; i <= x+1; ++i)\\n for (int j = y-1; j <= y+1; ++j) {\\n if (i < 0 || i >= H || j < 0 || j >= W) continue;\\n if (i == x && j == y) continue;\\n if (fi[i][j] != '#') continue;\\n if (chmin(dp[i][j], dp[x][y] + B + A * (abs(i-x) + abs(j-y))))\\n que.push({dp[i][j], pint(i, j)});\\n } \\n }\\n }\\n if (dp[tx][ty] < INF) cout << dp[tx][ty] << endl;\\n else cout << \\\"INF\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 7744,\n \"score_of_the_acc\": -0.1832,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3055_3419049\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\n//#pragma GCC optimize (\\\"-O3\\\")\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\ntemplate<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\\nint H, W, A, B;\\nstring C[1010];\\nint vis[1010][1010]; ll dis[1010][1010];\\nmin_priority_queue<pair<ll, int>> que;\\nenum { UP = 0, UP_RIGHT, RIGHT, DOWN_RIGHT, DOWN, DOWN_LEFT, LEFT, UP_LEFT };\\nint dx[8] = { 0,1,1,1,0,-1,-1,-1 };\\nint dy[8] = { -1,-1,0,1,1,1,0,-1 };\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n cin >> H >> W >> A >> B;\\n rep(y, 0, H) cin >> C[y];\\n\\n rep(y, 0, H) rep(x, 0, W) dis[y][x] = infl;\\n\\n int sx, sy;\\n rep(y, 0, H) rep(x, 0, W) if (C[y][x] == 's') {\\n sx = x;\\n sy = y;\\n }\\n\\n dis[sy][sx] = 0;\\n que.push({ 0, sy * 1010 + sx });\\n\\n while (!que.empty()) {\\n auto q = que.top(); que.pop();\\n\\n ll c = q.first;\\n int x = q.second % 1010;\\n int y = q.second / 1010;\\n\\n if (C[y][x] == 'g') {\\n cout << dis[y][x] << endl;\\n return;\\n }\\n\\n if (vis[y][x]) continue;\\n vis[y][x] = 1;\\n\\n rep(i, 0, 8) if ((i & 1) == 0) {\\n int xx = x + dx[i];\\n int yy = y + dy[i];\\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\\n if (C[yy][xx] == '#') continue;\\n if (chmin(dis[yy][xx], c + A)) que.push({ dis[yy][xx], yy * 1010 + xx });\\n }\\n\\n int ok = 1;\\n if (C[y][x] == '*') ok = 0;\\n rep(i, 0, 8) {\\n int xx = x + dx[i];\\n int yy = y + dy[i];\\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\\n if (C[yy][xx] == '*') ok = 0;\\n }\\n\\n if (ok) {\\n rep(i, 0, 8) {\\n int xx = x + dx[i];\\n int yy = y + dy[i];\\n if (xx < 0 or W <= xx or yy < 0 or H <= yy) continue;\\n int d = abs(x - xx) + abs(y - yy);\\n if (chmin(dis[yy][xx], c + B + A * d)) que.push({ dis[yy][xx], yy * 1010 + xx });\\n }\\n }\\n }\\n\\n cout << \\\"INF\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 16028,\n \"score_of_the_acc\": -0.1555,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3055_3418755\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)\\n#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)\\n#define ALL(obj) begin(obj), end(obj)\\n#define RALL(obj) rbegin(obj), rend(obj)\\n#define fi first\\n#define se second\\nusing ii = pair<int, int>;\\ntemplate <class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\\ntemplate <class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }\\n\\n// debug\\ntemplate <class T> ostream& operator<<(ostream &s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? \\\"\\\" : \\\" \\\"); return s; }\\ntemplate <class T> ostream& operator<<(ostream &s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? \\\"\\\" : \\\"\\\\n\\\"); return s; }\\ntemplate <class T, class S> ostream& operator<<(ostream &s, pair<T, S>& p) { s << \\\"{\\\" << p.first << \\\", \\\" << p.second << \\\"}\\\"; return s; }\\ntemplate <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? \\\"\\\" : \\\"\\\\n\\\"); } return s; }\\n#ifdef _MY_DEBUG\\n #define dump(...) cerr << \\\"/* \\\" << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << endl, dump_func(__VA_ARGS__), cerr << \\\"*/\\\\n\\\\n\\\";\\n#else\\n #define dump(...)\\n#endif\\nvoid dump_func() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? \\\"\\\" : \\\", \\\"), dump_func(forward<Tail>(t)...); }\\n\\nstruct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;\\nmt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\\nconstexpr int MOD = 1000000007;\\n// *************** TEMPLATE END *************** \\n\\nclass DirectedGraph {\\n struct Edge { int to, cost; };\\npublic:\\n vector<vector<Edge>> G;\\n int V;\\n DirectedGraph(int V) : G(V), V(V) {}\\n void add_edge(int u, int v, int cost) {\\n G[u].push_back({v, cost});\\n // G[v].push_back({u, cost});\\n }\\n vector<int> dijkstra(int s) {\\n vector<int> d(V, 1e18); d[s] = 0;\\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> que; // {dist, v}\\n que.push({0, s});\\n while (!que.empty()) {\\n pair<int, int> p = que.top(); que.pop();\\n int v = p.second;\\n if (d[v] < p.first) continue; // 定数倍枝刈り\\n for (Edge e: G[v]) {\\n int tmp = d[v] + e.cost;\\n if (d[e.to] <= tmp) continue;\\n d[e.to] = tmp;\\n que.push({tmp, e.to});\\n }\\n }\\n return d;\\n }\\n};\\n\\nvector<ii> dirs = {\\n {1, 0}, {0, 1}, {-1, 0}, {0, -1}, // 4方向\\n {1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // 斜め\\n {0, 0}, // 自身\\n};\\n\\nsigned main() {\\n int h, w, a, b; cin >> h >> w >> a >> b;\\n vector<string> t(h); REP (i, h) cin >> t[i];\\n ii s, g;\\n REP (i, h) {\\n REP (j, w) {\\n if (t[i][j] == 's') s = {i, j};\\n if (t[i][j] == 'g') g = {i, j};\\n }\\n }\\n auto i2ii = [&](int i) { return ii({i / w, i % w}); };\\n auto ii2i = [&](ii p) { return p.fi * w + p.se; };\\n auto valid = [&](ii p) {\\n return 0 <= p.fi && p.fi < h && 0 <= p.se && p.se < w;\\n };\\n auto around_bomb = [&](ii p) {\\n for (ii dir: dirs) {\\n ii to = {p.fi + dir.fi, p.se + dir.se};\\n if (!valid(to)) continue;\\n if (t[to.fi][to.se] == '*') return true;\\n }\\n return false;\\n };\\n\\n DirectedGraph G(h * w);\\n REP (i, h) {\\n REP (j, w) {\\n bool bomb = around_bomb({i, j});\\n for (ii dir: dirs) {\\n ii to = {i + dir.fi, j + dir.se};\\n if (!valid(to)) continue;\\n if (abs(dir.fi) + abs(dir.se) == 1) {\\n int cost = a;\\n if (t[to.fi][to.se] == '#') {\\n if (bomb) continue;\\n cost += b;\\n }\\n G.add_edge(ii2i({i, j}), ii2i(to), cost);\\n } else if (abs(dir.fi) + abs(dir.se) == 2) {\\n int cost = 2 * a;\\n if (t[to.fi][to.se] == '#' || (t[i + dir.fi][j] == '#' && t[i][j + dir.se] == '#')) {\\n if (bomb) continue;\\n cost += b;\\n }\\n G.add_edge(ii2i({i, j}), ii2i(to), cost);\\n }\\n }\\n }\\n }\\n vector<int> d = G.dijkstra(ii2i(s));\\n if (d[ii2i(g)] == 1e18) {\\n cout << \\\"INF\\\" << endl;\\n } else {\\n cout << d[ii2i(g)] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 175720,\n \"score_of_the_acc\": -1.447,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3055_3414995\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define fi first\\n#define se second\\n#define inf 2100000000\\nusing namespace std;\\n\\nint h, w, a, b, ans = inf;\\nstring c[1005];\\nint memo[1005][1005] = {0};\\nbool ch[1005][1005] = {0};\\npair<int, int> s, g;\\nint d[4] = {0, 1, 0, -1};\\nint ds[4] = {1, -1, -1, 1};\\n\\nvoid solve();\\n\\nint main() {\\n cin >> h >> w >> a >> b;\\n for(int i = 0; i < h; ++i) cin >> c[i];\\n for(int i = 0; i < h; ++i)\\n for(int j = 0; j < w; ++j) memo[i][j] = inf;\\n for(int i = 0; i < h; ++i)\\n for(int j = 0; j < w; ++j) {\\n if(c[i][j] == 's') {\\n s = {i, j};\\n c[i][j] = '.';\\n memo[i][j] = 0;\\n }\\n if(c[i][j] == 'g') {\\n g = {i, j};\\n c[i][j] = '.';\\n }\\n }\\n for(int i = 0; i < h; ++i)\\n for(int j = 0; j < w; ++j) {\\n bool nowch = 1, block = 0;\\n for(int k = -1; k <= 1; ++k)\\n for(int l = -1; l <= 1; ++l)\\n if(k + i >= 0 && k + i < h && l + j >= 0 &&\\n l + j < w) {\\n if(c[k + i][l + j] == '*') nowch = 0;\\n if(c[k + i][l + j] == '#') block = 1;\\n }\\n ch[i][j] = nowch & block;\\n }\\n solve();\\n if(ans == inf)\\n cout << \\\"INF\\\" << endl;\\n else\\n cout << ans << endl;\\n return 0;\\n}\\n\\nvoid solve() {\\n priority_queue<pair<int, pair<int, int>>,\\n vector<pair<int, pair<int, int>>>,\\n greater<pair<int, pair<int, int>>>>\\n pq;\\n pq.push({0, {s.fi, s.se}});\\n while(!pq.empty()) {\\n pair<int, pair<int, int>> now, nextp;\\n now = pq.top();\\n pq.pop();\\n if(memo[now.se.fi][now.se.se] < now.fi) continue;\\n for(int i = 0; i < 4; ++i) {\\n nextp = now;\\n nextp.se.fi += d[i];\\n nextp.se.se += d[i ^ 1];\\n nextp.fi += a;\\n if(nextp.se.fi < 0 || nextp.se.fi >= h ||\\n nextp.se.se < 0 || nextp.se.se >= w ||\\n memo[nextp.se.fi][nextp.se.se] <= nextp.fi)\\n continue;\\n if(c[nextp.se.fi][nextp.se.se] == '#') {\\n if(ch[now.se.fi][now.se.se] &&\\n memo[nextp.se.fi][nextp.se.se] > nextp.fi + b)\\n nextp.fi += b;\\n else\\n continue;\\n }\\n memo[nextp.se.fi][nextp.se.se] = nextp.fi;\\n pq.push(nextp);\\n }\\n if(!ch[now.se.fi][now.se.se]) continue;\\n for(int i = 0; i < 4; ++i) {\\n nextp = now;\\n nextp.se.fi += ds[i];\\n nextp.se.se += ds[(i + 1) % 4];\\n nextp.fi += 2 * a + b;\\n if(nextp.se.fi < 0 || nextp.se.fi >= h ||\\n nextp.se.se < 0 || nextp.se.se >= w ||\\n c[nextp.se.fi][nextp.se.se] != '#' ||\\n memo[nextp.se.fi][nextp.se.se] <= nextp.fi)\\n continue;\\n memo[nextp.se.fi][nextp.se.se] = nextp.fi;\\n pq.push(nextp);\\n }\\n }\\n ans = memo[g.fi][g.se];\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 8956,\n \"score_of_the_acc\": -0.146,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3055_3414810\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define fst(t) std::get<0>(t)\\n#define snd(t) std::get<1>(t)\\n#define thd(t) std::get<2>(t)\\n#define unless(p) if(!(p))\\n#define until(p) while(!(p))\\n\\nusing ll = std::int64_t;\\nusing T = std::tuple<int,int,int>;\\n\\nconst int dx[] = {-1, +1, 0, 0, -1, -1, +1, +1, 0}, dy[] = {0, 0, -1, +1, -1, +1, -1, +1, 0};\\nconstexpr int INF = 2001001001;\\n\\nint H, W, A, B;\\nstd::string m[1100];\\nint sy, sx, gy, gx;\\nbool has[1100][1100];\\nint dist[1100][1100];\\nstd::priority_queue<T, std::vector<T>, std::greater<T>> pq;\\n\\nint main(){\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n std::cin >> H >> W >> A >> B;\\n\\n for(int i=0;i<H;++i){\\n std::cin >> m[i];\\n\\n for(int j=0;j<W;++j){\\n if(m[i][j] == 's'){\\n sy = i;\\n sx = j;\\n }else if(m[i][j] == 'g'){\\n gy = i;\\n gx = j;\\n }\\n }\\n }\\n\\n for(int i=0;i<H;++i){\\n for(int j=0;j<W;++j){\\n if(m[i][j] == '*'){\\n for(int k=0;k<9;++k){\\n int y = i + dy[k], x = j + dx[k];\\n\\n if(0 <= y && y < H && 0 <= x && x < W){\\n has[y][x] = true;\\n }\\n }\\n }\\n }\\n }\\n\\n std::fill(&dist[0][0], &dist[0][0] + 1100 * 1100, INF);\\n dist[sy][sx] = 0;\\n pq.emplace(0, sy, sx);\\n\\n until(pq.empty()){\\n int d, y, x;\\n std::tie(d, y, x) = pq.top();\\n pq.pop();\\n\\n if(d > dist[y][x]){\\n continue;\\n }\\n\\n for(int i=0;i<4;++i){\\n int ny = y + dy[i], nx = x + dx[i];\\n\\n if(0 <= ny && ny < H && 0 <= nx && nx < W && m[ny][nx] != '#'){\\n if(d + A < dist[ny][nx]){\\n dist[ny][nx] = d + A;\\n pq.emplace(dist[ny][nx], ny, nx);\\n }\\n }\\n }\\n\\n unless(has[y][x]){\\n for(int i=0;i<8;++i){\\n int ny = y + dy[i], nx = x + dx[i];\\n\\n if(0 <= ny && ny < H && 0 <= nx && nx < W && m[ny][nx] == '#'){\\n int ma = std::abs(ny - y) + std::abs(nx - x);\\n\\n if(d + ma * A + B < dist[ny][nx]){\\n dist[ny][nx] = d + ma * A + B;\\n pq.emplace(dist[ny][nx], ny, nx);\\n }\\n }\\n }\\n }\\n }\\n\\n if(dist[gy][gx] < INF){\\n std::cout << dist[gy][gx] << std::endl;\\n }else{\\n std::cout << \\\"INF\\\" << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 9792,\n \"score_of_the_acc\": -0.107,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3055_3414656\",\n \"code_snippet\": \"#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\\nconst ll INF = 1LL << 60;\\n\\nstruct state {\\n ll y, x, d;\\n\\npublic:\\n bool operator<(const state &s) const {\\n return d > s.d;\\n }\\n};\\n\\nll dy1[4] = { -1, +0, +1, +0 };\\nll dx1[4] = { +0, -1, +0, +1 };\\n\\nll dy2[4] = { -1, -1, +1, +1 };\\nll dx2[4] = { -1, +1, -1, +1 };\\n\\nint main(void) {\\n ll H, W, A, B;\\n cin >> H >> W >> A >> B;\\n vector<string> S(H);\\n REP(i, 0, H) cin >> S[i];\\n\\n ll sy, sx, gy, gx;\\n REP(i, 0, H) REP(j, 0, W) {\\n if (S[i][j] == 's') {\\n sy = i;\\n sx = j;\\n }\\n if (S[i][j] == 'g') {\\n gy = i;\\n gx = j;\\n }\\n }\\n\\n vector<vector<ll>> dp(H, vector<ll>(W, INF));\\n priority_queue<state> q;\\n q.push((state) { sy, sx, 0 });\\n\\n while (q.size()) {\\n ll y = q.top().y, x = q.top().x, d = q.top().d;\\n q.pop();\\n\\n if (dp[y][x] <= d) continue;\\n dp[y][x] = d;\\n\\n REP(i, 0, 4) {\\n ll ny = y + dy1[i], nx = x + dx1[i];\\n if (0 <= ny && ny < H && 0 <= nx && nx < W && S[ny][nx] != '#') {\\n q.push((state) { ny, nx, d + A });\\n }\\n }\\n\\n bool ok = true;\\n REP(i, -1, 2) REP(j, -1, 2) {\\n ll ny = y + i, nx = x + j;\\n if (0 <= ny && ny < H && 0 <= nx && nx < W && S[ny][nx] == '*') {\\n ok = false;\\n }\\n }\\n if (ok) {\\n REP(i, 0, 4) {\\n ll ny = y + dy1[i], nx = x + dx1[i];\\n if (0 <= ny && ny < H && 0 <= nx && nx < W) {\\n q.push((state) { ny, nx, d + A + B });\\n }\\n }\\n REP(i, 0, 4) {\\n ll ny = y + dy2[i], nx = x + dx2[i];\\n if (0 <= ny && ny < H && 0 <= nx && nx < W) {\\n q.push((state) { ny, nx, d + A * 2 + B });\\n }\\n }\\n }\\n }\\n\\n if (dp[gy][gx] == INF) {\\n cout << \\\"INF\\\" << endl;\\n } else {\\n cout << dp[gy][gx] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 12436,\n \"score_of_the_acc\": -1.0335,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3055_3414201\",\n \"code_snippet\": \"//実装が重そうな問題はある程度考えてから書く\\n//初期化を忘れずに（特に二分探索とか）\\n//コーナーケースを考えて（特に場合分けとか）\\n//不可解すぎるバグは配列外参照（配列の長さ）を検討\\n#include \\\"bits/stdc++.h\\\"\\n#define YES \\\"YES\\\"\\n#define NO \\\"NO\\\"\\n#define YESNO OUT(three(solve(),YES,NO))\\n#define ECHO OUT(solve())\\n#define three(A,B,C) ((A)?(B):(C))\\n#define FOR(i,a,b) for(LL i=(a);i< (LL)(b);i++)\\n#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)\\n#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)\\n#define REP(i,b) FOR(i,zero,b)\\n#define EREP(i,b) EFOR(i,zero,b)\\n#define RREP(i,b) RFOR(i,b-1,zero)\\n#define ALL(c) c.begin(),c.end()\\n#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())\\n#define MAX(c) (*max_element(ALL(c)))\\n#define MIN(c) (*min_element(ALL(c)))\\n#define MP make_pair\\n#define FI first\\n#define SE second\\n#define SI(x) (LL(x.size()))\\n#define PB emplace_back\\n#define DEBUG(a) OUT(a)\\n#define DEBUG2(a,b) OUT2(a,b)\\n#define cat cout << __LINE__ << endl\\n#define OUT(a) cout << (a) << endl\\n#define OUT2(a,b) cout << (a) <<\\\" \\\"<<(b) << endl\\n#define int long long\\n#define zero 0LL\\n#define pb PB\\nusing namespace std;\\ntemplate<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }\\ntemplate<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }\\ntemplate<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }\\ntypedef long long LL;\\ntypedef double ld;\\ntypedef LL ut;\\ntypedef vector<ut> VI;\\ntypedef vector<VI> VII;\\ntypedef pair<ut, ut> pr;\\ntypedef pair<ut, pr> ppr;\\ntypedef vector<pr> Vpr;\\ntypedef vector<ppr> Vppr;\\ntypedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;\\ninline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, \\\" \\\", \\\"\\\") << x[i]; }OUT(\\\"\\\"); }\\nint dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };\\nconst int SIZE1 =3e5 + 1000;\\nconst int SIZE2 = 2010;\\nconst int SIZE3 = 22;\\nconst int SIZE = SIZE1;\\nconst LL p = 7 + 1e9;\\nconst LL INF = 1LL << 60;\\nconst long double EPS = 1e-7;\\nut N, M, K, X, L, Y,H,W,Q,D;\\n// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;\\nVI edges[SIZE];\\nLL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;\\n//LL A[SIZE], B[SIZE];\\nbool nable[SIZE2][SIZE2];\\nLL cost[SIZE2][SIZE2];\\nLL A, B;\\nLL sy, sx, gy, gx;\\nLL solve() {\\n\\tcin >> H >> W >> A >> B;\\n\\tstring s;\\n\\tREP(i, SIZE2) REP(j, SIZE2) cost[i][j] = INF;\\n\\tREP(i, H) {\\n\\t\\tcin >> s;\\n\\t\\tREP(j, W) {\\n\\t\\t\\tLL h=i+1, w=j+1;\\n\\t\\t\\tmaps[h][w]=s[j]=='.';\\n\\t\\t\\t//cout << maps[i+1][j+1] << endl;\\n\\t\\t\\tif (s[j] == '*') {\\n\\t\\t\\t\\tmaps[h][w] = 1;\\n\\t\\t\\t\\tEFOR(k, -1, 1) EFOR(l, -1, 1)\\n\\t\\t\\t\\t\\tnable[h + k][w + l] = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (s[j] == 'g') {\\n\\t\\t\\t\\tmaps[h][w] = true;\\n\\t\\t\\t\\tgy = h;\\n\\t\\t\\t\\tgx = w;\\n\\t\\t\\t}\\n\\t\\t\\telse if (s[j] == 's') {\\n\\t\\t\\t\\tmaps[h][w] = true;\\n\\t\\t\\t\\tsy = h;\\n\\t\\t\\t\\tsx = w;\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tPQ qu;\\n\\tcost[sy][sx] = 0;\\n\\tqu.emplace(cost[sy][sx], pr(sy, sx));\\n\\t\\n\\twhile (!qu.empty()) {\\n\\t\\tpr now = qu.top().second;\\n\\t\\tLL co = qu.top().first;\\n\\t\\tqu.pop();\\n\\t\\tLL h = now.first;\\n\\t\\tLL w = now.second;\\n\\t\\tif (h <= 0 or h> H or w <= 0 or w> W) continue;\\n\\t\\tassert(co >= cost[h][w]);\\n\\t\\tif (co != cost[h][w]) continue;\\n\\t\\tREP(i, 8) {\\n\\t\\t\\tint ny = dy[i] + h, nx = dx[i] + w;\\n\\t\\t\\tif (i < 4 and maps[ny][nx]) {\\n\\t\\t\\t\\tif(MN(cost[ny][nx],co+A))\\n\\t\\t\\t\\t\\tqu.emplace(cost[ny][nx],pr(ny,nx));\\n\\n\\t\\t\\t}\\n\\t\\t\\telse if (!nable[h][w]) {\\n\\t\\t\\t\\tif (i < 4) {\\n\\t\\t\\t\\t\\tif (MN(cost[ny][nx], co + B+A))\\n\\t\\t\\t\\t\\t\\tqu.emplace(cost[ny][nx],pr(ny,nx));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tif (MN(cost[ny][nx], co + B + A+A))\\n\\t\\t\\t\\t\\t\\tqu.emplace(cost[ny][nx],pr(ny,nx));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\n\\t}\\n\\tif (cost[gy][gx] >= INF/2) {\\n\\t\\tcout << \\\"INF\\\" << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tcout << cost[gy][gx] << endl;\\n\\n\\treturn 0;\\n}\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(10);\\n\\tsolve();\\n\\t//\\tcin >> N;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 55428,\n \"score_of_the_acc\": -0.3271,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1897,"cells":{"group_id":{"kind":"string","value":"aoj_3054_cpp"},"problem_description":{"kind":"string","value":"Problem D: Tunnel\nProblem\n横軸$x$、縦軸$y$の$xy$平面上に$n$個の長方形がある。$i$番目の長方形は、高さ$h_i$、幅$1$であり、頂点は点$(i-1, 0)$、点$(i-1, h_i)$、点$(i, h_i)$、点$(i, 0)$である。\nあなたは$n$個の正の整数$y_1, y_2, ... y_n$を選び、以下の$n$回の操作を行う。\n(1) 1回目の操作では、点$(0, 1)$と点$(1, y_1)$を結ぶ線分を引く。\n(2) $i$回目$(2 \\le i \\le n)$の操作では、点$(i-1, y_{i-1})$と点$(i, y_i)$を結ぶ線分を引く。\n$i$回目の操作に対し、$S_i$を以下のように定める。\n$i$回目の操作で引いた線分の$x$座標が小さい方の端点をA、$x$座標が大きい方の端点をBとする。\nまた、点$(i-1, 0)$をC、点$(i-1, h_i)$をD、点$(i, h_i)$をE 、点$(i, 0)$をFとする。\n台形ABFCと長方形DEFCの非共通部分の面積を$S_i$とする。\n以下に５つの例を示す。\nそれぞれの例における$S_i$は星マークを含む領域の面積の合計である。\n \n $S = S_1 + S_2 + … + S_n$を最小化するような$y_1, y_2, ... y_n$を求め、$S$の最小値を出力せよ。\nInput\n入力は以下の形式で与えられる。\n$n$\n$h_1$ $h_2$ $...$ $h_n$\n入力はすべて整数で与えられる。\nConstraints\n入力は以下の条件を満たす。\n$2 \\leq n \\leq 150 $\n$1 \\leq h_i \\leq 150 $\nOutput\n$S$の最小値を1行に出力せよ。\nただし、$10^{−5}$ までの絶対誤差または相対誤差は許容される。\nSample Input 1\n2\n5 3\nSample Output 1\n2.83333333\nSample Input 2\n3\n6 1 4\nSample Output 2\n6.25000000\nSample Input 3\n7\n3 1 9 2 2 5 1\nSample Output 3\n12.37500000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3054_10892772","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nvoid solve(){\n ll N; cin >> N;\n vl a(N); rep(i, N) cin >> a[i];\n auto area = [&](ll l, ll r, ll h)->ld{\n if(max(l, r) <= h){\n return (h * 2 - l - r) / 2.0;\n }\n if(min(l, r) >= h){\n return (l + r - h * 2) / 2.0;\n }\n ld re = (h - min(l, r)) * (h - min(l, r)) + (max(l, r) - h) * (max(l, r) - h);\n re /= 2 * abs(l - r);\n return re;\n };\n ll H = 301;\n vv<ld> dp(N+1, vec<ld>(H, 4e18)); dp[0][1] = 0.0;\n rep(i, N){\n reps(l, 1, H){\n reps(r, 1, H){\n chmin(dp[i+1][r], dp[i][l] + area(l, r, a[i]));\n }\n }\n }\n cout << *min_element(all(dp[N])) << endl;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3864,"score_of_the_acc":-0.7931,"final_rank":9},{"submission_id":"aoj_3054_10892680","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n\n#define rep(i,n) for(ll i=0;i<n;++i)\n#define all(a) (a).begin(),(a).end()\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &a){\n if (a.empty()) return os;\n os << a.front();\n for (auto e : a | views::drop(1)){\n os << ' ' << e;\n }\n return os;\n}\n\nvoid dump(auto ...vs){\n ((cout << vs << ' '), ...) << endl;\n}\n\n\n\nvoid solve() {\n ll N;\n cin>>N;\n vector<ll> H(N);\n rep(i,N)cin>>H[i];\n ll hmax=400;\n vector<ld> dp(hmax,1e18);\n dp[1]=0;\n rep(t,N){\n vector<ld> ndp(hmax,1e18);\n ll h=H[t];\n rep(i,hmax){\n if (i==0)continue;\n rep(j,hmax){\n if (j==0)continue;\n if (i<=h){\n if (j<=h){\n chmin(ndp[j],dp[i]+h-ld(i+j)/2);\n }\n else{\n ll di=h-i;\n ll dj=j-h;\n chmin(ndp[j],dp[i]+ld(di*di+dj*dj)/(2*(j-i)));\n }\n }\n else{\n if (j>h){\n chmin(ndp[j],dp[i]+ld(i+j)/2-h);\n }\n else{\n ll di=i-h;\n ll dj=h-j;\n chmin(ndp[j],dp[i]+ld(di*di+dj*dj)/(2*(i-j)));\n }\n }\n }\n }\n swap(dp,ndp);\n }\n cout<<*min_element(all(dp))<<endl;\n return;\n}\n\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n ll T=1;\n while (T--){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3840,"score_of_the_acc":-1.0206,"final_rank":16},{"submission_id":"aoj_3054_10891055","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n auto f = [&](int a, int b, int h) -> double {\n if (a > b) swap(a, b);\n if (b <= h || h <= a) return (double(abs(a - h) + abs(b - h))) / 2;\n double p = (double)(h - a) / (double)(b - a);\n return (p * (h - a) + (1 - p) * (b - h)) / 2;\n };\n int N;\n cin >> N;\n vector<int> H(N);\n rep(i, 0, N) cin >> H[i], H[i]--;\n const int M = 300;\n vector<double> dp(M, INF);\n dp[0] = 0;\n rep(i, 0, N){\n vector<double> n_dp(M, INF);\n rep(a, 0, M) rep(b, 0, M) chmin(n_dp[b], f(a, b, H[i]) + dp[a]);\n swap(n_dp, dp);\n }\n cout << setprecision(20) << fixed << vec_min(dp) << \"\\n\";\n}","accuracy":1,"time_ms":30,"memory_kb":3572,"score_of_the_acc":-0.5197,"final_rank":6},{"submission_id":"aoj_3054_10282882","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n vector<ll> h(n);\n rep(i, 0, n)\n {\n cin >> h[i];\n }\n vector<vector<ld>> dp(n + 1, vector<ld>(301, inf));\n dp[0][1] = 0;\n rep(i, 0, n)\n {\n rep(j, 1, 301)\n {\n rep(k, 1, 301)\n {\n ld s = 0;\n ld x = abs(h[i] - j);\n ld y = abs(h[i] - k);\n if (j >= h[i] && k >= h[i])\n {\n s = (x + y) / 2.0;\n }\n else if (j <= h[i] && k <= h[i])\n {\n s = (x + y) / 2.0;\n }\n else\n {\n s = (x * x + y * y) / (x + y);\n s /= 2.0;\n }\n chmin(dp[i + 1][k], dp[i][j] + s);\n }\n }\n }\n ld ans = inf;\n rep(i, 1, 301)\n {\n chmin(ans, dp[n][i]);\n }\n cout << setprecision(15) << fixed << ans << Endl;\n}","accuracy":1,"time_ms":50,"memory_kb":4352,"score_of_the_acc":-1.75,"final_rank":19},{"submission_id":"aoj_3054_10282861","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n vector<ll> h(n);\n rep(i, 0, n)\n {\n cin >> h[i];\n }\n vector<vector<ld>> dp(n + 1, vector<ld>(200, inf));\n dp[0][1] = 0;\n rep(i, 0, n)\n {\n rep(j, 1, 200)\n {\n rep(k, 1, 200)\n {\n ld s = 0;\n ld x = abs(h[i] - j);\n ld y = abs(h[i] - k);\n if (j >= h[i] && k >= h[i])\n {\n s = (x + y) / 2.0;\n }\n else if (j <= h[i] && k <= h[i])\n {\n s = (x + y) / 2.0;\n }\n else\n {\n s = (x * x + y * y) / (x + y) / 2.0;\n }\n chmin(dp[i + 1][k], dp[i][j] + s);\n }\n }\n }\n ld ans = inf;\n rep(i, 1, 200)\n {\n chmin(ans, dp[n][i]);\n }\n cout << setprecision(15) << fixed << ans << Endl;\n}","accuracy":0.41818181818181815,"time_ms":20,"memory_kb":4096,"score_of_the_acc":-0.7603,"final_rank":20},{"submission_id":"aoj_3054_6218750","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nlong double H[160];\ndouble DP[160][310];\ndouble INF = 1e10;\n\ndouble f(double a, double b, double height) {\n double la = abs(a - height);\n double lb = abs(b - height);\n if ((a - height) * (b - height) >= 0) {\n return (la + lb) / 2;\n }\n\n double xa = la / (la + lb);\n double xb = lb / (la + lb);\n return (xa * la + xb * lb) / 2;\n}\n\nint main() {\n int n;\n \n cin >> n;\n for (int i = 0; i < n; ++i) {\n cin >> H[i];\n }\n for (int i = 0; i <= 300; ++i) {\n DP[0][i] = INF;\n }\n DP[0][1] = 0;\n\n for (int i = 0; i < n; ++i) {\n for (int before = 1; before <= 300; ++before) {\n DP[i + 1][before] = INF;\n }\n for (int before = 1; before <= 300; ++before) {\n for (int after = 1; after <= 300; ++after) {\n DP[i + 1][after] = min(DP[i + 1][after], DP[i][before] + f(before, after, H[i]));\n }\n }\n }\n\n double ans = INF;\n for (int i = 1; i <= 300; ++i) {\n ans = min(ans, DP[n][i]);\n }\n cout << ans << endl;\n\n return 0;\n\n}","accuracy":1,"time_ms":20,"memory_kb":3928,"score_of_the_acc":-0.603,"final_rank":8},{"submission_id":"aoj_3054_3659289","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\nstruct Precision{\n Precision(){\n cout<<fixed<<setprecision(12);\n }\n}precision_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n int n;\n cin>>n;\n vector<int> h(n);\n for(int i=0;i<n;i++) cin>>h[i];\n\n const int MAX = 400;\n vector<double> dp(MAX,1e15);\n dp[1]=0;\n for(int i=0;i<n;i++){ \n vector<double> nx(MAX,1e15);\n for(int j=1;j<MAX;j++){\n for(int k=1;k<MAX;k++){\n double di=0;\n if(h[i]<=j&&h[i]<=k) di=(j-h[i])+(k-h[i]);\n else if(j<=h[i]&&k<=h[i]) di=(h[i]-j)+(h[i]-k);\n else{\n int a=h[i]-min(j,k),b=max(j,k)-h[i];\n assert(a>0&&b>0);\n di=double(a*a+b*b)/(a+b);\n } \n chmin(nx[k],dp[j]+di/2.0); \n }\n } \n swap(dp,nx);\n }\n cout<<*min_element(dp.begin(),dp.end())<<endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3284,"score_of_the_acc":-0.5,"final_rank":5},{"submission_id":"aoj_3054_3646110","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 151\n\nint N;\ndouble dp[NUM][2*NUM];\nint height[NUM];\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%d\",&height[i]);\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tfor(int k = 0; k <= 300; k++){\n\t\t\tdp[i][k] = (double)BIG_NUM;\n\t\t}\n\t}\n\n\tdp[0][1] = 0;\n\n\tdouble A,B;\n\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int pre_h = 1; pre_h <= 300; pre_h += 1){\n\n\t\t\t//if(fabs(dp[i-1][pre_h]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int this_h = 1; this_h <= 300; this_h += 1){\n\n\t\t\t\tif(height[i] >= pre_h && height[i] >= this_h){\n\n\t\t\t\t\tA = (double)(height[i]-pre_h);\n\t\t\t\t\tB = (double)(height[i]-this_h);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\n\n\t\t\t\t}else if(height[i] >= pre_h && height[i] < this_h){\n\n\t\t\t\t\tA = (double)(height[i]-pre_h);\n\t\t\t\t\tB = (double)(this_h-height[i]);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\n\n\t\t\t\t}else if(height[i] < pre_h && height[i] < this_h){\n\n\t\t\t\t\tA = (double)(pre_h-height[i]);\n\t\t\t\t\tB = (double)(this_h-height[i]);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\n\n\t\t\t\t}else if(height[i] < pre_h && height[i] >= this_h){\n\n\t\t\t\t\tA = (double)(pre_h-height[i]);\n\t\t\t\t\tB = (double)(height[i]-this_h);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\n\tfor(int h = 1; h <= 300; h++){\n\n\t\tans = min(ans,dp[N][h]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3532,"score_of_the_acc":-0.9822,"final_rank":14},{"submission_id":"aoj_3054_3646109","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 151\n\nint N;\ndouble dp[NUM][2*NUM];\nint height[NUM];\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tscanf(\"%d\",&height[i]);\n\t}\n\n\tfor(int i = 0; i <= N; i++){\n\t\tfor(int k = 0; k <= 300; k++){\n\t\t\tdp[i][k] = (double)BIG_NUM;\n\t\t}\n\t}\n\n\tdp[0][1] = 0;\n\n\tdouble A,B;\n\n\tfor(int i = 1; i <= N; i++){\n\t\tfor(int pre_h = 1; pre_h <= 300; pre_h += 1){\n\n\t\t\tif(fabs(dp[i-1][pre_h]-BIG_NUM) < EPS)continue;\n\n\t\t\tfor(int this_h = 1; this_h <= 300; this_h += 1){\n\n\t\t\t\tif(height[i] >= pre_h && height[i] >= this_h){\n\n\t\t\t\t\tA = (double)(height[i]-pre_h);\n\t\t\t\t\tB = (double)(height[i]-this_h);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\n\n\t\t\t\t}else if(height[i] >= pre_h && height[i] < this_h){\n\n\t\t\t\t\tA = (double)(height[i]-pre_h);\n\t\t\t\t\tB = (double)(this_h-height[i]);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\n\n\t\t\t\t}else if(height[i] < pre_h && height[i] < this_h){\n\n\t\t\t\t\tA = (double)(pre_h-height[i]);\n\t\t\t\t\tB = (double)(this_h-height[i]);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\n\n\t\t\t\t}else if(height[i] < pre_h && height[i] >= this_h){\n\n\t\t\t\t\tA = (double)(pre_h-height[i]);\n\t\t\t\t\tB = (double)(height[i]-this_h);\n\n\t\t\t\t\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble ans = BIG_NUM;\n\n\tfor(int h = 1; h <= 300; h++){\n\n\t\tans = min(ans,dp[N][h]);\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3548,"score_of_the_acc":-0.9972,"final_rank":15},{"submission_id":"aoj_3054_3483497","code_snippet":"#include <bits/stdc++.h>\n#define ll long long\n#define INF (1LL << 60)\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 sar(a,n) cout<<#a<<\":\";rep(pachico,n)cout<<\" \"<<a[pachico];cout<<endl\n\nusing namespace std;\n\ntemplate<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<\"{\"<<p.fi<<\",\"<<p.se<<\"}\";}\ntemplate<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<\" \";return o;}\ntemplate<typename S,typename T,typename U>\nauto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<\" \",q.pop();return o;}\ntemplate<typename K,typename T>auto&operator<<(ostream&o,map<K,T>m){for(auto&e:m)o<<e<<\" \";return o;}\ntemplate<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<\" \";return o;}\nvoid ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<\" \";ashow(a...);}\n\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vi> vvi;\ntypedef vector<vl> vvl;\ntypedef vector<P> vp;\ntypedef vector<double> vd;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\ndouble dp[155][305];\ndouble h[155];\n\ndouble solve(double h, double l, double r)\n{\n if(l <= h){\n if(r > h){\n return ((r-h)*(r-h)+(h-l)*(h-l))/(2.0*(r-l));\n }else{\n return (2*h-r-l)/2.0;\n }\n }else{\n if(r > h){\n return (r+l-2*h)/2.0;\n }else{\n return ((l-h)*(l-h)+(h-r)*(h-r))/(2.0*(l-r));\n }\n }\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n rep(i,n){\n cin >> h[i];\n }\n rep(i,n+1){\n rep(j,305){\n dp[i][j] = INF;\n }\n }\n dp[0][1] = 0;\n rep(i,n){\n srep(j,1,305){\n srep(k,1,305){\n cmn(dp[i+1][k], dp[i][j]+solve(h[i],j,k));\n }\n }\n }\n printf(\"%.12lf\\n\", *min_element(dp[n]+1, dp[n]+305));\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3624,"score_of_the_acc":-0.8184,"final_rank":10},{"submission_id":"aoj_3054_3481588","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define r(i,n) for (int i=0; i < (n); i++)\n\n\ndouble dp[303][303];\nint n,h;\n\nint main(){\n r(i,303)r(j,303)dp[i][j]=1e15;\n cin>>n;\n dp[0][1]=0;\n for(int i=0;i<n;i++){\n cin>>h;\n for(int j=1;j<303;j++){\n if(dp[i][j]==1e15)continue;\n for(int k=0;k<303;k++){\n\n if(j==k){\n if(j!=h)dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+abs(h-j) );\n else dp[i+1][k] = min( dp[i+1][k] , dp[i][j] );\n }\n\n if(j<k){\n if(k<=h) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+h-k );\n else if(h<=j) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+j-h );\n else{\n double x=(double)(h-j)/(k-j);\n dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(x*(h-j))/2+(1.0-x)*(k-h)/2 );\n }\n }\n\n if(j>k){\n if(j<=h) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+h-j );\n else if(h<=k) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+k-h );\n else{\n double x=-(double)(h-j)/(j-k);\n dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(x*(j-h))/2+(1.0-x)*(h-k)/2 );\n }\n }\n\n }\n }\n }\n\n double ans = 1e15;\n r(i,302) ans=min(ans,dp[n][i+1]);\n printf(\"%.9f\\n\",ans);\n}","accuracy":1,"time_ms":30,"memory_kb":3948,"score_of_the_acc":-0.8717,"final_rank":11},{"submission_id":"aoj_3054_3424631","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\n#define chmin(a, b) ((a)=min((a), (b)))\n#define chmax(a, b) ((a)=max((a), (b)))\n#define fs first\n#define sc second\n#define eb emplace_back\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> T;\n\nconst ll MOD=1e9+7;\nconst ll INF=1e18;\nconst double pi=acos(-1);\nconst double eps=1e-10;\n\nint dx[]={1, -1, 0, 0, 1, 1, -1, -1};\nint dy[]={0, 0, 1, -1, 1, -1, -1, 1};\n\ndouble calc(int lh, int rh, int h){\n double LH=abs(h-lh), RH=abs(h-rh);\n double S;\n \n // tow triangles\n if((h-lh>0 && h-rh<0) || (h-lh<0 && h-rh>0)){\n S=(LH/(LH+RH))*LH/2+(RH/(LH+RH))*RH/2;\n }\n else{\n S=(LH+RH)/2;\n }\n\n return S;\n}\n\nint main(){\n int n; cin>>n;\n vector<int> h(n);\n for(int i=0; i<n; i++) cin>>h[i];\n\n vector<vector<double>> dp(n+10, vector<double>(310, INF));\n for(int i=0; i<=300; i++){\n dp[1][i]=calc(1, i, h[0]);\n }\n\n for(int i=1; i<n; i++){\n for(int j=1; j<300; j++){ // left height\n for(int k=1; k<300; k++){ // right height\n dp[i+1][k]=min(dp[i+1][k], dp[i][j]+calc(j, k, h[i]));\n }\n }\n }\n\n double ans=INF;\n for(int i=1; i<300; i++){\n chmin(ans, dp[n][i]);\n }\n\n cout << fixed << setprecision(10) << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3460,"score_of_the_acc":-1.1648,"final_rank":18},{"submission_id":"aoj_3054_3424601","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef long double ld;\nconst int INF=1e9,MOD=1e9+7;\nconst ll LINF=1e18;\nusing namespace std;\n#define int long long\n//template\ndouble dp[300][300];\ndouble frac(double h,double j,double k){\n if(h<=j&&h<=k)return (j+k)/2-h;\n else if(h>=j&&h>=k) return h-(j+k)/2;\n else if(h<j&&k<h){\n double x=j-h,y=h-k;\n return (x*x+y*y)/((x+y)*2);\n }\n else{\n double x=h-j,y=k-h;\n return (x*x+y*y)/((x+y)*2);\n }\n}\n//main\nsigned main(){\n int N;cin>>N;\n std::vector<int> v(N);\n for(int i=0;i<N;i++)cin>>v[i];\n for(int i=0;i<300;i++)for(int j=0;j<300;j++)dp[i][j]=INF;\n dp[0][1]=0;\n for(int i=1;i<=N;i++){\n for(int j=1;j<300;j++){\n for(int k=1;k<300;k++){\n dp[i][j]=min(dp[i][j],dp[i-1][k]+frac(v[i-1],j,k));\n }\n }\n }\n double ans=INF;\n for(int i=0;i<300;i++)ans=min(ans,dp[N][i]);\n cout<<fixed<<setprecision(12)<<ans<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":4008,"score_of_the_acc":-0.9279,"final_rank":12},{"submission_id":"aoj_3054_3424384","code_snippet":"#include<iostream>\n#include<string>\n#include<iomanip>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(int i = 0; i < (n); i++)\n#define INF ((long long)1e18)\n#define MOD ((int)1e9+7)\n#define endl \"\\n\"\n\n#define yn(f) ((f)?\"Yes\":\"No\")\n#define YN(f) ((f)?\"YES\":\"NO\")\n\n#define MAX_N 200\n#define MAX_H 400\n\ndouble dp[MAX_N][MAX_H];\n\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\t\n\tint n, h[MAX_N];\n\tdouble ans = INF;\n\t\n\tcin>>n;\n\t\n\tfor(int i = 1; i <= n; i++){\n\t\tcin>>h[i];\n\t}\n\t\n\tdp[0][1] = 0;\n\t\n\tfor(int i = 1; i <= n; i++){\n\t\tfor(int j = 0; j < MAX_H; j++){\n\t\t\tdp[i][j] = INF;\n\t\t}\n\t\tfor(int j = 1; j < MAX_H; j++){\n\t\t\tif(i == 1 && j != 1) continue;\n\t\t\tfor(int k = 1; k < MAX_H; k++){\n\t\t\t\tdouble S;\n\t\t\t\tif((h[i]-j)*(h[i]-k) >= 0) S = (fabs(h[i]-k)+fabs(h[i]-j))/2.0;\n\t\t\t\telse S = (((double)h[i]-j)*(h[i]-j)+(double)(h[i]-k)*(h[i]-k))/(2.0*fabs(j-k));\n\t\t\t\tdp[i][k] = min(dp[i-1][j]+S,dp[i][k]);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\n\tfor(int i = 0; i < MAX_H; i++){\n\t\tans = min(dp[n][i],ans);\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3764,"score_of_the_acc":-0.9494,"final_rank":13},{"submission_id":"aoj_3054_3416152","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nlong double h[160];\ndouble dp[160][305];\n\ndouble f(double a, double b, double height) {\n double da = abs(a - height);\n double db = abs(b - height);\n if((a - height) * (b-height) >= 0) {\n return (da + db) / 2.0;\n }\n double xa = da / (da + db);\n double xb = db / (da + db);\n return (xa * da + xb * db) / 2.0;\n}\n\nint main() {\n int n;\n cin >> n;\n for(int i = 1;i <= n; i++) {\n cin >> h[i];\n }\n for(int i = 0; i <= 300; i++) {\n dp[0][i] = 1e9;\n }\n dp[0][1] = 0;\n for(int i = 1; i <= n; i++) {\n for(int after = 1; after <= 300; after++) {\n dp[i][after] = 1e9;\n }\n for(int before = 1; before <= 300; before++) {\n for(int after = 1; after <= 300; after++) {\n //cout << before << \" \" << after << \" \" << h[i] << \" \" << f(before, after, h[i]) << endl;\n dp[i][after] = min(dp[i][after], dp[i-1][before] + f(before, after, h[i]));\n }\n }\n }\n double ans = 1e9;\n for(int i = 1; i <= 300; i++) {\n ans = min(ans, dp[n][i]);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3648,"score_of_the_acc":-1.0908,"final_rank":17},{"submission_id":"aoj_3054_3415123","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <string>\n#include <tuple>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n\nconst int INF = 0x3f3f3f3f, MOD = 1000000007;\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\n/*-----------------------------------------*/\nint main() {\n // freopen(\"input.txt\", \"r\", stdin);\n\n int n; cin >> n;\n vector<int> h(n); REP(i, n) cin >> h[i];\n vector<vector<double> > dp(n, vector<double>(301, INF));\n FOR(j, 1, h[0] + 1) {\n int da = h[0] - 1, eb = h[0] - j;\n dp[0][j] = (da + eb) / 2.0;\n }\n FOR(j, h[0] + 1, 301) {\n int da = h[0] - 1, be = j - h[0];\n dp[0][j] = (da * da + be * be) / (2.0 * (da + be));\n }\n FOR(i, 1, n) {\n FOR(j, 1, h[i] + 1) {\n int eb = h[i] - j;\n FOR(k, 1, h[i] + 1) {\n int da = h[i] - k;\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (da + eb) / 2.0);\n }\n FOR(k, h[i] + 1, 301) {\n int ad = k - h[i];\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (ad * ad + eb * eb) / (2.0 * (ad + eb)));\n }\n }\n FOR(j, h[i] + 1, 301) {\n int be = j - h[i];\n FOR(k, 1, h[i] + 1) {\n int da = h[i] - k;\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (da * da + be * be) / (2.0 * (da + be)));\n }\n FOR(k, h[i] + 1, 301) {\n int ad = k - h[i];\n dp[i][j] = min(dp[i][j], dp[i][k] + (ad + be) / 2.0);\n }\n }\n }\n double ans = INF;\n FOR(j, 1, 301) ans = min(ans, dp[n - 1][j]);\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3376,"score_of_the_acc":-0.0861,"final_rank":1},{"submission_id":"aoj_3054_3415089","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n\n// h_iと、そのときの左のyと右のyを渡すと面積が返ってくる\ndouble calc(int h, int y1, int y2) {\n if (y1 > h and y2 > h) {\n return fabs(0.5 * (y1 - h + y2 - h));\n }\n if (y1 <= h and y2 <= h) {\n return fabs(0.5 * (h - y1 + h - y2));\n }\n if (y1 <= h and h > y2) {\n double x = 1.0 * (h - y1) / (y2 - y1);\n return fabs(0.5 * ( x * (h - y1) + (1 - x) * (h - y2)));\n } else {\n double x = 1.0 * (h - y1) / (y2 - y1);\n return fabs(0.5 * ( x * (y1 - h) + (1 - x) * (h - y2) ));\n }\n\n}\n\nconst double INF = 1e18;\ndouble dp[155][333];\n\nsigned main() {\n int n;\n cin >> n;\n vector<int> h(n);\n for (int i = 0; i < n; i++) {\n cin >> h[i];\n }\n\n // DPテーブルを初期化\n for (int i = 0; i <= n; i++) {\n for (int y = 1; y <= 300; y++) {\n dp[i][y] = INF;\n }\n }\n dp[0][1] = 0;\n\n // DP\n for (int i = 0; i < n; i++) {\n for (int y1 = 1; y1 <= 300; y1++) { // 左のy\n for (int y2 = 1; y2 <= 300; y2++) { // 右のy\n chmin(dp[i+1][y2], dp[i][y1] + calc(h[i], y1, y2));\n }\n }\n }\n\n // 最後のyはどれが最適化を選ぶ\n double ans = 1e18;\n for (int i = 1; i <= 300; i++) {\n chmin(ans, dp[n][i]);\n }\n\n printf(\"%.10f\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3596,"score_of_the_acc":-0.5421,"final_rank":7},{"submission_id":"aoj_3054_3415052","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\nconst double INF = 1LL<<60;\n\ndouble calc(double cur, double next, double h) {\n if ((cur-h) * (next-h) >= 0) {\n return (abs(cur-h) + abs(next-h)) / 2;\n }\n else {\n double a = abs(cur - h), b = abs(next - h);\n return (a*a + b*b) / (a + b) / 2;\n }\n}\n\nint main() {\n int N; cin >> N;\n vector<double> H(N);\n for (int i = 0; i < N; ++i) cin >> H[i];\n\n vector<vector<double> > dp(N+1, vector<double>(300, INF));\n dp[0][1] = 0;\n for (int i = 0; i < N; ++i) {\n for (int h = 1; h < 300; ++h) {\n for (int h2 = 1; h2 < 300; ++h2) {\n dp[i+1][h2] = min(dp[i+1][h2], dp[i][h] + calc(h, h2, H[i]));\n }\n }\n }\n double res = INF;\n for (int h = 1; h < 300; ++h) res = min(res, dp[N][h]);\n cout << fixed << setprecision(10) << res << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3384,"score_of_the_acc":-0.3436,"final_rank":2},{"submission_id":"aoj_3054_3415003","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define vvi vector<vector<int>>\n#define vec vector\n#define pq priority_queue\n#define all(v) (v).begin(), (v).end()\n#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());\n#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))\n#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))\n#define dbg(x) cerr << #x << \": \" << x << endl;\n#define dbg2(x, y) cerr<<\"(\"<<#x<<\", \"<<#y<<\") = \"<<\"(\"<<x<<\", \"<<y<<\")\"<<endl;\n#define dbg3(x, y, z) cerr<<\"(\"<<#x<<\", \"<<#y<<\", \"<<#z<<\") = \"<<\"(\"<<x<<\", \"<<y<<\", \"<<z<<\")\"<<endl;\n#define dbgB(value, size) cerr<<#value<<\": \"<<bitset<size>(value) << endl;\n#define line() cerr << \"---------------\" << endl;\n\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, -1, 1};\nconst double PI = 3.14159265358979323846;\n\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n\ntemplate<typename T>\nvoid print1(T begin, T end) {\n while (begin != end) {\n cout << (*begin) << \" \";\n *begin++;\n }\n cout << endl;\n}\n\ntemplate<typename T>\nvoid print2(T Array, int height, int width) {\n for (int i = 0; i < height; i++) {\n for (int j = 0; j < width; j++) {\n cout << \" \" << Array[i][j];\n }\n cout << endl;\n }\n}\n\nvoid print() { std::cerr << endl; }\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n std::cerr << head << \" \";\n print(std::forward<Tail>(tail)...);\n}\n\ntemplate<class T>\nvoid Add(T &a, const T &b, const T &mod=1000000007) {\n int val = ((a % mod) + (b % mod)) % mod;\n if (val < 0) { val += mod; }\n a = val;\n}\n\ntemplate <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }\ntemplate <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }\n\n// ------------------------------------------------------------------------------------------\n\n\ndouble calc(int h, int y1, int y2) {\n if (y1 > h and y2 > h) {\n return fabs(0.5 * (y1 - h + y2 - h));\n }\n if (y1 <= h and y2 <= h) {\n return fabs(0.5 * (h - y1 + h - y2));\n }\n if (y1 <= h and h > y2) {\n double x = 1.0 * (h - y1) / (y2 - y1);\n return fabs(0.5 * ( x * (h - y1) + (1 - x) * (h - y2)));\n } else {\n double x = 1.0 * (h - y1) / (y2 - y1);\n return fabs(0.5 * ( x * (y1 - h) + (1 - x) * (h - y2) ));\n }\n\n}\n\nconst double INF = 1e18;\ndouble dp[155][333];\n\nsigned main() {\n int n;\n cin >> n;\n vec<int> h(n);\n for (int i = 0; i < n; i++) {\n cin >> h[i];\n }\n\n // 初期化\n for (int i = 0; i <= n; i++) {\n for (int y = 1; y <= 300; y++) {\n dp[i][y] = INF;\n }\n }\n dp[0][1] = 0;\n\n // DP\n for (int i = 0; i < n; i++) {\n for (int y1 = 1; y1 <= 300; y1++) {\n for (int y2 = 1; y2 <= 300; y2++) {\n chmin(dp[i+1][y2], dp[i][y1] + calc(h[i], y1, y2));\n }\n }\n }\n\n double ans = 1e18;\n for (int i = 1; i <= 300; i++) {\n chmin(ans, dp[n][i]);\n }\n\n // cout << ans << endl;\n printf(\"%.10f\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3548,"score_of_the_acc":-0.4972,"final_rank":4},{"submission_id":"aoj_3054_3414860","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#ifdef _DEBUG\n#include \"dump.hpp\"\n#else\n#define dump(...)\n#endif\n\n//#define int long long\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define all(c) begin(c),end(c)\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = 1'000'000'007;\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\n\nsigned main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout << fixed << setprecision(10);\n\tint n; cin >> n;\n\tvector<int> h(n); rep(i, 0, n) {\n\t\tcin >> h[i];\n\t}\n\tvector<int> y(n + 1);\n\ty[0] = 1;\n\n\trep(i, 0, n) {\n\t\ty[i + 1] = h[i];\n\t}\n\n\tint m = *max_element(all(h)) * 2;\n\n\tvector<vector<double>> dp(n + 1, vector<double>(m, INF));\n\n\tdp[0][1] = 0;\n\n\trep(i, 0, n) {\n\t\trep(j, 1, m) {\n\t\t\trep(k, 1, m) {\n\t\t\t\tdouble a = h[i] - j;\n\t\t\t\tdouble b = h[i] - k;\n\t\t\t\tif (a*b < 0) {\n\t\t\t\t\ta = abs(a), b = abs(b);\n\t\t\t\t\tdouble add = (a * a + b * b) / (a + b) / 2;\n\t\t\t\t\tchmin(dp[i + 1][k], dp[i][j] + add);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ta = abs(a), b = abs(b);\n\t\t\t\t\tchmin(dp[i + 1][k], dp[i][j] + (a + b) / 2);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\tdump(dp);\n\n\tcout << *min_element(all(dp[n])) << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3400,"score_of_the_acc":-0.3586,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_3054_10892772\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nvoid solve(){\\n ll N; cin >> N;\\n vl a(N); rep(i, N) cin >> a[i];\\n auto area = [&](ll l, ll r, ll h)->ld{\\n if(max(l, r) <= h){\\n return (h * 2 - l - r) / 2.0;\\n }\\n if(min(l, r) >= h){\\n return (l + r - h * 2) / 2.0;\\n }\\n ld re = (h - min(l, r)) * (h - min(l, r)) + (max(l, r) - h) * (max(l, r) - h);\\n re /= 2 * abs(l - r);\\n return re;\\n };\\n ll H = 301;\\n vv<ld> dp(N+1, vec<ld>(H, 4e18)); dp[0][1] = 0.0;\\n rep(i, N){\\n reps(l, 1, H){\\n reps(r, 1, H){\\n chmin(dp[i+1][r], dp[i][l] + area(l, r, a[i]));\\n }\\n }\\n }\\n cout << *min_element(all(dp[N])) << endl;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": -0.7931,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3054_10892680\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\n#define rep(i,n) for(ll i=0;i<n;++i)\\n#define all(a) (a).begin(),(a).end()\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &a){\\n if (a.empty()) return os;\\n os << a.front();\\n for (auto e : a | views::drop(1)){\\n os << ' ' << e;\\n }\\n return os;\\n}\\n\\nvoid dump(auto ...vs){\\n ((cout << vs << ' '), ...) << endl;\\n}\\n\\n\\n\\nvoid solve() {\\n ll N;\\n cin>>N;\\n vector<ll> H(N);\\n rep(i,N)cin>>H[i];\\n ll hmax=400;\\n vector<ld> dp(hmax,1e18);\\n dp[1]=0;\\n rep(t,N){\\n vector<ld> ndp(hmax,1e18);\\n ll h=H[t];\\n rep(i,hmax){\\n if (i==0)continue;\\n rep(j,hmax){\\n if (j==0)continue;\\n if (i<=h){\\n if (j<=h){\\n chmin(ndp[j],dp[i]+h-ld(i+j)/2);\\n }\\n else{\\n ll di=h-i;\\n ll dj=j-h;\\n chmin(ndp[j],dp[i]+ld(di*di+dj*dj)/(2*(j-i)));\\n }\\n }\\n else{\\n if (j>h){\\n chmin(ndp[j],dp[i]+ld(i+j)/2-h);\\n }\\n else{\\n ll di=i-h;\\n ll dj=h-j;\\n chmin(ndp[j],dp[i]+ld(di*di+dj*dj)/(2*(i-j)));\\n }\\n }\\n }\\n }\\n swap(dp,ndp);\\n }\\n cout<<*min_element(all(dp))<<endl;\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n ll T=1;\\n while (T--){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.0206,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3054_10891055\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n auto f = [&](int a, int b, int h) -> double {\\n if (a > b) swap(a, b);\\n if (b <= h || h <= a) return (double(abs(a - h) + abs(b - h))) / 2;\\n double p = (double)(h - a) / (double)(b - a);\\n return (p * (h - a) + (1 - p) * (b - h)) / 2;\\n };\\n int N;\\n cin >> N;\\n vector<int> H(N);\\n rep(i, 0, N) cin >> H[i], H[i]--;\\n const int M = 300;\\n vector<double> dp(M, INF);\\n dp[0] = 0;\\n rep(i, 0, N){\\n vector<double> n_dp(M, INF);\\n rep(a, 0, M) rep(b, 0, M) chmin(n_dp[b], f(a, b, H[i]) + dp[a]);\\n swap(n_dp, dp);\\n }\\n cout << setprecision(20) << fixed << vec_min(dp) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.5197,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3054_10282882\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\\n#define Endl endl\\n#define all(a) a.begin(), a.end()\\n#define pr(i, j) make_pair(i, j)\\n#define isin(x, l, r) (l <= x && x < r)\\n#define chmin(a, b) a = min(a, b)\\n#define chmax(a, b) a = max(a, b)\\n#define srt(ar) sort(ar.begin(), ar.end())\\n#define rev(ar) reverse(ar.begin(), ar.end())\\n#define jge(f, s, t) cout << (f ? s : t) << endl\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define printar(ar) \\\\\\n do \\\\\\n { \\\\\\n for (auto dbg : ar) \\\\\\n { \\\\\\n cout << dbg << \\\" \\\"; \\\\\\n } \\\\\\n cout << endl; \\\\\\n } while (0)\\nconst ll inf = 1e18;\\nconst ld pi = 3.14159265358979;\\nconst ld eps = 1e-9;\\ntemplate <class T, ll n, ll idx = 0>\\nauto make_vec(const ll (&d)[n], const T &init) noexcept\\n{\\n if constexpr (idx < n)\\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else\\n return init;\\n}\\n\\ntemplate <class T, ll n>\\nauto make_vec(const ll (&d)[n]) noexcept\\n{\\n return make_vec(d, T{});\\n}\\n//////////////// 以下を貼る ////////////////\\ntemplate <class T>\\nsize_t HashCombine(const size_t seed, const T &v)\\n{\\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\\n}\\n/* pair用 */\\ntemplate <class T, class S>\\nstruct std::hash<std::pair<T, S>>\\n{\\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\\n {\\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\\n }\\n};\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n ll n;\\n cin >> n;\\n vector<ll> h(n);\\n rep(i, 0, n)\\n {\\n cin >> h[i];\\n }\\n vector<vector<ld>> dp(n + 1, vector<ld>(301, inf));\\n dp[0][1] = 0;\\n rep(i, 0, n)\\n {\\n rep(j, 1, 301)\\n {\\n rep(k, 1, 301)\\n {\\n ld s = 0;\\n ld x = abs(h[i] - j);\\n ld y = abs(h[i] - k);\\n if (j >= h[i] && k >= h[i])\\n {\\n s = (x + y) / 2.0;\\n }\\n else if (j <= h[i] && k <= h[i])\\n {\\n s = (x + y) / 2.0;\\n }\\n else\\n {\\n s = (x * x + y * y) / (x + y);\\n s /= 2.0;\\n }\\n chmin(dp[i + 1][k], dp[i][j] + s);\\n }\\n }\\n }\\n ld ans = inf;\\n rep(i, 1, 301)\\n {\\n chmin(ans, dp[n][i]);\\n }\\n cout << setprecision(15) << fixed << ans << Endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -1.75,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3054_10282861\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\\n#define Endl endl\\n#define all(a) a.begin(), a.end()\\n#define pr(i, j) make_pair(i, j)\\n#define isin(x, l, r) (l <= x && x < r)\\n#define chmin(a, b) a = min(a, b)\\n#define chmax(a, b) a = max(a, b)\\n#define srt(ar) sort(ar.begin(), ar.end())\\n#define rev(ar) reverse(ar.begin(), ar.end())\\n#define jge(f, s, t) cout << (f ? s : t) << endl\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define printar(ar) \\\\\\n do \\\\\\n { \\\\\\n for (auto dbg : ar) \\\\\\n { \\\\\\n cout << dbg << \\\" \\\"; \\\\\\n } \\\\\\n cout << endl; \\\\\\n } while (0)\\nconst ll inf = 1e18;\\nconst ld pi = 3.14159265358979;\\nconst ld eps = 1e-9;\\ntemplate <class T, ll n, ll idx = 0>\\nauto make_vec(const ll (&d)[n], const T &init) noexcept\\n{\\n if constexpr (idx < n)\\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else\\n return init;\\n}\\n\\ntemplate <class T, ll n>\\nauto make_vec(const ll (&d)[n]) noexcept\\n{\\n return make_vec(d, T{});\\n}\\n//////////////// 以下を貼る ////////////////\\ntemplate <class T>\\nsize_t HashCombine(const size_t seed, const T &v)\\n{\\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\\n}\\n/* pair用 */\\ntemplate <class T, class S>\\nstruct std::hash<std::pair<T, S>>\\n{\\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\\n {\\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\\n }\\n};\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n ll n;\\n cin >> n;\\n vector<ll> h(n);\\n rep(i, 0, n)\\n {\\n cin >> h[i];\\n }\\n vector<vector<ld>> dp(n + 1, vector<ld>(200, inf));\\n dp[0][1] = 0;\\n rep(i, 0, n)\\n {\\n rep(j, 1, 200)\\n {\\n rep(k, 1, 200)\\n {\\n ld s = 0;\\n ld x = abs(h[i] - j);\\n ld y = abs(h[i] - k);\\n if (j >= h[i] && k >= h[i])\\n {\\n s = (x + y) / 2.0;\\n }\\n else if (j <= h[i] && k <= h[i])\\n {\\n s = (x + y) / 2.0;\\n }\\n else\\n {\\n s = (x * x + y * y) / (x + y) / 2.0;\\n }\\n chmin(dp[i + 1][k], dp[i][j] + s);\\n }\\n }\\n }\\n ld ans = inf;\\n rep(i, 1, 200)\\n {\\n chmin(ans, dp[n][i]);\\n }\\n cout << setprecision(15) << fixed << ans << Endl;\\n}\",\n \"accuracy\": 0.41818181818181815,\n \"time_ms\": 20,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.7603,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3054_6218750\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nlong double H[160];\\ndouble DP[160][310];\\ndouble INF = 1e10;\\n\\ndouble f(double a, double b, double height) {\\n double la = abs(a - height);\\n double lb = abs(b - height);\\n if ((a - height) * (b - height) >= 0) {\\n return (la + lb) / 2;\\n }\\n\\n double xa = la / (la + lb);\\n double xb = lb / (la + lb);\\n return (xa * la + xb * lb) / 2;\\n}\\n\\nint main() {\\n int n;\\n \\n cin >> n;\\n for (int i = 0; i < n; ++i) {\\n cin >> H[i];\\n }\\n for (int i = 0; i <= 300; ++i) {\\n DP[0][i] = INF;\\n }\\n DP[0][1] = 0;\\n\\n for (int i = 0; i < n; ++i) {\\n for (int before = 1; before <= 300; ++before) {\\n DP[i + 1][before] = INF;\\n }\\n for (int before = 1; before <= 300; ++before) {\\n for (int after = 1; after <= 300; ++after) {\\n DP[i + 1][after] = min(DP[i + 1][after], DP[i][before] + f(before, after, H[i]));\\n }\\n }\\n }\\n\\n double ans = INF;\\n for (int i = 1; i <= 300; ++i) {\\n ans = min(ans, DP[n][i]);\\n }\\n cout << ans << endl;\\n\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.603,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3054_3659289\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n\\nstruct Precision{\\n Precision(){\\n cout<<fixed<<setprecision(12);\\n }\\n}precision_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n;\\n cin>>n;\\n vector<int> h(n);\\n for(int i=0;i<n;i++) cin>>h[i];\\n\\n const int MAX = 400;\\n vector<double> dp(MAX,1e15);\\n dp[1]=0;\\n for(int i=0;i<n;i++){ \\n vector<double> nx(MAX,1e15);\\n for(int j=1;j<MAX;j++){\\n for(int k=1;k<MAX;k++){\\n double di=0;\\n if(h[i]<=j&&h[i]<=k) di=(j-h[i])+(k-h[i]);\\n else if(j<=h[i]&&k<=h[i]) di=(h[i]-j)+(h[i]-k);\\n else{\\n int a=h[i]-min(j,k),b=max(j,k)-h[i];\\n assert(a>0&&b>0);\\n di=double(a*a+b*b)/(a+b);\\n } \\n chmin(nx[k],dp[j]+di/2.0); \\n }\\n } \\n swap(dp,nx);\\n }\\n cout<<*min_element(dp.begin(),dp.end())<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3054_3646110\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 151\\n\\nint N;\\ndouble dp[NUM][2*NUM];\\nint height[NUM];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&height[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\t\\tfor(int k = 0; k <= 300; k++){\\n\\t\\t\\tdp[i][k] = (double)BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp[0][1] = 0;\\n\\n\\tdouble A,B;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int pre_h = 1; pre_h <= 300; pre_h += 1){\\n\\n\\t\\t\\t//if(fabs(dp[i-1][pre_h]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int this_h = 1; this_h <= 300; this_h += 1){\\n\\n\\t\\t\\t\\tif(height[i] >= pre_h && height[i] >= this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(height[i]-pre_h);\\n\\t\\t\\t\\t\\tB = (double)(height[i]-this_h);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\\n\\n\\t\\t\\t\\t}else if(height[i] >= pre_h && height[i] < this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(height[i]-pre_h);\\n\\t\\t\\t\\t\\tB = (double)(this_h-height[i]);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\\n\\n\\t\\t\\t\\t}else if(height[i] < pre_h && height[i] < this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(pre_h-height[i]);\\n\\t\\t\\t\\t\\tB = (double)(this_h-height[i]);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\\n\\n\\t\\t\\t\\t}else if(height[i] < pre_h && height[i] >= this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(pre_h-height[i]);\\n\\t\\t\\t\\t\\tB = (double)(height[i]-this_h);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\n\\tfor(int h = 1; h <= 300; h++){\\n\\n\\t\\tans = min(ans,dp[N][h]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.9822,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3054_3646109\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 151\\n\\nint N;\\ndouble dp[NUM][2*NUM];\\nint height[NUM];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&height[i]);\\n\\t}\\n\\n\\tfor(int i = 0; i <= N; i++){\\n\\t\\tfor(int k = 0; k <= 300; k++){\\n\\t\\t\\tdp[i][k] = (double)BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tdp[0][1] = 0;\\n\\n\\tdouble A,B;\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tfor(int pre_h = 1; pre_h <= 300; pre_h += 1){\\n\\n\\t\\t\\tif(fabs(dp[i-1][pre_h]-BIG_NUM) < EPS)continue;\\n\\n\\t\\t\\tfor(int this_h = 1; this_h <= 300; this_h += 1){\\n\\n\\t\\t\\t\\tif(height[i] >= pre_h && height[i] >= this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(height[i]-pre_h);\\n\\t\\t\\t\\t\\tB = (double)(height[i]-this_h);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\\n\\n\\t\\t\\t\\t}else if(height[i] >= pre_h && height[i] < this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(height[i]-pre_h);\\n\\t\\t\\t\\t\\tB = (double)(this_h-height[i]);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\\n\\n\\t\\t\\t\\t}else if(height[i] < pre_h && height[i] < this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(pre_h-height[i]);\\n\\t\\t\\t\\t\\tB = (double)(this_h-height[i]);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+(A+B)/2.0);\\n\\n\\t\\t\\t\\t}else if(height[i] < pre_h && height[i] >= this_h){\\n\\n\\t\\t\\t\\t\\tA = (double)(pre_h-height[i]);\\n\\t\\t\\t\\t\\tB = (double)(height[i]-this_h);\\n\\n\\t\\t\\t\\t\\tdp[i][this_h] = min(dp[i][this_h],dp[i-1][pre_h]+A*(A/(A+B))/2+B*(B/(A+B))/2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdouble ans = BIG_NUM;\\n\\n\\tfor(int h = 1; h <= 300; h++){\\n\\n\\t\\tans = min(ans,dp[N][h]);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.9972,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3054_3483497\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define ll long long\\n#define INF (1LL << 60)\\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 sar(a,n) cout<<#a<<\\\":\\\";rep(pachico,n)cout<<\\\" \\\"<<a[pachico];cout<<endl\\n\\nusing namespace std;\\n\\ntemplate<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<\\\"{\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\"}\\\";}\\ntemplate<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<\\\" \\\";return o;}\\ntemplate<typename S,typename T,typename U>\\nauto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<\\\" \\\",q.pop();return o;}\\ntemplate<typename K,typename T>auto&operator<<(ostream&o,map<K,T>m){for(auto&e:m)o<<e<<\\\" \\\";return o;}\\ntemplate<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<\\\" \\\";return o;}\\nvoid ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<\\\" \\\";ashow(a...);}\\n\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<vi> vvi;\\ntypedef vector<vl> vvl;\\ntypedef vector<P> vp;\\ntypedef vector<double> vd;\\ntypedef vector<string> vs;\\n\\nconst int MAX_N = 100005;\\n\\ndouble dp[155][305];\\ndouble h[155];\\n\\ndouble solve(double h, double l, double r)\\n{\\n if(l <= h){\\n if(r > h){\\n return ((r-h)*(r-h)+(h-l)*(h-l))/(2.0*(r-l));\\n }else{\\n return (2*h-r-l)/2.0;\\n }\\n }else{\\n if(r > h){\\n return (r+l-2*h)/2.0;\\n }else{\\n return ((l-h)*(l-h)+(h-r)*(h-r))/(2.0*(l-r));\\n }\\n }\\n}\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n rep(i,n){\\n cin >> h[i];\\n }\\n rep(i,n+1){\\n rep(j,305){\\n dp[i][j] = INF;\\n }\\n }\\n dp[0][1] = 0;\\n rep(i,n){\\n srep(j,1,305){\\n srep(k,1,305){\\n cmn(dp[i+1][k], dp[i][j]+solve(h[i],j,k));\\n }\\n }\\n }\\n printf(\\\"%.12lf\\\\n\\\", *min_element(dp[n]+1, dp[n]+305));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.8184,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3054_3481588\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define r(i,n) for (int i=0; i < (n); i++)\\n\\n\\ndouble dp[303][303];\\nint n,h;\\n\\nint main(){\\n r(i,303)r(j,303)dp[i][j]=1e15;\\n cin>>n;\\n dp[0][1]=0;\\n for(int i=0;i<n;i++){\\n cin>>h;\\n for(int j=1;j<303;j++){\\n if(dp[i][j]==1e15)continue;\\n for(int k=0;k<303;k++){\\n\\n if(j==k){\\n if(j!=h)dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+abs(h-j) );\\n else dp[i+1][k] = min( dp[i+1][k] , dp[i][j] );\\n }\\n\\n if(j<k){\\n if(k<=h) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+h-k );\\n else if(h<=j) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+j-h );\\n else{\\n double x=(double)(h-j)/(k-j);\\n dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(x*(h-j))/2+(1.0-x)*(k-h)/2 );\\n }\\n }\\n\\n if(j>k){\\n if(j<=h) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+h-j );\\n else if(h<=k) dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(double)abs(k-j)/2+k-h );\\n else{\\n double x=-(double)(h-j)/(j-k);\\n dp[i+1][k] = min( dp[i+1][k] , dp[i][j]+(x*(j-h))/2+(1.0-x)*(h-k)/2 );\\n }\\n }\\n\\n }\\n }\\n }\\n\\n double ans = 1e15;\\n r(i,302) ans=min(ans,dp[n][i+1]);\\n printf(\\\"%.9f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3948,\n \"score_of_the_acc\": -0.8717,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3054_3424631\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\n#define chmin(a, b) ((a)=min((a), (b)))\\n#define chmax(a, b) ((a)=max((a), (b)))\\n#define fs first\\n#define sc second\\n#define eb emplace_back\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef tuple<int, int, int> T;\\n\\nconst ll MOD=1e9+7;\\nconst ll INF=1e18;\\nconst double pi=acos(-1);\\nconst double eps=1e-10;\\n\\nint dx[]={1, -1, 0, 0, 1, 1, -1, -1};\\nint dy[]={0, 0, 1, -1, 1, -1, -1, 1};\\n\\ndouble calc(int lh, int rh, int h){\\n double LH=abs(h-lh), RH=abs(h-rh);\\n double S;\\n \\n // tow triangles\\n if((h-lh>0 && h-rh<0) || (h-lh<0 && h-rh>0)){\\n S=(LH/(LH+RH))*LH/2+(RH/(LH+RH))*RH/2;\\n }\\n else{\\n S=(LH+RH)/2;\\n }\\n\\n return S;\\n}\\n\\nint main(){\\n int n; cin>>n;\\n vector<int> h(n);\\n for(int i=0; i<n; i++) cin>>h[i];\\n\\n vector<vector<double>> dp(n+10, vector<double>(310, INF));\\n for(int i=0; i<=300; i++){\\n dp[1][i]=calc(1, i, h[0]);\\n }\\n\\n for(int i=1; i<n; i++){\\n for(int j=1; j<300; j++){ // left height\\n for(int k=1; k<300; k++){ // right height\\n dp[i+1][k]=min(dp[i+1][k], dp[i][j]+calc(j, k, h[i]));\\n }\\n }\\n }\\n\\n double ans=INF;\\n for(int i=1; i<300; i++){\\n chmin(ans, dp[n][i]);\\n }\\n\\n cout << fixed << setprecision(10) << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -1.1648,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3054_3424601\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef long double ld;\\nconst int INF=1e9,MOD=1e9+7;\\nconst ll LINF=1e18;\\nusing namespace std;\\n#define int long long\\n//template\\ndouble dp[300][300];\\ndouble frac(double h,double j,double k){\\n if(h<=j&&h<=k)return (j+k)/2-h;\\n else if(h>=j&&h>=k) return h-(j+k)/2;\\n else if(h<j&&k<h){\\n double x=j-h,y=h-k;\\n return (x*x+y*y)/((x+y)*2);\\n }\\n else{\\n double x=h-j,y=k-h;\\n return (x*x+y*y)/((x+y)*2);\\n }\\n}\\n//main\\nsigned main(){\\n int N;cin>>N;\\n std::vector<int> v(N);\\n for(int i=0;i<N;i++)cin>>v[i];\\n for(int i=0;i<300;i++)for(int j=0;j<300;j++)dp[i][j]=INF;\\n dp[0][1]=0;\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<300;j++){\\n for(int k=1;k<300;k++){\\n dp[i][j]=min(dp[i][j],dp[i-1][k]+frac(v[i-1],j,k));\\n }\\n }\\n }\\n double ans=INF;\\n for(int i=0;i<300;i++)ans=min(ans,dp[N][i]);\\n cout<<fixed<<setprecision(12)<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.9279,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3054_3424384\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<iomanip>\\n#include<cmath>\\n#include<vector>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\n#define INF ((long long)1e18)\\n#define MOD ((int)1e9+7)\\n#define endl \\\"\\\\n\\\"\\n\\n#define yn(f) ((f)?\\\"Yes\\\":\\\"No\\\")\\n#define YN(f) ((f)?\\\"YES\\\":\\\"NO\\\")\\n\\n#define MAX_N 200\\n#define MAX_H 400\\n\\ndouble dp[MAX_N][MAX_H];\\n\\nsigned main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(10);\\n\\t\\n\\tint n, h[MAX_N];\\n\\tdouble ans = INF;\\n\\t\\n\\tcin>>n;\\n\\t\\n\\tfor(int i = 1; i <= n; i++){\\n\\t\\tcin>>h[i];\\n\\t}\\n\\t\\n\\tdp[0][1] = 0;\\n\\t\\n\\tfor(int i = 1; i <= n; i++){\\n\\t\\tfor(int j = 0; j < MAX_H; j++){\\n\\t\\t\\tdp[i][j] = INF;\\n\\t\\t}\\n\\t\\tfor(int j = 1; j < MAX_H; j++){\\n\\t\\t\\tif(i == 1 && j != 1) continue;\\n\\t\\t\\tfor(int k = 1; k < MAX_H; k++){\\n\\t\\t\\t\\tdouble S;\\n\\t\\t\\t\\tif((h[i]-j)*(h[i]-k) >= 0) S = (fabs(h[i]-k)+fabs(h[i]-j))/2.0;\\n\\t\\t\\t\\telse S = (((double)h[i]-j)*(h[i]-j)+(double)(h[i]-k)*(h[i]-k))/(2.0*fabs(j-k));\\n\\t\\t\\t\\tdp[i][k] = min(dp[i-1][j]+S,dp[i][k]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < MAX_H; i++){\\n\\t\\tans = min(dp[n][i],ans);\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3764,\n \"score_of_the_acc\": -0.9494,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3054_3416152\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nlong double h[160];\\ndouble dp[160][305];\\n\\ndouble f(double a, double b, double height) {\\n double da = abs(a - height);\\n double db = abs(b - height);\\n if((a - height) * (b-height) >= 0) {\\n return (da + db) / 2.0;\\n }\\n double xa = da / (da + db);\\n double xb = db / (da + db);\\n return (xa * da + xb * db) / 2.0;\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n for(int i = 1;i <= n; i++) {\\n cin >> h[i];\\n }\\n for(int i = 0; i <= 300; i++) {\\n dp[0][i] = 1e9;\\n }\\n dp[0][1] = 0;\\n for(int i = 1; i <= n; i++) {\\n for(int after = 1; after <= 300; after++) {\\n dp[i][after] = 1e9;\\n }\\n for(int before = 1; before <= 300; before++) {\\n for(int after = 1; after <= 300; after++) {\\n //cout << before << \\\" \\\" << after << \\\" \\\" << h[i] << \\\" \\\" << f(before, after, h[i]) << endl;\\n dp[i][after] = min(dp[i][after], dp[i-1][before] + f(before, after, h[i]));\\n }\\n }\\n }\\n double ans = 1e9;\\n for(int i = 1; i <= 300; i++) {\\n ans = min(ans, dp[n][i]);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -1.0908,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3054_3415123\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#define _USE_MATH_DEFINES\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <sstream>\\n#include <string>\\n#include <tuple>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n\\nconst int INF = 0x3f3f3f3f, MOD = 1000000007;\\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\\n/*-----------------------------------------*/\\nint main() {\\n // freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n\\n int n; cin >> n;\\n vector<int> h(n); REP(i, n) cin >> h[i];\\n vector<vector<double> > dp(n, vector<double>(301, INF));\\n FOR(j, 1, h[0] + 1) {\\n int da = h[0] - 1, eb = h[0] - j;\\n dp[0][j] = (da + eb) / 2.0;\\n }\\n FOR(j, h[0] + 1, 301) {\\n int da = h[0] - 1, be = j - h[0];\\n dp[0][j] = (da * da + be * be) / (2.0 * (da + be));\\n }\\n FOR(i, 1, n) {\\n FOR(j, 1, h[i] + 1) {\\n int eb = h[i] - j;\\n FOR(k, 1, h[i] + 1) {\\n int da = h[i] - k;\\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (da + eb) / 2.0);\\n }\\n FOR(k, h[i] + 1, 301) {\\n int ad = k - h[i];\\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (ad * ad + eb * eb) / (2.0 * (ad + eb)));\\n }\\n }\\n FOR(j, h[i] + 1, 301) {\\n int be = j - h[i];\\n FOR(k, 1, h[i] + 1) {\\n int da = h[i] - k;\\n dp[i][j] = min(dp[i][j], dp[i - 1][k] + (da * da + be * be) / (2.0 * (da + be)));\\n }\\n FOR(k, h[i] + 1, 301) {\\n int ad = k - h[i];\\n dp[i][j] = min(dp[i][j], dp[i][k] + (ad + be) / 2.0);\\n }\\n }\\n }\\n double ans = INF;\\n FOR(j, 1, 301) ans = min(ans, dp[n - 1][j]);\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.0861,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3054_3415089\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n\\n// h_iと、そのときの左のyと右のyを渡すと面積が返ってくる\\ndouble calc(int h, int y1, int y2) {\\n if (y1 > h and y2 > h) {\\n return fabs(0.5 * (y1 - h + y2 - h));\\n }\\n if (y1 <= h and y2 <= h) {\\n return fabs(0.5 * (h - y1 + h - y2));\\n }\\n if (y1 <= h and h > y2) {\\n double x = 1.0 * (h - y1) / (y2 - y1);\\n return fabs(0.5 * ( x * (h - y1) + (1 - x) * (h - y2)));\\n } else {\\n double x = 1.0 * (h - y1) / (y2 - y1);\\n return fabs(0.5 * ( x * (y1 - h) + (1 - x) * (h - y2) ));\\n }\\n\\n}\\n\\nconst double INF = 1e18;\\ndouble dp[155][333];\\n\\nsigned main() {\\n int n;\\n cin >> n;\\n vector<int> h(n);\\n for (int i = 0; i < n; i++) {\\n cin >> h[i];\\n }\\n\\n // DPテーブルを初期化\\n for (int i = 0; i <= n; i++) {\\n for (int y = 1; y <= 300; y++) {\\n dp[i][y] = INF;\\n }\\n }\\n dp[0][1] = 0;\\n\\n // DP\\n for (int i = 0; i < n; i++) {\\n for (int y1 = 1; y1 <= 300; y1++) { // 左のy\\n for (int y2 = 1; y2 <= 300; y2++) { // 右のy\\n chmin(dp[i+1][y2], dp[i][y1] + calc(h[i], y1, y2));\\n }\\n }\\n }\\n\\n // 最後のyはどれが最適化を選ぶ\\n double ans = 1e18;\\n for (int i = 1; i <= 300; i++) {\\n chmin(ans, dp[n][i]);\\n }\\n\\n printf(\\\"%.10f\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.5421,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3054_3415052\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <iomanip>\\nusing namespace std;\\nconst double INF = 1LL<<60;\\n\\ndouble calc(double cur, double next, double h) {\\n if ((cur-h) * (next-h) >= 0) {\\n return (abs(cur-h) + abs(next-h)) / 2;\\n }\\n else {\\n double a = abs(cur - h), b = abs(next - h);\\n return (a*a + b*b) / (a + b) / 2;\\n }\\n}\\n\\nint main() {\\n int N; cin >> N;\\n vector<double> H(N);\\n for (int i = 0; i < N; ++i) cin >> H[i];\\n\\n vector<vector<double> > dp(N+1, vector<double>(300, INF));\\n dp[0][1] = 0;\\n for (int i = 0; i < N; ++i) {\\n for (int h = 1; h < 300; ++h) {\\n for (int h2 = 1; h2 < 300; ++h2) {\\n dp[i+1][h2] = min(dp[i+1][h2], dp[i][h] + calc(h, h2, H[i]));\\n }\\n }\\n }\\n double res = INF;\\n for (int h = 1; h < 300; ++h) res = min(res, dp[N][h]);\\n cout << fixed << setprecision(10) << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.3436,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3054_3415003\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define vvi vector<vector<int>>\\n#define vec vector\\n#define pq priority_queue\\n#define all(v) (v).begin(), (v).end()\\n#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());\\n#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))\\n#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))\\n#define dbg(x) cerr << #x << \\\": \\\" << x << endl;\\n#define dbg2(x, y) cerr<<\\\"(\\\"<<#x<<\\\", \\\"<<#y<<\\\") = \\\"<<\\\"(\\\"<<x<<\\\", \\\"<<y<<\\\")\\\"<<endl;\\n#define dbg3(x, y, z) cerr<<\\\"(\\\"<<#x<<\\\", \\\"<<#y<<\\\", \\\"<<#z<<\\\") = \\\"<<\\\"(\\\"<<x<<\\\", \\\"<<y<<\\\", \\\"<<z<<\\\")\\\"<<endl;\\n#define dbgB(value, size) cerr<<#value<<\\\": \\\"<<bitset<size>(value) << endl;\\n#define line() cerr << \\\"---------------\\\" << endl;\\n\\nconst int dx[] = {1, -1, 0, 0};\\nconst int dy[] = {0, 0, -1, 1};\\nconst double PI = 3.14159265358979323846;\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n\\ntemplate<typename T>\\nvoid print1(T begin, T end) {\\n while (begin != end) {\\n cout << (*begin) << \\\" \\\";\\n *begin++;\\n }\\n cout << endl;\\n}\\n\\ntemplate<typename T>\\nvoid print2(T Array, int height, int width) {\\n for (int i = 0; i < height; i++) {\\n for (int j = 0; j < width; j++) {\\n cout << \\\" \\\" << Array[i][j];\\n }\\n cout << endl;\\n }\\n}\\n\\nvoid print() { std::cerr << endl; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head&& head, Tail&&... tail) {\\n std::cerr << head << \\\" \\\";\\n print(std::forward<Tail>(tail)...);\\n}\\n\\ntemplate<class T>\\nvoid Add(T &a, const T &b, const T &mod=1000000007) {\\n int val = ((a % mod) + (b % mod)) % mod;\\n if (val < 0) { val += mod; }\\n a = val;\\n}\\n\\ntemplate <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }\\ntemplate <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }\\n\\n// ------------------------------------------------------------------------------------------\\n\\n\\ndouble calc(int h, int y1, int y2) {\\n if (y1 > h and y2 > h) {\\n return fabs(0.5 * (y1 - h + y2 - h));\\n }\\n if (y1 <= h and y2 <= h) {\\n return fabs(0.5 * (h - y1 + h - y2));\\n }\\n if (y1 <= h and h > y2) {\\n double x = 1.0 * (h - y1) / (y2 - y1);\\n return fabs(0.5 * ( x * (h - y1) + (1 - x) * (h - y2)));\\n } else {\\n double x = 1.0 * (h - y1) / (y2 - y1);\\n return fabs(0.5 * ( x * (y1 - h) + (1 - x) * (h - y2) ));\\n }\\n\\n}\\n\\nconst double INF = 1e18;\\ndouble dp[155][333];\\n\\nsigned main() {\\n int n;\\n cin >> n;\\n vec<int> h(n);\\n for (int i = 0; i < n; i++) {\\n cin >> h[i];\\n }\\n\\n // 初期化\\n for (int i = 0; i <= n; i++) {\\n for (int y = 1; y <= 300; y++) {\\n dp[i][y] = INF;\\n }\\n }\\n dp[0][1] = 0;\\n\\n // DP\\n for (int i = 0; i < n; i++) {\\n for (int y1 = 1; y1 <= 300; y1++) {\\n for (int y2 = 1; y2 <= 300; y2++) {\\n chmin(dp[i+1][y2], dp[i][y1] + calc(h[i], y1, y2));\\n }\\n }\\n }\\n\\n double ans = 1e18;\\n for (int i = 1; i <= 300; i++) {\\n chmin(ans, dp[n][i]);\\n }\\n\\n // cout << ans << endl;\\n printf(\\\"%.10f\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.4972,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3054_3414860\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#ifdef _DEBUG\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...)\\n#endif\\n\\n//#define int long long\\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\\n#define all(c) begin(c),end(c)\\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\\nconst int MOD = 1'000'000'007;\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }\\n\\nsigned main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(10);\\n\\tint n; cin >> n;\\n\\tvector<int> h(n); rep(i, 0, n) {\\n\\t\\tcin >> h[i];\\n\\t}\\n\\tvector<int> y(n + 1);\\n\\ty[0] = 1;\\n\\n\\trep(i, 0, n) {\\n\\t\\ty[i + 1] = h[i];\\n\\t}\\n\\n\\tint m = *max_element(all(h)) * 2;\\n\\n\\tvector<vector<double>> dp(n + 1, vector<double>(m, INF));\\n\\n\\tdp[0][1] = 0;\\n\\n\\trep(i, 0, n) {\\n\\t\\trep(j, 1, m) {\\n\\t\\t\\trep(k, 1, m) {\\n\\t\\t\\t\\tdouble a = h[i] - j;\\n\\t\\t\\t\\tdouble b = h[i] - k;\\n\\t\\t\\t\\tif (a*b < 0) {\\n\\t\\t\\t\\t\\ta = abs(a), b = abs(b);\\n\\t\\t\\t\\t\\tdouble add = (a * a + b * b) / (a + b) / 2;\\n\\t\\t\\t\\t\\tchmin(dp[i + 1][k], dp[i][j] + add);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ta = abs(a), b = abs(b);\\n\\t\\t\\t\\t\\tchmin(dp[i + 1][k], dp[i][j] + (a + b) / 2);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdump(dp);\\n\\n\\tcout << *min_element(all(dp[n])) << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.3586,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1898,"cells":{"group_id":{"kind":"string","value":"aoj_3057_cpp"},"problem_description":{"kind":"string","value":"Problem G: First Kiss\nProblem\nビット君の通う男子校では昼休みにキッポーゲームが行われている。\nこの学校のキッポーゲームは少し変わっていることで有名だ。\nまず、$N$本のキッポーを用意する。$i$本目のキッポーの長さは$a_i$である。\n先手と後手が交互にキッポーを食べる。\nすごい長さのキッポーを一気に食べると喉に刺さってしまうので、$1$以上$D$以下の好きな長さだけ食べる。\n彼らは不器用なので、整数長でのみキッポーを食べることができる。\n最初にいずれかのキッポーが食べつくされたとき、食べきった人の負けとなる。\n両者が最適に行動したとき、先手が勝つなら\"First\"、後手が勝つなら\"Second\"を出力せよ。\nInput\n入力は以下の形式で与えられる。\n$N$ $D$\n$a_1$ $a_2$ $...$ $a_N$\n入力はすべて整数で与えられる。\nConstraints\n入力は以下の条件を満たす。\n$1 \\le N \\le 3\\times 10^5$\n$1 \\le D \\le 10^9$\n$1 \\le a_i \\le 10^9$\nOutput\n両者が最適に行動したとき、どちらが勝つか出力せよ。\n先手が勝つなら\"First\"、後手が勝つなら\"Second\"を出力せよ。\nSample Input 1\n1 1\n2\nSample Output 1\nFirst\nSample Input 2\n2 25\n19 19\nSample Output 2\nSecond\nSample Input 3\n3 5\n10 8 4\nSample Output 3\nFirst\nSample Input 4\n4 10\n3 8 5 2\nSample Output 4\nSecond"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3057_10892670","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nvoid solve(){\n ll N, D; cin >> N >> D;\n vl a(N); rep(i, N) cin >> a[i];\n ll X = 0;\n rep(i, N){\n a[i]--;\n X ^= a[i] % (D+1);\n }\n cout << ((X != 0) ? \"First\" : \"Second\") << endl;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5148,"score_of_the_acc":-0.9076,"final_rank":12},{"submission_id":"aoj_3057_10892628","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n//const ll INF = LLONG_MAX / 4;\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\nauto sz(const auto& a) { return ssize(a); }\n#define rep(i,a,b) for (ll i = (a); i < (b); i++)\n#define each(x,a) for (auto&& x : a)\n#define co(a) cout << a << \" \"\n#define con(a) cout << a << '\\n'\n#define com(a) cout << a\n#define coen cout << endl\n\nvoid solve() {\n int N,D;\n int X = 0;\n int A;\n cin >> N >> D;\n for(int i = 0; i < N; i++){\n cin >> A;\n X ^= ((A-1)%(D+1));\n }\n if(X == 0){\n cout << \"Second\" << endl;\n }\n else{\n cout << \"First\" << endl;\n }\n}\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.2172,"final_rank":5},{"submission_id":"aoj_3057_10892598","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n\n#define rep(i,n) for(ll i=0;i<n;++i)\n#define all(a) (a).begin(),(a).end()\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &a){\n if (a.empty()) return os;\n os << a.front();\n for (auto e : a | views::drop(1)){\n os << ' ' << e;\n }\n return os;\n}\n\nvoid dump(auto ...vs){\n ((cout << vs << ' '), ...) << endl;\n}\n\n\n\nvoid solve() {\n ll N,D;\n cin>>N>>D;\n vector<ll> A(N);\n rep(i,N)cin>>A[i];\n ll x=0;\n rep(i,N){\n x^=(A[i]-1)%(D+1);\n }\n if (x==0){\n cout<<\"Second\"<<endl;\n }\n else{\n cout<<\"First\"<<endl;\n }\n return;\n}\n\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n ll T=1;\n while (T--){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5376,"score_of_the_acc":-1,"final_rank":15},{"submission_id":"aoj_3057_10891087","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n int N, D;\n cin >> N >> D;\n int ans = 0;\n rep(i, 0, N){\n int a;\n cin >> a;\n ans ^= ((a - 1) % (D + 1));\n }\n cout << (ans ? \"First\\n\" : \"Second\\n\");\n}","accuracy":1,"time_ms":10,"memory_kb":3428,"score_of_the_acc":-0.2107,"final_rank":4},{"submission_id":"aoj_3057_10853711","code_snippet":"//Author:Fczhao\n//Language:cpp\n#include <bits/stdc++.h>\nusing namespace std;\nsigned main(){\n ios::sync_with_stdio(false);\n #ifdef FCZHAO\n freopen(\"1.in\", \"r\", stdin);\n freopen(\"1.out\", \"w\", stdout);\n #endif\n int n, d, ans = 0, x;\n cin >> n >> d;\n for(int i = 0; i < n; i++){\n cin >> x;\n ans ^= (x - 1) % (d + 1);\n }\n cout << ((ans == 0) ? \"Second\" : \"First\") << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3464,"score_of_the_acc":-0.2253,"final_rank":6},{"submission_id":"aoj_3057_10235816","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n// using mint = atcoder::static_modint<998244353>;\n//using mint = atcoder::static_modint<1000000007>;\nusing namespace std;\n// using namespace atcoder;\nusing ld = long double;\nusing ll = long long;\n#define mp(a,b) make_pair(a,b)\n#define rep(i,s,n) for(int i=s; i<(int)n; i++)\nconst vector<int> dx{1,0,-1,0},dy{0,1,0,-1};\n\nint grandy(int x,int d){\n x%=d+1;\n return x;\n}\nint main(){\n int n,d;cin >> n >> d;\n int g=0;\n rep(i,0,n){\n int a;cin >> a;a--;\n g^=grandy(a,d);\n }\n if(g)cout << \"First\\n\";\n else cout << \"Second\\n\";\n}","accuracy":1,"time_ms":50,"memory_kb":3484,"score_of_the_acc":-0.9001,"final_rank":11},{"submission_id":"aoj_3057_9769355","code_snippet":"#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,mmx,abm,bmi,bmi2,popcnt,lzcnt\")\n#pragma GCC target(\"avx2\") // CF, CodeChef, HOJ ではコメントアウト\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n \n// #define sqrt __builtin_sqrtl\n// #define cbrt __builtin_cbrtl\n// #define hypot __builtin_hypotl\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\n// const int MOD = 998244353;\nconst int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() {}\n // Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge &e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge &e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge &e) { return this->cost < e.cost; }\n bool operator >(const Edge &e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int() {\n return dist_x(rng);\n }\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nnamespace bit_function {\n using i64 = ll;\n // using i64 = uint64_t;\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \n i64 popcount(i64 x) { return __builtin_popcountll(x); }\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\n \n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n int next_bit(i64 x, int k) { // upper_bound\n x >>= (k + 1);\n int pos = k + 1;\n while (x > 0) {\n if (x & 1) return pos;\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int prev_bit(i64 x, int k) {\n // k = min(k, bit_width(x)); ?\n int pos = 0;\n while (x > 0 && pos < k) {\n if (x & 1) {\n if (pos < k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int kth_bit(i64 x, int k) { // kは1-indexed\n int pos = 0, cnt = 0;\n while (x > 0) {\n if (x & 1) {\n cnt++;\n if (cnt == k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\n i64 lsb(i64 x) { return (x & -x); } // mask\n \n int countl_zero(i64 x) { return __builtin_clzll(x); }\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n }\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\n\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\n if (x == 0) return 0;\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\n return ret;\n }\n \n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\n i64 rotr(i64 x, int k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n }\n // i64 bit_reverse(i64 x, int l, int r) {}\n \n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\n \n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \n i64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n }\n} using namespace bit_function;\n\nnamespace util_function {\n namespace Std = std;\n __int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n // assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n // assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n }\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n }\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n return x - y * per(x, y);\n } // https://yukicoder.me/problems/no/2781\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n }\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n }\n int round(int x, int y) { // (ld)x / y を小数第1位について四捨五入\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n }\n int round(int x, int y, int k) { // (ld)x / y を10^kの位に関して四捨五入\n assert(y != 0 && k >= 0);\n if (k == 0) return (x * 2 + y) / (y * 2);\n x /= y * POW(10, k - 1);\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\n return x * POW(10, k - 1);\n }\n int round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n }\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入.\n // x += EPS;\n ld d = pow(10, -k);\n return Std::round(x * d) / d;\n }\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\n // x += EPS;\n ld d = pow(10, -k);\n return Std::floor(x * d) / d; // 未verify\n }\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\n // x -= EPS;\n ld d = pow(10, -k);\n return Std::ceil(x * d) / d; // 未verify\n }\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\n // }\n int floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return Std::floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n }\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return Std::ceil(x / y);\n // ceil(x) = floor(x + 1)\n }\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n }\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n }\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n int modf(ld x) {\n if (x < 0) return ceill(x);\n else return floorl(x);\n }\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\n int seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n }\n int seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n }\n\n int floor_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now <= x) {\n now *= base;\n if (now <= x) ret++;\n }\n return ret;\n }\n int ceil_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now < x) {\n now *= base;\n ret++;\n }\n return ret;\n }\n\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n }\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n }\n \n template <class T> bool chmax(T &a, const T &b) {\n if (a < b) { a = b; return true; } return false;\n }\n template <class T> bool chmin(T &a, const T &b) {\n if (a > b) { a = b; return true; } return false;\n }\n template <class T> bool chmax(pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) { a = b; return true; }\n return false;\n }\n template <class T> bool chmin(pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) { a = b; return true; }\n return false;\n }\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\n }\n template <typename T, typename... Args>\n void Sort(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.begin(), vec.end());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <typename T, typename... Args>\n void Sortr(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.rbegin(), vec.rend());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <class T>\n void sort(vector<T> &A, vector<T> &B) {\n vector<pair<T, T>> P(A.size());\n for (int i = 0; i < A.size(); i++) P[i] = {A[i], B[i]};\n sort(P.begin(), P.end());\n for (int i = 0; i < A.size(); i++) A[i] = P[i].first, B[i] = P[i].second;\n }\n\n istream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n }\n ostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n }\n \n __int128_t sto128(const string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n }\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n __int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n }\n \n string to_string(double x, int k) { // 小数第k+1を四捨五入して小数第k位までを出力\n // 切り捨てがほしい場合は to_string(x, k+1) として pop_back() すればよい?\n ostringstream os;\n os << fixed << setprecision(k) << x;\n return os.str();\n }\n string to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n }\n string to_string(char c) { string s = \"\"; s += c; return s; }\n} using namespace util_function;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\ntemplate<typename T>\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<T, int, custom_hash> Z;\n // gp_hash_table<int, T, custom_hash> UZ;\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\n \n Compress() {}\n Compress(const vector<T> &V, T base = 0) {\n this->sz = base;\n set<T> s(V.begin(), V.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\n this->sz = base;\n vector<T> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<T> s(V3.begin(), V3.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\n this->sz = base;\n vector<T> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<T> s(V4.begin(), V4.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2,\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\n this->sz = base;\n vector<T> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<T> s(V5.begin(), V5.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<T> &V) {\n vector<int> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n \n vector<T> unzip(const vector<int> &V) {\n vector<T> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[V[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n int encode(T x) { return Z[x]; }\n T decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T> struct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \ntemplate<int mod> class Modint {\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n \n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n\n friend istream &operator >>(istream &is, Modint& x) {\n int t; is >> t; x = t; return (is);\n }\n friend ostream &operator <<(ostream &os, const Modint& x) {\n return os << x.val;\n }\n};\nusing mint = Modint<MOD>;\n \nmint modpow(const mint &x, int n) {\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\n assert(n >= 0);\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n// int modinv(__int128_t x, int mod) { // \n// assert(mod > 0);\n// // assert(x > 0);\n// if (x == 1 or x == 0) return 1;\n// return mod - modinv(mod % x, mod) * (mod / x) % mod;\n// }\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n \nmint FAC(int N) {\n if (N < 0) return 0; return _fac[N];\n}\nmint FACinv(int N) {\n if (N < 0) return 0; return _finv[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint COMinv(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _finv[N] * _fac[K] * _fac[N - K];\n}\nmint MCOM(const vector<int> &V) {\n int N = 0;\n for (int i = 0; i < V.size(); i++) N += V[i];\n mint ret = _fac[N];\n for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];\n return ret;\n}\nmint PERM(int N, int K) {\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) { // initのサイズに注意\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n \n#pragma endregion\n\nsigned main() {\n int N, K;\n cin >> N >> K;\n vector<int> A(N);\n for (int i = 0; i < N; i++) {\n cin >> A[i];\n A[i]--;\n }\n\n int g = 0;\n for (int i = 0; i < N; i++) {\n g ^= A[i] % (K + 1);\n }\n if (g == 0) cout << \"Second\" << endl;\n else cout << \"First\" << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5164,"score_of_the_acc":-0.9141,"final_rank":13},{"submission_id":"aoj_3057_8503256","code_snippet":"/* -*- coding: utf-8 -*-\n *\n * 3057.cc: Problem G: First Kiss\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\n/* typedef */\n\n/* global variables */\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, d;\n scanf(\"%d%d\", &n, &d);\n\n int x = 0;\n for (int i = 0; i < n; i++) {\n int ai;\n scanf(\"%d\", &ai);\n\n x ^= (ai - 1) % (d + 1);\n }\n\n if (x != 0) puts(\"First\");\n else puts(\"Second\");\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2908,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_3057_5704089","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main(){\n int n, d;\n cin >> n >> d;\n vector<int> a(n);\n for(auto &p: a) cin >> p;\n\n int g = 0;\n for(auto &p: a){\n p--;\n g ^= p%(d+1);\n }\n\n if(g == 0) cout << \"Second\" << endl;\n else cout << \"First\" << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4040,"score_of_the_acc":-1.1253,"final_rank":20},{"submission_id":"aoj_3057_5300114","code_snippet":"//#include <atcoder/all>\n//using namespace atcoder;\n//using mint = modint;\n\n#include <bits/stdc++.h>\n#define int long long\n#define sint signed\n#define endl \"\\n\" // fflush(stdout);\n#define ALL(v) (v).begin(),(v).end()\n#define Vi vector<int>\n#define VVi vector<Vi>\n#define VVVi vector<VVi>\n#define Vm vector<mint>\n#define VVm vector<Vm>\n#define Vs vector<string>\n#define Vd vector<double>\n#define Vc vector<char>\n#define Vb vector<bool>\n#define Pii pair<int,int>\n#define Pdd pair<double,double>\n#define VPii vector<Pii>\n#define Tiii tuple<int,int,int>\n#define VTiii vector<Tiii>\n#define PQi priority_queue<int>\n#define PQir priority_queue<int,vector<int>,greater<int>>\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define itos to_string\n#define stoi stoll\n#define FI first\n#define SE second\n#define cYES cout<<\"YES\"<<endl\n#define cNO cout<<\"NO\"<<endl\n#define cYes cout<<\"Yes\"<<endl\n#define cNo cout<<\"No\"<<endl\n#define cyes cout<<\"yes\"<<endl\n#define cno cout<<\"no\"<<endl\n#define sortr(v) sort(v,greater<>())\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define repeq(i,a,b) for(int i=a;i<=b;i++)\n#define repreq(i,a,b) for(int i=a;i>=b;i--)\n#define dem(a,b) ((a+b-1)/(b))\n#define INF 3000000000000000000 // 3.0*10^18\n#define MAX LLONG_MAX\n#define PI acos(-1.0L)\n\nusing namespace std;\n\n/* debug */\ntemplate <typename T>\nostream& operator<<(ostream& os,const vector<T> &V){int N=V.size();\nif(N==0){os<<'.';return os;}rep(i,0,N-1){os<<V[i]<<' ';}os<<V[N-1];return os;}\ntemplate <typename T>\nostream& operator<<(ostream& os,const vector<vector<T>> &V){\nint N=V.size();rep(i,0,N-1)os<<V[i]<<endl;os<<V[N-1];return os;}\ntemplate <typename T,typename S>\nostream& operator<<(ostream& os, pair<T,S> const&P){os<<P.FI<<' '<<P.SE;return os;}\n//ostream& operator<<(ostream& os, mint const&M){os<<M.val();return os;}\n\n/* useful */\ntemplate<typename T>void Vin(vector<T> &v){int n=v.size();rep(i,0,n)cin>>v[i];}\nint scomb(int n, int r){if(r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr\nint a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}\nint digit_sum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}\nint digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';}\ntemplate<typename T>void press(T &v){v.erase(unique(ALL(v)),v.end());}\nint SMALLER(Vi &a,int x){return lower_bound(a.begin(),a.end(),x)-a.begin();}\nint orSMALLER(Vi &a,int x){return upper_bound(a.begin(),a.end(),x)-a.begin();}\nint BIGGER(Vi &a,int x){return a.size()-orSMALLER(a,x);}\nint orBIGGER(Vi &a,int x){return a.size()-SMALLER(a,x);}\nint COUNT(Vi &a,int x) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}\nint maxind(Vi &a){return max_element(ALL(a))-a.begin();}\nint minind(Vi &a){return min_element(ALL(a))-a.begin();}\ntemplate<typename T>bool chmax(T &a,T b) {if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>bool chmin(T &a,T b) {if(a>b){a=b;return 1;}return 0;}\nint dtoi(double d,int g){return round(d*pow(10,g));}\n/*\nVi zip(Vi b){int Z=b.size();\nPii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)\np[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)\n{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}\n*/\n//Vi vis(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}\n\n//const int MOD = 998244353;\nconst int MOD = 1000000007;\nconst double EPS = 1e-10;\n\nvoid init(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);\ncout<<fixed<<setprecision(12);//mint::set_mod(MOD);\n}\n\n/************************************ START ************************************/\n\nvoid sol() {\n int n,m;cin >> n >> m;\n Vi a(n);\n Vin(a);\n rep(i,0,n) a[i]--;\n int gr = 0;\n rep(i,0,n) {\n int b = a[i]%(m+1);\n gr ^= b;\n }\n if(gr) cout << \"First\" << endl;\n else cout << \"Second\" << endl;\n}\n\nsigned main() {\n init();\n int q = 1;\n //cin >> q;\n while(q--) sol();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4792,"score_of_the_acc":-0.93,"final_rank":14},{"submission_id":"aoj_3057_4942803","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-7, PI = acos(-1);\n//ここから編集\n\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n int N, D; cin >> N >> D;\n vector<int> a(N);\n int x1or = 0;\n REP(i,N) {\n cin >> a[i];\n x1or ^= ((a[i]-1)%(D+1));\n }\n\n if(x1or == 0) cout << \"Second\" << endl;\n else cout << \"First\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3964,"score_of_the_acc":-0.4279,"final_rank":9},{"submission_id":"aoj_3057_4031790","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, d, g = 0;\n cin >> n >> d;\n for(int i=0;i<n;i++){\n int a;\n cin >> a;\n g ^= (a-1)%(d+1);\n }\n cout << (g ? \"First\" : \"Second\") << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3088,"score_of_the_acc":-1.0729,"final_rank":17},{"submission_id":"aoj_3057_3887865","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MOD 1000000007\n\nint main(){\n int n,d; cin >> n >> d;\n int flag=0;\n for(int i=0;i<n;++i){\n int a; cin >> a;\n a--;\n a%=d+1;\n flag^=a;\n }\n if(flag) cout << \"First\" << endl;\n else cout << \"Second\" << endl;\n \n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3080,"score_of_the_acc":-1.0697,"final_rank":16},{"submission_id":"aoj_3057_3846627","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n\nconst int INF = 0x3f3f3f3f;\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007; // 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\n/*-------------------------------------------------*/\nint main() {\n cin.tie(nullptr); ios::sync_with_stdio(false);\n // freopen(\"input.txt\", \"r\", stdin);\n\n int n, d; cin >> n >> d;\n long long x = 0;\n while (n--) {\n int a; cin >> a;\n --a;\n a %= d + 1;\n x ^= a;\n }\n cout << (x == 0 ? \"Second\\n\" : \"First\\n\");\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3204,"score_of_the_acc":-0.1199,"final_rank":3},{"submission_id":"aoj_3057_3764602","code_snippet":"#include<iostream>\nusing namespace std;\n\n// 解説を読んだ\n// 各ポッキーが1 1 1 ... 1となった状態が負けなので、\n// 全てのポッキーの長さを1減じたものに対するNimを考えればよい\n// 長さxのポッキーに対するgrundy数は、観察を行うと\n// (x-1)%(d+1)であることがわかる(実際に書き出せば明らか)\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, d;\n cin >> n >> d;\n int nim = 0;\n while(n-- > 0){\n int x; cin >> x;\n nim ^= (x-1)%(d+1);\n }\n cout << (nim==0 ? \"Second\" : \"First\") << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3180,"score_of_the_acc":-0.1102,"final_rank":2},{"submission_id":"aoj_3057_3764598","code_snippet":"#include<iostream>\nusing namespace std;\n\n// 解説を読んだ\n// 各ポッキーが1 1 1 ... 1となった状態が負けなので、\n// 全てのポッキーの長さを1減じたものに対するNimを考えればよい\n// 長さxのポッキーに対するgrundy数は、観察を行うと\n// (x-1)%(d+1)であることがわかる(実際に書き出せば明らか)\n\nint main(){\n int n, d;\n cin >> n >> d;\n int nim = 0;\n while(n-- > 0){\n int x; cin >> x;\n nim ^= (x-1)%(d+1);\n }\n cout << (nim==0 ? \"Second\" : \"First\") << endl;\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3088,"score_of_the_acc":-1.0729,"final_rank":17},{"submission_id":"aoj_3057_3659300","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,d;\n cin>>n>>d;\n vector<Int> a(n);\n for(Int i=0;i<n;i++) cin>>a[i],a[i]--;\n Int ans=0;\n for(Int i=0;i<n;i++) ans^=a[i]%(d+1);\n cout<<(ans?\"First\":\"Second\")<<endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4808,"score_of_the_acc":-0.7699,"final_rank":10},{"submission_id":"aoj_3057_3630924","code_snippet":"#include <bits/stdc++.h>\n#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\nusing namespace std;\n#define reps(i,s,n) for(int i = s; i < n; i++)\n#define rep(i,n) reps(i,0,n)\n#define fi first\n#define se second\ntypedef long long ll;\n\nint N,M,H,W,K,A,B;\nstring S;\nstring alpha = \"abcdefghijklmnopqrstuvwxyz\";\nstring ALPHA = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nint f(int a,int d){\n int ans = (a+d)%(d+1);\n //cout<<ans<<endl;\n return ans;\n}\n\nint main() {\n int D;\n cin>> N >> D;\n int g = 0;\n int a;\n rep(i,N){\n cin>>a;\n g = g^f(a,D);\n //cout<<g<<endl;\n }\n if(g) {\n cout << \"First\" << endl;\n }else{\n cout << \"Second\"<< endl;\n }\n int y = 7^10;\n //cout<<y<<endl;\n}","accuracy":1,"time_ms":70,"memory_kb":3196,"score_of_the_acc":-1.1167,"final_rank":19},{"submission_id":"aoj_3057_3626709","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nint main(){\n\n\tint value = 0;\n\n\tint N,D;\n\n\tscanf(\"%d %d\",&N,&D);\n\n\tint tmp;\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tvalue ^= (tmp-1)%(D+1);\n\t}\n\n\tif(value != 0){\n\t\tprintf(\"First\\n\");\n\t}else{\n\t\tprintf(\"Second\\n\");\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3148,"score_of_the_acc":-0.2639,"final_rank":7},{"submission_id":"aoj_3057_3481590","code_snippet":"#include <bits/stdc++.h>\nint n,d,x,s;\nmain(){\n\tscanf(\"%d%d\",&n,&d);\n\twhile(n--){\n\t\tscanf(\"%d\",&x);\n\t\ts^=(x-1)%(d+1);\n\t}\n\tputs(s?\"First\":\"Second\");\n}","accuracy":1,"time_ms":20,"memory_kb":3168,"score_of_the_acc":-0.272,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_3057_10892670\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nvoid solve(){\\n ll N, D; cin >> N >> D;\\n vl a(N); rep(i, N) cin >> a[i];\\n ll X = 0;\\n rep(i, N){\\n a[i]--;\\n X ^= a[i] % (D+1);\\n }\\n cout << ((X != 0) ? \\\"First\\\" : \\\"Second\\\") << endl;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5148,\n \"score_of_the_acc\": -0.9076,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3057_10892628\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n//const ll INF = LLONG_MAX / 4;\\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\\nauto sz(const auto& a) { return ssize(a); }\\n#define rep(i,a,b) for (ll i = (a); i < (b); i++)\\n#define each(x,a) for (auto&& x : a)\\n#define co(a) cout << a << \\\" \\\"\\n#define con(a) cout << a << '\\\\n'\\n#define com(a) cout << a\\n#define coen cout << endl\\n\\nvoid solve() {\\n int N,D;\\n int X = 0;\\n int A;\\n cin >> N >> D;\\n for(int i = 0; i < N; i++){\\n cin >> A;\\n X ^= ((A-1)%(D+1));\\n }\\n if(X == 0){\\n cout << \\\"Second\\\" << endl;\\n }\\n else{\\n cout << \\\"First\\\" << endl;\\n }\\n}\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.2172,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_3057_10892598\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\n#define rep(i,n) for(ll i=0;i<n;++i)\\n#define all(a) (a).begin(),(a).end()\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &a){\\n if (a.empty()) return os;\\n os << a.front();\\n for (auto e : a | views::drop(1)){\\n os << ' ' << e;\\n }\\n return os;\\n}\\n\\nvoid dump(auto ...vs){\\n ((cout << vs << ' '), ...) << endl;\\n}\\n\\n\\n\\nvoid solve() {\\n ll N,D;\\n cin>>N>>D;\\n vector<ll> A(N);\\n rep(i,N)cin>>A[i];\\n ll x=0;\\n rep(i,N){\\n x^=(A[i]-1)%(D+1);\\n }\\n if (x==0){\\n cout<<\\\"Second\\\"<<endl;\\n }\\n else{\\n cout<<\\\"First\\\"<<endl;\\n }\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n ll T=1;\\n while (T--){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5376,\n \"score_of_the_acc\": -1,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3057_10891087\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n int N, D;\\n cin >> N >> D;\\n int ans = 0;\\n rep(i, 0, N){\\n int a;\\n cin >> a;\\n ans ^= ((a - 1) % (D + 1));\\n }\\n cout << (ans ? \\\"First\\\\n\\\" : \\\"Second\\\\n\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.2107,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3057_10853711\",\n \"code_snippet\": \"//Author:Fczhao\\n//Language:cpp\\n#include <bits/stdc++.h>\\nusing namespace std;\\nsigned main(){\\n ios::sync_with_stdio(false);\\n #ifdef FCZHAO\\n freopen(\\\"1.in\\\", \\\"r\\\", stdin);\\n freopen(\\\"1.out\\\", \\\"w\\\", stdout);\\n #endif\\n int n, d, ans = 0, x;\\n cin >> n >> d;\\n for(int i = 0; i < n; i++){\\n cin >> x;\\n ans ^= (x - 1) % (d + 1);\\n }\\n cout << ((ans == 0) ? \\\"Second\\\" : \\\"First\\\") << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.2253,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3057_10235816\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n// using mint = atcoder::static_modint<998244353>;\\n//using mint = atcoder::static_modint<1000000007>;\\nusing namespace std;\\n// using namespace atcoder;\\nusing ld = long double;\\nusing ll = long long;\\n#define mp(a,b) make_pair(a,b)\\n#define rep(i,s,n) for(int i=s; i<(int)n; i++)\\nconst vector<int> dx{1,0,-1,0},dy{0,1,0,-1};\\n\\nint grandy(int x,int d){\\n x%=d+1;\\n return x;\\n}\\nint main(){\\n int n,d;cin >> n >> d;\\n int g=0;\\n rep(i,0,n){\\n int a;cin >> a;a--;\\n g^=grandy(a,d);\\n }\\n if(g)cout << \\\"First\\\\n\\\";\\n else cout << \\\"Second\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.9001,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3057_9769355\",\n \"code_snippet\": \"#pragma region Macros\\n \\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,mmx,abm,bmi,bmi2,popcnt,lzcnt\\\")\\n#pragma GCC target(\\\"avx2\\\") // CF, CodeChef, HOJ ではコメントアウト\\n \\n#include <bits/extc++.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n \\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\\n\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n \\n// #define sqrt __builtin_sqrtl\\n// #define cbrt __builtin_cbrtl\\n// #define hypot __builtin_hypotl\\n \\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\n// const int MOD = 998244353;\\nconst int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n \\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n \\n#define EC int\\nstruct Edge {\\n int from, to;\\n EC cost;\\n Edge() {}\\n // Edge() : from(-1), to(-1), cost(-1) {}\\n Edge(int to, EC cost) : to(to), cost(cost) {}\\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\\n bool operator ==(const Edge &e) {\\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\\n }\\n bool operator !=(const Edge &e) {\\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\\n }\\n bool operator <(const Edge &e) { return this->cost < e.cost; }\\n bool operator >(const Edge &e) { return this->cost > e.cost; }\\n};\\n \\nchrono::system_clock::time_point start;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n \\nrandom_device seed_gen;\\nmt19937_64 rng(seed_gen());\\nuniform_int_distribution<int> dist_x(0, 1e9);\\nstruct RNG {\\n unsigned Int() {\\n return dist_x(rng);\\n }\\n unsigned Int(unsigned l, unsigned r) {\\n return dist_x(rng) % (r - l + 1) + l;\\n }\\n ld Double() {\\n return ld(dist_x(rng)) / 1e9;\\n }\\n} rnd;\\n\\nnamespace bit_function {\\n using i64 = ll;\\n // using i64 = uint64_t;\\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\\n \\n i64 popcount(i64 x) { return __builtin_popcountll(x); }\\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\\n \\n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\\n int next_bit(i64 x, int k) { // upper_bound\\n x >>= (k + 1);\\n int pos = k + 1;\\n while (x > 0) {\\n if (x & 1) return pos;\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n int prev_bit(i64 x, int k) {\\n // k = min(k, bit_width(x)); ?\\n int pos = 0;\\n while (x > 0 && pos < k) {\\n if (x & 1) {\\n if (pos < k) return pos;\\n }\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n int kth_bit(i64 x, int k) { // kは1-indexed\\n int pos = 0, cnt = 0;\\n while (x > 0) {\\n if (x & 1) {\\n cnt++;\\n if (cnt == k) return pos;\\n }\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\\n i64 lsb(i64 x) { return (x & -x); } // mask\\n \\n int countl_zero(i64 x) { return __builtin_clzll(x); }\\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n }\\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\\n\\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\\n if (x == 0) return 0;\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\\n return ret;\\n }\\n \\n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\\n \\n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\\n i64 w = bit_width(x); k %= w;\\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\\n }\\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\\n i64 rotr(i64 x, int k) {\\n i64 w = bit_width(x); k %= w;\\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\\n }\\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\\n i64 r = 0, w = bit_width(x);\\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\\n return r;\\n }\\n // i64 bit_reverse(i64 x, int l, int r) {}\\n \\n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\\n \\n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\\n \\n i64 next_combination(i64 x) {\\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\\n }\\n} using namespace bit_function;\\n\\nnamespace util_function {\\n namespace Std = std;\\n __int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n // assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n // assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n }\\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n }\\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n return x - y * per(x, y);\\n } // https://yukicoder.me/problems/no/2781\\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x >= 0 ? x / y : (x + 1) / y - 1;\\n }\\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x > 0 ? (x - 1) / y + 1 : x / y;\\n }\\n int round(int x, int y) { // (ld)x / y を小数第1位について四捨五入\\n assert(y != 0);\\n return (x * 2 + y) / (y * 2);\\n }\\n int round(int x, int y, int k) { // (ld)x / y を10^kの位に関して四捨五入\\n assert(y != 0 && k >= 0);\\n if (k == 0) return (x * 2 + y) / (y * 2);\\n x /= y * POW(10, k - 1);\\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\\n return x * POW(10, k - 1);\\n }\\n int round2(int x, int y) { // 五捨五超入 // 未verify\\n assert(y != 0);\\n if (y < 0) y = -y, x = -x;\\n int z = x / y;\\n if ((z * 2 + 1) * y <= y * 2) z++;\\n return z;\\n }\\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入.\\n // x += EPS;\\n ld d = pow(10, -k);\\n return Std::round(x * d) / d;\\n }\\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\\n // x += EPS;\\n ld d = pow(10, -k);\\n return Std::floor(x * d) / d; // 未verify\\n }\\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\\n // x -= EPS;\\n ld d = pow(10, -k);\\n return Std::ceil(x * d) / d; // 未verify\\n }\\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\\n // }\\n int floor(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return Std::floor(x / y);\\n // floor(x) = ceil(x - 1) という話も\\n }\\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\\n assert(!equals(y, 0));\\n return Std::ceil(x / y);\\n // ceil(x) = floor(x + 1)\\n }\\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\\n assert(!equals(y, 0));\\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n }\\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\\n // 未verify. 誤差対策TODO. -0.0が返りうる。\\n assert(!equals(y, 0));\\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\\n return x - fabs(y)*floor(x, fabs(y));\\n }\\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\\n int modf(ld x) {\\n if (x < 0) return ceill(x);\\n else return floorl(x);\\n }\\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\\n int seisuu(int x, int y) {\\n assert(y != 0);\\n return x / y;\\n }\\n int seisuu(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return (int)(x / y);\\n }\\n\\n int floor_log(int base, int x) {\\n assert(base >= 2);\\n int ret = 0, now = 1;\\n while (now <= x) {\\n now *= base;\\n if (now <= x) ret++;\\n }\\n return ret;\\n }\\n int ceil_log(int base, int x) {\\n assert(base >= 2);\\n int ret = 0, now = 1;\\n while (now < x) {\\n now *= base;\\n ret++;\\n }\\n return ret;\\n }\\n\\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\\n return b;\\n }\\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\\n return b;\\n }\\n \\n template <class T> bool chmax(T &a, const T &b) {\\n if (a < b) { a = b; return true; } return false;\\n }\\n template <class T> bool chmin(T &a, const T &b) {\\n if (a > b) { a = b; return true; } return false;\\n }\\n template <class T> bool chmax(pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) { a = b; return true; }\\n return false;\\n }\\n template <class T> bool chmin(pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) { a = b; return true; }\\n return false;\\n }\\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\\n }\\n template <typename T, typename... Args>\\n void Sort(T& a, T& b, T& c, Args&... args) {\\n vector<T> vec = {a, b, c, args...};\\n sort(vec.begin(), vec.end());\\n auto it = vec.begin();\\n a = *it++; b = *it++; c = *it++;\\n int dummy[] = { (args = *it++, 0)... };\\n static_cast<void>(dummy);\\n }\\n template <typename T, typename... Args>\\n void Sortr(T& a, T& b, T& c, Args&... args) {\\n vector<T> vec = {a, b, c, args...};\\n sort(vec.rbegin(), vec.rend());\\n auto it = vec.begin();\\n a = *it++; b = *it++; c = *it++;\\n int dummy[] = { (args = *it++, 0)... };\\n static_cast<void>(dummy);\\n }\\n template <class T>\\n void sort(vector<T> &A, vector<T> &B) {\\n vector<pair<T, T>> P(A.size());\\n for (int i = 0; i < A.size(); i++) P[i] = {A[i], B[i]};\\n sort(P.begin(), P.end());\\n for (int i = 0; i < A.size(); i++) A[i] = P[i].first, B[i] = P[i].second;\\n }\\n\\n istream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n }\\n ostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128]; char *d = end(buffer);\\n do {\\n --d; *d = \\\"0123456789\\\"[tmp % 10]; tmp /= 10;\\n } while (tmp != 0);\\n if (x < 0) { --d; *d = '-'; }\\n int len = end(buffer) - d;\\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\\n }\\n return os;\\n }\\n \\n __int128_t sto128(const string &S) {\\n __int128_t ret = 0; int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n }\\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\\n __int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n }\\n \\n string to_string(double x, int k) { // 小数第k+1を四捨五入して小数第k位までを出力\\n // 切り捨てがほしい場合は to_string(x, k+1) として pop_back() すればよい?\\n ostringstream os;\\n os << fixed << setprecision(k) << x;\\n return os.str();\\n }\\n string to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) { ret += \\\"-\\\"; x *= -1; }\\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n string to_string(char c) { string s = \\\"\\\"; s += c; return s; }\\n} using namespace util_function;\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n \\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n\\ntemplate<typename T>\\nclass Compress {\\npublic:\\n int sz = 0;\\n // gp_hash_table<T, int, custom_hash> Z;\\n // gp_hash_table<int, T, custom_hash> UZ;\\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\\n \\n Compress() {}\\n Compress(const vector<T> &V, T base = 0) {\\n this->sz = base;\\n set<T> s(V.begin(), V.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\\n this->sz = base;\\n vector<T> V3 = V2;\\n V3.insert(V3.end(), V1.begin(), V1.end());\\n set<T> s(V3.begin(), V3.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\\n this->sz = base;\\n vector<T> V4 = V1;\\n V4.insert(V4.end(), V2.begin(), V2.end());\\n V4.insert(V4.end(), V3.begin(), V3.end());\\n set<T> s(V4.begin(), V4.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2,\\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\\n this->sz = base;\\n vector<T> V5 = V1;\\n V5.insert(V5.end(), V2.begin(), V2.end());\\n V5.insert(V5.end(), V3.begin(), V3.end());\\n V5.insert(V5.end(), V4.begin(), V4.end());\\n set<T> s(V5.begin(), V5.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n vector<int> zip(const vector<T> &V) {\\n vector<int> ret(V.size());\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = Z[V[i]];\\n }\\n return ret;\\n }\\n \\n vector<T> unzip(const vector<int> &V) {\\n vector<T> ret(V.size());\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = UZ[V[i]];\\n }\\n return ret;\\n }\\n \\n int size() { return sz; }\\n \\n int encode(T x) { return Z[x]; }\\n T decode(int x) {\\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\\n return UZ[x];\\n }\\n};\\n \\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n return true;\\n\\t}\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase( remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }), G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par, sz;\\n};\\n \\ntemplate<typename T> struct BIT {\\n int N; // 要素数\\n vector<T> bit[2]; // データの格納先\\n BIT(int N_, int x = 0) {\\n N = N_ + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n if (x != 0) {\\n for (int i = 0; i < N; i++) add(i, x);\\n }\\n }\\n BIT(const vector<T> &A) {\\n N = A.size() + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\\n }\\n void add_sub(int p, int i, T x) {\\n while (i < N) { bit[p][i] += x; i += (i & -i); }\\n }\\n void add(int l, int r, T x) {\\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\\n }\\n void add(int i, T x) { add(i, i + 1, x); }\\n T sum_sub(int p, int i) {\\n T ret = 0;\\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\\n return ret;\\n }\\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\\n T sum(int l, int r) { return sum(r) - sum(l); }\\n T get(int i) { return sum(i, i + 1); }\\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\\n};\\n \\ntemplate<int mod> class Modint {\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n \\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator >(const Modint& r) { return this -> val > r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n\\n friend istream &operator >>(istream &is, Modint& x) {\\n int t; is >> t; x = t; return (is);\\n }\\n friend ostream &operator <<(ostream &os, const Modint& x) {\\n return os << x.val;\\n }\\n};\\nusing mint = Modint<MOD>;\\n \\nmint modpow(const mint &x, int n) {\\n if (n < 0) return (mint)1 / modpow(x, -n); // 未verify\\n assert(n >= 0);\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\nint modpow(__int128_t x, int n, int mod) {\\n assert(n >= 0 && mod > 0); // TODO: n <= -1\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n// int modinv(__int128_t x, int mod) { // \\n// assert(mod > 0);\\n// // assert(x > 0);\\n// if (x == 1 or x == 0) return 1;\\n// return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n// }\\n\\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1); _finv.resize(N + 1); _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1; _finv[0] = _finv[1] = 1; _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n \\nmint FAC(int N) {\\n if (N < 0) return 0; return _fac[N];\\n}\\nmint FACinv(int N) {\\n if (N < 0) return 0; return _finv[N];\\n}\\nmint COM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\nmint COMinv(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _finv[N] * _fac[K] * _fac[N - K];\\n}\\nmint MCOM(const vector<int> &V) {\\n int N = 0;\\n for (int i = 0; i < V.size(); i++) N += V[i];\\n mint ret = _fac[N];\\n for (int i = 0; i < V.size(); i++) ret *= _finv[V[i]];\\n return ret;\\n}\\nmint PERM(int N, int K) {\\n if (N < K) return 0; if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[N - K];\\n}\\nmint NHK(int N, int K) { // initのサイズに注意\\n if (N == 0 && K == 0) return 1;\\n return COM(N + K - 1, K);\\n}\\n \\n#pragma endregion\\n\\nsigned main() {\\n int N, K;\\n cin >> N >> K;\\n vector<int> A(N);\\n for (int i = 0; i < N; i++) {\\n cin >> A[i];\\n A[i]--;\\n }\\n\\n int g = 0;\\n for (int i = 0; i < N; i++) {\\n g ^= A[i] % (K + 1);\\n }\\n if (g == 0) cout << \\\"Second\\\" << endl;\\n else cout << \\\"First\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5164,\n \"score_of_the_acc\": -0.9141,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3057_8503256\",\n \"code_snippet\": \"/* -*- coding: utf-8 -*-\\n *\\n * 3057.cc: Problem G: First Kiss\\n */\\n\\n#include<cstdio>\\n#include<algorithm>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\n/* typedef */\\n\\n/* global variables */\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, d;\\n scanf(\\\"%d%d\\\", &n, &d);\\n\\n int x = 0;\\n for (int i = 0; i < n; i++) {\\n int ai;\\n scanf(\\\"%d\\\", &ai);\\n\\n x ^= (ai - 1) % (d + 1);\\n }\\n\\n if (x != 0) puts(\\\"First\\\");\\n else puts(\\\"Second\\\");\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2908,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3057_5704089\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main(){\\n int n, d;\\n cin >> n >> d;\\n vector<int> a(n);\\n for(auto &p: a) cin >> p;\\n\\n int g = 0;\\n for(auto &p: a){\\n p--;\\n g ^= p%(d+1);\\n }\\n\\n if(g == 0) cout << \\\"Second\\\" << endl;\\n else cout << \\\"First\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4040,\n \"score_of_the_acc\": -1.1253,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3057_5300114\",\n \"code_snippet\": \"//#include <atcoder/all>\\n//using namespace atcoder;\\n//using mint = modint;\\n\\n#include <bits/stdc++.h>\\n#define int long long\\n#define sint signed\\n#define endl \\\"\\\\n\\\" // fflush(stdout);\\n#define ALL(v) (v).begin(),(v).end()\\n#define Vi vector<int>\\n#define VVi vector<Vi>\\n#define VVVi vector<VVi>\\n#define Vm vector<mint>\\n#define VVm vector<Vm>\\n#define Vs vector<string>\\n#define Vd vector<double>\\n#define Vc vector<char>\\n#define Vb vector<bool>\\n#define Pii pair<int,int>\\n#define Pdd pair<double,double>\\n#define VPii vector<Pii>\\n#define Tiii tuple<int,int,int>\\n#define VTiii vector<Tiii>\\n#define PQi priority_queue<int>\\n#define PQir priority_queue<int,vector<int>,greater<int>>\\n#define pb push_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define itos to_string\\n#define stoi stoll\\n#define FI first\\n#define SE second\\n#define cYES cout<<\\\"YES\\\"<<endl\\n#define cNO cout<<\\\"NO\\\"<<endl\\n#define cYes cout<<\\\"Yes\\\"<<endl\\n#define cNo cout<<\\\"No\\\"<<endl\\n#define cyes cout<<\\\"yes\\\"<<endl\\n#define cno cout<<\\\"no\\\"<<endl\\n#define sortr(v) sort(v,greater<>())\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define repeq(i,a,b) for(int i=a;i<=b;i++)\\n#define repreq(i,a,b) for(int i=a;i>=b;i--)\\n#define dem(a,b) ((a+b-1)/(b))\\n#define INF 3000000000000000000 // 3.0*10^18\\n#define MAX LLONG_MAX\\n#define PI acos(-1.0L)\\n\\nusing namespace std;\\n\\n/* debug */\\ntemplate <typename T>\\nostream& operator<<(ostream& os,const vector<T> &V){int N=V.size();\\nif(N==0){os<<'.';return os;}rep(i,0,N-1){os<<V[i]<<' ';}os<<V[N-1];return os;}\\ntemplate <typename T>\\nostream& operator<<(ostream& os,const vector<vector<T>> &V){\\nint N=V.size();rep(i,0,N-1)os<<V[i]<<endl;os<<V[N-1];return os;}\\ntemplate <typename T,typename S>\\nostream& operator<<(ostream& os, pair<T,S> const&P){os<<P.FI<<' '<<P.SE;return os;}\\n//ostream& operator<<(ostream& os, mint const&M){os<<M.val();return os;}\\n\\n/* useful */\\ntemplate<typename T>void Vin(vector<T> &v){int n=v.size();rep(i,0,n)cin>>v[i];}\\nint scomb(int n, int r){if(r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr\\nint a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}\\nint digit_sum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}\\nint digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';}\\ntemplate<typename T>void press(T &v){v.erase(unique(ALL(v)),v.end());}\\nint SMALLER(Vi &a,int x){return lower_bound(a.begin(),a.end(),x)-a.begin();}\\nint orSMALLER(Vi &a,int x){return upper_bound(a.begin(),a.end(),x)-a.begin();}\\nint BIGGER(Vi &a,int x){return a.size()-orSMALLER(a,x);}\\nint orBIGGER(Vi &a,int x){return a.size()-SMALLER(a,x);}\\nint COUNT(Vi &a,int x) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}\\nint maxind(Vi &a){return max_element(ALL(a))-a.begin();}\\nint minind(Vi &a){return min_element(ALL(a))-a.begin();}\\ntemplate<typename T>bool chmax(T &a,T b) {if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>bool chmin(T &a,T b) {if(a>b){a=b;return 1;}return 0;}\\nint dtoi(double d,int g){return round(d*pow(10,g));}\\n/*\\nVi zip(Vi b){int Z=b.size();\\nPii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)\\np[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)\\n{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}\\n*/\\n//Vi vis(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}\\n\\n//const int MOD = 998244353;\\nconst int MOD = 1000000007;\\nconst double EPS = 1e-10;\\n\\nvoid init(){cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);\\ncout<<fixed<<setprecision(12);//mint::set_mod(MOD);\\n}\\n\\n/************************************ START ************************************/\\n\\nvoid sol() {\\n int n,m;cin >> n >> m;\\n Vi a(n);\\n Vin(a);\\n rep(i,0,n) a[i]--;\\n int gr = 0;\\n rep(i,0,n) {\\n int b = a[i]%(m+1);\\n gr ^= b;\\n }\\n if(gr) cout << \\\"First\\\" << endl;\\n else cout << \\\"Second\\\" << endl;\\n}\\n\\nsigned main() {\\n init();\\n int q = 1;\\n //cin >> q;\\n while(q--) sol();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4792,\n \"score_of_the_acc\": -0.93,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3057_4942803\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-7, PI = acos(-1);\\n//ここから編集\\n\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n int N, D; cin >> N >> D;\\n vector<int> a(N);\\n int x1or = 0;\\n REP(i,N) {\\n cin >> a[i];\\n x1or ^= ((a[i]-1)%(D+1));\\n }\\n\\n if(x1or == 0) cout << \\\"Second\\\" << endl;\\n else cout << \\\"First\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3964,\n \"score_of_the_acc\": -0.4279,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3057_4031790\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n, d, g = 0;\\n cin >> n >> d;\\n for(int i=0;i<n;i++){\\n int a;\\n cin >> a;\\n g ^= (a-1)%(d+1);\\n }\\n cout << (g ? \\\"First\\\" : \\\"Second\\\") << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3088,\n \"score_of_the_acc\": -1.0729,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3057_3887865\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MOD 1000000007\\n\\nint main(){\\n int n,d; cin >> n >> d;\\n int flag=0;\\n for(int i=0;i<n;++i){\\n int a; cin >> a;\\n a--;\\n a%=d+1;\\n flag^=a;\\n }\\n if(flag) cout << \\\"First\\\" << endl;\\n else cout << \\\"Second\\\" << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -1.0697,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3057_3846627\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#define _USE_MATH_DEFINES\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n\\nconst int INF = 0x3f3f3f3f;\\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007; // 998244353;\\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\n/*-------------------------------------------------*/\\nint main() {\\n cin.tie(nullptr); ios::sync_with_stdio(false);\\n // freopen(\\\"input.txt\\\", \\\"r\\\", stdin);\\n\\n int n, d; cin >> n >> d;\\n long long x = 0;\\n while (n--) {\\n int a; cin >> a;\\n --a;\\n a %= d + 1;\\n x ^= a;\\n }\\n cout << (x == 0 ? \\\"Second\\\\n\\\" : \\\"First\\\\n\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -0.1199,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3057_3764602\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\n// 解説を読んだ\\n// 各ポッキーが1 1 1 ... 1となった状態が負けなので、\\n// 全てのポッキーの長さを1減じたものに対するNimを考えればよい\\n// 長さxのポッキーに対するgrundy数は、観察を行うと\\n// (x-1)%(d+1)であることがわかる(実際に書き出せば明らか)\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, d;\\n cin >> n >> d;\\n int nim = 0;\\n while(n-- > 0){\\n int x; cin >> x;\\n nim ^= (x-1)%(d+1);\\n }\\n cout << (nim==0 ? \\\"Second\\\" : \\\"First\\\") << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.1102,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3057_3764598\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\n// 解説を読んだ\\n// 各ポッキーが1 1 1 ... 1となった状態が負けなので、\\n// 全てのポッキーの長さを1減じたものに対するNimを考えればよい\\n// 長さxのポッキーに対するgrundy数は、観察を行うと\\n// (x-1)%(d+1)であることがわかる(実際に書き出せば明らか)\\n\\nint main(){\\n int n, d;\\n cin >> n >> d;\\n int nim = 0;\\n while(n-- > 0){\\n int x; cin >> x;\\n nim ^= (x-1)%(d+1);\\n }\\n cout << (nim==0 ? \\\"Second\\\" : \\\"First\\\") << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3088,\n \"score_of_the_acc\": -1.0729,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3057_3659300\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,d;\\n cin>>n>>d;\\n vector<Int> a(n);\\n for(Int i=0;i<n;i++) cin>>a[i],a[i]--;\\n Int ans=0;\\n for(Int i=0;i<n;i++) ans^=a[i]%(d+1);\\n cout<<(ans?\\\"First\\\":\\\"Second\\\")<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4808,\n \"score_of_the_acc\": -0.7699,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3057_3630924\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <tuple>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\nusing namespace std;\\n#define reps(i,s,n) for(int i = s; i < n; i++)\\n#define rep(i,n) reps(i,0,n)\\n#define fi first\\n#define se second\\ntypedef long long ll;\\n\\nint N,M,H,W,K,A,B;\\nstring S;\\nstring alpha = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nstring ALPHA = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n\\nint f(int a,int d){\\n int ans = (a+d)%(d+1);\\n //cout<<ans<<endl;\\n return ans;\\n}\\n\\nint main() {\\n int D;\\n cin>> N >> D;\\n int g = 0;\\n int a;\\n rep(i,N){\\n cin>>a;\\n g = g^f(a,D);\\n //cout<<g<<endl;\\n }\\n if(g) {\\n cout << \\\"First\\\" << endl;\\n }else{\\n cout << \\\"Second\\\"<< endl;\\n }\\n int y = 7^10;\\n //cout<<y<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -1.1167,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3057_3626709\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nint main(){\\n\\n\\tint value = 0;\\n\\n\\tint N,D;\\n\\n\\tscanf(\\\"%d %d\\\",&N,&D);\\n\\n\\tint tmp;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%d\\\",&tmp);\\n\\t\\tvalue ^= (tmp-1)%(D+1);\\n\\t}\\n\\n\\tif(value != 0){\\n\\t\\tprintf(\\\"First\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"Second\\\\n\\\");\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.2639,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3057_3481590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nint n,d,x,s;\\nmain(){\\n\\tscanf(\\\"%d%d\\\",&n,&d);\\n\\twhile(n--){\\n\\t\\tscanf(\\\"%d\\\",&x);\\n\\t\\ts^=(x-1)%(d+1);\\n\\t}\\n\\tputs(s?\\\"First\\\":\\\"Second\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.272,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1899,"cells":{"group_id":{"kind":"string","value":"aoj_3059_cpp"},"problem_description":{"kind":"string","value":"Problem I: Shuffle 2\nProblem\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が書かれている。この束に対して、以下のように定義されるシャッフルを$q$回行う。\n束を下から見たとき、奇数番目のカードを上に重ねていって作られる束$x$、偶数番目のカードを上に重ねていって作られる束$y$を考える。その後以下の$2$つのうち、好きな操作を行う。\n操作 $0$： 束$x$の上に束$y$をのせて$1$つの束にする。\n操作 $1$： 束$y$の上に束$x$をのせて$1$つの束にする。\n例えば、$6$枚のカードからなる束(下から123456)に対して$1$回のシャッフルを行うことを考えたとき、操作$0$を行った場合に得られる束は下から\n246135\n135246、操作$1$を行った場合に得られる束は下から\n135246\n246135である。(14:52修正)\n$q$回のシャッフルの後、$k$の書かれたカードが束の下から$d$番目にあるようにしたい。\n可能であるなら$q$回のシャッフルの操作を順番に出力し、不可能ならば$-1$を出力せよ。\nInput\n入力は以下の形式で与えられる。\n$n$ $q$ $k$ $d$\nConstraints\n入力は以下の条件を満たす。\n$2 \\le n \\le 10^{15}$\n$1 \\le q \\le 10^6$\n$1 \\le k,d \\le n$\n$n$は偶数\nOutput\n条件を満たすシャッフルが可能なら$q$行にシャッフルの操作を出力せよ。\n不可能なら$-1$を出力せよ。\nSample Input 1\n4 2 1 1\nSample Output 1\n0\n0\nSample Input 2\n4 2 3 1\nSample Output 2\n0\n1\nSample Input 3\n4 1 1 4\nSample Output 3\n-1\nSample Input 4\n7834164883628 15 2189823423122 5771212644938\nSample Output 4\n0\n1\n1\n1\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_3059_10892983","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nll modmul(ll a, ll b, ll mod) {\n\tll ret = a * b - mod * ll(1.L / mod * a * b);\n\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\n}\n\nll modpow(ll a, ll b, ll mod) {\n\tll ans = 1;\n\tfor(; b; a = modmul(a, a, mod), b /= 2)\n\t\tif (b & 1) ans = modmul(ans, a, mod);\n\treturn ans;\n}\n\nvoid solve(){\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\n s--; t--;\n vl two(Q+1, 1);\n rep(i, Q) two[i+1] = two[i] * 2 % N;\n ll u = modmul(t, two[Q], N);\n ll gap = (s + N - u) % N;\n if(Q <= 50 && two[Q] == (1LL<<Q)){\n if(gap >= two[Q]){\n cout << -1 << endl;\n return;\n }\n }\n vl ans(Q);\n ll idx = 0;\n vl inv(Q, 0);\n while(gap){\n ll y = gap % 2;\n inv[idx] = y; idx++;\n gap /= 2;\n }\n ll x = t;\n rrep(i, 0, Q){\n if(x * 2 < N) ans[i] = inv[i];\n else ans[i] = inv[i]^1;\n x = (x * 2 + inv[i]) % N;\n }\n rep(i, Q){\n cout << ans[i] << endl;\n }\n \n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":1,"time_ms":620,"memory_kb":24472,"score_of_the_acc":-1.0487,"final_rank":6},{"submission_id":"aoj_3059_10892933","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n\n#define rep(i,n) for(ll i=0;i<n;++i)\n#define all(a) (a).begin(),(a).end()\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &a){\n if (a.empty()) return os;\n os << a.front();\n for (auto e : a | views::drop(1)){\n os << ' ' << e;\n }\n return os;\n}\n\nvoid dump(auto ...vs){\n ((cout << vs << ' '), ...) << endl;\n}\n\n\n\nvoid solve() {\n ll N,Q,K,D;\n cin>>N>>Q>>K>>D;\n K--;\n D--;\n ll l=D;\n ll r=D+1;\n ll rest=Q;\n vector<pair<ll,ll>> P;\n rep(i,Q){\n P.push_back({l,r});\n l*=2;\n r*=2;\n ll d=l/N;\n l-=d*N;\n r-=d*N;\n rest-=1;\n if (r-l>=N){\n break;\n }\n }\n vector<ll> op;\n rep(i,rest){\n op.push_back(0);\n if (K%2==0){\n K/=2;\n }\n else{\n K/=2;\n K+=N/2;\n }\n }\n if (!((l<=K and K<r) or (l<=K+N and K+N<r))){\n cout<<-1<<endl;\n return;\n }\n reverse(all(P));\n for (auto [l,r]:P){\n ll nxt;\n nxt=K/2;\n if ((l<=nxt and nxt<r) or (l<=nxt+N and nxt+N<r)){\n if (K%2==0){\n op.push_back(0);\n }\n else{\n op.push_back(1);\n }\n K=nxt;\n continue;\n }\n nxt=K/2+N/2;\n if ((l<=nxt and nxt<r) or (l<=nxt+N and nxt+N<r)){\n if (K%2==0){\n op.push_back(1);\n }\n else{\n op.push_back(0);\n }\n K=nxt;\n continue;\n }\n assert (false);\n }\n for (ll a:op){\n cout<<a<<endl;\n }\n return;\n}\n\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n ll T=1;\n while (T--){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":12792,"score_of_the_acc":-0.5173,"final_rank":4},{"submission_id":"aoj_3059_10892928","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nll modmul(ll a, ll b, ll mod) {\n\tll ret = a * b - mod * ll(1.L / mod * a * b);\n\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\n}\n\nll modpow(ll a, ll b, ll mod) {\n\tll ans = 1;\n\tfor(; b; a = modmul(a, a, mod), b /= 2)\n\t\tif (b & 1) ans = modmul(ans, a, mod);\n\treturn ans;\n}\n\nvoid solve(){\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\n s--; t--;\n vl two(Q+1, 1);\n rep(i, Q) two[i+1] = two[i] * 2 % N;\n ll u = modmul(t, two[Q], N);\n ll gap = (s + N - u) % N;\n if(Q <= 50 && two[Q] == (1LL<<Q)){\n if(gap >= two[Q]){\n cout << -1 << endl;\n return;\n }\n }\n ll x = t;\n vl ans(Q);\n rep(i, Q){\n if(x * 2 < N) ans[i] = 0;\n else ans[i] = 1;\n x = (x * 2) % N;\n }\n reverse(all(ans));\n ll idx = 0;\n while(gap){\n ll y = gap % 2;\n ans[idx] ^= y; idx++;\n gap /= 2;\n }\n rep(i, Q){\n cout << ans[i] << endl;\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":0.16666666666666666,"time_ms":630,"memory_kb":17372,"score_of_the_acc":-0.935,"final_rank":18},{"submission_id":"aoj_3059_10892910","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nll modmul(ll a, ll b, ll mod) {\n\tll ret = a * b - mod * ll(1.L / mod * a * b);\n\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\n}\n\nll modpow(ll a, ll b, ll mod) {\n\tll ans = 1;\n\tfor(; b; a = modmul(a, a, mod), b /= 2)\n\t\tif (b & 1) ans = modmul(ans, a, mod);\n\treturn ans;\n}\n\nvoid solve(){\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\n s--; t--; ll M = N / 2;\n vl ans(Q, 0);\n vl two(Q+1, 1);\n rep(i, Q) two[i+1] = two[i] * 2 % N;\n ll u = modmul(t, two[Q], N);\n if(Q <= 50 && two[Q] == (1LL<<Q)){\n if((s + N - u) % N >= two[Q]){\n cout << -1 << endl;\n return;\n }\n }\n ll gap = (s + N - u) % N;\n ll x = t;\n rep(i, Q){\n if(x * 2 < N) ans[i] = 0;\n else ans[i] = 1;\n x = (x * 2) % N;\n }\n reverse(all(ans));\n ll idx = 0;\n while(gap){\n ll y = gap % 2;\n ans[idx] ^= y; idx++;\n gap >>= 1;\n }\n rep(i, Q){\n cout << ans[i] << endl;\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":0.16666666666666666,"time_ms":620,"memory_kb":17336,"score_of_the_acc":-0.9231,"final_rank":17},{"submission_id":"aoj_3059_10892894","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T> using vvv = vv<vec<T>>;\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\n#define all(a) (a).begin(),(a).end()\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\n#define sz(x) (ll) (x).size()\ntemplate <typename T>\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\ntemplate <typename T>\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\n\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n ld x;\n ld y;\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\n Point operator/(ld a) { return Point(x / a, y / a); }\n\n ld abs() { return sqrt(norm()); }\nld norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return !equals(x, p.x) ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n ld r;\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\n\nstruct Edge {\n ll from, to, cost;\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\n};\nstruct Graph {\n vector<vector<Edge>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n vector<Edge> &operator[](const int &k) {\n return G[k];\n }\n};\nusing Edges = vector<Edge>;\n\nll modmul(ll a, ll b, ll mod) {\n\tll ret = a * b - mod * ll(1.L / mod * a * b);\n\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\n}\n\nll modpow(ll a, ll b, ll mod) {\n\tll ans = 1;\n\tfor(; b; a = modmul(a, a, mod), b /= 2)\n\t\tif (b & 1) ans = modmul(ans, a, mod);\n\treturn ans;\n}\n\nvoid solve(){\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\n s--; t--; ll M = N / 2;\n vl ans(Q, 0);\n vl two(Q+1, 1);\n rep(i, Q) two[i+1] = two[i] * 2 % N;\n ll u = modmul(t, two[Q], N);\n if(Q <= 50 && two[Q] == (1LL<<Q)){\n if((s + N - u) % N >= two[Q]){\n cout << -1 << endl;\n return;\n }\n }\n ll gap = (s + N - u) % N;\n ll x = t;\n rep(i, Q){\n if(x * 2 < N) ans[i] = 0;\n else ans[i] = 1;\n x = (x * 2) % N;\n }\n reverse(all(ans));\n ll idx = 0;\n while(gap){\n ll x = gap % 2;\n ans[idx] ^= x; idx++;\n gap >>= 1;\n }\n rep(i, Q){\n cout << ans[i] << endl;\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int t = 1;\n // cin >> t;\n while(t--){\n solve();\n }\n}","accuracy":0.16666666666666666,"time_ms":630,"memory_kb":17516,"score_of_the_acc":-0.9375,"final_rank":19},{"submission_id":"aoj_3059_10891244","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\n\n\nvoid solve();\n// POP'N ROLL MUSIC / TOMOO\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int t = 1;\n // cin >> t;\n rep(i, 0, t) solve();\n}\n\nvoid solve(){\n ll N, Q, K, D;\n cin >> N >> Q >> K >> D;\n K--, D--;\n vector<int> digi(Q + 100);\n rep(k, 0, 50){\n if ((D + 1) & (1ll << k)) digi[k + Q] = 1;\n }\n auto mim = [&](int a) -> void {\n while ((int)(digi.size()) != a && digi[a] == 0) digi[a] = 1, a++;\n if ((int)digi.size() > a) digi[a] = 0;\n };\n // vec_out(digi);\n mim(0);\n rep(k, 0, 50){\n if (K & (1ll << k)) mim(k);\n }\n // vec_out(digi);\n vector<int> ans(Q);\n for (int i = Q - 1; i >= 0; i--){\n ll tmp = 0;\n rep(d, 0, 55) if (digi[d + i]) tmp += (1ll << d);\n if (tmp >= N){\n ans[i] = 1;\n rep(d, 0, 50) if (N & (1ll << d)) mim(d + i);\n }\n // vec_out(digi);\n }\n vector<int> n_ans;\n for (auto x : ans){\n n_ans.push_back((K + x) % 2);\n K /= 2;\n if (x) K += N / 2;\n }\n if (K == D){\n for (auto x : n_ans) cout << x << \"\\n\";\n }\n else{\n cout << \"-1\\n\";\n }\n}","accuracy":1,"time_ms":260,"memory_kb":16052,"score_of_the_acc":-0.496,"final_rank":3},{"submission_id":"aoj_3059_3659305","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,q,k,d;\n cin>>n>>q>>k>>d;\n k--;d--;\n \n const int MAX = 60;\n while(q>=MAX){\n cout<<(k&1)<<\"\\n\";\n k/=2;\n q--;\n }\n\n using I = __int128;\n I N=n,Q=q,K=k,D=d;\n\n I X=((D+0)*(I(1)<<Q)-K+N-1)/N;\n I Y=((D+1)*(I(1)<<Q)-K+N-1)/N;\n\n if(X==Y){\n cout<<-1<<endl;\n return 0;\n }\n\n for(int i=0;i<q;i++){\n int b=int((X>>i)&1)^(k&1);\n k/=2;\n k+=(n/2)*int((X>>i)&1);\n cout<<b<<\"\\n\";\n }\n assert(k==d);\n \n cout<<flush;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3216,"score_of_the_acc":-0.0341,"final_rank":1},{"submission_id":"aoj_3059_3427495","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef long double ld;\nconst int INF=1e9,MOD=1e9+7;\nconst ll LINF=1e18;\nusing namespace std;\n#define int long long\n//template\n//main\nsigned main(){\n int n,q,k,d;cin>>n>>q>>k>>d;\n k--;d--;\n std::vector<int> ans;\n int sd=d;\n for(int i=0;i<q;i++)sd=sd*2%n;\n int a=(k-sd+n)%n;\n std::vector<int> vs;\n for(int i=0;i<q;i++){\n vs.push_back(a%2);\n a/=2;\n }\n if(a){cout<<-1<<endl;return 0;}\n for(int i=0;i<q;i++){\n int b1=vs[q-1-i];\n int b2=(d>=n/2);\n ans.push_back(b1^b2);\n d=d*2%n+b1;\n }\n reverse(ans.begin(),ans.end());\n //cout<<d<<endl;\n for(int p:ans)cout<<p<<endl;\n}","accuracy":1,"time_ms":910,"memory_kb":22280,"score_of_the_acc":-1.3359,"final_rank":11},{"submission_id":"aoj_3059_3427492","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef long double ld;\nconst int INF=1e9,MOD=1e9+7;\nconst ll LINF=1e18;\nusing namespace std;\n#define int long long\n//template\n//main\nsigned main(){\n int n,q,k,d;cin>>n>>q>>k>>d;\n k--;d--;\n std::vector<int> ans;\n int sd=d;\n for(int i=0;i<q;i++)sd=sd*2%n;\n int a=(k-sd+n)%n;\n int l=1;int c=0;\n for(int i=0;i<q;i++){\n l*=2;\n if(l>a)break;\n c++;\n }\n int g=pow(2,60);\n if(c==q){cout<<-1<<endl;return 0;}\n for(int i=0;i<q;i++){\n int b1=(a>>(q-1))&1;\n int b2=(d>=n/2);\n ans.push_back(b1^b2);\n a*=2;a%=g;\n d=d*2%n+b1;\n }\n reverse(ans.begin(),ans.end());\n //cout<<d<<endl;\n for(int p:ans)cout<<p<<endl;\n}","accuracy":0.16666666666666666,"time_ms":790,"memory_kb":11136,"score_of_the_acc":-1.005,"final_rank":20},{"submission_id":"aoj_3059_3425486","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nll n,q,k,d;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n cin>>n>>q>>k>>d;\n k--;d--;\n ll crt=d;\n rep(i,q)crt=(crt*2)%n;\n ll rest=(k-crt+n)%n;\n if(q<60&&rest>=(1LL<<q)){\n cout<<-1<<endl;\n return 0;\n }\n\n vector<ll> mv(q,0);\n rep(i,60){\n if((rest>>i)&1)mv[i]=1;\n }\n\n vector<ll> res(q);\n crt=d;\n for(ll i=q-1;i>=0;i--){\n if(crt<n/2) res[i]=mv[i];\n else res[i]=1-mv[i];\n crt=(crt*2+mv[i])%n;\n }\n assert(crt==k);\n rep(i,q)cout<<res[i]<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":810,"memory_kb":16960,"score_of_the_acc":-1.1299,"final_rank":8},{"submission_id":"aoj_3059_3420547","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing pint = pair<int,int>;\n\nlong long N, Q, K, D;\nvoid solve() {\n --K, --D;\n long long pK = K, pD = D;\n for (int i = 0; i < Q; ++i) D = D * 2 % N;\n long long diff = (K - D + N) % N;\n\n // tmp: 逆順で見たときの 0: 2x、1: 2x+1\n vector<long long> tmp;\n while (diff) {\n tmp.push_back(diff & 1);\n diff >>= 1;\n }\n if (tmp.size() > Q) { cout << -1 << endl; return; }\n while (tmp.size() < Q) tmp.push_back(0);\n reverse(tmp.begin(), tmp.end());\n\n // 実際の操作に適合した復元\n vector<long long> res;\n for (int q = 0; q < tmp.size(); ++q) {\n long long nD = pD * 2;\n if (tmp[q]) ++nD;\n nD %= N;\n\n // nD -> pD が実際には 0 なのか 1 なのかを判定\n if (nD % 2 == 0) {\n if (pD == nD/2) res.push_back(0);\n else res.push_back(1);\n }\n else {\n if (pD == nD/2) res.push_back(1);\n else res.push_back(0);\n }\n pD = nD;\n }\n reverse(res.begin(), res.end());\n for (int i = 0; i < Q; ++i) cout << res[i] << endl;\n}\n\nint main() {\n cin >> N >> Q >> K >> D;\n solve();\n}","accuracy":1,"time_ms":820,"memory_kb":22288,"score_of_the_acc":-1.235,"final_rank":10},{"submission_id":"aoj_3059_3416155","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nll under[1000500];\nll over[1000500];\nll n, q, k, d;\n\nvoid query(int now) {\n ll delta = (over[now+1] - under[now+1] + 1 + n) % n;\n if(delta * 2 >= n || delta == 0) {\n under[now] = 1;\n over[now] = n;\n return;\n }\n ll after = under[now+1];\n if(after > n / 2) after - n / 2;\n ll new_under = ((after-1) * 2 + 1) % n;\n under[now] = new_under;\n over[now] = (new_under + delta * 2 - 1 + n) % n;\n return;\n}\n\nbool isin(ll under, ll over, ll val) {\n if(under <= over) {\n if(((under <= val) && (val <= over))) {\n //cout << -1 << endl;\n return true;\n }\n } else {\n if(((val >= under) || (val <= over))) {\n //cout << -1 << endl;\n return true;\n }\n }\n //cerr << \"FAILED \" << under << \" \" << over << \" \" << val << endl;\n return false;\n}\n\nll one(ll now) {\n if(now % 2 == 0) {\n return now / 2;\n }\n return n / 2 + (now + 1) / 2;\n}\n\nll zero(ll now) {\n if(now % 2 == 0) {\n return n / 2 + now / 2;\n }\n return (now + 1) / 2;\n}\n\nint main() {\n cin >> n >> q >> k >> d;\n over[q] = d;\n under[q] = d;\n for(int i = q - 1; i >= 0; i--) {\n query(i);\n }\n for(int i = 0; i <= q; i++) {\n //cout << under[i] << \" \" << over[i] << endl;\n }\n /*\n if(under[0] < over[0]) {\n if(!((under[0] <= k) && (k <= over[0]))) {\n //cout << -1 << endl;\n return 0;\n }\n } else {\n if(!((k >= under[0]) || (k <= over[0]))) {\n //cout << -1 << endl;\n return 0;\n }\n }\n */\n if(!isin(under[0], over[0], k)) {\n cout << -1 << endl;\n return 0;\n }\n vector<int> ans;\n ll now = k;\n for(int i = 1; i <= q; i++) {\n ll NEW = zero(now);\n //cout << i << \" NEWNUMBER : \" << NEW << endl;\n if(isin(under[i], over[i], NEW)) {\n ans.push_back(0);\n now = NEW;\n //cout << \"0 \" << now << endl;\n continue;\n }\n NEW = one(now);\n ans.push_back(1);\n now = NEW;\n //cout << \"1 \" << now << endl;\n }\n for(int i = 0; i < ans.size(); i++) {\n cout << ans[i] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":810,"memory_kb":21296,"score_of_the_acc":-1.2063,"final_rank":9},{"submission_id":"aoj_3059_3414641","code_snippet":"#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\nbool check(vector<pair<ll, ll>> &v, ll x) {\n REP(i, 0, v.size()) {\n if (v[i].first <= x && x < v[i].second) {\n return true;\n }\n }\n return false;\n}\n\nint main(void) {\n ll N, Q, K, D;\n cin >> N >> Q >> K >> D, K--, D--;\n\n vector<vector<pair<ll, ll>>> z(Q + 1);\n z[Q].push_back(make_pair(D, D + 1));\n\n for (ll i = Q - 1; i >= 0; i--) {\n vector<pair<ll, ll>> v;\n REP(k, 0, z[i + 1].size()) {\n ll l = z[i + 1][k].first, h = z[i + 1][k].second;\n if (l < N / 2 && h <= N / 2) {\n v.push_back(make_pair(l * 2, h * 2));\n } else if (l < N / 2 && h > N / 2) {\n v.push_back(make_pair(l * 2, N));\n v.push_back(make_pair(0, h * 2 - N));\n } else if (l >= N / 2 && h > N / 2) {\n v.push_back(make_pair(l * 2 - N, h * 2 - N));\n }\n }\n\n sort(v.begin(), v.end());\n\n REP(k, 0, v.size()) {\n assert(v[k].first < v[k].second);\n if (z[i].size() >= 1) {\n if (z[i].back().second >= v[k].first) {\n z[i].back().second = v[k].second;\n continue;\n }\n }\n z[i].push_back(v[k]);\n }\n }\n\n if (!check(z[0], K)) {\n cout << -1 << endl;\n } else {\n vector<ll> ans(Q);\n ll x = K;\n REP(i, 0, Q) {\n ll n = x % 2 == 0 ? x / 2 : x / 2 + N / 2;\n if (check(z[i + 1], n)) {\n x = n;\n ans[i] = 0;\n } else {\n x = x % 2 == 0 ? x / 2 + N / 2 : x / 2;\n ans[i] = 1;\n }\n }\n REP(i, 0, Q) printf(\"%ld\\n\", ans[i]);\n }\n}","accuracy":1,"time_ms":130,"memory_kb":60012,"score_of_the_acc":-1.1236,"final_rank":7},{"submission_id":"aoj_3059_3414115","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef int _loop_int;\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\n\n#define DEBUG(x) cout<<#x<<\": \"<<x<<endl\n#define DEBUG_VEC(v) cout<<#v<<\":\";REP(i,v.size())cout<<\" \"<<v[i];cout<<endl\n#define ALL(a) (a).begin(),(a).end()\n\n#define CHMIN(a,b) a=min((a),(b))\n#define CHMAX(a,b) a=max((a),(b))\n\n// mod\nconst ll MOD = 1000000007ll;\n#define FIX(a) ((a)%MOD+MOD)%MOD\n\n// floating\ntypedef double Real;\nconst Real EPS = 1e-11;\n#define EQ0(x) (abs(x)<EPS)\n#define EQ(a,b) (abs(a-b)<EPS)\ntypedef complex<Real> P;\n\nll n,q,k,d;\nll low[1252525], high[1252525];\n\nint main(){\n scanf(\"%lld%lld%lld%lld\",&n,&q,&k,&d);\n --k;--d;\n low[0] = high[0] = d;\n REP(i,q){\n low[i+1] = n; high[i+1] = -1;\n {\n ll x = low[i];\n if(x>=n/2)x-=n/2;\n CHMIN(low[i+1], 2*x);\n CHMAX(high[i+1], 2*x+1);\n }\n {\n ll x = high[i];\n if(x>=n/2)x-=n/2;\n CHMIN(low[i+1], 2*x);\n CHMAX(high[i+1], 2*x+1);\n }\n if(low[i]<=n/2-1 && n/2-1<=high[i]){\n ll x = n/2-1;\n if(x>=n/2)x-=n/2;\n CHMIN(low[i+1], 2*x);\n CHMAX(high[i+1], 2*x+1);\n }\n if(low[i]<=n/2 && n/2<=high[i]){\n ll x = n/2;\n if(x>=n/2)x-=n/2;\n CHMIN(low[i+1], 2*x);\n CHMAX(high[i+1], 2*x+1);\n }\n }\n if(k<low[q] || k>high[q]){\n puts(\"-1\");return 0;\n }\n ll x = k;\n FORR(i,0,q){\n if(low[i]<=x/2 && x/2<=high[i]){\n puts(x%2==0 ? \"0\" : \"1\");\n x = x/2;\n }else{\n puts(x%2==0 ? \"1\" : \"0\");\n x = x/2 + n/2;\n }\n }\n assert(x == d);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":17352,"score_of_the_acc":-0.2492,"final_rank":2},{"submission_id":"aoj_3059_3414031","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n#include <unordered_map>\n#include <unordered_set>\n#include <array>\n// stream\n//#include <istream>\n#include <sstream>\n//#include <ostream>\n#include <fstream>\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \"\\t:\" << (dist) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\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) { return a = (a < b) ? b : a; }\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\tos << \"(\" << p.first << \", \" << p.second << \")\"; 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 = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n// ------------>8------------------------------------->8------------\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) (res *= n) %= mod;\n\t\t(n *= n) %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, n, q, k, d);\n\t--k; --d;\n\n\tauto move = [&](int x, int type) {\n\t\tint t = x / 2;\n\t\tint o = x & 1;\n\t\treturn t + (type != o) * (n / 2);\n\t};\n\tauto move2 = [&](int x, int type) {\n\t\treturn (2 * x + type) % n;\n\t};\n\n\tif (q == 1) {\n\t\tint ans = -1;\n\t\tREP(t, 2) if (move(k, t) == d) ans = t;\n\t\tOUT(ans)BR;\n\t\treturn 0;\n\t}\n\n\t[&] {\n\n\t\tint r = 0;\n\t\tint mi = std::min(q, 52LL);\n\t\tint now = powMod(2, q, n);\n\t\tFOR(i, q, INFINT) {\n\t\t\tint di = i - q;\n\t\t\tif (d < 1LL << di) break;\n\t\t\tif (d & 1LL << di) (r += now) %= n;\n\t\t\t(now *= 2) %= n;\n\t\t}\n\n\t\tint bit = (k - r) % n;\n\t\tif (bit < 0) bit += n;\n\t\tif (bit > (1LL << mi) - 1) return;\n\n\t\tV<int> preans;\n\t\tREP(_, mi) {\n\t\t\tpreans.emplace_back(bit & 1);\n\t\t\tbit /= 2;\n\t\t}\n\t\tREP(i, q - mi) preans.emplace_back(0);\n\n\t\tV<int> num({ d });\n\t\tnow = d;\n\t\tRREP(i, preans.size()) {\n\t\t\tnow = move2(now, preans[i]);\n\t\t\tnum.emplace_back(now);\n\t\t}\n\t\tstd::reverse(ALL(num));\n\n\t\tV<int> ans;\n\t\tREP(i, num.size() - 1) {\n\t\t\tREP(t, 2) {\n\t\t\t\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\n\t\t\t}\n\t\t}\n\t\tif (ans.size() != q) return;\n\n\t\tREP(i, q) {\n\t\t\tOUT(ans[i])BR;\n\t\t}\n\t\texit(0);\n\t}();\n\tOUT(-1)BR;\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":60,"memory_kb":29204,"score_of_the_acc":-0.5027,"final_rank":12},{"submission_id":"aoj_3059_3414012","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n#include <unordered_map>\n#include <unordered_set>\n#include <array>\n// stream\n//#include <istream>\n#include <sstream>\n//#include <ostream>\n#include <fstream>\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \"\\t:\" << (dist) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\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) { return a = (a < b) ? b : a; }\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\tos << \"(\" << p.first << \", \" << p.second << \")\"; 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 = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n// ------------>8------------------------------------->8------------\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) (res *= n) %= mod;\n\t\t(n *= n) %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, n, q, k, d);\n\t--k; --d;\n\n\tauto move = [&](int x, int type) {\n\t\tint t = x / 2;\n\t\tint o = x & 1;\n\t\treturn t + (type != o) * (n / 2);\n\t};\n\tauto move2 = [&](int x, int type) {\n\t\treturn (2 * x + type) % n;\n\t};\n\n\tif (q == 1) {\n\t\tint ans = -1;\n\t\tREP(t, 2) if (move(k, t) == d) ans = t;\n\t\tOUT(ans)BR;\n\t\treturn 0;\n\t}\n\n\tREP(T, 2) {\n\t\t[&] {\n\t\t\tint k1 = k / 2 + T * (n / 2);\n\n\t\t\tint r = 0;\n\t\t\tint mi = std::min(q - 1, 52LL);\n\t\t\tint now = powMod(2, q - 1, n);\n\t\t\tFOR(i, q - 1, INFINT) {\n\t\t\t\tint di = i - (q - 1);\n\t\t\t\tif (d < 1LL << di) break;\n\t\t\t\tif (d & 1LL << di) (r += now) %= n;\n\t\t\t\t(now *= 2) %= n;\n\t\t\t}\n\n\t\t\tint bit = (k1 - r) % MOD;\n\t\t\tif (bit < 0) bit += n / 2;\n\t\t\tif (bit > (1LL << mi) - 1) return;\n\n\t\t\tV<int> preans;\n\t\t\tREP(_, mi) {\n\t\t\t\tpreans.emplace_back(bit & 1);\n\t\t\t\tbit /= 2;\n\t\t\t}\n\t\t\tREP(i, q - 1 - mi) preans.emplace_back(0);\n\n\t\t\tV<int> num({ d });\n\t\t\tnow = d;\n\t\t\tRREP(i, preans.size()) {\n\t\t\t\tnow = move2(now, preans[i]);\n\t\t\t\tnum.emplace_back(now);\n\t\t\t}\n\t\t\tnum.emplace_back(k);\n\t\t\tstd::reverse(ALL(num));\n\n\t\t\tV<int> ans;\n\t\t\tREP(i, num.size() - 1) {\n\t\t\t\tREP(t, 2) {\n\t\t\t\t\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ans.size() != q) return;\n\n\t\t\tREP(i, q) {\n\t\t\t\tOUT(ans[i])BR;\n\t\t\t}\n\t\t\texit(0);\n\t\t}();\n\t}\n\tOUT(-1)BR;\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":50,"memory_kb":32200,"score_of_the_acc":-0.5442,"final_rank":13},{"submission_id":"aoj_3059_3413994","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n#include <unordered_map>\n#include <unordered_set>\n#include <array>\n// stream\n//#include <istream>\n#include <sstream>\n//#include <ostream>\n#include <fstream>\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \"\\t:\" << (dist) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\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) { return a = (a < b) ? b : a; }\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\tos << \"(\" << p.first << \", \" << p.second << \")\"; 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 = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n// ------------>8------------------------------------->8------------\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) (res *= n) %= mod;\n\t\t(n *= n) %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, n, q, k, d);\n\t--k; --d;\n\n\tauto move = [&](int x, int type) {\n\t\tint t = x / 2;\n\t\tint o = x & 1;\n\t\treturn t + (type != o) * (n / 2);\n\t};\n\tauto move2 = [&](int x, int type) {\n\t\treturn (2 * (x % (n / 2)) + type) % (n);\n\t};\n\n\tif (q == 1) {\n\t\tint ans = -1;\n\t\tREP(t, 2) if (move(k, t) == d) ans = t;\n\t\tOUT(ans)BR;\n\t\treturn 0;\n\t}\n\n\tREP(T, 2) {\n\t\t[&] {\n\t\t\tint k1 = k / 2 + T * (n / 2);\n\n\t\t\tint r = 0;\n\t\t\tint mi = std::min(q - 1, 52LL);\n\t\t\tint now = powMod(2, mi, n / 2);\n\t\t\tFOR(i, mi, INFINT) {\n\t\t\t\tif (i >= q - 1) {\n\t\t\t\t\tint di = i - (q - 1);\n\t\t\t\t\tif (d < 1LL << di) break;\n\t\t\t\t\tif (d & 1LL << di) (r += now) %= n / 2;\n\t\t\t\t}\n\t\t\t\t(now *= 2) %= n / 2;\n\t\t\t}\n\n\t\t\tint bit = (k1 - r) % MOD;\n\t\t\tif (bit < 0) bit += n / 2;\n\t\t\tif (bit > (1LL << mi) - 1) return;\n\n\t\t\tV<int> preans;\n\t\t\tREP(_, mi) {\n\t\t\t\tpreans.emplace_back(bit & 1);\n\t\t\t\tbit /= 2;\n\t\t\t}\n\t\t\tREP(i, q - 1 - mi) preans.emplace_back(0);\n\n\t\t\tV<int> num({ d });\n\t\t\tnow = d;\n\t\t\tRREP(i, preans.size()) {\n\t\t\t\tnow = move2(now, preans[i]);\n\t\t\t\tnum.emplace_back(now);\n\t\t\t}\n\t\t\tnum.emplace_back(k);\n\t\t\tstd::reverse(ALL(num));\n\n\t\t\tV<int> ans;\n\t\t\tREP(i, num.size() - 1) {\n\t\t\t\tREP(t, 2) {\n\t\t\t\t\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ans.size() != q) return;\n\n\t\t\tREP(i, q) {\n\t\t\t\tOUT(ans[i])BR;\n\t\t\t}\n\t\t\texit(0);\n\t\t}();\n\t}\n\tOUT(-1)BR;\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":90,"memory_kb":32184,"score_of_the_acc":-0.5889,"final_rank":14},{"submission_id":"aoj_3059_3413992","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n#include <unordered_map>\n#include <unordered_set>\n#include <array>\n// stream\n//#include <istream>\n#include <sstream>\n//#include <ostream>\n#include <fstream>\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \"\\t:\" << (dist) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\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) { return a = (a < b) ? b : a; }\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\tos << \"(\" << p.first << \", \" << p.second << \")\"; 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 = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n// ------------>8------------------------------------->8------------\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) (res *= n) %= mod;\n\t\t(n *= n) %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, n, q, k, d);\n\t--k; --d;\n\n\tauto move = [&](int x, int type) {\n\t\tint t = x / 2;\n\t\tint o = x & 1;\n\t\treturn t + (type != o) * (n / 2);\n\t};\n\tauto move2 = [&](int x, int type) {\n\t\treturn (2 * (x % (n / 2)) + type) % (n);\n\t};\n\n\tif (q == 1) {\n\t\tint ans = -1;\n\t\tREP(t, 2) if (move(k, t) == d) ans = t;\n\t\tOUT(ans)BR;\n\t\treturn 0;\n\t}\n\n\tREP(T, 2) {\n\t\t[&] {\n\t\t\tint k1 = k / 2 + T * (n / 2);\n\n\t\t\tint r = 0;\n\t\t\tint mi = std::min(q - 1, 49LL);\n\t\t\tint now = powMod(2, mi, n / 2);\n\t\t\tFOR(i, mi, INFINT) {\n\t\t\t\tif (i >= q - 1) {\n\t\t\t\t\tint di = i - (q - 1);\n\t\t\t\t\tif (d < 1LL << di) break;\n\t\t\t\t\tif (d & 1LL << di) (r += now) %= n / 2;\n\t\t\t\t}\n\t\t\t\t(now *= 2) %= n / 2;\n\t\t\t}\n\n\t\t\tint bit = (k1 - r) % MOD;\n\t\t\tif (bit < 0) bit += n / 2;\n\t\t\tif (bit > (1LL << mi) - 1) return;\n\n\t\t\tV<int> preans;\n\t\t\tREP(_, mi) {\n\t\t\t\tpreans.emplace_back(bit & 1);\n\t\t\t\tbit /= 2;\n\t\t\t}\n\t\t\tREP(i, q - 1 - mi) preans.emplace_back(0);\n\n\t\t\tV<int> num({ d });\n\t\t\tnow = d;\n\t\t\tRREP(i, preans.size()) {\n\t\t\t\tnow = move2(now, preans[i]);\n\t\t\t\tnum.emplace_back(now);\n\t\t\t}\n\t\t\tnum.emplace_back(k);\n\t\t\tstd::reverse(ALL(num));\n\n\t\t\tV<int> ans;\n\t\t\tREP(i, num.size() - 1) {\n\t\t\t\tREP(t, 2) {\n\t\t\t\t\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ans.size() != q) return;\n\n\t\t\tREP(i, q) {\n\t\t\t\tOUT(ans[i])BR;\n\t\t\t}\n\t\t\texit(0);\n\t\t}();\n\t}\n\tOUT(-1)BR;\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":90,"memory_kb":32348,"score_of_the_acc":-0.5918,"final_rank":15},{"submission_id":"aoj_3059_3413988","code_snippet":"// need\n#include <iostream>\n#include <algorithm>\n// data structure\n#include <bitset>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n#include <complex>\n//#include <deque>\n#include <valarray>\n#include <unordered_map>\n#include <unordered_set>\n#include <array>\n// stream\n//#include <istream>\n#include <sstream>\n//#include <ostream>\n#include <fstream>\n// etc\n#include <cassert>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <numeric>\n\n// input\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \"\\t:\" << (dist) << \"\\n\";}\n#define SHOWVECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOWVECTOR2(v) {std::cerr << #v << \"\\t:\\n\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \" \";}std::cerr << \"\\n\";}}\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \"\\t:\";while(!tmp.empty()){std::cerr << tmp.front() << \" \";tmp.pop();}std::cerr << \"\\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) { return a = (a < b) ? b : a; }\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\n#define EXCEPTION(msg) throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\tos << \"(\" << p.first << \", \" << p.second << \")\"; 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 = 1000000007;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\n// ------------>8------------------------------------->8------------\n\nll powMod(ll n, ll p, ll mod) {\n\tll res = 1;\n\twhile (p) {\n\t\tif (p & 1) (res *= n) %= mod;\n\t\t(n *= n) %= mod;\n\t\tp >>= 1;\n\t}\n\treturn res;\n}\n\nsigned main() {\n\tINIT;\n\n\tVAR(int, n, q, k, d);\n\t--k; --d;\n\n\tauto move = [&](int x, int type) {\n\t\tint t = x / 2;\n\t\tint o = x & 1;\n\t\treturn t + (type != o) * (n / 2);\n\t};\n\tauto move2 = [&](int x, int type) {\n\t\treturn (2 * (x % (n / 2)) + type) % (n);\n\t};\n\n\tif (q == 1) {\n\t\tint ans = -1;\n\t\tREP(t, 2) if (move(k, t) == d) ans = t;\n\t\tOUT(ans)BR;\n\t\treturn 0;\n\t}\n\n\tREP(T, 2) {\n\t\t[&] {\n\t\t\tint k1 = k / 2 + T * (n / 2);\n\n\t\t\tint r = 0;\n\t\t\tint mi = std::min(q - 1, 49LL);\n\t\t\tint now = powMod(2, mi, n / 2);\n\t\t\tFOR(i, mi, INFINT) {\n\t\t\t\tif (i >= q - 1) {\n\t\t\t\t\tint di = i - (q - 1);\n\t\t\t\t\tif (d < 1LL << di) break;\n\t\t\t\t\tif (d & 1LL << di) (r += now) %= n / 2;\n\t\t\t\t}\n\t\t\t\t(now *= 2) %= n / 2;\n\t\t\t}\n\n\t\t\tint bit = (k1 - r) % MOD;\n\t\t\tif (bit < 0) bit += n / 2;\n\t\t\tif (bit > (1LL << mi) - 1) return;\n\n\t\t\tV<int> preans;\n\t\t\tREP(_, mi) {\n\t\t\t\tpreans.emplace_back(bit & 1);\n\t\t\t\tbit /= 2;\n\t\t\t}\n\t\t\tREP(i, q - 1 - mi) preans.emplace_back(0);\n\n\t\t\tV<int> num({ d });\n\t\t\tnow = d;\n\t\t\tRREP(i, preans.size()) {\n\t\t\t\tnow = move2(now, preans[i]);\n\t\t\t\tnum.emplace_back(now);\n\t\t\t}\n\t\t\tnum.emplace_back(k);\n\t\t\tstd::reverse(ALL(num));\n\n\t\t\tV<int> ans;\n\t\t\tREP(i, num.size() - 1) {\n\t\t\t\tREP(t, 2) {\n\t\t\t\t\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ans.size() != q) return;\n\n\t\t\tREP(i, q) {\n\t\t\t\tOUT(ans[i])BR;\n\t\t\t}\n\t\t\texit(0);\n\t\t}();\n\t}\n\tOUT(-1)BR;\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":90,"memory_kb":32424,"score_of_the_acc":-0.5931,"final_rank":16},{"submission_id":"aoj_3059_3413869","code_snippet":"#include <iostream>\n#include <ccomplex>\n#include <vector>\n#include <cassert>\n#include <utility>\n#include <algorithm>\n#include <string>\n#include <deque>\n#include <queue>\n#include <functional>\n#include <cmath>\n#include <iomanip>\n#include <map>\n#include <numeric>\n#include <list>\n#include <assert.h>\n#include <math.h>\n#include <valarray>\n#include <stdio.h>\n#include <algorithm>\n#include <set>\n#include <complex>\n#include <list>\n#include <time.h>\n#include <stack>\n#include <locale>\n#include <clocale>\n#include <ctype.h>\n#include <wchar.h>\n#include <random>\n#include <vector>\n#include <unordered_map>\n#include <bitset>\n\nusing namespace std;\ntypedef long long int LL;\ntypedef long long int ll;\ntypedef pair<long long int, long long int> pii;\ntypedef pair<double, double> pdd;\n\n#define SORT(c) sort((c).begin(),(c).end())\n#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())\n#define FOR(i,a,b) for(LL i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\nLL mod = 1000000007;\n\nstruct hoge{\n public:\n LL a, b, c, d;\n public:\n LL num;\n\npublic:\n hoge(LL a, LL b, LL c, LL d,LL num) : a(a), b(b), c(c), d(d),num(num) {}\n};\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n LL n, q, k, d;\n cin >> n >> q >> k >> d;\n\n k--;\n d--;\n\n vector<hoge> v;\n\n v.push_back(hoge(d, d, d, d, 1));\n\n FOR(i,1,q+1){\n hoge prev = v[i - 1];\n hoge nowhoge = hoge((prev.a * 2) % n, (prev.b * 2) % n, (prev.c * 2) % n, (prev.d * 2+1) % n, (prev.num * 2));\n\n if(nowhoge.d<nowhoge.a){\n nowhoge.d += n;\n }\n\n if (nowhoge.num >= n)\n {\n nowhoge.d += n;\n v.push_back(nowhoge);\n break;\n }\n v.push_back(nowhoge);\n }\n\n hoge last = v[v.size() - 1];\n\n LL now = k;\n\n if(last.num>=n){\n for (LL i = 0; i < q - v.size() + 1;++i)\n {\n if(now%2==0){\n cout << 0 << endl;\n }\n else\n {\n cout << 1 << endl;\n }\n now /= 2;\n }\n }\n\n REP(i,v.size()-1){\n hoge nowhoge = v[v.size() - i-1];\n hoge nexthoge = v[v.size() - i-2];\n\n bool flag = false;\n REP(j, 2)\n {\n //cout << nowhoge.a << \" \" << now << \" \" << nowhoge.d << endl;\n if (nowhoge.a <= now && now <= nowhoge.d)\n {\n\n bool a = now % 2 == 0;\n\n now = ((now - nowhoge.a) / 2 + nexthoge.a) % n;\n\n if(a ^ (now/(n/2)!=0))\n {\n cout << 0 << endl;\n }else{\n cout << 1 << endl;\n }\n\n flag = true;\n break;\n }\n now += n;\n }\n if(flag)\n continue;\n\n cout << -1 << endl;\n break;\n }\n}","accuracy":1,"time_ms":770,"memory_kb":3192,"score_of_the_acc":-0.8427,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_3059_10892983\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nll modmul(ll a, ll b, ll mod) {\\n\\tll ret = a * b - mod * ll(1.L / mod * a * b);\\n\\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\\n}\\n\\nll modpow(ll a, ll b, ll mod) {\\n\\tll ans = 1;\\n\\tfor(; b; a = modmul(a, a, mod), b /= 2)\\n\\t\\tif (b & 1) ans = modmul(ans, a, mod);\\n\\treturn ans;\\n}\\n\\nvoid solve(){\\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\\n s--; t--;\\n vl two(Q+1, 1);\\n rep(i, Q) two[i+1] = two[i] * 2 % N;\\n ll u = modmul(t, two[Q], N);\\n ll gap = (s + N - u) % N;\\n if(Q <= 50 && two[Q] == (1LL<<Q)){\\n if(gap >= two[Q]){\\n cout << -1 << endl;\\n return;\\n }\\n }\\n vl ans(Q);\\n ll idx = 0;\\n vl inv(Q, 0);\\n while(gap){\\n ll y = gap % 2;\\n inv[idx] = y; idx++;\\n gap /= 2;\\n }\\n ll x = t;\\n rrep(i, 0, Q){\\n if(x * 2 < N) ans[i] = inv[i];\\n else ans[i] = inv[i]^1;\\n x = (x * 2 + inv[i]) % N;\\n }\\n rep(i, Q){\\n cout << ans[i] << endl;\\n }\\n \\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 24472,\n \"score_of_the_acc\": -1.0487,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_3059_10892933\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\n#define rep(i,n) for(ll i=0;i<n;++i)\\n#define all(a) (a).begin(),(a).end()\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &a){\\n if (a.empty()) return os;\\n os << a.front();\\n for (auto e : a | views::drop(1)){\\n os << ' ' << e;\\n }\\n return os;\\n}\\n\\nvoid dump(auto ...vs){\\n ((cout << vs << ' '), ...) << endl;\\n}\\n\\n\\n\\nvoid solve() {\\n ll N,Q,K,D;\\n cin>>N>>Q>>K>>D;\\n K--;\\n D--;\\n ll l=D;\\n ll r=D+1;\\n ll rest=Q;\\n vector<pair<ll,ll>> P;\\n rep(i,Q){\\n P.push_back({l,r});\\n l*=2;\\n r*=2;\\n ll d=l/N;\\n l-=d*N;\\n r-=d*N;\\n rest-=1;\\n if (r-l>=N){\\n break;\\n }\\n }\\n vector<ll> op;\\n rep(i,rest){\\n op.push_back(0);\\n if (K%2==0){\\n K/=2;\\n }\\n else{\\n K/=2;\\n K+=N/2;\\n }\\n }\\n if (!((l<=K and K<r) or (l<=K+N and K+N<r))){\\n cout<<-1<<endl;\\n return;\\n }\\n reverse(all(P));\\n for (auto [l,r]:P){\\n ll nxt;\\n nxt=K/2;\\n if ((l<=nxt and nxt<r) or (l<=nxt+N and nxt+N<r)){\\n if (K%2==0){\\n op.push_back(0);\\n }\\n else{\\n op.push_back(1);\\n }\\n K=nxt;\\n continue;\\n }\\n nxt=K/2+N/2;\\n if ((l<=nxt and nxt<r) or (l<=nxt+N and nxt+N<r)){\\n if (K%2==0){\\n op.push_back(1);\\n }\\n else{\\n op.push_back(0);\\n }\\n K=nxt;\\n continue;\\n }\\n assert (false);\\n }\\n for (ll a:op){\\n cout<<a<<endl;\\n }\\n return;\\n}\\n\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n ll T=1;\\n while (T--){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 12792,\n \"score_of_the_acc\": -0.5173,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_3059_10892928\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nll modmul(ll a, ll b, ll mod) {\\n\\tll ret = a * b - mod * ll(1.L / mod * a * b);\\n\\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\\n}\\n\\nll modpow(ll a, ll b, ll mod) {\\n\\tll ans = 1;\\n\\tfor(; b; a = modmul(a, a, mod), b /= 2)\\n\\t\\tif (b & 1) ans = modmul(ans, a, mod);\\n\\treturn ans;\\n}\\n\\nvoid solve(){\\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\\n s--; t--;\\n vl two(Q+1, 1);\\n rep(i, Q) two[i+1] = two[i] * 2 % N;\\n ll u = modmul(t, two[Q], N);\\n ll gap = (s + N - u) % N;\\n if(Q <= 50 && two[Q] == (1LL<<Q)){\\n if(gap >= two[Q]){\\n cout << -1 << endl;\\n return;\\n }\\n }\\n ll x = t;\\n vl ans(Q);\\n rep(i, Q){\\n if(x * 2 < N) ans[i] = 0;\\n else ans[i] = 1;\\n x = (x * 2) % N;\\n }\\n reverse(all(ans));\\n ll idx = 0;\\n while(gap){\\n ll y = gap % 2;\\n ans[idx] ^= y; idx++;\\n gap /= 2;\\n }\\n rep(i, Q){\\n cout << ans[i] << endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 630,\n \"memory_kb\": 17372,\n \"score_of_the_acc\": -0.935,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_3059_10892910\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nll modmul(ll a, ll b, ll mod) {\\n\\tll ret = a * b - mod * ll(1.L / mod * a * b);\\n\\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\\n}\\n\\nll modpow(ll a, ll b, ll mod) {\\n\\tll ans = 1;\\n\\tfor(; b; a = modmul(a, a, mod), b /= 2)\\n\\t\\tif (b & 1) ans = modmul(ans, a, mod);\\n\\treturn ans;\\n}\\n\\nvoid solve(){\\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\\n s--; t--; ll M = N / 2;\\n vl ans(Q, 0);\\n vl two(Q+1, 1);\\n rep(i, Q) two[i+1] = two[i] * 2 % N;\\n ll u = modmul(t, two[Q], N);\\n if(Q <= 50 && two[Q] == (1LL<<Q)){\\n if((s + N - u) % N >= two[Q]){\\n cout << -1 << endl;\\n return;\\n }\\n }\\n ll gap = (s + N - u) % N;\\n ll x = t;\\n rep(i, Q){\\n if(x * 2 < N) ans[i] = 0;\\n else ans[i] = 1;\\n x = (x * 2) % N;\\n }\\n reverse(all(ans));\\n ll idx = 0;\\n while(gap){\\n ll y = gap % 2;\\n ans[idx] ^= y; idx++;\\n gap >>= 1;\\n }\\n rep(i, Q){\\n cout << ans[i] << endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 620,\n \"memory_kb\": 17336,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_3059_10892894\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing pll = pair<ll, ll>;\\nusing vl = vector<ll>;\\ntemplate <class T> using vec = vector<T>;\\ntemplate <class T> using vv = vec<vec<T>>;\\ntemplate <class T> using vvv = vv<vec<T>>;\\ntemplate <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;\\n#define all(a) (a).begin(),(a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define reps(i, l, r) for(ll i = (l); i < (r); ++i)\\n#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)\\n#define sz(x) (ll) (x).size()\\ntemplate <typename T>\\nbool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }\\ntemplate <typename T>\\nbool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }\\n\\n#define EPS (1e-10)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nclass Point {\\npublic:\\n ld x;\\n ld y;\\n Point(ld _x = 0, ld _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*(ld a) { return Point(a * x, a * y); }\\n Point operator/(ld a) { return Point(x / a, y / a); }\\n\\n ld abs() { return sqrt(norm()); }\\nld norm() { return x * x + y * y; }\\n\\n bool operator<(const Point& p) const {\\n return !equals(x, p.x) ? x < p.x : y < p.y;\\n }\\n bool operator==(const Point& p) const {\\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\\n }\\n};\\ntypedef Point Vector;\\nstruct Segment {\\n Point A;\\n Point B;\\n};\\ntypedef Segment Line;\\nclass Circle {\\npublic:\\n Point C;\\n ld r;\\n Circle(Point C = Point(), ld r = 0.0) : C(C), r(r) {}\\n};\\ntypedef vector<Point> Polygon;\\n\\nstruct Edge {\\n ll from, to, cost;\\n Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}\\n};\\nstruct Graph {\\n vector<vector<Edge>> G;\\n Graph() = default;\\n explicit Graph(ll N) : G(N) {}\\n size_t size() const {\\n return G.size();\\n }\\n void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {\\n G[from].emplace_back(from, to, cost);\\n if (!direct) G[to].emplace_back(to, from, cost);\\n }\\n vector<Edge> &operator[](const int &k) {\\n return G[k];\\n }\\n};\\nusing Edges = vector<Edge>;\\n\\nll modmul(ll a, ll b, ll mod) {\\n\\tll ret = a * b - mod * ll(1.L / mod * a * b);\\n\\treturn ret + mod * (ret < 0) - mod * (ret >= mod);\\n}\\n\\nll modpow(ll a, ll b, ll mod) {\\n\\tll ans = 1;\\n\\tfor(; b; a = modmul(a, a, mod), b /= 2)\\n\\t\\tif (b & 1) ans = modmul(ans, a, mod);\\n\\treturn ans;\\n}\\n\\nvoid solve(){\\n ll N, Q, s, t; cin >> N >> Q >> s >> t;\\n s--; t--; ll M = N / 2;\\n vl ans(Q, 0);\\n vl two(Q+1, 1);\\n rep(i, Q) two[i+1] = two[i] * 2 % N;\\n ll u = modmul(t, two[Q], N);\\n if(Q <= 50 && two[Q] == (1LL<<Q)){\\n if((s + N - u) % N >= two[Q]){\\n cout << -1 << endl;\\n return;\\n }\\n }\\n ll gap = (s + N - u) % N;\\n ll x = t;\\n rep(i, Q){\\n if(x * 2 < N) ans[i] = 0;\\n else ans[i] = 1;\\n x = (x * 2) % N;\\n }\\n reverse(all(ans));\\n ll idx = 0;\\n while(gap){\\n ll x = gap % 2;\\n ans[idx] ^= x; idx++;\\n gap >>= 1;\\n }\\n rep(i, Q){\\n cout << ans[i] << endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int t = 1;\\n // cin >> t;\\n while(t--){\\n solve();\\n }\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 630,\n \"memory_kb\": 17516,\n \"score_of_the_acc\": -0.9375,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_3059_10891244\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\n\\n\\nvoid solve();\\n// POP'N ROLL MUSIC / TOMOO\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int t = 1;\\n // cin >> t;\\n rep(i, 0, t) solve();\\n}\\n\\nvoid solve(){\\n ll N, Q, K, D;\\n cin >> N >> Q >> K >> D;\\n K--, D--;\\n vector<int> digi(Q + 100);\\n rep(k, 0, 50){\\n if ((D + 1) & (1ll << k)) digi[k + Q] = 1;\\n }\\n auto mim = [&](int a) -> void {\\n while ((int)(digi.size()) != a && digi[a] == 0) digi[a] = 1, a++;\\n if ((int)digi.size() > a) digi[a] = 0;\\n };\\n // vec_out(digi);\\n mim(0);\\n rep(k, 0, 50){\\n if (K & (1ll << k)) mim(k);\\n }\\n // vec_out(digi);\\n vector<int> ans(Q);\\n for (int i = Q - 1; i >= 0; i--){\\n ll tmp = 0;\\n rep(d, 0, 55) if (digi[d + i]) tmp += (1ll << d);\\n if (tmp >= N){\\n ans[i] = 1;\\n rep(d, 0, 50) if (N & (1ll << d)) mim(d + i);\\n }\\n // vec_out(digi);\\n }\\n vector<int> n_ans;\\n for (auto x : ans){\\n n_ans.push_back((K + x) % 2);\\n K /= 2;\\n if (x) K += N / 2;\\n }\\n if (K == D){\\n for (auto x : n_ans) cout << x << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"-1\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 16052,\n \"score_of_the_acc\": -0.496,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_3059_3659305\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,q,k,d;\\n cin>>n>>q>>k>>d;\\n k--;d--;\\n \\n const int MAX = 60;\\n while(q>=MAX){\\n cout<<(k&1)<<\\\"\\\\n\\\";\\n k/=2;\\n q--;\\n }\\n\\n using I = __int128;\\n I N=n,Q=q,K=k,D=d;\\n\\n I X=((D+0)*(I(1)<<Q)-K+N-1)/N;\\n I Y=((D+1)*(I(1)<<Q)-K+N-1)/N;\\n\\n if(X==Y){\\n cout<<-1<<endl;\\n return 0;\\n }\\n\\n for(int i=0;i<q;i++){\\n int b=int((X>>i)&1)^(k&1);\\n k/=2;\\n k+=(n/2)*int((X>>i)&1);\\n cout<<b<<\\\"\\\\n\\\";\\n }\\n assert(k==d);\\n \\n cout<<flush;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.0341,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_3059_3427495\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef long double ld;\\nconst int INF=1e9,MOD=1e9+7;\\nconst ll LINF=1e18;\\nusing namespace std;\\n#define int long long\\n//template\\n//main\\nsigned main(){\\n int n,q,k,d;cin>>n>>q>>k>>d;\\n k--;d--;\\n std::vector<int> ans;\\n int sd=d;\\n for(int i=0;i<q;i++)sd=sd*2%n;\\n int a=(k-sd+n)%n;\\n std::vector<int> vs;\\n for(int i=0;i<q;i++){\\n vs.push_back(a%2);\\n a/=2;\\n }\\n if(a){cout<<-1<<endl;return 0;}\\n for(int i=0;i<q;i++){\\n int b1=vs[q-1-i];\\n int b2=(d>=n/2);\\n ans.push_back(b1^b2);\\n d=d*2%n+b1;\\n }\\n reverse(ans.begin(),ans.end());\\n //cout<<d<<endl;\\n for(int p:ans)cout<<p<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 22280,\n \"score_of_the_acc\": -1.3359,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_3059_3427492\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef long double ld;\\nconst int INF=1e9,MOD=1e9+7;\\nconst ll LINF=1e18;\\nusing namespace std;\\n#define int long long\\n//template\\n//main\\nsigned main(){\\n int n,q,k,d;cin>>n>>q>>k>>d;\\n k--;d--;\\n std::vector<int> ans;\\n int sd=d;\\n for(int i=0;i<q;i++)sd=sd*2%n;\\n int a=(k-sd+n)%n;\\n int l=1;int c=0;\\n for(int i=0;i<q;i++){\\n l*=2;\\n if(l>a)break;\\n c++;\\n }\\n int g=pow(2,60);\\n if(c==q){cout<<-1<<endl;return 0;}\\n for(int i=0;i<q;i++){\\n int b1=(a>>(q-1))&1;\\n int b2=(d>=n/2);\\n ans.push_back(b1^b2);\\n a*=2;a%=g;\\n d=d*2%n+b1;\\n }\\n reverse(ans.begin(),ans.end());\\n //cout<<d<<endl;\\n for(int p:ans)cout<<p<<endl;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 790,\n \"memory_kb\": 11136,\n \"score_of_the_acc\": -1.005,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_3059_3425486\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nll n,q,k,d;\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin>>n>>q>>k>>d;\\n k--;d--;\\n ll crt=d;\\n rep(i,q)crt=(crt*2)%n;\\n ll rest=(k-crt+n)%n;\\n if(q<60&&rest>=(1LL<<q)){\\n cout<<-1<<endl;\\n return 0;\\n }\\n\\n vector<ll> mv(q,0);\\n rep(i,60){\\n if((rest>>i)&1)mv[i]=1;\\n }\\n\\n vector<ll> res(q);\\n crt=d;\\n for(ll i=q-1;i>=0;i--){\\n if(crt<n/2) res[i]=mv[i];\\n else res[i]=1-mv[i];\\n crt=(crt*2+mv[i])%n;\\n }\\n assert(crt==k);\\n rep(i,q)cout<<res[i]<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 16960,\n \"score_of_the_acc\": -1.1299,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_3059_3420547\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\nusing pint = pair<int,int>;\\n\\nlong long N, Q, K, D;\\nvoid solve() {\\n --K, --D;\\n long long pK = K, pD = D;\\n for (int i = 0; i < Q; ++i) D = D * 2 % N;\\n long long diff = (K - D + N) % N;\\n\\n // tmp: 逆順で見たときの 0: 2x、1: 2x+1\\n vector<long long> tmp;\\n while (diff) {\\n tmp.push_back(diff & 1);\\n diff >>= 1;\\n }\\n if (tmp.size() > Q) { cout << -1 << endl; return; }\\n while (tmp.size() < Q) tmp.push_back(0);\\n reverse(tmp.begin(), tmp.end());\\n\\n // 実際の操作に適合した復元\\n vector<long long> res;\\n for (int q = 0; q < tmp.size(); ++q) {\\n long long nD = pD * 2;\\n if (tmp[q]) ++nD;\\n nD %= N;\\n\\n // nD -> pD が実際には 0 なのか 1 なのかを判定\\n if (nD % 2 == 0) {\\n if (pD == nD/2) res.push_back(0);\\n else res.push_back(1);\\n }\\n else {\\n if (pD == nD/2) res.push_back(1);\\n else res.push_back(0);\\n }\\n pD = nD;\\n }\\n reverse(res.begin(), res.end());\\n for (int i = 0; i < Q; ++i) cout << res[i] << endl;\\n}\\n\\nint main() {\\n cin >> N >> Q >> K >> D;\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 820,\n \"memory_kb\": 22288,\n \"score_of_the_acc\": -1.235,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_3059_3416155\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nll under[1000500];\\nll over[1000500];\\nll n, q, k, d;\\n\\nvoid query(int now) {\\n ll delta = (over[now+1] - under[now+1] + 1 + n) % n;\\n if(delta * 2 >= n || delta == 0) {\\n under[now] = 1;\\n over[now] = n;\\n return;\\n }\\n ll after = under[now+1];\\n if(after > n / 2) after - n / 2;\\n ll new_under = ((after-1) * 2 + 1) % n;\\n under[now] = new_under;\\n over[now] = (new_under + delta * 2 - 1 + n) % n;\\n return;\\n}\\n\\nbool isin(ll under, ll over, ll val) {\\n if(under <= over) {\\n if(((under <= val) && (val <= over))) {\\n //cout << -1 << endl;\\n return true;\\n }\\n } else {\\n if(((val >= under) || (val <= over))) {\\n //cout << -1 << endl;\\n return true;\\n }\\n }\\n //cerr << \\\"FAILED \\\" << under << \\\" \\\" << over << \\\" \\\" << val << endl;\\n return false;\\n}\\n\\nll one(ll now) {\\n if(now % 2 == 0) {\\n return now / 2;\\n }\\n return n / 2 + (now + 1) / 2;\\n}\\n\\nll zero(ll now) {\\n if(now % 2 == 0) {\\n return n / 2 + now / 2;\\n }\\n return (now + 1) / 2;\\n}\\n\\nint main() {\\n cin >> n >> q >> k >> d;\\n over[q] = d;\\n under[q] = d;\\n for(int i = q - 1; i >= 0; i--) {\\n query(i);\\n }\\n for(int i = 0; i <= q; i++) {\\n //cout << under[i] << \\\" \\\" << over[i] << endl;\\n }\\n /*\\n if(under[0] < over[0]) {\\n if(!((under[0] <= k) && (k <= over[0]))) {\\n //cout << -1 << endl;\\n return 0;\\n }\\n } else {\\n if(!((k >= under[0]) || (k <= over[0]))) {\\n //cout << -1 << endl;\\n return 0;\\n }\\n }\\n */\\n if(!isin(under[0], over[0], k)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n vector<int> ans;\\n ll now = k;\\n for(int i = 1; i <= q; i++) {\\n ll NEW = zero(now);\\n //cout << i << \\\" NEWNUMBER : \\\" << NEW << endl;\\n if(isin(under[i], over[i], NEW)) {\\n ans.push_back(0);\\n now = NEW;\\n //cout << \\\"0 \\\" << now << endl;\\n continue;\\n }\\n NEW = one(now);\\n ans.push_back(1);\\n now = NEW;\\n //cout << \\\"1 \\\" << now << endl;\\n }\\n for(int i = 0; i < ans.size(); i++) {\\n cout << ans[i] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 21296,\n \"score_of_the_acc\": -1.2063,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_3059_3414641\",\n \"code_snippet\": \"#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\\nbool check(vector<pair<ll, ll>> &v, ll x) {\\n REP(i, 0, v.size()) {\\n if (v[i].first <= x && x < v[i].second) {\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(void) {\\n ll N, Q, K, D;\\n cin >> N >> Q >> K >> D, K--, D--;\\n\\n vector<vector<pair<ll, ll>>> z(Q + 1);\\n z[Q].push_back(make_pair(D, D + 1));\\n\\n for (ll i = Q - 1; i >= 0; i--) {\\n vector<pair<ll, ll>> v;\\n REP(k, 0, z[i + 1].size()) {\\n ll l = z[i + 1][k].first, h = z[i + 1][k].second;\\n if (l < N / 2 && h <= N / 2) {\\n v.push_back(make_pair(l * 2, h * 2));\\n } else if (l < N / 2 && h > N / 2) {\\n v.push_back(make_pair(l * 2, N));\\n v.push_back(make_pair(0, h * 2 - N));\\n } else if (l >= N / 2 && h > N / 2) {\\n v.push_back(make_pair(l * 2 - N, h * 2 - N));\\n }\\n }\\n\\n sort(v.begin(), v.end());\\n\\n REP(k, 0, v.size()) {\\n assert(v[k].first < v[k].second);\\n if (z[i].size() >= 1) {\\n if (z[i].back().second >= v[k].first) {\\n z[i].back().second = v[k].second;\\n continue;\\n }\\n }\\n z[i].push_back(v[k]);\\n }\\n }\\n\\n if (!check(z[0], K)) {\\n cout << -1 << endl;\\n } else {\\n vector<ll> ans(Q);\\n ll x = K;\\n REP(i, 0, Q) {\\n ll n = x % 2 == 0 ? x / 2 : x / 2 + N / 2;\\n if (check(z[i + 1], n)) {\\n x = n;\\n ans[i] = 0;\\n } else {\\n x = x % 2 == 0 ? x / 2 + N / 2 : x / 2;\\n ans[i] = 1;\\n }\\n }\\n REP(i, 0, Q) printf(\\\"%ld\\\\n\\\", ans[i]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 60012,\n \"score_of_the_acc\": -1.1236,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_3059_3414115\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef int _loop_int;\\n#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)\\n#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)\\n#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)\\n\\n#define DEBUG(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define DEBUG_VEC(v) cout<<#v<<\\\":\\\";REP(i,v.size())cout<<\\\" \\\"<<v[i];cout<<endl\\n#define ALL(a) (a).begin(),(a).end()\\n\\n#define CHMIN(a,b) a=min((a),(b))\\n#define CHMAX(a,b) a=max((a),(b))\\n\\n// mod\\nconst ll MOD = 1000000007ll;\\n#define FIX(a) ((a)%MOD+MOD)%MOD\\n\\n// floating\\ntypedef double Real;\\nconst Real EPS = 1e-11;\\n#define EQ0(x) (abs(x)<EPS)\\n#define EQ(a,b) (abs(a-b)<EPS)\\ntypedef complex<Real> P;\\n\\nll n,q,k,d;\\nll low[1252525], high[1252525];\\n\\nint main(){\\n scanf(\\\"%lld%lld%lld%lld\\\",&n,&q,&k,&d);\\n --k;--d;\\n low[0] = high[0] = d;\\n REP(i,q){\\n low[i+1] = n; high[i+1] = -1;\\n {\\n ll x = low[i];\\n if(x>=n/2)x-=n/2;\\n CHMIN(low[i+1], 2*x);\\n CHMAX(high[i+1], 2*x+1);\\n }\\n {\\n ll x = high[i];\\n if(x>=n/2)x-=n/2;\\n CHMIN(low[i+1], 2*x);\\n CHMAX(high[i+1], 2*x+1);\\n }\\n if(low[i]<=n/2-1 && n/2-1<=high[i]){\\n ll x = n/2-1;\\n if(x>=n/2)x-=n/2;\\n CHMIN(low[i+1], 2*x);\\n CHMAX(high[i+1], 2*x+1);\\n }\\n if(low[i]<=n/2 && n/2<=high[i]){\\n ll x = n/2;\\n if(x>=n/2)x-=n/2;\\n CHMIN(low[i+1], 2*x);\\n CHMAX(high[i+1], 2*x+1);\\n }\\n }\\n if(k<low[q] || k>high[q]){\\n puts(\\\"-1\\\");return 0;\\n }\\n ll x = k;\\n FORR(i,0,q){\\n if(low[i]<=x/2 && x/2<=high[i]){\\n puts(x%2==0 ? \\\"0\\\" : \\\"1\\\");\\n x = x/2;\\n }else{\\n puts(x%2==0 ? \\\"1\\\" : \\\"0\\\");\\n x = x/2 + n/2;\\n }\\n }\\n assert(x == d);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 17352,\n \"score_of_the_acc\": -0.2492,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_3059_3414031\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n// data structure\\n#include <bitset>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <complex>\\n//#include <deque>\\n#include <valarray>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <array>\\n// stream\\n//#include <istream>\\n#include <sstream>\\n//#include <ostream>\\n#include <fstream>\\n// etc\\n#include <cassert>\\n#include <cmath>\\n#include <functional>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \\\"\\\\t:\\\" << (dist) << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\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) { return a = (a < b) ? b : a; }\\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; 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 = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\\n// ------------>8------------------------------------->8------------\\n\\nll powMod(ll n, ll p, ll mod) {\\n\\tll res = 1;\\n\\twhile (p) {\\n\\t\\tif (p & 1) (res *= n) %= mod;\\n\\t\\t(n *= n) %= mod;\\n\\t\\tp >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\n\\tVAR(int, n, q, k, d);\\n\\t--k; --d;\\n\\n\\tauto move = [&](int x, int type) {\\n\\t\\tint t = x / 2;\\n\\t\\tint o = x & 1;\\n\\t\\treturn t + (type != o) * (n / 2);\\n\\t};\\n\\tauto move2 = [&](int x, int type) {\\n\\t\\treturn (2 * x + type) % n;\\n\\t};\\n\\n\\tif (q == 1) {\\n\\t\\tint ans = -1;\\n\\t\\tREP(t, 2) if (move(k, t) == d) ans = t;\\n\\t\\tOUT(ans)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t[&] {\\n\\n\\t\\tint r = 0;\\n\\t\\tint mi = std::min(q, 52LL);\\n\\t\\tint now = powMod(2, q, n);\\n\\t\\tFOR(i, q, INFINT) {\\n\\t\\t\\tint di = i - q;\\n\\t\\t\\tif (d < 1LL << di) break;\\n\\t\\t\\tif (d & 1LL << di) (r += now) %= n;\\n\\t\\t\\t(now *= 2) %= n;\\n\\t\\t}\\n\\n\\t\\tint bit = (k - r) % n;\\n\\t\\tif (bit < 0) bit += n;\\n\\t\\tif (bit > (1LL << mi) - 1) return;\\n\\n\\t\\tV<int> preans;\\n\\t\\tREP(_, mi) {\\n\\t\\t\\tpreans.emplace_back(bit & 1);\\n\\t\\t\\tbit /= 2;\\n\\t\\t}\\n\\t\\tREP(i, q - mi) preans.emplace_back(0);\\n\\n\\t\\tV<int> num({ d });\\n\\t\\tnow = d;\\n\\t\\tRREP(i, preans.size()) {\\n\\t\\t\\tnow = move2(now, preans[i]);\\n\\t\\t\\tnum.emplace_back(now);\\n\\t\\t}\\n\\t\\tstd::reverse(ALL(num));\\n\\n\\t\\tV<int> ans;\\n\\t\\tREP(i, num.size() - 1) {\\n\\t\\t\\tREP(t, 2) {\\n\\t\\t\\t\\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans.size() != q) return;\\n\\n\\t\\tREP(i, q) {\\n\\t\\t\\tOUT(ans[i])BR;\\n\\t\\t}\\n\\t\\texit(0);\\n\\t}();\\n\\tOUT(-1)BR;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 60,\n \"memory_kb\": 29204,\n \"score_of_the_acc\": -0.5027,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_3059_3414012\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n// data structure\\n#include <bitset>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <complex>\\n//#include <deque>\\n#include <valarray>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <array>\\n// stream\\n//#include <istream>\\n#include <sstream>\\n//#include <ostream>\\n#include <fstream>\\n// etc\\n#include <cassert>\\n#include <cmath>\\n#include <functional>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \\\"\\\\t:\\\" << (dist) << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\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) { return a = (a < b) ? b : a; }\\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; 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 = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\\n// ------------>8------------------------------------->8------------\\n\\nll powMod(ll n, ll p, ll mod) {\\n\\tll res = 1;\\n\\twhile (p) {\\n\\t\\tif (p & 1) (res *= n) %= mod;\\n\\t\\t(n *= n) %= mod;\\n\\t\\tp >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\n\\tVAR(int, n, q, k, d);\\n\\t--k; --d;\\n\\n\\tauto move = [&](int x, int type) {\\n\\t\\tint t = x / 2;\\n\\t\\tint o = x & 1;\\n\\t\\treturn t + (type != o) * (n / 2);\\n\\t};\\n\\tauto move2 = [&](int x, int type) {\\n\\t\\treturn (2 * x + type) % n;\\n\\t};\\n\\n\\tif (q == 1) {\\n\\t\\tint ans = -1;\\n\\t\\tREP(t, 2) if (move(k, t) == d) ans = t;\\n\\t\\tOUT(ans)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tREP(T, 2) {\\n\\t\\t[&] {\\n\\t\\t\\tint k1 = k / 2 + T * (n / 2);\\n\\n\\t\\t\\tint r = 0;\\n\\t\\t\\tint mi = std::min(q - 1, 52LL);\\n\\t\\t\\tint now = powMod(2, q - 1, n);\\n\\t\\t\\tFOR(i, q - 1, INFINT) {\\n\\t\\t\\t\\tint di = i - (q - 1);\\n\\t\\t\\t\\tif (d < 1LL << di) break;\\n\\t\\t\\t\\tif (d & 1LL << di) (r += now) %= n;\\n\\t\\t\\t\\t(now *= 2) %= n;\\n\\t\\t\\t}\\n\\n\\t\\t\\tint bit = (k1 - r) % MOD;\\n\\t\\t\\tif (bit < 0) bit += n / 2;\\n\\t\\t\\tif (bit > (1LL << mi) - 1) return;\\n\\n\\t\\t\\tV<int> preans;\\n\\t\\t\\tREP(_, mi) {\\n\\t\\t\\t\\tpreans.emplace_back(bit & 1);\\n\\t\\t\\t\\tbit /= 2;\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, q - 1 - mi) preans.emplace_back(0);\\n\\n\\t\\t\\tV<int> num({ d });\\n\\t\\t\\tnow = d;\\n\\t\\t\\tRREP(i, preans.size()) {\\n\\t\\t\\t\\tnow = move2(now, preans[i]);\\n\\t\\t\\t\\tnum.emplace_back(now);\\n\\t\\t\\t}\\n\\t\\t\\tnum.emplace_back(k);\\n\\t\\t\\tstd::reverse(ALL(num));\\n\\n\\t\\t\\tV<int> ans;\\n\\t\\t\\tREP(i, num.size() - 1) {\\n\\t\\t\\t\\tREP(t, 2) {\\n\\t\\t\\t\\t\\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ans.size() != q) return;\\n\\n\\t\\t\\tREP(i, q) {\\n\\t\\t\\t\\tOUT(ans[i])BR;\\n\\t\\t\\t}\\n\\t\\t\\texit(0);\\n\\t\\t}();\\n\\t}\\n\\tOUT(-1)BR;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 50,\n \"memory_kb\": 32200,\n \"score_of_the_acc\": -0.5442,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_3059_3413994\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n// data structure\\n#include <bitset>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <complex>\\n//#include <deque>\\n#include <valarray>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <array>\\n// stream\\n//#include <istream>\\n#include <sstream>\\n//#include <ostream>\\n#include <fstream>\\n// etc\\n#include <cassert>\\n#include <cmath>\\n#include <functional>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \\\"\\\\t:\\\" << (dist) << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\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) { return a = (a < b) ? b : a; }\\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; 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 = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\\n// ------------>8------------------------------------->8------------\\n\\nll powMod(ll n, ll p, ll mod) {\\n\\tll res = 1;\\n\\twhile (p) {\\n\\t\\tif (p & 1) (res *= n) %= mod;\\n\\t\\t(n *= n) %= mod;\\n\\t\\tp >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\n\\tVAR(int, n, q, k, d);\\n\\t--k; --d;\\n\\n\\tauto move = [&](int x, int type) {\\n\\t\\tint t = x / 2;\\n\\t\\tint o = x & 1;\\n\\t\\treturn t + (type != o) * (n / 2);\\n\\t};\\n\\tauto move2 = [&](int x, int type) {\\n\\t\\treturn (2 * (x % (n / 2)) + type) % (n);\\n\\t};\\n\\n\\tif (q == 1) {\\n\\t\\tint ans = -1;\\n\\t\\tREP(t, 2) if (move(k, t) == d) ans = t;\\n\\t\\tOUT(ans)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tREP(T, 2) {\\n\\t\\t[&] {\\n\\t\\t\\tint k1 = k / 2 + T * (n / 2);\\n\\n\\t\\t\\tint r = 0;\\n\\t\\t\\tint mi = std::min(q - 1, 52LL);\\n\\t\\t\\tint now = powMod(2, mi, n / 2);\\n\\t\\t\\tFOR(i, mi, INFINT) {\\n\\t\\t\\t\\tif (i >= q - 1) {\\n\\t\\t\\t\\t\\tint di = i - (q - 1);\\n\\t\\t\\t\\t\\tif (d < 1LL << di) break;\\n\\t\\t\\t\\t\\tif (d & 1LL << di) (r += now) %= n / 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t(now *= 2) %= n / 2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tint bit = (k1 - r) % MOD;\\n\\t\\t\\tif (bit < 0) bit += n / 2;\\n\\t\\t\\tif (bit > (1LL << mi) - 1) return;\\n\\n\\t\\t\\tV<int> preans;\\n\\t\\t\\tREP(_, mi) {\\n\\t\\t\\t\\tpreans.emplace_back(bit & 1);\\n\\t\\t\\t\\tbit /= 2;\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, q - 1 - mi) preans.emplace_back(0);\\n\\n\\t\\t\\tV<int> num({ d });\\n\\t\\t\\tnow = d;\\n\\t\\t\\tRREP(i, preans.size()) {\\n\\t\\t\\t\\tnow = move2(now, preans[i]);\\n\\t\\t\\t\\tnum.emplace_back(now);\\n\\t\\t\\t}\\n\\t\\t\\tnum.emplace_back(k);\\n\\t\\t\\tstd::reverse(ALL(num));\\n\\n\\t\\t\\tV<int> ans;\\n\\t\\t\\tREP(i, num.size() - 1) {\\n\\t\\t\\t\\tREP(t, 2) {\\n\\t\\t\\t\\t\\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ans.size() != q) return;\\n\\n\\t\\t\\tREP(i, q) {\\n\\t\\t\\t\\tOUT(ans[i])BR;\\n\\t\\t\\t}\\n\\t\\t\\texit(0);\\n\\t\\t}();\\n\\t}\\n\\tOUT(-1)BR;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 90,\n \"memory_kb\": 32184,\n \"score_of_the_acc\": -0.5889,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_3059_3413992\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n// data structure\\n#include <bitset>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <complex>\\n//#include <deque>\\n#include <valarray>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <array>\\n// stream\\n//#include <istream>\\n#include <sstream>\\n//#include <ostream>\\n#include <fstream>\\n// etc\\n#include <cassert>\\n#include <cmath>\\n#include <functional>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \\\"\\\\t:\\\" << (dist) << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\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) { return a = (a < b) ? b : a; }\\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; 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 = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\\n// ------------>8------------------------------------->8------------\\n\\nll powMod(ll n, ll p, ll mod) {\\n\\tll res = 1;\\n\\twhile (p) {\\n\\t\\tif (p & 1) (res *= n) %= mod;\\n\\t\\t(n *= n) %= mod;\\n\\t\\tp >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\n\\tVAR(int, n, q, k, d);\\n\\t--k; --d;\\n\\n\\tauto move = [&](int x, int type) {\\n\\t\\tint t = x / 2;\\n\\t\\tint o = x & 1;\\n\\t\\treturn t + (type != o) * (n / 2);\\n\\t};\\n\\tauto move2 = [&](int x, int type) {\\n\\t\\treturn (2 * (x % (n / 2)) + type) % (n);\\n\\t};\\n\\n\\tif (q == 1) {\\n\\t\\tint ans = -1;\\n\\t\\tREP(t, 2) if (move(k, t) == d) ans = t;\\n\\t\\tOUT(ans)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tREP(T, 2) {\\n\\t\\t[&] {\\n\\t\\t\\tint k1 = k / 2 + T * (n / 2);\\n\\n\\t\\t\\tint r = 0;\\n\\t\\t\\tint mi = std::min(q - 1, 49LL);\\n\\t\\t\\tint now = powMod(2, mi, n / 2);\\n\\t\\t\\tFOR(i, mi, INFINT) {\\n\\t\\t\\t\\tif (i >= q - 1) {\\n\\t\\t\\t\\t\\tint di = i - (q - 1);\\n\\t\\t\\t\\t\\tif (d < 1LL << di) break;\\n\\t\\t\\t\\t\\tif (d & 1LL << di) (r += now) %= n / 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t(now *= 2) %= n / 2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tint bit = (k1 - r) % MOD;\\n\\t\\t\\tif (bit < 0) bit += n / 2;\\n\\t\\t\\tif (bit > (1LL << mi) - 1) return;\\n\\n\\t\\t\\tV<int> preans;\\n\\t\\t\\tREP(_, mi) {\\n\\t\\t\\t\\tpreans.emplace_back(bit & 1);\\n\\t\\t\\t\\tbit /= 2;\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, q - 1 - mi) preans.emplace_back(0);\\n\\n\\t\\t\\tV<int> num({ d });\\n\\t\\t\\tnow = d;\\n\\t\\t\\tRREP(i, preans.size()) {\\n\\t\\t\\t\\tnow = move2(now, preans[i]);\\n\\t\\t\\t\\tnum.emplace_back(now);\\n\\t\\t\\t}\\n\\t\\t\\tnum.emplace_back(k);\\n\\t\\t\\tstd::reverse(ALL(num));\\n\\n\\t\\t\\tV<int> ans;\\n\\t\\t\\tREP(i, num.size() - 1) {\\n\\t\\t\\t\\tREP(t, 2) {\\n\\t\\t\\t\\t\\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ans.size() != q) return;\\n\\n\\t\\t\\tREP(i, q) {\\n\\t\\t\\t\\tOUT(ans[i])BR;\\n\\t\\t\\t}\\n\\t\\t\\texit(0);\\n\\t\\t}();\\n\\t}\\n\\tOUT(-1)BR;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 90,\n \"memory_kb\": 32348,\n \"score_of_the_acc\": -0.5918,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_3059_3413988\",\n \"code_snippet\": \"// need\\n#include <iostream>\\n#include <algorithm>\\n// data structure\\n#include <bitset>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n#include <complex>\\n//#include <deque>\\n#include <valarray>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <array>\\n// stream\\n//#include <istream>\\n#include <sstream>\\n//#include <ostream>\\n#include <fstream>\\n// etc\\n#include <cassert>\\n#include <cmath>\\n#include <functional>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n\\n// input\\n#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);\\n#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);\\ntemplate<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }\\ntemplate<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }\\n#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}\\ntemplate<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }\\ntemplate<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }\\ntemplate<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }\\n#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;\\n#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)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) {std::cerr << #dist << \\\"\\\\t:\\\" << (dist) << \\\"\\\\n\\\";}\\n#define SHOWVECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOWVECTOR2(v) {std::cerr << #v << \\\"\\\\t:\\\\n\\\";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}}\\n#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << \\\"\\\\t:\\\";while(!tmp.empty()){std::cerr << tmp.front() << \\\" \\\";tmp.pop();}std::cerr << \\\"\\\\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) { return a = (a < b) ? b : a; }\\ntemplate<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }\\n#define EXCEPTION(msg) throw std::string(\\\"Exception : \\\" msg \\\" [ in \\\") + __func__ + \\\" : \\\" + std::to_string(__LINE__) + \\\" lines ]\\\"\\n#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}\\n//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); 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\\tos << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; 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 = 1000000007;\\nconstexpr double PI = 3.141592653589793238462643383279;\\ntemplate<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }\\ntemplate<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }\\ntemplate<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }\\n// ------------>8------------------------------------->8------------\\n\\nll powMod(ll n, ll p, ll mod) {\\n\\tll res = 1;\\n\\twhile (p) {\\n\\t\\tif (p & 1) (res *= n) %= mod;\\n\\t\\t(n *= n) %= mod;\\n\\t\\tp >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nsigned main() {\\n\\tINIT;\\n\\n\\tVAR(int, n, q, k, d);\\n\\t--k; --d;\\n\\n\\tauto move = [&](int x, int type) {\\n\\t\\tint t = x / 2;\\n\\t\\tint o = x & 1;\\n\\t\\treturn t + (type != o) * (n / 2);\\n\\t};\\n\\tauto move2 = [&](int x, int type) {\\n\\t\\treturn (2 * (x % (n / 2)) + type) % (n);\\n\\t};\\n\\n\\tif (q == 1) {\\n\\t\\tint ans = -1;\\n\\t\\tREP(t, 2) if (move(k, t) == d) ans = t;\\n\\t\\tOUT(ans)BR;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tREP(T, 2) {\\n\\t\\t[&] {\\n\\t\\t\\tint k1 = k / 2 + T * (n / 2);\\n\\n\\t\\t\\tint r = 0;\\n\\t\\t\\tint mi = std::min(q - 1, 49LL);\\n\\t\\t\\tint now = powMod(2, mi, n / 2);\\n\\t\\t\\tFOR(i, mi, INFINT) {\\n\\t\\t\\t\\tif (i >= q - 1) {\\n\\t\\t\\t\\t\\tint di = i - (q - 1);\\n\\t\\t\\t\\t\\tif (d < 1LL << di) break;\\n\\t\\t\\t\\t\\tif (d & 1LL << di) (r += now) %= n / 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t(now *= 2) %= n / 2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tint bit = (k1 - r) % MOD;\\n\\t\\t\\tif (bit < 0) bit += n / 2;\\n\\t\\t\\tif (bit > (1LL << mi) - 1) return;\\n\\n\\t\\t\\tV<int> preans;\\n\\t\\t\\tREP(_, mi) {\\n\\t\\t\\t\\tpreans.emplace_back(bit & 1);\\n\\t\\t\\t\\tbit /= 2;\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, q - 1 - mi) preans.emplace_back(0);\\n\\n\\t\\t\\tV<int> num({ d });\\n\\t\\t\\tnow = d;\\n\\t\\t\\tRREP(i, preans.size()) {\\n\\t\\t\\t\\tnow = move2(now, preans[i]);\\n\\t\\t\\t\\tnum.emplace_back(now);\\n\\t\\t\\t}\\n\\t\\t\\tnum.emplace_back(k);\\n\\t\\t\\tstd::reverse(ALL(num));\\n\\n\\t\\t\\tV<int> ans;\\n\\t\\t\\tREP(i, num.size() - 1) {\\n\\t\\t\\t\\tREP(t, 2) {\\n\\t\\t\\t\\t\\tif (move(num[i], t) == num[i + 1]) ans.emplace_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ans.size() != q) return;\\n\\n\\t\\t\\tREP(i, q) {\\n\\t\\t\\t\\tOUT(ans[i])BR;\\n\\t\\t\\t}\\n\\t\\t\\texit(0);\\n\\t\\t}();\\n\\t}\\n\\tOUT(-1)BR;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 90,\n \"memory_kb\": 32424,\n \"score_of_the_acc\": -0.5931,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_3059_3413869\",\n \"code_snippet\": \"#include <iostream>\\n#include <ccomplex>\\n#include <vector>\\n#include <cassert>\\n#include <utility>\\n#include <algorithm>\\n#include <string>\\n#include <deque>\\n#include <queue>\\n#include <functional>\\n#include <cmath>\\n#include <iomanip>\\n#include <map>\\n#include <numeric>\\n#include <list>\\n#include <assert.h>\\n#include <math.h>\\n#include <valarray>\\n#include <stdio.h>\\n#include <algorithm>\\n#include <set>\\n#include <complex>\\n#include <list>\\n#include <time.h>\\n#include <stack>\\n#include <locale>\\n#include <clocale>\\n#include <ctype.h>\\n#include <wchar.h>\\n#include <random>\\n#include <vector>\\n#include <unordered_map>\\n#include <bitset>\\n\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef long long int ll;\\ntypedef pair<long long int, long long int> pii;\\ntypedef pair<double, double> pdd;\\n\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())\\n#define FOR(i,a,b) for(LL i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nLL mod = 1000000007;\\n\\nstruct hoge{\\n public:\\n LL a, b, c, d;\\n public:\\n LL num;\\n\\npublic:\\n hoge(LL a, LL b, LL c, LL d,LL num) : a(a), b(b), c(c), d(d),num(num) {}\\n};\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n LL n, q, k, d;\\n cin >> n >> q >> k >> d;\\n\\n k--;\\n d--;\\n\\n vector<hoge> v;\\n\\n v.push_back(hoge(d, d, d, d, 1));\\n\\n FOR(i,1,q+1){\\n hoge prev = v[i - 1];\\n hoge nowhoge = hoge((prev.a * 2) % n, (prev.b * 2) % n, (prev.c * 2) % n, (prev.d * 2+1) % n, (prev.num * 2));\\n\\n if(nowhoge.d<nowhoge.a){\\n nowhoge.d += n;\\n }\\n\\n if (nowhoge.num >= n)\\n {\\n nowhoge.d += n;\\n v.push_back(nowhoge);\\n break;\\n }\\n v.push_back(nowhoge);\\n }\\n\\n hoge last = v[v.size() - 1];\\n\\n LL now = k;\\n\\n if(last.num>=n){\\n for (LL i = 0; i < q - v.size() + 1;++i)\\n {\\n if(now%2==0){\\n cout << 0 << endl;\\n }\\n else\\n {\\n cout << 1 << endl;\\n }\\n now /= 2;\\n }\\n }\\n\\n REP(i,v.size()-1){\\n hoge nowhoge = v[v.size() - i-1];\\n hoge nexthoge = v[v.size() - i-2];\\n\\n bool flag = false;\\n REP(j, 2)\\n {\\n //cout << nowhoge.a << \\\" \\\" << now << \\\" \\\" << nowhoge.d << endl;\\n if (nowhoge.a <= now && now <= nowhoge.d)\\n {\\n\\n bool a = now % 2 == 0;\\n\\n now = ((now - nowhoge.a) / 2 + nexthoge.a) % n;\\n\\n if(a ^ (now/(n/2)!=0))\\n {\\n cout << 0 << endl;\\n }else{\\n cout << 1 << endl;\\n }\\n\\n flag = true;\\n break;\\n }\\n now += n;\\n }\\n if(flag)\\n continue;\\n\\n cout << -1 << endl;\\n break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.8427,\n \"final_rank\": 5\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":18,"numItemsPerPage":100,"numTotalItems":2103,"offset":1800,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NTQ5MTE0Nywic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc1NDk0NzQ3LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.oxPdlFK3sIkEc4Pgi8zu0CDT6aG5qdeWmC6x-dyMJrhNCbzJwmF0jZOg9qUxFSgLBg9OWCTniBLQ-V_ZDrVmBQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
group_id stringlengths 12 18 | problem_description stringlengths 85 3.02k | candidates listlengths 3 20 |
|---|---|---|
aoj_2943_cpp | G: イルミネーション
問題
$1 \leq x \leq h , 1 \leq y \leq w$ をみたす格子点 $(x,y)$ に電球がある.
電源装置は座標 $(i+0.5,j+0.5) (1 \leq i < h,1 \leq j < w, i+j$ は偶数）に設置されている(14:21修正).
座標 $(i+0.5,j+0.5)$ に設置されている電源装置をオンにすると, 座標 $(i,j),(i+1,j),(i,j+1),(i+1,j+1)$ に存在する $4$ つの電球が光る.
$(i,j)$ にある電球がオンになっている電源装置に $1$ つ以上つながっていると, きれいさ $B_{i,j}$ を得られる. あなたは, きれいさの合計分の収入がもらえる.
また, それぞれの電源装置をオンにすると, $1$ つあたり電気代が $W$ かかる.
いくつかの電源をオンにして「収入の合計 - 電気代の合計」を最大化しなさい.
制約
$2 \leq h, w \leq 50$
$0 \leq B_{i,j},W \leq 10^9$
$h,w$ は偶数
入力はすべて整数
入力形式
入力は以下の形式で与えられる.
$h\ w \ W$
$B_{1,1} \dots B_{1,w}$
$\vdots$
$B_{h,1} \dots B_{h,w}$
出力
「収入の合計 - 電気代の合計」の最大値を出力せよ. また, 末尾に改行も出力せよ.
サンプル
サンプル入力 1
4 4 10
100 100 100 100
100 100 100 100
1 100 100 1
1 1 1 1
サンプル出力 1
970
以下のように $@$ の位置の電源をオンにし, $X$ の位置の電源をオフにするのが最善である.
100 100 100 100
@ @
100 100 100 100
@
1 100 100 1
X X
1 1 1 1 | [
{
"submission_id": "aoj_2943_4085309",
"code_snippet": "#include <bits/stdc++.h>\n#include <stdlib.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\nconst ll mod=1000000007;\nconst ll INF=1e15;\n#define REP(i,a,b) for(ll i=a;i<b;i++)\n#define rep(i,n) REP(i,... |
aoj_2945_cpp | 毒の沼地
あなたはレトロなロールプレイングゲームで遊んでいる．このゲームのフィールドは縦 100 マス，横 100 マスのマス目状である．このフィールドの左から
x
列目，上から
y
行目のマスは
(x, y)
と表される．あなたが操作するキャラクターはフィールド内のいずれかのマスの上におり，フィールド内を上下左右に 1 マスずつ移動することができる．
あなたが操作するキャラクターはいま
(X
0
, Y
0
)
にいて，これから
N
箇所の目的地を順番に訪問する予定である．しかしながら，あなたはキャラクターを操作するとき，フィールドのマスの種類に注意してキャラクターを移動させなければならない．それぞれのマスは毒のある沼地か毒のない土地のどちらかである．キャラクターの移動先のマスが毒のある沼地の場合にはキャラクターはダメージを受け，移動先のマスが毒のない土地の場合にはダメージを受けない．あなたはキャラクターへのダメージを減らすため，適切に経路を選ぶことでキャラクターがダメージを受ける回数をできるだけ少なくしたい．ダメージの有無はキャラクターの移動先のマスの種類で決まること，例として，移動元のマスが毒のある沼地で移動先のマスが毒のない土地の場合にはキャラクターはダメージを受けないことに注意せよ．
あなたの分析によれば，左上を
(A, B)
，右下を
(C, D)
とする長方形の範囲内のマスは毒のない土地であり，それ以外のマスは毒のある沼地である．あなたのキャラクターが毒のある沼地からダメージを受ける回数を最小化するように
N
箇所の目的地を順番に訪問したとき，あなたの操作するキャラクターがダメージを受ける回数を求めよ．
Input
入力は最大で 50 個のデータセットからなる． 各データセットは次の形式で表される．
N
A
B
C
D
X
0
Y
0
X
1
Y
1
X
2
Y
2
...
X
N
Y
N
データセットは
N+3
行からなる．
1 行目は目的地の数
N
(
1 ≤ N ≤ 100
) を表す整数である．
2 行目は毒のない土地となっている長方形の範囲を表す整数
A
，
B
，
C
，
D
であり，
1 ≤ A ≤ C ≤ 100
，
1 ≤ B ≤ D ≤ 100
を満たす．キャラクターの移動先のマス
(x, y)
が
A ≤ x ≤ C
と
B ≤ y ≤ D
を満たすとき，またその場合に限りキャラクターはダメージを受けない．
3 行目はあなたが操作するキャラクターが最初にいるマスの座標
(X
0
, Y
0
)
を表す整数であり
1 ≤ X
0
, Y
0
≤ 100
を満たす．4 行目から続く
N
行には
N
箇所の目的地の座標が与えられる．
3+i
行目は
i
番目の目的地のマスの座標
(X
i
, Y
i
)
を表す整数であり
1 ≤ X
i
, Y
i
≤ 100
を満たす．キャラクターが最初にいるマスおよび目的地のマスの座標はそれぞれ異なる，すなわち
(X
j
, Y
j
) ≠ (X
k
, Y
k
)
(0 ≤ j < k ≤ N)
を満たす．
入力の終わりは，1 個のゼロだけからなる行で表される．
Output
各データセットについて，あなたの操作するキャラクターがダメージを受ける回数を 1 行で出力せよ．
Sample Input
2
3 3 5 7
3 3
7 3
7 7
5
1 10 100 10
1 1
100 1
50 20
50 80
51 21
51 1
0
Output for the Sample Input
5
174
入力例を以下の図に示す．
(3, 3)
から
(5, 3)
の間は毒のない土地であるが
(6, 3)
と
(7, 3)
は毒のある沼地であるため，1 番目の目的地に移動するまでにダメージを 2 回受ける．1 番目の目的地から 2 番目の目的地まで下方向に 4 回移動して最短距離で移動した場合は，すべてのマスが毒のある沼地であるためダメージを 4 回受ける．遠回りして毒のない土地を通った場合は，
(6, 3)
，
(6, 7)
，
(7, 7)
の毒のある沼地に入るためダメージを 3 回受ける．ダメージを受ける回数を最小化するような移動方法を選んだとき，ダメージを受ける回数は 5 回である． | [
{
"submission_id": "aoj_2945_10662207",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ALL(x) (x).begin(),(x).end()\n#define REP(i, n) for(ll i=0; i<(ll)(n); i++)\n#define PER(i, n) for(ll i=(ll)(n)-1; i>=0; i--)\n\ntemplate<typename T> int LB(const vector<T>& v, T x) { return lowe... |
aoj_2942_cpp | F: Absum
問題
長さ $N$ の数列 $A$ が与えられる．あなたは高々 $M$ 回まで，数列の $i$ 番目と $j$ 番目（$0 \leq i, j \leq N-1$）の要素を入れ替える操作を行うことができる．
操作を行なってできる数列の $\sum_{i = 0}^{N - 1} abs(A_i - i)$ の最大値を求めよ．
制約
$2 \leq N \leq 10^5$
$0 \leq M \leq N$
$0 \leq A_i \leq 10^5$
入力形式
入力は以下の形式で与えられる.
$N\ M$（15:15修正）
$A_0\ A_1\ A_2\ \dots\ A_{N - 1}$
出力
操作を行なってできる数列の $\sum_{i = 0}^{N - 1} abs(A_i - i)$ の最大値を求めよ.また, 末尾に改行も出力せよ.
サンプル
サンプル入力 1
5 2
0 3 2 1 4
サンプル出力 1
12
$0$ 番目の要素と $4$ 番目の要素に操作を行うと，操作後の数列は $(4, 3, 2, 1, 0)$ となり， $|4 - 0| + |3 - 1| + |2 - 2| + |1 - 3| + |0 - 4| = 12$ で最大となる．必ずしも操作を
$M$ 回行う必要がない
ことに注意せよ．
サンプル入力 2
3 2
0 0 0
サンプル出力 2
3
操作を行うことなく最大値となる．
サンプル入力 3
6 2
1 0 3 6 5 4
サンプル出力 3
20 | [
{
"submission_id": "aoj_2942_10760523",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\nll N, M;\nll A[100050];\nint main() {\n ll ans = 0;\n cin >> N >> M;\n priority_queue<l_l> indexes;\n priority_queue<l_l> values;\n for(int... |
aoj_2947_cpp | 文字列の魔法
魔法使いであるあなたは，今日も魔法の修行に励んでいる．あなたは今，手元に英小文字からなる文字列
X
を持っている．あなたの今日の修行の課題は，この文字列を，別の文字列
Y
に変化させることである．
あなたは，文字列を変化させる魔法を 4 種類習得していて，それらを好きな順序で何回でも唱えることができる．ただし，魔法を唱えるたびに，魔法石と呼ばれる特別な石を消費する．あなたが習得している魔法は次の通りである．
魔法石を
A
個消費する．手元の文字列の好きな位置に，好きな英小文字 1 文字を追加する．例えば，元の文字列が bcbd であった場合，abcbd, bcebd, bcbdf などの文字列に変化させることができる．
魔法石を
E
個消費する．手元の文字列の好きな 1 文字を取り除く．例えば，元の文字列が bcbd であった場合，cbd, bbd, bcd, bcb のいずれかに変化させることができる．なお，元の文字列の長さが 0 である場合，この魔法を唱えることはできない．
魔法石を
S
個消費する．手元の文字列の好きな 1 文字を，別の好きな英小文字 1 文字に置き換える．例えば，元の文字列が bcbd であった場合，acbd や bebd などの文字列に変化させることができる．なお，元の文字列の長さが 0 である場合，この魔法を唱えることはできない．
魔法石を
R
個消費する．手元の文字列の先頭の 1 文字を末尾に移動させる．例えば，元の文字列が bcbd であった場合，cbdb に変化させることができる．なお，元の文字列の長さが 0 である場合，この魔法を唱えることはできない．
魔法石は高価なので，あなたは魔法石の消費を最小限にしたいと考えている．文字列
X
を文字列
Y
に変化させるために必要な魔法石の個数の最小値を求めよ．
Input
入力は複数のデータセットからなる．各データセットは以下の形式で表される．
X
Y
A
E
S
R
X
,
Y
は英小文字のみからなる異なる文字列であり，いずれも長さは
1
以上
100
以下である．
A
,
E
,
S
,
R
はいずれも
1
以上
10
6
以下の整数である．
入力の終わりは '#' 一つのみからなる行で示される．入力に含まれるデータセットの数は高々 50 である．
Output
各データセットについて，文字列
X
を文字列
Y
に変化させるために必要な魔法石の個数の最小値を，1 行に出力せよ．
Sample Input
typewriter
periodicity
100010
100100
101000
110000
periodicity
typewriter
100010
100100
101000
110000
periodicity
typewriter
100010
100100
101000
1
domestic
contest
100010
100100
101000
110000
#
Output for the Sample Input
823120
1001540
603217
502210 | [
{
"submission_id": "aoj_2947_10946011",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n\n#define int long long\n\nconst int INF = 1e18;\n\nsigned main() {\n// freopen(\"in.txt\", \"r\", stdin);\n// freopen(\"output.txt\", \"w\", stdout);\n ios_base::sync_with_stdio(0);\n ci... |
aoj_2948_cpp | 成績上昇大作戦
受験生の太郎君は
N
日間の勉強合宿に参加した．
この合宿では毎日
M
科目のテストを行い，
合宿の終了後にはすべてのテストの点数が書かれた成績表が配られる．
成績表は
N
枚の紙からなっており，
i
枚目の紙には
i
日目の全
M
科目のテストの科目名と点数のみが印刷されている．
成績表に日付が書かれていないことに気付いた太郎君は，お母さんに成績表を渡す前に細工を加えることにした．
成績表の紙の順番を並べ替え，さらに1枚目から順番にページ番号を書き込んで冊子にすることによって「偽りの成績表」を作ったのだ．
太郎君の目的は，「偽りの成績表」でテストの点数がページ番号に対して広義単調増加している科目の個数を最大化することである．
太郎君が「偽りの成績表」を作るとき，テストの点数がページ番号に対して広義単調増加である科目の個数の最大値を求めよ．
ただし，
N
日間のテストの点数がページ番号に対して広義単調増加であるとは
1 ≤ i < N
に対して
i+1
枚目に記載されている点数が
i
枚目に記載されている点数以上であることを意味する．
Input
入力は 50 個以下のデータセットからなる． 各データセットは次の形式で表される．
N
M
a
11
...
a
1M
...
a
N1
...
a
NM
1行目には，勉強合宿の日数
N
と科目数
M
が与えられる．
N
は
1
以上
10
3
以下の整数で，
M
は
1
以上
40
以下の整数である．
続く
N
行には太郎君の点数が与えられる．各行は
M
個の整数からなっており
a
ij
は太郎君の
i
日目の科目
j
の点数であり，
a
ij
は
0
以上
10
3
以下の整数である．
入力の終わりは，2 つのゼロからなる行で表される．
Output
各データセットについて，テストの点数がページ番号に対して広義単調増加である科目の個数の最大値を 1 行に出力せよ．
Sample Input
3 3
1 2 3
2 1 3
3 3 3
8 5
3 3 4 3 4
2 1 2 3 2
7 9 7 8 7
3 4 3 3 4
1 2 2 3 2
4 5 6 5 6
7 9 7 7 8
4 5 5 6 6
5 5
1 2 3 4 5
2 3 4 5 1
3 4 5 1 2
4 5 1 2 3
5 1 2 3 4
5 9
1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2
3 3 3 3 3 3 3 3 3
4 4 4 4 4 4 4 4 4
5 5 5 5 5 5 5 5 5
0 0
Output for the Sample Input
2
3
1
9 | [
{
"submission_id": "aoj_2948_10671795",
"code_snippet": "#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\nusing mint = modint998244353;\n\n//多倍長整数//\n//#include <boost/multiprecision/cpp_int.hpp>\n//namespace mp = boost::multiprecision;\n//using bint = mp::cp... |
aoj_2949_cpp | 全宇宙生命ゲノムデータベース リターンズ
西暦2301年，宇宙連邦共和国の生命科学局では，宇宙生物のゲノム配列の研究を行っていた．近年の研究の結果，ゲノム配列に特定のパターンが何回現れるかが生物の性質に大きく影響することが分かってきた．
宇宙生物のゲノム配列は英大文字からなる文字列で表される．研究員たちはゲノム配列の中に，ある特定のパターンが何回現れるかを数え上げることにした．しかしながら，宇宙生物のゲノム配列は非常に長いため，後述する方法で繰り返しがある部分文字列を圧縮してデータベースに保存している．
あなたの仕事は圧縮されたゲノム配列
S
から文字列
Q
の出現回数を数え上げるプログラムを作成することである．ただし，
Q
の出現は，開始位置さえ異なっていれば，重なっている部分があっても別の出現として数える．例えば， MISSISSIPPI に ISSI は 2 回出現する．
ゲノム配列の圧縮方法は以下のBNFで定義される．
<Genome> ::= <Letter> | <Number> <Letter> | <Number> ( <Genome> ) | <Genome> <Genome>
<Letter> ::= 'A' | 'B' | … | 'Z'
<Number> ::= <Digit> | <Number> '0' | <Number> <Digit>
<Digit> ::= '1' | '2' | … | '9'
ここで，文字列の前に付けられる整数はその文字列がその回数だけ繰り返されることを表す．例えば，5A は AAAAA を表し，2(AB) は ABAB を表す．整数の直後に括弧がない場合は，その直後の1文字のみが繰り返される．例えば，2AB は AAB を表す．繰り返しは多重にネストすることが可能で，2(2(AB)C) は 2(ABABC) と同じであり，ABABCABABC を表す．
Input
入力は最大で 50 個のデータセットから構成される．各データセットは次の形式で表される．
S
Q
各データセットの1行目は，圧縮されたゲノム配列を表す文字列
S
である．
S
は上記のBNFに従い，その長さは
1
以上
3 000
文字以下である．また，
S
を展開した元のゲノム配列の長さは
10
18
以下である．各データセットの2行目は数え上げる対象となる文字列
Q
である．
Q
は英大文字からなり，長さは
1
以上
3 000
文字以下である．
入力の終了は '#' の1文字だけを含む行で表される．
Output
各データセットについて，
S
を展開した文字列に
Q
が何回現れるかを出力せよ．
Sample Input
MI2(2SI)2PI
ISSI
100(100(JAG))
JAG
1000000000000000000A
AAAAA
#
Output for the Sample Input
2
10000
999999999999999996 | [
{
"submission_id": "aoj_2949_10670357",
"code_snippet": "// C++ includes used for precompiling -*- C++ -*-\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n... |
aoj_2950_cpp | Kは多角形のケイ
「
1
番じゃなきゃダメですか？
K
番じゃダメなんでしょうか？」
これがケイ氏の座右の銘である．最近ケイ氏はもっぱら多角形に興味があるようで，目の前に広がる広大な二次元平面上に置かれた
N
個の点を見て，そこから多角形を形成する方法について思いを馳せている．ケイ氏はどうやら，この
N
個の点のうちいくつかの点を選んで自由な順番で繋げることで，選んだ点を頂点とする多角形を構成することにしたようだ．ただし，多角形は以下の条件を満たす必要がある．
単純多角形である．すなわち，3 つ以上の頂点を持ち，連続しない任意の 2 辺が交点を持たない．
選ばれた点以外も含む
N
個すべての点をその内部，または周上に含む．
ケイ氏は己の信念に従って，このような多角形のうち，周長，すなわち全ての辺の長さの和が
K
番目に短い多角形を渇望している．
あなたの仕事は，ケイ氏を手伝うため，条件を満たす多角形のうち，周長の昇順に並べたときに
K
番目となる多角形を求め，その周長を出力するプログラムを書くことだ．ただし，そのような多角形が
K
個以上存在しないこともある．そのようなときにはケイ氏の無念の気持ちを慮りつつ，申し訳ない気持ちを込めながら
-1
と出力する必要がある．
Input
入力は複数のデータセットからなる． 各データセットは次の形式で表される．
N
K
x
1
y
1
...
x
N
y
N
データセットの1行目には二次元平面上の点の数
N
と求める周長の順位
K
が与えられる．
N
,
K
はともに整数であり，
3 ≤ N ≤ 25
,
1 ≤ K ≤ 10
が成り立つ．続く
N
行では各点の二次元平面上の座標が与えられる．
N
行のうち
i
行目には
i
番目の点の
x
座標
x
i
と
y
座標
y
i
がともに整数で与えられ，すべての
1 ≤ i ≤ N
について
-100 ≤ x
i
, y
i
≤ 100
が成り立つ．どの相異なる 3 点を選んでも，その 3 点すべてを通るような直線は存在しないと仮定してよい．また，入力において，周長の昇順に並べたときに
K
番目となる，問題文中に述べた条件を満たす多角形は，存在するならば一意に定まると仮定してよい．
入力の終わりは，2 個のゼロだけからなる行で表される． 全データセットの総数は 50 を超えない．
Output
与えられた点集合からいくつかの点を選び単純多角形を作るとき，構成可能な単純多角形のうち
K
番目に周長が短い多角形の周長を 1 行に出力せよ．そのような多角形が存在しない場合は -1 を出力せよ．結果は
10
-4
以上の誤差を含んではいけない．
Sample Input
5 2
1 1
1 4
2 2
3 1
3 5
3 1
0 2
1 0
-1 0
3 2
0 2
1 0
-1 0
9 10
8 1
9 19
2 10
1 1
4 17
7 13
3 4
6 13
9 21
0 0
Output for the Sample Input
11.812559200041266
6.472135954999580
-1
52.202878812480016 | [
{
"submission_id": "aoj_2950_10674937",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #incl... |
aoj_2951_cpp | 不思議なボタン
あなたは，町外れにあるダンジョンでコインを稼ぐことにした．このダンジョンには
N
個の部屋が存在し，
1
から
N
までの番号がつけられている．また，ダンジョン内には「コインボタン」「脱出ボタン」「ワープボタン」と呼ばれる不思議なボタンが存在する．それぞれのボタンの詳細は次の通りである．
コインボタンは各部屋にちょうど
1
個存在する．コインボタンは何回でも押すことができ，そのたびにコインが
1
枚手に入る．
脱出ボタンは各部屋にちょうど
1
個存在する．脱出ボタンを押すとあなたはただちにダンジョンから脱出し，この冒険を終了する．
ワープボタンは合計で
M
個存在する．このうち
i
個目のワープボタンは部屋
a
i
に存在し，押すことであなたは部屋
b
i
にワープし，さらにコインが
c
i
枚手に入る．ただし，
a
i
< b
i
および
1 ≤ c
i
≤ 3
を満たす．なお，ワープボタンが 1 つの部屋に複数ある場合や，ワープボタンのまったく無い部屋が存在する場合もある．
なお，ボタンを押す以外の方法で部屋を移動することはできず，複数のボタンを同時に押すこともできない．また，いずれのボタンも互いに区別可能である．
あなたはこのダンジョンを
Q
回冒険した．あなたの記憶が正しければ，
j
回目の冒険は部屋
1
から始まり，最後に部屋
d
j
にある脱出ボタンを押し，コインの合計獲得枚数はちょうど
e
j
枚だったはずである．
Q
回の冒険それぞれについて，そのようなボタンの押し方が何通りあるかを求めよ．答えは大きくなる可能性があるので，
10
9
+7
すなわち
1000000007
で割った余りを求めよ．
ただし，2 通りの「ボタンの押し方」が異なるとは，ボタンを押した合計回数が異なるか，またはある整数
k
が存在し，
k
回目に押したボタンが異なることを指す．
なお，もしかしたらあなたの記憶は間違っており，そのようなボタンの押し方は存在しないかもしれない．その場合には
0
を出力せよ．
Input
入力は複数のデータセットからなる． 各データセットは次の形式で表される．
N
M
a
1
b
1
c
1
a
2
b
2
c
2
...
a
M
b
M
c
M
Q
d
1
e
1
d
2
e
2
...
d
Q
e
Q
データセットの 1 行目には，部屋の数を表す整数
N
と，ワープボタンの数を表す整数
M
が与えられ，
1 ≤ N, M ≤ 2 000
を満たす．続く
M
行にはワープボタンの情報が与えられる．
M
行のうち
i
行目には，
i
番目のワープボタンの存在する部屋番号
a
i
，ワープ先の部屋番号
b
i
および手に入るコインの枚数
c
i
が与えられ，
1 ≤ a
i
< b
i
≤ N
および
1 ≤ c
i
≤ 3
を満たす．
M+2
行目には冒険の回数を表す整数
Q
が与えられ，
1 ≤ Q ≤ 2 000
を満たす．続く
Q
行にはあなたの記憶にある冒険の情報が与えられる．
Q
行のうち
j
行目には，
j
番目の冒険であなたが脱出ボタンを押した部屋番号
d
j
およびコインの獲得枚数
e
j
が与えられ，
1 ≤ d
j
≤ N
および
1 ≤ e
j
≤ 10
9
を満たす．
入力の終わりは，2 個のゼロだけからなる行で表される．全データセットの総数は 50 を超えない．
Output
各データセットについて出力は
Q
行からなる．このうち
j
行目には，部屋
1
から始まり，最後に部屋
d
j
にある脱出ボタンを押し，コインの合計獲得枚数がちょうど
e
j
枚であるようなボタンの押し方の総数を，
10
9
+7
で割った余りを出力せよ．
Sample Input
4 9
1 2 1
1 2 2
1 3 1
1 3 2
1 3 3
2 3 1
2 3 2
1 4 1
3 4 2
8
1 5
2 5
3 5
4 5
1 1234567
2 1234567
3 1234567
4 1234567
4 8
1 2 1
1 2 1
1 2 3
3 4 3
1 4 2
2 4 1
2 4 3
2 4 3
8
1 3
2 6
3 8
4 12
1 31415926
2 53589793
3 23846
4 26433832
0 0
Output for the Sample Input
1
9
37
21
1
2469133
307629943
60012504
1
16
0
424
1
160769377
0
43581113 | [
{
"submission_id": "aoj_2951_10208608",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v... |
aoj_2953_cpp | B: Hokkaido University Hard
注意
問題設定は A 問題と同一のものですが、制約のみが異なりますのでご注意ください。
物語
北海道大学に合格し、新たな生活の始まりに心を躍らせるほむらちゃん。しかし彼女の前には、とてつもなく広いキャンパスが待ち受けていた...。
「え...次の授業に間に合わないんだけど...」
問題
北海道大学札幌キャンパスは異常に広いことで有名です。札幌キャンパスは縦に
H
マス、横に
W
マス並んだ長方形のマス目で表現されます。北から
i
マス、西から
j
マス進んだマスを
(i,j)
で表すことにします。キャンパス内にはいくつか建物があり、マス
(i,j)
で表される位置に建物がある場合は 'B' 、ない場合は '.' が
c_{i,j}
に書かれています。
北海道大学の新入生のほむらちゃんは、キャンパスのあまりの広さに驚愕し、建物間の移動が心配になってきました。そこで、建物のある
2
つのマスのうち、最も遠い組はどれくらい離れているのかが気になりました。ここで、
2
つのマスの組
(i,j) , (i',j')
の間の距離を
|i-i'|+|j-j'|
と定義します。
ほむらちゃんは、自分にはこの問題は難しいと思い、同級生のあなたに助けを求めてきました。ほむらちゃんの代わりに答えを求めてください。
入力形式
H
W
c_{11}
c_{12}
...
c_{1W}
:
c_{H1}
c_{H2}
...
c_{HW}
制約
2 \leq H,W \leq 10^3
H,W
は整数
c_{i,j}
は 'B' か '.' のいずれかである。
c_{i,j}
のうち少なくとも
2
つは 'B' である。
出力形式
答えを表す整数を
1
行に出力せよ。
入力例 1
3 3
B.B
..B
.BB
出力例 1
4
(1,1)
と
(3,3)
の
2
点間が最長です。
入力例 2
4 3
B..
B..
...
...
出力例 2
1
隣り合う位置が最長になる場合もあります。
入力例 3
6 6
...B..
B.B.B.
.B.B.B
...B.B
.B..B.
..B...
出力例 3
7 | [
{
"submission_id": "aoj_2953_8302836",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll =long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nint main() {\n ll H,W;\n cin>>H>>W;\n vll L(H,1e18),R(H,-1);\n rep(h,H){\n ... |
aoj_2957_cpp | F: MOD Rush
問題
長さ
N
の正の整数列
A
と、長さ
M
の正の整数列
B
が与えられます。
すべての
(i, j)
(1 \leq i \leq N, 1 \leq j \leq M)
について、
A_i
を
B_j
で割ったあまりを求め、それらの和を出力してください。
入力形式
N
M
A_1
A_2
...
A_N
B_1
B_2
...
B_M
制約
1 \leq N, M \leq 2 \times 10^5
1 \leq A_i, B_i \leq 2 \times 10^5
入力はすべて整数で与えられる
出力形式
答えを
1
行に出力してください。最後に改行してください。
入力例 1
3 3
5 1 6
2 3 4
出力例 1
9
数列
A
の
1
番目の要素を、数列
B
の各要素で割ったあまりを考えます。
5
を
2
で割るとあまりは
1
、
3
で割るとあまりは
2
、
4
で割るとあまりは
1
です。
同様に
2
番目の要素についても考えると、あまりはそれぞれ
1, 1, 1
です。
3
番目の要素についても考えると、あまりはそれぞれ
0, 0, 2
です。
あまりを合計すると
1 + 2 + 1 + 1 + 1 + 1 + 0 + 0 + 2 = 9
となるので、
9
を出力します。
入力例 2
2 4
2 7
3 3 4 4
出力例 2
16
数列内には同じ値が複数含まれていることがありますが、それぞれの要素に対してあまりを計算して和を求めます。
入力例 3
3 1
12 15 21
3
出力例 3
0 | [
{
"submission_id": "aoj_2957_8170574",
"code_snippet": "#line 1 \"2957.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/2957\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = s... |
aoj_2958_cpp | G: Tree
問題
N
頂点からなる木が与えられます。木の各頂点には
1
から
N
の番号が割り振られています。また、
N−1
本の辺のうち、
i\ (= 1, 2, ..., N-1)
本目の辺は頂点
u_i
と頂点
v_i
とを結んでいます。
この木の
K
個の空でない部分グラフの組であって、各部分グラフがいずれも連結で、どの二つの相異なる部分グラフも頂点を共有しないものの個数を求めるプログラムを作成してください。ただし答えがとても大きくなることがあるため、
998244353
で割ったあまりを答えてください。
なお、
K
個の部分グラフからなる集合が同一のものは、
K
個の部分グラフの順序が異なるものも同一視するものとします。
入力形式
N
K
u_1
v_1
:
u_{N-1}
v_{N-1}
制約
2 \leq N \leq 10^{5}
1 \leq K \leq min ( N, 300 )
1 \leq u_i, v_i \leq N
u_i \neq v_i
i \neq j
に対して
(u_i, v_i) \neq (u_j, v_j)
入力はすべて整数で与えられる。
与えられるグラフは木であることが保証される。
出力形式
答えを表す整数を一行に出力してください。
998244353
で割ったあまりを出力することに注意してください。
入力例 1
3 2
1 2
1 3
出力例 1
5
以下の
5
通りがあります:
\{ 1 \}
と
\{ 2 \}
\{ 1 \}
と
\{ 3 \}
\{ 2 \}
と
\{ 3 \}
\{ 1, 2 \}
と
\{ 3 \}
\{ 1, 3 \}
と
\{ 2 \}
入力例 2
4 4
1 2
1 3
1 4
出力例 2
1
( \{ 1 \}, \{ 2 \}, \{ 3 \}, \{ 4 \} )
の
1
通りしかありません。
入力例 3
7 4
1 7
2 1
7 4
3 4
5 7
6 3
出力例 3
166 | [
{
"submission_id": "aoj_2958_10401873",
"code_snippet": "// AOJ #2958 Tree\n// 2025.4.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int MOD = 998244353, G = 3;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\... |
aoj_2956_cpp | E: ジャム (Jam)
問題
ある国には
N
個の街があり、
1,\ 2,\ ...,\ N
の番号がつけられています。これらの街は
M
本の道で双方向に結ばれており、
i
番目の道を使うと街
u_i
と
v_i
の間を時間
t_i
で移動することができます。また、どの
2
つの街もいくつかの道を使うことで行き来することができます。
それぞれの街では食パンが売られており、街
i
で売られている食パンの美味しさは
P_i
です。
さらに、この国には
K
種類の味のジャムがあり、街
i
では味
c_i
で美味しさ
J_i
のジャムを買うことができます。
街
1
に住んでいるほむちゃんは、これからパンとジャムを
1
つずつ買いにお出かけすることにしました。ほむちゃんは、いくつかの街を移動してパンとジャムを買って街
1
に戻ってきます。より正確には、ある街
u
に移動してパンを買い、ある街
v
を選んでジャムを買い、街
1
に戻ってきます。この際、
u=v
や
u=1
、
v=1
でも構いません。
お買い物を終えたほむちゃんの幸福度は、「買ったパンとジャムの美味しさの合計」ー「移動にかかった時間」です。
K
種類それぞれのジャムについて、その味のジャムとパンを買いに行くときの幸福度として考えられる最大値を計算してください。
入力形式
N
M
K
P_1
P_2
...
P_N
c_1
c_2
...
c_N
J_1
J_2
...
J_N
u_1
v_1
t_1
u_2
v_2
t_2
:
u_M
v_M
t_M
制約
1\leq N\leq 10^5
1\leq M\leq 2\times 10^5
1\leq K\leq N
1\leq P_i, J_i\leq 10^9
1\leq c_i\leq K
1\leq u_i, v_i \leq N
1\leq t_i \leq 10^9
すべての
i\ (1\leq i\leq K)
について、
c_j=i
となる
j\ (1\leq j\leq N)
が存在する
与えられるグラフは多重辺や自己ループを含まない連結なグラフである
入力はすべて整数で与えられる
出力形式
K
行出力してください。
i
行目にはパンと味
i
のジャムを買いに行く場合の幸福度の最大値を出力してください。
入力例 1
4 4 3
3 6 1 6
1 1 2 3
6 1 5 5
1 2 1
2 3 1
1 3 1
1 4 1
出力例 1
10
8
9
味
1
のジャムを買う場合
街
1
でジャムを買い、街
2
に移動してパンを買い、街
1
に戻ってくると、幸福度は
6+6-2=10
となりこれが最適です。
味
2
のジャムを買う場合
街
2
に移動してパンを買い、街
3
に移動してジャムを買い、街
1
に戻ってくると、幸福度は
6+5-3=8
となります。
味
3
のジャムを買う場合
街
4
に移動してパンとジャムの両方を買って街
1
に戻ってくると、幸福度は
6+5-2=9
となります。
入力例 2
2 1 2
1 1
1 2
1 1
1 2 1000000000
出力例 2
2
-1999999998
パンやジャムの美味しさに比べて距離が遠すぎるのでほむちゃんは不満そうです。
入力例 3
6 8 3
31 41 59 26 53 58
1 2 3 1 2 3
27 18 28 18 28 46
1 2 3
2 3 7
2 4 8
3 6 9
3 5 3
4 5 3
1 5 15
4 6 7
出力例 3
66
61
68 | [
{
"submission_id": "aoj_2956_8013579",
"code_snippet": "#include <bits/stdc++.h>\n\nusing usize = std::size_t;\nusing i64 = long long;\n\nstruct SPFAGraph {\n using edge = std::pair< usize, i64 >;\n\n std::vector< std::vector< edge > > g;\n\n SPFAGraph(usize n) : g(n) {}\n\n void add_directed_edge(usize... |
aoj_2955_cpp | D: Two Colors Sort
問題
umg 君は散歩中に
1,2, ... ,N
を並び変えてできる長さ
N
の数列
P_1, P_2, ..., P_N
を見つけました。
umg 君は不思議な力を使うことで、同じ色に塗られた異なる数を二つ選んで場所を交換することができます。
umg 君は、数列に含まれる数のうち
R
個を赤に、残りの
N-R
個を青に塗ることで数列を昇順に並び替えられるようにしたいと考えました。
umg 君が目標を達成できるかどうか判定してください。
ただし、数字はとても重いので不思議な力を使わずに動かすことはできません。また、umg 君は天才なので不思議な力を任意の回数使うことができます。
入力形式
N
R
P_1
P_2
...
P_N
制約
1 \leq N \leq 3 \times 10^5
1 \leq R \leq N
1\leq P_i \leq N
P_i \neq P_j
(
1 \leq i < j \leq N
)
入力は全て整数である。
出力形式
umg 君が目的を達成できるなら
Yes
、そうでなければ
No
を一行に出力せよ。
入力例 1
3 2
1 3 2
出力例 1
Yes
1
を青に、
2,3
を赤に塗ることで目標が達成できます。
入力例 2
5 2
1 2 3 4 5
出力例 2
Yes
初めから昇順に並んでいます。
入力例 3
10 7
3 4 8 5 7 6 2 10 1 9
出力例 3
No | [
{
"submission_id": "aoj_2955_8302866",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll =long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nint main() {\n ll N,R;\n cin>>N>>R;\n vll P(N);\n rep(i,N){\n cin>>P[i];\n ... |
aoj_2959_cpp | H: Revenge of UMG
問題
'U', 'M', 'G' の三種類の文字からなる文字列
T
に対し、
1, 2, ..., |T|
文字目をそれぞれ
T_1, T_2, ..., T_{|T|}
と表すことにしたとき、以下の条件を満たす
(i, j, k)
の組の個数を、文字列
T
の “UMG 数”と呼ぶことにします:
1 \leq i < j < k \leq |T|
j - i = k - j
T_i
= 'U',
T_j
= 'M',
T_k
= 'G'
さて、'U', 'M', 'G', '?' の四種類の文字からなる文字列
S
が与えられます。
S
の '?' をそれぞれ 'U', 'M', 'G' のいずれかに置き換えてできる文字列は、'?' の個数を
N
として
3^{N}
通り考えられますが、それぞれの文字列の UMG 数について総和をとったものを
998244353
で割ったあまりを求めてください。
入力形式
S
制約
3 \leq |S| \leq 2 \times 10^{5}
S
は 'U', 'M', 'G', '?' の四種類の文字からなる文字列である。
出力形式
答えを表す整数を一行に出力してください。
998244353
で割ったあまりを出力することに注意してください。
入力例 1
?MG?
出力例 1
3
最初の '?' が 'U' でない場合には UMG 数は
0
になります。最初の '?' を 'U' としたとき、
UMGU
の UMG 数は
1
UMGM
の UMG 数は
1
UMGG
の UMG 数は
1
となり、合計値は
3
になります。
入力例 2
UUMMGGGUMG
出力例 2
4
入力例 3
?????G????U???M??????G?????M????G???U??????M???G??
出力例 3
648330088
998244353
で割ったあまりを答えてください。 | [
{
"submission_id": "aoj_2959_7910146",
"code_snippet": "#line 1 \"library-cpp/other/template.hpp\"\n// clang-format off\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <forward_list>\n#include... |
aoj_2960_cpp | A: four tea
問題
プログラミングコンテストにはお茶が欠かせない。お茶にはコンテスタントの緊張を和らげる作用があるのだ [要出典]
コンテストに参加する選手が
N
人いるので、この人数分のお茶を用意したいと考えている。お茶のパッケージは
A
,
B
,
C
,
D
の 4 種類あり、どれも同じ品種であるが内容量が異なる。あるパッケージ
X
について、そのパッケージ 1 つ分の値段は
p_X
円であり、1 つ買うと
t_X
杯分のお茶を作れることがわかっている。
N
人分のお茶を作るために必要な金額の最小値を求めよ。なお、全く購入しないパッケージがあってもよく、ちょうど
N
人分になるようにパッケージを購入する必要もない (
N
人分以上作れれば良い)。
入力形式
入力は以下の形式で与えられる。
N
p_A
p_B
p_C
p_D
t_A
t_B
t_C
t_D
1
行目ではコンテストに参加する選手の人数が与えられる。
2
行目では、パッケージ
A
,
B
,
C
,
D
のお茶の価格が空白区切りで与えられる。
3
行目では、パッケージ
A
,
B
,
C
,
D
からお茶が何杯作ることができるか空白区切りで与えられる。
制約
1 \leq N \leq 100
1 \leq p_X \leq 100
1 \leq t_X \leq 100
全ての入力は整数として与えられる。
出力形式
N
人分のお茶を作るために必要な金額の最小値を
1
行で出力せよ。
入力例1
10
1 2 3 4
1 2 4 8
出力例1
6
パッケージ
B
を 1 つ、
D
を 1 つ買うのが最適である。
入力例2
5
2 9 9 8
1 4 5 100
出力例2
8
必要な量の 20 倍のお茶を用意することになるが、パッケージ
D
を 1 つ買う場合が最も安く 5 杯以上のお茶を用意できる。
入力例3
24
2 3 4 7
7 9 11 20
出力例3
8
パッケージ
A
を 2 つと
C
を 1 つ買うのが最適である。このケースのように人数分のお茶をちょうど作ることが出来ないこともある。 | [
{
"submission_id": "aoj_2960_6013280",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// template {{{\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\n#define r... |
aoj_2962_cpp | C: 短絡評価
問題
直大くんと北大くんはゲームをしています。
北大くんは、まず以下の BNF で表される論理式を生成します。
<formula> ::= <or-expr>
<or-expr> ::= <and-expr>
| <or-expr> "|" <and-expr>
<and-expr> ::= <term>
| <and-expr> "&" <term>
<term> ::= "(" <or-expr> ")" | "?"
&
は論理積を、
|
は論理和を表し、
&
の方が
|
より先に評価されます。
直大くんは、この論理式を（文字列として見て）左から読んでいき、
?
を見つけたとき以下の行動をします。
その
?
を
0
にしても
1
にしても論理式の評価結果が変わらないことが確定しているなら、何もせず読み進める。
そうでないなら、北大くんに 1 円払い、その
?
を
0
または
1
に書き換える。
論理式は以下のように評価されます。いわゆる普通の論理式です。
(0 & ?) == 0
(1 & 0) == 0
(1 & 1) == 1
(0 | 0) == 0
(0 | 1) == 1
(1 | ?) == 1
直大くんが論理式の評価結果を確定させるために支払う必要がある最小金額はいくらでしょう？ 評価結果を
0
にする場合と
1
にする場合でそれぞれ求めてください。
入力形式
上の BNF に従う論理式が一行で与えられます。
制約
論理式の長さは
2\times 10^5
を超えない。
出力形式
評価結果を
0
、
1
にするために必要な最小金額を空白区切りで出力してください。
入力例1
?&?|?&?|?&?
出力例1
3 2
0
にしたい場合は
0 0 0
で書き換えて
0&?|0&?|0&?
とし、
1
にしたい場合は
1 1
で書き換えて
1&1|?&?|?&?
とするのが最適です。
入力例2
?&?&?|?&?&?
出力例2
2 3
それぞれ
0&?&?|0&?&?
、
1&1&1|?&?&?
となります。
入力例3
(?|?|?)&?&?&?&?|?&?|?&?
出力例3
4 4 | [
{
"submission_id": "aoj_2962_6013516",
"code_snippet": "#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n\n#pragma GCC optimize(\"Ofast\")\n\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\n#define lp(i,n) for(int i=0;i<(int)(n);i++)\n#define lps(i,j,n) for(... |
aoj_2963_cpp | D: 貪欲が最適？
物語
1
,
5
,
10
,
50
,
100
,
500
円玉がある日本では、ある金額を支払う時、大きい金額の硬貨をできるだけ多く使うという方法で支払うと、硬貨の枚数を最小化できることが知られている。
硬貨の金額が日本とは異なる場合、貪欲に支払うと必ずしも最小化できるとは限らない。
貪欲に支払うのが最適になるために、硬貨の金額が満たすべき条件は何なのだろうか。
問題
TAB 君は上のことが気になったので、まずは硬貨が
1
,
A
,
B
の
3
種類しかない場合について考えることにした。
A
,
B
が与えられるので、貪欲に支払った場合枚数が最小にならないような金額のうち、最小のものを出力せよ。
また、どんな金額でも貪欲法が最適な場合は、
-1
を出力せよ。
入力形式
A
B
制約
1 < A \leq 10^5
A < B \leq 10^9
入力例 1
4 6
出力例 1
8
8
円を貪欲に支払うと、
6 + 1 \times 2
で支払うことになり、合計
3
枚必要だが、
4 \times 2
で合計
2
枚で支払うことができる。
入力例 2
2 1000000000
出力例 2
-1
どんな金額であっても貪欲に支払うのが最適である。 | [
{
"submission_id": "aoj_2963_3772328",
"code_snippet": "/* Aa^~ kokoro ga pyonpyon suru n jaa^~\n// ZZZXXkXkkkZ!``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ``` ```?Wfpppbpbbpbbpbbbkbkk\n// ppbbbpbbpVr`` `` ` ` ` ` ```` `` ` ` `` ` ` ` ` ` ` ` ` ` dppbbkkkkkkkkkkqkqkk\n// HkqqqqqkkWr`` ` ` ``` ``` `?G, ` ` ``.... |
aoj_2961_cpp | B: 自身の 2 倍
問題
クエリが
Q
個与えられます。1 個のクエリにつき、 1 つの正の整数
N
が与えられるので、次の 2 つの条件を満たす正の整数
M
の個数を求めてください。
2 \leq M \leq N
を満たす
M
の約数のうち、
M
を除いたものの総積が
M
の
2
倍以上になる
入力形式
入力は以下の形式で与えられます。
Q
N_1
N_2
:
N_Q
1
行目では、クエリ数
Q
が与えられます。
2
行目から
N+1
行目では、各クエリについて与えられる 1 つの正の整数
N
が与えられます。
制約
1 \leq Q \leq 10^5
2 \leq N_i \leq 10^5
(1 \leq i \leq Q)
出力形式
上記の 2 つの条件を満たす正の整数の個数を、各
N_i
に対して、改行区切りで出力してください。
入力例
3
43
9
24
出力例
11
0
5
N=24
の時、
M
として考えられるのは
12
,
16
,
18
,
20
,
24
の
5
種類である。 | [
{
"submission_id": "aoj_2961_9849964",
"code_snippet": "#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nTODO\nsolve inverse problem:\nif v == p^1 or p^2 or p^3\nor v == p1*p2\n\n*/\n\n\n//------------------------------------------------------------------------------\nbool... |
aoj_2964_cpp | E: 最短経路の復元
物語
競技プログラマーは日々最短経路問題を解いている。BFS や、ベルマンフォード、ダイクストラ、ワーシャルフロイドと多くのアルゴリズムも知られている。
あなたはそんな中、どうしても解けない最短路問題があった。それはグラフを見ずに最短路問題を解けという問題だ！こんなもの通常の人類には解けるわけがないのだが、30 分だけ ivvivvi 神の天啓を受けることができるようになった。
ivvivvi 神は競技プログラミングにも最短経路問題にも精通しており、どんなグラフに対しても任意の 2 点間の最短経路長を定数時間で求める能力を持っている。あなたは ivvivvi 神の力を借りて最短経路問題を解こうと思ったが、残念ながらあなたの解くべき最短経路問題では具体的な経路を出力しなければならない。ivvivvi 神なら、最短経路の復元も容易だが、ivvivvi 神は非常に忙しいので、これ以上手を煩わせるわけには行けない。そこで、できるだけ少ない質問回数で自力で最短経路を復元することにした。
問題
3
つの整数
N
、
s
、そして、
t
が与えられる。このとき、頂点数
N
のグラフがあり、頂点数以外の辺数や頂点の隣接関係などのグラフに関する情報は与えられないが、
2
頂点
u
、
v
の距離を質問することができる。ここで、グラフの頂点番号は
1
以上
N
以下である。
5N
回以下の質問回数で
s
から
t
への最短路を発見し、最短路を表す頂点列を
1
つ出力せよ。
この問題では
2
頂点
u
、
v
間の距離をジャッジに質問しなければならない。
標準出力に次のように出力することで、
u
、
v
間の距離を質問することができる。
?
u
v
このように標準出力したあと、この答えは標準入力に
1
行の整数として与えられる。
この問題ではプログラムの行った質問の回数が
5N
回を超えると誤答（WA）と判定される。この問題では最後に頂点列、つまり整数列を出力する。頂点列
(x_1, ..., x_k)
を出力する出力形式は次のようである。
!
x_1
x_2
...
x_k
ここで、出力は
x_1 = s
、
x_k = t
を満たし、任意の
1 \leq i \leq k - 1
に対して、
x_i
と
x_{i + 1}
を直接結ぶ辺が存在する。
さらに、この最終的な解答は、一度しか行うことができない。この解答が正しい出力だったとき、正答とみなす。さらに、標準出力として上記の
2
つの記法と異なる出力や質問回数が
5N
回を超えた時はジャッジは
-1
を返す。この時、即座にプログラムを終了させない場合、ジャッジが WA を正しく判定することを保証しない。
また、標準出力を行う毎に、ストリームをフラッシュ (flush) する必要があることに注意されよ。主要な言語でのフラッシュ例を以下に示す。もちろん、これ以外の方法でフラッシュを行っても構わない。
C 言語:
#include <stdio.h>
fflush(stdout);
C++:
#include <iostream>
std::cout.flush();
Java:
System.out.flush();
Python:
print(end='', flush=True)
入力形式
入力として整数
3
つが与えられる。
N
s
t
制約
2 \leq N \leq 300
1 \leq s, t \leq N
s \neq t
問題において使用されるグラフ上の任意の 2 頂点
u
,
v
について、最短距離を求めたものの最大値は
10^9
以下である
問題において使用されるグラフは連結であることが保証される
入出力例
標準入力
標準出力
4 1 3
? 4 3
3
? 1 4
2
? 2 1
1
? 3 2
2
? 1 3
3
? 4 2
1
! 1 2 3
この入出力例では以下のグラフに対して 2 点間の距離を質問している。 | [
{
"submission_id": "aoj_2964_6935769",
"code_snippet": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=9167167167167167167;\nconst int INF=10000000;\n\n#define rep(i,a) f... |
aoj_2965_cpp | F: グリッドの番号
問題
えびちゃんは、横
n
列、縦
2
行のグリッドに
1
から
2 \times n
までの整数をちょうど
1
つずつ書き込もうとしています。
グリッドの各マスにはちょうど
1
つの整数しか書き込めません。
普通に書き込むだけでは面白くないので、以下のようなルールを定めました。
隣り合う
2
つのマスに書き込まれた整数の、差の絶対値は
k
以下である。
あるマスの右にマスが存在する時、あるマスに書き込まれた整数は、右のマスに書き込まれた整数より真に小さい。
あるマスの下にマスが存在する時、あるマスに書き込まれた整数は、下のマスに書き込まれた整数より真に小さい。
ここで、隣り合う
2
つのマスとは、あるマスと上下左右の辺を共有するマスのことを表します。
このような書き込み方は何通りあるでしょうか?
答えが非常に大きくなる可能性があるので、素数
m
で割った余りを出力してください。
補足
上記の
2
番目のルールと
3
番目のルールは、以下の図のように、不等号に違反しないように整数を書き込むことを要求しています。
入力形式
入力として整数が 3 つ与えられます。
n
k
m
制約
1 \leq n \leq 100
1 \leq k \leq 10
2 \leq m \leq 10^9+7
m
は素数
出力形式
数字の書き込み方の通り数を一行に出力してください。
また、末尾の改行を忘れないように注意してください。
入力例 1
3 2 7
出力例 1
1
上記の書き込み方が条件を満たし、これ以外に条件を満たす書き込み方は存在しません。
入力例 2
5 10 11
出力例 2
9
m
で割った余りを出力してください。 | [
{
"submission_id": "aoj_2965_10536793",
"code_snippet": "// AOJ #2965 Grid Number\n// 2025.5.28\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n, k;\n ll m;\n cin >> n >> k >> m;\n int N = 2 * n;\n ll B = k + 2;\n ll B2 = k + 2;\n\n unorde... |
aoj_2969_cpp | Problem Statement
You are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, which denotes a range of numbers greater than or equal to $l_i$ and strictly less than $r_i$. In this task, you consider the following two numbers:
The minimum integer $x$ such that you can select $x$ intervals from the given $N$ intervals so that the union of the selected intervals is $[0, L)$.
The minimum integer $y$ such that for all possible combinations of $y$ intervals from the given $N$ interval, it
does
cover $[0, L)$.
We ask you to write a program to compute these two numbers.
Input
The input consists of a single test case formatted as follows.
$N$ $L$
$l_1$ $r_1$
$l_2$ $r_2$
$\vdots$
$l_N$ $r_N$
The first line contains two integers $N$ ($1 \leq N \leq 2 \times 10^5$) and $L$ ($1 \leq L \leq 10^{12}$), where $N$ is the number of intervals and $L$ is the length of range to be covered, respectively. The $i$-th of the following $N$ lines contains two integers $l_i$ and $r_i$ ($0 \leq l_i < r_i \leq L$), representing the range of the $i$-th interval $[l_i, r_i)$. You can assume that the union of all the $N$ intervals is $[0, L)$
Output
Output two integers $x$ and $y$ mentioned in the problem statement, separated by a single space, in a line.
Examples
Input
Output
3 3
0 2
1 3
1 2
2 3
2 4
0 4
0 4
1 1
5 4
0 2
2 4
0 3
1 3
3 4
2 4 | [
{
"submission_id": "aoj_2969_11036737",
"code_snippet": "#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start... |
aoj_2966_cpp | G: トレジャーハンター (Treasure Hunter)
問題
財宝の山が
N
個あり、それぞれの山は
1
から
N
までで番号づけられている。
i
番目の山には価値
p_i
のお宝が眠っており、このお宝はその山に訪れた時点で得ることができる。一度お宝を得るとその山からはお宝がなくなってしまうので、お宝はそれぞれ一度しか得ることはできない。
異なる山に移動するには必ず道を利用しなければならない。山と山の間には合計
N-1
本の道があり、
i
番目の道は山
u_i
と
v_i
を双方向に結んでいる。もしもどの道も問題なく通行可能であると仮定すると、任意の
2
つの山について相互に行き来可能であることが分かっている。
どの道も長らく誰も通行しておらず修復しないと渡れないため、
i
番目の道について最初に渡る際には
c_i
円を支払って工事し、通行可能にする必要がある。一度工事した道であればそれ以上お金を支払うことなく通行が可能である。
トレジャーハンターであるあなたは、道の工事費用の予算を
W
円持っている。あなたの目的は、はじめに降り立つ山を任意に
1
つ決め、合計
W
円以下で道を工事して異なる山に移動することで、得られるお宝の価値の合計を最大化することである。あなたは最大でどれだけの価値を得られるだろうか？
なお、お宝を途中で換金することはできないため、お宝を工事費用として使用することはできないことに注意せよ。
入力形式
入力は以下の形式で与えられる。
N
W
p_1
p_2
...
p_N
u_1
v_1
c_1
:
u_{N-1}
v_{N-1}
c_{N-1}
1
行目では、山の数
N
と工事費用の予算
W
が与えられる。
2
行目では、
i
番目の山に眠っているお宝の価値
p_i
が与えられる。
3
行目から
N+1
行目では、道の情報が与えられる。
2+i
行目は
i
番目の道の情報を表しており、山
u_i
と
v_i
の間に工事費用
c_i
の道があることを表す。
制約
1 \leq N \leq 10^2
1 \leq W \leq 10^5
1 \leq p_i \leq 10^9
1 \leq u_i \lt v_i \leq N
i \neq j
ならば
u_i \neq u_j
または
v_i \neq v_j
1 \leq c_i \leq 10^5
与えられる入力は全て整数である
出力形式
得られるお宝の価値の合計の最大値を
1
行に出力せよ。末尾の改行を忘れないこと。
入力例 1
3 10
6 8 2
1 2 3
2 3 8
出力例 1
14
山
1
または山
2
に降り立ち、山
1
と山
2
を結ぶ道を工事し、山
1
と山
2
にあるお宝を得るのが最適である。工事費用の予算は
10
であるので、ふたつの道を両方とも工事することはできない。
入力例 2
3 15
10 10 12
1 2 6
1 3 4
出力例 2
32
お宝を全て得ることができる。
入力例 3
5 1
4 8 8 2 10
1 2 3
2 4 5
2 5 2
1 3 7
出力例 3
10
予算が不足しており、どの道も工事できない場合もある。 | [
{
"submission_id": "aoj_2966_4188048",
"code_snippet": "#include <bits/stdc++.h>\n#define inf (long long)-1e16\nusing namespace std;\n\nstruct edge {\n long long to, c;\n bool flg;\n};\n\nstruct data {\n vector<long long> use, nuse;\n};\n\nlong long n, w;\nvector<long long> p;\nvector<long long> cnt;\nve... |
aoj_2968_cpp | Problem Statement
You are given a positive integer sequence $A$ of length $N$. You can remove any numbers from the sequence to make the sequence “friendly".
A sequence is called friendly if there exists an integer $k$ (>1) such that every number in the sequence is a multiple of $k$.
Since the empty sequence is friendly, it is guaranteed that you can make the initial sequence friendly.
You noticed that there may be multiple ways to make the sequence friendly. So you decide to maximize the sum of all the numbers in the friendly sequence. Please calculate the maximum sum of the all numbers in the friendly sequence which can be obtained from the initial sequence.
Input
The input consists of a single test case formatted as follows.
$N$
$A_1$
$\vdots$
$A_N$
The first line consists of a single integer $N$ ($1 \le N \le 1000$). The $i+1$-st line consists of an integer $A_i$ ($1 \le A_i \le 10^9$ for $1 \le i \le N$).
Output
Print the maximum sum of all the numbers in the friendly sequence which can be obtained from the initial sequence.
Examples
Input
Output
6
1
2
3
4
5
6
12
3
173
1733
111733
111733
4
1
1
1
1
0
10
999999999
999999999
999999999
999999999
999999999
999999999
999999999
999999999
999999999
999999999
9999999990
1
999999999
999999999
10
28851
8842
9535
2311
25337
26467
12720
10561
8892
6435
56898 | [
{
"submission_id": "aoj_2968_11036500",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#defi... |
aoj_2976_cpp | Problem Statement
"Rooks Game" is a single-player game and uses a chessboard which has $N \times N$ grid and $M$ rook pieces.
A rook moves through any number of unoccupied squares horizontally or vertically. When a rook can attack another rook, it can capture the rook and move to the square which was occupied. Note that, in Rooks Game, we don't distinguish between white and black, in other words, every rook can capture any of other rooks.
Initially, there are $M$ rooks on the board. In each move, a rook captures another rook. The player repeats captures until any rook cannot be captured. There are two types of goal of this game. One is to minimize the number of captured rooks, and the other is to maximize it.
In this problem, you are requested to calculate the minimum and maximum values of the number of captured rooks.
Input
The input consists of a single test case in the format below.
$N$ $M$
$x_{1}$ $y_{1}$
$\vdots$
$x_{M}$ $y_{M}$
The first line contains two integers $N$ and $M$ which are the size of the chessboard and the number of rooks, respectively ($1 \le N, M \le 1000$). Each of the following $M$ lines gives the position of each rook. The $i$-th line with $x_{i}$ and $y_{i}$ means that the $i$-th rook is in the $x_{i}$-th column and $y_{i}$-th row ($1 \le x_{i}, y_{i} \le N$). You can assume any two rooks are not in the same place.
Output
Output the minimum and maximum values of the number of captured rooks separated by a single space.
Examples
Input
Output
8 3
1 1
1 8
8 8
1 2
8 4
1 1
1 8
8 8
8 1
2 3
5 5
1 1
2 2
3 3
4 4
5 5
0 0
100 1
100 100
0 0
10 12
1 2
1 4
1 6
3 6
5 6
10 7
8 7
6 7
4 7
2 7
7 3
9 5
7 8 | [
{
"submission_id": "aoj_2976_4699325",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define inf 0x3fffffff\n\nconst int N=2020;\nconst int M=200020;\n\nint S,T;\n\nstruct Edge{\n int to,next,vol,prf;\n}edge[M*2];\nint head[N*2];\nint tmp;\n\nint n,m;\n\nvoid add(int a,int b,int c,int ... |
aoj_2971_cpp | Problem Statement
Your company is developing a video game. In this game, players can exchange items. This trading follows the rule set by the developers. The rule is defined as the following format: "Players can exchange one item $A_i$ and $x_i$ item $B_i$". Note that the trading can be done in both directions. Items are exchanged between players and the game system. Therefore players can exchange items any number of times.
Sometimes, testers find bugs that a repetition of a specific sequence of tradings causes the unlimited increment of items. For example, the following rule set can cause this bug.
Players can exchange one item 1 and two item 2.
Players can exchange one item 2 and two item 3.
Players can exchange one item 1 and three item 3.
In this rule set, players can increase items unlimitedly. For example, players start tradings with one item 1. Using rules 1 and 2, they can exchange it for four item 3. And, using rule 3, they can get one item 1 and one item 3. By repeating this sequence, the amount of item 3 increases unlimitedly.
These bugs can spoil the game, therefore the developers decided to introduce the system which prevents the inconsistent trading. Your task is to write a program which detects whether the rule set contains the bug or not.
Input
The input consists of a single test case in the format below.
$N$ $M$
$A_{1}$ $B_{1}$ $x_{1}$
$\vdots$
$A_{M}$ $B_{M}$ $x_{M}$
The first line contains two integers $N$ and $M$ which are the number of types of items and the number of rules, respectively ($1 \le N \le 100 000$, $1 \le M \le 100 000$). Each of the following $M$ lines gives the trading rule that one item $A_{i}$ and $x_{i}$ item $B_{i}$ ($1 \le A_{i},B_{i} \le N$, $1 \le x_{i} \le 1 000 000 000$) can be exchanged in both directions. There are no exchange between same items, i.e., $A_{i} \ne B_{i}$.
Output
If there are no bugs, i.e., repetition of any sequence of tradings does not cause an unlimited increment of items, output "Yes". If not, output "No".
Examples
Input
Output
4 4
1 2 2
2 3 2
3 4 2
4 2 3
No
4 3
1 2 7
2 3 5
4 1 2
Yes
4 4
1 2 101
2 3 99
1 4 100
4 3 100
No
5 6
3 1 4
2 3 4
5 4 15
2 1 16
2 4 20
5 3 3
Yes | [
{
"submission_id": "aoj_2971_11036772",
"code_snippet": "#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start... |
aoj_2973_cpp | Problem Statement
You have a grid with $H$ rows and $W$ columns. Each cell contains one of the following 11 characters: an addition operator
+
, a multiplication operator
*
, or a digit between $1$ and $9$.
There are paths from the top-left cell to the bottom-right cell by moving right or down $H+W-2$ times. Let us define the value of a path by the evaluation result of the mathematical expression you can obtain by concatenating all the characters contained in the cells on the path in order.
Your task is to compute the sum of values of any possible paths. Since the sum can be large, find it modulo $M$.
It is guaranteed the top-left cell and the bottom-right cell contain digits. Moreover, if two cells share an edge, at least one of them contains a digit. In other words, each expression you can obtain from a path is mathematically valid.
Input
The input consists of a single test case in the format below.
$H$ $W$ $M$
$a_{1,1}$ $\cdots$ $a_{1,W}$
$\ldots$
$a_{H,1}$ $\cdots$ $a_{H,W}$
The first line consists of three integers $H$, $W$ and $M$ ($1 \le H,W \le 2 000$, $2 \le M \le 10^{9}$).The following $H$ lines represent the characters on the grid. $a_{i,j}$ represents the character contained in the cell at the $i$-th row and $j$-th column. Each $a_{i,j}$ is either
+
,
*
, or a digit between $1$ and $9$. $a_{1,1}$ and $a_{H,W}$ are both digits. If two cells share an edge, at least one of them contain a digit.
Output
Print the sum of values of all possible paths modulo $M$.
Examples
Input
Output
2 3 1000
3*1
+27
162
4 4 3000000
24+7
*23*
9+48
*123
2159570 | [
{
"submission_id": "aoj_2973_10872023",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for (ll i=0; i<ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate<class A, class B>\nbool chmax(A &a, B b) { return a < b &... |
aoj_2980_cpp | C: Cyclic String
問題文
文字列 $S = s_0 s_1 \ldots s_{n-1}$ が文字列 $T = t_0 t_1 \ldots t_{m-1}$ に巡回的に含まれるとは、
ある $k$ があって、全ての $i$ $(0 \le i \lt n)$ について
$s_i = t_{(i+k) \bmod m}$ が成立する事を言います。
$N$ 個の文字列 $S_1, \dots, S_N$ が与えられます。
以下の条件を満たす文字列の集合 $\{C_1, \dots, C_k\}$ を考えます（$k$ は任意）:
各$i$ $(1 \leq i \leq N)$について、$S_i$は少なくとも1つの$C_j$に巡回的に含まれる。$(1 \leq j \leq k)$
$|C_1| + |C_2| + \cdots + |C_k|$の最小値を求めてください。
制約
$1 \leq N \leq 100$
$1 \leq |S_i| \leq 1000$
$S_i$ の各文字は
英小文字
または
英大文字
である
任意の$i,j$ $(i \ne j)$について、$S_i$ は $S_j$ の連続する部分文字列ではない
入力
入力は標準入力から以下の形式で与えられます。
$N$
$S_1$
$S_2$
$\vdots$
$S_N$
出力
答えを一行で出力してください。
入出力例
入力例1
3
dea
xxx
abcd
出力例1
6
例えば、文字列の集合 {"abcde", "x"} は問題文の条件を満たし、文字列の長さの合計は $6$ です。
入力例2
1
xy
出力例2
2
入力例3
3
AAaaBB
aaBBAA
AaB
出力例3
9 | [
{
"submission_id": "aoj_2980_10852975",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int rh_mod = 1e9 + 7;\nconst int rh_b1 = 1009, rh_b2 = 10007;\n\nclass rolling_hash {\n\tconst int n;\n\tvector<int> r1, r2, h1, h2;\npublic:\n\trolling_hash(const string& ... |
aoj_2979_cpp | B: Spent Fuel Disposal
問題文
$N$ 個の下水処理施設が $M$ 本のパイプで繋がっており、$i$ 番目のパイプは $u_i$ 番目と $v_i$ 番目の施設を繋いでいます。
パイプは全て、毎秒最大 $1$ リットルの液体を流すことができます、
今、$S$ 番目の施設から $T$ 番目の施設へ工業廃水を、 $U$ 番目の施設から $V$ 番目の施設へ純水を流したいです。$S$ 番目および $U$ 番目の施設は、それぞれ工業廃水および純水を十分な量有しており、パイプで繋がっている別の施設へこれらの液体を好きに送ることができます。
また、各施設では、送られてきた液体をパイプで繋がっている別の処理施設へ流すことができます。
パイプはハイテクなので、$2$ 種類の液体を同時に好きな方向へ流すことができます。
例えば、$i$ 番目のパイプは、$u_i$ から $v_i$ へ工業廃水を、$v_i$ から $u_i$ へ純水を流すことができます。
反対に $v_i$ から $u_i$ へ工業廃水を、$u_i$ から $v_i$ へ純水を流すことも可能です。
もちろん、$2$ 種類の液体を同じ方向へ流すこともできます。
ただし、どの場合においても、$1$ つのパイプに流す液体の総量は毎秒 $1$ リットルを超えることはできません。 $S$ から $T$ へ流す工業廃水の総量と $U$ から $V$ へ流す純水の総量の合計は、最大で毎秒何リットルにできますか。
答えは整数になることが証明できるため、整数で出力してください。
制約
入力は全て整数
$1 \leq N, M \leq 10^5$
$1 \leq S, T, U, V \leq N$
$S \neq T$
$U \neq V$
$1 \leq u_i, v_i \leq N$
$u_i < v_i$ ($i = 1, \ldots, M$)
$i \neq j \rightarrow (u_i, v_i) \neq (u_j, v_j)$
全ての施設はパイプを通じて連結である
入力
入力は標準入力から以下の形式で与えられます。
$N$ $M$ $S$ $T$ $U$ $V$
$u_1$ $v_1$
$\vdots$
$u_M$ $v_M$
出力
答えを1行に出力してください。
入出力例
入力例1
5 6 1 4 2 3
1 2
2 3
3 4
4 5
3 5
1 5
出力例1
2
例えば、$1$ から $5$、$5$ から $4$ へ工業排水を毎秒 $1$ リットル、$2$ から $3$ へ純水を毎秒 $1$ リットル流せば良いです。
入力例2
3 3 1 2 1 3
1 2
1 3
2 3
出力例2
2
$T$ と $V$ が同一の施設であるケースなどに注意してください。 | [
{
"submission_id": "aoj_2979_10860214",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2978_cpp | A: Undo Swapping
問題文
$N$ 行 $N$ 列のマス目の上に $N$ 個の石が置いてあります。
$i$ 番目の石は $R_i$ 行 $C_i$ 列にあります。同じマスに複数の石が置かれていることはありません。
あなたは次の2種類の操作を任意の順で任意の回数行うことができます。
2つの行を選び、それらを交換する
2つの列を選び、それらを交換する。
$N$ 個の石を、マス目の左上から右下にかけての対角線上に並べることが出来るかを判定するプログラムを作成してください。
可能な場合は必要な最小の操作回数を出力してください。不可能な場合は $-1$ を出力してください。
ただし、
対角線上に並ぶ石の順番は関係無い
ことに注意してください。
例えば、1番目の石を1行1列のマスに配置する必要はありません。
制約
入力は全て整数
$1 \leq N \leq 10^5$
$1 \leq R_i, C_i \leq N$ $(1 \leq i \leq N)$
$R_i \ne R_j$ または $C_i \ne C_j$ $(i \ne j)$
入力
入力は標準入力から以下の形式で与えられます。
$N$
$R_1$ $C_1$
$R_2$ $C_2$
$\vdots$
$R_N$ $C_N$
出力
問題文中の条件を満たせる場合は、必要な最小の操作回数を一行に出力してください。
不可能である場合、$-1$ を一行に出力してください。
入出力例
入力例1
3
2 1
3 2
1 3
出力例1
2
初めに列1と列3を入れ替え、次に行2と行3を入れ替えることで達成できます。
1回の操作で条件を満たすことは出来ないため、答えは2となります。
入力例2
3
1 1
1 2
3 3
出力例2
-1
入力例3
3
1 1
2 2
3 3
出力例3
0
入力例4
5
4 1
3 5
5 4
1 2
2 3
出力例4
4 | [
{
"submission_id": "aoj_2978_11015773",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_2972_cpp | Problem Statement
In A.D. 2101, war was beginning. The enemy has taken over all of our bases. To recapture the bases, we decided to set up a headquarters. We need to define the location of the headquarters so that all bases are not so far away from the headquarters. Therefore, we decided to choose the location to minimize the sum of the distances from the headquarters to the furthest $K$ bases. The bases are on the 2-D plane, and we can set up the headquarters in any place on this plane even if it is not on a grid point.
Your task is to determine the optimal headquarters location from the given base positions.
Input
The input consists of a single test case in the format below.
$N$ $K$
$x_{1}$ $y_{1}$
$\vdots$
$x_{N}$ $y_{N}$
The first line contains two integers $N$ and $K$. The integer $N$ is the number of the bases ($1 \le N \le 200$). The integer $K$ gives how many bases are considered for calculation ($1 \le K \le N$). Each of the following $N$ lines gives the x and y coordinates of each base. All of the absolute values of given coordinates are less than or equal to $1000$, i.e., $-1000 \le x_{i}, y_{i} \le 1000$ is satisfied.
Output
Output the minimum sum of the distances from the headquarters to the furthest $K$ bases. The output can contain an absolute or a relative error no more than $10^{-3}$.
Examples
Input
Output
3 1
0 1
1 0
1 1
0.70711
6 3
1 1
2 1
3 2
5 3
8 5
13 8
17.50426
9 3
573 -50
-256 158
-751 14
314 207
293 567
59 -340
-243 -22
-268 432
-91 -192
1841.20904 | [
{
"submission_id": "aoj_2972_10851198",
"code_snippet": "#include <bits/stdc++.h>\n \n#define all(A) begin(A), end(A)\n#define rall(A) rbegin(A), rend(A)\n#define sz(A) int(A.size())\n#define pb push_back\n#define mp make_pair\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int... |
aoj_2975_cpp | Problem Statement
Your friend, Tatsumi, is a producer of Immortal Culture Production in Chiba (ICPC). His company is planning to form a zombie rock band named Gray Faces and cheer Chiba Prefecture up.
But, unfortunately, there is only one zombie in ICPC. So, Tatsumi decided to release the zombie on a platform of Soga station to produce a sufficient number of zombies. As you may know, a zombie changes a human into a new zombie by passing by the human. In other words, a human becomes a zombie when the human and a zombie are at the same point. Note that a zombie who used to be a human changes a human into a zombie too.
The platform of Soga station is represented by an infinitely long line, and Tatsumi will release a zombie at a point with coordinate $x_Z$. After the release, the zombie will start walking in the positive direction at $v_Z$ per second. If $v_Z$ is negative, the zombie will walk in the negative direction at $|v_Z|$ per second.
There are $N$ humans on the platform. When Tatsumi releases the zombie, the $i$-th human will be at a point with coordinate $x_i$ and will start walking in the positive direction at $v_i$ per second. If $v_i$ is negative, the human will walk in the negative direction at $|v_i|$ per second as well as the zombie.
For each human on the platform, Tatsumi wants to know when the human becomes a zombie. Please help him by writing a program that calculates a time when each human on the platform becomes a zombie.
Input
The input consists of a single test case in the following format.
$N$
$x_Z$ $v_Z$
$x_1$ $v_1$
$\vdots$
$x_N$ $v_N$
The first line consists of an integer $N \, (1 \le N \le 2 \times 10^5)$ which is the number of humans on a platform of Soga station. The second line consists of two integers $x_Z \, (-10^9 \le x_Z \le 10^9)$ and $v_Z \, (-10^9 \le v_Z \le 10^9)$ separated by a space, where $x_Z$ is an initial position of a zombie Tatsumi will release and $v_Z$ is the velocity of the zombie. The $i$-th line in the following $N$ lines contains two integers $x_i \, (-10^9 \le x_i \le 10^9)$ and $v_i \, (-10^9 \le v_i \le 10^9)$ separated by a space, where the $x_i$ is an initial position of the $i$-th human and $v_i$ is the velocity of the human. There is no human that shares their initial position with the zombie. In addition, initial positions of the humans are different from each other.
Output
The output consists of $N$ lines. In the $i$-th line, print how many seconds it will take for the $i$-th human to become a zombie. If the $i$-th human will never become a zombie, print $-1$ instead. The answer will be considered as correct if the values output have an absolute or relative error less than $10^{-9}$.
Examples
Input
Output
6
3 1
-5 0
5 0
-4 -3
0 -2
6 -3
2 -1
3.66666666666667
2.00000000000000
-1
6.00000000000000
0.75000000000000
2.00000000000000
5
31415 -926
5358 979
323846 26
-433832 7950
288 -4
-1971 -69
13.67821522309711
95.61812216052499
52.41629112212708
33.76030368763558
38.95682613768962 | [
{
"submission_id": "aoj_2975_10881614",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2981_cpp | D: Nose And Lung
問題文
あなたは謎の敵対的なエイリアンについて研究しています。
エイリアンには鼻の穴が $N$ 個あり、肺が $1$ 個以上あります。
しかし、肺がいくつあるか、および、どの鼻の穴とどの肺が繋がっているかが分かっていません。
あなたはエイリアンに関して、以下の仮説を立てました:
それぞれの肺は $1$ 個以上の鼻の穴につながっている
それぞれ鼻の穴は $0$ 個以上の肺につながっている
全ての肺に対して酸素が供給されないと死んでしまう。すなわち、ある肺につながっている全ての鼻の穴を塞がれると、エイリアンは死ぬ
政府はあなたの仮説を検証するために、肺と鼻の穴の接続関係がわかっていないエイリアンを $1$ 匹捕獲し、$2^N$ 匹に複製しました。これらのエイリアンで以下のような実験を行いました:
$i$ 番目 $(i=0, \ldots, 2^N-1)$ のエイリアンに対しては、 $i$ を二進表記した際の $k$ 桁目が $1$ であるような $k$ 番目の鼻の穴を全て塞ぐ ($k = 0, \ldots, N-1$)。
その結果、エイリアンが生きたままか死んだかを記録する。
あなたはこれらの $2^N$ 個の実験の結果を全て与えられました。
実験の結果が仮説に矛盾していないか判定し、矛盾していない場合には
考えられる肺の最小個数を答えてください。
制約
全ての入力は整数である
$2 \leq N \leq 20$
$0 \leq a_i \leq 1$
$a_0 = 0$
$a_{2^N-1} = 1$
入力
入力は標準入力から以下の形式で与えられます。
ただし、$a_i=1$のとき、$i$番目のエイリアンは死亡し、$a_i=0$のとき、$i$番目のエイリアンは生きていることを表します。
$N$
$a_0$
$:$
$a_{2^N-1}$
出力
実験の結果が仮説に矛盾している場合には $-1$、そうでない場合はエイリアンが持つと考えられる肺の最小個数を答えてください。
入出力例
入力例1
2
0
1
0
1
出力例1
1
考えられる肺のつなげ方としては{{1},{1,2}}や{{1}}があり、最小の個数は1個です。
入力例2
3
0
1
1
1
1
0
0
1
出力例2
-1
2番目の鼻の穴だけを塞いでも3番目の鼻の穴だけを塞いでも死ぬが、両方の穴を塞いだエイリアンは生きているため、仮説に矛盾しています。 | [
{
"submission_id": "aoj_2981_10879834",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_2977_cpp | Problem Statement
JAG land is a country, which is represented as an $M \times M$ grid. Its top-left cell is $(1, 1)$ and its bottom-right cell is $(M, M)$.
Suddenly, a bomber invaded JAG land and dropped bombs to the country. Its bombing pattern is always fixed and represented by an $N \times N$ grid. Each symbol in the bombing pattern is either
X
or
.
. The meaning of each symbol is as follows.
X
: Bomb
.
: Empty
Here, suppose that a bomber is in $(br, bc)$ in the land and drops a bomb. The cell $(br + i - 1, bc + j - 1)$ will be damaged if the symbol in the $i$-th row and the $j$-th column of the bombing pattern is
X
($1 \le i, j \le N$).
Initially, the bomber reached $(1, 1)$ in JAG land. The bomber repeated to move to either of $4$-directions and then dropped a bomb just $L$ times. During this attack, the values of the coordinates of the bomber were between $1$ and $M - N + 1$, inclusive, while it dropped bombs. Finally, the bomber left the country.
The moving pattern of the bomber is described as $L$ characters. The $i$-th character corresponds to the $i$-th move and the meaning of each character is as follows.
U
: Up
D
: Down
L
: Left
R
: Right
Your task is to write a program to analyze the damage situation in JAG land. To investigate damage overview in the land, calculate the number of cells which were damaged by the bomber at least $K$ times.
Input
The input consists of a single test case in the format below.
$N$ $M$ $K$ $L$
$B_{1}$
$\vdots$
$B_{N}$
$S$
The first line contains four integers $N$, $M$, $K$ and $L$($1 \le N < M \le 500$, $1 \le K \le L \le 2 \times 10^{5}$).
The following $N$ lines represent the bombing pattern.
$B_i$ is a string of length $N$. Each character of $B_i$ is either
X
or
.
. The last line denotes the moving pattern.
$S$ is a string of length $L$, which consists of either
U
,
D
,
L
or
R
.
It's guaranteed that the values of the coordinates of the bomber are between $1$ and $M - N + 1$, inclusive, while it drops bombs in the country.
Output
Print the number of cells which were damaged by the bomber at least $K$ times.
Examples
Input
Output
2 3 2 4
XX
X.
RDLU
3
7 8 3 5
.XXX.X.
X..X.X.
...XX.X
XX.XXXX
..XXXX.
X.X....
..XXXXX
DRULD
26 | [
{
"submission_id": "aoj_2977_10872076",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for (ll i=0; i<ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate<class A, class B>\nbool chmax(A &a, B b) { return a < b &... |
aoj_2974_cpp | Problem Statement
Have you experienced $10$-by-$10$ grid calculation? It's a mathematical exercise common in Japan. In this problem, we consider the generalization of the exercise, $N$-by-$M$ grid calculation.
In this exercise, you are given an $N$-by-$M$ grid (i.e. a grid with $N$ rows and $M$ columns) with an additional column and row at the top and the left of the grid, respectively. Each cell of the additional column and row has a positive integer. Let's denote the sequence of integers on the column and row by $a$ and $b$, and the $i$-th integer from the top in the column is $a_i$ and the $j$-th integer from the left in the row is $b_j$, respectively.
Initially, each cell in the grid (other than the additional column and row) is blank. Let $(i, j)$ be the cell at the $i$-th from the top and the $j$-th from the left. The exercise expects you to fill all the cells so that the cell $(i, j)$ has $a_i \times b_j$. You have to start at the top-left cell. You repeat to calculate the multiplication $a_i \times b_j$ for a current cell $(i, j)$, and then move from left to right until you reach the rightmost cell, then move to the leftmost cell of the next row below.
At the end of the exercise, you will write a lot, really a lot of digits on the cells. Your teacher, who gave this exercise to you, looks like bothering to check entire cells on the grid to confirm that you have done this exercise. So the teacher thinks it is OK if you can answer the $d$-th
digit
(not
integer
, see an example below), you have written for randomly chosen $x$. Let's see an example.
For this example, you calculate values on cells, which are $8$, $56$, $24$, $1$, $7$, $3$ in order. Thus, you would write digits 8, 5, 6, 2, 4, 1, 7, 3. So the answer to a question $4$ is $2$.
You noticed that you can answer such questions even if you haven't completed the given exercise. Given a column $a$, a row $b$, and $Q$ integers $d_1, d_2, \dots, d_Q$, your task is to answer the $d_k$-th digit you would write if you had completed this exercise on the given grid for each $k$. Note that your teacher is not so kind (unfortunately), so may ask you numbers greater than you would write. For such questions, you should answer 'x' instead of a digit.
Input
The input consists of a single test case formatted as follows.
$N$ $M$
$a_1$ $\ldots$ $a_N$
$b_1$ $\ldots$ $b_M$
$Q$
$d_1$ $\ldots$ $d_Q$
The first line contains two integers $N$ ($1 \le N \le 10^5$) and $M$ ($1 \le M \le 10^5$), which are the number of rows and columns of the grid, respectively.
The second line represents a sequence $a$ of $N$ integers, the $i$-th of which is the integer at the $i$-th from the top of the additional column on the left. It holds $1 \le a_i \le 10^9$ for $1 \le i \le N$.
The third line represents a sequence $b$ of $M$ integers, the $j$-th of which is the integer at the $j$-th from the left of the additional row on the top. It holds $1 \le b_j \le 10^9$ for $1 \le j \le M$.
The fourth line contains an integer $Q$ ($1
...(truncated) | [
{
"submission_id": "aoj_2974_10848277",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\n\ntemplate <typename T>\nclass fenwick_tree {\npublic:\n fenwick_tree(int n_) : n(n_), dat(n_) {}\n\n void add(int i, T val) {\n for(; i < n... |
aoj_2982_cpp | E: Expensive Function
問題文
数列$a$と非負整数上の関数$f(x)$が以下のように定義されています。
$a_1 = 0$
$a_i = (a_{i-1} \times p + q) \bmod M (i \geq2)$
$f(x) = x \mbox{ XOR } a_1 \mbox{ XOR } a_2 \mbox{ XOR } ... \mbox{ XOR } a_{10^8}$
松崎くんが計算すると、$f(s) = t$ でした。
非負整数 $y$ が与えられるので、$f(y)$ を求めてください。
$n$ 個の非負整数 $x_1, x_2, \ldots, x_n$ の排他的論理和 $x_1 \mbox{ XOR } x_2 \mbox{ XOR } \ldots \mbox{ XOR } x_n$ は以下のように定義されます:
$x_1 \mbox{ XOR } x_2 \mbox{ XOR } \ldots \mbox{ XOR } x_n$ を二進表記した際の $2^k ( k \geq 0 )$ の位の数は $x_1, x_2, \ldots, x_n$ のうち、二進表記した際の $2^k ( k \geq 0 )$ の位の数が $1$ となるものの個数が奇数ならば $1$ 、そうでなければ $0$ となる。
制約
$0 \leq p, q, s, t, y \leq 10^9$
$1 \leq M \leq 10^9$
入力は全て整数
入力
入力は以下の形式で標準入力から与えられます。
$s$ $t$
$p$ $q$ $M$
$y$
出力
$f(y)$ を出力してください。
入出力例
入力例1
0 15656
3 7 13333
0
出力例1
15656
入力例2
0 0
0 0 3
0
出力例2
0
入力例3
1000000000 1000000000
1000000000 1000000000 1000000000
1000000000
出力例3
1000000000 | [
{
"submission_id": "aoj_2982_9346649",
"code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int s, t;\n std::cin >> s >> t;\n long long p, q, M;\n std::cin >> p >> q >> M;\n int all{}, a{};\n for (int i{2} ; i <= 100000000 ; i++)... |
aoj_2984_cpp | G: Human Seperation
問題文
単位円の上に人が $10^6$ 人、等間隔に立っています。
$t = \frac{2\pi}{10^6}$ として、$i$ 番目の人は 座標 $(\cos{(it)}, \sin{(it)})$ に立っています。
これら $10^6$ 人の中で、非常に仲が悪いペアが $N$ 組あります。
具体的には、$i = 1, \ldots, N$ について、人 $a_i$ と人 $b_i$ は仲が悪いです。
単位円の管理人である松崎くんは、壁を建設することによって仲の悪いペアを全て分断することにしました。
建設する壁は厚さがなく、とてつもなく長いため、直線と同一視することができます。また、壁同士は交わっても構いません。
ただし、人が立っている場所に壁を建設することは出来ません。
壁を建設するにはコストがかかるので、なるべく少ない数の壁で全てのペアを分断したいです。
目的を達成するためには、いくつの壁を建設する必要があるか求めてください。
定式的に問題を言い換えると以下のようになります:
2次元平面上に単位円があり、円周上の2点からなるペアが $N$ 組与えられます。
あなたは平面上に任意に直線を置くことができます。
ただし、どの与えられた点も直線上に存在してはいけません。
全てのペアが、いずれかの直線によって分離されるには、直線を最小で何本置く必要があるか求めてください。
「2点が直線によって分離されている」とは、2点をどのような曲線で結んでも、曲線が直線と交わる状態を指します。
制約
入力は全て整数
$1 \leq N \leq 2 \times 10^5$
$0 \leq a_i < b_i < 10^6$
入力
入力は以下の形式で標準入力から与えられます。
$N$
$a_1$ $b_1$
$:$
$a_N$ $b_N$
出力
答えを1行に出力してください。
入出力例
入力例1
1
0 500000
出力例1
1
円周上の点 $(1, 0)$ と点 $(-1, 0)$ がペアとして与えられます。
ペアは1組しかないので、明らかに1本の直線によって条件を満たすことができます。
入力例2
2
0 333333
333333 666666
出力例2
1
入力例3
5
0 6
1 2
1 8
3 5
4 10
出力例3
2 | [
{
"submission_id": "aoj_2984_10863089",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2985_cpp | H: Permutation Score
問題文
松崎くんは順列が大好きです。今日は順列によって定まる「サイクル森」について考えることにしました。
$1$ から $k$ までの順列 $p = (p_1, \ldots, p_k)$ に対し「$p$ によって定まるサイクル森」とは、以下の2条件を満たすグラフ $G(p)$ を指します:
$G(p)$ は $k$ 頂点からなり、それぞれの頂点には $1$ から $k$ の番号が付けられている。
$i=1, \ldots, k$ について、頂点 $i$ と頂点 $p_i$ の間に辺が張られている（自己ループおよび多重辺を許し、必ず $k$ 本の辺を張る）。逆に、$G(p)$にはそれら $k$ 本以外の辺は存在しない。
順列 $p$ のスコア $f(p)$ を、「$G(p)$ の連結成分の大きさの総積」として定義します。例えば $p = (2, 1, 4, 3)$ ならば $f(p) = 4$、$p = (2, 3, 1, 4)$ ならば $f(p) = 3$です。
正整数 $N$ が与えられます。長さ $N$ の順列は $N!$ 通り考えられますが、これら全ての順列のスコアの分散はいくつになるか求めてください。
全ての順列のスコアの分散とは以下のように定義されます:
まず、$P$ を $N!$ 個の順列全てからなる集合とします。
スコアの平均を$a = \frac{1}{N!} \sum_{p \in P} f(p)$ とおきます。
この時、全ての順列のスコアの分散は $\frac{1}{N!} \sum_{p \in P} (f(p) - a)^2$ として定義されます。
入力の制約下において、求める値は以下の条件を満たす有理数 $\frac{q}{p}$ として表せることが証明できます:
$p$ と $q$ は互いに素な非負整数である。
$p$ は $10^9+7$ の倍数にならず、$p \cdot r \equiv q (\bmod 10^9+7)$ なる整数 $r$が存在する。
分散の値の代わりに $r \bmod 10^9+7$を出力してください。
制約
入力は全て整数
$1 \leq N \leq 10^5$
入力
入力は以下の形式で標準入力から与えられます。
$N$
出力
問題文中で指定された値 $r \bmod 10^9+7$ を1行に出力してください。
入出力例
入力例1
1
出力例1
0
長さ1の順列は1つのみであり、分散は0になります。
入力例2
3
出力例2
472222226
分散の値は $\frac{17}{36}$ですが、問題文中の指示に従って $17 \times 27777778 \bmod 10^9+7 = 472222226$ を出力してください。
入力例3
10
出力例3
309669455 | [
{
"submission_id": "aoj_2985_10803389",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\ntemplate<class T>\nusing V = vector<T>;\ntemplate<class T>\nusing VV = V<V<T>>;\ntemplate<class A, class B>\n... |
aoj_2983_cpp | F: Clique Drawing
問題文
$M$ 回操作を行って $N$ 頂点のグラフを作ります。
初め、$N$ 頂点のどの頂点間にも辺は存在しません。
$i$ 番目の操作では、頂点集合 $\{ v_{i, 1}, v_{i, 2}, ... , v_{i, K_i} \}$ の全ての $2$ 頂点間に辺を張ります。ただし、以前の操作によって既に辺が貼られている頂点間には張りません。
また、どの頂点も $M$ 回の操作の内高々 $2$ 回の操作にしか現れません。
これらの操作によって出来たグラフ上の、最大独立集合の大きさを求めてください。
無向グラフ $G = (V, E)$ の独立集合 $U$ とは、$U \subseteq V$ なる頂点の部分集合であって、全ての $u, v \in U$ について、$(u, v) \notin E$ を満たすものを指します。
最大独立集合とは、このような独立集合の内、最も大きいものを指します。
制約
入力は全て整数
$1 \leq N \leq 10^5$
$1 \leq M \leq 300$
$2 \leq K_i \leq N$ ($1 \leq i \leq M$)
$1 \leq v_{i, j} \leq N$ ($1 \leq i \leq M, 1 \leq j \leq K_i$)
$\{ v_{i, 1}, v_{i, 2}, ... , v_{i, K_i} \}$ の中に重複した値は存在しない ($1 \leq i \leq M$)
全ての頂点は最大でも2回の操作にしか含まれない
入力
入力は以下の形式で標準入力から与えられます。
$N$ $M$
$K_1$ $v_{1, 1}$ $\ldots$ $v_{1, K_1}$
$\vdots$
$K_M$ $v_{M, 1}$ $\ldots$ $v_{M, K_M}$
出力
答えを一行で出力してください。
入出力例
入力例1
2 1
2 1 2
出力例1
1
1回の操作の後、2頂点からなる道が出来ます。
したがって、最大独立集合の大きさは1です。
入力例2
4 1
3 1 2 3
出力例2
2
入力例3
6 3
3 2 3 5
3 3 4 6
3 1 2 4
出力例3
3 | [
{
"submission_id": "aoj_2983_10205720",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v... |
aoj_2986_cpp | I: Palindrome Compliment
問題文
小池くんはチームメイトをよく褒めます。
彼はチームメイトである松崎くんを文字列 $S$ で褒めます。その形式は以下の条件を満たします。
$Hoge, Zaki, O$ は小文字アルファベットのみからなる文字列
$S = Hoge + Zaki + Hoge + O$ ($+$ は文字列の結合を表す)
$S$ は回文
小池くんは$Hoge$の長さを$N$としたときに、松崎くんの褒め方が何通りあるのか気になりました。
3人目のチームメンバーにしてred coderであるあなたは小池くんの代わりに答えを計算することになりました。
文字列 $Zaki, O$ と 整数 $N$ が与えられるので、ありえる組み合わせの数を求めてください．
なお、答えは非常に大きくなる可能性があるので、$10^9 + 7$ で割った 余りを出力してください。
制約
$Zaki$ と $O$ は小文字アルファベットからなる文字列
$1 \leq |Zaki| \leq 10^5$
$1 \leq |O| \leq 10^5$
$1 \leq N \leq 10^9$
入力
入力は以下の形式で標準入力から与えられます。
$Zaki$
$O$
$N$
出力
答えを1行に出力してください。
入出力例
入力例1
zaki
o
4
出力例1
0
入力例2
aab
aa
3
出力例2
26
入力例3
aaa
aaaa
3
出力例3
1 | [
{
"submission_id": "aoj_2986_10853339",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nconstexpr int mod = 1e9 + 7;\n\nll modpow(ll x, ll n) {\n ll res = 1;\n while(n > 0) {\n if(n & 1) res = res * x % mod;\n x = x * x % mod;\n n >>= 1;... |
aoj_2987_cpp | J: 左崎・右男
問題文
左崎さんと右男さんは、長さ $N$ の数列 $a_1, a_2, \dots ,a_n$ を使ったゲームで遊ぶのが好きです。
このゲームでは左崎さんと右男さんで交互に以下の操作を行います。
左崎さんの手番では $1 \leq k \leq n$ を指定し、$a_1, a_2, \dots ,a_k$ の値をそれぞれ $1$ ずつ減らす。
右男さんの手番では $1 \leq k \leq n$ を指定し、$a_k, a_{k+1}, \dots ,a_n$ の値をそれぞれ $1$ ずつ減らす。
手番終了時に数列の中に負の数が存在していた場合、その操作をした人は負けます。負けなかった方は勝ちます。最初に操作をするのは左崎さんです。
左崎さんはこのゲームをプレイするために、$0, 1, \dots, S$ からなる長さ $N$ の数列を全種類（$(S+1)^N$ 通り）買ってきました。左崎さんと右男さんがこれらの数列を使って $1$ 回ずつゲームをしました。左崎さんが勝った回数を $998244353$ で割ったあまりを求めてください。ただし、両者ともそれぞれが勝つために最適な操作をしたとします。
制約
入力は全て整数
$2 \leq N \leq 1000$
$1 \leq S \leq 10^9$
入力
入力は以下の形式で標準入力から与えられます。
$N$ $S$
出力
全ての数列を使って $1$ 回ずつゲームをしたときに、左崎さんが勝った回数を $998244353$ で割ったあまりを出力してください。
入出力例
入力例1
2 1
出力例1
2
左崎さんが買ってきた数列は (0, 0), (0, 1), (1, 0), (1, 1) の $4$ つです。
(0, 0), (0, 1) を使ったゲームでは、左崎さんは最初の手番でどの $k$ を選んでも負けます。
(1, 0) を使ったゲームでは、左崎さんは $k = 1$ を選べば、数列が (0, 0) となり、勝てます。
(1, 1) を使ったゲームでは、左崎さんは $k = 2$ を選べば、数列が (0, 0) となり、勝てます。
入力例2
3 2
出力例2
12
左崎さんが勝つ数列は以下の $12$ 個です。
(1,0,0)
(1,1,0)
(1,1,1)
(1,2,0)
(1,2,1)
(2,0,0)
(2,0,1)
(2,1,0)
(2,1,1)
(2,1,2)
(2,2,0)
(2,2,1)
入力例3
1000 1000000000
出力例3
972070366 | [
{
"submission_id": "aoj_2987_10851210",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<int MOD>\nstruct mod_int {\n\tstatic const int Mod = MOD;\n\tunsigned x;\n\tmod_int() : x(0) { }\n\tmod_int(int sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }\n\tmod_int(l... |
aoj_2990_cpp | C: Shuttle Run
Story
University H has a unique physical fitness test program, aiming to grow the mindset of students.
Among the items in the program, shuttle run is well-known as especially eccentric one. Surprisingly, there are yokans (sweet beans jellies) on a route of the shuttle run. Greedy Homura-chan would like to challenge to eat all the yokans. And lazy Homura-chan wants to make the distance she would run as short as possible. For her, you decided to write a program to compute the minimum distance she would run required to eat all the yokans.
Problem Statement
At the beginning of a shuttle run, Homura-chan is at
0
in a positive direction on a number line. During the shuttle run, Homura-chan repeats the following moves:
Move in a positive direction until reaching
M
.
When reaching
M
, change the direction to negative.
Move in a negative direction until reaching
0
.
When reaching
0
, change the direction to positive.
During the moves, Homura-chan also eats yokans on the number line. There are
N
yokans on the number line. Initially, the
i
-th yokan, whose length is
R_i - L_i
, is at an interval
[L_i, R_i]
on the number line. When Homura-chan reaches
L_i
in a positive direction (or
R_i
in a negative direction), she can start eating the
i
-th yokan from
L_i
to
R_i
(or from
R_i
to
L_i
), and then the
i
-th yokan disappears. Unfortunately, Homura-chan has only one mouth. So she cannot eat two yokans at the same moment, including even when she starts eating and finishes eating (See the example below). Also, note that she cannot stop eating in the middle of yokan and has to continue eating until she reaches the other end of the yokan she starts eating; it's her belief.
Calculate the minimum distance Homura-chan runs to finish eating all the yokans. The shuttle run never ends until Homura-chan eats all the yokans.
Input
N
M
L_1
R_1
:
L_N
R_N
The first line contains two integers
N
and
M
. The following
N
lines represent the information of yokan, where the
i
-th of them contains two integers
L_i
and
R_i
corresponding to the interval
[L_i, R_i]
the
i
-th yokan is.
Constraints
1 \leq N \leq 2 \times 10^5
3 \leq M \leq 10^9
0 < L_i < R_i < M
Inputs consist only of integers.
Output
Output the minimum distance Homura-chan runs to eat all the given yokan in a line.
Sample Input 1
1 3
1 2
Output for Sample Input 1
2
Sample Input 2
2 5
1 2
2 4
Output for Sample Input 2
8
Note that when Homura-chan is at the coordinate
2
, she cannot eat the first and second yokan at the same time. | [
{
"submission_id": "aoj_2990_11013744",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nbool chmin(auto &a, auto b) { return a > b ? a = b, true : false; }\nbool chmax(auto &a, auto b) { return a < b ? a = b, true : false; }\n\ntemplate <typename Monoid>\nstruct s... |
aoj_2988_cpp | A: Union Ball
Problem Statement
There are
N
balls in a box. The
i
-th ball is labeled with a positive integer
A_i
.
You can interact with balls in the box by taking actions under the following rules:
If integers on balls in the box are all odd or all even, you cannot take actions anymore.
Otherwise, you select arbitrary two balls in the box and remove them from the box. Then, you generate a new ball labeled with the sum of the integers on the two balls and put it into the box.
For given balls, what is the maximum number of actions you can take under the above rules?
Input
N
A_1
A_2
...
A_N
The first line gives an integer
N
representing the initial number of balls in a box.
The second line contains
N
integers, the
i
-th of which is the integer on the
i
-th ball.
Constraints
1 \leq N \leq 2 \times 10^5
1 \leq A_i \leq 10^9
Inputs consist only of integers.
Output
Output the maximum number of actions you can take in one line.
Sample Input 1
3
4 5 6
Output for Sample Input 1
2
First, you select and remove balls labeled with
4
and
5
, respectively, and add a ball labeled with
9
.
Next, you select and remove balls labeled with
6
and
9
, respectively, and add a ball labeled with
15
.
Now, the balls in the box only have odd numbers. So you cannot take any actions anymore. The number of actions you took is two, and there is no way to achieve three actions or more. Thus the maximum is two and the series of the above actions is one of the optimal ways.
Sample Input 2
4
4 2 4 2
Output for Sample Input 2
0
You cannot take any actions in this case. | [
{
"submission_id": "aoj_2988_11015820",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_2991_cpp | D: XORANDORBAN
Problem Statement
You are given a positive integer
N
. Your task is to determine a set
S
of
2^N
integers satisfying the following conditions:
All the integers in
S
are at least
0
and less than
2^{N+1}
.
All the integers in
S
are distinct.
You are also given three integers
X
,
A
, and
O
, where
0 \leq X, A, O < 2^{N+1}
. Then, any two integers (
a
,
b
) in
S
must satisfy
a
{\it xor}
b \neq X
,
a
{\it and}
b \neq A
,
a
{\it or}
b \neq O
, where
{\it xor}
,
{\it and}
,
{\it or}
are
bitwise xor
,
bitwise and
,
bitwise or
, respectively. Note that
a
and
b
are not necessarily different.
Input
N
X
A
O
Constraints
1 \leq N \leq 13
0 \leq X, A, O < 2^{N+1}
Inputs consist only of integers.
Output
If there is no set satisfying the conditions mentioned in the problem statement, output
No
in a line. Otherwise, output
Yes
in the first line, and then output
2^N
integers in such a set in the second line. If there are multiple sets satisfying the conditions, you can output any of them.
Sample Input 1
2 6 1 5
Output for Sample Input 1
Yes
0 3 4 7
Sample Input 2
3 0 5 1
Output for Sample Input 2
No
Sample Input 3
3 4 2 5
Output for Sample Input 3
Yes
1 0 6 15 8 9 14 7 | [
{
"submission_id": "aoj_2991_10851244",
"code_snippet": "/*program by mangoyang*/\n#pragma GCC optimize(\"Ofast\", \"inline\")\n#include<bits/stdc++.h>\n#define inf (0x7f7f7f7f)\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n#define Min(a, b) ((a) < (b) ? (a) : (b))\ntypedef long long ll;\nusing namespace std;... |
aoj_2994_cpp | G: Toss Cut Tree
Problem Statement
You are given two trees
T, U
. Each tree has
N
vertices that are numbered
1
through
N
. The
i
-th edge (
1 \leq i \leq N-1
) of tree
T
connects vertices
a_i
and
b_i
. The
i
-th edge (
1 \leq i \leq N-1
) of tree
U
connects vertices
c_i
and
d_i
.
The operation described below will be performed
N
times.
On the
i
-th operation, flip a fair coin.
If it lands heads up, remove vertex
i
and all edges directly connecting to it from tree
T
.
If it lands tails up, remove vertex
i
and all edges directly connecting to it from tree
U
.
After
N
operations, each tree will be divided into several connected components. Let
X
and
Y
be the number of connected components originated from tree
T
and
U
, respectively.
Your task is to compute the expected value of
X \times Y
. More specifically, your program must output an integer
R
described below.
First, you can prove
X \times Y
is a rational number. Let
P
and
Q
be coprime integers that satisfies
\frac{P}{Q} = X \times Y
.
R
is the only integer that satisfies
R \times Q
$\equiv$
P
$ \bmod \;$
998244353, 0 \leq R < 998244353
.
Input
N
a_1
b_1
:
a_{N-1}
b_{N-1}
c_1
d_1
:
c_{N-1}
d_{N-1}
Constraints
1 \leq N \leq 2 \times 10^5
1 \leq a_i, b_i, c_i, d_i \leq N
The given two graphs are trees.
All values in the input are integers.
Output
Print
R
described above in a single line.
Sample Input 1
3
1 2
2 3
1 2
3 1
Output for Sample Input 1
1
A coin is flipped
3
times. Therefore, there are
2^3 = 8
outcomes in total.
Suppose that the outcome was (tail, head, tail) in this order. Vertex
2
of tree
T
and vertex
1
,
3
of tree
U
are removed along with all edges connecting to them.
T
,
U
are decomposed to
2
,
1
connected components, respectively. Thus, the value of
XY
is
2 \times 1 = 2
in this case.
It is possible to calculate
XY
for the other cases in the same way and the expected value of
XY
is
1
.
Sample Input 2
4
1 2
1 4
2 3
1 4
4 2
2 3
Output for Sample Input 2
374341634
The expected number of
XY
is
\frac{13}{8}
. | [
{
"submission_id": "aoj_2994_10863188",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2995_cpp | H: Colorful Tree
Story
Yamiuchi
(assassination) is a traditional event that is held annually in JAG summer camp. Every team displays a decorated tree in the dark and all teams' trees are compared from the point of view of their colorfulness. In this competition, it is allowed to cut the other teams’ tree to reduce its colorfulness. Despite a team would get a penalty if it were discovered that the team cuts the tree of another team, many teams do this obstruction.
You decided to compete in
Yamiuchi
and write a program that maximizes the colorfulness of your team’s tree. The program has to calculate maximum scores for all subtrees in case the other teams cut your tree.
Problem Statement
You are given a rooted tree
G
with
N
vertices indexed with
1
through
N
. The root is vertex
1
. There are
K
kinds of colors indexed with
1
through
K
. You can paint vertex
i
with either color
c_i
or
d_i
. Note that
c_i = d_i
may hold, and if so you have to paint vertex
i
with
c_i
(
=d_i
).
Let the colorfulness of tree
T
be the number of different colors in
T
. Your task is to write a program that calculates maximum colorfulness for all rooted subtrees. Note that coloring for each rooted subtree is done independently, so previous coloring does not affect to other coloring.
Input
N
K
u_1
v_1
:
u_{N-1}
v_{N-1}
c_1
d_1
:
c_N
d_N
The first line contains two integers
N
and
K
in this order.
The following
N-1
lines provide information about the edges of
G
. The
i
-th line of them contains two integers
u_i
and
v_i
, meaning these two vertices are connected with an edge.
The following
N
lines provide information about color constraints. The
i
-th line of them contains two integers
c_i
and
d_i
explained above.
Constraints
1 \leq N \leq 10^5
1 \leq K \leq 2\times 10^5
1 \leq u_i , v_i \leq N
1 \leq c_i , d_i \leq K
The input graph is a tree.
All inputs are integers.
Output
Output
N
lines.
The
i
-th line of them contains the maximum colorfulness of the rooted subtree of
G
whose root is
i
.
Sample Input 1
2 10
1 2
1 9
8 7
Output for Sample Input 1
2
1
Sample Input 2
3 2
1 2
1 3
1 2
1 1
1 2
Output for Sample Input 2
2
1
1
Note that two color options of a vertex can be the same.
Sample Input 3
5 100000
4 3
3 5
1 3
2 1
3 2
1 3
2 1
4 2
1 4
Output for Sample Input 3
4
1
3
1
1 | [
{
"submission_id": "aoj_2995_10878732",
"code_snippet": "// clang-format off\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for (ll i=0; i<ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate<class A, class B>\nbool chmax(A &a, ... |
aoj_2989_cpp | B: AddMulSubDiv
Problem Statement
You have an array
A
of
N
integers.
A_i
denotes the
i
-th element of
A
.
You have to process one of the following queries
Q
times:
Query 1: The query consists of non-negative integer
x
, and two positive integers
s, t
. For all the elements
greater
than or equal to
x
in
A
, you have to add
s
to the elements, and then multiply them by
t
. That is, an element with
v (v \geq x)
becomes
t(v + s)
after this query.
Query 2: The query consists of non-negative integer
x
, and two positive integers
s, t
. For all the elements
less
than or equal to
x
in
A
, you have to subtract
s
from the elements, and then divide them by
t
. If the result is not an integer, you truncate it towards zero. That is, an element with
v (v \leq x)
becomes $\mathrm{trunc}$
( \frac{v - s}{t} )
after this query, where $\mathrm{trunc}$
( y )
is the integer obtained by truncating
y
towards zero.
"Truncating towards zero" means converting a decimal number to an integer so that if
x = 0.0
then
0
, otherwise an integer whose absolute value is the maximum integer no more than
|x|
and whose sign is same as
x
. For example, truncating
3.5
towards zero is
3
, and truncating
-2.8
towards zero is
-2
.
After applying
Q
queries one by one, how many elements in
A
are no less than
L
and no more than
R
?
Input
N
Q
L
R
A_1
A_2
...
A_N
q_1
x_1
s_1
t_1
:
q_Q
x_Q
s_Q
t_Q
The first line contains four integers
N
,
Q
,
L
, and
R
.
N
is the number of elements in an integer array
A
,
Q
is the number of queries, and
L
and
R
specify the range of integers you want to count within after the queries.
The second line consists of
N
integers, the
i
-th of which is the
i
-th element of
A
.
The following
Q
lines represent information of queries. The
j
-th line of them corresponds to the
j
-th query and consists of four integers
q_j
,
x_j
,
s_j
, and
t_j
. Here,
q_j = 1
stands for the
j
-th query is Query 1, and
q_j = 2
stands for the
j
-th query is Query 2.
x_j
,
s_j
, and
t_j
are parameters used for the
j
-th query.
Constraints
1 \leq N \leq 2 \times 10^5
1 \leq Q \leq 2 \times 10^5
-2^{63} < L \leq R < 2^{63}
0 \leq |A_i| \leq 10^9
q_j \in \{ 1, 2 \}
0 \leq x_j < 2^{63}
1 \leq s_j, t_j \leq 10^9
Inputs consist only of integers.
The absolute value of any element in the array dosen't exceed
2^{63}
at any point during query processing.
Output
Output the number of elements in
A
that are no less than
L
and no more than
R
after processing all given queries in one line.
Sample Input 1
3 3 3 10
1 -2 3
1 2 2 3
2 20 1 3
2 1 20 5
Output for Sample Input 1
1 | [
{
"submission_id": "aoj_2989_11015870",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_2992_cpp | E: Red Black Balloons
Story
Homura-chan's dream comes true. It means ICPC Asia regional contest 20xx will be held in Sapporo! Homura-chan has been working hard for the preparation. And finally, it's the previous day of the contest. Homura-chan started to stock balloons to be delivered to contestants who get accepted. However, she noticed that there were only two colors of balloons: red and black.
Problem Statement
ICPC Asia regional contest in Sapporo plans to provide
N
problems to contestants. Homura-chan is a professional of contest preparation, so she already knows how many contestants would get acceptance for each problem (!!),
a_i
contestants for the
i
-th problem. You can assume the prediction is perfectly accurate. Ideally, Homura-chan would assign a distinct color of a balloon to each problem respectively. But you know, she has only two colors red and black now. Thus, Homura-chan comes up with the idea to differentiate the size of balloons in
K
levels
, that is, each problem has a balloon with a distinct pair of (color, size).
Homura-chan now has
r_i
red balloons with size
i
(
1 \leq i \leq K
) and
b_j
black balloons with size
j
(
1 \leq j \leq K
). Suppose we assign a pair
(c_i, s_i)
of a color
c_i
(red or black) and a size
s_i
to the
i
-th problem, for each
i
. As noted, we have to assign distinct pairs to each problem, more precisely,
(c_i, s_i) \neq (c_j, s_j)
holds for
i \neq j
. Moreover, the number of balloons with
(c_i, s_i)
must be no less than
a_i
. In the case that there are no such assignments, Homura-chan can change the size of balloons by her magic power. Note that Homura-chan doesn't know magic to change the color of balloons, so it's impossible.
Your task is to write a program computing the minimum number of balloons whose size is changed by Homura-chan's magic to realize an assignment satisfying the above-mentioned conditions. If there is no way to achieve such an assignment even if Homura-chan changes the size of balloons infinitely, output
-1
instead.
Input
N
K
a_1 ... a_N
r_1 ... r_K
b_1 ... b_K
Constraints
1 \leq N,K \leq 60
N \leq 2K
1 \leq a_i \leq 50
(1 \leq i \leq N)
1 \leq r_j,b_j \leq 50
(1 \leq j \leq K)
Inputs consist only of integers.
Output
Output the minimum number of balloons whose size is changed to achieve an assignment in a line. If there are no ways to achieve assignments, output
-1
instead.
Sample Input 1
3 2
6 5 4
8 1
7 1
Output for Sample Input 1
3
Homura-chan changes the size of three red balloons from 1 to 2. Then she can assign (black,1) to the problem 1, (red,1) to the problem 2, and (red,2) to the problem 3.
Sample Input 2
2 1
50 50
2
3
Output for Sample Input 2
-1
Sample Input 3
4 3
3 10 28 43
40 18 2
26 7 11
Output for Sample Input 3
5 | [
{
"submission_id": "aoj_2992_10926221",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for(ll i = 0; i < (ll)n; ++i)\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\n#define vl vector<ll>\n#define vvl vector<vl>\n#define vvvl vector<vvl>\n#define inf ... |
aoj_3002_cpp | Problem C: Factorization
Problem
ukuku1333さんはおっちょこちょいなので、
x
の一次式の積を展開したら、元の一次式がわからなくなってしまった。
x
の
n
次多項式が与えられるので、因数分解して元のxの一次式の積の形にせよ。
x
の
n
次多項式は以下のBNFによって与えられる。
<多項式> := <項> | <多項式>+<項> | <多項式>−<項>
<項> := x^<指数> | <係数>x^<指数> | <係数>x | <定数>
<指数> := [2-5]
<係数> := [1-9][0-9]*
<定数> := [1-9][0-9]*
指数及び係数が省略されている場合は1とみなす。
Input
入力は以下の形式で与えられる。
S
x
の
n
次多項式を表す文字列
S
が一行に与えられる。
Constraints
入力は以下の条件を満たす。
2 ≤
n
≤ 5
与えられる式の項の数を
m
とすると、1 ≤
i
<
j
≤
m
なる任意の
i
,
j
の組に対して、
i
番目の項の次数は
j
番目の項の次数より大きいことが保証される
与えられる
x
の
n
次多項式は、
x
の一次式の積の形に因数分解したもので表すことができることが保証される
係数、定数の絶対値はそれぞれ2×10
3
以下である
次数が最大のものの係数は1であり、省略されていることが保証される
展開する前のそれぞれの一次式の元の定数項は0ではない整数であることが保証される
展開する前のそれぞれの一次式の元の定数項は相異なることが保証される
Output
S
を
x
の一次式の積の形に因数分解したものを、定数項の小さいものから順に出力せよ。
出力の最後には改行を入れること。
Sample Input 1
x^2+3x+2
Sample Output 1
(x+1)(x+2)
Sample Input 2
x^2-1
Sample Output 2
(x-1)(x+1)
Sample Input 3
x^5+15x^4+85x^3+225x^2+274x+120
Sample Output 3
(x+1)(x+2)(x+3)(x+4)(x+5)
Sample Input 4
x^3-81x^2-1882x-1800
Sample Output 4
(x-100)(x+1)(x+18) | [
{
"submission_id": "aoj_3002_8463676",
"code_snippet": "#include <bits/stdc++.h>\n\nstruct Poly {\n int n = 0;\n\n std::vector<int> coef;\n\n Poly() {}\n Poly(int n): n(n), coef(n + 1) {}\n Poly(const std::vector<int>& constants) {\n int m = constants.size();\n resize(m);\n ... |
aoj_2996_cpp | I: Add
Problem Statement
Mr. T has had an integer sequence of
N
elements
a_1, a_2, ... , a_N
and an integer
K
. Mr. T has created
N
integer sequences
B_1, B_2, ... , B_N
such that
B_i
has
i
elements.
B_{N,j} = a_j
(
1 \leq j \leq N
)
B_{i,j} = K \times B_{i+1,j} + B_{i+1,j+1}
(
1\leq i \leq N-1, 1 \leq j \leq i
)
Mr. T was so careless that he lost almost all elements of these sequences
a
and
B_i
. Fortunately,
B_{1,1}, B_{2,1}, ... , B_{N,1}
and
K
are not lost. Your task is to write a program that restores the elements of the initial sequence
a
for him. Output the modulo
65537
of each element instead because the absolute value of these elements can be extremely large. More specifically, for all integers
i
(
1 \leq i \leq N
), output
r_i
that satisfies
r_i
$\equiv$
a_i
$ \bmod \;$
65537, 0 \leq r_i < 65537
. Here, we can prove that the original sequence Mr. T had can be uniquely determined under the given constraints.
Input
T
N_1
K_1
C_{1,1}
C_{1,2}
...
C_{1,N}
N_2
K_2
C_{2,1}
C_{2,2}
...
C_{2,N}
:
N_T
K_T
C_{T,1}
C_{T,2}
...
C_{T,N}
The first line contains a single integer
T
that denotes the number of test cases. Each test case consists of 2 lines. The first line of the
i
-th test case contains two integers
N_i
and
K_i
. The second line of the
i
-th test case contains
N_i
integers
C_{i,j}
(
1 \leq j \leq N_i
). These values denote that
N = N_i , K = K_i , B_{j,1} = C_{i,j}
(
1 \leq j \leq N_i
) in the
i
-th test case.
Constraints
1 \leq T \leq 10
1 \leq N \leq 50000
|K| \leq 10^9
|B_{i,1}| \leq 10^9
All input values are integers.
Output
Output
T
lines. For the
i
-th line, output the answer for the
i
-th test case
a_1, a_2, ..., a_N
in this order. Each number must be separated by a single space.
Sample Input 1
2
3 0
1 2 3
3 1
1 2 3
Output for Sample Input 1
3 2 1
3 65536 0 | [
{
"submission_id": "aoj_2996_10798046",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\ntemplate<class T>\nusing V = vector<T>;\ntemplate<class T>\nusing VV = V<V<T>>;\ntemplate<class A, class B>\n... |
aoj_3000_cpp | Problem A: The Mean of Angles
Problem
与えられた2つの角度
θ
1
,
θ
2
のちょうど間の角度を求めよ。ここで、ちょうど間の角度を、下図のように「
θ
1
+
t
=
θ
2
−
t
を満たす
t
のうち絶対値が最も小さいものを
t’
としたときの
θ
1
+
t’
」と定義する。
Input
入力は以下の形式で与えられる。
θ
1
θ
2
Constraints
入力は以下の条件を満たす。
角度は度数法(degree)で表される
0 ≤
θ
1
,
θ
2
< 360
θ
1
,
θ
2
は整数
|
θ
1
−
θ
2
| ≠ 180
解答が[0,0.0001]または[359.999, 360)になるような入力は与えられない
Output
θ
1
,
θ
2
のちょうど間の角度を度数法で[0,360)の範囲で1行に出力せよ。ただし0.0001を超える誤差を含んではならない。
Sample Input 1
10
20
Sample Output 1
15.0
Sample Input 2
20
350
Sample Output 2
5.0 | [
{
"submission_id": "aoj_3000_2557769",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<climits>\n#include<cassert>\n#include<cmath>\n#include<cstdlib>\n#include<complex>\n#include<algorithm>\n#include<vector>\n#include<deque>\n#include<queue>\n#include<map>\n#include<set>\... |
aoj_2993_cpp | F: Invariant Tree
Problem Statement
You have a permutation
p_1, p_2, ... , p_N
of integers from
1
to
N
. You also have vertices numbered
1
through
N
. Find the number of trees while satisfying the following condition. Here, two trees
T
and
T'
are different if and only if there is a pair of vertices where
T
has an edge between them but
T’
does not have an edge between them.
For all integer pairs
i, j
(
1\leq i < j \leq N
), if there is an edge between vertices
i
and
j
, there is an edge between vertices
p_i
and
p_j
as well.
Since this number can be extremely large, output the number modulo
998244353
.
Input
N
p_1
p_2
...
p_N
Constraints
1\leq N \leq 3 \times 10^5
p_1, p_2, ... , p_N
is a permutation of integers
1
through
N
.
Output
Output the number in a single line.
Sample Input 1
4
2 1 4 3
Output for Sample Input 1
4
Let
(u, v)
denote that there is an edge between
u
and
v
. The following
4
ways can make a tree satisfying the condition.
(
1, 2
), (
1, 3
), (
2, 4
)
(
1, 2
), (
1, 4
), (
2, 3
)
(
1, 3
), (
2, 4
), (
3, 4
)
(
1, 4
), (
2, 3
), (
3, 4
)
Sample Input 2
3
1 2 3
Output for Sample Input 2
3
Sample Input 3
3
2 3 1
Output for Sample Input 3
0
Sample Input 4
20
9 2 15 16 5 13 11 18 1 10 7 3 6 14 12 4 20 19 8 17
Output for Sample Input 4
98344960 | [
{
"submission_id": "aoj_2993_11064860",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\n\nnamespace FastIO {\n char gc() {\n static char buf[1 << 20], *p1, *p2;\n if (p1 == p2) p1 = buf, p2 = buf + fread(buf, 1, 1 << 20, stdin);\n return p1 == ... |
aoj_3004_cpp | Problem E: Tangled Cables
Problem
とある会社のネットワーク上には$n$台のコンピュータと、それらをつなぐ$m$本の通信ケーブルがある。コンピュータは$0$から$n - 1$までの識別子で区別され、通信ケーブルもまた$0$から$m - 1$までの識別子をもつ。
現在この会社にある任意の異なる2台のコンピュータは、いくつかの通信ケーブルを介して相互に通信することができるが、通信経路がただ一つに定まるとは限らない。
このネットワークには、通信ケーブルが多すぎて絡まってしまうという問題がある。そこであなたは、任意の通信について通信経路がただ一つになるようにいくつかの通信ケーブルを取り除くことにした。
通信ケーブル$i$はコンピュータ$a_i$と$b_i$を双方向につなぎ、その長さは$c_i$である。また、あなたが通信ケーブル$i$を取り除く際にかかる労力は$d_i$である。
作業を始める前に、あなたは取り除く通信ケーブルの長さの和に対する、作業を終えるまでにかかる労力の和の比を「おっくう感」とし、最小のおっくう感を見積もることにした。
ただし、一つも取り除けない場合のおっくう感は$0$である。
Input
入力は以下の形式で与えられる。
$n$ $m$
$a_1$ $b_1$ $c_1$ $d_1$
$a_2$ $b_2$ $c_2$ $d_2$
...
$a_m$ $b_m$ $c_m$ $d_m$
入力はすべて整数で与えられる。
1行目にはコンピュータの数$n$と通信ケーブルの数$m$が空白区切りで与えられる。
2行目以降の$m$行には、通信ケーブルの情報が空白区切りで与えられる。$i$番目の通信ケーブルの情報は、通信ケーブル$i$の情報を表す。
Constraints
入力は以下の条件を満たす。
$2 \leq n \leq 10^4$
$n-1 \leq m \leq min(\frac{n \times (n - 1)}{2}, 10^4)$
$0 \leq a_i, b_i \leq n - 1 (a_i ≠ b_i)$
$1 \leq c_i \leq 10^6$
$0 \leq d_i \leq 10^6$
Output
おっくう感の最小値を実数で1行に出力する。ただし、$10^{-5}$を超える誤差を含んではならない。
Sample Input 1
4 5
0 2 22 13
0 3 15 25
1 2 3 3
1 3 28 5
2 3 5 22
Sample Output 1
0.36000
通信ケーブル$0$と通信ケーブル$3$を取り除くと、おっくう感は$(\frac{13 + 5}{22 + 28}) = 0.36$となり、これがおっくう感の最小値となる。
Sample Input 2
5 6
0 1 22 33
0 2 43 11
0 3 92 10
1 3 50 12
2 3 88 2
3 4 58 89
Sample Output 2
0.06667
Sample Input 3
2 1
0 1 1 1
Sample Output 3
0 | [
{
"submission_id": "aoj_3004_10852759",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,s,t) for(int i = s ; i < t ; i++)\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nconst int INF = 1e9;\n\ns... |
aoj_3003_cpp | Problem D: Let's Go To School
Problem
がっちょ君は期末試験が近づくとやる気がなくなってしまい、しばしば学校を休むようになる。
期末試験まで残り
N
日である。
がっちょ君の
i
日目のやる気は
X
i
であり、
i
日目に学校に行くために必要なやる気は
Y
i
である。
がっちょ君は
X
i
≥
Y
i
となる日のみ学校に行く。
がっちょ君を心配したハジ君は、がっちょ君を励ますことで、可能な限り学校に行かせようと考えた。
ハジ君は最初、励まし力
P
を持っている。
ハジ君が
i
日目に励まし力
t
(
t
は0以上の任意の実数)を消費してがっちょ君を励ますと、
がっちょ君の
i
日目のやる気は
t
だけ増加して、ハジ君の励まし力は
t
だけ減少する。さらに、
i
+1 ≤
N
のとき、
i
+1日目のがっちょ君のやる気
X
i+1
はmax(0,
X
i+1
−
t
) に変化する。
ハジ君は自分の持っている励まし力を超えて励ますことはできない。
ハジ君が最適な励まし方をしたときの、がっちょ君が学校に行く最大日数を求めよ。
Input
入力は以下の形式で与えられる。
N
P
X
1
Y
1
X
2
Y
2
...
X
N
Y
N
入力はすべて整数で与えられる。
1行目に期末試験までの日数
N
とハジ君が最初に持っている励まし力
P
が空白区切りで与えられる。
2行目から続く
N
行にはがっちょ君の
i
(
i
=1,2,...,
N
)日目のやる気
X
i
と学校に行くために必要なやる気
Y
i
が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 100
0 ≤
P
≤ 10
6
0 ≤
X
i
≤ 10
6
0 ≤
Y
i
≤ 10
6
Output
がっちょ君が学校に行くことができる最大の日数を1行に出力せよ。
Sample Input 1
3 10
1 6
5 10
0 5
Sample Output 1
2
Sample Input 2
5 5
1 1
1 2
1 2
1 3
1 3
Sample Output 2
4 | [
{
"submission_id": "aoj_3003_2589521",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\ntypedef long long int ll;\ntypedef unsigned lo... |
aoj_2997_cpp | J: Horizontal-Vertical Permutation
Problem Statement
You are given a positive integer
N
. Your task is to determine if there exists a square matrix
A
whose dimension is
N
that satisfies the following conditions and provide an example of such matrices if it exists.
A_{i, j}
denotes the element of matrix
A
at the
i
-th row and
j
-th column.
For all
i, j
(1 \leq i, j \leq N)
,
A_{i, j}
is an integer that satisfies
1 \leq A_{i, j} \leq 2N - 1
.
For all
k = 1, 2, ..., N
, a set consists of
2N - 1
elements from the
k
-th row or
k
-th column is
\{1, 2, ..., 2N - 1\}
.
If there are more than one possible matrices, output any of them.
Input
N
Input consists of one line, which contains the integer
N
that is the size of a square matrix to construct.
Constraint
N
is an integer that satisfies
1 \leq N \leq 500
.
Output
Output
No
in a single line if such a square matrix does not exist.
If such a square matrix
A
exists, output
Yes
on the first line and
A
after that. More specifically, follow the following format.
Yes
A_{1, 1}
A_{1, 2}
...
A_{1, N}
A_{2, 1}
A_{2, 2}
...
A_{2, N}
:
A_{N, 1}
A_{N, 2}
...
A_{N, N}
Sample Input 1
4
Output for Sample Input 1
Yes
2 6 3 7
4 5 2 1
1 7 5 6
5 3 4 2
Sample Input 2
3
Output for Sample Input 2
No | [
{
"submission_id": "aoj_2997_10771359",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <cassert>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\nusing ll = long long;\ntemplate<class E> using V = vector<E>;\n\nV<V<int>> solv... |
aoj_3001_cpp | Problem B: GPA JANKEN
Problem
GPAとは「Galaxy Point of Aizu」の略で、0から4までの実数値を取る。
GPAじゃんけんは二人で行うゲームである。各々が「じゃんけん、ぽん（ほい）」の合図で互いにグー、チョキ、パーのどれか好きな手を出した後、GPAが高い人が勝者となり、低い人が敗者となる。同じ場合は引き分けとなる。
N
人のGPAのデータが与えられるので、総当たり戦をした時のそれぞれの勝ち点を出力せよ。
ただし、勝ち点は勝ちの時3、引き分けの時1、負けの時0とする。
総当たり戦とはすべての参加者が自分以外の参加者と丁度一回ずつ対戦する方式である。
Input
入力は以下の形式で与えられる。
N
a
1
a
2
...
a
N
一行目にGPAじゃんけんをする人数
N
が与えられる。
続く
N
行に
i
番目の人のGPAのデータ
a
i
が一行に与えられる。
Constraints
入力は以下の条件を満たす。
2 ≤
N
≤ 10
5
N
は整数
0.000 ≤
a
i
≤ 4.000 ( 1 ≤
i
≤
N
)
a
i
は実数 ( 1 ≤
i
≤
N
)
各GPAは小数点以下3桁まで与えられる
Output
i
行目に
i
番目の人の勝ち点を一行に出力せよ。
( 1 ≤
i
≤
N
)
Sample Input 1
3
1.000
3.000
3.000
Sample Output 1
0
4
4
Sample Input 2
3
1.000
2.000
3.000
Sample Output 2
0
3
6 | [
{
"submission_id": "aoj_3001_10848481",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define FOR(i,s,t) for(int i = s ; i < t ; i++)\nusing LL = long long; using ll = LL;\nusing PII = pair<int, int>; using pii = PII;\nusing PLL = pair<LL, LL>; using pll = PLL;\nconst int INF = 1e9;\ncon... |
aoj_3009_cpp | Problem J: Demon's Plan
BackGround
デーモンズプランでは慾を司る108体の悪魔が日夜プログラミングコンテストでしのぎを削っている。主催であるパトローンは、全ての慾が集う場所”リクス＝マグナ”に悪魔たちを招待しようとしている。
パトローンはまだ招待を送っていない悪魔に招待を送りたいが、悪魔は世界各地におり、自分で行くのは面倒くさいので自身の使い魔達にやらせることにした。
パトローンは気が利くので使い魔同士がより平等に働くようにどの使い魔がどの悪魔を担当するかを割り振ろうとしている。
Problem
N
体の使い魔と
M
体の悪魔がいる。
使い魔
i
と 悪魔
j
の距離は
H
i j
である。
各悪魔に必ず1人の使い魔を向かわせたい。どの使い魔がどの悪魔を訪問するかは以下の条件に従って割り振ることにした。
使い魔1体あたりの訪問する悪魔の数の差の最大を最小化する。
1を満たした上で訪問する悪魔と担当する使い魔の距離の最大を最小化する。
1行目に使い魔1体あたりの訪問する悪魔の数の差の最大を、2行目に悪魔と担当する使い魔の距離の最大を出力せよ。
Input
入力は以下の形式で与えられる。
N
M
H
0 0
H
0 1
…
H
0 M−1
H
1 0
H
1 1
…
H
1 M−1
.
.
H
N−1 0
H
N−1 1
…
H
N−1 M−1
1行目に使い魔の数
N
と悪魔の数
M
が整数で空白区切りで与えられる。
続く
N
行に使い魔と悪魔の距離が整数で与えられる。
H
ij
は使い魔
i
と悪魔
j
の距離を表す。
Constraints
1 ≤
N
≤ 108
1 ≤
M
≤ 108
1 ≤
H
i j
≤ 10
9
( 0 ≤
i
<
N
, 0 ≤
j
<
M
) ( 使い魔
i
から悪魔
j
までの距離 )
Output
問題文の条件に従い、1行目に使い魔1体あたりの訪問する悪魔の数の差の最大を、2行目に悪魔と担当する使い魔の距離の最大を出力せよ。
Sample Input 1
3 3
1 2 3
2 1 2
3 2 1
Sample Output 1
0
1
使い魔
0
- 悪魔
0
使い魔
1
- 悪魔
1
使い魔
2
- 悪魔
2
と割り振ることで訪問する悪魔の数の差が0になり、担当使い魔と悪魔の距離の最大が1になり最適な組み合わせになる。
Sample Input 2
3 5
1 2 3 4 5
5 4 3 2 1
4 3 2 1 5
Sample Output 2
1
2
使い魔
0
- 悪魔
0
使い魔
0
- 悪魔
1
使い魔
1
- 悪魔
4
使い魔
2
- 悪魔
3
使い魔
2
- 悪魔
2
と割り振ることで訪問する悪魔の差が1になり、担当使い魔と悪魔の距離の最大が2になり最適な組み合わせになる。 | [
{
"submission_id": "aoj_3009_3648541",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<utility>\n#include<set>\n#include<map>\n#include<stack... |
aoj_3007_cpp | Problem H: Zombie Hunter
Problem
がっちょ君は人気のゲーム、Zombie Hunterに熱中している。このゲームには、頭、胴、腕、腰、足専用の5種類の防具があり、がっちょ君が操作するプレイヤーキャラクター(PC)は、体の各部に対応する防具をそれぞれ最大1つまで装備することができる。
また、各防具には重さと防御力が設定されており、PCの装備している防具の重さの合計が
A
以上
B
以下であり、かつ防御力の合計も
A
以上
B
以下であるとき、そのPCはスキルを発動することができる。
がっちょ君は
N
個の防具を所持している。装備する防具を適切に選ぶことで、PCがスキルを発動することができるかを調べて欲しい。
Input
入力は以下の形式で与えられる。
N
A
B
t
1
x
1
y
1
t
2
x
2
y
2
...
t
N
x
N
y
N
入力はすべて整数で与えられる。
1行目にがっちょ君が所有している防具の数
N
, スキルの発動条件に用いられる２つの整数
A
と
B
が与えられる。
2行目から続く
N
行に、
N
個の防具の情報が与えられる。
t
i
,
x
i
,
y
i
はそれぞれ
i
番目の防具の種類、重さ、防御力を表す。
防具の種類
t
i
の値はそれぞれ、1のとき頭の防具、2のとき胴の防具、3のとき腕の防具、4のとき腰の防具、5のとき足の防具であることを示す。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 500
1 ≤
A
≤
B
≤ 10
12
1 ≤
t
i
≤ 5
−10
12
≤
x
i
,
y
i
≤ 10
12
Output
スキルを発動することができる場合は”Yes”、できない場合は”No”を1行に出力せよ。
Sample Input 1
7 10 11
1 1 0
1 0 1
2 2 2
3 3 5
4 1 3
5 1 3
5 5 -1
Sample Output 1
Yes
頭に(0,1)
胴に(2,2)
腕に(3,5)
腰に(1,3)
足に(5,-1)
の防具を装備すると、重さの和が 0+2+3+1+5 = 11、守備力の和が 1+2+5+3+1 = 10 となり、両方の値がA以上でかつB以下となるのでスキルを発動させることができる。
Sample Input 2
7 10 10
1 1 0
1 0 1
2 2 2
3 3 5
4 1 3
5 1 3
5 5 -1
Sample Output 2
No | [
{
"submission_id": "aoj_3007_3648415",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<utility>\n#include<set>\n#include<map>\n#include<stack... |
aoj_3006_cpp | Problem G: Chairs
Problem
1から
N
の番号が割り当てられた
N
脚の椅子に、1から
N
のIDが割り当てられた
N
人の人が座ろうとしている。IDが
i
の人は椅子
p
i
に座りたいと思っている。
N
人の人はIDが小さい順に1列に並び、列の先頭の人が以下の行動をとる。
椅子
p
i
に誰も座っていなければ、その椅子に座る。
そうでなければ、
p
i
に1を加算し、列の最後尾に並び直す。ただし、
p
i
が
N
を超えた場合は
p
i
を1にする。
全ての人が椅子に座るまでこの行動が繰り返されたとき、最終的に各椅子に座っている人のIDを出力せよ。
Input
入力は以下の形式で与えられる。
N
p
1
p
2
...
p
N
1行目に整数
N
が与えられる。
2行目に
N
個の整数
p
1
,
p
2
, ...,
p
N
が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 10
5
1 ≤
p
i
≤
N
Output
N
行に最終的な状態を出力する。
i
行目に椅子
i
に座っている人のIDを出力する。
Sample Input 1
5
1 2 3 4 5
Sample Output 1
1
2
3
4
5
Sample Input 2
5
3 3 4 4 5
Sample Output 2
4
2
1
3
5 | [
{
"submission_id": "aoj_3006_8107607",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (u... |
aoj_3008_cpp | Problem I: Tree-Light
Problem
あなたはツリーライトというツリー状の照明器具を買ってきた。
この照明器具には
n
個の接点があり、それぞれ
0
から
n−1
までの番号がついている。各接点は10段階の明るさを表現できる電球と、電球の状態を切り替えるための装置で構成されている。最初、すべての接点の電球の明るさは
0
である。
また、接点と接点の間にはケーブル線がある。すべての接点は
n−1
本のケーブル線によって繋がれており、接点
0
を上にして吊り下げられる。ここで、接点
i
から下方向に0本以上のケーブル線を介して、接点
i
と繋がる接点の集合を、接点
i
を根とした部分木と呼ぶ。
あなたはこの照明器具に対し、以下のいずれかの行動をとる。
count(r, x, y)
: 接点
r
を根とした部分木に含まれる接点の電球の中で、明るさが
x
以上
y
以下になっている電球の数を数える。
change(r, x, y)
: 接点
r
を根とした部分木に含まれる接点の電球の中で、明るさがちょうど
x
になっているすべての電球の明るさを
y
に変更する。
q
回の行動が与えられるので、
count(r, x, y)
が与えられるたびにその時点での電球の数を出力せよ。
Input
入力は以下の形式で与えられる。
n
q
u
1
v
1
u
2
v
2
...
u
n−1
v
n−1
t
1
r
1
x
1
y
1
t
2
r
2
x
2
y
2
...
t
q
r
q
x
q
y
q
1行目にツリーライトを構成する接点の数
n
、あなたのとる行動の数
q
が空白区切りで与えられる。
続く
n−1
行にはケーブル線の情報が空白区切りで与えられる。
i
番目のケーブル線の情報は、ケーブル線
i
が接点
u
i
を上にして、接点
u
i
と接点
v
i
を繋ぐことを表す。
n+1
行目以降の
q
行にはあなたのとる行動が空白区切りで与えられる。
t
i
= 1
なら
count(r
i
, x
i
, y
i
)
を、
t
i
= 2
なら
change(r
i
, x
i
, y
i
)
を表す。
Constraints
1 ≤ n ≤ 10
5
1 ≤ q ≤ 10
5
0 ≤ u
i
, v
i
, r
i
≤ n−1 (u
i
≠ v
i
)
0 ≤ x
i
, y
i
≤ 9 (t
i
= 1
の時
x
i
≤ y
i
)
Output
各
count(r
i
, x
i
, y
i
)
について、その答えを1行に出力する。
Sample Input 1
7 5
0 1
1 2
1 3
0 4
4 5
4 6
1 0 0 9
2 0 0 5
2 1 5 8
1 0 5 8
1 0 8 8
Sample Output 1
7
7
3
Sample Input 2
7 5
0 1
1 2
2 3
0 4
4 5
5 6
2 1 0 5
2 4 0 6
2 3 5 6
2 5 6 5
1 0 0 5
Sample Output 2
5 | [
{
"submission_id": "aoj_3008_10865772",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VS = vector<string>; using LL = long long;\nusing VI = vector<int>; using VVI = vector<VI>;\nusing PII = pair<int, int>; using PLL = pair<LL, LL>;\nusing VL = vector<LL>; using ... |
aoj_3016_cpp | Problem D: Fissure Puzzle Easy
Problem
$N \times N$個のマスから成るグリッドがある。最初すべてのマスは白色である。以下の手順に従って黒色のマスを増やしていく。
上から偶数番目かつ、左から偶数番目であるマスの中で、白色のマスを1つ選ぶ。選んだマスは黒色に変化する。さらに、そのマスの上下左右それぞれの方向について、隣接している白色のマスも連鎖的に黒色に変化する。この連鎖はその方向に白色のマスが存在しなくなるまで続く。(以下に例を示す)
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
↓上から4番目、左から6番目を選ぶ
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
■■■■■■■■■
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
↓上から2番目、左から2番目を選ぶ
□■□□□■□□□
■■■■■■□□□
□■□□□■□□□
■■■■■■■■■
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
↓上から6番目、左から8番目を選ぶ
□■□□□■□□□
■■■■■■□□□
□■□□□■□□□
■■■■■■■■■
□□□□□■□■□
□□□□□■■■■
□□□□□■□■□
□□□□□■□■□
□□□□□■□■□
あなたは上から$i$番目で左から$j$番目のマスの色が$A_{i,j}$であるグリッドを作りたい。マスを選ぶ最小の回数を求めよ。
Input
入力は以下の形式で与えられる。
$N$
$A_{1,1}$ $A_{1,2}$ ... $A_{1,N}$
$A_{2,1}$ $A_{2,2}$ ... $A_{2,N}$
...
$A_{N,1}$ $A_{N,2}$ ... $A_{N,N}$
$A_{i,j}$が'o'であるときは上から$i$番目、左から$j$番目のマスが白色であることを表し、'x'のときは黒色のマスであることを表す。
Constraints
入力は以下の条件を満たす。
$3 \le N \le 127$
$N$は奇数である
$A_{i,j}$は'o'か'x'である
必ず作ることができるような入力しか与えられない
Output
1行目にマスを選ぶ回数の最小値を出力する。
Sample Input 1
5
oxooo
oxooo
oxooo
xxxxx
oxooo
Sample Output 1
1
Sample Input 2
9
oxoooooxo
oxxxxxxxx
oxoooooxo
xxxxxxxxx
oxoxooooo
oxxxxxxxx
oxoxoxooo
oxoxxxxxx
oxoxoxooo
Sample Output 2
4 | [
{
"submission_id": "aoj_3016_2538570",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <string>\n#include <vector>\n#include <set>\n#include <cstdlib>\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nstruct Sum2D {\n\tvector<vector<ll>> b;\n\tSum... |
aoj_3012_cpp | Problem M: Settler
Problem
二次元平面上に
N
個の空き地がある。空き地にはそれぞれ1から
N
までの番号が割り振られている。どの空き地もとても小さいので、点とみなすことができる。
i
番目の空き地は(
x
i
,
y
i
)に存在している。
太郎君はこの
N
個の空き地の中からちょうど
K
個を選び、それらの空き地に建物を建てることにした。
しかし、あまりにも近い場所に複数の建物を建てても面白くないと思ったので、太郎君はそれぞれの空き地どうしのユークリッド距離が必ず2以上となるように空き地を選ぶことにした。
太郎君が選ぶ空き地の組み合わせとして考えられるものを出力するプログラムを作成せよ。
組み合わせが複数存在する場合は、辞書順で最小のものを出力せよ。
ただし、どのように
K
個の空き地を選んだとしても、いずれか2つの空き地のユークリッド距離が2より小さくなってしまう場合は、かわりに-1を出力せよ。
Input
入力は以下の形式で与えられる。
N
K
x
1
y
1
x
2
y
2
...
x
N
y
N
Constraints
入力は以下の条件を満たす。
入力は全て整数である。
2 ≤
K
≤
N
≤ 6,000
1 ≤
x
i
,
y
i
≤ 1,000,000 ( 1 ≤
i
≤
N
)
x
i
mod
2 =
floor
(
y
i
÷ 2 )
mod
2 ( 1 ≤
i
≤
N
)
(ここで
floor
(
y
i
÷ 2 ) とは
y
i
を2で割り小数点以下を切り捨てた値である)
同じ座標に複数の空き地が存在することはない。
Output
太郎君が選ぶ空き地の番号を昇順に1行ずつ出力せよ。
Sample Input 1
3 2
2 1
1 2
1 3
Sample Output 1
1
3
Sample Input 2
4 3
2 1
1 2
1 3
2 4
Sample Output 2
-1
Sample Input 3
5 3
5 7
5 6
6 8
20 20
4 8
Sample Output 3
2
3
4 | [
{
"submission_id": "aoj_3012_10760428",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define MAX 6005\n\nstruct Data{\n int a,b,c;\n Data(){ a=b=c=-1; }\n void insert(int x){\n if(a==x||b==x||c==x)return;\n c=b;\n b=a;\n a=x;\n }\n bool count(int x){\n return (a==x... |
aoj_3010_cpp | Problem K: Donuts Purchase
Problem
ラフイは休暇の間することがなく暇で、なんとなくドーナツが食べたくなったので、店を巡りドーナツを購入していくことにした。
各街には1軒のドーナツ店があり、すべてのドーナツ店は奇数日が定休日となっている。
ラフイにはドーナツの好みがあるので、店によって得られる満足度が違う。
そこでラフイは最適に行動することで、できるだけ多くの満足度を得ることにした。
ラフイが住んでいる世界には、それぞれ0から
n
-1の番号が割り当てられた
n
個の街があり、それらは
m
本の道で繋がれている。
それぞれの道は一方通行になっており、ラフイは街
a
i
から街
b
i
へ移動することができる。
最初ラフイは偶数日に街0にいる。
ラフイは街には留まらずに、1日に道を1本渡り別の街に移動する。
ラフイは街
i
に到着した日に、店が営業していれば1つドーナツを購入し、満足度
c
i
を得る。
同じ街は何度でも訪れることができるが、1つの店では1度しか購入しない。
ラフイがこれ以上満足度を得られない状態になるまで最適に行動した時の満足度の合計の最大を求めよ。
Input
n
m
c
0
...
c
n−1
a
0
b
0
...
a
m−1
b
m−1
入力はすべて整数で与えられる。
1行目に街の数
n
と道の数
m
が空白区切りで与えられる。
2行目に街
i
の店でドーナツを購入した際に得られる満足度
c
i
が空白区切りで与えられる。
続く
m
行に道の情報を表す
a
i
と
b
i
が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
n
≤ 10
5
0 ≤
m
≤ min(
n
×(
n
−1),10
5
)
0 ≤
c
i
≤ 1000
0 ≤
a
i
,
b
i
≤
n
− 1
自己ループ、多重辺は存在しない
Output
満足度の合計の最大値を1行に出力せよ。
Sample Input 1
2 1
1 2
0 1
Sample Output 1
1
Sample Input 2
5 5
1 1 1 1 1
0 1
1 2
2 3
3 0
3 4
Sample Output 2
3
Sample Input 3
4 4
1 1 1 1
0 1
1 2
2 0
2 3
Sample Output 3
4 | [
{
"submission_id": "aoj_3010_10331905",
"code_snippet": "// AOJ #3010 Donuts Purchase\n// 2025.3.28\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\nusing ll = long long;\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & ... |
aoj_3011_cpp | Problem L: Select Sets
Problem
整数の集合が
N
個ある。 これらの集合にはそれぞれ1から
N
までの番号が割り振られている。
i
番目の集合の要素数は
K
i
であり、その集合の要素の中で
j
番目に小さい整数は
a
i,j
である。
太郎君はこの中から任意の数だけ集合を選ぶことになった。 ただ適当に選ぶだけではつまらないと思った太郎君は、少なくとも3つの集合を選ぶことにした。また、"選んだ集合の和集合の要素数"と"選んだ集合の積集合の要素数"の積ができるだけ大きくなるように選ぶことにした。
太郎君が最適に集合を選んだとき、"選んだ集合の和集合の要素数"と"選んだ集合の積集合の要素数"の積の最大値を求めよ。
Input
入力は以下の形式で与えられる。
N
K
1
a
1,1
a
1,2
...
a
1,K
1
K
2
a
2,1
a
2,2
...
a
2,K
2
...
K
N
a
N,1
a
N,2
...
a
N,K
N
Constraints
入力は以下の条件を満たす。
入力は全て整数である。
3 ≤
N
≤ 20,000
1 ≤
a
i,j
≤ 22
a
i,j
<
a
i,j+1
( 1 ≤
i
≤
N
)
( 1 ≤
j
<
K
i
)
Output
太郎君が最適に選んだときの"選んだ集合の和集合の要素数"と"選んだ集合の積集合の要素数"の積の最大値を出力せよ。
Sample Input 1
4
1 5
2 3 5
3 3 5 7
4 3 5 7 9
Sample Output 1
8
Sample Input 2
5
4 1 4 5 6
4 1 7 8 9
3 1 2 3
3 1 2 3
3 1 2 3
Sample Output 2
9
Sample Input 3
3
2 3 4
2 2 5
2 1 6
Sample Output 3
0 | [
{
"submission_id": "aoj_3011_10316845",
"code_snippet": "// AOJ #3011 Select Sets\n// 2025.3.21\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\tdo n = 10*n +... |
aoj_3015_cpp | Problem C: Palindrome
Problem
太郎君はそれぞれの長さが
L
の文字列を
N
個持っている。太郎君は回文が大好きなので、
N
個のうちいくつかの文字列を選んで好きな順番に並べることで、できるだけ長い回文を作りたい。
太郎君が作ることのできる回文の中で、最長のものを求めよ。複数ある場合は、そのうち辞書順で最小のものを出力せよ。どのように選んで並べても回文が作れない場合は、空行を出力せよ。
Input
入力は以下の形式で与えられる。
N
L
s
1
s
2
.
.
.
s
N
1行目に、文字列の数
N
と文字列の長さ
L
が与えられる。続く2行目から
N
+ 1行目に太郎君が持っている文字列
s_i
が与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 1000
1 ≤
L
≤ 30
s_i
は英小文字からなる文字列である。
Output
最長の回文の中で辞書順最小のものを出力せよ。回文が作れない場合は空行を出力せよ。
Sample Input 1
4 2
oi
io
rr
rr
Sample Output 1
iorrrroi
Sample Input 2
5 1
a
b
c
a
c
Sample Output 2
acbca
Sample Input 3
3 3
uki
uku
uke
Sample Output 3
uku | [
{
"submission_id": "aoj_3015_3629083",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<comple... |
aoj_3005_cpp | Problem F: Great Devil Sakanikia
Problem
大悪魔サカーニャは今日も天敵の猫に襲われていた。
いつもやられている訳にはいかないので、秘密兵器を購入した。
この秘密兵器は、巨大な岩を生成することで猫の移動経路を塞ぎ、猫がこちらに近づけないようにすることができる。
今、サカーニャと一匹の猫がマス(0,0),(
n
−1,0),(
n
−1,
m
−1),(0,
m
−1)で囲まれた長方形の閉区間内にいる。
マス(0,0)に猫、マス(
n
−1,
m
−1)にサカーニャがいる。
猫は上下左右の隣接したマスに移動することができるが、区間外に出ることはできない。
いくつかのマスは、穴や障害物の影響で侵入することができない。
サカーニャは、あるマスに1つ岩を生成することでそのマスに猫が侵入できなくすることができる。
ただし、マス(0,0)とマス(
n
−1,
m
−1)に岩を生成することはできない。
マス(0,0)からマス(
n
−1,
m
−1)までの移動経路を塞ぐために必要な、生成する岩の数の最小値を求めよ。
Input
n
m
k
x
1
y
1
...
x
k
y
k
入力はすべて整数で与えられる。
1行目にマスの大きさを表す２つの整数
n
と
m
、侵入できないマスの数
k
が空白区切りで与えられる。
2行目から
k
行に侵入できないマスの座標が与えられる。
Constraints
入力は以下の条件を満たす。
2 ≤
n
,
m
≤ 10
5
0 ≤
k
≤ min(
n
×
m
−2,10
5
)
0 ≤
x
i
≤
n
− 1
0 ≤
y
i
≤
m
− 1
(
x
i
,
y
i
) ≠ (
x
j
,
y
j
) (
i
≠
j
)
(
x
i
,
y
i
) ≠ (0,0) ≠ (
n
−1,
m
−1)
Output
マス(0,0)からマス(
n
−1,
m
−1)までの移動経路を塞ぐために必要な、生成する岩の数の最小値を1行に出力せよ。
Sample Input 1
3 5 2
0 2
2 2
Sample Output 1
1
Sample Input 2
5 5 3
0 2
2 2
4 1
Sample Output 2
2 | [
{
"submission_id": "aoj_3005_10853025",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VS = vector<string>; using LL = long long;\nusing VI = vector<int>; using VVI = vector<VI>;\nusing PII = pair<int, int>; using PLL = pair<LL, LL>;\nusing VL = vector<LL>; using ... |
aoj_3019_cpp | Problem G: Picnic
Problem
明日はいよいよマイヅ小学校の遠足の日である。マイヅ小学校に通うがっちょ君は、楽しみのあまり明日のお菓子を買い忘れていたことに気づいた。 がっちょ君は遠足を最大限楽しむため、お菓子にもこだわりたい。
がっちょ君はお母さんから$X$円のお小遣いをもらってお菓子を買いに行く。ただし、小学校のルールで遠足に持っていくお菓子の合計金額は$Y$円までと決まっており、$Y$円を上回るとお菓子は全て先生に取り上げられてしまう。
がっちょ君の住む学区には$N$個の町があり、各町には1軒の駄菓子屋がある。各町には1から$N$の番号が割り振られており、がっちょ君は町1に住んでいる。 各駄菓子屋ではいくつかのお菓子が売っており、1つあたりの値段、1つ買うごとにがっちょ君が得られる満足度が決まっている。ただし、各お菓子の在庫数には限りがある。 また、がっちょ君は2つの町の間を移動するとき公共交通機関を利用するため、町$i$から町$j$へ直接移動するには$d_{i,j}$円だけお金がかかる。
最初、がっちょ君は町1にいる。がっちょ君は移動にかかる費用の合計と買ったお菓子の値段の合計の和が$X$円以内で、かつ、買ったお菓子の値段の合計が$Y$円以内になるようにお菓子を買いに行く。最後には町1に到着している必要がある。がっちょ君は買ったお菓子の満足度の合計ができるだけ大きくなるようにしたい。がっちょ君が最適な行動をしたときの満足度の合計を求めよ。
Input
入力は以下の形式ですべて整数で与えられる。
$N$ $X$ $Y$
町1の駄菓子屋の情報
町2の駄菓子屋の情報
...
町$N$の駄菓子屋の情報
$d_{1,1}$ $d_{1,2}$ ... $d_{1,N}$
$d_{2,1}$ $d_{2,2}$ ... $d_{2,N}$
...
$d_{N,1}$ $d_{N,2}$ ... $d_{N,N}$
1行目に町の数$N$と所持金$X$、お菓子を買うために使うことができる上限金額$Y$が空白区切りで与えられる。
2行目からは$N$個の各駄菓子屋の情報が与えられる。
続く$N$行$N$列に町$i$と町$j$を直接行き来するために必要な金額$d_{i,j}$が空白区切りで与えられる。
各町の駄菓子屋の情報は以下の形式で与えられる。
$K$
$a_1$ $b_1$ $c_1$
$a_2$ $b_2$ $c_2$
...
$a_K$ $b_K$ $c_K$
1行目にその駄菓子屋で売っているお菓子の種類の数$K$が与えられる。続く$K$行にお菓子の1つの値段$a_i$、1つあたりの満足度$b_i$、在庫数$c_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq N \leq 14$
$1 \leq X \leq 10000$
$1 \leq Y \leq min(1000,X)$
$1 \leq K \leq 300$
$1 \leq a_i \leq 1000$
$1 \leq b_i \leq 1000$
$1 \leq c_i \leq 1000$
$0 \leq d_{i,j} \leq 10000$
$d_{i,i} = 0$
Output
満足度の合計の最大値を1行に出力する。
Sample Input 1
1 10 10
3
1 10 1
2 20 2
3 30 3
0
Sample Output 1
100
Sample Input 2
2 10 10
3
1 10 1
2 20 2
3 30 3
1
5 200 1
0 2
3 0
Sample Output 2
200
Sample Input 3
3 10 10
1
1 1 1
1
3 3 3
1
5 5 5
0 1 0
1 0 0
0 1 0
Sample Output 3
10
Sample Input 4
4 59 40
1
7 6 3
1
10 3 9
2
9 8 5
7 6 10
4
8 2 9
1 7 1
7 7 9
1 2 3
0 28 7 26
14 0 10 24
9 6 0 21
9 24 14 0
Sample Output 4
34 | [
{
"submission_id": "aoj_3019_10322303",
"code_snippet": "// AOJ #3019 Picnic\n// 2025.3.24\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c =... |
aoj_3020_cpp | Problem H: Sequence
Problem
項数$L$の等差数列が$N$個ある。$i$番目の等差数列の初項は$a_i$で公差は$d_i$である。1番目の数列から順番に1番目の数列, 2番目の数列, ..., $N$番目の数列と並べ、そうしてできた数列を$A$とする。その後、$A$から長さ$K$の任意の区間を選んで、新たに数列$B$を作るとき、数列$B$の和を最大化せよ。
Input
入力は以下の形式で与えられる。
$N$ $L$ $K$
$a_1$ $d_1$
$a_2$ $d_2$
...
$a_N$ $d_N$
1行目に3つの整数$N$, $L$, $K$が空白区切りで与えられる。
続く$N$行に、$i$個目の等差数列の情報$a_i$, $d_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq N \leq 10^5$
$1 \leq L \leq 10^5$
$1 \leq K \leq N\times L$
$0 \leq a_i \leq 10^5$
$1 \leq d_i \leq 10^3$
入力はすべて整数
Output
数列$B$の和の最大値を1行に出力する。
Sample Input 1
3 3 5
0 3
2 2
4 1
Sample Output 1
25
数列$A$は$0,3,6,2,4,6,4,5,6$となる。この数列の第5項から第9項までを数列$B$とすれば、数列$B$の和は25となり、これが最大である。
Sample Input 2
3 3 5
0 10
8 1
11 1
Sample Output 2
58 | [
{
"submission_id": "aoj_3020_4951903",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(ll (i)=0; (i)<(n); (i)++)\n\nll sum_all(ll a, ll d, ll l){\n return a * l + l * (l-1) / 2 * d;\n}\nll sum_left(ll a, ll d, ll l, ll n){\n return a * n + n ... |
aoj_3017_cpp | Problem E: Piano
Problem
がっちょ君はピアノを弾こうとしている。ピアノは右側にある鍵盤ほど高い音が出る。がっちょ君はある楽譜を持っており、その楽譜に従って弾く。
楽譜には、ある時刻にどの鍵盤を弾くべきかを示す音符が時系列順に記載されている。この楽譜には和音(複数の鍵盤を押したときに出る音)は現れず、音の長さも考えないことにする。
がっちょ君はピアノを弾くとき、以下のルールに従う。
片手のみで弾く
指一本で鍵盤ひとつを弾く
最初の音はどの指でも弾ける
直前の音より高い音を弾くとき、直前の音を弾いた指よりもひとつ以上右にある指を使う
直前の音より低い音を弾くとき、直前の音を弾いた指よりもひとつ以上左にある指を使う
直前の音と同じ高さの音を弾くとき、直前の音を弾いた指と同じ指を使う
がっちょ君が使う楽譜が与えられるので、ルールに従ってその楽譜を演奏しきるには、演奏する方の腕に最小何本の指が必要かを求めよ。ただし、必要な指は6本以上になることがあることに注意せよ。
Input
入力は以下の形式で与えられる。
N
a
1
a
2
...
a
N
1行目に、楽譜に書かれている音符の総数を表す整数
N
が与えられる。
続く2行目から
N
+1行目までに、時刻
i
(1 ≤
i
≤
N
)に弾くべき鍵盤が最も左の鍵盤から何番目かを表す整数
a
i
が与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 10
5
0 ≤
a
i
≤ 10
9
Output
がっちょ君が上記ルールに従って弾くために必要な最小の指の本数を1行に出力する。
Sample Input 1
3
2
5
1
Sample Output 1
2
この場合、図1の①、② 、③ の順で鍵盤を弾く。指が2本あると、左側の指で鍵盤2を、右側の指で鍵盤5を、また左側の指で鍵盤1を弾くことができる。
図1: Sample1 の図解
Sample Input 2
5
4
5
2
1
3
Sample Output 2
3
Sample Input 3
3
4
4
4
Sample Output 3
1 | [
{
"submission_id": "aoj_3017_5981054",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <utility>\n#include <queue>\n#include <map>\n#include <set>\n#include <cmath>\n#include <deque>\n#include <algorithm>\n#include <stack>\n#include... |
aoj_3023_cpp | Problem K: Chinol Choco
Problem
チョコレート会社チノルチョコは新しい店を
n
店建てることにした。
それぞれの店は各店長に建てたい場所の候補を2つ用意してもらい、どちらかの場所に建てる。
チノルチョコでは
m
種類のチョコレートを販売しており、それぞれ別の工場で製造している。
すべての店で全種類のチョコレートを販売する。
チノルチョコではチョコレートを搬送するためのトラックを1台しか所有しておらず、1台のトラックでは1店分のチョコレートしか運べない。
そのため、トラックは店から別の店へ移動する際にすべての工場を回る必要がある。
ある店から別の店へ移動する時の最短移動距離の最大が最小になるように店を配置した時の、最大の移動距離を求めよ。
同じ場所に複数の店や工場が存在することができる。
Input
入力は以下の形式で与えられる。
n
m
a
0
b
0
c
0
d
0
...
a
n
−1
b
n
−1
c
n
−1
d
n
−1
x
0
y
0
...
x
m
−1
y
m
−1
入力はすべて整数で与えられる。
1行目にチノルチョコの店の数
n
、チョコレートを製造している工場の数
m
が空白区切りで与えられる。
2行目から
n
行にそれぞれの店を建てる場所の候補の座標(
a
i
,
b
i
),(
c
i
,
d
i
)が空白区切りで与えられる。
2+
n
行目から
m
行に工場の座標(
x
i
,
y
i
)が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
2 ≤
n
≤ 200
1 ≤
m
≤ 15
0 ≤
a
i
,
b
i
,
c
i
,
d
i
,
x
i
,
y
i
≤ 1000
Output
最短移動距離の最大が最小になるように店を配置した時の、最大の移動距離を出力せよ。
誤差が10
−6
を超えてはならない。
Sample Input 1
2 1
0 0 5 5
3 3 6 6
2 2
Sample Output 1
4.2426406871
Sample Input 2
2 2
0 0 6 0
7 0 3 0
4 0
5 0
Sample Output 2
3.0000000000 | [
{
"submission_id": "aoj_3023_10322952",
"code_snippet": "// AOJ #3023 Chinol Choco\n// 2025.3.25\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\tr... |
aoj_3027_cpp | Problem B: OOllOll
Problem
非負整数$x$を2進数表記したときの各桁の和を$f(x)$とする。
正整数$N$が与えられるので$f(0)$,$f(1)$,...,$f(N)$の中で最大のものを出力せよ。
関数$f(5)$の計算の例:
5を2進数表記すると101で各桁の和は1+0+1=2
よって$f(5) = 2$となる。
Note: https://ja.wikipedia.org/wiki/二進法
Input
入力は以下の形式で与えられる。
$N$
正整数$N$が1行に与えられる。
Constraints
入力は以下の条件を満たす。
$1 \le N \le 10^9$
Ouput
$f(0)$,$f(1)$,...,$f(N)$の中で最大のものを1行に出力する。
Sample Input 1
2
Sample Output 1
1
Sample Input 2
9
Sample Output 2
3 | [
{
"submission_id": "aoj_3027_2744398",
"code_snippet": "#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME\n#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)\n#define pr1(a) (#a)<<\"=\"<<(a)\n#define pr2(a,b) pr1(a)<<\", \"<<pr1(b)\n#define pr3(a,b,c) pr2(a,b)<<\... |
aoj_3021_cpp | Problem J: Cluster Network
Problem
マイヅ大学にある大規模クラスタ
†
型スーパーコンピュータ（通称「SAKURA」）のクラスタは、$N$台のコンピュータ（ノード）と$M$本の相互に通信が可能な物理的通信路で構成される。また、各ノードにはそれぞれ1から$N$までの識別番号が割り当てられている。
この度SAKURAの利用を大学関係者だけでなく、県内の企業にも認めることとなった。それに伴い、SAKURAを構成する各ノードを点検する必要がある。しかし、SAKURAの利用スケジュールは数ヶ月先まで埋まっているので、点検中もシステム全体を停止させることはできない。そこで、ノードを1日に1台ずつ順番に点検する。
点検は$N$日にわたって行われ、$i$日目にノード$i$を点検する。このとき、点検するノードとそのノードに直接接続されている通信路をSAKURAのクラスタから切り離す。それによって、SAKURAのクラスタ全体は1つ以上のクラスタに分断されるので、そのうちのいずれかをSAKURAの代わりに運用する。当然、点検中のノードは運用することができない。
複数のクラスタに分断された場合、それらの中で最も「総合性能値」の高いクラスタのみを運用する。各クラスタの「総合性能値」はそれを構成する各ノードに設定された「単体性能値」の和である。
SAKURAを構成するノードの数、通信路の本数と各ノードに設定された「単体性能値」が与えられるので、$i$日目の点検中に運用されるクラスタの「総合性能値」を出力せよ。
†：クラスタとは、1つ以上のコンピュータを結合してひとまとまりにしたシステムのこと。ここでは、物理的通信路で連結なノードの集合とする。
Input
入力は以下の形式で与えられる。
$N$ $M$
$w_1$ $w_2$ ... $w_N$
$u_1$ $v_1$
$u_2$ $v_2$
...
$u_M$ $v_M$
1行目にクラスタを構成するノードの数$N$と通信路の本数$M$が空白区切りで与えられる。
2行目には各ノードの「単体性能値」を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$w_i$はノード$i$の「単体性能値」を表す。
3行目からの$M$行には各通信路がつなぐ2つのノードの識別番号が空白区切りで与えられる。2+$i$行目の入力では、通信路がノード$u_i$とノード$v_i$を相互につなぐことを表す。
Constraints
入力は以下の条件を満たす。
$2 \leq N \leq 10^5$
$N-1 \leq M \leq min(\frac{N\times(N-1)}{2},10^5)$
$1 \leq w_i \leq 10^6$
$1 \leq u_i, v_i \leq N, u_i \ne v_i$
$(u_i,v_i) \ne (u_j,v_j), (u_i,v_i) \ne (v_j,u_j), i \ne j$
入力は全て整数
Output
出力は$N$行からなる。
$i$行目には、$i$日目に運用されるクラスタの「総合性能値」を出力する。
Sample Input 1
9 10
1 2 3 4 5 6 7 8 9
1 2
2 3
2 4
3 4
4 5
4 6
2 7
7 8
7 9
9 1
Sample Output 1
44
25
42
30
40
39
30
37
36
Sample Input 2
16 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
1 2
2 3
3 4
3 5
1 6
6 7
6 8
7 8
8 9
8 10
10 11
11 12
12 10
1 13
13 14
14 15
15 13
14 16
15 16
Sample Output 2
63
122
124
132
131
73
129
86
127
103
125
124
78
122
121
120
Sample Input 3
2 1
1 2
1 2
Sample Output 3
2
1 | [
{
"submission_id": "aoj_3021_10322927",
"code_snippet": "// AOJ #3021 Making Pairs\n// 2025.3.25\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf... |
aoj_3022_cpp | Problem J: Cluster Network
Problem
マイヅ大学にある大規模クラスタ
†
型スーパーコンピュータ（通称「SAKURA」）のクラスタは、$N$台のコンピュータ（ノード）と$M$本の相互に通信が可能な物理的通信路で構成される。また、各ノードにはそれぞれ1から$N$までの識別番号が割り当てられている。
この度SAKURAの利用を大学関係者だけでなく、県内の企業にも認めることとなった。それに伴い、SAKURAを構成する各ノードを点検する必要がある。しかし、SAKURAの利用スケジュールは数ヶ月先まで埋まっているので、点検中もシステム全体を停止させることはできない。そこで、ノードを1日に1台ずつ順番に点検する。
点検は$N$日にわたって行われ、$i$日目にノード$i$を点検する。このとき、点検するノードとそのノードに直接接続されている通信路をSAKURAのクラスタから切り離す。それによって、SAKURAのクラスタ全体は1つ以上のクラスタに分断されるので、そのうちのいずれかをSAKURAの代わりに運用する。当然、点検中のノードは運用することができない。
複数のクラスタに分断された場合、それらの中で最も「総合性能値」の高いクラスタのみを運用する。各クラスタの「総合性能値」はそれを構成する各ノードに設定された「単体性能値」の和である。
SAKURAを構成するノードの数、通信路の本数と各ノードに設定された「単体性能値」が与えられるので、$i$日目の点検中に運用されるクラスタの「総合性能値」を出力せよ。
†：クラスタとは、1つ以上のコンピュータを結合してひとまとまりにしたシステムのこと。ここでは、物理的通信路で連結なノードの集合とする。
Input
入力は以下の形式で与えられる。
$N$ $M$
$w_1$ $w_2$ ... $w_N$
$u_1$ $v_1$
$u_2$ $v_2$
...
$u_M$ $v_M$
1行目にクラスタを構成するノードの数$N$と通信路の本数$M$が空白区切りで与えられる。
2行目には各ノードの「単体性能値」を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$w_i$はノード$i$の「単体性能値」を表す。
3行目からの$M$行には各通信路がつなぐ2つのノードの識別番号が空白区切りで与えられる。2+$i$行目の入力では、通信路がノード$u_i$とノード$v_i$を相互につなぐことを表す。
Constraints
入力は以下の条件を満たす。
$2 \leq N \leq 10^5$
$N-1 \leq M \leq min(\frac{N\times(N-1)}{2},10^5)$
$1 \leq w_i \leq 10^6$
$1 \leq u_i, v_i \leq N, u_i \ne v_i$
$(u_i,v_i) \ne (u_j,v_j), (u_i,v_i) \ne (v_j,u_j), i \ne j$
入力は全て整数
Output
出力は$N$行からなる。
$i$行目には、$i$日目に運用されるクラスタの「総合性能値」を出力する。
Sample Input 1
9 10
1 2 3 4 5 6 7 8 9
1 2
2 3
2 4
3 4
4 5
4 6
2 7
7 8
7 9
9 1
Sample Output 1
44
25
42
30
40
39
30
37
36
Sample Input 2
16 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
1 2
2 3
3 4
3 5
1 6
6 7
6 8
7 8
8 9
8 10
10 11
11 12
12 10
1 13
13 14
14 15
15 13
14 16
15 16
Sample Output 2
63
122
124
132
131
73
129
86
127
103
125
124
78
122
121
120
Sample Input 3
2 1
1 2
1 2
Sample Output 3
2
1 | [
{
"submission_id": "aoj_3022_10578791",
"code_snippet": "#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/3022\"\n\n\n#include <cassert>\n#include <concepts>\n#include <vector>\n#include <optional>\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing... |
aoj_3031_cpp | Problem F: Ghost Legs
Problem
縦線が３本のあみだくじが$N$個ある。
どの線からスタートしてもスタートした線で終わるあみだくじを良いあみだくじとする。
あみだくじを１つ以上選んで縦に自由な順序でつなぐことができる。
良いあみだくじを作ることができるのであれば"yes"、そうでなければ"no"を出力せよ。
$i$番目のあみだくじには横線が$w_i$本ある。
$a_{i,j}$はあみだくじ$i$の上から$j$番目の横棒が中央の縦線から左右どちらに伸びているかを表し、
$a_{i,j}$が0ならば左に、1ならば右に伸びていることを表す。
Input
入力は以下の形式で与えられる。
$N$
$w_1$ $a_{1,1}$ $a_{1,2}$ ... $a_{1,w_1}$
$w_2$ $a_{2,1}$ $a_{2,2}$ ... $a_{2,w_2}$
...
$w_N$ $a_{N,1}$ $a_{N,2}$ ... $a_{N,w_N}$
入力はすべて整数で与えられる。
1行目に$N$が与えられる。
続く$N$行に$w_i$と$w_i$個の$a_{i,j}$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \le N \le 50$
$0 \le w_i \le 100$
$a_{i,j}$は0または1
Output
良いあみだくじを作ることができるのであれば"yes"、そうでなければ"no"を出力する。
Sample Input 1
3
2 0 0
1 1
5 1 0 0 1 0
Sample Output 1
yes
Sample Input 2
2
1 1
1 0
Sample Output 2
no | [
{
"submission_id": "aoj_3031_2848065",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\nbool operator<(const vector<int>&l, const vector<int>&r) {\n\tfor (int... |
aoj_3025_cpp | Problem M: Fissure Puzzle Hard
Problem
$N \times N$個のマスから成るグリッドがある。最初すべてのマスは白色である。以下の手順に従って黒色のマスを増やしていく。
上から偶数番目かつ、左から偶数番目であるマスの中で、白色のマスを1つ選ぶ。選んだマスは黒色に変化する。さらに、そのマスの上下左右それぞれの方向について、隣接している白色のマスも連鎖的に黒色に変化する。この連鎖はその方向に白色のマスが存在しなくなるまで続く。(以下に例を示す)
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
□□□□□□□□□
↓上から4番目、左から6番目を選ぶ
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
■■■■■■■■■
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
↓上から2番目、左から2番目を選ぶ
□■□□□■□□□
■■■■■■□□□
□■□□□■□□□
■■■■■■■■■
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
□□□□□■□□□
↓上から6番目、左から8番目を選ぶ
□■□□□■□□□
■■■■■■□□□
□■□□□■□□□
■■■■■■■■■
□□□□□■□■□
□□□□□■■■■
□□□□□■□■□
□□□□□■□■□
□□□□□■□■□
あなたは上から$i$番目で左から$j$番目のマスの色が$A_{i,j}$であるグリッドを作りたい。
作ることが可能かどうかを判定せよ。可能な場合は、選ぶべきマスの場所と順番を求めよ。
Input
入力は以下の形式で与えられる。
$N$
$A_{1,1}$ $A_{1,2}$ ... $A_{1,N}$
$A_{2,1}$ $A_{2,2}$ ... $A_{2,N}$
...
$A_{N,1}$ $A_{N,2}$ ... $A_{N,N}$
$A_{i,j}$が'o'であるときは上から$i$番目、左から$j$番目のマスが白色であることを表し、'x'のときは黒色のマスであることを表す。
Constraints
入力は以下の条件を満たす。
$3 \le N \le 2047$
$N$は奇数である
$A_{i,j}$は'o'か'x'である
Output
不可能な場合は-1と1行に出力せよ。
可能な場合は1行目に選ぶマスの個数を出力し、
$i \times 2$行目には$i$番目に選択するマスが上から何番目なのかを、
$i \times 2 + 1$行目には$i$番目に選択するマスが左から何番目なのかを出力せよ。
一意に定まらない場合は辞書順で最小になるようにせよ。
Sample Input 1
5
oxooo
oxooo
oxooo
xxxxx
oxooo
Sample Output 1
1
4
2
Sample Input 2
9
oxoooooxo
oxxxxxxxx
oxoooooxo
xxxxxxxxx
oxoxooooo
oxxxxxxxx
oxoxoxooo
oxoxxxxxx
oxoxoxooo
Sample Output 2
4
4
2
2
8
6
4
8
6
Sample Input 3
3
oxx
oxx
ooo
Sample Output 3
-1 | [
{
"submission_id": "aoj_3025_3650106",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <tuple>\n\nusing namespace std;\n\nstruct Rect {\n int x;\n int y;\n int width;\n int height;\n int cross_x;\n int cross_y;\n};\n\ntemp... |
aoj_3024_cpp | Problem L: RMQ 2
Problem
長さ$N$の2つの数列$A$と$B$が与えられる。はじめ、数列$A$の$i$項目は$a_i$であり、数列$B$の$i$項目は$b_i$である。
以下のような形式の命令文が合計$Q$個与えられるので、与えられた順に処理を行うプログラムを作成せよ。
各命令文は3つの整数$x,y,z$で表される。
数列$A$の$y$項目の値を$z$にする。 ($x=1$のとき)
数列$B$の$y$項目の値を$z$にする。 ($x=2$のとき)
数列$A$の$y$項目から$z$項目の中で最小の値を見つけて報告する。 ($x=3$のとき)
数列$B$の$y$項目から$z$項目の中で最小の値を見つけて報告する。 ($x=4$のとき)
数列$A$を、数列$B$と全く同じになるように変更する。 ($x=5$のとき)
数列$B$を、数列$A$と全く同じになるように変更する。 ($x=6$のとき)
Input
入力は以下の形式で与えられる。
$N$
$a_{1}$ $a_{2}$ ... $a_{N}$
$b_{1}$ $b_{2}$ ... $b_{N}$
$Q$
$x_1$ $y_1$ $z_1$
$x_2$ $y_2$ $z_2$
...
$x_Q$ $y_Q$ $z_Q$
Constraints
入力は以下の条件を満たす。
$2 \le N \le 2 \times 10^5$
$2 \le Q \le 2 \times 10^5$
$1 \le a_i \le 10^9$
$1 \le b_i \le 10^9$
$1 \le x_i \le 6$
$1 \le y_i \le N $ ($1 \le x_i \le 4$のとき)
$y_i = -1$ ($x_i=5, 6$のとき)
$1 \le z_i \le 10^9$ ($x_i=1, 2$のとき)
$y_i \le z_i \le N$ ($x_i=3, 4$のとき)
$z_i = -1$ ($x_i=5, 6$のとき)
入力はすべて整数
Output
$x=3$または$x=4$の命令文が入力で与えられる度に、見つけた値を1行に出力する。
Sample Input 1
5
1 3 5 7 9
6 2 3 2 6
10
1 3 4
3 4 5
4 2 3
5 -1 -1
2 3 8
3 2 5
4 3 3
1 1 1
6 -1 -1
3 1 5
Sample Output 1
7
2
2
8
1 | [
{
"submission_id": "aoj_3024_7108764",
"code_snippet": "#line 1 \"/home/maspy/compro/library/my_template.hpp\"\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing pi = pair<ll, ll>;\nusing vi = vector<ll... |
aoj_3029_cpp | Problem D: AABABCAC
Problem
文字列$s$,$t$が与えられる。
最初、文字列集合$A=${$s$},$B=\phi$とする。
このとき、次の操作をできるだけたくさん行いたい。
操作
step1
全ての $u ∊ A$ について、以下の処理を行う。
$u$の全ての部分列(連続でなくてもよい)から、$t$と等しいものを任意に1つ選ぶ。選んだ部分列の$u$に対応するインデックスをそれぞれ$z_1$, $z_2$, …, $z_{|t|}$とする(ただし1 $\le$ $z_1$ $\lt$ $z_2$ $\lt$ … $\lt$ $z_{|t|}$ $\le$ $|u|$)。そのような部分列がなければ操作を終了する。
選んだ部分列の文字$u_{z_1}$, $u_{z_2}$, …, $u_{z_{|t|}}$でもとの文字列を分割し、それらを$B$に追加する。
例えば、$u=$"abcdcd", $t=$"ac"の場合は次の2通りの分割の方法が考えられる。
$u$の1番目の文字と3番目の文字を選んだ場合、""と"b"と"dcd"に分割される。
$u$の1番目の文字と5番目の文字を選んだ場合、""と"bcd"と"d"に分割される。
step2
$A$を$B$に置き換え、$B$を空にする。
操作回数を1増やす。
部分列の例
"abac"の部分列は、
{ "" , "a" , "b" , "c" , "aa" ,"ab" , "ac" , "ba" , "bc" , "aac" , "aba" , "abc" , "bac" , "abac" }
である。
"a"は"abac"の1文字目、または3文字目を抜き出すことによってできた部分列である。
"ac"は"abac"の1文字目と4文字目、または3文字目と4文字目を抜き出すことによってできた部分列である。
Input
入力は以下の形式で与えられる。
$s$
$t$
1行目に文字列$s$,2行目に文字列$t$が与えられる。
Constraints
入力は以下の条件を満たす。
1 $\le$ $|t|$ $\le$ $|s|$ $\le$ $10^5$
文字列$s$,$t$に含まれる文字はアルファベットの大文字または小文字
Output
操作回数の最大値を出力せよ。
Sample Input 1
AABABCAC
A
Sample Output 1
2
1回目の操作は、$A=${ "AABABCAC" }で始まる。
step1では、$u=$"AABABCAC"に対して、例えば4番目の文字を$t$と等しい部分列として選び、"AAB"と"BCAC"に分割し、それらを$B$に追加する。
step2では、$A$を$B$に置き換え、$B$を空にし、操作回数は1となる。
2回目の操作は、$A=${ "AAB" , "BCAC" }で始まる。
step1では、$u=$"AAB"に対して、例えば1番目の文字を$t$と等しい部分列として選び、""と"AB"に分割し、それらを$B$に追加する。次に$u=$"BCAC"に対して、3番目の文字を$t$と等しい部分列として選び、"BC"と"C"に分割し、それらを$B$に追加する。
step2では、$A$を$B$に置き換え、$B$を空にし、操作回数は2となる。
3回目の操作は、$A=${ "" , "AB" , "BC" , "C" }で始まる。
step1では、$u=$""に対して、$t$と等しい部分列が存在しないため、ここで操作を終了する。
この例の場合、3回目の操作ではstep1で操作が終了したため、操作回数は2となる。
Sample Input 2
abaabbabaabaabbabbabaabbab
ab
Sample Output 2
3
Sample Input 3
AbCdEfG
aBcDeFg
Sample Output 3
0 | [
{
"submission_id": "aoj_3029_2752501",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define... |
aoj_3028_cpp | Problem C: Ball
Problem
$N$個のボールがあり、各ボールには色と価値が決められている。
ボールの色は$1$から$C$まで$C$種類存在し、各色ごとに選べるボールの数の上限が決められている。
ボールを全体で高々$M$個選ぶとき、得られる価値の合計を最大化せよ。
Input
入力は以下の形式で与えられる。
$N$ $M$ $C$
$l_1$ $l_2$ ... $l_C$
$c_1$ $w_1$
$c_2$ $w_2$
...
$c_N$ $w_N$
入力はすべて整数で与えられる。
1行目に$N$, $M$, $C$が空白区切りで与えられる。
2行目に色$i$の選べるボールの数の上限$l_i$($1 \leq i \leq C$)が空白区切りで与えられる。
3行目以降の$N$行にボール$i$の色$c_i$と価値$w_i$($1 \leq i \leq N$)が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq M \leq N \leq 10^5 $
$1 \leq C \leq 10^5 $
$0 \leq l_i \leq N $
$1 \leq c_i \leq C $
$1 \leq w_i \leq 1000 $
Output
得られる価値の最大値を1行に出力せよ。
Sample Input 1
3 3 2
1 1
1 1
1 100
2 10
Sample Output 1
110
2番目と3番目のボールを選ぶのが最適である。
Sample Input 2
3 3 3
1 0 1
1 1
2 100
3 1
Sample Output 2
2
ある色のボールが一個も選べない場合もある。
Sample Input 3
22 7 26
11 14 15 3 11 7 16 17 1 4 2 19 4 14 16 16 3 13 17 12 7 11 2 20 12 22
6 10
1 3
13 1
16 5
4 1
20 7
18 4
26 6
9 1
12 2
21 1
21 7
18 1
14 5
24 5
6 1
3 1
2 5
21 2
7 6
10 9
15 7
Sample Output 3
52 | [
{
"submission_id": "aoj_3028_10342652",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define ... |
aoj_3032_cpp | Problem G: Combine Two Elements
Problem
$N$個の非負整数のペア$(a_i, b_i)$と非負整数$A$, $B$ が与えられる。
以下のいずれかの操作をできるだけたくさん行いたい。
$|a_i - b_i| \leq A$ または $B \leq |a_i - b_i| \leq 2A$を満たす要素$i$を取り出し、削除する
$|(a_i + a_j) - (b_i + b_j)| \leq A$ または $B \leq |(a_i + a_j) - (b_i + b_j)| \leq 2A$ を満たす要素$i$と要素$j$ ($i \neq j$)の組を取り出し、削除する
最大の操作回数を求めよ。
Input
入力は以下の形式で与えられる。
$N$ $A$ $B$
$a_1$ $b_1$
$a_2$ $b_2$
...
$a_N$ $b_N$
入力はすべて整数で与えられる。
1行目に$N$,$A$,$B$が空白区切りで与えられる。
2行目以降の$N$行に$i$個目のペア$a_i$と$b_i$($1 \leq i \leq N$)が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq N \leq 800 $
$0 \leq A, B \leq 10^5 $
$0 \leq a_i, b_i \leq 10^5$
$A \leq B$ かつ $B \leq 2A$
Output
最大の操作回数を1行に出力せよ。
Sample Input 1
5 3 5
7 2
13 1
1 1
2 9
2 4
Sample Output 1
4
(7,2)を選んで削除する。
(1,1)を選んで削除する。
(2,4)を選んで削除する。
(13, 1)と(2, 9)を選んで削除する。
以上のように操作すると４回操作することができ、これが最大となる。
Sample Input 2
10 7 12
34 70
36 0
12 50
76 46
33 45
61 21
0 1
24 3
98 41
23 84
Sample Output 2
5 | [
{
"submission_id": "aoj_3032_5853683",
"code_snippet": "// #include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <utility>\n#include <vector>\n\ntemplate <int M>\nstruct MInt {\n unsigned int val;\n MInt(): val(0) {}\n MInt(long long x) : val(x >= 0 ?... |
aoj_3030_cpp | Problem E: Light
Problem
$W \times H$ の二次元のマス上に$N$個の街灯がある。
がっちょ君は$(1,1)$からスタートして$(W,H)$に行きたい。
がっちょ君は暗いところが怖いので、街灯により明るくなっているマスしか歩きたくない。
最初、すべての街灯はその街灯のあるマスのみを明るくしている。
そこで、がっちょ君は好きな街灯$i$に対してコスト$r_i$を設定することにした。なお、コストを設定しない街灯があってもよい。
街灯$i$はコスト$r_i$を消費することにより、その街灯を中心にマンハッタン距離で$r_i$以内の範囲を明るくすることができる。ただしコストは正の整数とする。
がっちょ君は上下左右のいずれかの方向に隣接するマスに移動する事ができる。
がっちょ君は$r_i$の合計値を最小になるように設定することにした。そのときの合計値を求めよ。
2つの地点 $(a,b)$ と $(c,d)$ 間のマンハッタン距離は $|a−c|$+$|b−d|$ で表される。
Input
入力は以下の形式で与えられる。
$W$ $H$ $N$
$x_1$ $y_1$
...
$x_N$ $y_N$
入力はすべて整数で与えられる。
1行目に$W$と$H$と$N$が空白区切りで与えられる。
続く$N$行に街灯$i$の座標$($$x_i$,$y_i$$)$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq W \leq 500$
$1 \leq H \leq 500$
$1 \leq N \leq 100$
$1 \leq N \leq W \times H$
$1 \leq $$x_i$$ \leq W$
$1 \leq $$y_i$$ \leq H$
同じ座標に複数の街灯はない
Output
$r_i$の合計値の最小値を1行に出力せよ。
Sample Input 1
10 10 1
6 6
Sample Output 1
10
Sample Input 2
5 10 3
3 9
2 8
5 1
Sample Output 2
8
Sample Input 3
1 1 1
1 1
Sample Output 3
0 | [
{
"submission_id": "aoj_3030_4462499",
"code_snippet": "#include <bits/stdc++.h>\n#include <algorithm>\n#include <cmath>\n#include <set>\n#include <cstdio>\n#include <vector>\n#include <iostream>\n#include <utility>\n#include <queue>\n#include <map>\n#include <complex>\n#define fir first\n#define sec second... |
aoj_3033_cpp | Problem H: Hth Number
Problem
長さ$N$の文字列$S$がある。$S$に含まれる文字はすべて0以上9以下の数字である。
$S$のすべての部分文字列から作られる数を全列挙してできた項数$\frac{N\times(N+1)}{2}$の数列を作った時、
その数列の中で$H$番目に小さい値を求めよ。
Input
入力は以下の形式で与えられる。
$N$ $H$
$S$
入力はすべて整数で与えられる。
1行目に$N$と$H$が空白区切りで与えられる。
2行目に長さ$N$の文字列$S$が与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq N \leq 10^5$
$1 \leq H \leq \frac{N \times (N+1)}{2}$
$|S| = N$
$S$に含まれる文字はすべて0, 1, 2, 3, 4, 5, 6, 7, 8, 9のいずれかである
Output
$H$番目の値を1行に出力せよ。
(出力の先頭に余計な0は含んではならない。)
Sample Input 1
2 3
00
Sample Output 1
0
Sample Input 2
4 9
0012
Sample Output 2
12
Sample Input 3
5 13
10031
Sample Output 3
100
Sample Input3の場合、10031の部分文字列から作られる数は以下の通りである。
1, 0, 0, 3, 1
10, 00, 03, 31
100, 003, 031
1003, 0031
10031
これらをを小さい順に並べると
0, 0, 0, 1, 1, 3, 3, 3, 10, 31, 31, 31, 100, 1003, 10031 になり、13番目に小さい値は100である。 | [
{
"submission_id": "aoj_3033_4218303",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\... |
aoj_3034_cpp | Problem I: Explosion
Problem
大魔王めぐみんは地上に生存する$N$人の勇者を倒そうと考えている。
めぐみんは$M$回まで爆発魔法を唱えることができる。
爆発魔法は任意の座標を中心に半径$r$以内に存在している勇者を消滅させる魔法である。
勇者はとても痩せているため大きさは考慮しなくてよい。
$M$回の爆発魔法は全て同じ大きさの半径で唱えるものとする。
勇者を全滅させるのに必要最小限の半径の魔法を使うことにした。
爆発魔法の半径の大きさを最小化せよ。
Input
$N$ $M$
$x_1$ $y_1$
...
$x_N$ $y_N$
入力は以下の形式で与えられる。
1行目に 勇者の数 $N$ 、唱える爆発の数 $M$ が整数で与えられる。
2行目以降にそれぞれの勇者$i$の座標 $x_i$ $,$ $y_i$ が整数で与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq M \leq N \leq 14$
$0 \leq x_i $,$ y_i \leq 10^5$
Output
爆発魔法の半径の最小値を実数で出力せよ。
$10^{-3}$を超える絶対誤差を含んではならない。
Sample Input 1
5 2
0 0
5 5
10 10
100 100
200 200
Sample Output 1
70.710678118755
Sample Input 2
10 5
321 675
4312 6534
312 532
412 6543
21 43
654 321
543 0
32 5
41 76
5 1
Sample Output 2
169.824909833728
Sample Input 3
14 3
312 342
4893 432
321 4
389 4
23 543
0 0
1 1
2 2
432 12
435 32
1 5
2 10
100 100
20 50
Sample Output 3
218.087711712613
Sample Input 4
5 2
0 0
0 0
0 0
0 0
0 0
Sample Output 4
0.000000000001 | [
{
"submission_id": "aoj_3034_10198826",
"code_snippet": "// AOJ #3034\n// Explosion 2025.2.6\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nstruct Point { double x, y; };\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n vector<Point> pts(N);\n ... |
aoj_3036_cpp | Problem K: Move on Ice
Problem
ペンギンのフロロは無限に広い氷の上のマス($sx$,$sy$)にいる。
マス($tx$,$ty$)に穴があり、そこから水に入ることができる。
氷の上に$n$個の氷の塊があり、それぞれマス($x_i$,$y_i$)にある。
フロロは上下左右の4方向に移動できる。
氷の上は滑りやすいので、移動すると氷の塊にぶつかるまで動き続ける。
氷の塊にぶつかると氷の塊のあるマスの1マス手前で止まる。
穴のマスを通過することで穴に入ることができる。
フロロは1度だけ全力で踏ん張ることにより途中で止まることができる。
氷の塊にぶつかると痛いのでできるだけぶつかる回数を少なくしたい。
穴のあるマス($tx$,$ty$)へ移動するまでにぶつかる回数の最小値を求めよ。
辿り着けない場合は$-$1を出力せよ。
Input
入力は以下の形式で与えられる。
$sx$ $sy$
$tx$ $ty$
$n$
$x_1$ $y_1$
...
$x_n$ $y_n$
入力はすべて整数で与えられる。
1行目にフロロがいるマスの座標が空白区切りで与えられる。
2行目に穴があるマスの座標が空白区切りで与えられる。
3行目に氷の塊の数$n$が与えられる。
続く$n$行目に氷の塊があるマスの座標が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$0 \leq n \leq 10^5$
$0 \leq sx$,$sy$,$tx$,$ty$,$x_i$,$y_i \leq 10^9$
与えられる座標はすべて異なる
Output
穴に移動するまでにぶつかる回数の最小値を出力せよ。
辿り着けない場合は$-$1を出力せよ。
Sample Input 1
0 0
13 33
2
0 34
14 0
Sample Output 1
0
Sample Input 2
0 1
5 0
4
2 1
1 3
4 2
3 0
Sample Output 2
4
Sample Input 3
0 0
0 2
1
0 1
Sample Output 3
-1 | [
{
"submission_id": "aoj_3036_5734075",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\ntypedef pair<int,int> P;\ntypedef pair<int,P> PP;\nint dx[4]={0,-1,0,1},dy[4]={-1,0,1,0},INF=1e9+7;\nint d[111111][4],d2[11... |
aoj_3037_cpp | Problem L: Tree Fragments
Problem
あいちゃんは、$N$個の頂点と$N-1$本の辺からなる木$T$を持っている。各頂点には$1$から$N$までの番号と、正の整数の重みがついている。
次の$Q$回のクエリに順に答えよ。
$1 \le a_i,b_i \le N$($a_i \ne b_i$)が与えられるので、$T$の$a_i$-$b_i$パス上の頂点とそれに接続する辺を取り除いてできる、いくつかの連結成分の中で、重みが最大となる連結成分の重みを出力する。そのような連結成分が1つもない場合、0と出力する。
ただし、連結成分の重みはその連結成分に含まれる頂点の重みの和で定義される。
Input
入力は以下の形式で与えられる。
$N$
$w_1$ $w_2$ ... $w_N$
$u_1$ $v_1$
$u_2$ $v_2$
...
$u_{N-1}$ $v_{N-1}$
$Q$
$a_1$ $b_1$
$a_2$ $b_2$
...
$a_Q$ $b_Q$
入力はすべて整数で与えられる。
1行目に$T$の頂点数$N$が与えられる。
2行目に頂点$i$($1 \le i \le N$)の重み$w_i$が空白区切りで与えられる。
3行目以降の$N$-1行に辺$_i$($1 \le i \le N-1$)の端点$u_i,v_i$が空白区切りで与えられる。
$N$+2行目にクエリの数$Q$が与えられる。
$N$+3行目以降の$Q$行に、クエリ$_i$($1 \le i \le Q$)を表す$a_i,b_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$2 \le N \le 10^5$
$1 \le Q \le 10^5$
$1 \le w_i \le 10^8$($1 \le i \le N$)
$1 \le u_i,v_i \le N$($1 \le i \le N-1$)
$u_i \ne v_i$
$i \ne j$なら$(u_i,v_i) \ne (u_j,v_j)$かつ$(u_i,v_i) \ne (v_j, u_j)$
$1 \le a_i,b_i \le N$($1 \le i \le Q$)
$a_i \ne b_i$
Ouput
クエリ毎に、0または重みが最大となる連結成分の重みを1行に出力する。
Sample Input 1
10
1 2 3 4 5 6 7 8 9 10
1 2
2 3
3 4
3 5
2 6
6 7
2 8
8 9
8 10
3
3 8
7 1
7 10
Sample Output 1
13
27
12
Sample Input 2
5
1 2 3 4 5
1 2
2 3
3 4
4 5
3
1 2
1 5
2 4
Sample Output 2
12
0
5
Sample Input 3
15
3 8 4 2 6 5 1 2 10 3 4 2 6 1 1
1 2
2 3
3 4
3 5
2 6
6 7
6 8
1 9
9 10
10 11
10 12
9 13
13 14
13 15
5
1 1
2 7
6 10
1 15
3 4
Sample Output 3
28
30
12
28
46 | [
{
"submission_id": "aoj_3037_10422763",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst long long LOG = 20;\n\nstruct Node {\n long long m1, m2, m3;\n};\n\nvector<vector<long long>> parent, max_up;\nvector<long long> p, par, glub, maxb;\nvector<Node> mxs;\n\nvoid dfs(long long ... |
aoj_3041_cpp | Problem C: Round And Round
Problem
長さ$N$の数列$A=${$a_{1},a_{2},a_{3},...,a_{n}$}が与えられる。
$a_{i}$ ($i=1,2,3,...,n$)は、$i$で初期化されているものとする。
以下の二種類のクエリを合計$Q$回処理せよ。
数列$A$の先頭から$k$番目の要素の値を出力する。
数列$A$の先頭から$k$と$k+1$番目を境界に二つの数列をスワップする。
詳しくはサンプル入出力を参考にせよ。
Input
入力は以下の形式で与えられる。
$N$ $Q$
$query_1$
$query_2$
...
$query_Q$
各クエリは以下の二種類のいずれかの形式で与えられる。
クエリ$0$
$0$ $k$
数列$A$の先頭から$k$番目の要素の値を出力する。
クエリ$1$
$1$ $k$
数列$A$の先頭から$k$と$k+1$番目を境界に二つの数列をスワップする。
入力はすべて整数で与えられる。
$1$行目に$N$, $Q$が空白区切りで与えられる。
$2$行目以降の$Q$行にクエリが改行区切りで与えられる。
各クエリ内の数値は全て空白区切りである。
Constraints
入力は以下の条件を満たす。
$2 \leq N \leq 10^9 $
$1 \leq Q \leq 10^5 $
各クエリについて、入力は以下の条件を満たす。
クエリ$0$
$1 \leq k \leq N $
クエリ$1$
$1 \leq k \leq N-1 $
Output
各クエリ$1$に対し値を一行に出力せよ。
Sample Input 1
5 4
1 2
0 2
1 1
0 3
Sample Output 1
4
1
長さ$5$の数列$A=[1,2,3,4,5]$が与えられる
$1$番目のクエリで $[1,2,3,4,5]$ -> $[1,2] [3,4,5]$ -> $[3,4,5] [1,2]$ -> $[3,4,5,1,2]$ と数列が変化する。
$2$番目のクエリで先頭から$2$番目の要素の値である$4$を出力する。
$3$番目のクエリで $[3,4,5,1,2]$ -> $[3] [4,5,1,2]$ -> $[4,5,1,2] [3]$ -> $[4,5,1,2,3]$ と数列が変化する。
$4$番目のクエリで先頭から$3$番目の要素の値である$1$を出力する。
Sample Input 2
4 4
1 2
1 1
0 1
0 4
Sample Output 2
4
3
Sample Input 3
10 6
1 1
0 1
1 9
0 5
1 1
0 10
Sample Output 3
2
5
1 | [
{
"submission_id": "aoj_3041_10322854",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tll N,Q;\n\tcin>>N>>Q;\n\tll x=0;\n\tfor(int q=0;q<Q;q++){\n\t\tint t,k;\n\t\tcin>>t>>k;\n\t\tif(t==1){\n\t... |
aoj_3038_cpp | Problem M: Manhattan Bomb
Problem
2次元平面上に$n$個の爆弾がある。爆弾にはそれぞれ1から$n$までの番号が割り振られており、$i$番目の爆弾は座標$(x_i,y_i)$に存在している。
なお、どの爆弾も原点からのマンハッタン距離が等しいことが分かっている。
$i$番目の爆弾が爆発したとき、座標$(x_i,y_i)$からのマンハッタン距離が$r_i$以内の座標に存在している爆弾も連鎖的に爆発する。
$n$個の爆弾それぞれについて、その爆弾のみに着火した場合に、爆発せずに残る爆弾の個数を求めよ。
Input
$n$
$x_1$ $y_1$ $r_1$
$x_2$ $y_2$ $r_2$
...
$x_n$ $y_n$ $r_n$
入力はすべて整数で与えられる。
1行目に爆弾の個数$n$が与えられる。
続く$n$行のうち$i$行目には$i$番目の爆弾の情報を表す$x_i,y_i,r_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$2$ ≤ $n$ ≤ $2 \times 10^5$
$-10^9$ ≤ $x_i,y_i$ ≤ $10^9$
$1$ ≤ $r_i$ ≤ $10^9$
$|x_i|+|y_i| = |x_j|+|y_j|$ $( 1 ≤ i , j ≤ n )$
同じ座標に複数の爆弾が存在することはない
Output
$i$行目には$i$番目の爆弾のみに着火した場合に、爆発せずに残る爆弾の個数を出力せよ。
Sample Input 1
2
-1 -1 10
1 1 1
Sample Output 1
0
1
Sample Input 2
3
3 2 2
4 -1 4
1 -4 7
Sample Output 2
2
1
0 | [
{
"submission_id": "aoj_3038_3042316",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate <typename T,typename E>\nstruct SegmentTree{\n using F = function<T(T,T)>;\n using G = function<T(T,E)>;\n Int n;\n F f;\n G g;\n T ti;\n vector<T> dat;\n Segment... |
aoj_3042_cpp | Problem D: Gridgedge
Problem
左上が$(0, 0)$、 右下が$(R-1, C-1)$である$R \times C$マスのグリッドがある。あるマス($e$, $f$)にいるとき、そこから$(e+1, f)$, $(e-1, f)$, $(e, f+1)$, $(e, f-1)$, $(e, 0)$, $(e, C-1)$, $(0, f)$, $(R-1, f)$にはコスト$1$で移動できる。ただしグリッドの外に出ることはできない。マス$(a_i, a_j)$から$(b_i, b_j)$へ移動するとき、最短経路のコストと、最短経路の組み合わせの総数を$10^9 + 7$で割った余りを計算せよ。
ただし、経路の組み合わせは移動の方法によって区別するものとする。たとえば、現在地が$(100, 1)$ のとき、 $(100, 0)$に最短コストで行くには上記$(e, f-1)$か$(e, 0)$で行くことができるので、$2$通りと数える。
Input
入力は以下の形式で与えられる。
$R$ $C$ $a_i$ $a_j$ $b_i$ $b_j$
Constraints
入力は以下の条件を満たす。
$1 \le R, C \le 500$
$0 \le a_i, b_i \le R - 1$
$0 \le a_j, b_j \le C - 1$
与えられる入力は全て整数である。
Output
マス$(a_i, a_j)$から$(b_i, b_j)$へ移動するとき、最短経路のコストと、最短経路の組み合わせの総数を$10^9+7$で割った余りを空白区切りで$1$行に出力せよ。
Sample Input 1
2 2 0 0 1 1
Sample Output 1
2 8
Sample Input 2
1 1 0 0 0 0
Sample Output 2
0 1
Sample Input 3
1 10 0 0 0 9
Sample Output 3
1 1
Sample Input 4
5 5 0 0 4 4
Sample Output 4
2 2
Sample Input 5
421 435 196 169 388 9
Sample Output 5
43 917334776 | [
{
"submission_id": "aoj_3042_9616360",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N = 501;\nconst int P = N * N;\nconst int INF = 1e9 + 128;\nconst int MOD = 1e9 + 7;\n\nint d[P], cnt[P];\nvector<int> g[P];\n\nconst int dx[] = {1, -1, 0, 0};\nconst int dy[] = {0, 0, 1, -1... |
aoj_3045_cpp | Problem G: Painting
Problem
長さ$N$の数列$X$が与えられる。初期状態では$X$の要素は全て$0$である。加えて、$M$個の整数のペア$(A_i, B_i)$が与えられる。各ペアに対し以下の操作を行い、最終的な数列$X$を出力せよ。
整数$j$ $(1 \le j \le N)$に対し、$(A_i+j)$を$B_i$で割った余りを$X_j$に加える。
Input
入力は以下の形式で与えられる。
$N$ $M$
$A_1$ $B_1$
$A_2$ $B_2$
:
$A_M$ $B_M$
$1$行目に、与えられる数列の要素数$N$、ペアの数$M$が空白区切りで与えられる。
続く$M$行に、$i$番目のペア$(A_i, B_i)$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$1 \le N, M \le 10^5$
$0 \le A_i < B_i \le 10^9 (1 \le i \le M)$
与えられる入力は全て整数である
Output
操作後の数列を$N$行で出力せよ。$j$行目に$X_j$を出力せよ。
Sample Input 1
5 3
1 4
3 7
0 1000
Sample Output 1
7
10
9
5
8
Sample Input 2
14 12
1 4
2 3
0 5
1 4
1 2
0 8
0 2
0 10
0 1
0 8
3 10
1 10
Sample Output 2
15
24
25
31
35
44
32
25
24
15
16
25
31
40 | [
{
"submission_id": "aoj_3045_6012364",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <string>\n#include <cstdlib>\n#include <sstream>\n#include <queue>\n#include <map>\nusing namespace std;\ntypedef long long ll;\ntypedef unsign... |
aoj_3046_cpp | Problem H: Loss
Problem
あなたは、とある会社からプログラムの作成を依頼された。
その会社には$N$個の仕事があり、それぞれの仕事には$1$から$N$までの番号が振られている。
仕事$i$には、$M_i$個の前提となる仕事$X_{i,j}$が存在し、仕事$i$を前提となる仕事$X_{i,j}$よりも先に行うと、仕事$i$は多大な損失を被る。
そこであなたには、損失を被る仕事の数が最小となるような順番ですべての仕事を行ったときの損失を被った仕事の数を求めてもらいたい。
Input
入力は以下の形式ですべて整数で与えられる。
$N$
$M_1$ $X_{1,1}$ $X_{1,2}$ ... $X_{1,M_1}$
$M_2$ $X_{2,1}$ $X_{2,2}$ ... $X_{2,M_2}$
:
$M_N$ $X_{N,1}$ $X_{N,2}$ ...$X_{N,M_N}$
仕事の数$N$が$1$行に与えられる。
続く$N$行に前提となる仕事の情報が与えられる。$i+1$行目には仕事$i$の情報が空白区切りで与えられる。$M_i$は、仕事$i$の前提となる仕事の数、$X_{i,j}$は仕事$i$の前提となる仕事の番号を表している。
Constraints
入力は以下の条件を満たす。
$1 \le N \le 10^5$
$0 \le M_i \le N$
$M_i$の総和は$10^5$を超えない
$1 \le X_{i,j} \le min(i+1,N)$
Output
損失を被る仕事の数が最小になるような順番ですべての仕事を行ったとき、そのときの損失を被った仕事の数を一行に出力する。
Sample Input 1
2
1 1
0
Sample Output 1
1
仕事$1$のように前提となる仕事がその仕事自身となるような入力も存在する。
Sample Input 2
3
3 2 1 2
0
1 2
Sample Output 2
1
Sample Input 3
5
1 2
1 3
2 1 2
3 1 3 5
0
Sample Output 3
1
例えば、$3,2,1,5,4$の順に仕事を行うと損失を最小化できる。 | [
{
"submission_id": "aoj_3046_4405872",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100005\n\n\n... |
aoj_3044_cpp | Problem F: Timing
Problem
$N$頂点$M$辺の無向グラフが与えられる。各頂点には相異なる$1$から$N$までの番号が定められている。あなたは時刻$0$に頂点$S$を出発し、頂点$G$まで移動したい。各辺にはパラメータ$a, b$が設定されていて、時刻$t$にその辺の片側の頂点から出発した場合、もう片側の頂点には時刻$t+ceil\left(\cfrac{b}{t+a}\right)$に到達することがわかっている。ここで、$ceil(x)$は$x$以上の最小の整数を表す。また、各頂点では任意の非負整数時間を余分に消費することができる。つまり、時刻$t$にある頂点にいるとき、任意の非負整数$k$を選び、時刻$t+k$になるまで待機することができる。最速最強アルゴリズマーを目指すあなたは、頂点$S$から頂点$G$まで移動するためにかかる時間の最小値を求めたくなった。
Input
入力は以下の形式で与えられる。
$N$ $M$ $S$ $G$
$U_1$ $V_1$ $A_1$ $B_1$
$U_2$ $V_2$ $A_2$ $B_2$
:
$U_M$ $V_M$ $A_M$ $B_M$
$1$行目に、与えられるグラフの頂点数$N$、辺数$M$、スタートの頂点番号$S$、ゴールの頂点番号$G$が空白区切りで与えられる。
続く$M$行に、各辺の情報が空白区切りで与えられる。$i$行目の情報は、頂点$U_i$と頂点$V_i$の間に$(a, b) = (A_i, B_i)$であるような辺が存在することを表す。
Constraints
入力は以下の条件を満たす。
$1 \le N, M \le 2 \times 10^5$
$1 \le S, G \le N$, $S \neq G$
$1 \le U_i, V_i \le N$, $U_i \neq V_i (1 \le i \le M)$
$1 \le A_i, B_i \le 10^{15} (1 \le i \le M)$
与えられる入力は全て整数である
Output
頂点$S$から頂点$G$まで移動するためにかかる時間の最小値を出力せよ。頂点$S$から頂点$G$に移動できない場合は、代わりに$-1$を出力せよ。
Sample Input 1
2 1 1 2
1 2 1 100
Sample Output 1
19
頂点$1$で時間を$9$消費し、時刻$9$に辺$1$を使うと、辺の所要時間は$ceil\left(\cfrac{100}{10}\right) = 10$となり、時刻$19$に頂点$2$に到達できる。これが最短である。
Sample Input 2
2 1 1 2
1 2 50 100
Sample Output 2
2
時刻$0$に辺$1$を使うのが最適である。
Sample Input 3
3 1 1 3
1 2 1 1
Sample Output 3
-1
頂点$S$から頂点$G$に移動できない場合もある。
Sample Input 4
3 3 1 3
1 2 1 1
2 3 1 6
2 3 50 100
Sample Output 4
3
Sample Input 5
3 3 1 3
1 2 10 100
2 3 1 6
2 3 50 100
Sample Output 5
11 | [
{
"submission_id": "aoj_3044_10853067",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int N = 2e5 + 1;\nvector<pair<int, pair<ll, ll> > > g[N];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m, S, G;\n cin >> n >> m >> ... |
aoj_3047_cpp | Problem I: Shiritori
Problem
ここに文字列のリストがある。息抜きに、しりとりをして遊ぶことにしよう。しりとりは、以下のルールで行われる。
まず最初に、リストの中から好きな文字列を一つ選び、その文字列をリストから除外する。
続いて、一つ前に選んだ文字列の最後の一文字が、最初の一文字である文字列をリストから一つ選ぶ。
選んだ文字列をリストから除外する。
この後、2., 3.を交互に繰り返すことになる。
さて、このしりとりを2.でリストから選べる文字列がなくなるまで続けたとしよう。
このときに、最後に選んだ文字列の「最後の一文字」としてあり得る文字をすべて列挙したい。
Input
$N$
$s_1$
$s_2$
$s_3$
:
$s_N$
一行目に、文字列の数$N$が与えられる。
続く$N$行に、文字列のリストが与えられる。
Constraints
入力は以下の条件を満たす。
$1 \le N \lt 10^4$
$1 \le |s_i| \lt 100$
$s_i \neq s_j (i \neq j)$
文字列には、英小文字のみ含まれる
Output
最後に選んだ文字列の「最後の一文字」としてあり得る文字をaからzの順で辞書順で昇順に出力せよ。
Sample Input 1
5
you
ate
my
hum
toast
Sample Output 1
e
t
u
この時、以下のような場合がアウトプット例となる。
ate(1つの文字列のみ)
toast
hum - my - you
また、m,yで終わるパターンは存在しない。
Sample Input 2
7
she
sells
sea
shells
by
the
seashore
Sample Output 2
a
e
y | [
{
"submission_id": "aoj_3047_9258323",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\nt... |
aoj_3049_cpp | Problem K: A Polygon And Circles
Problem
$N$個の頂点からなる凸多角形と$M$個の円の中心座標が与えられる。すべての円の半径は$r$である。
以下の条件を満たす最小の実数$r$を求めたい。
条件: 凸多角形の内部のどの点も、少なくとも一つ以上の円に内包されている。
Input
入力は以下の形式ですべて整数で与えられる。
$N$
$px_1$ $py_1$
$px_2$ $py_2$
:
$px_N$ $py_N$
$M$
$cx_1$ $cy_1$
$cx_2$ $cy_2$
:
$cx_M$ $cy_M$
$1$行目には凸多角形の頂点数を表す整数$N$が与えられる。
$2$行目から$2+N-1$行目には凸多角形の各頂点の情報が反時計周りの順で与えられる。$1+i$行目には$i$番目の頂点の座標を表す$px_i$ $py_i$が空白区切りで与えられる。
$2+N$行目には円の数を表す整数$M$が与えられる。
$2+N+1$行目から$2+N+M$行には円の中心座標の情報が与えられる。$2+N+i$行目には$i$番目の円の中心座標を表す$cx_i$ $cy_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$3 \le N \le 100$
$1 \le M \le 100$
$-10^5 \le px_i, py_i \le 10^5$
$-10^5 \le cx_i, cy_i \le 10^5$
凸多角形の頂点のうちどの3点を選んでも、同一直線上には存在しない
Output
条件を満たす最小の円の半径 $r$ を出力する。
ただし、$10^{-5}$ までの絶対誤差または相対誤差は許容される。
Sample Input 1
4
2 3
1 2
2 1
3 2
4
1 3
1 1
3 3
3 1
Sample Output 1
1.414213562373
Sample Input 2
7
-96469 25422
-55204 -45592
-29140 -72981
98837 -86795
92303 63297
19059 96012
-67980 70342
17
-4265 -14331
33561 72343
52055 98952
-71189 60872
10459 -7512
-11981 57756
-78228 -28044
37397 -69980
-27527 -51966
22661 -16694
13759 -59976
86539 -47703
17098 31709
-62497 -70998
-57608 59799
-1904 -35574
-73860 121
Sample Output 2
75307.220122044484 | [
{
"submission_id": "aoj_3049_3159241",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#inc... |
aoj_3035_cpp | Problem J: Matrix
Problem
長さ$H$の数列$A$と長さ$W$の数列$B$が与えられる。
$H$行$W$列からなる行列$C$を以下のように定義する。
$ C_{i,j} = A_i \times B_j (1 \leq i \leq H, 1 \leq j \leq W) $
以下の四種類のクエリを合計$Q$回処理せよ。
クエリ1
$1$ $a$ $b$ $v$
$ A_i ( a \leq i \leq b) $に$v$を加える
クエリ2
$2$ $c$ $d$ $v$
$ B_j ( c \leq j \leq d) $に$v$を加える
クエリ3
$3$ $a$ $b$ $c$ $d$
$ C_{i,j} ( a \leq i \leq b, c \leq j \leq d) $の最小値とその個数を出力する
クエリ4
$4$ $a$ $b$ $c$ $d$
$ C_{i,j} ( a \leq i \leq b, c \leq j \leq d) $の最大値とその個数を出力する
詳しくはサンプル入出力を参考にせよ。
Input
入力は以下の形式で与えられる。
$H$ $W$ $Q$
$A_1$ $A_2$ ... $A_H$
$B_1$ $B_2$ ... $B_W$
$query_1$
$query_2$
...
$query_Q$
各クエリは以下の四種類のいずれかの形式で与えられる。
$1$ $a$ $b$ $v$
$2$ $c$ $d$ $v$
$3$ $a$ $b$ $c$ $d$
$4$ $a$ $b$ $c$ $d$
入力はすべて整数で与えられる。
1行目に$H$, $W$, $Q$が空白区切りで与えられる。
2行目に数列$A$の要素$A_i$($1 \leq i \leq H$)が空白区切りで与えられる。
3行目に数列$B$の要素$B_j$($1 \leq j \leq W$)が空白区切りで与えられる。
4行目以降の$Q$行にクエリが改行区切りで与えられる。
各クエリ内の数値は全て空白区切りである。
Constraints
入力は以下の条件を満たす。
$1 \leq H, W, Q\leq 10^5 $
$-1000 \leq A_i \leq 1000 $
$-1000 \leq B_j \leq 1000 $
各クエリについて、入力は以下の条件を満たす。
$1 \leq a \leq b \leq H$
$1 \leq c \leq d \leq W$
$-1000 \leq v \leq 1000$
Output
各クエリ3及びクエリ4について、値と個数を空白区切りで一行に出力せよ。
Sample Input 1
4 4 7
1 2 3 4
1 2 3 4
3 2 3 2 3
4 2 3 2 3
3 1 1 1 1
4 1 1 1 1
1 1 1 1
3 1 4 1 2
4 2 3 2 4
Sample Output 1
4 1
9 1
1 1
1 1
2 2
12 1
クエリ1, 2で指定されている範囲は以下の画像の緑色に塗られた領域である。
クエリ3, 4で指定されている範囲は以下の画像の橙色に塗られた領域である。
クエリ5によって$A_1$に1が加えられる。
クエリ6で指定されている範囲は以下の画像の水色に塗られた領域である。
クエリ7で指定されている範囲は以下の画像の紫色に塗られた領域である。
Sample Input 2
4 4 6
1 1 1 1
1 1 1 1
3 1 4 1 4
4 1 4 1 4
1 2 3 1
2 2 3 1
3 1 4 1 4
4 1 4 1 4
Sample Output 2
1 16
1 16
1 4
4 4
初期状態の$C$は以下のようになる。
クエリ3, 4以後の$C$は以下のようになる。
Sample Input 3
4 4 7
0 1 0 1
1 0 1 0
3 2 4 1 3
4 1 4 1 4
1 1 4 -1
3 1 3 1 3
1 3 3 2
2 3 3 -2
3 2 4 2 4
Sample Output 3
0 5
1 4
-1 4
-1 1
Sample Input 4
36 4 20
-523 -460 -536 -885 652 782 513 -558 -521 -808 124 -708 -943 52 -856 -755 -958 913 380 -767 373 -731 -492 213 538 392 -39 509 -840 135 78 -285 -241 522 -572 -915
-691 -16 812 -385
4 7 17 4 4
3 24 33 1 1
4 3 35 2 4
3 28 32 4 4
2 3 3 438
3 7 15 1 1
4 2 17 4 4
3 24 28 2 4
4 15 16 4 4
4 18 29 1 1
3 24 27 2 4
2 2 3 -828
3 18 23 3 3
1 27 31 -701
2 2 3 298
1 21 32 237
2 3 3 -71
1 14 29 772
4 13 19 3 3
3 19 34 1 2
Sample Output 4
368830 1
-371758 1
741356 1
-195965 1
-354483 1
368830 1
-207130 1
329560 1
580440 1
-207130 1
-323674 1
1093565 1
-1068977 1 | [
{
"submission_id": "aoj_3035_10322807",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\n\n#include<atcoder/lazysegtree>\nusing namespace atcoder;\n\nstruct S{\n\tll v,n;\n};\n\nS opm(S a,S b){\n\tif(a.v==b.v){\n\t\ta.n+=b.n;\n\t\treturn a;\n\t}\n\telse if(a.v<b.v)return... |
aoj_3048_cpp | Problem J: Averaging
Problem
アイヅ国には$N$個の島と$N-1$個の橋があり、各島はそれぞれ$1$から$N$までの番号が割り振られている。
$i$番目の橋は島$u_i$と島$v_i$を双方向に結んでおり、島民は橋を用いて島と島とを行き来することができる。また、橋以外に島と島を行き来する方法はない。
どの島からどの島へもいくつかの橋を渡ることで到達することができる。
現在、島$i$には$X_i$人の島民がいる。
各島の環境への負荷を分散させるためにアイヅ国は何人かの国民に別の島へ引越してもらうことにした。
島$a$に住んでいる人を島$b$に引越しさせるためには島$a$と島$b$の距離と同じ分のコストがかかる。ただし、島$a$と島$b$の距離は島$a$から島$b$へ行くために渡る必要のある橋の数の最小値で定義される。
どの$2$つの島を選んでもそれらの島民の人数の差の絶対値が$1$以下になるように国民に引越してもらいたい。
このとき、必要なコストの総和の最小値を求めよ。
Input
入力は以下の形式ですべて整数で与えられる。
$N$
$X_1$ $X_2$ ... $X_N$
$u_1$ $v_1$
$u_2$ $v_2$
...
$u_{N-1}$ $v_{N-1}$
$1$行目に島の数$N$が与えられる。
$2$行目には各島の島民の人数を表す$N$個の整数が空白区切りで与えられる。$i$番目の整数$X_i$は島$i$の島民の人数を表す。
$3$行目から続く$N-1$行には各橋がつなぐ島の番号が空白区切りで与えられる。$2+i$行目の入力では、$i$番目の橋が島$u_i$と島$v_i$を双方向に結んでいることを表す。
Constraints
入力は以下の条件を満たす。
$2 \le N \le 5000$
$0 \le X_i \le 10^9$
$1 \le u_i, v_i \le N$
どの島からどの島へもいくつかの橋を渡ることで到達することができる
Output
コストの総和の最小値を1行に出力せよ。
Sample Input 1
5
4 0 4 0 0
1 2
1 3
1 4
2 5
Sample Output 1
7
島$1$の人が$1$人、島$2$へ、
島$1$の人が$1$人、島$5$へ、
島$3$の人が$2$人、島$4$へ引っ越すことでどの$2$つの島を選んでもそれらの島民の人数の差の絶対値が$1$以下になる。
またこのときのコストの総和は$1+2+2\times2 = 7$であり、これが最小である。
Sample Input 2
7
0 7 2 5 0 3 0
1 2
1 3
1 4
2 5
3 6
3 7
Sample Output 2
10 | [
{
"submission_id": "aoj_3048_6114054",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> Pi;\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define rrep(i,n) for(ll i... |
aoj_3050_cpp | Problem L: Tousa Tree
Problem
君は一昨日、友人のトウサから一つ、頼み事をされた。なんでも、木に等差数列を飾って誕生日パーティーに使いたいのだが、木が大きすぎて一人ではとてもできないのだという。そこで、優秀なプログラマである君に、効率的に木に等差数列を飾るプログラムを書いてもらいたいそうだ。君とトウサは旧知の親友である。君はトウサの頼み事を受けることにした。
飾り付けをする$N$ノードの木が与えられる。木のノードには$0$から$N-1$までの番号が振られている。最初、木のノードの点数は全て$0$である。プログラムは、以下の二つのクエリに対応しなければならない。
$0$.木の指定された区間のノードに書かれた点数の和を求める。
$1$.木の指定された区間のノードに等差数列を足す。
トウサの誕生日を祝うために、木を美しく飾ろう。
Input
入力は以下の形式で与えられる。
$N$ $Q$
$A_0$ $B_0$
$A_1$ $B_1$
:
$A_{N-2}$ $B_{N-2}$
$COM_0$
$COM_1$
:
$COM_{Q-1}$
木のノード数$N$とクエリの数$Q$が$1$行に与えられる。続いて$N-1$行に木の辺の情報が与えられる。$A_i$,$B_i$は、ノード$A_i$と$B_i$の間に直接辺があることを示している。その後、$Q$個の命令$COM_j$が与えられる。
$COM_j$の形式は以下の通りである。
$0$ $S$ $T$
$S$、$T$は頂点の番号である。区間の指定は二つのノードによって行われる。$S$から$T$までの最短経路が指定された区間である。区間に含まれているノードに書かれた点数の総和を報告する。ただし、$S$と$T$も区間に含む。答えは非常に大きくなることがあるので、$10^9+7$で割ったあまりを出力すること。
$1$ $S$ $T$ $K$ $M$
上と同じく、$S$と$T$で指定された区間に含まれているノードに点数を足す。足す点数は、$S$からの最短距離を$L$として、以下のように算出される。
$K+L{\times}M$
Constraints
入力は以下の条件を満たす。
入力はすべては整数
$1 \le N,Q \le 10^5$
$0 \le A,B,S,T \le N-1$
$0 \le K,M \le 10^5$
Output
$0$のクエリのとき、指定された区間に含まれているノードに書かれた点数の総和を一行に出力する。
Sample Input 1
3 3
0 2
1 2
1 1 0 0 1
0 0 2
0 0 1
Sample Output 1
3
3
まず、$1-2-0$の区間に初項$0$、公差$1$の数列を足す。ノードの点数は$0,1,2$の順に$2,0,1$となる。
次に、$0-2$の区間のノードの点数の和を出力する。$2+1=3$なので、$3$を出力する。
次に、$0-2-1$の区間のノードの点数の和を出力する。$2+1+0=3$なので、$3$を出力する。
Sample Input 2
5 6
1 0
2 0
3 2
4 1
1 1 4 0 4
0 4 1
1 3 0 7 3
0 2 2
1 4 1 8 0
0 4 2
Sample Output 2
4
10
43 | [
{
"submission_id": "aoj_3050_5996221",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define FORR(i,a,b) fo... |
aoj_3053_cpp | Problem C: Phone Number
Problem
株式会社ウクニキアの電話番、デンさんは毎日とても長い電話番号を電話に入力しています。
ある日余りにも疲れたデンさんは、疲れからか驚くべき考えに至りました。
「電話のボタンの配置を並べ替えたら少しでも楽できるのでは？！」
電話には$3 \times 3$で等間隔に区切られた正方形があり、9個のマスには並べ替えることのできる1から9までのボタンがそれぞれ1つずつついています。
電話番号を打つ際、デンさんは片手だけを使って、次の二つの操作を行うことができます。
人差し指を今触れているボタンに辺で隣接するいずれかのボタンに触れるように移動させる。
人差し指が触れているボタンを押す。
最初、人差し指は1から9までのいずれかのボタンに触れるように置くことができます。
デンさんは、最初のボタンを押してから最後のボタンを押し終わるまでの、人差し指の移動回数を最も小さくできる配置を効率的と考えています。
さて、ここに長さ$N$のお得意先の電話番号があります。
お得意先の電話番号だけ考えた時に、どのような配置が一番効率的でしょうか？
ボタンを並び替えることで、その配置を作ってください。
Input
入力は以下の形式で与えられる。
$N$
$S$
1行目にお得意先の電話番号の長さ$N$が与えられる。
2行目にお得意先の電話番号が1行に与えられる。
Constraints
入力は以下の条件を満たす。
$1 \leq N \leq 10^5 $
$S$は1から9までのいずれかの数字からなる文字列
Output
最も効率的な配置を、3行に空白を入れずに出力せよ。
但し、解答となり得る配置が複数ある場合は、左上の枠から
123
456
789
の順序で数字を並べた際に辞書順で最小となるようなものを出力せよ。
Sample Input 1
10
1236547896
Sample Output 1
123
456
789
Sample Input 2
11
31415926535
Sample Output 2
137
456
892 | [
{
"submission_id": "aoj_3053_10892714",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T... |
aoj_3056_cpp | Problem F: Equilateral Triangle
Problem
$N$個の頂点からなる凸多角形が与えられる。
その凸多角形の全ての頂点を含む正三角形を考えるとき、その正三角形の一辺の長さの最小値を求めよ。
Input
入力は以下の形式ですべて整数で与えられる。
$N$
$px_1$ $py_1$
$px_2$ $py_2$
$\vdots$
$px_N$ $py_N$
$1$行目には凸多角形の頂点数を表す整数$N$が与えられる。
続く$N$行には凸多角形の各頂点の情報が反時計周りの順で与えられる。
$1+i$行目には$i$番目の頂点の座標を表す$px_i$,$py_i$が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
$3 \le N \le 10000$
$-10^9 \le px_i, py_i \le 10^9$
凸多角形の頂点のうちどの3点を選んでも、同一直線上には存在しない
Output
条件を満たす正三角形の一辺の長さの最小値を出力せよ。
ただし、$10^{-5}$ までの絶対誤差または相対誤差は許容される。
Sample Input 1
4
2 3
1 2
2 1
3 2
Sample Output 1
3.04720672
Sample Input 2
7
-96469 25422
-55204 -45592
-29140 -72981
98837 -86795
92303 63297
19059 96012
-67980 70342
Sample Output 2
310622.35426197 | [
{
"submission_id": "aoj_3056_10891318",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = ... |
aoj_3055_cpp | Problem E: こたつがめを燃やさないで
Problem
こたつがめは甲羅がこたつの亀です。
こたつがめはぽきた(起床する事)途端、格子状の区画に区切られているステージに閉じ込められました。このステージには、ただ一つの出口があります。
区画は道、塀または爆弾のいずれかであり、こたつがめは上下左右に移動することで、道または爆弾の区画に侵入することができます。
斜めには移動できません。また、塀の区画は通ることができません。ステージの外にも道の区画が無限に広がっていますが亀の天敵であるワニがいる為、通る事はできません。
こたつがめはさっさと帰宅してねね(睡眠する事)を行いたいので、このステージの出口に向かおうと思いました。
こたつの赤外線を自在に操る事ができるこたつがめは、自身の周囲8区画を同時に道に変える能力を持っています。
しかし、その8区画と自身がいるいずれかの区画が爆弾の区画の場合、誘爆してこたつがめは炎上し、ねねどころか有名SNS「カメったー」すら出来なくなってしまうので能力を発動する事ができません。
例を図示します。イラストが配置されていない区画とこたつがめがいる区画は道の区画です。
こたつがめの周囲8区画とはオレンジ色の区画を指します。左の図ではこたつがめの周囲8区画、および自身がいる区画に爆弾の区画は含まれていない為、能力を発動できます。
しかし、右の図では周囲8区画、および自身がいる区画のいずれかに爆弾の区画が含まれている為、能力を発動する事ができません。
移動するコストは1区画の移動ごとに$A$、能力を発動するコストは1回あたり$B$です。道に変えた塀あたりのコストではない事に注意してください。開始地点とステージの出口は道です。
開始地点からステージの出口に着くまでの移動するコストと能力を発動するコストの合計の最小値を出力してください。ただし、ステージの出口に到達できない場合は代わりに"INF"と出力してください。
Input
入力は以下の形式で与えられる。
$H$ $W$ $A$ $B$
$c_{1,1} \cdots c_{1,W}$
$\vdots$
$c_{H,1} \cdots c_{H,W}$
入力は$H+1$行からなる。
$1$行目には上下の長さを表す整数$H$、左右の長さを表す整数$W$、移動するコストを表す整数$A$、能力を発動するコストを表す整数$B$がそれぞれ空白区切りで与えられる。
$2$行目からの$H$行には、こたつがめが閉じ込められたステージの各区画における状態$c_{i,j}$が与えられる。
$c_{i,j}$はそれぞれ's','g','.','#','*'のいずれかからなり、区画$(i,j)$が下記のような状態であることを表す。
's' : その区画が開始地点であることを表す。
'g' : その区画がステージの出口であることを表す。
'.' : その区画が道であることを表す。
'#' : その区画が塀であることを表す。
'*' : その区画が爆弾であることを表す。
Constraints
入力は以下の条件を満たす。
$1 \le H,W,A,B \le 1000$
$3 \le H+W$
$c_{i,j} \in${'s','g','.','#','*'}
's','g'はそれぞれ1回ずつ出現する
Output
開始地点からステージの出口に着くまでの移動するコストと能力を発動するコストの合計の最小値を出力してください。ただし、ステージの出口に到達できない場合は代わりに"INF"と出力してください。
Sample input 1
4 4 1 1
g#..
#...
.*..
...s
Sample output 1
7
Sample input 2
4 4 1 1
g#..
#*..
....
...s
Sample output 2
INF
Sample input 3
2 4 1 1
###g
s###
Sample output 3
6
Sample input 4
3 3 1 10
g..
##.
s..
Sample output 4
6
Sample input 5
3 3 10 1
g..
##.
s..
Sample output 5
21 | [
{
"submission_id": "aoj_3055_10892732",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T... |
aoj_3054_cpp | Problem D: Tunnel
Problem
横軸$x$、縦軸$y$の$xy$平面上に$n$個の長方形がある。$i$番目の長方形は、高さ$h_i$、幅$1$であり、頂点は点$(i-1, 0)$、点$(i-1, h_i)$、点$(i, h_i)$、点$(i, 0)$である。
あなたは$n$個の正の整数$y_1, y_2, ... y_n$を選び、以下の$n$回の操作を行う。
(1) 1回目の操作では、点$(0, 1)$と点$(1, y_1)$を結ぶ線分を引く。
(2) $i$回目$(2 \le i \le n)$の操作では、点$(i-1, y_{i-1})$と点$(i, y_i)$を結ぶ線分を引く。
$i$回目の操作に対し、$S_i$を以下のように定める。
$i$回目の操作で引いた線分の$x$座標が小さい方の端点をA、$x$座標が大きい方の端点をBとする。
また、点$(i-1, 0)$をC、点$(i-1, h_i)$をD、点$(i, h_i)$をE 、点$(i, 0)$をFとする。
台形ABFCと長方形DEFCの非共通部分の面積を$S_i$とする。
以下に５つの例を示す。
それぞれの例における$S_i$は星マークを含む領域の面積の合計である。
$S = S_1 + S_2 + … + S_n$を最小化するような$y_1, y_2, ... y_n$を求め、$S$の最小値を出力せよ。
Input
入力は以下の形式で与えられる。
$n$
$h_1$ $h_2$ $...$ $h_n$
入力はすべて整数で与えられる。
Constraints
入力は以下の条件を満たす。
$2 \leq n \leq 150 $
$1 \leq h_i \leq 150 $
Output
$S$の最小値を1行に出力せよ。
ただし、$10^{−5}$ までの絶対誤差または相対誤差は許容される。
Sample Input 1
2
5 3
Sample Output 1
2.83333333
Sample Input 2
3
6 1 4
Sample Output 2
6.25000000
Sample Input 3
7
3 1 9 2 2 5 1
Sample Output 3
12.37500000 | [
{
"submission_id": "aoj_3054_10892772",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T... |
aoj_3057_cpp | Problem G: First Kiss
Problem
ビット君の通う男子校では昼休みにキッポーゲームが行われている。
この学校のキッポーゲームは少し変わっていることで有名だ。
まず、$N$本のキッポーを用意する。$i$本目のキッポーの長さは$a_i$である。
先手と後手が交互にキッポーを食べる。
すごい長さのキッポーを一気に食べると喉に刺さってしまうので、$1$以上$D$以下の好きな長さだけ食べる。
彼らは不器用なので、整数長でのみキッポーを食べることができる。
最初にいずれかのキッポーが食べつくされたとき、食べきった人の負けとなる。
両者が最適に行動したとき、先手が勝つなら"First"、後手が勝つなら"Second"を出力せよ。
Input
入力は以下の形式で与えられる。
$N$ $D$
$a_1$ $a_2$ $...$ $a_N$
入力はすべて整数で与えられる。
Constraints
入力は以下の条件を満たす。
$1 \le N \le 3\times 10^5$
$1 \le D \le 10^9$
$1 \le a_i \le 10^9$
Output
両者が最適に行動したとき、どちらが勝つか出力せよ。
先手が勝つなら"First"、後手が勝つなら"Second"を出力せよ。
Sample Input 1
1 1
2
Sample Output 1
First
Sample Input 2
2 25
19 19
Sample Output 2
Second
Sample Input 3
3 5
10 8 4
Sample Output 3
First
Sample Input 4
4 10
3 8 5 2
Sample Output 4
Second | [
{
"submission_id": "aoj_3057_10892670",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T... |
aoj_3059_cpp | Problem I: Shuffle 2
Problem
$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が書かれている。この束に対して、以下のように定義されるシャッフルを$q$回行う。
束を下から見たとき、奇数番目のカードを上に重ねていって作られる束$x$、偶数番目のカードを上に重ねていって作られる束$y$を考える。その後以下の$2$つのうち、好きな操作を行う。
操作 $0$： 束$x$の上に束$y$をのせて$1$つの束にする。
操作 $1$： 束$y$の上に束$x$をのせて$1$つの束にする。
例えば、$6$枚のカードからなる束(下から123456)に対して$1$回のシャッフルを行うことを考えたとき、操作$0$を行った場合に得られる束は下から
246135
135246、操作$1$を行った場合に得られる束は下から
135246
246135である。(14:52修正)
$q$回のシャッフルの後、$k$の書かれたカードが束の下から$d$番目にあるようにしたい。
可能であるなら$q$回のシャッフルの操作を順番に出力し、不可能ならば$-1$を出力せよ。
Input
入力は以下の形式で与えられる。
$n$ $q$ $k$ $d$
Constraints
入力は以下の条件を満たす。
$2 \le n \le 10^{15}$
$1 \le q \le 10^6$
$1 \le k,d \le n$
$n$は偶数
Output
条件を満たすシャッフルが可能なら$q$行にシャッフルの操作を出力せよ。
不可能なら$-1$を出力せよ。
Sample Input 1
4 2 1 1
Sample Output 1
0
0
Sample Input 2
4 2 3 1
Sample Output 2
0
1
Sample Input 3
4 1 1 4
Sample Output 3
-1
Sample Input 4
7834164883628 15 2189823423122 5771212644938
Sample Output 4
0
1
1
1
1
1
0
1
0
1
0
0
0
0
0 | [
{
"submission_id": "aoj_3059_10892983",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nusing vl = vector<ll>;\ntemplate <class T> using vec = vector<T>;\ntemplate <class T> using vv = vec<vec<T>>;\ntemplate <class T... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.