\n#include <algorithm>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nbool check_surround(int x, int y, int p, int q, int r) {\n return (r*r > ((x-p)*(x-p)+(y-q)*(y-q)));\n}\n\nbool check_cross(int x1, int y1, int r1, int x2, int y2, int r2) {\n return ((r1-r2)*(r1-r2) <= ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) && ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= (r1+r2)*(r1+r2));\n}\n\nstruct Circle {\n Circle(int x, int y, int r, double dist_rat, double dist_Maki, int include) : x{x}, y{y}, r{r}, dist_rat{dist_rat}, dist_Maki{dist_Maki}, include{include} {}\n int x;\n int y;\n int r;\n double dist_rat;\n double dist_Maki;\n int include;\n};\n\nbool compare_rat(Circle &l, Circle &r) {\n if (l.dist_rat != r.dist_rat) return l.dist_rat < r.dist_rat;\n else return l.r < r.r;\n}\n\nbool compare_Maki(Circle &l, Circle &r) {\n if (l.dist_Maki != r.dist_Maki) return l.dist_Maki < r.dist_Maki;\n else return l.r < r.r;\n}\n\nint main() {\n int N;\n while (cin >> N && N > 0) {\n vector<Circle> rat_data;\n vector<Circle> Maki_data;\n int xs,ys,xt,yt;\n cin >> xs >> ys >> xt >> yt;\n for (int i=0; i<N; ++i) {\n int x,y,r;\n cin >> x >> y >> r;\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\n if (!check_surround(x,y,xt,yt,r)) {\n Circle d(x,y,r,r-sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt))-r,1);\n rat_data.push_back(d);\n }\n else if (!check_surround(x,y,xs,ys,r)) {\n Circle d(x,y,r,sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),r-sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt)),1);\n Maki_data.push_back(d);\n }\n }\n }\n sort(rat_data.begin(), rat_data.end(), compare_rat);\n sort(Maki_data.begin(), Maki_data.end(), compare_Maki);\n for (int i=0; i<rat_data.size(); ++i) {\n for (int j=0; j<i; ++j) {\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\n }\n }\n }\n for (int i=0; i<Maki_data.size(); ++i) {\n for (int j=0; j<i; ++j) {\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\n }\n }\n }\n int max = 0;\n if (rat_data.size() == 0) {\n if (Maki_data.size() == 0) {\n max = 0;\n } else {\n for (int i=0; i<Maki_data.size(); ++i) {\n if (max < Maki_data[i].include)\n max = Maki_data[i].include;\n }\n }\n } else {\n if (Maki_data.size() == 0) {\n for (int i=0; i<rat_data.size(); ++i) {\n if (max < rat_data[i].include)\n max = rat_data[i].include;\n }\n } else {\n for (int i=0; i<rat_data.size(); ++i) {\n if (max < rat_data[i].include)\n max = rat_data[i].include;\n }\n for (int i=0; i<Maki_data.size(); ++i) {\n if (max < Maki_data[i].include)\n max = Maki_data[i].include;\n }\n for (int i=0; i<rat_data.size(); ++i) {\n for (int j=0; j<Maki_data.size(); ++j) {\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\n if (max < (rat_data[i].include + Maki_data[j].include))\n max = rat_data[i].include + Maki_data[j].include;\n }\n }\n }\n }\n }\n cout << max << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3428,"score_of_the_acc":-0.073,"final_rank":7},{"submission_id":"aoj_2181_6252706","code_snippet":"#include <algorithm>\n#include <complex>\n#include <iostream>\n#include <vector>\nusing namespace std;\nusing xy_t = complex<double>;\nconst double EPS = 1e-10;\nint n;\nxy_t s, t;\n\nstruct Circle {\n xy_t c;\n double r;\n Circle() {}\n Circle(double x, double y, double _r)\n : c{x, y}, r(_r) {}\n bool in_circle(const xy_t &p) const {\n return abs(p - c) + EPS <= r;\n }\n bool in_circle(const Circle &other) const {\n return abs(other.c - c) + other.r + EPS <= r;\n }\n};\n\nvector<int> can_include_circles(const vector<Circle> &crc) {\n vector<int> dp(crc.size());\n for(size_t i = 0; i < crc.size(); i++) {\n dp[i] = 1;\n for(size_t j = 0; j < i; j++) {\n if(crc[i].in_circle(crc[j]) && dp[j] + 1 > dp[i]) {\n dp[i] = dp[j] + 1;\n }\n }\n }\n return dp;\n}\n\nbool corss(const Circle &x, const Circle &y) {\n return x.r + y.r + EPS >= abs(x.c - y.c) && abs(x.r - y.r) <= abs(x.c - y.c) + EPS;\n}\n\nint solve() {\n {\n double sx, sy, tx, ty;\n cin >> sx >> sy >> tx >> ty;\n s = {sx, sy};\n t = {tx, ty};\n }\n vector<Circle> crcS, crcT;\n for(int i = 0; i < n; i++) {\n double x, y, r;\n cin >> x >> y >> r;\n Circle crc = {x, y, r};\n if(crc.in_circle(s)) {\n if(!crc.in_circle(t)) {\n crcS.push_back(crc);\n }\n } else {\n if(crc.in_circle(t)) {\n crcT.push_back(crc);\n }\n }\n }\n auto comp = [](Circle &x, Circle &y) {\n return x.r < y.r;\n };\n sort(begin(crcS), end(crcS), comp);\n sort(begin(crcT), end(crcT), comp);\n vector<int> dpS = can_include_circles(crcS),\n dpT = can_include_circles(crcT);\n int ans = 0;\n if(!dpS.empty()) ans = max(ans, *max_element(begin(dpS), end(dpS)));\n if(!dpT.empty()) ans = max(ans, *max_element(begin(dpT), end(dpT)));\n\n for(size_t i = 0; i < crcS.size(); i++) {\n for(size_t j = 0; j < crcT.size(); j++) {\n if(!corss(crcS[i], crcT[j])) {\n ans = max(ans, dpS[i] + dpT[j]);\n }\n }\n }\n return ans;\n}\n\nint main() {\n vector<int> ans;\n while(1) {\n cin >> n;\n if(n == 0) break;\n ans.push_back(solve());\n }\n for(const auto &i : ans) cout << i << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3604,"score_of_the_acc":-0.1273,"final_rank":12},{"submission_id":"aoj_2181_6021299","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n while(cin >> n,n){\n int sx,sy,tx,ty; cin >> sx >> sy >> tx >> ty;\n vector<int> vx,vy,vr;\n vector<int> va,vb;\n for(int i=0;i<n;i++){\n int x,y,r; cin >> x >> y >> r;\n bool f1 = ((x-sx)*(x-sx) + (y-sy)*(y-sy) < r*r);\n bool f2 = ((x-tx)*(x-tx) + (y-ty)*(y-ty) < r*r);\n if(f1 and !f2){\n int j = vx.size();\n va.push_back(j);\n vx.push_back(x);\n vy.push_back(y);\n vr.push_back(r);\n }\n else if(!f1 and f2){\n int j = vx.size();\n vb.push_back(j);\n vx.push_back(x);\n vy.push_back(y);\n vr.push_back(r);\n }\n }\n int m = vx.size();\n int m1 = va.size();\n int m2 = vb.size();\n vector<vector<int>> g(m);\n {\n for(int i:va){\n for(int j:va){\n if(vr[i]<=vr[j])continue;\n // i->j\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\n if(d < vr[i] - vr[j] - 1e-8){\n g[i].push_back(j);\n }\n }\n }\n }\n {\n for(int i:vb){\n for(int j:vb){\n if(vr[i]<=vr[j])continue;\n // i->j\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\n if(d < vr[i] - vr[j] - 1e-8){\n g[i].push_back(j);\n }\n }\n }\n }\n vector<int> dp(n,-1);\n auto dfs=[&](auto self,int s)->int{\n if(dp[s] != -1)return dp[s];\n int res = 0;\n for(int t:g[s]){\n res = max(res, self(self, t));\n }\n dp[s] = res+1;\n return res+1;\n };\n for(int i=0;i<m;i++){\n if(dp[i] == -1){\n dp[i] = dfs(dfs,i);\n }\n }\n int res = 0;\n for(int i=0;i<m;i++){\n res = max(res, dp[i]);\n }\n for(int i:va){\n for(int j:vb){\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\n if(d > vr[i] + vr[j] + 1e-8){\n res = max(res, dp[i]+dp[j]);\n }\n }\n }\n cout << res << \"\\n\";\n }\n}","accuracy":1,"time_ms":40,"memory_kb":5984,"score_of_the_acc":-0.4181,"final_rank":16},{"submission_id":"aoj_2181_5946738","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\nlong double eps = 1e-9;\nlong double pi = acos(-1);\n\n/*\n正規版\nメモ\nnorm(P) Pの絶対値の2乗 abs(P)の2乗\nabs(P) Pの絶対値\narg(P)の戻り値の範囲は[-π, π]\npolar(長さ,角度(ラジアン))でPointができる\nint(-2.2+0.5)=-1\n*/\n\n// #include <bits/stdc++.h>\n// using namespace std;\n// template<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}\n// template<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}\n// template<class T,class U>constexpr bool bitUP(const T n,const U k){return (n>>k)&1;}\n\n\n\n////////////////////////////\n// マクロや型\n////////////////////////////\n\nusing DD=long double;\n\nconst DD EPS=1e-9;\nconst DD INF=1e50;\nconst DD PI=acosl(-1.0);\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\n\n#define X real()\n#define Y imag()\n\n\n//点\nusing Point=complex<DD>;\nistream &operator>>(istream &is, Point &p) {\n DD x,y;\n is>>x>>y;\n p=Point(x,y);\n return is;\n}\n\n//点a→点bの線分\n//aとbが等しい時、色々バグるから注意!\nstruct Segment{\n Point a,b;\n Segment()=default;\n Segment(Point a,Point b) :a(a),b(b){}\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){} \n};\nusing Line=Segment;\n\n//円\nstruct Circle{\n Point p;\n DD r;\n Circle()=default;\n Circle(Point p,DD r):p(p),r(r){}\n};\n\n\n\n////////////////////////////\n// 基本計算\n////////////////////////////\n\n//度→ラジアン\ninline DD torad(const DD deg){return deg*PI/180;}\n//ラジアン→度\ninline DD todeg(const DD rad){return rad*180/PI;}\n//内積 |a||b|cosθ\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\n//外積 |a||b|sinθ\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\n//ベクトルpを反時計回りにtheta(ラジアン)回転\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\n\n//余弦定理 cos(角度abc(ラジアン))を返す\n//長さの対応に注意 ab:辺abの長さ\n//verify:https://codeforces.com/gym/102056/problem/F\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\n}\n\ninline bool xy_sort(const Point &a,const Point &b){\n if(a.X+EPS<b.X) return true;\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\n return false;\n}\ninline bool yx_sort(const Point &a,const Point &b){\n if(a.Y+EPS<b.Y) return true;\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\n return false;\n}\n\n\n////////////////////////////\n// 平行や直交\n////////////////////////////\n\nbool isOrthogonal(const Point &a,const Point &b){\n return EQ(dot(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isOrthogonal(const Segment &s,const Segment &t){\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\n}\nbool isParallel(const Point &a,const Point &b){\n return EQ(cross(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isParallel(const Segment &s,const Segment &t){\n return EQ(cross(s.a-s.b,t.a-t.b),0);\n}\n//線分a→bに対して点cがどの位置にあるか\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n//線分a→bの端点にcがあるなら0と判定されるはず\nint ccw(const Point &a,Point b,Point c){\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\n b-=a;c-=a;\n if(cross(b,c)>EPS) return 1;\n if(cross(b,c)<-EPS) return -1;\n if(dot(b,c)<-EPS) return 2;\n if(LS(norm(b),norm(c))) return -2;\n return 0;\n}\n\n////////////////////////////\n// 射影と反射\n////////////////////////////\n\n//射影\n//直線lに点pから垂線を引いたときの交点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint project(const Point &p,const Line &l){\n Point base=l.b-l.a;\n DD r=dot(p-l.a,base)/norm(base);\n return l.a+base*r;\n}\n//反射\n//直線lに対して点pと対称な点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflect(const Point &p,const Line &l){\n return p+(project(p,l)-p)*(DD)2.0;\n}\n\n////////////////////////////\n// 点との距離\n////////////////////////////\n\n//点と直線の距離\nDD DistPL(const Point &p,const Line &l){\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\n}\n//点と線分の距離\nDD DistPS(const Point &p,const Segment &s){\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\n return DistPL(p,s);\n}\n\n////////////////////////////\n// 円\n////////////////////////////\n//直線lと円Cの交点\n//l.aにより近い方がindexが小さい\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nvector<Point> crossPointLC(const Line &l,const Circle &c){\n vector<Point> ret;\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\n Point pr=project(c.p,l);\n Point e=(l.b-l.a)/(abs(l.b-l.a));\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\n ret.push_back(pr-e*base);\n ret.push_back(pr+e*base);\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\n return ret;\n}\n//線分sと円cの交点\n//交点がないときは空ベクトルを返す\n//線分の端が交わる場合も交点とみなす\n//s.aにより近い方がindexが小さい\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\n vector<Point> ret;\n if(DistPS(c.p,s)>c.r+EPS) return ret;\n auto koho=crossPointLC(s,c);\n for(auto p:koho){\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\n }\n return ret;\n}\n\n//円aと円bの共通接線の数\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\nint intersect(const Circle &a,const Circle &b){\n DD d=abs(a.p-b.p);\n if(GR(d,a.r+b.r)) return 4;\n if(EQ(d,a.r+b.r)) return 3;\n if(EQ(d,abs(a.r-b.r))) return 1;\n if(LS(d,abs(a.r-b.r))) return 0;\n return 2;\n}\n\n//円aと円bの交点\n//交点がないときは空ベクトルを返す\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nvector<Point> crossPoint(const Circle &a,const Circle &b){\n vector<Point> ret;\n if(GR(abs(a.p - b.p), a.r + b.r)) return ret;\n if(GR(max(a.r, b.r), abs(a.p - b.p) + min(a.r, b.r))) return ret;\n DD d=abs(a.p-b.p);\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\n DD t=arg(b.p-a.p);\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\n return ret;\n}\n\n\nint n;\nvector<Circle> c;\nvector<int> f(vector<pair<DD,int>> &v){\n vector<int> ret(n);\n for(int i=0;i<(int)v.size();i++){\n int idx = v[i].second;\n ret[idx] = 1;\n for(int j=0;j<i;j++){\n int idy = v[j].second;\n if(crossPoint(c[idx],c[idy]).empty()){\n chmax(ret[idx], ret[idy] + 1);\n }\n }\n }\n return ret;\n}\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n\n while(cin>>n, n){\n Point s,t;\n cin>>s>>t;\n c.resize(n);\n vector<pair<DD, int>> l,r;\n for(int i=0;i<n;i++){\n Point p;\n DD rr;\n cin>>p>>rr;\n c[i] = Circle(p, rr);\n if(LS(abs(p-s), rr) and LS(abs(p-t), rr)) continue;\n if(LS(abs(p-s), rr)) l.push_back({rr, i});\n if(LS(abs(p-t), rr)) r.push_back({rr, i});\n }\n sort(all(l));\n sort(all(r));\n vector<int> a1 = f(l);\n vector<int> a2 = f(r);\n int ans = 0;\n for(auto i:a1)chmax(ans, i);\n for(auto i:a2)chmax(ans, i);\n for(auto [d, i]:l){\n for(auto [d2, j]:r){\n assert(i != j);\n if(crossPoint(c[i], c[j]).empty()){\n chmax(ans, a1[i] + a2[j]);\n }\n }\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":850,"memory_kb":3936,"score_of_the_acc":-0.6728,"final_rank":17},{"submission_id":"aoj_2181_5916273","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 510000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nstruct circle{\n int x,y,r;\n circle() {}\n circle(int x, int y, int r) : x(x), y(y), r(r) {}\n bool operator< (const circle &c) const {\n return x-r < c.x-c.r;\n }\n};\n\nint main(){\n while(1){\n int n; cin >> n;\n if(!n) break;\n int a,b,c,d; cin >> a >> b >> c >> d;\n vector<circle> v(n);\n rep(i,n){\n cin >> v[i].x >> v[i].y >> v[i].r;\n }\n sort(rall(v));\n auto intersect = [&](circle c, circle d) -> bool {\n ll dist = abs(c.x-d.x) * abs(c.x-d.x) + abs(c.y-d.y) * abs(c.y-d.y);\n ll rm = max(c.r,d.r) - min(c.r,d.r);\n ll rM = c.r+d.r;\n return rm*rm <= dist && dist <= rM*rM;\n };\n auto contain = [&](circle c, int x, int y) -> bool {\n ll dist = abs(c.x-x) * abs(c.x-x) + abs(c.y-y) * abs(c.y-y);\n return c.r*c.r >= dist;\n };\n vector<circle> S,T;\n rep(i,n){\n if(contain(v[i],a,b)){\n if(!contain(v[i],c,d)) S.emplace_back(v[i]);\n }else{\n if(contain(v[i],c,d)) T.emplace_back(v[i]);\n }\n }\n int ssize = S.size(), tsize = T.size();\n vector<int> sp(ssize,1), tp(tsize,1);\n rep(i,ssize){\n rep(j,i){\n if(!intersect(S[j],S[i])) chmax(sp[i],sp[j]+1);\n }\n }\n rep(i,tsize){\n rep(j,i){\n if(!intersect(T[j],T[i])) chmax(tp[i],tp[j]+1);\n }\n }\n int ans = 0;\n rep(i,ssize) rep(j,tsize){\n if(!intersect(S[i],T[j])) chmax(ans, sp[i]+tp[j]);\n }\n rep(i,ssize) chmax(ans, sp[i]);\n rep(j,tsize) chmax(ans, tp[j]);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3312,"score_of_the_acc":-0.0645,"final_rank":5},{"submission_id":"aoj_2181_5889587","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n//geometry library by maine\n\n//basic\nusing Real = double;\nusing Point = complex<Real>;\n#define x real()\n#define y imag()\nconst Real EPS = 1e-8, PI = acos(-1), INF = 1e10;\n\nistream& operator>>(istream& is, Point& p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\nostream& operator<<(ostream& os, Point p) {\n return os << fixed << setprecision(10) << p.x << \" \" << p.y;\n}\n\nPoint operator*(const Point& p, const Real& d) { return Point(p.x * d, p.y * d); }\n\nbool eq(const Real& r, const Real& s) { return abs(r - s) < EPS; }\nbool eq(const Point& p, const Point& q) { return abs(p - q) < EPS; }\n\nnamespace std {\nbool operator<(const Point& a, const Point& b) {\n return !eq(a.x, b.x) ? a.x < b.x : a.y < b.y;\n}\n} // namespace std\n\nReal get_angle(const Point& a, const Point& b, const Point& c) {\n return arg((c - a) / (b - a));\n}\n\ninline int inc(int i, int N) {\n return (i == N - 1 ? 0 : i + 1);\n}\ninline int dec(int i, int N) {\n return (i == 0 ? N - 1 : i - 1);\n}\n\n//unit vector\nPoint e(const Point& p) { return p / abs(p); }\n\n//angle transformation\nReal radian_to_degree(Real r) { return r * 180.0 / PI; }\nReal degree_to_radian(Real d) { return d * PI / 180.0; }\n\n//basic functions\nReal dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\nReal cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\nPoint rotate(const Real& theta, const Point& p) {\n return {cos(theta) * p.x - sin(theta) * p.y, sin(theta) * p.x + cos(theta) * p.y};\n}\nPoint rotate90(const Point& p) {\n return {-p.y, p.x};\n}\n\n//structs : Line, Segment, Circle\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n Point d() const { return e(b - a); } //direction vector\n Point n() const {\n Point dd = d();\n return {dd.y, -dd.x};\n } //normal vector\n};\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r){};\n};\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Polygons = vector<Polygon>;\nusing Lines = vector<Line>;\nusing Segments = vector<Segment>;\nusing Circles = vector<Circle>;\n\n//happy functions\n//https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nint ccw(const Point& a, const Point& bb, const Point& cc) {\n Point b = bb - a, c = cc - a;\n if (cross(b, c) > EPS)\n return 1; //COUNTER_CLOCKWISE\n if (cross(b, c) < -EPS)\n return -1; //CLOCKWISE\n if (dot(b, c) < 0)\n return 2; //ONLINE_BACK c-a-b\n if (norm(b) < norm(c))\n return -2; //ONLINE_FRONT a-b-c\n return 0; //ON_SEGMENT a-c-b\n}\n\nbool parallel(const Line& l, const Line& m) { return eq(cross(l.d(), m.d()), 0.0); }\nbool orthogonal(const Line& l, const Line& m) { return eq(dot(l.d(), m.d()), 0.0); }\nPoint projection(const Line& l, const Point& p) { return l.a + (l.a - l.b) * (dot(p - l.a, l.a - l.b) / norm(l.a - l.b)); }\nPoint reflection(const Line& l, const Point& p) { return p + (projection(l, p) - p) * 2.0; }\n\n//intersect\nbool intersect(const Line& l, const Point& p) { return abs(ccw(l.a, l.b, p)) != 1; }\nbool intersect(const Line& l, const Line& m) { return !parallel(l, m) || (parallel(l, m) && intersect(l, m.a)); }\nbool intersect(const Segment& s, const Point& p) { return ccw(s.a, s.b, p) == 0; }\nbool intersect(const Line& l, const Segment& s) { return cross(l.d(), s.a - l.a) * cross(l.d(), s.b - l.a) < EPS; }\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}\nbool intersect_onsegment(const Segment& s, const Point& p) { return intersect(s, p) && !eq(s.a, p) && !eq(s.b, p); }\n\n//distance\nReal distance(const Point& p, const Point& q) { return abs(p - q); }\nReal distance(const Line& l, const Point& p) { return distance(p, projection(l, p)); }\nReal distance(const Line& l, const Line& m) { return intersect(l, m) ? 0 : distance(l, m.a); }\nReal distance(const Segment& s, const Point& p) {\n Point q = projection(s, p);\n return intersect(s, q) ? distance(p, q) : min(distance(s.a, p), distance(s.b, p));\n}\nReal distance(const Segment& s, const Segment& t) { return intersect(s, t) ? 0 : min({distance(s, t.a), distance(s, t.b), distance(t, s.a), distance(t, s.b)}); }\nReal distance(const Line& l, const Segment& s) { return intersect(l, s) ? 0 : min(distance(l, s.a), distance(l, s.b)); }\n\n//intersect circle\nbool intersect(const Circle& c, const Point& p) { return eq(distance(c.p, p), c.r); }\nbool intersect(const Circle& c, const Line& l) { return distance(l, c.p) <= c.r + EPS; }\nint intersect(const Circle& c, const Segment& s) {\n if (!intersect(c, Line(s)))\n return 0;\n Real da = distance(c.p, s.a), db = distance(c.p, s.b);\n if (da < c.r + EPS && db < c.r + EPS)\n return 0;\n if (da > db)\n swap(da, db);\n if (da < c.r - EPS && db > c.r + EPS)\n return 1;\n if (intersect(s, projection(s, c.p)))\n return 2;\n return 0;\n}\nint intersect(Circle c1, Circle c2) {\n if (c1.r < c2.r)\n swap(c1, c2);\n Real d = distance(c1.p, c2.p);\n if (c1.r + c2.r < d)\n return 4;\n if (eq(c1.r + c2.r, d))\n return 3;\n if (c1.r - c2.r < d)\n return 2;\n if (eq(c1.r - c2.r, d))\n return 1;\n return 0;\n}\n\n//crosspoint\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))\n return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\nPoint crosspoint(const Segment& s, const Segment& t) { return crosspoint(Line(s), Line(t)); }\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\n Point p = projection(l, c.p);\n if (eq(distance(l, c.p), c.r))\n return {p, p};\n Real len = sqrt(c.r * c.r - norm(p - c.p));\n return {p - len * l.d(), p + len * l.d()};\n}\npair<Point, Point> crosspoint(const Circle& c, const Segment& s) {\n Line l(s);\n if (intersect(c, s) == 2)\n return crosspoint(c, l);\n auto ret = crosspoint(c, l);\n if (dot(s.a - ret.first, s.b - ret.first) < 0)\n ret.second = ret.first;\n else\n ret.first = ret.second;\n return ret;\n}\npair<Point, Point> crosspoint(const Circle& c1, const Circle& c2) {\n Real d = distance(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.y - c1.p.y, c2.p.x - c1.p.x);\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//tangent\npair<Point, Point> tangent(const Circle& c, const Point& p) {\n return crosspoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n}\nLines tangent(Circle c1, Circle c2) {\n Lines ret;\n if (c1.r < c2.r)\n swap(c1, c2);\n if (eq(c1.p, c2.p))\n return ret;\n Real g = norm(c1.p - c2.p);\n Point u = (c2.p - c1.p) / sqrt(g);\n Point v = rotate(PI / 2, 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//convex\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/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], P[(i + 1) % N], P[(i + 2) % N]) == -1)\n return false;\n }\n return true;\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_A\nPolygon convex_hull(Points P) {\n int N = (int)P.size(), k = 0;\n if (N <= 2)\n return P;\n sort(begin(P), end(P));\n Points ret(2 * N);\n for (int i = 0; i < N; ret[k++] = P[i++]) {\n while (k >= 2 && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\n --k;\n }\n for (int i = N - 2, t = k + 1; i >= 0; ret[k++] = P[i--]) {\n while (k >= t && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\n --k;\n }\n ret.resize(k - 1);\n return ret;\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/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].y < P[is].y)\n is = i;\n if (P[i].y > P[js].y)\n js = i;\n }\n Real maxdist = norm(P[is] - P[js]);\n int maxi, maxj, i, j;\n maxi = i = is;\n maxj = j = js;\n do {\n if (cross(P[inc(i, N)] - P[i], P[inc(j, N)] - P[j]) >= 0)\n j = inc(j, N);\n else\n i = inc(i, N);\n if (norm(P[i] - P[j]) > maxdist) {\n maxdist = norm(P[i] - P[j]);\n maxi = i;\n maxj = j;\n }\n } while (i != is || j != js);\n maxi = maxi;\n maxj = maxj;\n return sqrt(maxdist);\n}\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_C\nPolygon convex_cut(const Polygon& P, const Line& l) {\n Polygon ret;\n int N = (int)P.size();\n for (int i = 0; i < N; i++) {\n Point now = P[i], nxt = P[(inc(i, N))];\n if (ccw(l.a, l.b, now) != -1)\n ret.emplace_back(now);\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) == -1)\n ret.emplace_back(crosspoint(Line(now, nxt), l));\n }\n return ret;\n}\n\n//other\nenum\n{\n OUT,\n ON,\n IN\n};\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_C\nint contains(const Polygon& Q, const Point& p) {\n bool in = false;\n int N = (int)Q.size();\n for (int i = 0; i < N; i++) {\n Point a = Q[i] - p, b = Q[(i + 1) % N] - p;\n if (a.y > b.y)\n swap(a, b);\n if (a.y <= 0 && 0 < b.y && cross(a, b) < 0)\n in = !in;\n if (cross(a, b) == 0 && dot(a, b) <= 0)\n return ON;\n }\n return in ? IN : OUT;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_A\nReal area(const Polygon& P) {\n Real A = 0;\n for (int i = 0; i < (int)P.size(); i++) {\n A += cross(P[i], P[(i + 1) % P.size()]);\n }\n return A * 0.5;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_H\nReal 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))\n return ret;\n if (max(abs(va), abs(vb)) < c.r + EPS)\n return f;\n if (distance(Segment(a, b), c.p) > c.r - EPS)\n return c.r * c.r * arg(vb * conj(va));\n auto u = crosspoint(c, Segment(a, b));\n vector<Point> V{a, u.first, u.second, b};\n for (int i = 0; i < (int)V.size() - 1; i++) {\n ret += cross_area(c, V[i], V[i + 1]);\n }\n return ret;\n}\nReal area(const Polygon& p, const Circle& c) {\n int N = (int)p.size();\n if (N < 3)\n return 0.0;\n Real ret = 0;\n for (int i = 0; i < N; i++) {\n ret += cross_area(c, p[i], p[inc(i, N)]);\n }\n return ret / 2.0;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/problems/CGL_5_A\nReal closest_pair(Points& P, int left, int right) {\n if (right - left <= 1)\n return 1e18;\n int mid = (left + right) / 2;\n Real xx = P[mid].x;\n Real dist = min(closest_pair(P, left, mid), closest_pair(P, mid, right));\n inplace_merge(P.begin() + left, P.begin() + mid, P.begin() + right, [&](const Point& a, const Point& b) { return a.y < b.y; });\n Points memo;\n memo.reserve(right - left);\n for (int i = left; i < right; i++) {\n if (abs(P[i].x - xx) >= dist)\n continue;\n for (int j = (int)memo.size() - 1; j >= 0; j--) {\n if (P[i].y - memo[j].y >= dist)\n break;\n dist = min(dist, distance(P[i], memo[j]));\n }\n memo.emplace_back(P[i]);\n }\n return dist;\n}\nReal closest_pair(Points P) {\n sort(begin(P), end(P));\n return closest_pair(P, 0, (int)P.size());\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_B\nCircle incircle(Polygon P) {\n assert((int)P.size() == 3);\n Real l0 = distance(P[1], P[2]), l1 = distance(P[0], P[2]), l2 = distance(P[0], P[1]);\n Circle c;\n c.p = crosspoint(Line(P[0], (P[1] * l1 + P[2] * l2) / (l1 + l2)), Line(P[1], (P[0] * l0 + P[2] * l2) / (l0 + l2)));\n c.r = distance(Line(P[0], P[1]), c.p);\n return c;\n}\n\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_C\nCircle circumcircle(Polygon P) {\n assert((int)P.size() == 3);\n Circle c;\n c.p = crosspoint(Line((P[0] + P[1]) / 2.0, (P[0] + P[1]) / 2.0 + rotate90(P[0] - P[1])),\n Line((P[0] + P[2]) / 2.0, (P[0] + P[2]) / 2.0 + rotate90(P[0] - P[2])));\n c.r = distance(c.p, P[0]);\n return c;\n}\n\n#undef x\n#undef y\n\n\nint main() {\n int N;\n while (cin >> N, N) {\n Point s, t;\n cin >> s >> t;\n Circles C(N);\n for (auto&& c : C) {\n cin >> c.p >> c.r;\n }\n sort(begin(C), end(C), [](const auto& x, const auto& y) { return x.r < y.r; });\n auto maine = [&](Point p, Point q) {\n vector<int> dp(N);\n for (int i = 0; i < N; i++) {\n if (distance(p, C[i].p) < C[i].r && distance(q, C[i].p) > C[i].r) {\n dp[i] = 1;\n for (int j = 0; j < i; j++) {\n if (intersect(C[i], C[j]) == 0)\n dp[i] = max(dp[i], dp[j] + 1);\n }\n }\n }\n return dp;\n };\n auto S = maine(s, t), T = maine(t, s);\n int ans = 0;\n for (int i = 0; i < N; i++) {\n ans = max(ans, S[i]);\n ans = max(ans, T[i]);\n for (int j = 0; j < N; j++) {\n if (intersect(C[i], C[j]) == 4)\n ans = max(ans, S[i] + T[j]);\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":440,"memory_kb":3552,"score_of_the_acc":-0.3627,"final_rank":14},{"submission_id":"aoj_2181_5330730","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 0.00000001;\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dist(point P, point Q){\n return abs(Q - P);\n}\nint main(){\n while (true){\n int n;\n cin >> n;\n if (n == 0){\n break;\n }\n point S, T;\n cin >> S.x >> S.y >> T.x >> T.y;\n vector<tuple<double, double, double>> C1, C2;\n for (int i = 0; i < n; i++){\n double x, y, r;\n cin >> x >> y >> r;\n point P(x, y);\n double dS = dist(P, S);\n double dT = dist(P, T);\n if (dS < r && dT > r){\n C1.push_back(make_tuple(r, x, y));\n }\n if (dT < r && dS > r){\n C2.push_back(make_tuple(r, x, y));\n }\n }\n sort(C1.begin(), C1.end());\n int N = C1.size();\n vector<double> r1(N);\n vector<point> P1(N);\n for (int i = 0; i < N; i++){\n r1[i] = get<0>(C1[i]);\n P1[i].x = get<1>(C1[i]);\n P1[i].y = get<2>(C1[i]);\n }\n sort(C2.begin(), C2.end());\n int M = C2.size();\n vector<double> r2(M);\n vector<point> P2(M);\n for (int i = 0; i < M; i++){\n r2[i] = get<0>(C2[i]);\n P2[i].x = get<1>(C2[i]);\n P2[i].y = get<2>(C2[i]);\n }\n vector<int> dp1(N + 1, 0);\n for (int i = 0; i < N; i++){\n dp1[i + 1] = 1;\n for (int j = 0; j < i; j++){\n if (dist(P1[i], P1[j]) < r1[i] - r1[j] - EPS){\n dp1[i + 1] = max(dp1[i + 1], dp1[j + 1] + 1);\n }\n }\n }\n vector<int> dp2(M + 1, 0);\n for (int i = 0; i < M; i++){\n dp2[i + 1] = 1;\n for (int j = 0; j < i; j++){\n if (dist(P2[i], P2[j]) < r2[i] - r2[j] - EPS){\n dp2[i + 1] = max(dp2[i + 1], dp2[j + 1] + 1);\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= N; i++){\n ans = max(ans, dp1[i]);\n }\n for (int i = 0; i <= M; i++){\n ans = max(ans, dp2[i]);\n }\n for (int i = 0; i < N; i++){\n for (int j = 0; j < M; j++){\n if (dist(P1[i], P2[j]) > r1[i] + r2[j] + EPS){\n ans = max(ans, dp1[i + 1] + dp2[j + 1]);\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3204,"score_of_the_acc":-0.0571,"final_rank":4},{"submission_id":"aoj_2181_4969241","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n#include \"complex\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nstruct Circle {\n\tlong double x, y, r;\n\tCircle() {\n\t\tcin >> x >> y >> r;\n\t}\n\tbool operator<(const Circle&c) const {\n\t\treturn r < c.r;\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N, N) {\n\t\tlong double sx, sy, gx, gy;\n\t\tcin >> sx >> sy >> gx >> gy;\n\t\tvector<Circle>c(N);\n\t\tsort(c.begin(), c.end());\n\t\tvector<Circle>a;\n\t\tvector<Circle>b;\n\t\ta.push_back(c[0]);\n\t\tb.push_back(c[0]);\n\t\ta[0].x = sx, a[0].y = sy, a[0].r = 0;\n\t\tb[0].x = gx, b[0].y = gy, b[0].r = 0;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tauto sdis = hypotl(c[i].x - sx, c[i].y - sy);\n\t\t\tauto gdis = hypotl(c[i].x - gx, c[i].y - gy);\n\t\t\tif (sdis < c[i].r&&gdis>c[i].r) {\n\t\t\t\ta.push_back(c[i]);\n\t\t\t}\n\t\t\tif (sdis > c[i].r&&gdis < c[i].r) {\n\t\t\t\tb.push_back(c[i]);\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>dp(a.size(), vector<int>(b.size(), -MOD));\n\t\tvector<vector<int>>aok(a.size(), vector<int>(a.size()));\n\t\tfor (int i = 0; i < a.size(); i++) {\n\t\t\tfor (int j = i + 1; j < a.size(); j++) {\n\t\t\t\tif (hypot(a[i].x - a[j].x, a[i].y - a[j].y) <= abs(a[i].r - a[j].r) - EPS) {\n\t\t\t\t\taok[i][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>bok(b.size(), vector<int>(b.size()));\n\t\tfor (int i = 0; i < b.size(); i++) {\n\t\t\tfor (int j = i + 1; j < b.size(); j++) {\n\t\t\t\tif (hypot(b[i].x - b[j].x, b[i].y - b[j].y) <= abs(b[i].r - b[j].r) - EPS) {\n\t\t\t\t\tbok[i][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>>ok(a.size(), vector<int>(b.size()));\n\t\tfor (int i = 0; i < a.size(); i++) {\n\t\t\tfor (int j = 0; j < b.size(); j++) {\n\t\t\t\tif (hypot(a[i].x - b[j].x, a[i].y - b[j].y) >= a[i].r + b[j].r + EPS) {\n\t\t\t\t\tok[i][j] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdp[0][0] = 0;\n\t\tfor (int i = 0; i < a.size(); i++) {\n\t\t\tfor (int j = 0; j < b.size(); j++) {\n\t\t\t\tfor (int k = i + 1; k < a.size(); k++) {\n\t\t\t\t\tif (aok[i][k] && ok[k][j]) {\n\t\t\t\t\t\tdp[k][j] = max(dp[k][j], dp[i][j] + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int k = j + 1; k < b.size(); k++) {\n\t\t\t\t\tif (bok[j][k] && ok[i][k]) {\n\t\t\t\t\t\tdp[i][k] = max(dp[i][k], dp[i][j] + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (auto i : dp)for (auto j : i)ans = max(ans, j);\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":850,"memory_kb":7304,"score_of_the_acc":-1.1024,"final_rank":19},{"submission_id":"aoj_2181_4961110","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nint N;\nint X[1000],Y[1000],R[1000];\nbool cont(int id,int x,int y)\n{\n\tint dx=X[id]-x,dy=Y[id]-y;\n\treturn dx*dx+dy*dy<R[id]*R[id];\n}\nvector<pair<int,int> >f(int sx,int sy,int gx,int gy)\n{\n\tvector<int>id;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tif(cont(i,sx,sy)&&!cont(i,gx,gy))id.push_back(i);\n\t}\n\tint n=id.size();\n\tvector<pair<int,int> >E;\n\tfor(int i=0;i<n;i++)for(int j=0;j<n;j++)if(R[id[i]]<R[id[j]])\n\t{\n\t\tint dx=X[id[i]]-X[id[j]],dy=Y[id[i]]-Y[id[j]];\n\t\tint dr=R[id[j]]-R[id[i]];\n\t\tif(dx*dx+dy*dy<dr*dr)E.push_back(make_pair(i,j));\n\t}\n\tvector<int>dist(n,1);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tfor(pair<int,int>e:E)if(dist[e.first]+1>dist[e.second])dist[e.second]=dist[e.first]+1;\n\t}\n\tvector<pair<int,int> >ret(n);\n\tfor(int i=0;i<n;i++)ret[i]=make_pair(id[i],dist[i]);\n\treturn ret;\n}\nmain()\n{\n\twhile(cin>>N,N)\n\t{\n\t\tint sx,sy,gx,gy;\n\t\tcin>>sx>>sy>>gx>>gy;\n\t\tfor(int i=0;i<N;i++)cin>>X[i]>>Y[i]>>R[i];\n\t\tvector<pair<int,int> >A=f(sx,sy,gx,gy);\n\t\tvector<pair<int,int> >B=f(gx,gy,sx,sy);\n\t\tint ans=0;\n\t\tfor(pair<int,int>p:A)if(ans<p.second)ans=p.second;\n\t\tfor(pair<int,int>p:B)if(ans<p.second)ans=p.second;\n\t\tfor(pair<int,int>p:A)for(pair<int,int>q:B)\n\t\t{\n\t\t\tint dx=X[p.first]-X[q.first],dy=Y[p.first]-Y[q.first];\n\t\t\tint nr=R[p.first]+R[q.first];\n\t\t\tif(dx*dx+dy*dy<=nr*nr)continue;\n\t\t\tif(ans<p.second+q.second)ans=p.second+q.second;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":1580,"memory_kb":10696,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2181_4930788","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=1005;\nconst int INF=1e6;\n//const ll INF=1LL<<60;\n\n//幾何ライブラリ\n\nconst double eps=1e-8;\nconst double pi=acos((long double)-1.0L);\n#define equals(a,b) (fabs((a)-(b))<eps)\n\ndouble torad(int deg) {return (double)(deg)*pi/180.0;}\ndouble todeg(double ang) {return ang*180.0/pi;}\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 \n double abs(){return sqrt(norm());}\n double norm(){return x*x+y*y;}\n \n bool operator < (const Point &p)const{\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\n }\n \n bool operator == (const Point &p)const{\n return fabs(x-p.x)<eps&&fabs(y-p.y)<eps;\n }\n};\n\ntypedef Point Vector;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x+a.y*b.y;\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nstruct Segment{\n Point p1,p2;\n};\n\nbool isOrthogonal(Vector a,Vector b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\n return isOrthogonal(a1-a2,b1-b2);\n}\n\nbool isOrthogonal(Segment s1,Segment s2){\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\n return isParallel(a1-a2,b1-b2);\n}\n\nbool isParallel(Segment s1,Segment s2){\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nPoint project(Segment s,Point p){\n Vector base=s.p2-s.p1;\n double r=dot(p-s.p1,base)/norm(base);\n return s.p1+base*r;\n}\n\nPoint reflect(Segment s,Point p){\n return p+(project(s,p)-p)*2.0;\n}\n\nPoint turn(Point p,Point c,double pi){\n double q=atan2(p.y-c.y,p.x-c.x);\n q+=pi;\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\n \n return p;\n}\n//pをcを中心としてpi回転させる(1周で2π)\n//p=cのときnan\n\nstatic const int counter_clockwise=1;\nstatic const int clockwise=-1;\nstatic const int online_back=2;\nstatic const int online_front=-2;\nstatic const int on_segment=0;\n\nint ccw(Point p0,Point p1,Point p2){\n Vector a=p1-p0;\n Vector b=p2-p0;\n \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 \n return on_segment;\n}\n\nbool intersect(Point p1,Point p2,Point p3,Point p4){\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\n}\n\nbool intersect(Segment s1,Segment s2){\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool overlap(Segment s1,Segment s2){\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\n if(a&1||b&1) return 0;\n if(a==2){\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\n else return 0;\n }\n if(a==-2){\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\n else return 0;\n }\n if(a==0){\n if(s1.p1==s2.p1){\n if(b!=2) return 1;\n else return 0;\n }\n else if(s1.p2==s2.p1){\n if(b!=-2) return 1;\n else return 0;\n }\n else return 1;\n }\n return 0;\n}\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\n\ntypedef Segment Line;\n\ndouble getDistance(Point a,Point b){\n return abs(a-b);\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 getDistance(Segment s1,Segment s2){\n if(intersect(s1,s2)) return 0.0;\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\n}\n\nPoint getCrossPointS(Segment s1,Segment s2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\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 getCrossPointL(Line l1,Line l2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\n \n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\n \n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\n}\n\nSegment ParallelSegment(Segment s,double d){\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\n v=v/abs(v);\n \n s.p1=s.p1+v*d;\n s.p2=s.p2+v*d;\n \n return s;\n}\n\nclass Circle{\npublic:\n Point c;\n double r;\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\n};\n\nPoint CircleCenter(Point a,Point b,Point c){\n Point u=a-b,v=a-c;\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\n \n Point res;\n if(cross(u,v)==0.0){\n res.x=1e9;\n res.y=1e9;\n \n return res;\n }\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\n \n return res;\n}\n//3点を通る円の中心を返す\n\npair<Point,Point> segCrossPpoints(Circle c,Line l){\n //assert(intersect(c,l));\n Vector pr=project(l,c.c);\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\n double base=sqrt(c.r*c.r-norm(pr-c.c));\n return make_pair(pr+e*base,pr-e*base);\n}\n\ndouble arg(Vector p){return atan2(p.y,p.x);}\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\n\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\n //assert(intersect(c1,c2));\n double d=abs(c1.c-c2.c);\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\n double t=arg(c2.c-c1.c);\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\n}\n\nvector<Line> Commontangent(Circle c1,Circle c2){\n vector<Line> res;\n Point p=c2.c-c1.c;\n \n if(abs(p)>=(c1.r+c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n if(abs(p)>=abs(c1.r-c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n return res;\n}\n\ntypedef vector<Point> Polygon;\n\n/*\n IN 2\n ON 1\n OUT 0\n */\n\nint contains(Polygon g,Point p){\n int n=int(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(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\nPolygon andrewScan(Polygon s,bool ok){\n Polygon u,l;\n sort(all(s));\n \n if(int(s.size())<3) return s;\n int n=int(s.size());\n \n u.push_back(s[0]);\n u.push_back(s[1]);\n \n l.push_back(s[n-1]);\n l.push_back(s[n-2]);\n \n if(ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n if(!ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n reverse(all(l));\n \n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\n \n return l;\n}//ok==1なら辺の上も含める\n\nPolygon convex_cut(const Polygon& P, const Line& l) {\n Polygon Q;\n for(int i=0;i<si(P);i++){\n Point A=P[i],B=P[(i+1)%si(P)];\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\n }\n return Q;\n}\n\ndouble area(Point a,Point b,Point c){\n b=b-a;\n c=c-a;\n return abs(b.x*c.y-b.y*c.x)/2.0;\n}\n\ndouble area(Polygon &P){\n if(si(P)==0) return 0.0;\n double res=0;\n Point c={0.0,0.0};\n for(int i=0;i<si(P);i++){\n c=c+P[i];\n }\n c=c/si(P);\n \n for(int i=0;i<si(P);i++){\n res+=area(c,P[i],P[(i+1)%si(P)]);\n }\n \n return res;\n}\n\nint dp[MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N;cin>>N;\n if(N==0) break;\n Point s,t;\n cin>>s.x>>s.y>>t.x>>t.y;\n \n vector<Circle> C(N);\n for(int i=0;i<N;i++) cin>>C[i].c.x>>C[i].c.y>>C[i].r;\n \n sort(all(C),[](auto a,auto b){\n return a.r<b.r;\n });\n \n for(int i=0;i<N;i++) dp[i]=-INF;\n \n for(int i=0;i<N;i++){\n int cnt=0;\n if(getDistance(C[i].c,s)<C[i].r) cnt++;\n if(getDistance(C[i].c,t)<C[i].r) cnt++;\n \n if(cnt==1){\n dp[i]=1;\n for(int j=0;j<i;j++){\n if(C[j].r==C[i].r) continue;\n \n double d=getDistance(C[j].c,C[i].c);\n \n if(d+C[j].r<C[i].r) chmax(dp[i],dp[j]+1);\n }\n }\n }\n \n int ans=0;\n \n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n if(dp[i]>=1&&dp[j]>=1){\n auto l=Commontangent(C[i],C[j]);\n if(si(l)==4) chmax(ans,dp[i]+dp[j]);\n }\n }\n chmax(ans,dp[i]);\n }\n \n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":440,"memory_kb":3572,"score_of_the_acc":-0.3652,"final_rank":15},{"submission_id":"aoj_2181_4653184","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define repr(i, n) for (int i = (n); i >= 0; --i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define FORR(i, m, n) for (int i = (m); i >= (n); --i)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\nconst ll mod = 1000000007;\n//const ll mod = 998244353;\nconst int inf = 1e9 + 10;\nconst ll INF = 1e18;\nconst ld EPS = 1e-10;\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntypedef complex<ll> P;\n\nint n;\nP s, t;\nP p[1005];\nvector<P> G[10005];\n\nvoid init() {\n rep(i, 10005) G[i].clear();\n}\n\nvoid solve() {\n vector<P> a, b;\n vector<ll> ar, br;\n rep(i, 10005) {\n for (P p: G[i]) {\n if (norm(p - s) < i * i) {\n a.push_back(p);\n ar.push_back(i);\n }\n else {\n b.push_back(p);\n br.push_back(i);\n }\n }\n }\n int ans = 0;\n vector<int> dpa(a.size(), 1), dpb(b.size(), 1);\n rep(i, a.size()) {\n rep(j, i) {\n if (norm(a[i] - a[j]) < (ar[i] - ar[j]) * (ar[i] - ar[j])) {\n chmax(dpa[i], dpa[j] + 1);\n }\n }\n chmax(ans, dpa[i]);\n }\n rep(i, b.size()) {\n rep(j, i) {\n if (norm(b[i] - b[j]) < (br[i] - br[j]) * (br[i] - br[j])) {\n chmax(dpb[i], dpb[j] + 1);\n }\n }\n chmax(ans, dpb[i]);\n }\n rep(i, a.size()) {\n rep(j, b.size()) {\n if (norm(a[i] - b[j]) > (ar[i] + br[j]) * (ar[i] + br[j])) {\n chmax(ans, dpa[i] + dpb[j]);\n }\n }\n }\n cout << ans << '\\n';\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(25);\n\n while (cin >> n, n) {\n init();\n\n ll sx, sy, tx, ty;\n cin >> sx >> sy >> tx >> ty;\n s = P(sx, sy), t = P(tx, ty);\n rep(i, n) {\n ll px, py, r;\n cin >> px >> py >> r;\n P p = P(px, py);\n if (norm(p - t) < r * r && norm(p - s) < r * r) continue;\n if (norm(p - t) > r * r && norm(p - s) > r * r) continue;\n G[r].push_back(p);\n }\n\n solve();\n }\n\n \n\n\n\n\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3500,"score_of_the_acc":-0.0821,"final_rank":9},{"submission_id":"aoj_2181_4630623","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n/*\nconst long double EPS = 1e-10;\nconst long long INF = 1e18;\nconst long double PI = acos(-1.0L);\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\nbool 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 false;\n if(eq(c1.r + c2.r, d)) return true;\n if(c1.r - c2.r < d) return true;\n if(eq(c1.r - c2.r, d)) return true;\n return false;\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};\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\nbool contains(Circle a, Circle b) {\n double delta = distance(a.p, b.p);\n return delta <= a.r - b.r + EPS;\n}\n\n//const ll mod = 1000000007;\nPoint P[2];\nCircles C[2];\nint N;\n\nint solve() {\n for(int i = 0; i < 2; i++) {\n cin >> P[i];\n C[i].clear();\n }\n for(int i = 0; i < N; i++) {\n Point p;\n cin >> p;\n int r;\n cin >> r;\n Circle c(p, r);\n bool check[2] = {false, false};\n for(int j = 0; j < 2; j++) {\n if(distance(p, P[j]) <= r + EPS) check[j] = true;\n }\n if(!(check[0] ^ check[1])) continue;\n for(int j = 0; j < 2; j++) {\n if(check[j]) C[j].push_back(c);\n }\n }\n /*\n for(int i = 0; i < 2; i++) {\n cerr << \"---\" << i << \"---\" << endl;\n for(auto c : C[i]) {\n cerr << c.p << \" \" << c.r << endl;\n }\n }\n */\n vector<ll> dp[2];\n ll ans = 0;\n for(int i = 0; i < 2; i++) {\n sort(C[i].begin(), C[i].end(), [](Circle a, Circle b) {\n return a.r < b.r;\n });\n for(int j = 0; j < C[i].size(); j++) {\n dp[i].push_back(1); \n for(int k = 0; k < j; k++) {\n if(intersect(C[i][j], C[i][k])) continue;\n chmax(dp[i][j], dp[i][k] + 1);\n }\n chmax(ans, dp[i][j]);\n }\n }\n for(int i = 0; i < dp[0].size(); i++) {\n for(int j = 0; j < dp[1].size(); j++) {\n if(intersect(C[0][i], C[1][j])) continue;\n chmax(ans, dp[0][i] + dp[1][j]);\n }\n }\n cout << ans << endl;\n return 0;\n}\nint main() {\n while(cin >> N) {\n if(N == 0) break;\n solve();\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3384,"score_of_the_acc":-0.1119,"final_rank":11},{"submission_id":"aoj_2181_4096644","code_snippet":"/**\n * \n */\n\n// header {{{\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define CPP_STR(x) CPP_STR_I(x)\n#define CPP_CAT(x,y) CPP_CAT_I(x,y)\n#define CPP_STR_I(args...) #args\n#define CPP_CAT_I(x,y) x ## y\n\n#define SFINAE(pred...) std::enable_if_t<(pred), std::nullptr_t> = nullptr\n\n#define ASSERT(expr...) assert((expr))\n\nusing i8 = int8_t;\nusing u8 = uint8_t;\nusing i16 = int16_t;\nusing u16 = uint16_t;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n\nusing f32 = float;\nusing f64 = double;\nusing f80 = __float80;\n// }}}\n\nconstexpr i64 INF = INT64_C(1'010'000'000'000'000'017);\nconstexpr f64 FINF = 1e100;\n\nconstexpr i64 MOD = INT64_C(1'000'000'007);\n//constexpr i64 MOD = INT64_C(998'244'353);\n\nconstexpr f64 EPS = 1e-12;\n\nconstexpr f64 PI = 3.14159265358979323846;\n\n// util {{{\n#define FOR(i, start, end) for(i64 i = (start), CPP_CAT(i,xxxx_end)=(end); i < CPP_CAT(i,xxxx_end); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\n#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))\n\n#define LIFT(f) ([](auto&&... args) -> decltype(auto) { return (f)(std::forward<decltype(args)>(args)...); })\n\ntemplate<typename C>\nconstexpr i64 SIZE(const C& c) noexcept { return static_cast<i64>(c.size()); }\n\ntemplate<typename T, size_t N>\nconstexpr i64 SIZE(const T (&)[N]) noexcept { return static_cast<i64>(N); }\n\ntemplate<typename T, SFINAE(is_signed<T>::value)>\nconstexpr T ABS(T x) noexcept {\n return x < 0 ? -x : x;\n}\n\ntemplate<typename T>\nconstexpr i64 CMP(T x, T y) noexcept { return (y<x) - (x<y); }\n\ntemplate<typename T>\nconstexpr i64 SGN(T x) noexcept { return CMP(x,T(0)); }\n\ntemplate<typename T, typename U, typename Comp=less<>>\nconstexpr bool chmax(T& xmax, const U& x, Comp comp={}) noexcept {\n if(comp(xmax, x)) {\n xmax = x;\n return true;\n }\n return false;\n}\n\ntemplate<typename T, typename U, typename Comp=less<>>\nconstexpr bool chmin(T& xmin, const U& x, Comp comp={}) noexcept {\n if(comp(x, xmin)) {\n xmin = x;\n return true;\n }\n return false;\n}\n\ntemplate<typename BinaryFunc, typename UnaryFunc>\nauto ON(BinaryFunc&& bf, UnaryFunc&& uf) {\n return [bf=forward<BinaryFunc>(bf),uf=forward<UnaryFunc>(uf)](const auto& x, const auto& y) {\n return bf(uf(x), uf(y));\n };\n}\n\ntemplate<typename F>\nauto LT_ON(F&& f) {\n return ON(less<>{}, forward<F>(f));\n}\n\ntemplate<typename F>\nauto GT_ON(F&& f) {\n return ON(greater<>{}, forward<F>(f));\n}\n\ntemplate<typename F>\nauto EQ_ON(F&& f) {\n return ON(equal_to<>{}, forward<F>(f));\n}\n\ntemplate<typename F>\nauto NE_ON(F&& f) {\n return ON(not_equal_to<>{}, forward<F>(f));\n}\n\n// tuple {{{\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) == I)>\nvoid tuple_enumerate(tuple<TS...>&, F&&) {}\n\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) > I)>\nvoid tuple_enumerate(tuple<TS...>& t, F&& f) {\n f(I, get<I>(t));\n tuple_enumerate<I+1>(t, forward<F>(f));\n}\n\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) == I)>\nvoid tuple_enumerate(const tuple<TS...>&, F&&) {}\n\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) > I)>\nvoid tuple_enumerate(const tuple<TS...>& t, F&& f) {\n f(I, get<I>(t));\n tuple_enumerate<I+1>(t, forward<F>(f));\n}\n// }}}\n\n// container {{{\ntemplate<typename T> struct is_container : false_type {};\ntemplate<typename T, size_t N> struct is_container<array<T,N>> : true_type {};\ntemplate<typename... Args> struct is_container<vector<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<deque<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<list<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<forward_list<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<set<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<multiset<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<unordered_set<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<unordered_multiset<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<map<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<multimap<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<unordered_map<Args...>> : true_type {};\ntemplate<typename... Args> struct is_container<unordered_multimap<Args...>> : true_type {};\n\ntemplate<typename T, typename Enable=void>\nstruct ProconHash {\n size_t operator()(const T& x) const noexcept {\n return hash<T>{}(x);\n }\n};\n\ntemplate<typename T>\nsize_t procon_hash_value(const T& x) noexcept {\n return ProconHash<T>{}(x);\n}\n\nsize_t procon_hash_combine(size_t h1, size_t h2) noexcept {\n constexpr size_t M = UINT64_C(0xc6a4a7935bd1e995);\n constexpr int R = 47;\n\n h2 *= M;\n h2 ^= h2 >> R;\n h2 *= M;\n\n h1 ^= h2;\n h1 *= M;\n\n h1 += 0xe6546b64;\n\n return h1;\n}\n\ntemplate<typename T1, typename T2>\nstruct ProconHash<pair<T1,T2>> {\n size_t operator()(const pair<T1,T2>& p) const noexcept {\n size_t h1 = procon_hash_value(p.first);\n size_t h2 = procon_hash_value(p.second);\n return procon_hash_combine(h1, h2);\n }\n};\n\ntemplate<typename... TS>\nstruct ProconHash<tuple<TS...>> {\n size_t operator()(const tuple<TS...>& t) const noexcept {\n size_t h = 0;\n tuple_enumerate(t, [&h](i64, const auto& e) {\n h = procon_hash_combine(h, procon_hash_value(e));\n });\n return h;\n }\n};\n\ntemplate<typename C>\nstruct ProconHash<C,enable_if_t<is_container<C>::value>> {\n size_t operator()(const C& c) const noexcept {\n size_t h = 0;\n for(const auto& e : c)\n h = procon_hash_combine(h, procon_hash_value(e));\n return h;\n }\n};\n\ntemplate<typename T, typename Hash=ProconHash<T>, typename Eq=equal_to<T>>\nusing HashSet = unordered_set<T,Hash,Eq>;\ntemplate<typename K, typename V, typename Hash=ProconHash<K>, typename Eq=equal_to<K>>\nusing HashMap = unordered_map<K,V,Hash,Eq>;\ntemplate<typename T, typename Hash=ProconHash<T>, typename Eq=equal_to<T>>\nusing HashMultiset = unordered_multiset<T,Hash,Eq>;\ntemplate<typename K, typename V, typename Hash=ProconHash<K>, typename Eq=equal_to<K>>\nusing HashMultimap = unordered_multimap<K,V,Hash,Eq>;\n\ntemplate<typename T>\nauto vec_make(i64 n, T x) {\n return vector<T>(n, x);\n}\n\ntemplate<typename T, typename... Args, SFINAE(sizeof...(Args) >= 2)>\nauto vec_make(i64 n, Args... args) {\n auto inner = vec_make<T>(args...);\n return vector<decltype(inner)>(n, inner);\n}\n\ntemplate<typename T>\nauto vec_reserve(i64 cap) {\n vector<T> res;\n res.reserve(cap);\n return res;\n}\n\ntemplate<typename T=i64>\nauto vec_iota(i64 n, T init={}) {\n vector<i64> res(n);\n ALL(iota, res, init);\n return res;\n}\n\ntemplate<typename T, typename Comp, typename Cont=vector<T>>\nauto priority_queue_make(const Comp& comp, Cont&& cont={}) {\n return priority_queue<T,remove_reference_t<Cont>,Comp>(comp, forward<Cont>(cont));\n}\n\ntemplate<typename T, typename Comp>\nauto priority_queue_reserve(const Comp& comp, i64 cap) {\n return priority_queue<T,vector<T>,Comp>(comp, vec_reserve<T>(cap));\n}\n\ntemplate<typename T, size_t N, size_t... NS>\nstruct ArrayType {\n using type = array<typename ArrayType<T,NS...>::type,N>;\n};\n\ntemplate<typename T, size_t N>\nstruct ArrayType<T,N> {\n using type = array<T,N>;\n};\n\ntemplate<typename T, size_t... NS>\nusing Array = typename ArrayType<T,NS...>::type;\n\ntemplate<typename T, size_t N>\nT& array_at(Array<T,N>& ary, i64 i) {\n return ary[i];\n}\n\ntemplate<typename T, size_t N, size_t... NS, typename... Args>\nT& array_at(Array<T,N,NS...>& ary, i64 i, Args... args) {\n return array_at<T,NS...>(ary[i], args...);\n}\n\ntemplate<typename T, size_t N>\nconst T& array_at(const Array<T,N>& ary, i64 i) {\n return ary[i];\n}\n\ntemplate<typename T, size_t N, size_t... NS, typename... Args>\nconst T& array_at(const Array<T,N,NS...>& ary, i64 i, Args... args) {\n return array_at<T,NS...>(ary[i], args...);\n}\n\ntemplate<typename T, typename C>\nT POP(stack<T,C>& stk) {\n T x = stk.top(); stk.pop();\n return x;\n}\n\ntemplate<typename T, typename C>\nT POP(queue<T,C>& que) {\n T x = que.front(); que.pop();\n return x;\n}\n\ntemplate<typename T, typename C, typename Comp>\nT POP(priority_queue<T,C,Comp>& que) {\n T x = que.top(); que.pop();\n return x;\n}\n// }}}\n\n// fixpoint {{{\ntemplate<typename F>\nclass FixPoint {\npublic:\n explicit constexpr FixPoint(F&& f) : f_(forward<F>(f)) {}\n\n template<typename... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return f_(*this, forward<Args>(args)...);\n }\n\nprivate:\n F f_;\n};\n\ntemplate<typename F>\nconstexpr decltype(auto) FIX(F&& f) {\n return FixPoint<F>(forward<F>(f));\n}\n\ntemplate<typename F, size_t... NS>\nclass FixPointMemo {\npublic:\n explicit FixPointMemo(F&& f) : f_(forward<F>(f)) {}\n\n template<typename... Args>\n decltype(auto) operator()(Args... args) const {\n using R = decltype(f_(*this,args...));\n static Array<bool,NS...> done {};\n static Array<R,NS...> memo;\n\n if(!array_at<bool,NS...>(done,args...)) {\n array_at<R,NS...>(memo,args...) = f_(*this,args...);\n array_at<bool,NS...>(done,args...) = true;\n }\n return array_at<R,NS...>(memo,args...);\n }\n\nprivate:\n F f_;\n};\n\ntemplate<size_t... NS, typename F>\ndecltype(auto) FIXMEMO(F&& f) {\n return FixPointMemo<F,NS...>(forward<F>(f));\n}\n// }}}\n\n// math {{{\n/*constexpr*/ i64 GCD(i64 a, i64 b) noexcept {\n /*constexpr*/ auto f_gcd = FIX([](auto&& self, i64 aa, i64 bb) {\n if(bb == 0) return aa;\n return self(bb, aa%bb);\n });\n return f_gcd(ABS(a), ABS(b));\n}\n\n/*constexpr*/ i64 LCM(i64 a, i64 b) noexcept {\n ASSERT(a != 0 && b != 0);\n /*constexpr*/ auto f_gcd = FIX([](auto&& self, i64 aa, i64 bb) {\n if(bb == 0) return aa;\n return self(bb, aa%bb);\n });\n a = ABS(a);\n b = ABS(b);\n return a / f_gcd(a,b) * b;\n}\n\n/*constexpr*/ tuple<i64,i64,i64> EXTGCD(i64 a, i64 b) noexcept {\n /*constexpr*/ auto impl = FIX([](auto&& self, i64 aa, i64 bb) -> tuple<i64,i64,i64> {\n if(bb == 0) return make_tuple(aa, 1, 0);\n i64 g,x,y; tie(g,x,y) = self(bb, aa%bb);\n return make_tuple(g, y, x-(aa/bb)*y);\n });\n i64 g,x,y; tie(g,x,y) = impl(ABS(a), ABS(b));\n x *= SGN(a);\n y *= SGN(b);\n return make_tuple(g, x, y);\n}\n// }}}\n\n// string {{{\nauto str_reserve(i64 cap) {\n string res;\n res.reserve(cap);\n return res;\n}\n// }}}\n\n// input {{{\ntemplate<typename T, typename Enable=void>\nstruct Scan {\n static T scan(istream& in) {\n T res;\n in >> res;\n return res;\n }\n};\n\ntemplate<typename T, typename Enable=void>\nstruct Scan1;\n\ntemplate<typename T>\nstruct Scan1<T,enable_if_t<is_integral<T>::value && !is_same<T,bool>::value>> {\n static T scan1(istream& in) {\n return Scan<T>::scan(in) - 1;\n }\n};\n\ntemplate<typename T1, typename T2>\nstruct Scan<pair<T1,T2>> {\n static pair<T1,T2> scan(istream& in) {\n T1 x = Scan<T1>::scan(in);\n T2 y = Scan<T2>::scan(in);\n return {x,y};\n }\n};\n\ntemplate<typename T1, typename T2>\nstruct Scan1<pair<T1,T2>> {\n static pair<T1,T2> scan1(istream& in) {\n T1 x = Scan1<T1>::scan1(in);\n T2 y = Scan1<T2>::scan1(in);\n return {x,y};\n }\n};\n\ntemplate<typename T>\ntuple<T> tuple_scan_impl(istream& in) {\n return make_tuple(Scan<T>::scan(in));\n}\n\ntemplate<typename T, typename... TS, SFINAE(sizeof...(TS) > 0)>\ntuple<T,TS...> tuple_scan_impl(istream& in) {\n auto head = make_tuple(Scan<T>::scan(in));\n return tuple_cat(head, tuple_scan_impl<TS...>(in));\n}\n\ntemplate<typename... TS>\nstruct Scan<tuple<TS...>> {\n static tuple<TS...> scan(istream& in) {\n return tuple_scan_impl<TS...>(in);\n }\n};\n\ntemplate<typename T>\ntuple<T> tuple_scan1_impl(istream& in) {\n return make_tuple(Scan1<T>::scan1(in));\n}\n\ntemplate<typename T, typename... TS, SFINAE(sizeof...(TS) > 0)>\ntuple<T,TS...> tuple_scan1_impl(istream& in) {\n auto head = make_tuple(Scan1<T>::scan1(in));\n return tuple_cat(head, tuple_scan1_impl<TS...>(in));\n}\n\ntemplate<typename... TS>\nstruct Scan1<tuple<TS...>> {\n static tuple<TS...> scan1(istream& in) {\n return tuple_scan1_impl<TS...>(in);\n }\n};\n\ntemplate<typename T=i64>\nT RD() {\n return Scan<T>::scan(cin);\n}\n\ntemplate<typename T=i64>\nT RD1() {\n return Scan1<T>::scan1(cin);\n}\n\ntemplate<typename T=i64>\nauto RD_VEC(i64 n) {\n auto res = vec_reserve<T>(n);\n REP(_, n) {\n res.emplace_back(RD<T>());\n }\n return res;\n}\n\ntemplate<typename T=i64>\nauto RD1_VEC(i64 n) {\n auto res = vec_reserve<T>(n);\n REP(_, n) {\n res.emplace_back(RD1<T>());\n }\n return res;\n}\n\ntemplate<typename T=i64>\nauto RD_VEC2(i64 h, i64 w) {\n auto res = vec_reserve<vector<T>>(h);\n REP(_, h) {\n res.emplace_back(RD_VEC<T>(w));\n }\n return res;\n}\n\ntemplate<typename T=i64>\nauto RD1_VEC2(i64 h, i64 w) {\n auto res = vec_reserve<vector<T>>(h);\n REP(_, h) {\n res.emplace_back(RD1_VEC<T>(w));\n }\n return res;\n}\n// }}}\n\n// output {{{\ntemplate<typename T, typename Enable=void>\nstruct Fmt {\n static void fmt(ostream& out, const T& x) { out << x; }\n};\n\ntemplate<typename T>\nvoid fmt_write(ostream& out, const T& x) {\n Fmt<T>::fmt(out, x);\n}\n\ntemplate<typename... TS>\nstruct Fmt<tuple<TS...>> {\n static void fmt(ostream& out, const tuple<TS...>& t) {\n tuple_enumerate(t, [&out](i64 i, const auto& e) {\n if(i != 0) out << ' ';\n fmt_write(out, e);\n });\n }\n};\n\ntemplate<typename T1, typename T2>\nstruct Fmt<pair<T1,T2>> {\n static void fmt(ostream& out, const pair<T1,T2>& p) {\n return fmt_write(out, make_tuple(p.first,p.second));\n }\n};\n\ntemplate<typename C>\nstruct Fmt<C,enable_if_t<is_container<C>::value>> {\n static void fmt(ostream& out, const C& c) {\n for(auto it = begin(c); it != end(c); ++it) {\n if(it != begin(c)) out << ' ';\n fmt_write(out, *it);\n }\n }\n};\n\nvoid PRINT() {}\n\ntemplate<typename T, typename... TS>\nvoid PRINT(const T& x, const TS&... args) {\n fmt_write(cout, x);\n if(sizeof...(args) > 0) {\n cout << ' ';\n PRINT(args...);\n }\n}\n\ntemplate<typename... TS>\nvoid PRINTLN(const TS&... args) {\n PRINT(args...);\n cout << '\\n';\n}\n// }}}\n\n// debug {{{\ntemplate<typename T, typename Enable=void>\nstruct Dbg {\n static void dbg(ostream& out, const T& x) { out << x; }\n};\n\ntemplate<typename T>\nvoid dbg_write(ostream& out, const T& x) {\n Dbg<T>::dbg(out, x);\n}\n\ntemplate<>\nstruct Dbg<i64> {\n static void dbg(ostream& out, i64 x) {\n if(x == INF)\n out << \"INF\";\n else if(x == -INF)\n out << \"-INF\";\n else\n out << x;\n }\n};\n\ntemplate<>\nstruct Dbg<f64> {\n static void dbg(ostream& out, f64 x) {\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wfloat-equal\"\n if(x == FINF)\n out << \"FINF\";\n else if(x == -FINF)\n out << \"-FINF\";\n else\n out << x;\n#pragma GCC diagnostic pop\n }\n};\n\ntemplate<typename T, size_t N>\nstruct Dbg<T[N]> {\n static void dbg(ostream& out, const T (&ary)[N]) {\n out << \"[\";\n REP(i, N) {\n if(i != 0) out << \",\";\n dbg_write(out, ary[i]);\n }\n out << \"]\";\n }\n};\n\ntemplate<size_t N>\nstruct Dbg<char[N]> {\n static void dbg(ostream& out, const char (&s)[N]) {\n out << s;\n }\n};\n\ntemplate<typename... TS>\nstruct Dbg<tuple<TS...>> {\n static void dbg(ostream& out, const tuple<TS...>& t) {\n out << \"(\";\n tuple_enumerate(t, [&out](i64 i, const auto& e) {\n if(i != 0) out << \",\";\n dbg_write(out, e);\n });\n out << \")\";\n }\n};\n\ntemplate<typename T1, typename T2>\nstruct Dbg<pair<T1,T2>> {\n static void dbg(ostream& out, const pair<T1,T2>& p) {\n return dbg_write(out, make_tuple(p.first,p.second));\n }\n};\n\ntemplate<typename C>\nstruct Dbg<C,enable_if_t<is_container<C>::value>> {\n static void dbg(ostream& out, const C& c) {\n out << \"[\";\n for(auto it = begin(c); it != end(c); ++it) {\n if(it != begin(c)) out << \",\";\n dbg_write(out, *it);\n }\n out << \"]\";\n }\n};\n\ntemplate<typename T, typename C>\nstruct Dbg<stack<T,C>> {\n static void dbg(ostream& out, stack<T,C> stk) {\n out << \"[\";\n while(!stk.empty()) {\n dbg_write(out,stk.top()); stk.pop();\n if(!stk.empty()) out << \",\";\n }\n out << \"]\";\n }\n};\n\ntemplate<typename T, typename C>\nstruct Dbg<queue<T,C>> {\n static void dbg(ostream& out, queue<T,C> que) {\n out << \"[\";\n while(!que.empty()) {\n dbg_write(out,que.front()); que.pop();\n if(!que.empty()) out << \",\";\n }\n out << \"]\";\n }\n};\n\ntemplate<typename T, typename C, typename Comp>\nstruct Dbg<priority_queue<T,C,Comp>> {\n static void dbg(ostream& out, priority_queue<T,C,Comp> que) {\n out << \"[\";\n while(!que.empty()) {\n dbg_write(out,que.top()); que.pop();\n if(!que.empty()) out << \",\";\n }\n out << \"]\";\n }\n};\n\ntemplate<typename T>\nvoid DBG_IMPL(i64 line, const char* expr, const T& value) {\n cerr << \"[L \" << line << \"]: \";\n cerr << expr << \" = \";\n dbg_write(cerr, value);\n cerr << \"\\n\";\n}\n\nvoid DBG_IMPL_HELPER() {}\n\ntemplate<typename T, typename... TS>\nvoid DBG_IMPL_HELPER(const T& x, const TS&... args) {\n dbg_write(cerr, x);\n if(sizeof...(args) > 0) {\n cerr << \",\";\n DBG_IMPL_HELPER(args...);\n }\n}\n\ntemplate<typename... TS>\nvoid DBG_IMPL(i64 line, const char* expr, const TS&... value) {\n cerr << \"[L \" << line << \"]: \";\n cerr << \"(\" << expr << \") = (\";\n DBG_IMPL_HELPER(value...);\n cerr << \")\\n\";\n}\n\ntemplate<size_t N, typename T, SFINAE(rank<T>::value == 0)>\nvoid DBG_DP_IMPL_HELPER(ostream& out, const T& x, const array<i64,N>&, const array<i64,N>&) {\n dbg_write(out, x);\n}\n\ntemplate<size_t N, typename T, SFINAE(rank<T>::value > 0)>\nvoid DBG_DP_IMPL_HELPER(ostream& out, const T& x, const array<i64,N>& sizes, const array<i64,N>& offs) {\n i64 k = N - rank<T>::value;\n i64 off = offs[k];\n i64 siz = sizes[k];\n if(siz == 0) siz = extent<T>::value - off;\n\n out << \"[\";\n FOR(i, off, off+siz) {\n if(i != off) out << \",\";\n DBG_DP_IMPL_HELPER(out, x[i], sizes, offs);\n }\n out << \"]\";\n}\n\ntemplate<typename T, SFINAE(rank<T>::value > 0)>\nvoid DBG_DP_IMPL(i64 line, const char* expr, const T& dp,\n const array<i64,rank<T>::value>& sizes={},\n const array<i64,rank<T>::value>& offs={})\n{\n cerr << \"[L \" << line << \"]: \";\n cerr << expr << \" = \";\n DBG_DP_IMPL_HELPER<rank<T>::value>(cerr, dp, sizes, offs);\n cerr << \"\\n\";\n}\n\ntemplate<typename T>\nvoid DBG_GRID_IMPL(i64 line, const char* expr, const vector<T>& grid) {\n cerr << \"[L \" << line << \"]: \";\n cerr << expr << \":\\n\";\n for(const auto& row : grid) {\n dbg_write(cerr, row);\n cerr << \"\\n\";\n }\n cerr << \"\\n\";\n}\n\n#ifdef PROCON_LOCAL\n #define DBG(args...) DBG_IMPL(__LINE__, CPP_STR_I(args), args)\n #define DBG_DP(args...) DBG_DP_IMPL(__LINE__, CPP_STR_I(args), args)\n #define DBG_GRID(args...) DBG_GRID_IMPL(__LINE__, CPP_STR_I(args), args)\n#else\n #define DBG(args...)\n #define DBG_DP(args...)\n #define DBG_GRID(args...)\n#endif\n// }}}\n\n// modint {{{\ntemplate<typename Mod>\nclass ModIntT {\nprivate:\n i64 v_; // [0,Mod::value)\n\n static i64 mod() { return Mod::value; }\n\n static i64 normalize(i64 x) {\n i64 res = x % mod();\n if(res < 0) res += mod();\n return res;\n }\n\npublic:\n ModIntT() : v_(0) {}\n ModIntT(i64 v) : v_(normalize(v)) {}\n\n explicit operator i64() const { return v_; }\n\n ModIntT operator-() const { return ModIntT(-v_); }\n\n ModIntT& operator+=(ModIntT rhs) {\n v_ = normalize(v_ + rhs.v_);\n return *this;\n }\n ModIntT& operator-=(ModIntT rhs) {\n v_ = normalize(v_ - rhs.v_);\n return *this;\n }\n ModIntT& operator*=(ModIntT rhs) {\n v_ = normalize(v_ * rhs.v_);\n return *this;\n }\n\n ModIntT& operator++() { return *this += 1; }\n ModIntT& operator--() { return *this -= 1; }\n ModIntT operator++(int) { return exchange(*this, *this+1); }\n ModIntT operator--(int) { return exchange(*this, *this-1); }\n\n ModIntT inv() const {\n i64 g,x; tie(g,x,ignore) = EXTGCD(v_, mod());\n ASSERT(g == 1);\n return ModIntT(x);\n }\n};\n\ntemplate<typename Mod>\nModIntT<Mod> operator+(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) += rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator+(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) += rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator+(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) += lhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator-(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) -= rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator-(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) -= rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator-(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) -= lhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator*(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) *= rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator*(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) *= rhs; }\ntemplate<typename Mod>\nModIntT<Mod> operator*(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) *= lhs; }\n\ntemplate<typename Mod>\nbool operator==(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return i64(lhs) == i64(rhs); }\ntemplate<typename Mod>\nbool operator==(ModIntT<Mod> lhs, i64 rhs) { return lhs == ModIntT<Mod>(rhs); }\ntemplate<typename Mod>\nbool operator==(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) == rhs; }\ntemplate<typename Mod>\nbool operator!=(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return !(lhs == rhs); }\ntemplate<typename Mod>\nbool operator!=(ModIntT<Mod> lhs, i64 rhs) { return !(lhs == rhs); }\ntemplate<typename Mod>\nbool operator!=(i64 lhs, ModIntT<Mod> rhs) { return !(lhs == rhs); }\n\ntemplate<typename Mod>\nstruct ProconHash<ModIntT<Mod>> {\n size_t operator()(ModIntT<Mod> x) const noexcept {\n return procon_hash_value(i64(x));\n }\n};\n\ntemplate<typename Mod>\nstruct Scan<ModIntT<Mod>> {\n static ModIntT<Mod> scan(istream& in) {\n i64 v = Scan<i64>::scan(in);\n return ModIntT<Mod>(v);\n }\n};\n\ntemplate<typename Mod>\nstruct Fmt<ModIntT<Mod>> {\n static void fmt(ostream& out, ModIntT<Mod> x) {\n fmt_write(out, i64(x));\n }\n};\n\ntemplate<typename Mod>\nstruct Dbg<ModIntT<Mod>> {\n static void dbg(ostream& out, ModIntT<Mod> x) {\n dbg_write(out, i64(x));\n }\n};\n\ntemplate<i64 M>\nusing ModIntC = ModIntT<integral_constant<i64,M>>;\n\nusing ModInt = ModIntC<MOD>;\n// }}}\n// }}}\n\n// init {{{\nstruct ProconInit {\n static constexpr int IOS_PREC = 15;\n static constexpr bool AUTOFLUSH = false;\n\n ProconInit() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cin.exceptions(ios::failbit | ios::badbit);\n cout << fixed << setprecision(IOS_PREC);\n#ifdef PROCON_LOCAL\n cerr << fixed << setprecision(2);\n#endif\n if(AUTOFLUSH)\n cout << unitbuf;\n }\n} PROCON_INIT;\n// }}}\n\n//--------------------------------------------------------------------\n\ni64 NORM(i64 x1, i64 y1, i64 x2, i64 y2) {\n i64 dx = x1 - x2;\n i64 dy = y1 - y2;\n return dx*dx + dy*dy;\n}\n\nauto make_graph(const vector<tuple<i64,i64,i64>>& cs) {\n i64 n = SIZE(cs);\n\n vector<vector<i64>> g(n);\n REP(i, n) REP(j, n) {\n if(i == j) continue;\n i64 x1,y1,r1; tie(x1,y1,r1) = cs[i];\n i64 x2,y2,r2; tie(x2,y2,r2) = cs[j];\n\n if(f64(r1) > sqrt(NORM(x1,y1,x2,y2)) + f64(r2))\n g[i].emplace_back(j);\n }\n\n return g;\n}\n\nauto calc_dp(const vector<vector<i64>>& g) {\n i64 n = SIZE(g);\n\n vector<i64> dp(n, 0);\n auto dfs = FIX([&g,&dp](auto&& self, i64 v) -> i64 {\n if(dp[v] > 0) return dp[v];\n i64 res = 1;\n for(i64 to : g[v])\n chmax(res, 1+self(to));\n return dp[v] = res;\n });\n REP(v, n) {\n dfs(v);\n }\n\n return dp;\n}\n\nvoid solve(i64 N) {\n i64 sx = RD();\n i64 sy = RD();\n i64 tx = RD();\n i64 ty = RD();\n auto C = RD_VEC<tuple<i64,i64,i64>>(N);\n\n vector<tuple<i64,i64,i64>> scs;\n vector<tuple<i64,i64,i64>> tcs;\n for(const auto& c : C) {\n i64 x,y,r; tie(x,y,r) = c;\n bool s_in = NORM(x,y,sx,sy) < r*r;\n bool t_in = NORM(x,y,tx,ty) < r*r;\n if(s_in == t_in) continue;\n\n if(s_in)\n scs.emplace_back(x,y,r);\n else\n tcs.emplace_back(x,y,r);\n }\n i64 sn = SIZE(scs);\n i64 tn = SIZE(tcs);\n DBG(sn, scs);\n DBG(tn, tcs);\n\n auto sg = make_graph(scs);\n auto tg = make_graph(tcs);\n DBG(sg);\n DBG(tg);\n\n auto sdp = calc_dp(sg);\n auto tdp = calc_dp(tg);\n DBG(sdp);\n DBG(tdp);\n\n i64 ans = 0;\n // scs のみを使う\n if(sn > 0)\n chmax(ans, *ALL(max_element, sdp));\n // tcs のみを使う\n if(tn > 0)\n chmax(ans, *ALL(max_element, tdp));\n // scs, tcs を両方使う\n REP(i, sn) REP(j, tn) {\n i64 x1,y1,r1; tie(x1,y1,r1) = scs[i];\n i64 x2,y2,r2; tie(x2,y2,r2) = tcs[j];\n if(NORM(x1,y1,x2,y2) <= (r1+r2)*(r1+r2)) continue;\n\n chmax(ans, sdp[i] + tdp[j]);\n }\n\n PRINTLN(ans);\n}\n\nsigned main() {\n for(;;) {\n i64 N = RD();\n if(N == 0) break;\n solve(N);\n }\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":8516,"score_of_the_acc":-0.7602,"final_rank":18},{"submission_id":"aoj_2181_3742263","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Float = double;\nusing Point = complex<Float>;\nstruct Circle{ Point center; Float r; };\n\nconst Float EPS = 1e-8;\n\nFloat distance(Point &p1,Point &p2){\n return abs(p1 - p2);\n}\n\nbool isContain(Circle &c,Point &p){\n return (distance(c.center,p) <= c.r + EPS);\n}\n\nbool isContain(Circle &c1,Circle &c2){\n return (c1.r - EPS>= c2.r + distance(c1.center,c2.center));\n}\n\nbool isIntersect(Circle &c1,Circle &c2){\n return (distance(c1.center,c2.center) <= c1.r + c2.r + EPS);\n}\n\nvoid calcContainable(vector<Circle> &circs,vector<int> &ret){\n sort(circs.begin(),circs.end(),[](const Circle &c1,const Circle &c2){\n return c1.r < c2.r;\n });\n ret.resize(circs.size());\n for(int i = 0;i < circs.size();i++){\n ret[i] = 1;\n for(int j = 0;j < i;j++){\n if(isContain(circs[i],circs[j])){\n ret[i] = max(ret[i],ret[j] + 1);\n }\n }\n }\n}\n\nsigned main(){\n int n;\n while(cin >> n,n){\n Float xs,ys,xt,yt;\n vector<Circle> circleS,circleT;\n int ans = 0;\n cin >> xs >> ys >> xt >> yt;\n Point ps = Point(xs,ys),pt = Point(xt,yt);\n for(int i = 0;i < n;i++){\n Float x,y,r;\n cin >> x >> y >> r;\n Circle circ = {Point(x,y),r};\n if(isContain(circ,ps) ^ isContain(circ,pt)){\n (isContain(circ,ps) ? circleS : circleT).push_back(circ);\n }\n }\n vector<int> containableS,containableT;\n calcContainable(circleS,containableS);\n calcContainable(circleT,containableT);\n for(int i = 0;i < circleS.size();i++) ans = max(ans,containableS[i]);\n for(int i = 0;i < circleT.size();i++) ans = max(ans,containableT[i]);\n for(int i = 0;i < circleS.size();i++){\n for(int j = 0;j < circleT.size();j++){\n if(!isIntersect(circleS[i],circleT[j])) ans = max(ans,containableS[i] + containableT[j]);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3144,"score_of_the_acc":-0.075,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2181_10853898\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <math.h>\\n#include <string.h>\\n#include <stdlib.h>\\n\\ntypedef struct _c {\\n int x,y,r;\\n}circle;\\n\\nconst double LIT=1e-6;\\n\\ncircle p1[2000],p2[2000];\\nint dp1[2000], dp2[2000];\\n\\nint cmp(const void *a, const void *b) {\\n return (((const circle*)a)->r)-(((const circle*)b)->r);\\n}\\n\\ndouble dis(circle a, circle b) {\\n return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\\n}\\n\\nint c_isin(circle a, circle b) {\\n return dis(a,b)+LIT<abs(a.r-b.r);\\n}\\n\\nint p_isin(int x, int y, circle b) {\\n circle a;\\n a.x=x;a.y=y;a.r=0;\\n return c_isin(a,b);\\n}\\n\\nint touch(circle a, circle b) {\\n double d = dis(a,b);\\n return d-LIT<abs(a.r+b.r);\\n}\\n\\nint max(int a,int b) {\\n return (a>b)?a:b;\\n}\\n\\nvoid lis(int dp[], circle t[], int n) {\\n int i,j,k,l;\\n memset(dp, 0, sizeof(dp));\\n qsort(t+1,n,sizeof(circle), cmp);\\n for(i=1;i<=n;i++) {\\n dp[i] = 1;\\n for(j=1;j<i;j++) {\\n if(c_isin(t[i],t[j])) {\\n dp[i]=max(dp[i], dp[j]+1);\\n }\\n }\\n }\\n}\\n\\nint main(void) {\\n int i,j,k,l,n1,n2,n;\\n int sol=0;\\n int x,y,r;\\n int xs,ys,xt,yt;\\n circle t;\\n while(1) {\\n sol=0;\\n scanf(\\\"%d\\\", &n);\\n if(n==0) {\\n break;\\n }\\n scanf(\\\"%d%d%d%d\\\", &xs, &ys, &xt, &yt);\\n n1=0;\\n n2=0;\\n for(i=1;i<=n;i++) {\\n k=0;l=0;\\n scanf(\\\"%d%d%d\\\", &t.x, &t.y, &t.r);\\n k=p_isin(xs,ys, t);\\n l=p_isin(xt,yt,t);\\n if(k&&!l) {\\n p1[++n1]=t;\\n }\\n else if(!k&&l) {\\n p2[++n2]=t;\\n }\\n }\\n lis(dp1, p1,n1);\\n lis(dp2,p2,n2);\\n for(i=1;i<=n1;i++) {\\n for(j=1;j<=n2;j++) {\\n if(!touch(p1[i],p2[j])) {\\n sol=max(sol, dp1[i]+dp2[j]);\\n }\\n }\\n }\\n for(i=1;i<=n1;i++) {\\n sol=max(sol, dp1[i]);\\n }\\n for(i=1;i<=n2;i++) {\\n sol=max(sol,dp2[i]);\\n }\\n printf(\\\"%d\\\\n\\\", sol);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2856,\n \"score_of_the_acc\": -0.0127,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2181_9766669\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct Point {\\n double X, Y;\\n};\\n\\nstruct Circle {\\n Point P;\\n double R;\\n Circle(Point p, double r) : P(p), R(r) {};\\n};\\n\\ndouble sq(double D) {\\n return D*D;\\n}\\n\\ndouble normPP(Point P, Point Q) {\\n return sq(P.X-Q.X) + sq(P.Y-Q.Y);\\n}\\n\\nbool ContainCP(Circle C, Point P) {\\n return normPP(C.P,P) < sq(C.R);\\n}\\n\\nbool ContainCC(Circle C1, Circle C2) { // C1 in C2\\n double D = sqrt(normPP(C1.P,C2.P));\\n return D + C1.R < C2.R;\\n}\\n\\nbool notintersect(Circle C1, Circle C2) {\\n double D = sqrt(normPP(C1.P,C2.P));\\n return C1.R + C2.R < D;\\n}\\n\\nint main() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n Point A, B;\\n cin >> A.X >> A.Y >> B.X >> B.Y;\\n vector<Circle> S, T;\\n S.push_back(Circle(A,0.0));\\n T.push_back(Circle(B,0.0));\\n rep(i,0,N) {\\n Point P;\\n double R;\\n cin >> P.X >> P.Y >> R;\\n Circle C(P,R);\\n bool checkA = ContainCP(C,A), checkB = ContainCP(C,B);\\n if (checkA == checkB) continue;\\n if (checkA) S.push_back(C);\\n if (checkB) T.push_back(C);\\n }\\n N = S.size();\\n int M = T.size();\\n sort(ALL(S),[](Circle C1, Circle C2){return C1.R < C2.R;});\\n sort(ALL(T),[](Circle C1, Circle C2){return C1.R < C2.R;});\\n vector<int> DPS(N,0), DPT(M,0);\\n rep(i,1,N) {\\n rep(j,0,i) {\\n if (ContainCC(S[j],S[i])) chmax(DPS[i],DPS[j]+1);\\n }\\n }\\n rep(i,0,M) {\\n rep(j,0,i) {\\n if (ContainCC(T[j],T[i])) chmax(DPT[i],DPT[j]+1);\\n }\\n }\\n int ANS = 0;\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (notintersect(S[i],T[j])) chmax(ANS,DPS[i]+DPT[j]);\\n }\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.0834,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2181_8016528\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rng(i, l, r) for(int i = int(l); i < int(r); i++)\\n#define rep(i, n) rng(i, 0, n)\\nusing ll = long long;\\n#define sz(v) int(v.size())\\n#define all(v) v.begin(), v.end()\\nusing ld = long double;\\nusing point = complex<ld>;\\npoint input_pt() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn point(x, y);\\n}\\ntemplate <class T>\\nbool chmax(T& a, T b) {\\n\\treturn a < b ? a = b, 1 : 0;\\n}\\nint n;\\nvoid solve() {\\n\\tpoint start = input_pt();\\n\\tpoint goal = input_pt();\\n\\n\\tvector<pair<ld, point>> circs(n);\\n\\n\\tvector<pair<ld, point>> contain_start, contain_goal;\\n\\n\\tauto contain = [](point p, point center, ld radius) { return abs(p - center) < radius; };\\n\\n\\trep(i, n) {\\n\\t\\tpoint center = input_pt();\\n\\t\\tld radius;\\n\\t\\tcin >> radius;\\n\\t\\tbool cont_s = contain(start, center, radius);\\n\\t\\tbool cont_g = contain(goal, center, radius);\\n\\t\\tif(cont_s) {\\n\\t\\t\\tif(!cont_g) contain_start.emplace_back(radius, center);\\n\\t\\t} else if(cont_g) {\\n\\t\\t\\tcontain_goal.emplace_back(radius, center);\\n\\t\\t}\\n\\t}\\n\\n\\tauto cmp = [](const pair<ld, point>& a, const pair<ld, point>& b) { return a.first < b.first; };\\n\\tauto slv = [&cmp](vector<pair<ld, point>>& walls) {\\n\\t\\tsort(all(walls), cmp);\\n\\t\\tint ws = sz(walls);\\n\\t\\tvector<int> ans(ws, 1);\\n\\n\\t\\tauto include = [&walls](int small, int large) -> bool {\\n\\t\\t\\tpoint cs, cl;\\n\\t\\t\\tld rs, rl;\\n\\t\\t\\ttie(rs, cs) = walls[small];\\n\\t\\t\\ttie(rl, cl) = walls[large];\\n\\t\\t\\tld d = abs(cs - cl);\\n\\t\\t\\treturn d + rs < rl;\\n\\t\\t};\\n\\n\\t\\trep(i, ws) {\\n\\t\\t\\trng(j, i + 1, ws) {\\n\\t\\t\\t\\tif(include(i, j)) { chmax(ans[j], ans[i] + 1); }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t};\\n\\n\\tvector<int> s = slv(contain_start);\\n\\tvector<int> g = slv(contain_goal);\\n\\n\\tint ans = 0;\\n\\tif(s.size()) ans = *max_element(all(s));\\n\\tif(g.size()) chmax(ans, *max_element(all(g)));\\n\\n\\tif(sz(s) && sz(g)) {\\n\\t\\trep(i, sz(s)) rep(j, sz(g)) {\\n\\t\\t\\tauto& fs = contain_start[i];\\n\\t\\t\\tauto& fg = contain_goal[j];\\n\\n\\t\\t\\tif(fs.first + fg.first < abs(fs.second - fg.second)) { chmax(ans, s[i] + g[j]); }\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ans << endl;\\n}\\nint main() {\\n\\twhile(cin >> n && n) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.194,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2181_6285729\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n\\nbool check_surround(int x, int y, int p, int q, int r) {\\n return (r*r > ((x-p)*(x-p)+(y-q)*(y-q)));\\n}\\n\\nbool check_cross(int x1, int y1, int r1, int x2, int y2, int r2) {\\n return ((r1-r2)*(r1-r2) <= ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) && ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= (r1+r2)*(r1+r2));\\n}\\n\\nstruct Circle {\\n Circle(int x, int y, int r, int include) : x{x}, y{y}, r{r}, include{include} {}\\n int x;\\n int y;\\n int r;\\n int include;\\n};\\n\\nbool compare(Circle &l, Circle &r) {\\n return l.r < r.r;\\n}\\n\\nint main() {\\n int N;\\n while (cin >> N && N > 0) {\\n vector<Circle> rat_data;\\n vector<Circle> Maki_data;\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n for (int i=0; i<N; ++i) {\\n int x,y,r;\\n cin >> x >> y >> r;\\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\\n Circle d(x,y,r,1);\\n if (!check_surround(x,y,xt,yt,r)) {\\n rat_data.push_back(d);\\n } else if (!check_surround(x,y,xs,ys,r)) {\\n Maki_data.push_back(d);\\n }\\n }\\n }\\n sort(rat_data.begin(), rat_data.end(), compare);\\n sort(Maki_data.begin(), Maki_data.end(), compare);\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\\n }\\n }\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\\n }\\n }\\n }\\n int max = 0;\\n if (rat_data.size() == 0) {\\n if (Maki_data.size() == 0) {\\n max = 0;\\n } else {for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n }\\n } else {\\n if (Maki_data.size() == 0) {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n } else {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<Maki_data.size(); ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (max < (rat_data[i].include + Maki_data[j].include))\\n max = rat_data[i].include + Maki_data[j].include;\\n }\\n }\\n }\\n }\\n }\\n cout << max << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.0699,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2181_6274107\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nbool check_surround(int x, int y, int p, int q, int r) {\\n return (r*r > ((x-p)*(x-p)+(y-q)*(y-q)));\\n}\\n\\nbool check_cross(int x1, int y1, int r1, int x2, int y2, int r2) {\\n return ((r1-r2)*(r1-r2) <= ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) && ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= (r1+r2)*(r1+r2));\\n}\\n\\n/*\\nstruct Circle {\\n Circle(int x, int y, int r, double dist_rat, double dist_Maki, int include) : x{x}, y{y}, r{r}, dist_rat{dist_rat}, dist_Maki{dist_Maki}, include{include} {}\\n int x;\\n int y;\\n int r;\\n double dist_rat;\\n double dist_Maki;\\n int include;\\n};\\n*/\\nstruct Circle {\\n Circle(int x, int y, int r, int include) : x{x}, y{y}, r{r}, include{include} {}\\n int x;\\n int y;\\n int r;\\n int include;\\n};\\n\\n/*\\nbool compare_rat(Circle &l, Circle &r) {\\n if (l.dist_rat != r.dist_rat) return l.dist_rat < r.dist_rat;\\n else return l.r < r.r;\\n}\\n\\nbool compare_Maki(Circle &l, Circle &r) {\\n if (l.dist_Maki != r.dist_Maki) return l.dist_Maki < r.dist_Maki;\\n else return l.r < r.r;\\n}\\n*/\\nbool compare(Circle &l, Circle &r) {\\n return l.r < r.r;\\n}\\n/*\\nint main() {\\n int N;\\n while (cin >> N && N > 0) {\\n vector<Circle> rat_data;\\n vector<Circle> Maki_data;\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n for (int i=0; i<N; ++i) {\\n int x,y,r;\\n cin >> x >> y >> r;\\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\\n if (!check_surround(x,y,xt,yt,r)) {\\n Circle d(x,y,r,r-sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt))-r,1);\\n rat_data.push_back(d);\\n }\\n else if (!check_surround(x,y,xs,ys,r)) {\\n Circle d(x,y,r,sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),r-sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt)),1);\\n Maki_data.push_back(d);\\n }\\n }\\n }\\n sort(rat_data.begin(), rat_data.end(), compare_rat);\\n sort(Maki_data.begin(), Maki_data.end(), compare_Maki);\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\\n }\\n }\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\\n }\\n }\\n }\\n int max = 0;\\n if (rat_data.size() == 0) {\\n if (Maki_data.size() == 0) {\\n max = 0;\\n } else {\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n }\\n } else {\\n if (Maki_data.size() == 0) {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n } else {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<Maki_data.size(); ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (max < (rat_data[i].include + Maki_data[j].include))\\n max = rat_data[i].include + Maki_data[j].include;\\n }\\n }\\n }\\n }\\n }\\n cout << max << endl;\\n }\\n}\\n*/\\nint main() {\\n int N;\\n while (cin >> N && N > 0) {\\n vector<Circle> rat_data;\\n vector<Circle> Maki_data;\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n for (int i=0; i<N; ++i) {\\n int x,y,r;\\n cin >> x >> y >> r;\\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\\n Circle d(x,y,r,1);\\n if (!check_surround(x,y,xt,yt,r)) {\\n rat_data.push_back(d);\\n } else if (!check_surround(x,y,xs,ys,r)) {\\n Maki_data.push_back(d);\\n }\\n }\\n }\\n sort(rat_data.begin(), rat_data.end(), compare);\\n sort(Maki_data.begin(), Maki_data.end(), compare);\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\\n }\\n }\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\\n }\\n }\\n }\\n int max = 0;\\n if (rat_data.size() == 0) {\\n if (Maki_data.size() == 0) {\\n max = 0;\\n } else {\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n }\\n } else {\\n if (Maki_data.size() == 0) {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n } else {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<Maki_data.size(); ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (max < (rat_data[i].include + Maki_data[j].include))\\n max = rat_data[i].include + Maki_data[j].include;\\n }\\n }\\n }\\n }\\n }\\n cout << max << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.0454,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2181_6272497\",\n \"code_snippet\": \"#if 0\\n所要時間は7時間。まずはratとMakiどちらかだけを囲む円のみを抽出してstructとして配列rat_dataとMaki_dataに保存し、それぞれratとMakiからの距離でソートして、円をいくつ囲めるかをそれぞれの円で数える。最後に、交差しない組み合わせのうちで内に囲える円の合計が多い組が選択され、その合計が答えとなる。考え方をまとめるのに時間がかかったほか、交わるかを判定する関数check_crossを間違えていたことに気づかず、とても時間がかかってしまった。check_crossでは平方根を取らず2乗のまま判定するので、誤差でつまずく心配がない。この問題では与えられる数値が全て10000以下なのでint型で良いが、大きい数値が与えられた時には上限に注意が必要である。\\n#endif\\n\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nbool check_surround(int x, int y, int p, int q, int r) {\\n return (r*r > ((x-p)*(x-p)+(y-q)*(y-q)));\\n}\\n\\nbool check_cross(int x1, int y1, int r1, int x2, int y2, int r2) {\\n return ((r1-r2)*(r1-r2) <= ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) && ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= (r1+r2)*(r1+r2));\\n}\\n\\nstruct Circle {\\n Circle(int x, int y, int r, double dist_rat, double dist_Maki, int include) : x{x}, y{y}, r{r}, dist_rat{dist_rat}, dist_Maki{dist_Maki}, include{include} {}\\n int x;\\n int y;\\n int r;\\n double dist_rat;\\n double dist_Maki;\\n int include;\\n};\\n\\nbool compare_rat(Circle &l, Circle &r) {\\n if (l.dist_rat != r.dist_rat) return l.dist_rat < r.dist_rat;\\n else return l.r < r.r;\\n}\\n\\nbool compare_Maki(Circle &l, Circle &r) {\\n if (l.dist_Maki != r.dist_Maki) return l.dist_Maki < r.dist_Maki;\\n else return l.r < r.r;\\n}\\n\\nint main() {\\n int N;\\n while (cin >> N && N > 0) {\\n vector<Circle> rat_data;\\n vector<Circle> Maki_data;\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n for (int i=0; i<N; ++i) {\\n int x,y,r;\\n cin >> x >> y >> r;\\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\\n if (!check_surround(x,y,xt,yt,r)) {\\n Circle d(x,y,r,r-sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt))-r,1);\\n rat_data.push_back(d);\\n }\\n else if (!check_surround(x,y,xs,ys,r)) {\\n Circle d(x,y,r,sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),r-sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt)),1);\\n Maki_data.push_back(d);\\n }\\n }\\n }\\n sort(rat_data.begin(), rat_data.end(), compare_rat);\\n sort(Maki_data.begin(), Maki_data.end(), compare_Maki);\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\\n }\\n }\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\\n }\\n }\\n }\\n int max = 0;\\n if (rat_data.size() == 0) {\\n if (Maki_data.size() == 0) {\\n max = 0;\\n } else {\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n }\\n } else {\\n if (Maki_data.size() == 0) {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n } else {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<Maki_data.size(); ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (max < (rat_data[i].include + Maki_data[j].include))\\n max = rat_data[i].include + Maki_data[j].include;\\n }\\n }\\n }\\n }\\n }\\n cout << max << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.052,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2181_6272468\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nbool check_surround(int x, int y, int p, int q, int r) {\\n return (r*r > ((x-p)*(x-p)+(y-q)*(y-q)));\\n}\\n\\nbool check_cross(int x1, int y1, int r1, int x2, int y2, int r2) {\\n return ((r1-r2)*(r1-r2) <= ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) && ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) <= (r1+r2)*(r1+r2));\\n}\\n\\nstruct Circle {\\n Circle(int x, int y, int r, double dist_rat, double dist_Maki, int include) : x{x}, y{y}, r{r}, dist_rat{dist_rat}, dist_Maki{dist_Maki}, include{include} {}\\n int x;\\n int y;\\n int r;\\n double dist_rat;\\n double dist_Maki;\\n int include;\\n};\\n\\nbool compare_rat(Circle &l, Circle &r) {\\n if (l.dist_rat != r.dist_rat) return l.dist_rat < r.dist_rat;\\n else return l.r < r.r;\\n}\\n\\nbool compare_Maki(Circle &l, Circle &r) {\\n if (l.dist_Maki != r.dist_Maki) return l.dist_Maki < r.dist_Maki;\\n else return l.r < r.r;\\n}\\n\\nint main() {\\n int N;\\n while (cin >> N && N > 0) {\\n vector<Circle> rat_data;\\n vector<Circle> Maki_data;\\n int xs,ys,xt,yt;\\n cin >> xs >> ys >> xt >> yt;\\n for (int i=0; i<N; ++i) {\\n int x,y,r;\\n cin >> x >> y >> r;\\n if (check_surround(x,y,xs,ys,r) || check_surround(x,y,xt,yt,r)) {\\n if (!check_surround(x,y,xt,yt,r)) {\\n Circle d(x,y,r,r-sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt))-r,1);\\n rat_data.push_back(d);\\n }\\n else if (!check_surround(x,y,xs,ys,r)) {\\n Circle d(x,y,r,sqrt((x-xs)*(x-xs)+(y-ys)*(y-ys)),r-sqrt((x-xt)*(x-xt)+(y-yt)*(y-yt)),1);\\n Maki_data.push_back(d);\\n }\\n }\\n }\\n sort(rat_data.begin(), rat_data.end(), compare_rat);\\n sort(Maki_data.begin(), Maki_data.end(), compare_Maki);\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,rat_data[j].x,rat_data[j].y,rat_data[j].r)) {\\n if (rat_data[i].include <= rat_data[j].include) rat_data[i].include = rat_data[j].include+1;\\n }\\n }\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n for (int j=0; j<i; ++j) {\\n if (!check_cross(Maki_data[i].x,Maki_data[i].y,Maki_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (Maki_data[i].include <= Maki_data[j].include) Maki_data[i].include = Maki_data[j].include+1;\\n }\\n }\\n }\\n int max = 0;\\n if (rat_data.size() == 0) {\\n if (Maki_data.size() == 0) {\\n max = 0;\\n } else {\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n }\\n } else {\\n if (Maki_data.size() == 0) {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n } else {\\n for (int i=0; i<rat_data.size(); ++i) {\\n if (max < rat_data[i].include)\\n max = rat_data[i].include;\\n }\\n for (int i=0; i<Maki_data.size(); ++i) {\\n if (max < Maki_data[i].include)\\n max = Maki_data[i].include;\\n }\\n for (int i=0; i<rat_data.size(); ++i) {\\n for (int j=0; j<Maki_data.size(); ++j) {\\n if (!check_cross(rat_data[i].x,rat_data[i].y,rat_data[i].r,Maki_data[j].x,Maki_data[j].y,Maki_data[j].r)) {\\n if (max < (rat_data[i].include + Maki_data[j].include))\\n max = rat_data[i].include + Maki_data[j].include;\\n }\\n }\\n }\\n }\\n }\\n cout << max << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.073,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2181_6252706\",\n \"code_snippet\": \"#include <algorithm>\\n#include <complex>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\nusing xy_t = complex<double>;\\nconst double EPS = 1e-10;\\nint n;\\nxy_t s, t;\\n\\nstruct Circle {\\n xy_t c;\\n double r;\\n Circle() {}\\n Circle(double x, double y, double _r)\\n : c{x, y}, r(_r) {}\\n bool in_circle(const xy_t &p) const {\\n return abs(p - c) + EPS <= r;\\n }\\n bool in_circle(const Circle &other) const {\\n return abs(other.c - c) + other.r + EPS <= r;\\n }\\n};\\n\\nvector<int> can_include_circles(const vector<Circle> &crc) {\\n vector<int> dp(crc.size());\\n for(size_t i = 0; i < crc.size(); i++) {\\n dp[i] = 1;\\n for(size_t j = 0; j < i; j++) {\\n if(crc[i].in_circle(crc[j]) && dp[j] + 1 > dp[i]) {\\n dp[i] = dp[j] + 1;\\n }\\n }\\n }\\n return dp;\\n}\\n\\nbool corss(const Circle &x, const Circle &y) {\\n return x.r + y.r + EPS >= abs(x.c - y.c) && abs(x.r - y.r) <= abs(x.c - y.c) + EPS;\\n}\\n\\nint solve() {\\n {\\n double sx, sy, tx, ty;\\n cin >> sx >> sy >> tx >> ty;\\n s = {sx, sy};\\n t = {tx, ty};\\n }\\n vector<Circle> crcS, crcT;\\n for(int i = 0; i < n; i++) {\\n double x, y, r;\\n cin >> x >> y >> r;\\n Circle crc = {x, y, r};\\n if(crc.in_circle(s)) {\\n if(!crc.in_circle(t)) {\\n crcS.push_back(crc);\\n }\\n } else {\\n if(crc.in_circle(t)) {\\n crcT.push_back(crc);\\n }\\n }\\n }\\n auto comp = [](Circle &x, Circle &y) {\\n return x.r < y.r;\\n };\\n sort(begin(crcS), end(crcS), comp);\\n sort(begin(crcT), end(crcT), comp);\\n vector<int> dpS = can_include_circles(crcS),\\n dpT = can_include_circles(crcT);\\n int ans = 0;\\n if(!dpS.empty()) ans = max(ans, *max_element(begin(dpS), end(dpS)));\\n if(!dpT.empty()) ans = max(ans, *max_element(begin(dpT), end(dpT)));\\n\\n for(size_t i = 0; i < crcS.size(); i++) {\\n for(size_t j = 0; j < crcT.size(); j++) {\\n if(!corss(crcS[i], crcT[j])) {\\n ans = max(ans, dpS[i] + dpT[j]);\\n }\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n vector<int> ans;\\n while(1) {\\n cin >> n;\\n if(n == 0) break;\\n ans.push_back(solve());\\n }\\n for(const auto &i : ans) cout << i << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.1273,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2181_6021299\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n;\\n while(cin >> n,n){\\n int sx,sy,tx,ty; cin >> sx >> sy >> tx >> ty;\\n vector<int> vx,vy,vr;\\n vector<int> va,vb;\\n for(int i=0;i<n;i++){\\n int x,y,r; cin >> x >> y >> r;\\n bool f1 = ((x-sx)*(x-sx) + (y-sy)*(y-sy) < r*r);\\n bool f2 = ((x-tx)*(x-tx) + (y-ty)*(y-ty) < r*r);\\n if(f1 and !f2){\\n int j = vx.size();\\n va.push_back(j);\\n vx.push_back(x);\\n vy.push_back(y);\\n vr.push_back(r);\\n }\\n else if(!f1 and f2){\\n int j = vx.size();\\n vb.push_back(j);\\n vx.push_back(x);\\n vy.push_back(y);\\n vr.push_back(r);\\n }\\n }\\n int m = vx.size();\\n int m1 = va.size();\\n int m2 = vb.size();\\n vector<vector<int>> g(m);\\n {\\n for(int i:va){\\n for(int j:va){\\n if(vr[i]<=vr[j])continue;\\n // i->j\\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\\n if(d < vr[i] - vr[j] - 1e-8){\\n g[i].push_back(j);\\n }\\n }\\n }\\n }\\n {\\n for(int i:vb){\\n for(int j:vb){\\n if(vr[i]<=vr[j])continue;\\n // i->j\\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\\n if(d < vr[i] - vr[j] - 1e-8){\\n g[i].push_back(j);\\n }\\n }\\n }\\n }\\n vector<int> dp(n,-1);\\n auto dfs=[&](auto self,int s)->int{\\n if(dp[s] != -1)return dp[s];\\n int res = 0;\\n for(int t:g[s]){\\n res = max(res, self(self, t));\\n }\\n dp[s] = res+1;\\n return res+1;\\n };\\n for(int i=0;i<m;i++){\\n if(dp[i] == -1){\\n dp[i] = dfs(dfs,i);\\n }\\n }\\n int res = 0;\\n for(int i=0;i<m;i++){\\n res = max(res, dp[i]);\\n }\\n for(int i:va){\\n for(int j:vb){\\n double d = sqrt((vx[i]-vx[j])*(vx[i]-vx[j]) + (vy[i]-vy[j])*(vy[i]-vy[j]));\\n if(d > vr[i] + vr[j] + 1e-8){\\n res = max(res, dp[i]+dp[j]);\\n }\\n }\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5984,\n \"score_of_the_acc\": -0.4181,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2181_5946738\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\ntypedef long long ll;\\n#define all(x) (x).begin(),(x).end()\\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\\nlong double eps = 1e-9;\\nlong double pi = acos(-1);\\n\\n/*\\n正規版\\nメモ\\nnorm(P) Pの絶対値の2乗 abs(P)の2乗\\nabs(P) Pの絶対値\\narg(P)の戻り値の範囲は[-π, π]\\npolar(長さ,角度(ラジアン))でPointができる\\nint(-2.2+0.5)=-1\\n*/\\n\\n// #include <bits/stdc++.h>\\n// using namespace std;\\n// template<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}\\n// template<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}\\n// template<class T,class U>constexpr bool bitUP(const T n,const U k){return (n>>k)&1;}\\n\\n\\n\\n////////////////////////////\\n// マクロや型\\n////////////////////////////\\n\\nusing DD=long double;\\n\\nconst DD EPS=1e-9;\\nconst DD INF=1e50;\\nconst DD PI=acosl(-1.0);\\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\\n\\n#define X real()\\n#define Y imag()\\n\\n\\n//点\\nusing Point=complex<DD>;\\nistream &operator>>(istream &is, Point &p) {\\n DD x,y;\\n is>>x>>y;\\n p=Point(x,y);\\n return is;\\n}\\n\\n//点a→点bの線分\\n//aとbが等しい時、色々バグるから注意!\\nstruct Segment{\\n Point a,b;\\n Segment()=default;\\n Segment(Point a,Point b) :a(a),b(b){}\\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){} \\n};\\nusing Line=Segment;\\n\\n//円\\nstruct Circle{\\n Point p;\\n DD r;\\n Circle()=default;\\n Circle(Point p,DD r):p(p),r(r){}\\n};\\n\\n\\n\\n////////////////////////////\\n// 基本計算\\n////////////////////////////\\n\\n//度→ラジアン\\ninline DD torad(const DD deg){return deg*PI/180;}\\n//ラジアン→度\\ninline DD todeg(const DD rad){return rad*180/PI;}\\n//内積 |a||b|cosθ\\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\\n//外積 |a||b|sinθ\\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\\n//ベクトルpを反時計回りにtheta(ラジアン)回転\\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\\n\\n//余弦定理 cos(角度abc(ラジアン))を返す\\n//長さの対応に注意 ab:辺abの長さ\\n//verify:https://codeforces.com/gym/102056/problem/F\\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\\n}\\n\\ninline bool xy_sort(const Point &a,const Point &b){\\n if(a.X+EPS<b.X) return true;\\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\\n return false;\\n}\\ninline bool yx_sort(const Point &a,const Point &b){\\n if(a.Y+EPS<b.Y) return true;\\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\\n return false;\\n}\\n\\n\\n////////////////////////////\\n// 平行や直交\\n////////////////////////////\\n\\nbool isOrthogonal(const Point &a,const Point &b){\\n return EQ(dot(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isOrthogonal(const Segment &s,const Segment &t){\\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\\n}\\nbool isParallel(const Point &a,const Point &b){\\n return EQ(cross(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isParallel(const Segment &s,const Segment &t){\\n return EQ(cross(s.a-s.b,t.a-t.b),0);\\n}\\n//線分a→bに対して点cがどの位置にあるか\\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n//線分a→bの端点にcがあるなら0と判定されるはず\\nint ccw(const Point &a,Point b,Point c){\\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\\n b-=a;c-=a;\\n if(cross(b,c)>EPS) return 1;\\n if(cross(b,c)<-EPS) return -1;\\n if(dot(b,c)<-EPS) return 2;\\n if(LS(norm(b),norm(c))) return -2;\\n return 0;\\n}\\n\\n////////////////////////////\\n// 射影と反射\\n////////////////////////////\\n\\n//射影\\n//直線lに点pから垂線を引いたときの交点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint project(const Point &p,const Line &l){\\n Point base=l.b-l.a;\\n DD r=dot(p-l.a,base)/norm(base);\\n return l.a+base*r;\\n}\\n//反射\\n//直線lに対して点pと対称な点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflect(const Point &p,const Line &l){\\n return p+(project(p,l)-p)*(DD)2.0;\\n}\\n\\n////////////////////////////\\n// 点との距離\\n////////////////////////////\\n\\n//点と直線の距離\\nDD DistPL(const Point &p,const Line &l){\\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\\n}\\n//点と線分の距離\\nDD DistPS(const Point &p,const Segment &s){\\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\\n return DistPL(p,s);\\n}\\n\\n////////////////////////////\\n// 円\\n////////////////////////////\\n//直線lと円Cの交点\\n//l.aにより近い方がindexが小さい\\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nvector<Point> crossPointLC(const Line &l,const Circle &c){\\n vector<Point> ret;\\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\\n Point pr=project(c.p,l);\\n Point e=(l.b-l.a)/(abs(l.b-l.a));\\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\\n ret.push_back(pr-e*base);\\n ret.push_back(pr+e*base);\\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\\n return ret;\\n}\\n//線分sと円cの交点\\n//交点がないときは空ベクトルを返す\\n//線分の端が交わる場合も交点とみなす\\n//s.aにより近い方がindexが小さい\\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\\n vector<Point> ret;\\n if(DistPS(c.p,s)>c.r+EPS) return ret;\\n auto koho=crossPointLC(s,c);\\n for(auto p:koho){\\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\\n }\\n return ret;\\n}\\n\\n//円aと円bの共通接線の数\\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\\nint intersect(const Circle &a,const Circle &b){\\n DD d=abs(a.p-b.p);\\n if(GR(d,a.r+b.r)) return 4;\\n if(EQ(d,a.r+b.r)) return 3;\\n if(EQ(d,abs(a.r-b.r))) return 1;\\n if(LS(d,abs(a.r-b.r))) return 0;\\n return 2;\\n}\\n\\n//円aと円bの交点\\n//交点がないときは空ベクトルを返す\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nvector<Point> crossPoint(const Circle &a,const Circle &b){\\n vector<Point> ret;\\n if(GR(abs(a.p - b.p), a.r + b.r)) return ret;\\n if(GR(max(a.r, b.r), abs(a.p - b.p) + min(a.r, b.r))) return ret;\\n DD d=abs(a.p-b.p);\\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\\n DD t=arg(b.p-a.p);\\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\\n return ret;\\n}\\n\\n\\nint n;\\nvector<Circle> c;\\nvector<int> f(vector<pair<DD,int>> &v){\\n vector<int> ret(n);\\n for(int i=0;i<(int)v.size();i++){\\n int idx = v[i].second;\\n ret[idx] = 1;\\n for(int j=0;j<i;j++){\\n int idy = v[j].second;\\n if(crossPoint(c[idx],c[idy]).empty()){\\n chmax(ret[idx], ret[idy] + 1);\\n }\\n }\\n }\\n return ret;\\n}\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n\\n while(cin>>n, n){\\n Point s,t;\\n cin>>s>>t;\\n c.resize(n);\\n vector<pair<DD, int>> l,r;\\n for(int i=0;i<n;i++){\\n Point p;\\n DD rr;\\n cin>>p>>rr;\\n c[i] = Circle(p, rr);\\n if(LS(abs(p-s), rr) and LS(abs(p-t), rr)) continue;\\n if(LS(abs(p-s), rr)) l.push_back({rr, i});\\n if(LS(abs(p-t), rr)) r.push_back({rr, i});\\n }\\n sort(all(l));\\n sort(all(r));\\n vector<int> a1 = f(l);\\n vector<int> a2 = f(r);\\n int ans = 0;\\n for(auto i:a1)chmax(ans, i);\\n for(auto i:a2)chmax(ans, i);\\n for(auto [d, i]:l){\\n for(auto [d2, j]:r){\\n assert(i != j);\\n if(crossPoint(c[i], c[j]).empty()){\\n chmax(ans, a1[i] + a2[j]);\\n }\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.6728,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2181_5916273\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 510000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nstruct circle{\\n int x,y,r;\\n circle() {}\\n circle(int x, int y, int r) : x(x), y(y), r(r) {}\\n bool operator< (const circle &c) const {\\n return x-r < c.x-c.r;\\n }\\n};\\n\\nint main(){\\n while(1){\\n int n; cin >> n;\\n if(!n) break;\\n int a,b,c,d; cin >> a >> b >> c >> d;\\n vector<circle> v(n);\\n rep(i,n){\\n cin >> v[i].x >> v[i].y >> v[i].r;\\n }\\n sort(rall(v));\\n auto intersect = [&](circle c, circle d) -> bool {\\n ll dist = abs(c.x-d.x) * abs(c.x-d.x) + abs(c.y-d.y) * abs(c.y-d.y);\\n ll rm = max(c.r,d.r) - min(c.r,d.r);\\n ll rM = c.r+d.r;\\n return rm*rm <= dist && dist <= rM*rM;\\n };\\n auto contain = [&](circle c, int x, int y) -> bool {\\n ll dist = abs(c.x-x) * abs(c.x-x) + abs(c.y-y) * abs(c.y-y);\\n return c.r*c.r >= dist;\\n };\\n vector<circle> S,T;\\n rep(i,n){\\n if(contain(v[i],a,b)){\\n if(!contain(v[i],c,d)) S.emplace_back(v[i]);\\n }else{\\n if(contain(v[i],c,d)) T.emplace_back(v[i]);\\n }\\n }\\n int ssize = S.size(), tsize = T.size();\\n vector<int> sp(ssize,1), tp(tsize,1);\\n rep(i,ssize){\\n rep(j,i){\\n if(!intersect(S[j],S[i])) chmax(sp[i],sp[j]+1);\\n }\\n }\\n rep(i,tsize){\\n rep(j,i){\\n if(!intersect(T[j],T[i])) chmax(tp[i],tp[j]+1);\\n }\\n }\\n int ans = 0;\\n rep(i,ssize) rep(j,tsize){\\n if(!intersect(S[i],T[j])) chmax(ans, sp[i]+tp[j]);\\n }\\n rep(i,ssize) chmax(ans, sp[i]);\\n rep(j,tsize) chmax(ans, tp[j]);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.0645,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2181_5889587\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//geometry library by maine\\n\\n//basic\\nusing Real = double;\\nusing Point = complex<Real>;\\n#define x real()\\n#define y imag()\\nconst Real EPS = 1e-8, PI = acos(-1), INF = 1e10;\\n\\nistream& operator>>(istream& is, Point& p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\nostream& operator<<(ostream& os, Point p) {\\n return os << fixed << setprecision(10) << p.x << \\\" \\\" << p.y;\\n}\\n\\nPoint operator*(const Point& p, const Real& d) { return Point(p.x * d, p.y * d); }\\n\\nbool eq(const Real& r, const Real& s) { return abs(r - s) < EPS; }\\nbool eq(const Point& p, const Point& q) { return abs(p - q) < EPS; }\\n\\nnamespace std {\\nbool operator<(const Point& a, const Point& b) {\\n return !eq(a.x, b.x) ? a.x < b.x : a.y < b.y;\\n}\\n} // namespace std\\n\\nReal get_angle(const Point& a, const Point& b, const Point& c) {\\n return arg((c - a) / (b - a));\\n}\\n\\ninline int inc(int i, int N) {\\n return (i == N - 1 ? 0 : i + 1);\\n}\\ninline int dec(int i, int N) {\\n return (i == 0 ? N - 1 : i - 1);\\n}\\n\\n//unit vector\\nPoint e(const Point& p) { return p / abs(p); }\\n\\n//angle transformation\\nReal radian_to_degree(Real r) { return r * 180.0 / PI; }\\nReal degree_to_radian(Real d) { return d * PI / 180.0; }\\n\\n//basic functions\\nReal dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\\nReal cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\\nPoint rotate(const Real& theta, const Point& p) {\\n return {cos(theta) * p.x - sin(theta) * p.y, sin(theta) * p.x + cos(theta) * p.y};\\n}\\nPoint rotate90(const Point& p) {\\n return {-p.y, p.x};\\n}\\n\\n//structs : Line, Segment, Circle\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n Point d() const { return e(b - a); } //direction vector\\n Point n() const {\\n Point dd = d();\\n return {dd.y, -dd.x};\\n } //normal vector\\n};\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\nstruct Circle {\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(Point p, Real r) : p(p), r(r){};\\n};\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Polygons = vector<Polygon>;\\nusing Lines = vector<Line>;\\nusing Segments = vector<Segment>;\\nusing Circles = vector<Circle>;\\n\\n//happy functions\\n//https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nint ccw(const Point& a, const Point& bb, const Point& cc) {\\n Point b = bb - a, c = cc - a;\\n if (cross(b, c) > EPS)\\n return 1; //COUNTER_CLOCKWISE\\n if (cross(b, c) < -EPS)\\n return -1; //CLOCKWISE\\n if (dot(b, c) < 0)\\n return 2; //ONLINE_BACK c-a-b\\n if (norm(b) < norm(c))\\n return -2; //ONLINE_FRONT a-b-c\\n return 0; //ON_SEGMENT a-c-b\\n}\\n\\nbool parallel(const Line& l, const Line& m) { return eq(cross(l.d(), m.d()), 0.0); }\\nbool orthogonal(const Line& l, const Line& m) { return eq(dot(l.d(), m.d()), 0.0); }\\nPoint projection(const Line& l, const Point& p) { return l.a + (l.a - l.b) * (dot(p - l.a, l.a - l.b) / norm(l.a - l.b)); }\\nPoint reflection(const Line& l, const Point& p) { return p + (projection(l, p) - p) * 2.0; }\\n\\n//intersect\\nbool intersect(const Line& l, const Point& p) { return abs(ccw(l.a, l.b, p)) != 1; }\\nbool intersect(const Line& l, const Line& m) { return !parallel(l, m) || (parallel(l, m) && intersect(l, m.a)); }\\nbool intersect(const Segment& s, const Point& p) { return ccw(s.a, s.b, p) == 0; }\\nbool intersect(const Line& l, const Segment& s) { return cross(l.d(), s.a - l.a) * cross(l.d(), s.b - l.a) < EPS; }\\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}\\nbool intersect_onsegment(const Segment& s, const Point& p) { return intersect(s, p) && !eq(s.a, p) && !eq(s.b, p); }\\n\\n//distance\\nReal distance(const Point& p, const Point& q) { return abs(p - q); }\\nReal distance(const Line& l, const Point& p) { return distance(p, projection(l, p)); }\\nReal distance(const Line& l, const Line& m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\nReal distance(const Segment& s, const Point& p) {\\n Point q = projection(s, p);\\n return intersect(s, q) ? distance(p, q) : min(distance(s.a, p), distance(s.b, p));\\n}\\nReal distance(const Segment& s, const Segment& t) { return intersect(s, t) ? 0 : min({distance(s, t.a), distance(s, t.b), distance(t, s.a), distance(t, s.b)}); }\\nReal distance(const Line& l, const Segment& s) { return intersect(l, s) ? 0 : min(distance(l, s.a), distance(l, s.b)); }\\n\\n//intersect circle\\nbool intersect(const Circle& c, const Point& p) { return eq(distance(c.p, p), c.r); }\\nbool intersect(const Circle& c, const Line& l) { return distance(l, c.p) <= c.r + EPS; }\\nint intersect(const Circle& c, const Segment& s) {\\n if (!intersect(c, Line(s)))\\n return 0;\\n Real da = distance(c.p, s.a), db = distance(c.p, s.b);\\n if (da < c.r + EPS && db < c.r + EPS)\\n return 0;\\n if (da > db)\\n swap(da, db);\\n if (da < c.r - EPS && db > c.r + EPS)\\n return 1;\\n if (intersect(s, projection(s, c.p)))\\n return 2;\\n return 0;\\n}\\nint intersect(Circle c1, Circle c2) {\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n Real d = distance(c1.p, c2.p);\\n if (c1.r + c2.r < d)\\n return 4;\\n if (eq(c1.r + c2.r, d))\\n return 3;\\n if (c1.r - c2.r < d)\\n return 2;\\n if (eq(c1.r - c2.r, d))\\n return 1;\\n return 0;\\n}\\n\\n//crosspoint\\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))\\n return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\nPoint crosspoint(const Segment& s, const Segment& t) { return crosspoint(Line(s), Line(t)); }\\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\\n Point p = projection(l, c.p);\\n if (eq(distance(l, c.p), c.r))\\n return {p, p};\\n Real len = sqrt(c.r * c.r - norm(p - c.p));\\n return {p - len * l.d(), p + len * l.d()};\\n}\\npair<Point, Point> crosspoint(const Circle& c, const Segment& s) {\\n Line l(s);\\n if (intersect(c, s) == 2)\\n return crosspoint(c, l);\\n auto ret = crosspoint(c, l);\\n if (dot(s.a - ret.first, s.b - ret.first) < 0)\\n ret.second = ret.first;\\n else\\n ret.first = ret.second;\\n return ret;\\n}\\npair<Point, Point> crosspoint(const Circle& c1, const Circle& c2) {\\n Real d = distance(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.y - c1.p.y, c2.p.x - c1.p.x);\\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//tangent\\npair<Point, Point> tangent(const Circle& c, const Point& p) {\\n return crosspoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n}\\nLines tangent(Circle c1, Circle c2) {\\n Lines ret;\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n if (eq(c1.p, c2.p))\\n return ret;\\n Real g = norm(c1.p - c2.p);\\n Point u = (c2.p - c1.p) / sqrt(g);\\n Point v = rotate(PI / 2, 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//convex\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/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], P[(i + 1) % N], P[(i + 2) % N]) == -1)\\n return false;\\n }\\n return true;\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_A\\nPolygon convex_hull(Points P) {\\n int N = (int)P.size(), k = 0;\\n if (N <= 2)\\n return P;\\n sort(begin(P), end(P));\\n Points ret(2 * N);\\n for (int i = 0; i < N; ret[k++] = P[i++]) {\\n while (k >= 2 && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\\n --k;\\n }\\n for (int i = N - 2, t = k + 1; i >= 0; ret[k++] = P[i--]) {\\n while (k >= t && cross(ret[k - 1] - ret[k - 2], P[i] - ret[k - 1]) < EPS)\\n --k;\\n }\\n ret.resize(k - 1);\\n return ret;\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/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].y < P[is].y)\\n is = i;\\n if (P[i].y > P[js].y)\\n js = i;\\n }\\n Real maxdist = norm(P[is] - P[js]);\\n int maxi, maxj, i, j;\\n maxi = i = is;\\n maxj = j = js;\\n do {\\n if (cross(P[inc(i, N)] - P[i], P[inc(j, N)] - P[j]) >= 0)\\n j = inc(j, N);\\n else\\n i = inc(i, N);\\n if (norm(P[i] - P[j]) > maxdist) {\\n maxdist = norm(P[i] - P[j]);\\n maxi = i;\\n maxj = j;\\n }\\n } while (i != is || j != js);\\n maxi = maxi;\\n maxj = maxj;\\n return sqrt(maxdist);\\n}\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/4/CGL_4_C\\nPolygon convex_cut(const Polygon& P, const Line& l) {\\n Polygon ret;\\n int N = (int)P.size();\\n for (int i = 0; i < N; i++) {\\n Point now = P[i], nxt = P[(inc(i, N))];\\n if (ccw(l.a, l.b, now) != -1)\\n ret.emplace_back(now);\\n if (ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) == -1)\\n ret.emplace_back(crosspoint(Line(now, nxt), l));\\n }\\n return ret;\\n}\\n\\n//other\\nenum\\n{\\n OUT,\\n ON,\\n IN\\n};\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_C\\nint contains(const Polygon& Q, const Point& p) {\\n bool in = false;\\n int N = (int)Q.size();\\n for (int i = 0; i < N; i++) {\\n Point a = Q[i] - p, b = Q[(i + 1) % N] - p;\\n if (a.y > b.y)\\n swap(a, b);\\n if (a.y <= 0 && 0 < b.y && cross(a, b) < 0)\\n in = !in;\\n if (cross(a, b) == 0 && dot(a, b) <= 0)\\n return ON;\\n }\\n return in ? IN : OUT;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/3/CGL_3_A\\nReal area(const Polygon& P) {\\n Real A = 0;\\n for (int i = 0; i < (int)P.size(); i++) {\\n A += cross(P[i], P[(i + 1) % P.size()]);\\n }\\n return A * 0.5;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_H\\nReal 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))\\n return ret;\\n if (max(abs(va), abs(vb)) < c.r + EPS)\\n return f;\\n if (distance(Segment(a, b), c.p) > c.r - EPS)\\n return c.r * c.r * arg(vb * conj(va));\\n auto u = crosspoint(c, Segment(a, b));\\n vector<Point> V{a, u.first, u.second, b};\\n for (int i = 0; i < (int)V.size() - 1; i++) {\\n ret += cross_area(c, V[i], V[i + 1]);\\n }\\n return ret;\\n}\\nReal area(const Polygon& p, const Circle& c) {\\n int N = (int)p.size();\\n if (N < 3)\\n return 0.0;\\n Real ret = 0;\\n for (int i = 0; i < N; i++) {\\n ret += cross_area(c, p[i], p[inc(i, N)]);\\n }\\n return ret / 2.0;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/problems/CGL_5_A\\nReal closest_pair(Points& P, int left, int right) {\\n if (right - left <= 1)\\n return 1e18;\\n int mid = (left + right) / 2;\\n Real xx = P[mid].x;\\n Real dist = min(closest_pair(P, left, mid), closest_pair(P, mid, right));\\n inplace_merge(P.begin() + left, P.begin() + mid, P.begin() + right, [&](const Point& a, const Point& b) { return a.y < b.y; });\\n Points memo;\\n memo.reserve(right - left);\\n for (int i = left; i < right; i++) {\\n if (abs(P[i].x - xx) >= dist)\\n continue;\\n for (int j = (int)memo.size() - 1; j >= 0; j--) {\\n if (P[i].y - memo[j].y >= dist)\\n break;\\n dist = min(dist, distance(P[i], memo[j]));\\n }\\n memo.emplace_back(P[i]);\\n }\\n return dist;\\n}\\nReal closest_pair(Points P) {\\n sort(begin(P), end(P));\\n return closest_pair(P, 0, (int)P.size());\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_B\\nCircle incircle(Polygon P) {\\n assert((int)P.size() == 3);\\n Real l0 = distance(P[1], P[2]), l1 = distance(P[0], P[2]), l2 = distance(P[0], P[1]);\\n Circle c;\\n c.p = crosspoint(Line(P[0], (P[1] * l1 + P[2] * l2) / (l1 + l2)), Line(P[1], (P[0] * l0 + P[2] * l2) / (l0 + l2)));\\n c.r = distance(Line(P[0], P[1]), c.p);\\n return c;\\n}\\n\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/7/CGL_7_C\\nCircle circumcircle(Polygon P) {\\n assert((int)P.size() == 3);\\n Circle c;\\n c.p = crosspoint(Line((P[0] + P[1]) / 2.0, (P[0] + P[1]) / 2.0 + rotate90(P[0] - P[1])),\\n Line((P[0] + P[2]) / 2.0, (P[0] + P[2]) / 2.0 + rotate90(P[0] - P[2])));\\n c.r = distance(c.p, P[0]);\\n return c;\\n}\\n\\n#undef x\\n#undef y\\n\\n\\nint main() {\\n int N;\\n while (cin >> N, N) {\\n Point s, t;\\n cin >> s >> t;\\n Circles C(N);\\n for (auto&& c : C) {\\n cin >> c.p >> c.r;\\n }\\n sort(begin(C), end(C), [](const auto& x, const auto& y) { return x.r < y.r; });\\n auto maine = [&](Point p, Point q) {\\n vector<int> dp(N);\\n for (int i = 0; i < N; i++) {\\n if (distance(p, C[i].p) < C[i].r && distance(q, C[i].p) > C[i].r) {\\n dp[i] = 1;\\n for (int j = 0; j < i; j++) {\\n if (intersect(C[i], C[j]) == 0)\\n dp[i] = max(dp[i], dp[j] + 1);\\n }\\n }\\n }\\n return dp;\\n };\\n auto S = maine(s, t), T = maine(t, s);\\n int ans = 0;\\n for (int i = 0; i < N; i++) {\\n ans = max(ans, S[i]);\\n ans = max(ans, T[i]);\\n for (int j = 0; j < N; j++) {\\n if (intersect(C[i], C[j]) == 4)\\n ans = max(ans, S[i] + T[j]);\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.3627,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2181_5330730\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 0.00000001;\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dist(point P, point Q){\\n return abs(Q - P);\\n}\\nint main(){\\n while (true){\\n int n;\\n cin >> n;\\n if (n == 0){\\n break;\\n }\\n point S, T;\\n cin >> S.x >> S.y >> T.x >> T.y;\\n vector<tuple<double, double, double>> C1, C2;\\n for (int i = 0; i < n; i++){\\n double x, y, r;\\n cin >> x >> y >> r;\\n point P(x, y);\\n double dS = dist(P, S);\\n double dT = dist(P, T);\\n if (dS < r && dT > r){\\n C1.push_back(make_tuple(r, x, y));\\n }\\n if (dT < r && dS > r){\\n C2.push_back(make_tuple(r, x, y));\\n }\\n }\\n sort(C1.begin(), C1.end());\\n int N = C1.size();\\n vector<double> r1(N);\\n vector<point> P1(N);\\n for (int i = 0; i < N; i++){\\n r1[i] = get<0>(C1[i]);\\n P1[i].x = get<1>(C1[i]);\\n P1[i].y = get<2>(C1[i]);\\n }\\n sort(C2.begin(), C2.end());\\n int M = C2.size();\\n vector<double> r2(M);\\n vector<point> P2(M);\\n for (int i = 0; i < M; i++){\\n r2[i] = get<0>(C2[i]);\\n P2[i].x = get<1>(C2[i]);\\n P2[i].y = get<2>(C2[i]);\\n }\\n vector<int> dp1(N + 1, 0);\\n for (int i = 0; i < N; i++){\\n dp1[i + 1] = 1;\\n for (int j = 0; j < i; j++){\\n if (dist(P1[i], P1[j]) < r1[i] - r1[j] - EPS){\\n dp1[i + 1] = max(dp1[i + 1], dp1[j + 1] + 1);\\n }\\n }\\n }\\n vector<int> dp2(M + 1, 0);\\n for (int i = 0; i < M; i++){\\n dp2[i + 1] = 1;\\n for (int j = 0; j < i; j++){\\n if (dist(P2[i], P2[j]) < r2[i] - r2[j] - EPS){\\n dp2[i + 1] = max(dp2[i + 1], dp2[j + 1] + 1);\\n }\\n }\\n }\\n int ans = 0;\\n for (int i = 0; i <= N; i++){\\n ans = max(ans, dp1[i]);\\n }\\n for (int i = 0; i <= M; i++){\\n ans = max(ans, dp2[i]);\\n }\\n for (int i = 0; i < N; i++){\\n for (int j = 0; j < M; j++){\\n if (dist(P1[i], P2[j]) > r1[i] + r2[j] + EPS){\\n ans = max(ans, dp1[i + 1] + dp2[j + 1]);\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -0.0571,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2181_4969241\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n#include \\\"complex\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nstruct Circle {\\n\\tlong double x, y, r;\\n\\tCircle() {\\n\\t\\tcin >> x >> y >> r;\\n\\t}\\n\\tbool operator<(const Circle&c) const {\\n\\t\\treturn r < c.r;\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N, N) {\\n\\t\\tlong double sx, sy, gx, gy;\\n\\t\\tcin >> sx >> sy >> gx >> gy;\\n\\t\\tvector<Circle>c(N);\\n\\t\\tsort(c.begin(), c.end());\\n\\t\\tvector<Circle>a;\\n\\t\\tvector<Circle>b;\\n\\t\\ta.push_back(c[0]);\\n\\t\\tb.push_back(c[0]);\\n\\t\\ta[0].x = sx, a[0].y = sy, a[0].r = 0;\\n\\t\\tb[0].x = gx, b[0].y = gy, b[0].r = 0;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tauto sdis = hypotl(c[i].x - sx, c[i].y - sy);\\n\\t\\t\\tauto gdis = hypotl(c[i].x - gx, c[i].y - gy);\\n\\t\\t\\tif (sdis < c[i].r&&gdis>c[i].r) {\\n\\t\\t\\t\\ta.push_back(c[i]);\\n\\t\\t\\t}\\n\\t\\t\\tif (sdis > c[i].r&&gdis < c[i].r) {\\n\\t\\t\\t\\tb.push_back(c[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>>dp(a.size(), vector<int>(b.size(), -MOD));\\n\\t\\tvector<vector<int>>aok(a.size(), vector<int>(a.size()));\\n\\t\\tfor (int i = 0; i < a.size(); i++) {\\n\\t\\t\\tfor (int j = i + 1; j < a.size(); j++) {\\n\\t\\t\\t\\tif (hypot(a[i].x - a[j].x, a[i].y - a[j].y) <= abs(a[i].r - a[j].r) - EPS) {\\n\\t\\t\\t\\t\\taok[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>>bok(b.size(), vector<int>(b.size()));\\n\\t\\tfor (int i = 0; i < b.size(); i++) {\\n\\t\\t\\tfor (int j = i + 1; j < b.size(); j++) {\\n\\t\\t\\t\\tif (hypot(b[i].x - b[j].x, b[i].y - b[j].y) <= abs(b[i].r - b[j].r) - EPS) {\\n\\t\\t\\t\\t\\tbok[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>>ok(a.size(), vector<int>(b.size()));\\n\\t\\tfor (int i = 0; i < a.size(); i++) {\\n\\t\\t\\tfor (int j = 0; j < b.size(); j++) {\\n\\t\\t\\t\\tif (hypot(a[i].x - b[j].x, a[i].y - b[j].y) >= a[i].r + b[j].r + EPS) {\\n\\t\\t\\t\\t\\tok[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdp[0][0] = 0;\\n\\t\\tfor (int i = 0; i < a.size(); i++) {\\n\\t\\t\\tfor (int j = 0; j < b.size(); j++) {\\n\\t\\t\\t\\tfor (int k = i + 1; k < a.size(); k++) {\\n\\t\\t\\t\\t\\tif (aok[i][k] && ok[k][j]) {\\n\\t\\t\\t\\t\\t\\tdp[k][j] = max(dp[k][j], dp[i][j] + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int k = j + 1; k < b.size(); k++) {\\n\\t\\t\\t\\t\\tif (bok[j][k] && ok[i][k]) {\\n\\t\\t\\t\\t\\t\\tdp[i][k] = max(dp[i][k], dp[i][j] + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (auto i : dp)for (auto j : i)ans = max(ans, j);\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 7304,\n \"score_of_the_acc\": -1.1024,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2181_4961110\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nint N;\\nint X[1000],Y[1000],R[1000];\\nbool cont(int id,int x,int y)\\n{\\n\\tint dx=X[id]-x,dy=Y[id]-y;\\n\\treturn dx*dx+dy*dy<R[id]*R[id];\\n}\\nvector<pair<int,int> >f(int sx,int sy,int gx,int gy)\\n{\\n\\tvector<int>id;\\n\\tfor(int i=0;i<N;i++)\\n\\t{\\n\\t\\tif(cont(i,sx,sy)&&!cont(i,gx,gy))id.push_back(i);\\n\\t}\\n\\tint n=id.size();\\n\\tvector<pair<int,int> >E;\\n\\tfor(int i=0;i<n;i++)for(int j=0;j<n;j++)if(R[id[i]]<R[id[j]])\\n\\t{\\n\\t\\tint dx=X[id[i]]-X[id[j]],dy=Y[id[i]]-Y[id[j]];\\n\\t\\tint dr=R[id[j]]-R[id[i]];\\n\\t\\tif(dx*dx+dy*dy<dr*dr)E.push_back(make_pair(i,j));\\n\\t}\\n\\tvector<int>dist(n,1);\\n\\tfor(int i=0;i<n;i++)\\n\\t{\\n\\t\\tfor(pair<int,int>e:E)if(dist[e.first]+1>dist[e.second])dist[e.second]=dist[e.first]+1;\\n\\t}\\n\\tvector<pair<int,int> >ret(n);\\n\\tfor(int i=0;i<n;i++)ret[i]=make_pair(id[i],dist[i]);\\n\\treturn ret;\\n}\\nmain()\\n{\\n\\twhile(cin>>N,N)\\n\\t{\\n\\t\\tint sx,sy,gx,gy;\\n\\t\\tcin>>sx>>sy>>gx>>gy;\\n\\t\\tfor(int i=0;i<N;i++)cin>>X[i]>>Y[i]>>R[i];\\n\\t\\tvector<pair<int,int> >A=f(sx,sy,gx,gy);\\n\\t\\tvector<pair<int,int> >B=f(gx,gy,sx,sy);\\n\\t\\tint ans=0;\\n\\t\\tfor(pair<int,int>p:A)if(ans<p.second)ans=p.second;\\n\\t\\tfor(pair<int,int>p:B)if(ans<p.second)ans=p.second;\\n\\t\\tfor(pair<int,int>p:A)for(pair<int,int>q:B)\\n\\t\\t{\\n\\t\\t\\tint dx=X[p.first]-X[q.first],dy=Y[p.first]-Y[q.first];\\n\\t\\t\\tint nr=R[p.first]+R[q.first];\\n\\t\\t\\tif(dx*dx+dy*dy<=nr*nr)continue;\\n\\t\\t\\tif(ans<p.second+q.second)ans=p.second+q.second;\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 10696,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2181_4930788\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=1005;\\nconst int INF=1e6;\\n//const ll INF=1LL<<60;\\n\\n//幾何ライブラリ\\n\\nconst double eps=1e-8;\\nconst double pi=acos((long double)-1.0L);\\n#define equals(a,b) (fabs((a)-(b))<eps)\\n\\ndouble torad(int deg) {return (double)(deg)*pi/180.0;}\\ndouble todeg(double ang) {return ang*180.0/pi;}\\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 \\n double abs(){return sqrt(norm());}\\n double norm(){return x*x+y*y;}\\n \\n bool operator < (const Point &p)const{\\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\\n }\\n \\n bool operator == (const Point &p)const{\\n return fabs(x-p.x)<eps&&fabs(y-p.y)<eps;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x+a.y*b.y;\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nstruct Segment{\\n Point p1,p2;\\n};\\n\\nbool isOrthogonal(Vector a,Vector b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\\n return isOrthogonal(a1-a2,b1-b2);\\n}\\n\\nbool isOrthogonal(Segment s1,Segment s2){\\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\\n return isParallel(a1-a2,b1-b2);\\n}\\n\\nbool isParallel(Segment s1,Segment s2){\\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nPoint project(Segment s,Point p){\\n Vector base=s.p2-s.p1;\\n double r=dot(p-s.p1,base)/norm(base);\\n return s.p1+base*r;\\n}\\n\\nPoint reflect(Segment s,Point p){\\n return p+(project(s,p)-p)*2.0;\\n}\\n\\nPoint turn(Point p,Point c,double pi){\\n double q=atan2(p.y-c.y,p.x-c.x);\\n q+=pi;\\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\\n \\n return p;\\n}\\n//pをcを中心としてpi回転させる(1周で2π)\\n//p=cのときnan\\n\\nstatic const int counter_clockwise=1;\\nstatic const int clockwise=-1;\\nstatic const int online_back=2;\\nstatic const int online_front=-2;\\nstatic const int on_segment=0;\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a=p1-p0;\\n Vector b=p2-p0;\\n \\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 \\n return on_segment;\\n}\\n\\nbool intersect(Point p1,Point p2,Point p3,Point p4){\\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\\n}\\n\\nbool intersect(Segment s1,Segment s2){\\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool overlap(Segment s1,Segment s2){\\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\\n if(a&1||b&1) return 0;\\n if(a==2){\\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\\n else return 0;\\n }\\n if(a==-2){\\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\\n else return 0;\\n }\\n if(a==0){\\n if(s1.p1==s2.p1){\\n if(b!=2) return 1;\\n else return 0;\\n }\\n else if(s1.p2==s2.p1){\\n if(b!=-2) return 1;\\n else return 0;\\n }\\n else return 1;\\n }\\n return 0;\\n}\\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\\n\\ntypedef Segment Line;\\n\\ndouble getDistance(Point a,Point b){\\n return abs(a-b);\\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 getDistance(Segment s1,Segment s2){\\n if(intersect(s1,s2)) return 0.0;\\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\\n}\\n\\nPoint getCrossPointS(Segment s1,Segment s2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\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 getCrossPointL(Line l1,Line l2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\n \\n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\\n \\n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\\n}\\n\\nSegment ParallelSegment(Segment s,double d){\\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\\n v=v/abs(v);\\n \\n s.p1=s.p1+v*d;\\n s.p2=s.p2+v*d;\\n \\n return s;\\n}\\n\\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\\n};\\n\\nPoint CircleCenter(Point a,Point b,Point c){\\n Point u=a-b,v=a-c;\\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\\n \\n Point res;\\n if(cross(u,v)==0.0){\\n res.x=1e9;\\n res.y=1e9;\\n \\n return res;\\n }\\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\\n \\n return res;\\n}\\n//3点を通る円の中心を返す\\n\\npair<Point,Point> segCrossPpoints(Circle c,Line l){\\n //assert(intersect(c,l));\\n Vector pr=project(l,c.c);\\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\\n double base=sqrt(c.r*c.r-norm(pr-c.c));\\n return make_pair(pr+e*base,pr-e*base);\\n}\\n\\ndouble arg(Vector p){return atan2(p.y,p.x);}\\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\\n\\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\\n //assert(intersect(c1,c2));\\n double d=abs(c1.c-c2.c);\\n double a=acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n double t=arg(c2.c-c1.c);\\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\\n}\\n\\nvector<Line> Commontangent(Circle c1,Circle c2){\\n vector<Line> res;\\n Point p=c2.c-c1.c;\\n \\n if(abs(p)>=(c1.r+c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n if(abs(p)>=abs(c1.r-c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n return res;\\n}\\n\\ntypedef vector<Point> Polygon;\\n\\n/*\\n IN 2\\n ON 1\\n OUT 0\\n */\\n\\nint contains(Polygon g,Point p){\\n int n=int(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(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\\nPolygon andrewScan(Polygon s,bool ok){\\n Polygon u,l;\\n sort(all(s));\\n \\n if(int(s.size())<3) return s;\\n int n=int(s.size());\\n \\n u.push_back(s[0]);\\n u.push_back(s[1]);\\n \\n l.push_back(s[n-1]);\\n l.push_back(s[n-2]);\\n \\n if(ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n if(!ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n reverse(all(l));\\n \\n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\\n \\n return l;\\n}//ok==1なら辺の上も含める\\n\\nPolygon convex_cut(const Polygon& P, const Line& l) {\\n Polygon Q;\\n for(int i=0;i<si(P);i++){\\n Point A=P[i],B=P[(i+1)%si(P)];\\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\\n }\\n return Q;\\n}\\n\\ndouble area(Point a,Point b,Point c){\\n b=b-a;\\n c=c-a;\\n return abs(b.x*c.y-b.y*c.x)/2.0;\\n}\\n\\ndouble area(Polygon &P){\\n if(si(P)==0) return 0.0;\\n double res=0;\\n Point c={0.0,0.0};\\n for(int i=0;i<si(P);i++){\\n c=c+P[i];\\n }\\n c=c/si(P);\\n \\n for(int i=0;i<si(P);i++){\\n res+=area(c,P[i],P[(i+1)%si(P)]);\\n }\\n \\n return res;\\n}\\n\\nint dp[MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N;cin>>N;\\n if(N==0) break;\\n Point s,t;\\n cin>>s.x>>s.y>>t.x>>t.y;\\n \\n vector<Circle> C(N);\\n for(int i=0;i<N;i++) cin>>C[i].c.x>>C[i].c.y>>C[i].r;\\n \\n sort(all(C),[](auto a,auto b){\\n return a.r<b.r;\\n });\\n \\n for(int i=0;i<N;i++) dp[i]=-INF;\\n \\n for(int i=0;i<N;i++){\\n int cnt=0;\\n if(getDistance(C[i].c,s)<C[i].r) cnt++;\\n if(getDistance(C[i].c,t)<C[i].r) cnt++;\\n \\n if(cnt==1){\\n dp[i]=1;\\n for(int j=0;j<i;j++){\\n if(C[j].r==C[i].r) continue;\\n \\n double d=getDistance(C[j].c,C[i].c);\\n \\n if(d+C[j].r<C[i].r) chmax(dp[i],dp[j]+1);\\n }\\n }\\n }\\n \\n int ans=0;\\n \\n for(int i=0;i<N;i++){\\n for(int j=0;j<N;j++){\\n if(dp[i]>=1&&dp[j]>=1){\\n auto l=Commontangent(C[i],C[j]);\\n if(si(l)==4) chmax(ans,dp[i]+dp[j]);\\n }\\n }\\n chmax(ans,dp[i]);\\n }\\n \\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.3652,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2181_4653184\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define repr(i, n) for (int i = (n); i >= 0; --i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define FORR(i, m, n) for (int i = (m); i >= (n); --i)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\nconst ll mod = 1000000007;\\n//const ll mod = 998244353;\\nconst int inf = 1e9 + 10;\\nconst ll INF = 1e18;\\nconst ld EPS = 1e-10;\\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntypedef complex<ll> P;\\n\\nint n;\\nP s, t;\\nP p[1005];\\nvector<P> G[10005];\\n\\nvoid init() {\\n rep(i, 10005) G[i].clear();\\n}\\n\\nvoid solve() {\\n vector<P> a, b;\\n vector<ll> ar, br;\\n rep(i, 10005) {\\n for (P p: G[i]) {\\n if (norm(p - s) < i * i) {\\n a.push_back(p);\\n ar.push_back(i);\\n }\\n else {\\n b.push_back(p);\\n br.push_back(i);\\n }\\n }\\n }\\n int ans = 0;\\n vector<int> dpa(a.size(), 1), dpb(b.size(), 1);\\n rep(i, a.size()) {\\n rep(j, i) {\\n if (norm(a[i] - a[j]) < (ar[i] - ar[j]) * (ar[i] - ar[j])) {\\n chmax(dpa[i], dpa[j] + 1);\\n }\\n }\\n chmax(ans, dpa[i]);\\n }\\n rep(i, b.size()) {\\n rep(j, i) {\\n if (norm(b[i] - b[j]) < (br[i] - br[j]) * (br[i] - br[j])) {\\n chmax(dpb[i], dpb[j] + 1);\\n }\\n }\\n chmax(ans, dpb[i]);\\n }\\n rep(i, a.size()) {\\n rep(j, b.size()) {\\n if (norm(a[i] - b[j]) > (ar[i] + br[j]) * (ar[i] + br[j])) {\\n chmax(ans, dpa[i] + dpb[j]);\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout << fixed << setprecision(25);\\n\\n while (cin >> n, n) {\\n init();\\n\\n ll sx, sy, tx, ty;\\n cin >> sx >> sy >> tx >> ty;\\n s = P(sx, sy), t = P(tx, ty);\\n rep(i, n) {\\n ll px, py, r;\\n cin >> px >> py >> r;\\n P p = P(px, py);\\n if (norm(p - t) < r * r && norm(p - s) < r * r) continue;\\n if (norm(p - t) > r * r && norm(p - s) > r * r) continue;\\n G[r].push_back(p);\\n }\\n\\n solve();\\n }\\n\\n \\n\\n\\n\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.0821,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2181_4630623\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n/*\\nconst long double EPS = 1e-10;\\nconst long long INF = 1e18;\\nconst long double PI = acos(-1.0L);\\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\\nbool 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 false;\\n if(eq(c1.r + c2.r, d)) return true;\\n if(c1.r - c2.r < d) return true;\\n if(eq(c1.r - c2.r, d)) return true;\\n return false;\\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};\\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\\nbool contains(Circle a, Circle b) {\\n double delta = distance(a.p, b.p);\\n return delta <= a.r - b.r + EPS;\\n}\\n\\n//const ll mod = 1000000007;\\nPoint P[2];\\nCircles C[2];\\nint N;\\n\\nint solve() {\\n for(int i = 0; i < 2; i++) {\\n cin >> P[i];\\n C[i].clear();\\n }\\n for(int i = 0; i < N; i++) {\\n Point p;\\n cin >> p;\\n int r;\\n cin >> r;\\n Circle c(p, r);\\n bool check[2] = {false, false};\\n for(int j = 0; j < 2; j++) {\\n if(distance(p, P[j]) <= r + EPS) check[j] = true;\\n }\\n if(!(check[0] ^ check[1])) continue;\\n for(int j = 0; j < 2; j++) {\\n if(check[j]) C[j].push_back(c);\\n }\\n }\\n /*\\n for(int i = 0; i < 2; i++) {\\n cerr << \\\"---\\\" << i << \\\"---\\\" << endl;\\n for(auto c : C[i]) {\\n cerr << c.p << \\\" \\\" << c.r << endl;\\n }\\n }\\n */\\n vector<ll> dp[2];\\n ll ans = 0;\\n for(int i = 0; i < 2; i++) {\\n sort(C[i].begin(), C[i].end(), [](Circle a, Circle b) {\\n return a.r < b.r;\\n });\\n for(int j = 0; j < C[i].size(); j++) {\\n dp[i].push_back(1); \\n for(int k = 0; k < j; k++) {\\n if(intersect(C[i][j], C[i][k])) continue;\\n chmax(dp[i][j], dp[i][k] + 1);\\n }\\n chmax(ans, dp[i][j]);\\n }\\n }\\n for(int i = 0; i < dp[0].size(); i++) {\\n for(int j = 0; j < dp[1].size(); j++) {\\n if(intersect(C[0][i], C[1][j])) continue;\\n chmax(ans, dp[0][i] + dp[1][j]);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\\nint main() {\\n while(cin >> N) {\\n if(N == 0) break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.1119,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2181_4096644\",\n \"code_snippet\": \"/**\\n * \\n */\\n\\n// header {{{\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define CPP_STR(x) CPP_STR_I(x)\\n#define CPP_CAT(x,y) CPP_CAT_I(x,y)\\n#define CPP_STR_I(args...) #args\\n#define CPP_CAT_I(x,y) x ## y\\n\\n#define SFINAE(pred...) std::enable_if_t<(pred), std::nullptr_t> = nullptr\\n\\n#define ASSERT(expr...) assert((expr))\\n\\nusing i8 = int8_t;\\nusing u8 = uint8_t;\\nusing i16 = int16_t;\\nusing u16 = uint16_t;\\nusing i32 = int32_t;\\nusing u32 = uint32_t;\\nusing i64 = int64_t;\\nusing u64 = uint64_t;\\n\\nusing f32 = float;\\nusing f64 = double;\\nusing f80 = __float80;\\n// }}}\\n\\nconstexpr i64 INF = INT64_C(1'010'000'000'000'000'017);\\nconstexpr f64 FINF = 1e100;\\n\\nconstexpr i64 MOD = INT64_C(1'000'000'007);\\n//constexpr i64 MOD = INT64_C(998'244'353);\\n\\nconstexpr f64 EPS = 1e-12;\\n\\nconstexpr f64 PI = 3.14159265358979323846;\\n\\n// util {{{\\n#define FOR(i, start, end) for(i64 i = (start), CPP_CAT(i,xxxx_end)=(end); i < CPP_CAT(i,xxxx_end); ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n\\n#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))\\n\\n#define LIFT(f) ([](auto&&... args) -> decltype(auto) { return (f)(std::forward<decltype(args)>(args)...); })\\n\\ntemplate<typename C>\\nconstexpr i64 SIZE(const C& c) noexcept { return static_cast<i64>(c.size()); }\\n\\ntemplate<typename T, size_t N>\\nconstexpr i64 SIZE(const T (&)[N]) noexcept { return static_cast<i64>(N); }\\n\\ntemplate<typename T, SFINAE(is_signed<T>::value)>\\nconstexpr T ABS(T x) noexcept {\\n return x < 0 ? -x : x;\\n}\\n\\ntemplate<typename T>\\nconstexpr i64 CMP(T x, T y) noexcept { return (y<x) - (x<y); }\\n\\ntemplate<typename T>\\nconstexpr i64 SGN(T x) noexcept { return CMP(x,T(0)); }\\n\\ntemplate<typename T, typename U, typename Comp=less<>>\\nconstexpr bool chmax(T& xmax, const U& x, Comp comp={}) noexcept {\\n if(comp(xmax, x)) {\\n xmax = x;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<typename T, typename U, typename Comp=less<>>\\nconstexpr bool chmin(T& xmin, const U& x, Comp comp={}) noexcept {\\n if(comp(x, xmin)) {\\n xmin = x;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<typename BinaryFunc, typename UnaryFunc>\\nauto ON(BinaryFunc&& bf, UnaryFunc&& uf) {\\n return [bf=forward<BinaryFunc>(bf),uf=forward<UnaryFunc>(uf)](const auto& x, const auto& y) {\\n return bf(uf(x), uf(y));\\n };\\n}\\n\\ntemplate<typename F>\\nauto LT_ON(F&& f) {\\n return ON(less<>{}, forward<F>(f));\\n}\\n\\ntemplate<typename F>\\nauto GT_ON(F&& f) {\\n return ON(greater<>{}, forward<F>(f));\\n}\\n\\ntemplate<typename F>\\nauto EQ_ON(F&& f) {\\n return ON(equal_to<>{}, forward<F>(f));\\n}\\n\\ntemplate<typename F>\\nauto NE_ON(F&& f) {\\n return ON(not_equal_to<>{}, forward<F>(f));\\n}\\n\\n// tuple {{{\\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) == I)>\\nvoid tuple_enumerate(tuple<TS...>&, F&&) {}\\n\\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) > I)>\\nvoid tuple_enumerate(tuple<TS...>& t, F&& f) {\\n f(I, get<I>(t));\\n tuple_enumerate<I+1>(t, forward<F>(f));\\n}\\n\\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) == I)>\\nvoid tuple_enumerate(const tuple<TS...>&, F&&) {}\\n\\ntemplate<i64 I=0, typename F, typename... TS, SFINAE(sizeof...(TS) > I)>\\nvoid tuple_enumerate(const tuple<TS...>& t, F&& f) {\\n f(I, get<I>(t));\\n tuple_enumerate<I+1>(t, forward<F>(f));\\n}\\n// }}}\\n\\n// container {{{\\ntemplate<typename T> struct is_container : false_type {};\\ntemplate<typename T, size_t N> struct is_container<array<T,N>> : true_type {};\\ntemplate<typename... Args> struct is_container<vector<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<deque<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<list<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<forward_list<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<set<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<multiset<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<unordered_set<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<unordered_multiset<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<map<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<multimap<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<unordered_map<Args...>> : true_type {};\\ntemplate<typename... Args> struct is_container<unordered_multimap<Args...>> : true_type {};\\n\\ntemplate<typename T, typename Enable=void>\\nstruct ProconHash {\\n size_t operator()(const T& x) const noexcept {\\n return hash<T>{}(x);\\n }\\n};\\n\\ntemplate<typename T>\\nsize_t procon_hash_value(const T& x) noexcept {\\n return ProconHash<T>{}(x);\\n}\\n\\nsize_t procon_hash_combine(size_t h1, size_t h2) noexcept {\\n constexpr size_t M = UINT64_C(0xc6a4a7935bd1e995);\\n constexpr int R = 47;\\n\\n h2 *= M;\\n h2 ^= h2 >> R;\\n h2 *= M;\\n\\n h1 ^= h2;\\n h1 *= M;\\n\\n h1 += 0xe6546b64;\\n\\n return h1;\\n}\\n\\ntemplate<typename T1, typename T2>\\nstruct ProconHash<pair<T1,T2>> {\\n size_t operator()(const pair<T1,T2>& p) const noexcept {\\n size_t h1 = procon_hash_value(p.first);\\n size_t h2 = procon_hash_value(p.second);\\n return procon_hash_combine(h1, h2);\\n }\\n};\\n\\ntemplate<typename... TS>\\nstruct ProconHash<tuple<TS...>> {\\n size_t operator()(const tuple<TS...>& t) const noexcept {\\n size_t h = 0;\\n tuple_enumerate(t, [&h](i64, const auto& e) {\\n h = procon_hash_combine(h, procon_hash_value(e));\\n });\\n return h;\\n }\\n};\\n\\ntemplate<typename C>\\nstruct ProconHash<C,enable_if_t<is_container<C>::value>> {\\n size_t operator()(const C& c) const noexcept {\\n size_t h = 0;\\n for(const auto& e : c)\\n h = procon_hash_combine(h, procon_hash_value(e));\\n return h;\\n }\\n};\\n\\ntemplate<typename T, typename Hash=ProconHash<T>, typename Eq=equal_to<T>>\\nusing HashSet = unordered_set<T,Hash,Eq>;\\ntemplate<typename K, typename V, typename Hash=ProconHash<K>, typename Eq=equal_to<K>>\\nusing HashMap = unordered_map<K,V,Hash,Eq>;\\ntemplate<typename T, typename Hash=ProconHash<T>, typename Eq=equal_to<T>>\\nusing HashMultiset = unordered_multiset<T,Hash,Eq>;\\ntemplate<typename K, typename V, typename Hash=ProconHash<K>, typename Eq=equal_to<K>>\\nusing HashMultimap = unordered_multimap<K,V,Hash,Eq>;\\n\\ntemplate<typename T>\\nauto vec_make(i64 n, T x) {\\n return vector<T>(n, x);\\n}\\n\\ntemplate<typename T, typename... Args, SFINAE(sizeof...(Args) >= 2)>\\nauto vec_make(i64 n, Args... args) {\\n auto inner = vec_make<T>(args...);\\n return vector<decltype(inner)>(n, inner);\\n}\\n\\ntemplate<typename T>\\nauto vec_reserve(i64 cap) {\\n vector<T> res;\\n res.reserve(cap);\\n return res;\\n}\\n\\ntemplate<typename T=i64>\\nauto vec_iota(i64 n, T init={}) {\\n vector<i64> res(n);\\n ALL(iota, res, init);\\n return res;\\n}\\n\\ntemplate<typename T, typename Comp, typename Cont=vector<T>>\\nauto priority_queue_make(const Comp& comp, Cont&& cont={}) {\\n return priority_queue<T,remove_reference_t<Cont>,Comp>(comp, forward<Cont>(cont));\\n}\\n\\ntemplate<typename T, typename Comp>\\nauto priority_queue_reserve(const Comp& comp, i64 cap) {\\n return priority_queue<T,vector<T>,Comp>(comp, vec_reserve<T>(cap));\\n}\\n\\ntemplate<typename T, size_t N, size_t... NS>\\nstruct ArrayType {\\n using type = array<typename ArrayType<T,NS...>::type,N>;\\n};\\n\\ntemplate<typename T, size_t N>\\nstruct ArrayType<T,N> {\\n using type = array<T,N>;\\n};\\n\\ntemplate<typename T, size_t... NS>\\nusing Array = typename ArrayType<T,NS...>::type;\\n\\ntemplate<typename T, size_t N>\\nT& array_at(Array<T,N>& ary, i64 i) {\\n return ary[i];\\n}\\n\\ntemplate<typename T, size_t N, size_t... NS, typename... Args>\\nT& array_at(Array<T,N,NS...>& ary, i64 i, Args... args) {\\n return array_at<T,NS...>(ary[i], args...);\\n}\\n\\ntemplate<typename T, size_t N>\\nconst T& array_at(const Array<T,N>& ary, i64 i) {\\n return ary[i];\\n}\\n\\ntemplate<typename T, size_t N, size_t... NS, typename... Args>\\nconst T& array_at(const Array<T,N,NS...>& ary, i64 i, Args... args) {\\n return array_at<T,NS...>(ary[i], args...);\\n}\\n\\ntemplate<typename T, typename C>\\nT POP(stack<T,C>& stk) {\\n T x = stk.top(); stk.pop();\\n return x;\\n}\\n\\ntemplate<typename T, typename C>\\nT POP(queue<T,C>& que) {\\n T x = que.front(); que.pop();\\n return x;\\n}\\n\\ntemplate<typename T, typename C, typename Comp>\\nT POP(priority_queue<T,C,Comp>& que) {\\n T x = que.top(); que.pop();\\n return x;\\n}\\n// }}}\\n\\n// fixpoint {{{\\ntemplate<typename F>\\nclass FixPoint {\\npublic:\\n explicit constexpr FixPoint(F&& f) : f_(forward<F>(f)) {}\\n\\n template<typename... Args>\\n constexpr decltype(auto) operator()(Args&&... args) const {\\n return f_(*this, forward<Args>(args)...);\\n }\\n\\nprivate:\\n F f_;\\n};\\n\\ntemplate<typename F>\\nconstexpr decltype(auto) FIX(F&& f) {\\n return FixPoint<F>(forward<F>(f));\\n}\\n\\ntemplate<typename F, size_t... NS>\\nclass FixPointMemo {\\npublic:\\n explicit FixPointMemo(F&& f) : f_(forward<F>(f)) {}\\n\\n template<typename... Args>\\n decltype(auto) operator()(Args... args) const {\\n using R = decltype(f_(*this,args...));\\n static Array<bool,NS...> done {};\\n static Array<R,NS...> memo;\\n\\n if(!array_at<bool,NS...>(done,args...)) {\\n array_at<R,NS...>(memo,args...) = f_(*this,args...);\\n array_at<bool,NS...>(done,args...) = true;\\n }\\n return array_at<R,NS...>(memo,args...);\\n }\\n\\nprivate:\\n F f_;\\n};\\n\\ntemplate<size_t... NS, typename F>\\ndecltype(auto) FIXMEMO(F&& f) {\\n return FixPointMemo<F,NS...>(forward<F>(f));\\n}\\n// }}}\\n\\n// math {{{\\n/*constexpr*/ i64 GCD(i64 a, i64 b) noexcept {\\n /*constexpr*/ auto f_gcd = FIX([](auto&& self, i64 aa, i64 bb) {\\n if(bb == 0) return aa;\\n return self(bb, aa%bb);\\n });\\n return f_gcd(ABS(a), ABS(b));\\n}\\n\\n/*constexpr*/ i64 LCM(i64 a, i64 b) noexcept {\\n ASSERT(a != 0 && b != 0);\\n /*constexpr*/ auto f_gcd = FIX([](auto&& self, i64 aa, i64 bb) {\\n if(bb == 0) return aa;\\n return self(bb, aa%bb);\\n });\\n a = ABS(a);\\n b = ABS(b);\\n return a / f_gcd(a,b) * b;\\n}\\n\\n/*constexpr*/ tuple<i64,i64,i64> EXTGCD(i64 a, i64 b) noexcept {\\n /*constexpr*/ auto impl = FIX([](auto&& self, i64 aa, i64 bb) -> tuple<i64,i64,i64> {\\n if(bb == 0) return make_tuple(aa, 1, 0);\\n i64 g,x,y; tie(g,x,y) = self(bb, aa%bb);\\n return make_tuple(g, y, x-(aa/bb)*y);\\n });\\n i64 g,x,y; tie(g,x,y) = impl(ABS(a), ABS(b));\\n x *= SGN(a);\\n y *= SGN(b);\\n return make_tuple(g, x, y);\\n}\\n// }}}\\n\\n// string {{{\\nauto str_reserve(i64 cap) {\\n string res;\\n res.reserve(cap);\\n return res;\\n}\\n// }}}\\n\\n// input {{{\\ntemplate<typename T, typename Enable=void>\\nstruct Scan {\\n static T scan(istream& in) {\\n T res;\\n in >> res;\\n return res;\\n }\\n};\\n\\ntemplate<typename T, typename Enable=void>\\nstruct Scan1;\\n\\ntemplate<typename T>\\nstruct Scan1<T,enable_if_t<is_integral<T>::value && !is_same<T,bool>::value>> {\\n static T scan1(istream& in) {\\n return Scan<T>::scan(in) - 1;\\n }\\n};\\n\\ntemplate<typename T1, typename T2>\\nstruct Scan<pair<T1,T2>> {\\n static pair<T1,T2> scan(istream& in) {\\n T1 x = Scan<T1>::scan(in);\\n T2 y = Scan<T2>::scan(in);\\n return {x,y};\\n }\\n};\\n\\ntemplate<typename T1, typename T2>\\nstruct Scan1<pair<T1,T2>> {\\n static pair<T1,T2> scan1(istream& in) {\\n T1 x = Scan1<T1>::scan1(in);\\n T2 y = Scan1<T2>::scan1(in);\\n return {x,y};\\n }\\n};\\n\\ntemplate<typename T>\\ntuple<T> tuple_scan_impl(istream& in) {\\n return make_tuple(Scan<T>::scan(in));\\n}\\n\\ntemplate<typename T, typename... TS, SFINAE(sizeof...(TS) > 0)>\\ntuple<T,TS...> tuple_scan_impl(istream& in) {\\n auto head = make_tuple(Scan<T>::scan(in));\\n return tuple_cat(head, tuple_scan_impl<TS...>(in));\\n}\\n\\ntemplate<typename... TS>\\nstruct Scan<tuple<TS...>> {\\n static tuple<TS...> scan(istream& in) {\\n return tuple_scan_impl<TS...>(in);\\n }\\n};\\n\\ntemplate<typename T>\\ntuple<T> tuple_scan1_impl(istream& in) {\\n return make_tuple(Scan1<T>::scan1(in));\\n}\\n\\ntemplate<typename T, typename... TS, SFINAE(sizeof...(TS) > 0)>\\ntuple<T,TS...> tuple_scan1_impl(istream& in) {\\n auto head = make_tuple(Scan1<T>::scan1(in));\\n return tuple_cat(head, tuple_scan1_impl<TS...>(in));\\n}\\n\\ntemplate<typename... TS>\\nstruct Scan1<tuple<TS...>> {\\n static tuple<TS...> scan1(istream& in) {\\n return tuple_scan1_impl<TS...>(in);\\n }\\n};\\n\\ntemplate<typename T=i64>\\nT RD() {\\n return Scan<T>::scan(cin);\\n}\\n\\ntemplate<typename T=i64>\\nT RD1() {\\n return Scan1<T>::scan1(cin);\\n}\\n\\ntemplate<typename T=i64>\\nauto RD_VEC(i64 n) {\\n auto res = vec_reserve<T>(n);\\n REP(_, n) {\\n res.emplace_back(RD<T>());\\n }\\n return res;\\n}\\n\\ntemplate<typename T=i64>\\nauto RD1_VEC(i64 n) {\\n auto res = vec_reserve<T>(n);\\n REP(_, n) {\\n res.emplace_back(RD1<T>());\\n }\\n return res;\\n}\\n\\ntemplate<typename T=i64>\\nauto RD_VEC2(i64 h, i64 w) {\\n auto res = vec_reserve<vector<T>>(h);\\n REP(_, h) {\\n res.emplace_back(RD_VEC<T>(w));\\n }\\n return res;\\n}\\n\\ntemplate<typename T=i64>\\nauto RD1_VEC2(i64 h, i64 w) {\\n auto res = vec_reserve<vector<T>>(h);\\n REP(_, h) {\\n res.emplace_back(RD1_VEC<T>(w));\\n }\\n return res;\\n}\\n// }}}\\n\\n// output {{{\\ntemplate<typename T, typename Enable=void>\\nstruct Fmt {\\n static void fmt(ostream& out, const T& x) { out << x; }\\n};\\n\\ntemplate<typename T>\\nvoid fmt_write(ostream& out, const T& x) {\\n Fmt<T>::fmt(out, x);\\n}\\n\\ntemplate<typename... TS>\\nstruct Fmt<tuple<TS...>> {\\n static void fmt(ostream& out, const tuple<TS...>& t) {\\n tuple_enumerate(t, [&out](i64 i, const auto& e) {\\n if(i != 0) out << ' ';\\n fmt_write(out, e);\\n });\\n }\\n};\\n\\ntemplate<typename T1, typename T2>\\nstruct Fmt<pair<T1,T2>> {\\n static void fmt(ostream& out, const pair<T1,T2>& p) {\\n return fmt_write(out, make_tuple(p.first,p.second));\\n }\\n};\\n\\ntemplate<typename C>\\nstruct Fmt<C,enable_if_t<is_container<C>::value>> {\\n static void fmt(ostream& out, const C& c) {\\n for(auto it = begin(c); it != end(c); ++it) {\\n if(it != begin(c)) out << ' ';\\n fmt_write(out, *it);\\n }\\n }\\n};\\n\\nvoid PRINT() {}\\n\\ntemplate<typename T, typename... TS>\\nvoid PRINT(const T& x, const TS&... args) {\\n fmt_write(cout, x);\\n if(sizeof...(args) > 0) {\\n cout << ' ';\\n PRINT(args...);\\n }\\n}\\n\\ntemplate<typename... TS>\\nvoid PRINTLN(const TS&... args) {\\n PRINT(args...);\\n cout << '\\\\n';\\n}\\n// }}}\\n\\n// debug {{{\\ntemplate<typename T, typename Enable=void>\\nstruct Dbg {\\n static void dbg(ostream& out, const T& x) { out << x; }\\n};\\n\\ntemplate<typename T>\\nvoid dbg_write(ostream& out, const T& x) {\\n Dbg<T>::dbg(out, x);\\n}\\n\\ntemplate<>\\nstruct Dbg<i64> {\\n static void dbg(ostream& out, i64 x) {\\n if(x == INF)\\n out << \\\"INF\\\";\\n else if(x == -INF)\\n out << \\\"-INF\\\";\\n else\\n out << x;\\n }\\n};\\n\\ntemplate<>\\nstruct Dbg<f64> {\\n static void dbg(ostream& out, f64 x) {\\n#pragma GCC diagnostic push\\n#pragma GCC diagnostic ignored \\\"-Wfloat-equal\\\"\\n if(x == FINF)\\n out << \\\"FINF\\\";\\n else if(x == -FINF)\\n out << \\\"-FINF\\\";\\n else\\n out << x;\\n#pragma GCC diagnostic pop\\n }\\n};\\n\\ntemplate<typename T, size_t N>\\nstruct Dbg<T[N]> {\\n static void dbg(ostream& out, const T (&ary)[N]) {\\n out << \\\"[\\\";\\n REP(i, N) {\\n if(i != 0) out << \\\",\\\";\\n dbg_write(out, ary[i]);\\n }\\n out << \\\"]\\\";\\n }\\n};\\n\\ntemplate<size_t N>\\nstruct Dbg<char[N]> {\\n static void dbg(ostream& out, const char (&s)[N]) {\\n out << s;\\n }\\n};\\n\\ntemplate<typename... TS>\\nstruct Dbg<tuple<TS...>> {\\n static void dbg(ostream& out, const tuple<TS...>& t) {\\n out << \\\"(\\\";\\n tuple_enumerate(t, [&out](i64 i, const auto& e) {\\n if(i != 0) out << \\\",\\\";\\n dbg_write(out, e);\\n });\\n out << \\\")\\\";\\n }\\n};\\n\\ntemplate<typename T1, typename T2>\\nstruct Dbg<pair<T1,T2>> {\\n static void dbg(ostream& out, const pair<T1,T2>& p) {\\n return dbg_write(out, make_tuple(p.first,p.second));\\n }\\n};\\n\\ntemplate<typename C>\\nstruct Dbg<C,enable_if_t<is_container<C>::value>> {\\n static void dbg(ostream& out, const C& c) {\\n out << \\\"[\\\";\\n for(auto it = begin(c); it != end(c); ++it) {\\n if(it != begin(c)) out << \\\",\\\";\\n dbg_write(out, *it);\\n }\\n out << \\\"]\\\";\\n }\\n};\\n\\ntemplate<typename T, typename C>\\nstruct Dbg<stack<T,C>> {\\n static void dbg(ostream& out, stack<T,C> stk) {\\n out << \\\"[\\\";\\n while(!stk.empty()) {\\n dbg_write(out,stk.top()); stk.pop();\\n if(!stk.empty()) out << \\\",\\\";\\n }\\n out << \\\"]\\\";\\n }\\n};\\n\\ntemplate<typename T, typename C>\\nstruct Dbg<queue<T,C>> {\\n static void dbg(ostream& out, queue<T,C> que) {\\n out << \\\"[\\\";\\n while(!que.empty()) {\\n dbg_write(out,que.front()); que.pop();\\n if(!que.empty()) out << \\\",\\\";\\n }\\n out << \\\"]\\\";\\n }\\n};\\n\\ntemplate<typename T, typename C, typename Comp>\\nstruct Dbg<priority_queue<T,C,Comp>> {\\n static void dbg(ostream& out, priority_queue<T,C,Comp> que) {\\n out << \\\"[\\\";\\n while(!que.empty()) {\\n dbg_write(out,que.top()); que.pop();\\n if(!que.empty()) out << \\\",\\\";\\n }\\n out << \\\"]\\\";\\n }\\n};\\n\\ntemplate<typename T>\\nvoid DBG_IMPL(i64 line, const char* expr, const T& value) {\\n cerr << \\\"[L \\\" << line << \\\"]: \\\";\\n cerr << expr << \\\" = \\\";\\n dbg_write(cerr, value);\\n cerr << \\\"\\\\n\\\";\\n}\\n\\nvoid DBG_IMPL_HELPER() {}\\n\\ntemplate<typename T, typename... TS>\\nvoid DBG_IMPL_HELPER(const T& x, const TS&... args) {\\n dbg_write(cerr, x);\\n if(sizeof...(args) > 0) {\\n cerr << \\\",\\\";\\n DBG_IMPL_HELPER(args...);\\n }\\n}\\n\\ntemplate<typename... TS>\\nvoid DBG_IMPL(i64 line, const char* expr, const TS&... value) {\\n cerr << \\\"[L \\\" << line << \\\"]: \\\";\\n cerr << \\\"(\\\" << expr << \\\") = (\\\";\\n DBG_IMPL_HELPER(value...);\\n cerr << \\\")\\\\n\\\";\\n}\\n\\ntemplate<size_t N, typename T, SFINAE(rank<T>::value == 0)>\\nvoid DBG_DP_IMPL_HELPER(ostream& out, const T& x, const array<i64,N>&, const array<i64,N>&) {\\n dbg_write(out, x);\\n}\\n\\ntemplate<size_t N, typename T, SFINAE(rank<T>::value > 0)>\\nvoid DBG_DP_IMPL_HELPER(ostream& out, const T& x, const array<i64,N>& sizes, const array<i64,N>& offs) {\\n i64 k = N - rank<T>::value;\\n i64 off = offs[k];\\n i64 siz = sizes[k];\\n if(siz == 0) siz = extent<T>::value - off;\\n\\n out << \\\"[\\\";\\n FOR(i, off, off+siz) {\\n if(i != off) out << \\\",\\\";\\n DBG_DP_IMPL_HELPER(out, x[i], sizes, offs);\\n }\\n out << \\\"]\\\";\\n}\\n\\ntemplate<typename T, SFINAE(rank<T>::value > 0)>\\nvoid DBG_DP_IMPL(i64 line, const char* expr, const T& dp,\\n const array<i64,rank<T>::value>& sizes={},\\n const array<i64,rank<T>::value>& offs={})\\n{\\n cerr << \\\"[L \\\" << line << \\\"]: \\\";\\n cerr << expr << \\\" = \\\";\\n DBG_DP_IMPL_HELPER<rank<T>::value>(cerr, dp, sizes, offs);\\n cerr << \\\"\\\\n\\\";\\n}\\n\\ntemplate<typename T>\\nvoid DBG_GRID_IMPL(i64 line, const char* expr, const vector<T>& grid) {\\n cerr << \\\"[L \\\" << line << \\\"]: \\\";\\n cerr << expr << \\\":\\\\n\\\";\\n for(const auto& row : grid) {\\n dbg_write(cerr, row);\\n cerr << \\\"\\\\n\\\";\\n }\\n cerr << \\\"\\\\n\\\";\\n}\\n\\n#ifdef PROCON_LOCAL\\n #define DBG(args...) DBG_IMPL(__LINE__, CPP_STR_I(args), args)\\n #define DBG_DP(args...) DBG_DP_IMPL(__LINE__, CPP_STR_I(args), args)\\n #define DBG_GRID(args...) DBG_GRID_IMPL(__LINE__, CPP_STR_I(args), args)\\n#else\\n #define DBG(args...)\\n #define DBG_DP(args...)\\n #define DBG_GRID(args...)\\n#endif\\n// }}}\\n\\n// modint {{{\\ntemplate<typename Mod>\\nclass ModIntT {\\nprivate:\\n i64 v_; // [0,Mod::value)\\n\\n static i64 mod() { return Mod::value; }\\n\\n static i64 normalize(i64 x) {\\n i64 res = x % mod();\\n if(res < 0) res += mod();\\n return res;\\n }\\n\\npublic:\\n ModIntT() : v_(0) {}\\n ModIntT(i64 v) : v_(normalize(v)) {}\\n\\n explicit operator i64() const { return v_; }\\n\\n ModIntT operator-() const { return ModIntT(-v_); }\\n\\n ModIntT& operator+=(ModIntT rhs) {\\n v_ = normalize(v_ + rhs.v_);\\n return *this;\\n }\\n ModIntT& operator-=(ModIntT rhs) {\\n v_ = normalize(v_ - rhs.v_);\\n return *this;\\n }\\n ModIntT& operator*=(ModIntT rhs) {\\n v_ = normalize(v_ * rhs.v_);\\n return *this;\\n }\\n\\n ModIntT& operator++() { return *this += 1; }\\n ModIntT& operator--() { return *this -= 1; }\\n ModIntT operator++(int) { return exchange(*this, *this+1); }\\n ModIntT operator--(int) { return exchange(*this, *this-1); }\\n\\n ModIntT inv() const {\\n i64 g,x; tie(g,x,ignore) = EXTGCD(v_, mod());\\n ASSERT(g == 1);\\n return ModIntT(x);\\n }\\n};\\n\\ntemplate<typename Mod>\\nModIntT<Mod> operator+(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) += rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator+(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) += rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator+(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) += lhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator-(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) -= rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator-(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) -= rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator-(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) -= lhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator*(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) *= rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator*(ModIntT<Mod> lhs, i64 rhs) { return ModIntT<Mod>(lhs) *= rhs; }\\ntemplate<typename Mod>\\nModIntT<Mod> operator*(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(rhs) *= lhs; }\\n\\ntemplate<typename Mod>\\nbool operator==(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return i64(lhs) == i64(rhs); }\\ntemplate<typename Mod>\\nbool operator==(ModIntT<Mod> lhs, i64 rhs) { return lhs == ModIntT<Mod>(rhs); }\\ntemplate<typename Mod>\\nbool operator==(i64 lhs, ModIntT<Mod> rhs) { return ModIntT<Mod>(lhs) == rhs; }\\ntemplate<typename Mod>\\nbool operator!=(ModIntT<Mod> lhs, ModIntT<Mod> rhs) { return !(lhs == rhs); }\\ntemplate<typename Mod>\\nbool operator!=(ModIntT<Mod> lhs, i64 rhs) { return !(lhs == rhs); }\\ntemplate<typename Mod>\\nbool operator!=(i64 lhs, ModIntT<Mod> rhs) { return !(lhs == rhs); }\\n\\ntemplate<typename Mod>\\nstruct ProconHash<ModIntT<Mod>> {\\n size_t operator()(ModIntT<Mod> x) const noexcept {\\n return procon_hash_value(i64(x));\\n }\\n};\\n\\ntemplate<typename Mod>\\nstruct Scan<ModIntT<Mod>> {\\n static ModIntT<Mod> scan(istream& in) {\\n i64 v = Scan<i64>::scan(in);\\n return ModIntT<Mod>(v);\\n }\\n};\\n\\ntemplate<typename Mod>\\nstruct Fmt<ModIntT<Mod>> {\\n static void fmt(ostream& out, ModIntT<Mod> x) {\\n fmt_write(out, i64(x));\\n }\\n};\\n\\ntemplate<typename Mod>\\nstruct Dbg<ModIntT<Mod>> {\\n static void dbg(ostream& out, ModIntT<Mod> x) {\\n dbg_write(out, i64(x));\\n }\\n};\\n\\ntemplate<i64 M>\\nusing ModIntC = ModIntT<integral_constant<i64,M>>;\\n\\nusing ModInt = ModIntC<MOD>;\\n// }}}\\n// }}}\\n\\n// init {{{\\nstruct ProconInit {\\n static constexpr int IOS_PREC = 15;\\n static constexpr bool AUTOFLUSH = false;\\n\\n ProconInit() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cin.exceptions(ios::failbit | ios::badbit);\\n cout << fixed << setprecision(IOS_PREC);\\n#ifdef PROCON_LOCAL\\n cerr << fixed << setprecision(2);\\n#endif\\n if(AUTOFLUSH)\\n cout << unitbuf;\\n }\\n} PROCON_INIT;\\n// }}}\\n\\n//--------------------------------------------------------------------\\n\\ni64 NORM(i64 x1, i64 y1, i64 x2, i64 y2) {\\n i64 dx = x1 - x2;\\n i64 dy = y1 - y2;\\n return dx*dx + dy*dy;\\n}\\n\\nauto make_graph(const vector<tuple<i64,i64,i64>>& cs) {\\n i64 n = SIZE(cs);\\n\\n vector<vector<i64>> g(n);\\n REP(i, n) REP(j, n) {\\n if(i == j) continue;\\n i64 x1,y1,r1; tie(x1,y1,r1) = cs[i];\\n i64 x2,y2,r2; tie(x2,y2,r2) = cs[j];\\n\\n if(f64(r1) > sqrt(NORM(x1,y1,x2,y2)) + f64(r2))\\n g[i].emplace_back(j);\\n }\\n\\n return g;\\n}\\n\\nauto calc_dp(const vector<vector<i64>>& g) {\\n i64 n = SIZE(g);\\n\\n vector<i64> dp(n, 0);\\n auto dfs = FIX([&g,&dp](auto&& self, i64 v) -> i64 {\\n if(dp[v] > 0) return dp[v];\\n i64 res = 1;\\n for(i64 to : g[v])\\n chmax(res, 1+self(to));\\n return dp[v] = res;\\n });\\n REP(v, n) {\\n dfs(v);\\n }\\n\\n return dp;\\n}\\n\\nvoid solve(i64 N) {\\n i64 sx = RD();\\n i64 sy = RD();\\n i64 tx = RD();\\n i64 ty = RD();\\n auto C = RD_VEC<tuple<i64,i64,i64>>(N);\\n\\n vector<tuple<i64,i64,i64>> scs;\\n vector<tuple<i64,i64,i64>> tcs;\\n for(const auto& c : C) {\\n i64 x,y,r; tie(x,y,r) = c;\\n bool s_in = NORM(x,y,sx,sy) < r*r;\\n bool t_in = NORM(x,y,tx,ty) < r*r;\\n if(s_in == t_in) continue;\\n\\n if(s_in)\\n scs.emplace_back(x,y,r);\\n else\\n tcs.emplace_back(x,y,r);\\n }\\n i64 sn = SIZE(scs);\\n i64 tn = SIZE(tcs);\\n DBG(sn, scs);\\n DBG(tn, tcs);\\n\\n auto sg = make_graph(scs);\\n auto tg = make_graph(tcs);\\n DBG(sg);\\n DBG(tg);\\n\\n auto sdp = calc_dp(sg);\\n auto tdp = calc_dp(tg);\\n DBG(sdp);\\n DBG(tdp);\\n\\n i64 ans = 0;\\n // scs のみを使う\\n if(sn > 0)\\n chmax(ans, *ALL(max_element, sdp));\\n // tcs のみを使う\\n if(tn > 0)\\n chmax(ans, *ALL(max_element, tdp));\\n // scs, tcs を両方使う\\n REP(i, sn) REP(j, tn) {\\n i64 x1,y1,r1; tie(x1,y1,r1) = scs[i];\\n i64 x2,y2,r2; tie(x2,y2,r2) = tcs[j];\\n if(NORM(x1,y1,x2,y2) <= (r1+r2)*(r1+r2)) continue;\\n\\n chmax(ans, sdp[i] + tdp[j]);\\n }\\n\\n PRINTLN(ans);\\n}\\n\\nsigned main() {\\n for(;;) {\\n i64 N = RD();\\n if(N == 0) break;\\n solve(N);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 8516,\n \"score_of_the_acc\": -0.7602,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2181_3742263\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Float = double;\\nusing Point = complex<Float>;\\nstruct Circle{ Point center; Float r; };\\n\\nconst Float EPS = 1e-8;\\n\\nFloat distance(Point &p1,Point &p2){\\n return abs(p1 - p2);\\n}\\n\\nbool isContain(Circle &c,Point &p){\\n return (distance(c.center,p) <= c.r + EPS);\\n}\\n\\nbool isContain(Circle &c1,Circle &c2){\\n return (c1.r - EPS>= c2.r + distance(c1.center,c2.center));\\n}\\n\\nbool isIntersect(Circle &c1,Circle &c2){\\n return (distance(c1.center,c2.center) <= c1.r + c2.r + EPS);\\n}\\n\\nvoid calcContainable(vector<Circle> &circs,vector<int> &ret){\\n sort(circs.begin(),circs.end(),[](const Circle &c1,const Circle &c2){\\n return c1.r < c2.r;\\n });\\n ret.resize(circs.size());\\n for(int i = 0;i < circs.size();i++){\\n ret[i] = 1;\\n for(int j = 0;j < i;j++){\\n if(isContain(circs[i],circs[j])){\\n ret[i] = max(ret[i],ret[j] + 1);\\n }\\n }\\n }\\n}\\n\\nsigned main(){\\n int n;\\n while(cin >> n,n){\\n Float xs,ys,xt,yt;\\n vector<Circle> circleS,circleT;\\n int ans = 0;\\n cin >> xs >> ys >> xt >> yt;\\n Point ps = Point(xs,ys),pt = Point(xt,yt);\\n for(int i = 0;i < n;i++){\\n Float x,y,r;\\n cin >> x >> y >> r;\\n Circle circ = {Point(x,y),r};\\n if(isContain(circ,ps) ^ isContain(circ,pt)){\\n (isContain(circ,ps) ? circleS : circleT).push_back(circ);\\n }\\n }\\n vector<int> containableS,containableT;\\n calcContainable(circleS,containableS);\\n calcContainable(circleT,containableT);\\n for(int i = 0;i < circleS.size();i++) ans = max(ans,containableS[i]);\\n for(int i = 0;i < circleT.size();i++) ans = max(ans,containableT[i]);\\n for(int i = 0;i < circleS.size();i++){\\n for(int j = 0;j < circleT.size();j++){\\n if(!isIntersect(circleS[i],circleT[j])) ans = max(ans,containableS[i] + containableT[j]);\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.075,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1187,"cells":{"group_id":{"kind":"string","value":"aoj_2189_cpp"},"problem_description":{"kind":"string","value":"Problem E:\n足し算ゲーム\nねこのファーブルは足し算を用いた簡単なゲームを思いつき、同じくねこで友達のオードリーと一緒にやってみることにした。\nゲームのルールは次のようなものである。まず最初に、適当な正の整数を選び、そこからスタートする。各プレーヤーは、その数のうち隣り合う2つの桁を選択して和を計算し、もとの2つの数字と置き換える。たとえば、「1234」の十の位と百の位を選ぶと、次の数は「154」となる。「5555」の十の位と百の位を選んだ場合は「5105」となる。このような操作を数が1桁になるまで交互に繰り返し、操作ができなくなったプレーヤーが負けとなる。\nゲーム開始時の整数の値が与えられる。先攻であるファーブルと後攻であるオードリーがいずれも最適な戦略を取るとき、どちらが勝つのかを判定するプログラムを作成せよ。\nInput\n入力は、ゲーム開始時の数を表す1000桁以下の正の整数が1つ書かれた1行のみからなる。なお、最上位の桁は0ではない。\nOutput\nファーブルが勝つなら \"Fabre wins.\"、オードリーが勝つなら \"Audrey wins.\" と1行に出力せよ。最後にピリオドをつける必要があることに注意すること。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n3\n1234\n5555\n9\nOutput for the Sample Input\nAudrey wins.\nFabre wins.\nAudrey wins."},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2189_1912847","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\nint solve(string S) {\n\tif (S.size() == 1)return 0;\n\tstring U = S;\n\tint F = (int)(U[0] - '0') + (int)(U[1] - '0');\n\tU = to_string(F) + U.substr(2, U.size() - 2);\n\treturn solve(U) + 1;\n}\nstring T;\nint main() {\n\tint n; cin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> T; int P = solve(T);\n\t\tif (P % 2 == 0)cout << \"Audrey wins.\" << endl;\n\t\tif (P % 2 == 1)cout << \"Fabre wins.\" << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4372,"score_of_the_acc":-0.3895,"final_rank":13},{"submission_id":"aoj_2189_1907199","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<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nstring to_str(int a){\n\tstring s=\"\";\n\twhile(a){\n\t\ts=(char)(a%10+'0')+s;\n\t\ta/=10;\n\t}\n\tif(s==\"\")s=\"0\";\n\treturn s;\n}\nint main(){\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tstring s;\n\t\tcin>>s;\n\t\tint out=0;\n\t\twhile(s.size()!=1){\n\t\t\tint t=s[0]+s[1]-'0'-'0';\n\t\t\ts=to_str(t)+s.substr(2);\n\t\t\tout^=1;\n\t\t}\n\t\tif(!out)cout<<\"Audrey wins.\"<<endl;\n\t\telse cout<<\"Fabre wins.\"<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1216,"score_of_the_acc":-0.002,"final_rank":2},{"submission_id":"aoj_2189_1886875","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\n#define A cout << \"Audrey wins.\" << endl\n#define F cout << \"Fabre wins.\" << endl\n \nint c2i(char s){\n return s-'0';\n}\n \nstring c2s(char aa,char bb){\n int a = c2i(aa)+c2i(bb);\n if(a == 0) return \"0\";\n \n string s = \"\";\n while(a > 0){\n\ts += ((a%10)+'0');\n\ta /= 10;\n }\n reverse(s.begin(),s.end());\n return s;\n}\n \nint main(){\n int n;\n \n cin >> n;\n while(n--){\n\tstring str;\n\tcin >> str;\n \n\tint cnt = 0;\n\twhile(str.size() >= 2){\n\t cnt++;\n\t int pos = str.size()-2;\n\t string tmp = c2s(str[pos],str[pos+1]);\n\t if(pos >= 0) str = str.substr(0,pos) + tmp;\n\t}\n\tif(cnt%2) F;\n\telse A; \n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2992,"score_of_the_acc":-0.22,"final_rank":9},{"submission_id":"aoj_2189_1771645","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n while(n--){\n string str;\n cin>>str;\n\n int cnt=1;\n while(str.size()!=1){\n cnt++;\n int a=(str[0]-'0')+(str[1]-'0');\n string b;\n if(a>=10) b+=(a/10+'0'),b+=(a%10+'0');\n else b=(a+'0');\n str=b+str.substr(2,str.size());\n }\n\n\n if(cnt%2)cout <<\"Audrey wins.\"<<endl;\n else cout <<\"Fabre wins.\"<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1212,"score_of_the_acc":-0.1443,"final_rank":5},{"submission_id":"aoj_2189_1760685","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \nstring itos(int x){\n string r;\n while(x){\n r+=x%10+'0';\n x/=10;\n }\n reverse(r.begin(),r.end());\n return r;\n}\n \nint main(){\n int n,cnt;\n string s;\n cin>>n;\n while(n--){\n cin>>s;\n cnt=0;\n for(int i=0;i<s.size()-1;i++){\n int cal=s[i]-'0'+s[i+1]-'0';\n string sub=s.substr(i+2,s.size()-i);\n string ts=itos(cal);\n s=ts+sub;\n cnt++;\n if(s.size()==1)break;\n i=-1;\n }\n if(cnt%2)cout<<\"Fabre wins.\"<<endl;\n else cout<<\"Audrey wins.\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1212,"score_of_the_acc":-0.0015,"final_rank":1},{"submission_id":"aoj_2189_1751490","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nstring itos(int x){\n string r;\n while(x){\n r+=x%10+'0';\n x/=10;\n }\n reverse(r.begin(),r.end());\n return r;\n}\n\nint main(){\n int n,cnt;\n string s;\n cin>>n;\n while(n--){\n cin>>s;\n cnt=0;\n for(int i=0;i<s.size()-1;i++){\n int cal=s[i]-'0'+s[i+1]-'0';\n string sub=s.substr(i+2,s.size()-i);\n string ts=itos(cal);\n s=ts+sub;\n cnt++;\n if(s.size()==1)break;\n i=-1;\n }\n if(cnt%2)cout<<\"Fabre wins.\"<<endl;\n else cout<<\"Audrey wins.\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1212,"score_of_the_acc":-0.1443,"final_rank":5},{"submission_id":"aoj_2189_1684687","code_snippet":"#include <iostream>\n#include <sstream>\n\n/*\n * [Addition Game | Aizu Online Judge](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2189 \"Addition Game | Aizu Online Judge\")\n * ????????? : ??????<marony@binbo-kodakusan.com>\n * ?????¨?¨???? C++\n */\nusing namespace std;\n\nauto solve(string q, int t) -> int {\n if (q.length() <= 1)\n return t;\n\n int x, y;\n stringstream ss;\n ss << q[0];\n ss >> x;\n ss.clear();\n ss.str(\"\");\n ss << q[1];\n ss >> y;\n ss.clear();\n ss.str(\"\");\n ss << x + y;\n ss << q.substr(2);\n return solve(ss.str(), (t + 1) % 2);\n}\n\nauto main() -> int {\n int n;\n cin >> n;\n\n string q;\n for (int i = 0; i < n; ++i) {\n cin >> q;\n if (solve(q, 0) != 0)\n cout << \"Fabre wins.\" << endl;\n else\n cout << \"Audrey wins.\" << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":6580,"score_of_the_acc":-1.0892,"final_rank":19},{"submission_id":"aoj_2189_1680369","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include <sstream>\nusing namespace std;\n#define N(X) ((X)-'0')\n\nstring update(string &s) {\n\tint count = 0;\n\twhile(1 < s.size()) {\n\t\tstringstream ss;\n\t\tss << N(s[0]) + N(s[1]);\n\t\ts.erase(0, 2);\n\t\ts.insert(0, ss.str());\n\t\tcount++;\n\t}\n\tcout << ((count % 2) ? \"Fabre\" : \"Audrey\") << \" wins.\" << endl;\n\treturn s;\n}\n\nint main() {\n\tint n; cin >> n;\n\tstring str;\n\twhile(n--) {\n\t\tcin >> str;\n\t\tupdate(str);\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1248,"score_of_the_acc":-0.1488,"final_rank":8},{"submission_id":"aoj_2189_1351382","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nint main(){\n int total_test_cases;\n while(~scanf(\"%d\",&total_test_cases)){\n for(int test_i = 0; test_i < total_test_cases; test_i++){\n string tmp_stage;\n cin >> tmp_stage;\n vector<int> stage;\n for(int i = 0; i < tmp_stage.size(); i++){\n stage.push_back(tmp_stage[i] - '0');\n }\n\n int count = 0;\n while(stage.size() >= 2){\n stringstream ss;\n ss << (stage[stage.size()-2] + stage[stage.size()-1]);\n stage.pop_back();\n stage.pop_back();\n for(int i = 0; i < ss.str().size(); i++){\n stage.push_back(ss.str()[i] - '0');\n }\n count++;\n }\n printf(\"%s\\n\",count % 2 == 0 ? \"Audrey wins.\" : \"Fabre wins.\");\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1276,"score_of_the_acc":-0.295,"final_rank":12},{"submission_id":"aoj_2189_1258273","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\n\nint main() {\n int T; cin >>T;\n while(T--){\n string N; cin >>N;\n int cnt = 0;\n while(N.length() > 1){\n int m = (N[0] - '0') + (N[1] - '0');\n stringstream ss;\n ss << m;\n N = ss.str() + N.substr(2);\n ++cnt;\n }\n cout <<(cnt % 2 ? \"Fabre wins.\" : \"Audrey wins.\") <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1228,"score_of_the_acc":-0.2892,"final_rank":10},{"submission_id":"aoj_2189_876457","code_snippet":"#include <iostream>\n#include <unordered_map>\n\nusing namespace std;\n\nunordered_map<string, bool> memo;\n\ninline string Sum(int i, string s)\n{\n int sum = (s[i] - '0') + (s[i + 1] - '0');\n string res = s.substr(0, i);\n\n if (sum / 10 == 0)\n res += (char)(sum + '0');\n else {\n res += (char)((sum / 10) + '0');\n res += (char)((sum % 10) + '0');\n }\n\n if (s.size() == i + 1)\n return res;\n else\n return res + s.substr(i + 2, s.size() - (i + 2));\n}\n\nint main()\n{\n int t;\n\n cin >> t;\n while (t--) {\n string s;\n int ft = 0;\n\n cin >> s;\n while (1 < s.size()) {\n s = Sum(0, s);\n ft = 1 - ft;\n }\n\n if (ft == 1)\n cout << \"Fabre wins.\\n\";\n else\n cout << \"Audrey wins.\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1208,"score_of_the_acc":-0.1438,"final_rank":4},{"submission_id":"aoj_2189_804322","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\nusing namespace std;\n#define A cout << \"Audrey wins.\" << endl\n#define F cout << \"Fabre wins.\" << endl\n\nint c2i(char s){\n return s-'0';\n}\n\nstring c2s(char aa,char bb){\n int a = c2i(aa)+c2i(bb);\n if(a == 0) return \"0\";\n\n string s = \"\";\n while(a > 0){\n s += ((a%10)+'0');\n a /= 10;\n }\n reverse(s.begin(),s.end());\n return s;\n}\n\nint main(){\n int n;\n\n cin >> n;\n while(n--){\n string str;\n cin >> str;\n \n int cnt = 0;\n while(str.size() >= 2){\n cnt++;\n int pos = str.size()-2;\n string tmp = c2s(str[pos],str[pos+1]);\n if(pos >= 0) str = str.substr(0,pos) + tmp;\n }\n if(cnt%2) F;\n else A; \n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1216,"score_of_the_acc":-0.1448,"final_rank":7},{"submission_id":"aoj_2189_804290","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <sstream>\nusing namespace std;\n#define A cout << \"Audrey wins.\" << endl\n#define F cout << \"Fabre wins.\" << endl\n\nstring i2s(int num){\n string s;\n stringstream ss;\n\n ss << num;\n ss >> s;\n\n return s;\n}\n\nint main(){\n int n;\n\n cin >> n;\n while(n--){\n string str;\n cin >> str;\n \n int cnt = 0;\n while(str.size() >= 2){\n cnt++;\n int pos = str.size()-2;\n int sum = (str[pos]-'0')+(str[pos+1]-'0');\n string tmp = i2s(sum);\n str = str.substr(0,pos) + tmp;\n }\n if(cnt%2) F;\n else A; \n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1232,"score_of_the_acc":-0.4325,"final_rank":14},{"submission_id":"aoj_2189_803791","code_snippet":"#include<iostream>\n#include<sstream>\n\nusing namespace std;\nstring tmp,str;\nint num,ans[2],n;\n\nstring i2s(int num){\n string str;\n stringstream s;\n s<<num;\n s>>str;\n return str;\n}\n \nvoid dfs(string str,int cnt){\n if(str.size()==1){\n ans[cnt%2]=1;\n return;\n }\n tmp=\"\";\n num=(str[0]-'0')+(str[1]-'0');\n tmp+=i2s(num);\n if(str.size()>2)tmp+=str.substr(2,str.size()-2);\n dfs(tmp,cnt+1);\n}\nint main(){\n cin>>n;\n while(n--){\n ans[0]=ans[1]=0;\n string str;\n cin>>str;\n dfs(str,0);\n if(!ans[0]) cout<<\"Fabre wins.\"<<endl;\n else cout<<\"Audrey wins.\"<<endl;\n \n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2412,"score_of_the_acc":-0.5774,"final_rank":17},{"submission_id":"aoj_2189_803754","code_snippet":"#include<iostream>\n#include<sstream>\n\n\nusing namespace std;\nstring tmp;\nint num,ans[2];\n\nstring i2s(int num){\n string str;\n stringstream s;\n s<<num;\n s>>str;\n return str;\n\n}\n \nvoid dfs(string str,int cnt){\n //cout<<str<<' '<<cnt;\n //if(str.size()==1)cout<<\"-----\"<<endl;\n //else cout<<endl;\n if(str.size()==1){\n ans[cnt%2]=1;\n }\n\n\n if(str.size()>1){\n for(int i=0;i<1;i++){\n tmp=\"\";\n tmp+=str.substr(0,i);\n num=(str[i]-'0')+(str[i+1]-'0');\n tmp+=i2s(num);\n tmp+=str.substr(i+2,str.size()-(i+2));\n dfs(tmp,cnt+1);\n }\n }\n}\nint main(){\n int n;\n cin>>n;\n while(n--){\n ans[0]=ans[1]=0;\n string str;\n cin>>str;\n dfs(str,0);\n //cout<<ans[0]<<' '<<ans[1]<<endl;\n if(ans[0]==0){\n cout<<\"Fabre wins.\"<<endl;\n }else{\n cout<<\"Audrey wins.\"<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2440,"score_of_the_acc":-0.5808,"final_rank":18},{"submission_id":"aoj_2189_803744","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n while(n--) {\n string s;\n cin >> s;\n int t=1;\n while(s.size()!=1) {\n if(t) t=0;\n else t=1;\n stringstream ss;\n string t;\n ss << (int)s[s.size()-1]-48+(int)s[s.size()-2]-48;\n ss >> t;\n s=s.substr(0,s.size()-2)+t;\n }\n if(t) cout << \"Audrey wins.\" << endl;\n else cout << \"Fabre wins.\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1232,"score_of_the_acc":-0.4325,"final_rank":14},{"submission_id":"aoj_2189_803715","code_snippet":"#include <iostream>\n#include <string>\n#include <sstream>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n while(n--) {\n string s;\n cin >> s;\n int t=1,a[s.size()];\n while(s.size()!=1) {\n if(t) t=0;\n else t=1;\n int a[s.size()];\n for(int i=0; i<s.size(); i++) a[i]=(int)s[i]-48;\n int x=a[s.size()-1]+a[s.size()-2];\n stringstream ss;\n string t;\n ss << x;\n ss >> t;\n s=s.substr(0,s.size()-2)+t;\n }\n if(t) cout << \"Audrey wins.\" << endl;\n else cout << \"Fabre wins.\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1236,"score_of_the_acc":-0.5758,"final_rank":16},{"submission_id":"aoj_2189_781754","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<sstream>\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define inf (1<<29)\n\nusing namespace std;\n\nstring line;\n\nstring itos(int i){ stringstream ss; ss << i; return ss.str();}\n\nvoid compute()\n{\n int cnt = 0;\n string nline;\n while(line.size() > 1)\n {\n line = itos(line[0]-'0'+line[1]-'0') + line.substr(2,line.size()-2);\n cnt++;\n }\n cout << (cnt%2?\"Fabre wins.\":\"Audrey wins.\") << endl;\n}\n\nint main()\n{\n int T;\n while(cin >>T)\n rep(_,T)\n {\n\tcin >> line;\n\tcompute();\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1228,"score_of_the_acc":-0.2892,"final_rank":10},{"submission_id":"aoj_2189_756739","code_snippet":"#include<iostream>\n#include<string>\nusing namespace std;\n\ninline void change(string &s){\n int a = s[0]-'0', b = s[1]-'0';\n string res;\n if(a+b>9){\n res += '0'+(a+b)/10;\n res += '0'+(a+b)%10;\n }else{\n res += '0'+a+b;\n }\n\n s = res + s.substr(2);\n}\n\nint main(){\n int n;\n string s;\n cin >> n;\n while(n--){\n cin >> s;\n int cnt = 0;\n while(s.size()>1)change(s), cnt++;\n cout << ((cnt&1)?\"Fabre\":\"Audrey\") << \" wins.\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1200,"score_of_the_acc":-0.1429,"final_rank":3},{"submission_id":"aoj_2189_743765","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <climits>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <stack>\n#include <vector>\n#include <queue>\n#include <bitset>\n#include <string>\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<n; i++)\n#define RPA(i,s,e) for(int i=s; i<=e; i++)\n#define RPD(i,s,e) for(int i=s; i>=e; i--)\n#define PB(a) push_back(a)\n#define MP(i,s) make_pair(i,s)\n#define SZ(a) (int)(a).size()\n#define ALL(a) (a).begin(), (a).end()\n#define PRT(a) cout << (a) << endl\n#define PRT2(a,b) cout << (a) << \" \" << (b) << endl\n#define PRT3(a,b,c) cout << (a) << \" \" << (b) << \" \" << (c) << endl\n\ntypedef vector<int> VI;\ntypedef long long LL;\ntypedef pair<int,int> P;\n\nint isWin(vector<int> num, int played) {\n\tif(num.size() == 1) return false;\n\tbool res = false;\n\tvector<int> next = num;\n\tint a = next.back(); next.pop_back();\n\tint b = next.back(); next.pop_back();\n\tif(a + b >= 10) {\n\t\tnext.push_back(1);\n\t\tnext.push_back((a + b) % 10);\n\t} else {\n\t\tnext.push_back(a + b);\n\t}\n\tif(!isWin(next, played+1)) res = true;\n\n\treturn res;\n}\n\nvoid coding() {\n\tint n;\n\tstring num;\n\tscanf(\"%d\", &n);\n\tfor(int i=0; i<n; i++) {\n\t\tcin >> num;\n\t\tvector<int> v;\n\t\tfor(int k=0; k<num.size(); k++) {\n\t\t\tv.push_back(num[k] - '0');\n\t\t}\n\t\tif(isWin(v, 0)) {\n\t\t\tprintf(\"Fabre wins.\\n\");\n\t\t} else {\n\t\t\tprintf(\"Audrey wins.\\n\");\n\t\t}\n\t}\n}\n\n// #define _LOCAL_TEST\n\nint main() {\n#ifdef _LOCAL_TEST\n\tclock_t startTime = clock();\n\tfreopen(\"a.in\", \"r\", stdin);\n#endif\n\n\tcoding();\n\n#ifdef _LOCAL_TEST\n\tclock_t elapsedTime = clock() - startTime;\n\tcout << endl;\n\tcout << (elapsedTime / 1000.0) << \" sec elapsed.\" << endl;\n\tcout << \"This is local test\" << endl;\n\tcout << \"Do not forget to comment out _LOCAL_TEST\" << endl << endl;\n#endif\n}","accuracy":1,"time_ms":80,"memory_kb":9344,"score_of_the_acc":-2,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2189_1912847\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\nint solve(string S) {\\n\\tif (S.size() == 1)return 0;\\n\\tstring U = S;\\n\\tint F = (int)(U[0] - '0') + (int)(U[1] - '0');\\n\\tU = to_string(F) + U.substr(2, U.size() - 2);\\n\\treturn solve(U) + 1;\\n}\\nstring T;\\nint main() {\\n\\tint n; cin >> n;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> T; int P = solve(T);\\n\\t\\tif (P % 2 == 0)cout << \\\"Audrey wins.\\\" << endl;\\n\\t\\tif (P % 2 == 1)cout << \\\"Fabre wins.\\\" << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4372,\n \"score_of_the_acc\": -0.3895,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2189_1907199\",\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<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nstring to_str(int a){\\n\\tstring s=\\\"\\\";\\n\\twhile(a){\\n\\t\\ts=(char)(a%10+'0')+s;\\n\\t\\ta/=10;\\n\\t}\\n\\tif(s==\\\"\\\")s=\\\"0\\\";\\n\\treturn s;\\n}\\nint main(){\\n\\tint q;\\n\\tcin>>q;\\n\\twhile(q--){\\n\\t\\tstring s;\\n\\t\\tcin>>s;\\n\\t\\tint out=0;\\n\\t\\twhile(s.size()!=1){\\n\\t\\t\\tint t=s[0]+s[1]-'0'-'0';\\n\\t\\t\\ts=to_str(t)+s.substr(2);\\n\\t\\t\\tout^=1;\\n\\t\\t}\\n\\t\\tif(!out)cout<<\\\"Audrey wins.\\\"<<endl;\\n\\t\\telse cout<<\\\"Fabre wins.\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.002,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2189_1886875\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\n#define A cout << \\\"Audrey wins.\\\" << endl\\n#define F cout << \\\"Fabre wins.\\\" << endl\\n \\nint c2i(char s){\\n return s-'0';\\n}\\n \\nstring c2s(char aa,char bb){\\n int a = c2i(aa)+c2i(bb);\\n if(a == 0) return \\\"0\\\";\\n \\n string s = \\\"\\\";\\n while(a > 0){\\n\\ts += ((a%10)+'0');\\n\\ta /= 10;\\n }\\n reverse(s.begin(),s.end());\\n return s;\\n}\\n \\nint main(){\\n int n;\\n \\n cin >> n;\\n while(n--){\\n\\tstring str;\\n\\tcin >> str;\\n \\n\\tint cnt = 0;\\n\\twhile(str.size() >= 2){\\n\\t cnt++;\\n\\t int pos = str.size()-2;\\n\\t string tmp = c2s(str[pos],str[pos+1]);\\n\\t if(pos >= 0) str = str.substr(0,pos) + tmp;\\n\\t}\\n\\tif(cnt%2) F;\\n\\telse A; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2992,\n \"score_of_the_acc\": -0.22,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2189_1771645\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int n;\\n cin>>n;\\n while(n--){\\n string str;\\n cin>>str;\\n\\n int cnt=1;\\n while(str.size()!=1){\\n cnt++;\\n int a=(str[0]-'0')+(str[1]-'0');\\n string b;\\n if(a>=10) b+=(a/10+'0'),b+=(a%10+'0');\\n else b=(a+'0');\\n str=b+str.substr(2,str.size());\\n }\\n\\n\\n if(cnt%2)cout <<\\\"Audrey wins.\\\"<<endl;\\n else cout <<\\\"Fabre wins.\\\"<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1443,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2189_1760685\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\nstring itos(int x){\\n string r;\\n while(x){\\n r+=x%10+'0';\\n x/=10;\\n }\\n reverse(r.begin(),r.end());\\n return r;\\n}\\n \\nint main(){\\n int n,cnt;\\n string s;\\n cin>>n;\\n while(n--){\\n cin>>s;\\n cnt=0;\\n for(int i=0;i<s.size()-1;i++){\\n int cal=s[i]-'0'+s[i+1]-'0';\\n string sub=s.substr(i+2,s.size()-i);\\n string ts=itos(cal);\\n s=ts+sub;\\n cnt++;\\n if(s.size()==1)break;\\n i=-1;\\n }\\n if(cnt%2)cout<<\\\"Fabre wins.\\\"<<endl;\\n else cout<<\\\"Audrey wins.\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.0015,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2189_1751490\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstring itos(int x){\\n string r;\\n while(x){\\n r+=x%10+'0';\\n x/=10;\\n }\\n reverse(r.begin(),r.end());\\n return r;\\n}\\n\\nint main(){\\n int n,cnt;\\n string s;\\n cin>>n;\\n while(n--){\\n cin>>s;\\n cnt=0;\\n for(int i=0;i<s.size()-1;i++){\\n int cal=s[i]-'0'+s[i+1]-'0';\\n string sub=s.substr(i+2,s.size()-i);\\n string ts=itos(cal);\\n s=ts+sub;\\n cnt++;\\n if(s.size()==1)break;\\n i=-1;\\n }\\n if(cnt%2)cout<<\\\"Fabre wins.\\\"<<endl;\\n else cout<<\\\"Audrey wins.\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -0.1443,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2189_1684687\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n\\n/*\\n * [Addition Game | Aizu Online Judge](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2189 \\\"Addition Game | Aizu Online Judge\\\")\\n * ????????? : ??????<marony@binbo-kodakusan.com>\\n * ?????¨?¨???? C++\\n */\\nusing namespace std;\\n\\nauto solve(string q, int t) -> int {\\n if (q.length() <= 1)\\n return t;\\n\\n int x, y;\\n stringstream ss;\\n ss << q[0];\\n ss >> x;\\n ss.clear();\\n ss.str(\\\"\\\");\\n ss << q[1];\\n ss >> y;\\n ss.clear();\\n ss.str(\\\"\\\");\\n ss << x + y;\\n ss << q.substr(2);\\n return solve(ss.str(), (t + 1) % 2);\\n}\\n\\nauto main() -> int {\\n int n;\\n cin >> n;\\n\\n string q;\\n for (int i = 0; i < n; ++i) {\\n cin >> q;\\n if (solve(q, 0) != 0)\\n cout << \\\"Fabre wins.\\\" << endl;\\n else\\n cout << \\\"Audrey wins.\\\" << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6580,\n \"score_of_the_acc\": -1.0892,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2189_1680369\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <sstream>\\nusing namespace std;\\n#define N(X) ((X)-'0')\\n\\nstring update(string &s) {\\n\\tint count = 0;\\n\\twhile(1 < s.size()) {\\n\\t\\tstringstream ss;\\n\\t\\tss << N(s[0]) + N(s[1]);\\n\\t\\ts.erase(0, 2);\\n\\t\\ts.insert(0, ss.str());\\n\\t\\tcount++;\\n\\t}\\n\\tcout << ((count % 2) ? \\\"Fabre\\\" : \\\"Audrey\\\") << \\\" wins.\\\" << endl;\\n\\treturn s;\\n}\\n\\nint main() {\\n\\tint n; cin >> n;\\n\\tstring str;\\n\\twhile(n--) {\\n\\t\\tcin >> str;\\n\\t\\tupdate(str);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -0.1488,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2189_1351382\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nint main(){\\n int total_test_cases;\\n while(~scanf(\\\"%d\\\",&total_test_cases)){\\n for(int test_i = 0; test_i < total_test_cases; test_i++){\\n string tmp_stage;\\n cin >> tmp_stage;\\n vector<int> stage;\\n for(int i = 0; i < tmp_stage.size(); i++){\\n stage.push_back(tmp_stage[i] - '0');\\n }\\n\\n int count = 0;\\n while(stage.size() >= 2){\\n stringstream ss;\\n ss << (stage[stage.size()-2] + stage[stage.size()-1]);\\n stage.pop_back();\\n stage.pop_back();\\n for(int i = 0; i < ss.str().size(); i++){\\n stage.push_back(ss.str()[i] - '0');\\n }\\n count++;\\n }\\n printf(\\\"%s\\\\n\\\",count % 2 == 0 ? \\\"Audrey wins.\\\" : \\\"Fabre wins.\\\");\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.295,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2189_1258273\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define REVERSE(v) reverse((v).begin(), (v).end())\\n\\nint main() {\\n int T; cin >>T;\\n while(T--){\\n string N; cin >>N;\\n int cnt = 0;\\n while(N.length() > 1){\\n int m = (N[0] - '0') + (N[1] - '0');\\n stringstream ss;\\n ss << m;\\n N = ss.str() + N.substr(2);\\n ++cnt;\\n }\\n cout <<(cnt % 2 ? \\\"Fabre wins.\\\" : \\\"Audrey wins.\\\") <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.2892,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2189_876457\",\n \"code_snippet\": \"#include <iostream>\\n#include <unordered_map>\\n\\nusing namespace std;\\n\\nunordered_map<string, bool> memo;\\n\\ninline string Sum(int i, string s)\\n{\\n int sum = (s[i] - '0') + (s[i + 1] - '0');\\n string res = s.substr(0, i);\\n\\n if (sum / 10 == 0)\\n res += (char)(sum + '0');\\n else {\\n res += (char)((sum / 10) + '0');\\n res += (char)((sum % 10) + '0');\\n }\\n\\n if (s.size() == i + 1)\\n return res;\\n else\\n return res + s.substr(i + 2, s.size() - (i + 2));\\n}\\n\\nint main()\\n{\\n int t;\\n\\n cin >> t;\\n while (t--) {\\n string s;\\n int ft = 0;\\n\\n cin >> s;\\n while (1 < s.size()) {\\n s = Sum(0, s);\\n ft = 1 - ft;\\n }\\n\\n if (ft == 1)\\n cout << \\\"Fabre wins.\\\\n\\\";\\n else\\n cout << \\\"Audrey wins.\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1208,\n \"score_of_the_acc\": -0.1438,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2189_804322\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\nusing namespace std;\\n#define A cout << \\\"Audrey wins.\\\" << endl\\n#define F cout << \\\"Fabre wins.\\\" << endl\\n\\nint c2i(char s){\\n return s-'0';\\n}\\n\\nstring c2s(char aa,char bb){\\n int a = c2i(aa)+c2i(bb);\\n if(a == 0) return \\\"0\\\";\\n\\n string s = \\\"\\\";\\n while(a > 0){\\n s += ((a%10)+'0');\\n a /= 10;\\n }\\n reverse(s.begin(),s.end());\\n return s;\\n}\\n\\nint main(){\\n int n;\\n\\n cin >> n;\\n while(n--){\\n string str;\\n cin >> str;\\n \\n int cnt = 0;\\n while(str.size() >= 2){\\n cnt++;\\n int pos = str.size()-2;\\n string tmp = c2s(str[pos],str[pos+1]);\\n if(pos >= 0) str = str.substr(0,pos) + tmp;\\n }\\n if(cnt%2) F;\\n else A; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -0.1448,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2189_804290\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\nusing namespace std;\\n#define A cout << \\\"Audrey wins.\\\" << endl\\n#define F cout << \\\"Fabre wins.\\\" << endl\\n\\nstring i2s(int num){\\n string s;\\n stringstream ss;\\n\\n ss << num;\\n ss >> s;\\n\\n return s;\\n}\\n\\nint main(){\\n int n;\\n\\n cin >> n;\\n while(n--){\\n string str;\\n cin >> str;\\n \\n int cnt = 0;\\n while(str.size() >= 2){\\n cnt++;\\n int pos = str.size()-2;\\n int sum = (str[pos]-'0')+(str[pos+1]-'0');\\n string tmp = i2s(sum);\\n str = str.substr(0,pos) + tmp;\\n }\\n if(cnt%2) F;\\n else A; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.4325,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2189_803791\",\n \"code_snippet\": \"#include<iostream>\\n#include<sstream>\\n\\nusing namespace std;\\nstring tmp,str;\\nint num,ans[2],n;\\n\\nstring i2s(int num){\\n string str;\\n stringstream s;\\n s<<num;\\n s>>str;\\n return str;\\n}\\n \\nvoid dfs(string str,int cnt){\\n if(str.size()==1){\\n ans[cnt%2]=1;\\n return;\\n }\\n tmp=\\\"\\\";\\n num=(str[0]-'0')+(str[1]-'0');\\n tmp+=i2s(num);\\n if(str.size()>2)tmp+=str.substr(2,str.size()-2);\\n dfs(tmp,cnt+1);\\n}\\nint main(){\\n cin>>n;\\n while(n--){\\n ans[0]=ans[1]=0;\\n string str;\\n cin>>str;\\n dfs(str,0);\\n if(!ans[0]) cout<<\\\"Fabre wins.\\\"<<endl;\\n else cout<<\\\"Audrey wins.\\\"<<endl;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2412,\n \"score_of_the_acc\": -0.5774,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2189_803754\",\n \"code_snippet\": \"#include<iostream>\\n#include<sstream>\\n\\n\\nusing namespace std;\\nstring tmp;\\nint num,ans[2];\\n\\nstring i2s(int num){\\n string str;\\n stringstream s;\\n s<<num;\\n s>>str;\\n return str;\\n\\n}\\n \\nvoid dfs(string str,int cnt){\\n //cout<<str<<' '<<cnt;\\n //if(str.size()==1)cout<<\\\"-----\\\"<<endl;\\n //else cout<<endl;\\n if(str.size()==1){\\n ans[cnt%2]=1;\\n }\\n\\n\\n if(str.size()>1){\\n for(int i=0;i<1;i++){\\n tmp=\\\"\\\";\\n tmp+=str.substr(0,i);\\n num=(str[i]-'0')+(str[i+1]-'0');\\n tmp+=i2s(num);\\n tmp+=str.substr(i+2,str.size()-(i+2));\\n dfs(tmp,cnt+1);\\n }\\n }\\n}\\nint main(){\\n int n;\\n cin>>n;\\n while(n--){\\n ans[0]=ans[1]=0;\\n string str;\\n cin>>str;\\n dfs(str,0);\\n //cout<<ans[0]<<' '<<ans[1]<<endl;\\n if(ans[0]==0){\\n cout<<\\\"Fabre wins.\\\"<<endl;\\n }else{\\n cout<<\\\"Audrey wins.\\\"<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2440,\n \"score_of_the_acc\": -0.5808,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2189_803744\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n cin >> n;\\n while(n--) {\\n string s;\\n cin >> s;\\n int t=1;\\n while(s.size()!=1) {\\n if(t) t=0;\\n else t=1;\\n stringstream ss;\\n string t;\\n ss << (int)s[s.size()-1]-48+(int)s[s.size()-2]-48;\\n ss >> t;\\n s=s.substr(0,s.size()-2)+t;\\n }\\n if(t) cout << \\\"Audrey wins.\\\" << endl;\\n else cout << \\\"Fabre wins.\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.4325,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2189_803715\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <sstream>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n cin >> n;\\n while(n--) {\\n string s;\\n cin >> s;\\n int t=1,a[s.size()];\\n while(s.size()!=1) {\\n if(t) t=0;\\n else t=1;\\n int a[s.size()];\\n for(int i=0; i<s.size(); i++) a[i]=(int)s[i]-48;\\n int x=a[s.size()-1]+a[s.size()-2];\\n stringstream ss;\\n string t;\\n ss << x;\\n ss >> t;\\n s=s.substr(0,s.size()-2)+t;\\n }\\n if(t) cout << \\\"Audrey wins.\\\" << endl;\\n else cout << \\\"Fabre wins.\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.5758,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2189_781754\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<sstream>\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define inf (1<<29)\\n\\nusing namespace std;\\n\\nstring line;\\n\\nstring itos(int i){ stringstream ss; ss << i; return ss.str();}\\n\\nvoid compute()\\n{\\n int cnt = 0;\\n string nline;\\n while(line.size() > 1)\\n {\\n line = itos(line[0]-'0'+line[1]-'0') + line.substr(2,line.size()-2);\\n cnt++;\\n }\\n cout << (cnt%2?\\\"Fabre wins.\\\":\\\"Audrey wins.\\\") << endl;\\n}\\n\\nint main()\\n{\\n int T;\\n while(cin >>T)\\n rep(_,T)\\n {\\n\\tcin >> line;\\n\\tcompute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.2892,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2189_756739\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\nusing namespace std;\\n\\ninline void change(string &s){\\n int a = s[0]-'0', b = s[1]-'0';\\n string res;\\n if(a+b>9){\\n res += '0'+(a+b)/10;\\n res += '0'+(a+b)%10;\\n }else{\\n res += '0'+a+b;\\n }\\n\\n s = res + s.substr(2);\\n}\\n\\nint main(){\\n int n;\\n string s;\\n cin >> n;\\n while(n--){\\n cin >> s;\\n int cnt = 0;\\n while(s.size()>1)change(s), cnt++;\\n cout << ((cnt&1)?\\\"Fabre\\\":\\\"Audrey\\\") << \\\" wins.\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.1429,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2189_743765\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <climits>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <vector>\\n#include <queue>\\n#include <bitset>\\n#include <string>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<n; i++)\\n#define RPA(i,s,e) for(int i=s; i<=e; i++)\\n#define RPD(i,s,e) for(int i=s; i>=e; i--)\\n#define PB(a) push_back(a)\\n#define MP(i,s) make_pair(i,s)\\n#define SZ(a) (int)(a).size()\\n#define ALL(a) (a).begin(), (a).end()\\n#define PRT(a) cout << (a) << endl\\n#define PRT2(a,b) cout << (a) << \\\" \\\" << (b) << endl\\n#define PRT3(a,b,c) cout << (a) << \\\" \\\" << (b) << \\\" \\\" << (c) << endl\\n\\ntypedef vector<int> VI;\\ntypedef long long LL;\\ntypedef pair<int,int> P;\\n\\nint isWin(vector<int> num, int played) {\\n\\tif(num.size() == 1) return false;\\n\\tbool res = false;\\n\\tvector<int> next = num;\\n\\tint a = next.back(); next.pop_back();\\n\\tint b = next.back(); next.pop_back();\\n\\tif(a + b >= 10) {\\n\\t\\tnext.push_back(1);\\n\\t\\tnext.push_back((a + b) % 10);\\n\\t} else {\\n\\t\\tnext.push_back(a + b);\\n\\t}\\n\\tif(!isWin(next, played+1)) res = true;\\n\\n\\treturn res;\\n}\\n\\nvoid coding() {\\n\\tint n;\\n\\tstring num;\\n\\tscanf(\\\"%d\\\", &n);\\n\\tfor(int i=0; i<n; i++) {\\n\\t\\tcin >> num;\\n\\t\\tvector<int> v;\\n\\t\\tfor(int k=0; k<num.size(); k++) {\\n\\t\\t\\tv.push_back(num[k] - '0');\\n\\t\\t}\\n\\t\\tif(isWin(v, 0)) {\\n\\t\\t\\tprintf(\\\"Fabre wins.\\\\n\\\");\\n\\t\\t} else {\\n\\t\\t\\tprintf(\\\"Audrey wins.\\\\n\\\");\\n\\t\\t}\\n\\t}\\n}\\n\\n// #define _LOCAL_TEST\\n\\nint main() {\\n#ifdef _LOCAL_TEST\\n\\tclock_t startTime = clock();\\n\\tfreopen(\\\"a.in\\\", \\\"r\\\", stdin);\\n#endif\\n\\n\\tcoding();\\n\\n#ifdef _LOCAL_TEST\\n\\tclock_t elapsedTime = clock() - startTime;\\n\\tcout << endl;\\n\\tcout << (elapsedTime / 1000.0) << \\\" sec elapsed.\\\" << endl;\\n\\tcout << \\\"This is local test\\\" << endl;\\n\\tcout << \\\"Do not forget to comment out _LOCAL_TEST\\\" << endl << endl;\\n#endif\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 9344,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1188,"cells":{"group_id":{"kind":"string","value":"aoj_2192_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nあみだくじ\nなつめは大のねこ好きである。なつめは今日も日課としている野良ねこのブラッシングをするために，いつも野良ねこが集まってくる校庭の一角に向かうことにした。\nそのスポットに今日は\nn\n匹のねこが集まってきた。なつめは全員をブラッシングしてやりたかったのだが，ちょうどそこに来る直前に突然用事が出来てしまい，時間的に一匹しかブラッシングしてやれないことになってしまった。ブラッシングはどのねこも楽しみにしているので，一匹だけやると他のねこが嫉妬してしまう。そこでねこたちを納得させるために，どのねこをブラッシングするかをあみだくじで決めることにした。\nあみだくじは\nn\n本の縦線とあらかじめ引いた\nm\n本の横線からなる。横線はとなりあう2本の縦線をそれらと垂直になるように結ばなければならない。また，横線同士が端点を共有してはいけない。ある1本の縦線の下端には当たりのマークがつけてある。これらの条件を満たすあみだくじの例を図に示す（これらはサンプル入力の例と対応している）。\n図: 問題の条件をみたすあみだくじの例\nねこたちはそれぞれ縦線の上端からどれか1つを選ぶ。そしてあみだくじを辿った結果，当たりをひいたねこが，今日のブラッシングをしてもらう権利を手に入れることができる，というルールである。なつめは早速あみだくじを作成した。縦線・横線・当たりを書き込み，横線が見えないように隠した。\nいよいよねこたちに選んでもらおうという時になって，なつめは\nn\n匹のねこの中に，普段は顔を見せない野良ねこのアクタガワがいることに気がついた。アクタガワはもう一ヶ月ほどブラッシングをしておらず，毛がごわごわしている。\nなつめは他のねこたちには申し訳ないと思いながらも，ズルをしてアクタガワをブラッシングするように仕組むことにした。まず，ねこたちにそれぞれ普通通り縦線を選んでもらう。全員が選び終わったらなつめはこっそりといくつかの横線を追加し，アクタガワが当たるようにあみだくじを変更するのだ。\nしかし，アクタガワが選んだ縦線によってはアクタガワを当たりにするために新たに引かなければならない横線が多すぎて，細工をしている間にねこたちに計画がバレてしまうかもしれない。そこでなつめはまずそれぞれの縦線について，アクタガワがそれを選んだ場合に何本の横線を引けば当たりにすることができるかを求めることにした。\nなお，新たに引く横線も，となりあう2本の縦線をそれらと垂直に結ばなければならず，横線同士が端点を共有しないように引かなければならない。\nInput\n入力データは以下の形式で与えられる。\nn\nm\nk\nh\n1\nx\n1\nh\n2\nx\n2\n...\nh\nm\nx\nm\n入力の一行目には縦線の本数\nn\n(1 ≤\nn\n≤ 100000)，すでに引かれている横線の本数\nm\n(0 ≤\nm\n≤ 100000)，当たりの縦線の番号\nk\n(1 ≤\nk\n≤\nn\n) が与えられる。ここで，縦線の番号は，左から順に，1, 2, ...,\nn\nとする。\n続く\nm\n行には横線の情報が与えられる。各行は一つの横線の情報を表す二つの整数\nh\n(1 ≤\nh\n≤ 1000000) 及び\nx\n(1 ≤\nx\n≤\nn\n- 1) が与えられる。\nh\nは縦線の下端からの距離，\nx\nは横線によって結ばれる縦線のうち，左側の縦線の番号である。つまり，この横線は\nx\n番目と\nx\n+1 番目の縦線を結ぶことになる。\nなお、入力では横線は整数高さの位置にしか存在しないが、新たに追加する横棒の位置は必ずしも整数高さでなくてもよい。\nOutput\nn\n行の文字列を出力せよ。\ni\n(1 ≤\ni\n≤\nn\n) 行目には，アクタガワが\ni\n番目の縦線を選んだときに，アクタガワを当たりにするために追加する必要がある横線の最小本数を出力せよ。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n4\n3 2 1\n20 1\n10 2\n5 7 3\n70 1\n60 4\n50 2\n40 4\n30 1\n20 3\n10 2\n1 0 1\n4 2 1\n10 1\n10 3\nOutput for the Sample Input\n1\n0\n1\n1\n0\n1\n1\n2\n0\n1\n0\n1\n2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2192_2303693","code_snippet":"#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n#define fr first\n#define sc second\n\nconst int INF=1000000000;\n\nstruct SEG{\n int siz;\n int s[1<<18];\n void init(){\n siz = 1<<17;\n for(int i=0;i<2*siz-1;i++){\n s[i]=INF;\n }\n }\n void updata(int a,int b,int x,int k,int l,int r){\n if(b <= l || r <= a)return;\n if(a <= l && r <= b){\n s[k] = min ( s[k] , x );\n return;\n }\n updata(a,b,x,2*k+1,l,(l+r)/2);\n updata(a,b,x,2*k+2,(l+r)/2,r);\n }\n void _updata(int a,int x,int k,int l,int r){\n if(a+1 <= l || r <= a)return;\n if(a==l&&r==a+1){\n s[k] = x;\n return;\n }\n updata(l,r,s[k],2*k+1,l,(l+r)/2);\n updata(l,r,s[k],2*k+2,(l+r)/2,r);\n s[k] = INF;\n _updata(a,x,2*k+1,l,(l+r)/2);\n _updata(a,x,2*k+2,(l+r)/2,r);\n }\n int query(int a){\n a += siz-1;\n int ret = s[a];\n while(a > 0){\n a = (a-1)/2;\n ret = min ( ret , s[a] );\n }\n return ret;\n }\n}dp[2];\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n for(int test=0;test<T;test++){\n static int n,m,k;\n static int h[100010],x[100010];\n scanf(\"%d%d%d\",&n,&m,&k);\n for(int i=0;i<m;i++){\n scanf(\"%d%d\",&h[i],&x[i]);\n }\n \n pair<int,int> p[100010];\n for(int i=0;i<m;i++){\n p[i]=pair<int,int>(h[i],x[i]);\n }\n sort(p,p+m);\n \n dp[0].init();\n dp[1].init();\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\n \n int t=0;\n int now=k;\n for(int i=0;i<m;i++){\n int c[2] = {1,-1};\n if(p[i].sc == now)now++;\n else if(p[i].sc+1 == now)now--;\n for(int j=0;j<2;j++){\n int memo=dp[j].query(p[i].sc);\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]),0,0,dp[j].siz);\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]),0,0,dp[j].siz);\n }\n \n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\n for(;t<=i;t++){\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\n //dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\n //dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\n //dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\n //dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\n }\n }\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\n }\n }\n}","accuracy":1,"time_ms":600,"memory_kb":6808,"score_of_the_acc":-0.5833,"final_rank":2},{"submission_id":"aoj_2192_2303690","code_snippet":"#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n#define fr first\n#define sc second\n\nconst int INF=1000000000;\n\nstruct SEG{\n int siz;\n int s[1<<18];\n void init(){\n siz = 1<<17;\n for(int i=0;i<2*siz-1;i++){\n s[i]=INF;\n }\n }\n void updata(int a,int b,int x,int k,int l,int r){\n if(b <= l || r <= a)return;\n if(a <= l && r <= b){\n s[k] = min ( s[k] , x );\n return;\n }\n updata(a,b,x,2*k+1,l,(l+r)/2);\n updata(a,b,x,2*k+2,(l+r)/2,r);\n }\n void _updata(int a,int x,int k,int l,int r){\n if(a+1 <= l || r <= a)return;\n if(a==l&&r==a+1){\n s[k] = x;\n return;\n }\n updata(l,r,s[k],2*k+1,l,(l+r)/2);\n updata(l,r,s[k],2*k+2,(l+r)/2,r);\n s[k] = INF;\n _updata(a,x,2*k+1,l,(l+r)/2);\n _updata(a,x,2*k+2,(l+r)/2,r);\n }\n /*void _updata(int a,int x){\n int l=a,r=a+1,m=a;\n a += siz-1;\n s[a] = x;\n while(a > 0){\n if(a%2 == 0){\n l -= r-l;\n }\n else {\n r += r-l;\n }\n a = (a-1)/2;\n updata(l,m,s[a],a,l,r);\n updata(m+1,r,s[a],a,l,r);\n s[a] = INF;\n }\n }*/\n int query(int a){\n a += siz-1;\n int ret = s[a];\n while(a > 0){\n a = (a-1)/2;\n ret = min ( ret , s[a] );\n }\n return ret;\n }\n}dp[2];\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n for(int test=0;test<T;test++){\n static int n,m,k;\n static int h[100010],x[100010];\n scanf(\"%d%d%d\",&n,&m,&k);\n for(int i=0;i<m;i++){\n scanf(\"%d%d\",&h[i],&x[i]);\n }\n \n pair<int,int> p[100010];\n for(int i=0;i<m;i++){\n p[i]=pair<int,int>(h[i],x[i]);\n }\n sort(p,p+m);\n \n dp[0].init();\n dp[1].init();\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\n \n int t=0;\n int now=k;\n for(int i=0;i<m;i++){\n int c[2] = {1,-1};\n if(p[i].sc == now)now++;\n else if(p[i].sc+1 == now)now--;\n for(int j=0;j<2;j++){\n int memo=dp[j].query(p[i].sc);\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]),0,0,dp[j].siz);\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]),0,0,dp[j].siz);\n }\n \n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\n for(;t<=i;t++){\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\n }\n }\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\n }\n }\n}","accuracy":1,"time_ms":890,"memory_kb":6780,"score_of_the_acc":-0.1239,"final_rank":1},{"submission_id":"aoj_2192_2303675","code_snippet":"#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n#define fr first\n#define sc second\n\nconst int INF=1000000000;\n\nstruct SEG{\n int siz;\n int s[1<<18];\n void init(){\n siz = 1<<17;\n for(int i=0;i<2*siz-1;i++){\n s[i]=INF;\n }\n }\n void updata(int a,int b,int x,int k,int l,int r){\n if(b <= l || r <= a)return;\n if(a <= l && r <= b){\n s[k] = min ( s[k] , x );\n return;\n }\n updata(a,b,x,2*k+1,l,(l+r)/2);\n updata(a,b,x,2*k+2,(l+r)/2,r);\n }\n void _updata(int a,int x){\n int l=a,r=a+1,m=a;\n a += siz-1;\n s[a] = x;\n while(a > 0){\n if(a%2 == 0){\n l -= r-l;\n }\n else {\n r += r-l;\n }\n a = (a-1)/2;\n updata(l,m,s[a],a,l,r);\n updata(m+1,r,s[a],a,l,r);\n s[a] = INF;\n }\n }\n int query(int a){\n a += siz-1;\n int ret = s[a];\n while(a > 0){\n a = (a-1)/2;\n ret = min ( ret , s[a] );\n }\n return ret;\n }\n}dp[2];\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n for(int test=0;test<T;test++){\n static int n,m,k;\n static int h[100010],x[100010];\n scanf(\"%d%d%d\",&n,&m,&k);\n for(int i=0;i<m;i++){\n scanf(\"%d%d\",&h[i],&x[i]);\n }\n \n pair<int,int> p[100010];\n for(int i=0;i<m;i++){\n p[i]=pair<int,int>(h[i],x[i]);\n }\n sort(p,p+m);\n \n dp[0].init();\n dp[1].init();\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\n \n \n /*static vector<int> G[100010];\n static int a[100010];\n a[0]=0; G[0].clear();\n a[n+1]=n+1; G[n+1].clear();\n for(int i=1;i<=n;i++){\n a[i]=i;\n G[i].clear();\n G[i].push_back(i-1);\n G[i].push_back(i+1);\n }*/\n \n int t=0;\n int now=k;\n for(int i=0;i<m;i++){\n int c[2] = {1,-1};\n if(p[i].sc == now)now++;\n else if(p[i].sc+1 == now)now--;\n for(int j=0;j<2;j++){\n int memo=dp[j].query(p[i].sc);\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]));\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]));\n }\n \n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\n for(;t<=i;t++){\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\n }\n }\n \n /*for(int i=1;i<=n;i++){\n dp[0].updata(i,n+1,min(dp[0].query(i)+i,dp[1].query(i)-i)-i,0,0,dp[0].siz);\n dp[1].updata(1,i+1,min(dp[0].query(i)+i,dp[1].query(i)-i)+i,0,0,dp[1].siz);\n }*/\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\n }\n /*for(int i=0;i<100010;i++){\n ans[i]=100010;\n }\n ans[a[k]]=0;\n \n queue<int> que;\n que.push(a[k]);\n while(!que.empty()){\n int s=que.front(); que.pop();\n for(int i=0;i<G[s].size();i++){\n if(ans[G[s][i]]==100010){\n ans[G[s][i]]=ans[s]+1;\n que.push(G[s][i]);\n }\n }\n }\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",ans[i],10);\n }*/\n }\n}","accuracy":1,"time_ms":2710,"memory_kb":6828,"score_of_the_acc":-1.9017,"final_rank":4},{"submission_id":"aoj_2192_2303665","code_snippet":"#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n#define fr first\n#define sc second\n\nconst int INF=1000000000;\n\nstruct SEG{\n int siz;\n int s[1<<18];\n void init(){\n siz = 1<<17;\n for(int i=0;i<2*siz-1;i++){\n s[i]=INF;\n }\n }\n void updata(int a,int b,int x,int k,int l,int r){\n if(b <= l || r <= a)return;\n if(a <= l && r <= b){\n s[k] = min ( s[k] , x );\n return;\n }\n updata(a,b,x,2*k+1,l,(l+r)/2);\n updata(a,b,x,2*k+2,(l+r)/2,r);\n }\n void _updata(int a,int x){\n int l=a,r=a+1,m=a;\n a += siz-1;\n s[a] = x;\n while(a > 0){\n if(a%2 == 0){\n l -= r-l;\n }\n else {\n r += r-l;\n }\n a = (a-1)/2;\n updata(l,m,s[a],a,l,r);\n updata(m+1,r,s[a],a,l,r);\n s[a] = INF;\n }\n }\n int query(int a){\n a += siz-1;\n int ret = s[a];\n while(a > 0){\n a = (a-1)/2;\n ret = min ( ret , s[a] );\n }\n return ret;\n }\n}dp[2];\n\nint main(){\n int T;\n scanf(\"%d\",&T);\n for(int test=0;test<T;test++){\n static int n,m,k;\n static int h[100010],x[100010];\n scanf(\"%d%d%d\",&n,&m,&k);\n for(int i=0;i<m;i++){\n scanf(\"%d%d\",&h[i],&x[i]);\n }\n \n pair<int,int> p[100010];\n for(int i=0;i<m;i++){\n p[i]=pair<int,int>(h[i],x[i]);\n }\n sort(p,p+m);\n \n dp[0].init();\n dp[1].init();\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\n \n \n /*static vector<int> G[100010];\n static int a[100010];\n a[0]=0; G[0].clear();\n a[n+1]=n+1; G[n+1].clear();\n for(int i=1;i<=n;i++){\n a[i]=i;\n G[i].clear();\n G[i].push_back(i-1);\n G[i].push_back(i+1);\n }*/\n \n int t=0;\n int now=k;\n for(int i=0;i<m;i++){\n int c[2] = {1,-1};\n if(p[i].sc == now)now++;\n else if(p[i].sc+1 == now)now--;\n for(int j=0;j<2;j++){\n //int memo=min(dp[j].query(p[i].sc),dp[j].query(p[i].sc+1)+c[j]);\n //dp[j].updata(p[i].sc,p[i].sc+1,memo,0,0,dp[j].siz);\n //dp[j].updata(p[i].sc+2,p[i].sc+1,memo-c[j],0,0,dp[j].siz);\n int memo=dp[j].query(p[i].sc);\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]));\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]));\n //if(j == 1)cout << p[i].sc+1 << \" \" << memo-c[j] << endl;\n }\n \n /*for(int j=1;j<=n;j++){\n printf(\"%d \",dp[0].query(j)+j);\n cout << endl;\n }\n for(int j=1;j<=n;j++){\n printf(\"%d \",dp[1].query(j)-j);\n cout << endl;\n }*/\n \n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\n for(;t<=i;t++){\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\n }\n \n /*G[a[p[i].sc-1]].push_back(a[p[i].sc]);\n G[a[p[i].sc]].push_back(a[p[i].sc-1]);\n G[a[p[i].sc+1]].push_back(a[p[i].sc+2]);\n G[a[p[i].sc+2]].push_back(a[p[i].sc+1]);*/\n }\n \n for(int i=1;i<=n;i++){\n //if(dp[0].query(i)+i==0){\n dp[0].updata(i,n+1,min(dp[0].query(i)+i,dp[1].query(i)-i)-i,0,0,dp[0].siz);\n dp[1].updata(1,i+1,min(dp[0].query(i)+i,dp[1].query(i)-i)+i,0,0,dp[1].siz);\n //}\n }\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\n }\n /*for(int i=0;i<100010;i++){\n ans[i]=100010;\n }\n ans[a[k]]=0;\n \n queue<int> que;\n que.push(a[k]);\n while(!que.empty()){\n int s=que.front(); que.pop();\n for(int i=0;i<G[s].size();i++){\n if(ans[G[s][i]]==100010){\n ans[G[s][i]]=ans[s]+1;\n que.push(G[s][i]);\n }\n }\n }\n \n for(int i=1;i<=n;i++){\n printf(\"%d%c\",ans[i],10);\n }*/\n }\n}","accuracy":1,"time_ms":2940,"memory_kb":6780,"score_of_the_acc":-1,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2192_2303693\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\n#define fr first\\n#define sc second\\n\\nconst int INF=1000000000;\\n\\nstruct SEG{\\n int siz;\\n int s[1<<18];\\n void init(){\\n siz = 1<<17;\\n for(int i=0;i<2*siz-1;i++){\\n s[i]=INF;\\n }\\n }\\n void updata(int a,int b,int x,int k,int l,int r){\\n if(b <= l || r <= a)return;\\n if(a <= l && r <= b){\\n s[k] = min ( s[k] , x );\\n return;\\n }\\n updata(a,b,x,2*k+1,l,(l+r)/2);\\n updata(a,b,x,2*k+2,(l+r)/2,r);\\n }\\n void _updata(int a,int x,int k,int l,int r){\\n if(a+1 <= l || r <= a)return;\\n if(a==l&&r==a+1){\\n s[k] = x;\\n return;\\n }\\n updata(l,r,s[k],2*k+1,l,(l+r)/2);\\n updata(l,r,s[k],2*k+2,(l+r)/2,r);\\n s[k] = INF;\\n _updata(a,x,2*k+1,l,(l+r)/2);\\n _updata(a,x,2*k+2,(l+r)/2,r);\\n }\\n int query(int a){\\n a += siz-1;\\n int ret = s[a];\\n while(a > 0){\\n a = (a-1)/2;\\n ret = min ( ret , s[a] );\\n }\\n return ret;\\n }\\n}dp[2];\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n for(int test=0;test<T;test++){\\n static int n,m,k;\\n static int h[100010],x[100010];\\n scanf(\\\"%d%d%d\\\",&n,&m,&k);\\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\",&h[i],&x[i]);\\n }\\n \\n pair<int,int> p[100010];\\n for(int i=0;i<m;i++){\\n p[i]=pair<int,int>(h[i],x[i]);\\n }\\n sort(p,p+m);\\n \\n dp[0].init();\\n dp[1].init();\\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\\n \\n int t=0;\\n int now=k;\\n for(int i=0;i<m;i++){\\n int c[2] = {1,-1};\\n if(p[i].sc == now)now++;\\n else if(p[i].sc+1 == now)now--;\\n for(int j=0;j<2;j++){\\n int memo=dp[j].query(p[i].sc);\\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]),0,0,dp[j].siz);\\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]),0,0,dp[j].siz);\\n }\\n \\n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\\n for(;t<=i;t++){\\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\\n //dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\\n //dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\\n //dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\\n //dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\\n }\\n }\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 6808,\n \"score_of_the_acc\": -0.5833,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2192_2303690\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\n#define fr first\\n#define sc second\\n\\nconst int INF=1000000000;\\n\\nstruct SEG{\\n int siz;\\n int s[1<<18];\\n void init(){\\n siz = 1<<17;\\n for(int i=0;i<2*siz-1;i++){\\n s[i]=INF;\\n }\\n }\\n void updata(int a,int b,int x,int k,int l,int r){\\n if(b <= l || r <= a)return;\\n if(a <= l && r <= b){\\n s[k] = min ( s[k] , x );\\n return;\\n }\\n updata(a,b,x,2*k+1,l,(l+r)/2);\\n updata(a,b,x,2*k+2,(l+r)/2,r);\\n }\\n void _updata(int a,int x,int k,int l,int r){\\n if(a+1 <= l || r <= a)return;\\n if(a==l&&r==a+1){\\n s[k] = x;\\n return;\\n }\\n updata(l,r,s[k],2*k+1,l,(l+r)/2);\\n updata(l,r,s[k],2*k+2,(l+r)/2,r);\\n s[k] = INF;\\n _updata(a,x,2*k+1,l,(l+r)/2);\\n _updata(a,x,2*k+2,(l+r)/2,r);\\n }\\n /*void _updata(int a,int x){\\n int l=a,r=a+1,m=a;\\n a += siz-1;\\n s[a] = x;\\n while(a > 0){\\n if(a%2 == 0){\\n l -= r-l;\\n }\\n else {\\n r += r-l;\\n }\\n a = (a-1)/2;\\n updata(l,m,s[a],a,l,r);\\n updata(m+1,r,s[a],a,l,r);\\n s[a] = INF;\\n }\\n }*/\\n int query(int a){\\n a += siz-1;\\n int ret = s[a];\\n while(a > 0){\\n a = (a-1)/2;\\n ret = min ( ret , s[a] );\\n }\\n return ret;\\n }\\n}dp[2];\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n for(int test=0;test<T;test++){\\n static int n,m,k;\\n static int h[100010],x[100010];\\n scanf(\\\"%d%d%d\\\",&n,&m,&k);\\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\",&h[i],&x[i]);\\n }\\n \\n pair<int,int> p[100010];\\n for(int i=0;i<m;i++){\\n p[i]=pair<int,int>(h[i],x[i]);\\n }\\n sort(p,p+m);\\n \\n dp[0].init();\\n dp[1].init();\\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\\n \\n int t=0;\\n int now=k;\\n for(int i=0;i<m;i++){\\n int c[2] = {1,-1};\\n if(p[i].sc == now)now++;\\n else if(p[i].sc+1 == now)now--;\\n for(int j=0;j<2;j++){\\n int memo=dp[j].query(p[i].sc);\\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]),0,0,dp[j].siz);\\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]),0,0,dp[j].siz);\\n }\\n \\n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\\n for(;t<=i;t++){\\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\\n }\\n }\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 6780,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2192_2303675\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\n#define fr first\\n#define sc second\\n\\nconst int INF=1000000000;\\n\\nstruct SEG{\\n int siz;\\n int s[1<<18];\\n void init(){\\n siz = 1<<17;\\n for(int i=0;i<2*siz-1;i++){\\n s[i]=INF;\\n }\\n }\\n void updata(int a,int b,int x,int k,int l,int r){\\n if(b <= l || r <= a)return;\\n if(a <= l && r <= b){\\n s[k] = min ( s[k] , x );\\n return;\\n }\\n updata(a,b,x,2*k+1,l,(l+r)/2);\\n updata(a,b,x,2*k+2,(l+r)/2,r);\\n }\\n void _updata(int a,int x){\\n int l=a,r=a+1,m=a;\\n a += siz-1;\\n s[a] = x;\\n while(a > 0){\\n if(a%2 == 0){\\n l -= r-l;\\n }\\n else {\\n r += r-l;\\n }\\n a = (a-1)/2;\\n updata(l,m,s[a],a,l,r);\\n updata(m+1,r,s[a],a,l,r);\\n s[a] = INF;\\n }\\n }\\n int query(int a){\\n a += siz-1;\\n int ret = s[a];\\n while(a > 0){\\n a = (a-1)/2;\\n ret = min ( ret , s[a] );\\n }\\n return ret;\\n }\\n}dp[2];\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n for(int test=0;test<T;test++){\\n static int n,m,k;\\n static int h[100010],x[100010];\\n scanf(\\\"%d%d%d\\\",&n,&m,&k);\\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\",&h[i],&x[i]);\\n }\\n \\n pair<int,int> p[100010];\\n for(int i=0;i<m;i++){\\n p[i]=pair<int,int>(h[i],x[i]);\\n }\\n sort(p,p+m);\\n \\n dp[0].init();\\n dp[1].init();\\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\\n \\n \\n /*static vector<int> G[100010];\\n static int a[100010];\\n a[0]=0; G[0].clear();\\n a[n+1]=n+1; G[n+1].clear();\\n for(int i=1;i<=n;i++){\\n a[i]=i;\\n G[i].clear();\\n G[i].push_back(i-1);\\n G[i].push_back(i+1);\\n }*/\\n \\n int t=0;\\n int now=k;\\n for(int i=0;i<m;i++){\\n int c[2] = {1,-1};\\n if(p[i].sc == now)now++;\\n else if(p[i].sc+1 == now)now--;\\n for(int j=0;j<2;j++){\\n int memo=dp[j].query(p[i].sc);\\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]));\\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]));\\n }\\n \\n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\\n for(;t<=i;t++){\\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\\n }\\n }\\n \\n /*for(int i=1;i<=n;i++){\\n dp[0].updata(i,n+1,min(dp[0].query(i)+i,dp[1].query(i)-i)-i,0,0,dp[0].siz);\\n dp[1].updata(1,i+1,min(dp[0].query(i)+i,dp[1].query(i)-i)+i,0,0,dp[1].siz);\\n }*/\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\\n }\\n /*for(int i=0;i<100010;i++){\\n ans[i]=100010;\\n }\\n ans[a[k]]=0;\\n \\n queue<int> que;\\n que.push(a[k]);\\n while(!que.empty()){\\n int s=que.front(); que.pop();\\n for(int i=0;i<G[s].size();i++){\\n if(ans[G[s][i]]==100010){\\n ans[G[s][i]]=ans[s]+1;\\n que.push(G[s][i]);\\n }\\n }\\n }\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",ans[i],10);\\n }*/\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2710,\n \"memory_kb\": 6828,\n \"score_of_the_acc\": -1.9017,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2192_2303665\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\n#define fr first\\n#define sc second\\n\\nconst int INF=1000000000;\\n\\nstruct SEG{\\n int siz;\\n int s[1<<18];\\n void init(){\\n siz = 1<<17;\\n for(int i=0;i<2*siz-1;i++){\\n s[i]=INF;\\n }\\n }\\n void updata(int a,int b,int x,int k,int l,int r){\\n if(b <= l || r <= a)return;\\n if(a <= l && r <= b){\\n s[k] = min ( s[k] , x );\\n return;\\n }\\n updata(a,b,x,2*k+1,l,(l+r)/2);\\n updata(a,b,x,2*k+2,(l+r)/2,r);\\n }\\n void _updata(int a,int x){\\n int l=a,r=a+1,m=a;\\n a += siz-1;\\n s[a] = x;\\n while(a > 0){\\n if(a%2 == 0){\\n l -= r-l;\\n }\\n else {\\n r += r-l;\\n }\\n a = (a-1)/2;\\n updata(l,m,s[a],a,l,r);\\n updata(m+1,r,s[a],a,l,r);\\n s[a] = INF;\\n }\\n }\\n int query(int a){\\n a += siz-1;\\n int ret = s[a];\\n while(a > 0){\\n a = (a-1)/2;\\n ret = min ( ret , s[a] );\\n }\\n return ret;\\n }\\n}dp[2];\\n\\nint main(){\\n int T;\\n scanf(\\\"%d\\\",&T);\\n for(int test=0;test<T;test++){\\n static int n,m,k;\\n static int h[100010],x[100010];\\n scanf(\\\"%d%d%d\\\",&n,&m,&k);\\n for(int i=0;i<m;i++){\\n scanf(\\\"%d%d\\\",&h[i],&x[i]);\\n }\\n \\n pair<int,int> p[100010];\\n for(int i=0;i<m;i++){\\n p[i]=pair<int,int>(h[i],x[i]);\\n }\\n sort(p,p+m);\\n \\n dp[0].init();\\n dp[1].init();\\n dp[0].updata(k,n+1,-k,0,0,dp[0].siz);\\n dp[1].updata(1,k+1,k,0,0,dp[1].siz);\\n \\n \\n /*static vector<int> G[100010];\\n static int a[100010];\\n a[0]=0; G[0].clear();\\n a[n+1]=n+1; G[n+1].clear();\\n for(int i=1;i<=n;i++){\\n a[i]=i;\\n G[i].clear();\\n G[i].push_back(i-1);\\n G[i].push_back(i+1);\\n }*/\\n \\n int t=0;\\n int now=k;\\n for(int i=0;i<m;i++){\\n int c[2] = {1,-1};\\n if(p[i].sc == now)now++;\\n else if(p[i].sc+1 == now)now--;\\n for(int j=0;j<2;j++){\\n //int memo=min(dp[j].query(p[i].sc),dp[j].query(p[i].sc+1)+c[j]);\\n //dp[j].updata(p[i].sc,p[i].sc+1,memo,0,0,dp[j].siz);\\n //dp[j].updata(p[i].sc+2,p[i].sc+1,memo-c[j],0,0,dp[j].siz);\\n int memo=dp[j].query(p[i].sc);\\n dp[j]._updata(p[i].sc,min(dp[j].query(p[i].sc+1)+c[j],abs(now-p[i].sc)-p[i].sc*c[j]));\\n dp[j]._updata(p[i].sc+1,min(memo-c[j],abs(now-p[i].sc-1)-(p[i].sc+1)*c[j]));\\n //if(j == 1)cout << p[i].sc+1 << \\\" \\\" << memo-c[j] << endl;\\n }\\n \\n /*for(int j=1;j<=n;j++){\\n printf(\\\"%d \\\",dp[0].query(j)+j);\\n cout << endl;\\n }\\n for(int j=1;j<=n;j++){\\n printf(\\\"%d \\\",dp[1].query(j)-j);\\n cout << endl;\\n }*/\\n \\n if(i+1<m&&p[i].fr==p[i+1].fr)continue;\\n for(;t<=i;t++){\\n dp[0].updata(p[t].sc+1,n+1,min(dp[0].query(p[t].sc+1),dp[1].query(p[t].sc+1)-2*(p[t].sc+1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc+2,min(dp[0].query(p[t].sc+1)+2*(p[t].sc+1),dp[1].query(p[t].sc+1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc,n+1,min(dp[0].query(p[t].sc),dp[1].query(p[t].sc)-2*p[t].sc),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+1,min(dp[0].query(p[t].sc)+2*p[t].sc,dp[1].query(p[t].sc)),0,0,dp[1].siz);\\n dp[0].updata(p[t].sc-1,n+1,min(dp[0].query(p[t].sc-1),dp[1].query(p[t].sc-1)-2*(p[t].sc-1)),0,0,dp[0].siz);\\n dp[1].updata(1,p[t].sc,min(dp[0].query(p[t].sc-1)+2*(p[t].sc-1),dp[1].query(p[t].sc-1)),0,0,dp[0].siz);\\n dp[0].updata(p[t].sc+2,n+1,min(dp[0].query(p[t].sc+2),dp[1].query(p[t].sc+2)-2*(p[t].sc+2)),0,0,dp[1].siz);\\n dp[1].updata(1,p[t].sc+3,min(dp[0].query(p[t].sc+2)+2*(p[t].sc+2),dp[1].query(p[t].sc+2)),0,0,dp[1].siz);\\n }\\n \\n /*G[a[p[i].sc-1]].push_back(a[p[i].sc]);\\n G[a[p[i].sc]].push_back(a[p[i].sc-1]);\\n G[a[p[i].sc+1]].push_back(a[p[i].sc+2]);\\n G[a[p[i].sc+2]].push_back(a[p[i].sc+1]);*/\\n }\\n \\n for(int i=1;i<=n;i++){\\n //if(dp[0].query(i)+i==0){\\n dp[0].updata(i,n+1,min(dp[0].query(i)+i,dp[1].query(i)-i)-i,0,0,dp[0].siz);\\n dp[1].updata(1,i+1,min(dp[0].query(i)+i,dp[1].query(i)-i)+i,0,0,dp[1].siz);\\n //}\\n }\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",min(dp[0].query(i)+i,dp[1].query(i)-i),10);\\n }\\n /*for(int i=0;i<100010;i++){\\n ans[i]=100010;\\n }\\n ans[a[k]]=0;\\n \\n queue<int> que;\\n que.push(a[k]);\\n while(!que.empty()){\\n int s=que.front(); que.pop();\\n for(int i=0;i<G[s].size();i++){\\n if(ans[G[s][i]]==100010){\\n ans[G[s][i]]=ans[s]+1;\\n que.push(G[s][i]);\\n }\\n }\\n }\\n \\n for(int i=1;i<=n;i++){\\n printf(\\\"%d%c\\\",ans[i],10);\\n }*/\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2940,\n \"memory_kb\": 6780,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1189,"cells":{"group_id":{"kind":"string","value":"aoj_2184_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nCave Explorer\nMike Smith is a man exploring caves all over the world.\nOne day, he faced a scaring creature blocking his way. He got scared, but in short time he took\nhis knife and then slashed it to attempt to kill it. Then they were split into parts, which soon\ndied out but the largest one. He slashed the creature a couple of times more to make it small\nenough, and finally became able to go forward.\nNow let us think of his situation in a mathematical way. The creature is considered to be a\npolygon, convex or concave. Mike slashes this creature straight with his knife in some direction.\nWe suppose here the direction is given for simpler settings, while the position is arbitrary. Then\nall split parts but the largest one disappears.\nYour task is to write a program that calculates the area of the remaining part when the creature\nis slashed in such a way that the area is minimized.\nInput\nThe input is a sequence of datasets. Each dataset is given in the following format:\nn\nv\nx\nv\ny\nx\n1\ny\n1\n...\nx\nn\ny\nn\nThe first line contains an integer\nn\n, the number of vertices of the polygon that represents the\nshape of the creature (3 ≤\nn\n≤ 100). The next line contains two integers\nv\nx\nand\nv\ny\n, where\n(\nv\nx\n,\nv\ny\n) denote a vector that represents the direction of the knife (-10000 ≤\nv\nx\n,\nv\ny\n≤ 10000,\nv\nx\n2\n+\nv\ny\n2\n> 0). Then\nn\nlines follow. The\ni\n-th line contains two integers\nx\ni\nand\ny\ni\n, where (\nx\ni\n,\ny\ni\n)\ndenote the coordinates of the\ni\n-th vertex of the polygon (0 ≤\nx\ni\n,\ny\ni\n≤ 10000).\nThe vertices are given in the counterclockwise order. You may assume the polygon is always\nsimple, that is, the edges do not touch or cross each other except for end points.\nThe input is terminated by a line with a zero. This should not be processed.\nOutput\nFor each dataset, print the minimum possible area in a line. The area may be printed with\nan arbitrary number of digits after the decimal point, but should not contain an absolute error\ngreater than 10\n-2\n.\nSample Input\n5\n0 1\n0 0\n5 0\n1 1\n5 2\n0 2\n7\n9999 9998\n0 0\n2 0\n3 1\n1 1\n10000 9999\n2 2\n0 2\n0\nOutput for the Sample Input\n2.00\n2.2500000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2184_9824183","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n};\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":4020,"score_of_the_acc":-0.9986,"final_rank":15},{"submission_id":"aoj_2184_9824179","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n};\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3924,"score_of_the_acc":-0.9647,"final_rank":7},{"submission_id":"aoj_2184_9824174","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n};\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3916,"score_of_the_acc":-0.9619,"final_rank":6},{"submission_id":"aoj_2184_9824172","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n};\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\t//if (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3928,"score_of_the_acc":-0.9661,"final_rank":8},{"submission_id":"aoj_2184_9824166","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n};\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3960,"score_of_the_acc":-0.9774,"final_rank":13},{"submission_id":"aoj_2184_9824164","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\t//if ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3936,"score_of_the_acc":-0.969,"final_rank":9},{"submission_id":"aoj_2184_9824126","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3844,"score_of_the_acc":-0.9365,"final_rank":4},{"submission_id":"aoj_2184_9824123","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3936,"score_of_the_acc":-0.969,"final_rank":9},{"submission_id":"aoj_2184_9824122","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 10) TOL = 1e-7;\n\telse if (H.size() < 10) TOL = 1e-7;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3848,"score_of_the_acc":-0.9379,"final_rank":5},{"submission_id":"aoj_2184_9824119","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 5) TOL = 1e-7;\n\telse if (limit < 10) TOL = 1e-7;\n\telse if (H.size() < 10) TOL = 1e-8;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":4024,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_2184_9824118","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 5) TOL = 1e-7;\n\telse if (limit < 10) TOL = 1e-7;\n\telse if (H.size() <= 8) TOL = 1e-8;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3980,"score_of_the_acc":-0.9845,"final_rank":14},{"submission_id":"aoj_2184_9824115","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 5) TOL = 1e-7;\n\telse if (limit < 10) TOL = 1e-7;\n\telse if (H.size() == 8) TOL = 1e-8;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":3952,"score_of_the_acc":-0.9746,"final_rank":11},{"submission_id":"aoj_2184_9824106","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\tint s = 0, e = Y.size() - 1, m = 0;\n\twhile (s < e) {\n\t\tm = (s + e) >> 1;\n\t\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t\telse e = m;\n\t}\n\treturn s;\n\t//for (int i = 0; i < Y.size(); i++) {\n\t//\tif (i == 0 && y < Y[i]) return i;\n\t//\tif (eq(Y[i], y)) return i;\n\t//\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t//}\n\t//return Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 5) TOL = 1e-7;\n\telse if (limit < 10) TOL = 1e-7;\n\telse if (H.size() == 8) TOL = 1e-8;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer","accuracy":1,"time_ms":10,"memory_kb":4024,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_2184_9824105","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint;\ntypedef std::vector<ld> Vld;\ntypedef std::vector<bool> Vbool;\nconst ld INF = 1e17;\nld TOL = 1e-15;\nconst ld PI = acos(-1);\nconst int LEN = 105;\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\ninline bool zero(const ld& x) { return !sign(x); }\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\ninline ld sq(ld x) { return (ld)x * x; }\ninline ld norm(ld th) {\n\twhile (th < 0) th += 2 * PI;\n\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\n\treturn th;\n}\nint find_y(const Vld& Y, const ld& y) {\n\t//int s = 0, e = Y.size() - 1, m = 0;\n\t//while (s < e) {\n\t//\tm = (s + e) >> 1;\n\t//\tif (sign(y - Y[m]) > 0) s = m + 1;\n\t//\telse e = m;\n\t//}\n\t//return s;\n\tfor (int i = 0; i < Y.size(); i++) {\n\t\tif (i == 0 && y < Y[i]) return i;\n\t\tif (eq(Y[i], y)) return i;\n\t\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\n\t}\n\treturn Y.size();\n}\n\n#define RIGHT 1\n#define LEFT 2\n\nint N;\nstruct Pos {\n\tld x, y;\n\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\n\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\n\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\n\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\n\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\n\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\n\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\n\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\n\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\n\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\n\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\n\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\n\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\n\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\n\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\n\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\n\tPos operator - () const { return { -x, -y }; }\n\tPos operator ~ () const { return { -y, x }; }\n\tPos operator ! () const { return { y, x }; }\n\tld xy() const { return x * y; }\n\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\n\tld Euc() const { return x * x + y * y; }\n\tld mag() const { return sqrtl(Euc()); }\n\tPos unit() const { return *this / mag(); }\n\tld rad() const { return norm(atan2l(y, x)); }\n\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\n\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\n\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\n\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\n\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\n\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \" \" << p.y; return os; }\n}; const Pos O = { 0, 0 };\ntypedef std::vector<Pos> Polygon;\nPolygon R[LEN], L[LEN];\nint rt, lt;\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\nld area(const Polygon& H) {\n\tld a = 0;\n\tint sz = H.size();\n\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\n\treturn a;\n}\nld largest(Polygon H, const ld& x) {\n\tPos s = Pos(x, -1), e = Pos(x, 1);\n\tld ret = 0;\n\tint i, sz = H.size();\n\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\n\trt = lt = 0;\n\tPolygon tmp;\n\tbool f = 1;\n\tint rl = LEFT;\n\tif (!eq(H[i].x, x)) {\n\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\ti = (i + 1) % sz;\n\t}\n\telse if (eq(H[i].x, x)) {\n\t\tif (eq(H[(i + 1) % sz].x, x)) {\n\t\t\ti = (i + 1) % sz;\n\t\t}\n\t\ttmp.push_back(H[i]);\n\t\ti = (i + 1) % sz;\n\t}\n\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\n\t\tif (eq(H[i].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(H[i]);\n\t\t}\n\t\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\n\t\t\ttmp.push_back(H[i]);\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t\tif (tmp[1].x < x) L[lt++] = tmp;\n\t\t\telse if (tmp[1].x > x) R[rt++] = tmp;\n\t\t\ttmp.clear();\n\t\t\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\n\t\t}\n\t\telse tmp.push_back(H[i]);\n\t}\n\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"x:: \" << x << \"\\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : L[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << j << \"]\\n\";\n\t//\tfor (const Pos& p : R[j]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\n\tVld F, A, Y;\n\tVint I;\n\tI.resize(lt);\n\tfor (int j = 0; j < lt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = L[p];\n\t\tconst Polygon& Q = L[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(lt, 0);\n\tf = 1;\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(L[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(L[i][0].y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"L:: \\n\";\n\t//for (int j = 0; j < lt; j++) {\n\t//\tstd::cout << \"L[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\t//std::cout << \"DEBUG:: \\n\";\n\tfor (int j = 0; j < lt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld h = L[i][0].y;\n\t\tld a = A[i];\n\t\tint yi = find_y(Y, L[i].back().y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\tld y = Y[yi];\n\t\t\t//std::cout << \"FUCK:: L \" << lt << \" \" << j << \" \" << k << \" \" << h << \" \" << y << \" \" << Y[yi] << \"\\n\";\n\t\t\t//std::cout << \"FUCK:: L \\n\";\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\t//if (A[I[k]] > 0) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, L[I[k]].back().y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tY.clear();\n\tI.resize(rt);\n\tfor (int j = 0; j < rt; j++) I[j] = j;\n\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\n\t\tconst Polygon& P = R[p];\n\t\tconst Polygon& Q = R[q];\n\t\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\n\t\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\n\t\treturn py < qy;\n\t\t});\n\tA.resize(rt, 0);\n\tf = 1;\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tA[i] = area(R[i]);\n\t\tif (A[i] < 0) f = 0;\n\t\tY.push_back(R[i].back().y);\n\t}\n\tstd::sort(Y.begin(), Y.end());\n\t//std::cout << \"DEBUG:: \\n\";\n\t//std::cout << \"R:: \\n\";\n\t//for (int j = 0; j < rt; j++) {\n\t//\tstd::cout << \"R[\" << I[j] << \"]\\n\";\n\t//\tfor (const Pos& p : L[I[j]]) std::cout << \" (\" << p.x << \", \" << p.y << \"),\\n\";\n\t//}\n\tfor (int j = 0; j < rt; j++) {\n\t\ti = I[j];\n\t\tif (A[i] < 0) continue;\n\t\tld a = A[i];\n\t\tld h = R[i].back().y;\n\t\tint yi = find_y(Y, R[i][0].y);\n\t\tint k = j + 1;\n\t\twhile (1) {\n\t\t\t//std::cout << \"FUCK:: R \\n\";\n\t\t\t//if (yi <= 0) { F.push_back(a); break; }\n\t\t\tld y = Y[yi];\n\t\t\tif (sign(y - h) > 0) { F.push_back(a); break; }\n\t\t\tif (eq(y, h)) { F.push_back(a); break; }\n\t\t\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\n\t\t\tif (k >= I.size()) break;\n\t\t\tif (A[I[k]] > 0) { F.push_back(a); break; }\n\t\t\tif (A[I[k]] < 0) a += A[I[k]];\n\t\t\tyi = find_y(Y, R[I[k]][0].y);\n\t\t\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\n\t\t}\n\t}\n\tstd::sort(F.rbegin(), F.rend());\n\treturn F[0];\n}\nld ternary_search(const Polygon& H) {\n\tassert(H.size() >= 3);\n\tld s = INF, e = -INF;\n\tld sy = INF, ey = -INF;\n\tfor (const Pos& p : H) {\n\t\ts = std::min(s, p.x), e = std::max(e, p.x);\n\t\tsy = std::min(s, p.x), ey = std::max(e, p.x);\n\t}\n\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\n\t//if (std::abs(s - e) < 5) TOL = 1e-5;\n\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\n\t//else if (H.size() == 8) TOL = 1e-8;\n\t//else TOL = 1e-15;\n\tif (limit < 5) TOL = 1e-7;\n\telse if (limit < 10) TOL = 1e-7;\n\telse if (H.size() == 8) TOL = 1e-8;\n\telse TOL = 1e-15;\n\ts += TOL;\n\te -= TOL;\n\tld a1 = 0, a2 = 0;\n\twhile (std::abs(e - s) > 1e-8) {\n\t\tld m1 = (s + s + e) / 3;\n\t\tld m2 = (s + e + e) / 3;\n\t\ta1 = largest(H, m1);\n\t\ta2 = largest(H, m2);\n\t\t//std::cout << \"a1a2:: \" << a1 << \" \" << a2 << \"\\n\";\n\t\tif (a1 > a2) s = m1;\n\t\telse e = m2;\n\t}\n\t//std::cout << \"a1a2::::::::::::::::\" << a1 << \" \" << a2 << \"\\n\";\n\treturn largest(H, (s + e) * .5);\n}\nVld ANS;\nbool query() {\n\tstd::cin >> N;\n\tif (!N) return 0;\n\tPos v;\n\tstd::cin >> v;\n\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\n\tld t = v.rad();\n\tt = norm(PI * .5 - t);\n\tPolygon H(N);\n\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\n\t//for (const Pos& p : H) std::cout << p << \"\\n\";\n\t//std::cout << ternary_search(H) * .5 << \"\\n\";\n\tANS.push_back(ternary_search(H) * .5);\n\treturn 1;\n}\nvoid solve() {\n\tstd::cin.tie(0)->sync_with_stdio(0);\n\tstd::cout.tie(0);\n\tstd::cout << std::fixed;\n\tstd::cout.precision(15);\n\t//freopen(\"../../../input_data/cave.txt\", \"r\", stdin);\n\t//freopen(\"../../../input_data/cave.ret\", \"w\", stdout);\n\twhile (query());\n\tfor (const ld& a : ANS) std::cout << a << \"\\n\";\n\treturn;\n}\nint main() { solve(); return 0; }//boj13816 Cave Explorer\n\n/*\n* \n10\n1 9998\n0 0\n1 9999\n2 0\n3 9999\n4 0\n5 10000\n4 1\n3 10000\n2 1\n1 10000\nans 1.4999749962\nret 2.500075061\n\n8\n1 1\n0 0\n9999 0\n1 1\n10000 0\n10000 10000\n1 10000\n9999 9999\n0 10000\n\n*/","accuracy":1,"time_ms":10,"memory_kb":3952,"score_of_the_acc":-0.9746,"final_rank":11},{"submission_id":"aoj_2184_4887268","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 205\n#define EPS 0.00001\n#define EPS2 0.000000000001\n\nenum Type{\n\tFIRST,\n\tSECOND,\n};\n\nstruct Point{\n\tPoint(long double arg_x,long 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 * (long double a){ return Point(a*x,a*y); }\n\tPoint operator / (long double a){ return Point(x/a,y/a); }\n\n\tlong double abs(){ return sqrt(norm()); }\n\tlong double norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(y-p.y) > EPS2){\n\n\t\t\treturn y < p.y;\n\t\t}else{\n\n\t\t\treturn x < p.x;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\tdouble a = x-p.x,b = y-p.y;\n\t\treturn sqrt(a*a+b*b) < EPS;\n\t}\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.12Lf,%.12Lf)\\n\",x,y);\n\t}\n\n\tlong double 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\nstruct Info{\n\n\tPoint p;\n\tbool is_cut;\n};\n\nstruct Data{\n\tData(Point arg_p,long double arg_index){\n\t\tp = arg_p;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\n\t\treturn p < arg.p;\n\t}\n\tbool operator==(const struct Data &arg) const{\n\n\t\treturn index == arg.index;\n\t}\n\n\tPoint p;\n\tint index;\n};\n\nstruct VALUE{\n\tVALUE(long double arg_value){\n\n\t\tvalue = arg_value;\n\t}\n\tbool operator<(const struct VALUE &arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tbool operator==(const struct VALUE &arg) const{\n\n\t\treturn fabs(value-arg.value) < EPS2;\n\t}\n\n\tlong double value;\n};\n\nstruct Edge{\n\tEdge(int arg_to,Type arg_type){\n\t\tto = arg_to;\n\t\ttype = arg_type;\n\t}\n\tint to;\n\tType type;\n};\n\nint N;\nint num_point;\nlong double NUM = 1000000;\nvector<int> P;\nPoint point[205];\n\n\nlong double norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\nlong double abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\nlong double cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nlong double 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\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) > EPS2)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS2)return CLOCKWISE;\n\tif(dot(a,b) < -EPS2)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nlong double 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//切片を求める関数\nlong double calc_add(Line line){\n\n\tlong double slope = calc_slope(line);\n\n\tif(fabs(slope-DBL_MAX) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(slope) < EPS){\n\n\t\treturn line.p[0].y;\n\n\t}else{\n\n\t\treturn line.p[0].y-slope*line.p[0].x;\n\t}\n}\n\n\nint func(long double x1,long double y1,long double x2, long double y2, long double xp, long double yp){\n\tlong double naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\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\nlong double calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\nlong double 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//点と線分の距離\nlong double 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//線分と線分の距離\nlong double 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\n\n//交点を求める関数\nPoint calc_Cross_Point(long double x1,long double x2,long double x3,long double x4,long double y1,long double y2,long double y3,long double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nlong double calc_S(Polygon g){\n\n\tint N = g.size();\n\tlong double ret = 0;\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tret += cross(g[i],g[(i+1)%N]);\n\t}\n\treturn ret/2.0;\n}\n\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS2 && dot(a,b) < EPS2)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS2 && EPS2 < b.y && cross(a,b) > EPS2) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n\n//2つのvectorがなすラジアンを求める関数\nlong double calc_rad(Vector vec1,Vector vec2){\n\n\tlong double tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS2){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS2){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\nlong double calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\nlong double 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\nlong double calc_max_S(long double SLOPE,long double add){\n\n\tint num_info = 0;\n\tint table[205];\n\tInfo info[205];\n\tbool check[205];\n\tvector<Edge> G[205];\n\n\tLine base_line;\n\n\tif(fabs(SLOPE-DBL_MAX) < EPS){ //垂直\n\n\t\tbase_line = Line(Point(add,-NUM),Point(add,NUM));\n\n\t}else{\n\n\t\tbase_line = Line(Point(-NUM,-NUM*SLOPE+add),Point(NUM,NUM*SLOPE+add));\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tinfo[i].p = point[i];\n\t\tinfo[i].is_cut = false;\n\t\tnum_info++;\n\t}\n\n\tvector<int> work_P;\n\n\tvector<Data> CROSS;\n\n\tint COUNT = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\twork_P.push_back(P[i]);\n\n\t\tLine work_line = Line(point[i],point[(i+1)%N]);\n\n\t\t//work_line.outPut();\n\t\tlong double tmp_slope = calc_slope(work_line);\n\n\t\tif(fabs(SLOPE-DBL_MAX) < EPS){\n\n\t\t\tif(fabs(work_line.p[0].x-add) < EPS|| fabs(work_line.p[1].x-add) < EPS){\n\n\n\t\t\t}else{\n\n\t\t\t\tif(!is_Cross(base_line,work_line)){\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{\n\t\t\tif(!is_Cross(base_line,work_line)){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif(fabs(SLOPE-tmp_slope) < EPS2){ //★★切断線とポリゴンの辺が平行(交差するので切片もおなじ)★★\n\n\t\t\tinfo[i].is_cut = true;\n\t\t\tinfo[(i+1)%N].is_cut = true;\n\n\t\t\tCROSS.push_back(Data(info[i].p,i));\n\t\t\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\n\n\t\t}else{ //傾きが異なる\n\n\t\t\tPoint cross_p = calc_Cross_Point(base_line,work_line);\n\n\t\t\tif(cross_p == point[i]){\n\n\t\t\t\tinfo[i].is_cut = true;\n\n\t\t\t\tCROSS.push_back(Data(info[i].p,i));\n\n\t\t\t}else if(cross_p == point[(i+1)%N]){\n\n\t\t\t\tinfo[(i+1)%N].is_cut = true;\n\n\t\t\t\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\n\n\t\t\t}else{ //線分の途中に交点が来る\n\n\t\t\t\tinfo[num_info].p = cross_p;\n\t\t\t\tinfo[num_info].is_cut = true;\n\n\t\t\t\twork_P.push_back(num_info);\n\n\t\t\t\tCROSS.push_back(Data(cross_p,num_info));\n\n\t\t\t\tnum_info++;\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\tfor(int i = 0; i < work_P.size(); i++){\n\n\t\tG[i].push_back(Edge((i+1)%work_P.size(),FIRST));\n\t}\n\n\tfor(int i = 0; i < work_P.size(); i++){\n\n\t\ttable[work_P[i]] = i;\n\t}\n\n\tPolygon poly;\n\tfor(int i = 0; i < N; i++){\n\n\t\tpoly.push_back(point[i]);\n\t}\n\n\tsort(CROSS.begin(),CROSS.end());\n\tCROSS.erase(unique(CROSS.begin(),CROSS.end()),CROSS.end());\n\n\tfor(int i = 1; i < CROSS.size(); i++){\n\n\t\tPoint mid_p = (info[CROSS[i-1].index].p+info[CROSS[i].index].p)/2;\n\n\t\tint tmp = contains(poly,mid_p);\n\n\t\tif(tmp != 0){ //内部か辺\n\n\t\t\tG[table[CROSS[i-1].index]].push_back(Edge(table[CROSS[i].index],SECOND));\n\t\t\tG[table[CROSS[i].index]].push_back(Edge(table[CROSS[i-1].index],SECOND));\n\t\t}\n\t}\n\n\tlong double ret = 0;\n\n\tfor(int i = 0; i < num_info; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\tfor(int i = 0; i < num_info; i++){\n\t\tif(check[work_P[i]] || (info[work_P[i]].is_cut && G[i].size() > 1))continue;\n\n\t\tPolygon work_poly;\n\t\tPoint start = info[work_P[i]].p;\n\t\twork_poly.push_back(start);\n\n\t\tcheck[work_P[i]] = true;\n\n\t\tint tmp_index = (i+1)%work_P.size();\n\t\tint tmp_next;\n\n\t\tint pre = i;\n\n\t\tint debug = 0;\n\n\t\twhile(true){\n\n\t\t\tdebug++;\n\n\t\t\tif(debug > work_P.size()+2){\n\t\t\t\t\n\t\t\t\treturn BIG_NUM;\n\t\t\t}\n\n\t\t\twork_poly.push_back(info[work_P[tmp_index]].p);\n\t\t\tcheck[work_P[tmp_index]] = true;\n\n\t\t\tif(info[work_P[tmp_index]].is_cut && G[tmp_index].size() > 1){\n\n\t\t\t\tlong double min_rad_cut = BIG_NUM;\n\t\t\t\tlong double min_rad_not = BIG_NUM;\n\t\t\t\tint min_index_cut = -1,min_index_not = -1;\n\n\t\t\t\tfor(int k = 0; k < G[tmp_index].size(); k++){\n\n\t\t\t\t\tint next = G[tmp_index][k].to;\n\t\t\t\t\tif(next == pre)continue;\n\n\t\t\t\t\tlong double tmp_rad;\n\t\t\t\t\tif(ccw(info[work_P[tmp_index]].p,\n\t\t\t\t\t\t\tinfo[work_P[next]].p,info[work_P[pre]].p) == COUNTER_CLOCKWISE){\n\n\t\t\t\t\t\ttmp_rad = calc_rad(info[work_P[tmp_index]].p,info[work_P[next]].p,info[work_P[pre]].p);\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttmp_rad = 2*M_PI- calc_rad(info[work_P[tmp_index]].p,info[work_P[pre]].p,info[work_P[next]].p);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(G[tmp_index][k].type == SECOND){\n\n\t\t\t\t\t\tif(min_rad_cut > tmp_rad){\n\t\t\t\t\t\t\tmin_rad_cut = tmp_rad;\n\t\t\t\t\t\t\tmin_index_cut = next;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tif(min_rad_not > tmp_rad){\n\t\t\t\t\t\t\tmin_rad_not = tmp_rad;\n\t\t\t\t\t\t\tmin_index_not = next;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(min_index_cut != -1 && min_index_not != -1 && fabs(min_rad_cut-min_rad_not) < EPS){\n\n\t\t\t\t\ttmp_next = min_index_cut;\n\t\t\t\t}else{\n\n\t\t\t\t\tif(min_rad_cut < min_rad_not){\n\n\t\t\t\t\t\ttmp_next = min_index_cut;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttmp_next = min_index_not;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\ttmp_next = (tmp_index+1)%work_P.size();\n\t\t\t}\n\n\t\t\tif(tmp_next == i)break;\n\n\t\t\tpre = tmp_index;\n\t\t\ttmp_index = tmp_next;\n\t\t}\n\n\t\tCOUNT++;\n\t\tret = max(ret,calc_S(work_poly));\n\t}\n\n\tif(COUNT == 0){\n\n\t\treturn BIG_NUM;\n\t}\n\n\treturn ret;\n}\n\n\nvoid func(){\n\n\tP.clear();\n\tnum_point = 0;\n\n\tlong double Vx,Vy;\n\tscanf(\"%Lf %Lf\",&Vx,&Vy);\n\n\tlong double SLOPE = calc_slope(Line(Point(0,0),Point(Vx,Vy)));\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%Lf %Lf\",&point[i].x,&point[i].y);\n\t\tnum_point++;\n\t}\n\tfor(int i = 0; i < N; i++){\n\n\t\tP.push_back(i);\n\t}\n\n\tvector<VALUE> V;\n\n\t//各点を通る、直線の切片またはX座標(傾きが垂直な場合)を求める\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(fabs(SLOPE-DBL_MAX) < EPS){\n\n\t\t\tV.push_back(VALUE(point[i].x));\n\t\t}else{\n\n\n\t\t\tV.push_back(VALUE(point[i].y-SLOPE*point[i].x));\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end());\n\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\tlong double ans = BIG_NUM;\n\n\tfor(int i = 1; i < V.size(); i++){\n\n\t\tlong double L = V[i-1].value,R = V[i].value;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tlong double mid1 = (2.0*L+R)/3.0;\n\t\t\tlong double mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\t\tlong double S1 = calc_max_S(SLOPE,mid1);\n\t\t\tlong double S2 = calc_max_S(SLOPE,mid2);\n\n\t\t\tans = min(ans,min(S1,S2));\n\n\t\t\tif(S1 <= S2){\n\n\t\t\t\tR = mid2;\n\t\t\t}else{\n\n\t\t\t\tL = mid1;\n\t\t\t}\n\n\t\t\tif(fabs(R-L) < EPS2)break;\n\t\t}\n\t}\n\n\tprintf(\"%.10Lf\\n\",ans);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":5010,"memory_kb":3284,"score_of_the_acc":-1.3918,"final_rank":18},{"submission_id":"aoj_2184_4887203","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 205\n#define EPS 0.00001\n#define EPS2 0.000000000001\n\nenum Type{\n\tFIRST,\n\tSECOND,\n};\n\nstruct Point{\n\tPoint(long double arg_x,long 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 * (long double a){ return Point(a*x,a*y); }\n\tPoint operator / (long double a){ return Point(x/a,y/a); }\n\n\tlong double abs(){ return sqrt(norm()); }\n\tlong double 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\tdouble a = x-p.x,b = y-p.y;\n\t\treturn sqrt(a*a+b*b) < EPS;\n\t}\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.12Lf,%.12Lf)\\n\",x,y);\n\t}\n\n\tlong double 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\nstruct Info{\n\n\tPoint p;\n\tbool is_cut;\n};\n\nstruct Data{\n\tData(Point arg_p,long double arg_index){\n\t\tp = arg_p;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\n\t\treturn p < arg.p;\n\t}\n\tbool operator==(const struct Data &arg) const{\n\n\t\treturn index == arg.index;\n\t}\n\n\tPoint p;\n\tint index;\n};\n\nstruct VALUE{\n\tVALUE(long double arg_value){\n\n\t\tvalue = arg_value;\n\t}\n\tbool operator<(const struct VALUE &arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tbool operator==(const struct VALUE &arg) const{\n\n\t\treturn fabs(value-arg.value) < EPS;\n\t}\n\n\tlong double value;\n};\n\nstruct Edge{\n\tEdge(int arg_to,Type arg_type){\n\t\tto = arg_to;\n\t\ttype = arg_type;\n\t}\n\tint to;\n\tType type;\n};\n\nint N;\nint num_point;\nlong double NUM = 1000000;\nvector<int> P;\nPoint point[205];\n\n\nlong double norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\nlong double abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\nlong double cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nlong double 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\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) > EPS2)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS2)return CLOCKWISE;\n\tif(dot(a,b) < -EPS2)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\nlong double 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//切片を求める関数\nlong double calc_add(Line line){\n\n\tlong double slope = calc_slope(line);\n\n\tif(fabs(slope-DBL_MAX) < EPS){\n\n\t\treturn DBL_MAX;\n\n\t}else if(fabs(slope) < EPS){\n\n\t\treturn line.p[0].y;\n\n\t}else{\n\n\t\treturn line.p[0].y-slope*line.p[0].x;\n\t}\n}\n\n\nint func(long double x1,long double y1,long double x2, long double y2, long double xp, long double yp){\n\tlong double naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\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\nlong double calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\nlong double 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//点と線分の距離\nlong double 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//線分と線分の距離\nlong double 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\n\n//交点を求める関数\nPoint calc_Cross_Point(long double x1,long double x2,long double x3,long double x4,long double y1,long double y2,long double y3,long double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nlong double calc_S(Polygon g){\n\n\tint N = g.size();\n\tlong double ret = 0;\n\n\tfor(int i = 0; i < g.size(); i++){\n\t\tret += cross(g[i],g[(i+1)%N]);\n\t}\n\treturn ret/2.0;\n}\n\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS2 && dot(a,b) < EPS2)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS2 && EPS2 < b.y && cross(a,b) > EPS2) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n\n//2つのvectorがなすラジアンを求める関数\nlong double calc_rad(Vector vec1,Vector vec2){\n\n\tlong double tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\n\n\tif(fabs(tmp+1.0) < EPS2){\n\n\t\treturn M_PI;\n\t}\n\n\tif(fabs(tmp-1.0) < EPS2){\n\n\t\treturn 0.0;\n\t}\n\n\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\n}\n\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\nlong double calc_rad(Point base,Point a,Point b){\n\n\tVector vec1 = b-base;\n\tVector vec2 = a-base;\n\n\treturn calc_rad(vec1,vec2);\n}\n\n\nlong double 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\nlong double calc_max_S(long double SLOPE,long double add){\n\n\tint num_info = 0;\n\tint table[205];\n\tInfo info[205];\n\tbool check[205];\n\tvector<Edge> G[205];\n\n\tLine base_line;\n\n\tif(fabs(SLOPE-DBL_MAX) < EPS){ //垂直\n\n\t\tbase_line = Line(Point(add,-NUM),Point(add,NUM));\n\n\t}else{\n\n\t\tbase_line = Line(Point(-NUM,-NUM*SLOPE+add),Point(NUM,NUM*SLOPE+add));\n\t}\n\n\tfor(int i = 0; i < num_point; i++){\n\n\t\tinfo[i].p = point[i];\n\t\tinfo[i].is_cut = false;\n\t\tnum_info++;\n\t}\n\n\tvector<int> work_P;\n\n\tvector<Data> CROSS;\n\n\tint COUNT = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\twork_P.push_back(P[i]);\n\n\t\tLine work_line = Line(point[i],point[(i+1)%N]);\n\n\t\t//work_line.outPut();\n\t\tlong double tmp_slope = calc_slope(work_line);\n\n\t\tif(fabs(SLOPE-DBL_MAX) < EPS){\n\n\t\t\tif(fabs(work_line.p[0].x-add) < EPS|| fabs(work_line.p[1].x-add) < EPS){\n\n\n\t\t\t}else{\n\n\t\t\t\tif(!is_Cross(base_line,work_line)){\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{\n\t\t\tif(!is_Cross(base_line,work_line)){\n\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif(fabs(SLOPE-tmp_slope) < EPS2){ //★★切断線とポリゴンの辺が平行(交差するので切片もおなじ)★★\n\n\t\t\tinfo[i].is_cut = true;\n\t\t\tinfo[(i+1)%N].is_cut = true;\n\n\t\t\tCROSS.push_back(Data(info[i].p,i));\n\t\t\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\n\n\t\t}else{ //傾きが異なる\n\n\t\t\tPoint cross_p = calc_Cross_Point(base_line,work_line);\n\n\t\t\tif(cross_p == point[i]){\n\n\t\t\t\tinfo[i].is_cut = true;\n\n\t\t\t\tCROSS.push_back(Data(info[i].p,i));\n\n\t\t\t}else if(cross_p == point[(i+1)%N]){\n\n\t\t\t\tinfo[(i+1)%N].is_cut = true;\n\n\t\t\t\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\n\n\t\t\t}else{ //線分の途中に交点が来る\n\n\t\t\t\tinfo[num_info].p = cross_p;\n\t\t\t\tinfo[num_info].is_cut = true;\n\n\t\t\t\twork_P.push_back(num_info);\n\n\t\t\t\tCROSS.push_back(Data(cross_p,num_info));\n\n\t\t\t\tnum_info++;\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\tfor(int i = 0; i < work_P.size(); i++){\n\n\t\tG[i].push_back(Edge((i+1)%work_P.size(),FIRST));\n\t}\n\n\tfor(int i = 0; i < work_P.size(); i++){\n\n\t\ttable[work_P[i]] = i;\n\t}\n\n\tPolygon poly;\n\tfor(int i = 0; i < N; i++){\n\n\t\tpoly.push_back(point[i]);\n\t}\n\n\tsort(CROSS.begin(),CROSS.end());\n\tCROSS.erase(unique(CROSS.begin(),CROSS.end()),CROSS.end());\n\n\tfor(int i = 1; i < CROSS.size(); i++){\n\n\t\tPoint mid_p = (info[CROSS[i-1].index].p+info[CROSS[i].index].p)/2;\n\n\t\tint tmp = contains(poly,mid_p);\n\n\t\tif(tmp != 0){ //内部か辺\n\n\t\t\tG[table[CROSS[i-1].index]].push_back(Edge(table[CROSS[i].index],SECOND));\n\t\t\tG[table[CROSS[i].index]].push_back(Edge(table[CROSS[i-1].index],SECOND));\n\t\t}\n\t}\n\n\n\tlong double ret = 0;\n\n\tfor(int i = 0; i < num_info; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\n\tfor(int i = 0; i < num_info; i++){\n\t\tif(check[work_P[i]] || (info[work_P[i]].is_cut && G[i].size() > 1))continue;\n\n\t\tPolygon work_poly;\n\t\tPoint start = info[work_P[i]].p;\n\t\twork_poly.push_back(start);\n\n\t\tcheck[work_P[i]] = true;\n\n\t\tint tmp_index = (i+1)%work_P.size();\n\t\tint tmp_next;\n\n\t\tint pre = i;\n\n\t\tint debug = 0;\n\n\t\twhile(true){\n\n\t\t\tdebug++;\n\n\t\t\tif(debug > work_P.size()+2){\n\t\t\t\treturn BIG_NUM;\n\t\t\t}\n\n\t\t\twork_poly.push_back(info[work_P[tmp_index]].p);\n\t\t\tcheck[work_P[tmp_index]] = true;\n\n\t\t\tif(info[work_P[tmp_index]].is_cut && G[tmp_index].size() > 1){\n\n\t\t\t\tlong double min_rad_cut = BIG_NUM;\n\t\t\t\tlong double min_rad_not = BIG_NUM;\n\t\t\t\tint min_index_cut = -1,min_index_not = -1;\n\n\t\t\t\tfor(int k = 0; k < G[tmp_index].size(); k++){\n\n\t\t\t\t\tint next = G[tmp_index][k].to;\n\t\t\t\t\tif(next == pre)continue;\n\n\t\t\t\t\tlong double tmp_rad;\n\t\t\t\t\tif(ccw(info[work_P[tmp_index]].p,\n\t\t\t\t\t\t\tinfo[work_P[next]].p,info[work_P[pre]].p) == COUNTER_CLOCKWISE){\n\n\t\t\t\t\t\ttmp_rad = calc_rad(info[work_P[tmp_index]].p,info[work_P[next]].p,info[work_P[pre]].p);\n\n\n\t\t\t\t\t}else{\n\t\t\t\t\t\ttmp_rad = 2*M_PI- calc_rad(info[work_P[tmp_index]].p,info[work_P[pre]].p,info[work_P[next]].p);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(G[tmp_index][k].type == SECOND){\n\n\t\t\t\t\t\tif(min_rad_cut > tmp_rad){\n\t\t\t\t\t\t\tmin_rad_cut = tmp_rad;\n\t\t\t\t\t\t\tmin_index_cut = next;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tif(min_rad_not > tmp_rad){\n\t\t\t\t\t\t\tmin_rad_not = tmp_rad;\n\t\t\t\t\t\t\tmin_index_not = next;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(min_index_cut != -1 && min_index_not != -1 && fabs(min_rad_cut-min_rad_not) < EPS){\n\n\t\t\t\t\ttmp_next = min_index_cut;\n\t\t\t\t}else{\n\n\t\t\t\t\tif(min_rad_cut < min_rad_not){\n\n\t\t\t\t\t\ttmp_next = min_index_cut;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\ttmp_next = min_index_not;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\ttmp_next = (tmp_index+1)%work_P.size();\n\t\t\t}\n\n\t\t\tif(tmp_next == i)break;\n\n\t\t\tpre = tmp_index;\n\t\t\ttmp_index = tmp_next;\n\t\t}\n\n\t\tCOUNT++;\n\t\tret = max(ret,calc_S(work_poly));\n\t}\n\n\tif(COUNT == 0){\n\n\t\treturn BIG_NUM;\n\t}\n\n\treturn ret;\n}\n\n\nvoid func(){\n\n\tP.clear();\n\tnum_point = 0;\n\n\tlong double Vx,Vy;\n\tscanf(\"%Lf %Lf\",&Vx,&Vy);\n\n\tlong double SLOPE = calc_slope(Line(Point(0,0),Point(Vx,Vy)));\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%Lf %Lf\",&point[i].x,&point[i].y);\n\t\tnum_point++;\n\t}\n\tfor(int i = 0; i < N; i++){\n\n\t\tP.push_back(i);\n\t}\n\n\tvector<VALUE> V;\n\n\t//各点を通る、直線の切片またはX座標(傾きが垂直な場合)を求める\n\tfor(int i = 0; i < num_point; i++){\n\t\tif(fabs(SLOPE-DBL_MAX) < EPS){\n\n\t\t\tV.push_back(VALUE(point[i].x));\n\t\t}else{\n\n\n\t\t\tV.push_back(VALUE(point[i].y-SLOPE*point[i].x));\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end());\n\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\tlong double ans = BIG_NUM;\n\n\tfor(int i = 1; i < V.size(); i++){\n\n\t\tlong double L = V[i-1].value,R = V[i].value;\n\n\t\tfor(int loop = 0; loop < 100; loop++){\n\n\t\t\tlong double mid1 = (2.0*L+R)/3.0;\n\t\t\tlong double mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\t\tlong double S1 = calc_max_S(SLOPE,mid1);\n\t\t\tlong double S2 = calc_max_S(SLOPE,mid2);\n\n\t\t\tans = min(ans,min(S1,S2));\n\n\t\t\tif(S1 <= S2){\n\n\t\t\t\tR = mid2;\n\t\t\t}else{\n\n\t\t\t\tL = mid1;\n\t\t\t}\n\n\t\t\tif(fabs(R-L) < EPS2)break;\n\t\t}\n\t}\n\n\tprintf(\"%.10Lf\\n\",ans);\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":5020,"memory_kb":3376,"score_of_the_acc":-1.4256,"final_rank":19},{"submission_id":"aoj_2184_2209124","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e10L\n#define eps (1e-11L)\n#define Eps (1e-7L)\n#define mod 1000000007\n#define pi acos(-1.0)\n#define phi (1.0L+sqrtl(5.0L))/2.0L\n#define f first\n#define s second\n#define mp make_pair\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define pd(a) printf(\"%.10Lf\\n\",(ld)(a))\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\n#define equals(a,b) (fabs((a)-(b))<Eps)\nusing namespace std;\ntypedef long double ld;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> pii;\ntypedef pair<int,ld> pid;\ntypedef pair<ld,int> pdi;\ntypedef vector<int> vi;\ntypedef vector<pii> vpi;\n\nclass Point{\npublic:\n ld x,y;\n Point(ld x=0.0L,ld y=0.0L):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*(ld k){ return Point(x*k,y*k);}\n Point operator/(ld k){ return Point(x/k,y/k);}\n bool operator<(Point p)const{ \n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\n bool operator==(Point p)const{ \n return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\n\n ld abs(){ return sqrtl(norm());}\n ld norm(){ return (x*x+y*y);}\n};\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nclass Segment{\npublic:\n Point p1,p2;\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\n};\ntypedef Segment Line;\n\nld norm(Vector a){ return (a.x*a.x+a.y*a.y);}\nld abs(Vector a){ return sqrtl(norm(a));}\nld dot(Vector a,Vector b){ return (a.x*b.x+a.y*b.y);}\nld cross(Vector a,Vector b){ return (a.x*b.y-a.y*b.x);}\n\nPoint project(Segment s,Point p){\n Vector base=(s.p2-s.p1);\n ld r=(dot(p-s.p1,base)/base.norm());\n return (s.p1+base*r);\n}\n\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0L);\n}\n\nPoint getCrossPointLL(Line a,Line b){\n ld A=cross(a.p2-a.p1,b.p2-b.p1);\n ld B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\n}\n\nld getDistanceLP(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\nbool onLine(Line L,Point p){ return getDistanceLP(L,p)<eps; }\n\nint ccw(Point p0,Point p1,Point p2){\n Vector a=p1-p0;\n Vector b=p2-p0;\n if(!onLine(Line(p0,p1),p2))return (cross(a,b)>eps ? 1:-1);\n if(dot(a,b)<-eps)return 2;\n if(a.norm()<b.norm())return -2;\n return 0;\n}\n\nbool onSegment(Segment s,Point p){\n if(!onLine(s,p))return false;\n if(dot(s.p2-s.p1,p-s.p1)<-eps)return false;\n if(dot(s.p1-s.p2,p-s.p2)<-eps)return false;\n return true;\n}\n\nld getPolygonArea(Polygon p){\n ld area=0.0L;\n int n=p.size();\n for(int i=0;i<n;i++)area+=cross(p[i%n],p[(i+1)%n]);\n return area/2.0L;\n}\n\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n Segment s(g[i],g[(i+1)%n]);\n if(onSegment(s,p))return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\n}\n\nvector<Polygon> Polygon_cut(Polygon p,Line L){\n vector<Polygon> res;\n vector<vector<int> > g;\n vector<Point> v;\n int n=p.size();\n int ver[p.size()*2];\n fill(ver,ver+p.size()*2,-1);\n for(int i=0;i<n;i++){\n int j=(i+1)%n;\n if(ccw(L.p1,L.p2,p[i])!=-1){\n v.push_back(p[i]);\n ver[v.size()-1]=i;\n }\n Segment s(p[i],p[j]);\n if(isParallel(L,s))continue;\n Point m=getCrossPointLL(s,L);\n if(dot(s.p2-s.p1,m-s.p1)<eps || dot(s.p1-s.p2,m-s.p2)<eps)continue;\n v.push_back(m);\n }\n\n g.resize(v.size());\n bool onL[v.size()];\n fill(onL,onL+v.size(),false);\n FOR(i,0,v.size())onL[i]=onLine(L,v[i]);\n FOR(i,0,v.size()){\n int j=(i+1)%v.size();\n if(ver[i]+ver[j]==-2)continue;\n if(ver[i]!=-1 && ver[j]!=-1){\n if((ver[i]+1)%n!=ver[j])continue;\n if(onL[i] && onL[j] && dot(L.p2-L.p1,v[j]-v[i])<-eps)continue;\n }\n else if(onL[i] && onL[j])continue;\n g[i].push_back(j);\n }\n \n vector<pair<ld,int> > list;\n for(int i=0;i<v.size();i++)\n if(onLine(L,v[i]))\n list.push_back(make_pair(dot(L.p2-L.p1,v[i]-L.p1),i));\n sort(list.begin(),list.end());\n for(int i=1;i<list.size();i++){\n int a=list[i-1].s,b=list[i].s;\n if(contains(p,v[a]+(v[b]-v[a])/2.0L)==2)g[a].push_back(b);\n }\n\n reverse(list.begin(),list.end());\n bool used[v.size()];\n fill(used,used+v.size(),false);\n\n for(int i=0;i<list.size();i++){\n int s=list[i].s,a=-1;\n for(int j=0;j<g[s].size();j++){\n if(used[g[s][j]])continue;\n a=g[s][j];\n }\n if(a==-1)continue;\n Polygon P;\n\n while(1){\n P.push_back(v[a]);\n if(onL[a] && used[a])break;\n used[a]=true;\n if(a==s)break;\n int b=-1;\n for(int j=0;j<g[a].size();j++){\n b=g[a][j];\n if(onL[b])break;\n }\n if(b==-1){ P.clear();break; }\n a=b;\n }\n if(getPolygonArea(P)>eps)res.push_back(P);\n }\n \n return res;\n}\n\nint n;\nVector v,rv;\nPolygon p;\n\nld cal(Point a){\n ld res=-linf;\n vector<Polygon> vp;\n vp=Polygon_cut(p,Line(a,a+v));\n FOR(i,0,vp.size())res=max(res,getPolygonArea(vp[i]));\n vp=Polygon_cut(p,Line(a+v,a));\n FOR(i,0,vp.size())res=max(res,getPolygonArea(vp[i]));\n if(res==-linf)return linf;\n return res;\n}\n\nbool comp(Point a,Point b){ return dot(rv,a)<dot(rv,b); }\n\nld solve(){\n ld res=linf;\n vector<Point> vp;\n rv.x=-v.y;\n rv.y=v.x;\n FOR(i,0,n)vp.pb(project(Line(Point(),rv),p[i]));\n sort(all(vp),comp);\n FOR(i,1,n){\n Point a=vp[i-1],b=vp[i];\n Vector V=(b-a);\n if(abs(V)<Eps)continue;\n V=V/abs(V);\n ld L=0.0L,R=abs(b-a);\n FOR(k,0,50){\n ld m1=(L*phi+R)/(phi+1.0L);\n ld m2=(L+R*phi)/(phi+1.0L);\n ld res1=cal(a+V*m1);\n ld res2=cal(a+V*m2);\n if(res1<res2)R=m2;\n else L=m1;\n if(equals(L,R))break;\n }\n res=min(res,cal(a+V*L));\n } \n return res;\n}\n\nint main()\n{\n while(cin>>n && n){\n cin>>v.x>>v.y;\n p.resize(n);\n FOR(i,0,n)cin>>p[i].x>>p[i].y;\n pd(solve());\n }\n return 0;\n}","accuracy":1,"time_ms":7670,"memory_kb":3304,"score_of_the_acc":-1.7461,"final_rank":20},{"submission_id":"aoj_2184_1494307","code_snippet":"#include<cstdio>\n#include<complex>\n#include<cmath>\n#include<vector>\n#include<map>\n#include<set>\n#include<iostream>\n#include<cassert>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef double Real;\ntypedef complex<Real> Point;\ntypedef pair<Point,Point> Line;\ntypedef pair<Point,Point> Segment;\ntypedef vector<Point> Polygon;\n\nconst Real eps=1e-7;\nconst Real eps2=5e-7;\nconst Real PI=acos(-1.0);\nconst Point NPoint=Point(NAN,NAN);\nconst Real inf=1e9;\n\nint cnt=0;\n\ntemplate<class T> bool eq(T a, T b){\n\treturn abs(a-b)<eps;\n}\n\ntemplate<class T> int sgn(T a){\n\tif(eq(a,(T)0)) return 0;\n\tif(a>0) return 1;\n\treturn -1;\n}\n\nvoid print(Point p,char ch='\\n'){\n\tprintf(\"(%f %f)%c\",p.real(),p.imag(),ch);\n}\n\nvoid print(Polygon poly){\n\tprintf(\"----\\n\");\n\tfor(int i=0;i<poly.size();i++){\n\t\tprint(poly[i]);\n\t}\n\tprintf(\"----\\n\");\n}\n\nPolygon poly;\nPoint vec;\nvector<Real> xs;\n\nReal doP(Point a,Point b){\n\treturn (conj(a)*b).real();\n}\n\nReal crP(Point a,Point b){\n\treturn (conj(a)*b).imag();\n}\n\nbool onSeg(Point p,Point q,Point r){\n\treturn eq(abs(p-q),abs(p-r)+abs(r-q));\n}\n\nPoint toVec(Line l){\n\treturn l.second-l.first;\n}\n\nbool isPara_(Line l1,Line l2){\n\treturn eq(crP(toVec(l1),toVec(l2)),(Real)0);\n}\n\nReal getArea(Polygon poly){\n\tReal res=0;\n\tfor(int i=0;i+1<poly.size();i++){\n\t\tres+=crP(poly[i],poly[i+1])/2;\n\t}\n\tres=abs(res);\n\treturn res;\n}\n\nvoid rot(){\n\tPoint p=Point(0,1);\n\tvec/=abs(vec);\n\tPoint m=p/vec;\n\tfor(int i=0;i<poly.size();i++){\n\t\tpoly[i]*=m;\n\t}\n\tvector<Real> tmp;\n\tfor(int i=0;i+1<poly.size();i++){\n\t\tbool ok=true;\n\t\tfor(int j=0;j<tmp.size();j++){\n\t\t\tif(eq(tmp[j],poly[i].real())) ok=false;\n\t\t}\n\t\tif(ok) tmp.push_back(poly[i].real());\n\t}\n\tfor(int i=0;i<poly.size();i++){\n\t\tfor(int j=0;j<tmp.size();j++){\n\t\t\tif(eq(poly[i].real(),tmp[j])){\n\t\t\t\tpoly[i]=Point(tmp[j],poly[i].imag());\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\txs=tmp;\n\tsort(xs.begin(),xs.end());\n}\n\nPoint cmp_c;\nbool cmp_ang(const Point &p1,const Point &p2){\n\treturn arg(p1-cmp_c)<arg(p2-cmp_c);\n}\n\nstruct PLexCmp{\n\tbool operator()(const Point &p1,const Point &p2) const {\n\t\tif(p1.real()!=p2.real()) return p1.real()<p2.real();\n\t\treturn p1.imag()<p2.imag();\n\t}\n};\n\nstruct SegLexCmp{\n\tbool operator()(const Segment &s1,const Segment &s2) const {\n\t\tif(s1.first.real()!=s2.first.real()) return s1.first.real()<s2.first.real();\n\t\tif(s1.first.imag()!=s2.first.imag()) return s1.first.imag()<s2.first.imag();\n\t\tif(s1.second.real()!=s2.second.real()) return s1.second.real()<s2.second.real();\n\t\treturn s1.second.imag()<s2.second.imag();\n\t}\n};\n\nmap<Point,vector<Point>,PLexCmp> con_pts;\nvector<Real> ys;\nset<Segment,SegLexCmp> invalid_es;\n\nbool genConPts(Real x){\n\tmap<Point,vector<Point>,PLexCmp> emptyMap;\n\tswap(emptyMap,con_pts);\n\tys.clear();\n\tset<Segment,SegLexCmp> emptySet;\n\tswap(invalid_es,emptySet);\n\tfor(int i=0;i+1<poly.size();i++){\n\t\tPoint p=poly[i],q=poly[i+1];\n\t\tif(p.real()==x){\n\t\t\tys.push_back(p.imag());\n\t\t}\n\t//\tbool swapped=false;\n\t\tif(p.real()>q.real()){\n\t//\t\tswapped=true;\n\t\t\tswap(p,q);\n\t\t}\n\t\tif(q.real()<=x||p.real()>=x){\n\t\t\tcon_pts[p].push_back(q);\n\t\t\tcon_pts[q].push_back(p);\n\t\t\tinvalid_es.insert(Segment(poly[i+1],poly[i]));\n\t\t\tcontinue;\n\t\t}\n\t\tReal y=p.imag()+((q.imag()-p.imag())*(x-p.real())/(q.real()-p.real()));\n\t\tif(y==p.imag()){\n\t\t\tif(p.imag()>q.imag()) y+=eps;\n\t\t\telse y-=eps;\n\t\t}\n\t\tys.push_back(y);\n\t\tPoint r=Point(x,y);\n\t\tcon_pts[p].push_back(r);\n\t\tcon_pts[r].push_back(p);\n\t\tcon_pts[q].push_back(r);\n\t\tcon_pts[r].push_back(q);\n\t\tinvalid_es.insert(Segment(poly[i+1],r));\n\t\tinvalid_es.insert(Segment(r,poly[i]));\n\t}\n\tsort(ys.begin(),ys.end());\n\tint ln=ys.size();\n\tys.erase(unique(ys.begin(),ys.end()),ys.end());\n\tif(ln!=ys.size()) return false;\n\tfor(int i=0;i+1<ys.size();i++){\n\t\tPoint p=Point(x,ys[i]);\n\t\tPoint q=Point(x,ys[i+1]);\n\t\tcon_pts[p].push_back(q);\n\t\tcon_pts[q].push_back(p);\n\t}\n\tmap<Point,vector<Point>,PLexCmp> :: iterator it=con_pts.begin();\n\tfor(;it!=con_pts.end();it++){\n\t\tvector<Point> &vec=it->second;\n\t\tcmp_c=it->first;\n\t\tsort(vec.begin(),vec.end(),cmp_ang);\n\t\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\n\t/*\tvector<Point> vec2;\n\t\tfor(int i=0;i<vec.size();i++){\n\t\t\tif(i==0||(vec[i].real()!=vec[i-1].real()||vec[i].imag()!=vec[i-1].imag())){\n\t\t\t\tvec2.push_back(vec[i]);\n\t\t\t}\n\t\t}\n\t\tvec=vec2;*/\n\t}\n\tfor(it=con_pts.begin();it!=con_pts.end();it++){\n\t\tfor(int i=0;i<(it->second).size();i++){\n\t\t\tPoint p=(it->second)[i];\n\t\t\tassert(con_pts.find(p)!=con_pts.end());\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid stroke(vector<Point> &vec,Point cur,Point prv,Point ini){\n\tvector<Point> pts=con_pts[cur];\n\tcmp_c=cur;\n\tint id=distance(pts.begin(),lower_bound(pts.begin(),pts.end(),prv,cmp_ang));\n\tassert(prv==pts[id]);\n\tid--;\n\tif(id==-1) id=pts.size()-1;\n\tassert(0<=id&&id<pts.size());\n\tPoint nxt=pts[id];\n\tvec.push_back(nxt);\n\tif(nxt==ini) return;\n\tstroke(vec,nxt,cur,ini);\n}\n\nint whichSide(Polygon poly,Real x){\n\tbool le=false,ri=false;\n\tfor(int i=0;i<poly.size();i++){\n\t\tif(poly[i].real()<x) le=true;\n\t\tif(poly[i].real()>x) ri=true;\n\t}\n\tif(le&&ri) return 0;\n\telse if(le) return -1;\n\telse if(ri) return 1;\n\tprintf(\"error whichSide\\n\");\n\tprintf(\"%f\\n\",x);\n\tprint(poly);\n\tfor(int i=0;i<ys.size();i++){\n\t\tprintf(\"%f\\n\",ys[i]);\n\t}\n\tvector<Point> vec=con_pts[poly[0]];\n\tprint(poly[0]);\n\tfor(int i=0;i<vec.size();i++){\n\t\tprintf(\"-\");\n\t\tprint(vec[i]);\n\t}\n\tprintf(\"\\n\\n\\n\");\n\tmap<Point,vector<Point>,PLexCmp> ::iterator it=con_pts.begin();\n\tfor(;it!=con_pts.end();it++){\n\t\tprint(it->first);\n\t\tfor(int i=0;i<(it->second).size();i++){\n\t\t\tprintf(\"-\");\n\t\t\tprint((it->second)[i]);\n\t\t}\n\t}\n\texit(0);\n}\n\nbool isValid_(Polygon poly){\n\tfor(int i=0;i+1<poly.size();i++){\n\t\tSegment seg=Segment(poly[i],poly[i+1]);\n\t\tif(invalid_es.find(seg)!=invalid_es.end()) return false;\n\t}\n\treturn true;\n}\n\npair<Real,Real> calcArea(Real x){\n\tReal le=0,ri=0;\n\tbool flg=genConPts(x);\n\tif(flg==false){\n\t\treturn make_pair(inf,inf);\n\t}\n\tif(ys.size()<=1){\n\t\treturn make_pair(inf,inf);\n\t}/*\n\tfor(map<Point,vector<Point>,PLexCmp>::iterator it=con_pts.begin();it!=con_pts.end();it++){\n\t\tprint(it->first,':');\n\t\tvector<Point> vec=it->second;\n\t\tfor(int i=0;i<vec.size();i++){\n\t\t\tprint(vec[i]);\n\t\t}\n\t}*/\n\tfor(int i=0;i+1<ys.size();i++){\n\t\tPoint p=Point(x,ys[i]);\n\t\tPoint q=Point(x,ys[i+1]);\n\t\tvector<Point> poly;\n\t\tstroke(poly,p,q,p);\n\t\tpoly.push_back(poly[0]);\n\t\t//bool flg=isRight(poly,x);\n\t\tint side=whichSide(poly,x);\n\t\tReal area=getArea(poly);/*\n\t\tif(flg) ri=max(ri,area);\n\t\telse {}//le=max(le,area);*/\n\t\tbool flg=isValid_(poly);\n\t\tif(side==1&&flg) ri=max(ri,area);\n\t\t//print(poly);\n\t\t\n\t\tpoly.clear();\n\t\tstroke(poly,q,p,q);\n\t\tpoly.push_back(poly[0]);\n\t\t//print(poly);\n\t\t//flg=isRight(poly,x);\n\t\tside=whichSide(poly,x);\n\t\tarea=getArea(poly);/*\n\t\tif(flg) {}//ri=max(ri,area);\n\t\telse le=max(le,area);*/\n\t\tflg=isValid_(poly);\n\t\tif(side==-1&&flg) le=max(le,area);\n\t}\n\treturn make_pair(le,ri);\n}\n\nReal calcEdgeCase(){\n\tReal res=getArea(poly);\n\tfor(int i=1;i+1<xs.size();i++){\n\t\tpair<Real,Real> p=calcArea(xs[i]);\n\t//\tprintf(\"%f %f %f\\n\",xs[i],p.first,p.second);\n\t\tres=min(res,max(p.first,p.second));\n\t}\n\treturn res;\n}\n\nReal calc(Real lb,Real ub,Real cur_best){\n\tReal res=inf;\n\tpair<Real,Real> p1,p2;\n\tp1=calcArea(lb);\n\tp2=calcArea(ub);\n//\tprintf(\"a%f %f %f\\n\",lb,ub,cur_best);\n\tif(lb>ub) return cur_best;\n\t//if(max(p1.first,p1.second)>cur_best||max(p2.first,p2.second)>cur_best) return cur_best;\n\tif(p1.first>p1.second) return min(cur_best,p1.first);\n\tif(p2.first<p2.second) return min(cur_best,p2.second);\n\tfor(int stage=0;stage<100;stage++){\n\t\tReal mid=(ub+lb)/2;\n\t\tpair<Real,Real> p=calcArea(mid);\n\t\tif(p.first>0&&p.second>0){\n\t\t\tres=min(res,max(p.first,p.second));\n\t\t}\n\t\tif(p.first==0||p.second==0){\n\t\t\tif(stage<50){\n\t\t\t\tReal tmp=cur_best;\n\t\t\t\tReal a=calc(lb+eps,mid-eps,tmp);\n\t\t\t\ttmp=min(tmp,a);\n\t\t\t\ta=calc(mid+eps,ub-eps,tmp);\n\t\t\t\ttmp=min(tmp,a);\n\t\t\t\treturn tmp;\n\t\t\t}\n\t\t}\n\t//\tprintf(\"%f %f %f\\n\",mid,p.first,p.second);\n\t\tif(p.first<p.second){\n\t\t\tlb=mid;\n\t\t}else{\n\t\t\tub=mid;\n\t\t}\n\t}\n\treturn res;\n}\n\nReal solve(){\n\trot();\n\tReal res=calcEdgeCase();\n\t//printf(\"edge case best = %f\\n\",res);\n/*\tfor(int i=0;i+1<xs.size();i++){\n\t\tReal lb=xs[i]+eps2,ub=xs[i+1]-eps2;\n\t\tReal tmp=calc(lb,ub,res);\n\t\tres=min(res,tmp);\n\t}*/\n\tReal l=inf,r=-inf;\n\tvector<Real> xs;\n\tfor(int i=0;i+1<poly.size();i++){\n\t\tl=min(l,poly[i].real());\n\t\tr=max(r,poly[i].real());\n\t\tPoint p=poly[i],q=poly[i+1],r=poly[i+2>=poly.size()?0:i+2];\n\t\tif(crP(p-q,r-q)>0){\n\t\t\tif(p.real()==q.real()||q.real()==r.real()) continue;\n\t\t\tif(p.real()<q.real()!=q.real()<r.real()){\n\t\t\t\txs.push_back(q.real());\n\t\t\t}\n\t\t}\n\t}\n\txs.push_back(l);\n\txs.push_back(r);\n\tsort(xs.begin(),xs.end());\n\tfor(int i=0;i+1<xs.size();i++){\n\t\tReal lb=xs[i]+eps2,ub=xs[i+1]-eps2;\n\t\tReal tmp=calc(lb,ub,res);\n\t\tres=min(res,tmp);\n\t}\n\treturn res;\n}\n\nvoid init(){\n\tpoly.clear();\n\txs.clear();\n\tys.clear();\n\tmap<Point,vector<Point>,PLexCmp> tmp;\n\tswap(con_pts,tmp);\n}\n\nvoid input(){\n\tint N;\n\tscanf(\"%d\",&N);\n\tif(N==0) exit(0);\n\tint x,y;\n\tscanf(\"%d%d\",&x,&y);\n\tvec=Point(x,y);\n\tfor(int i=0;i<N;i++){\n\t\tint x,y;\n\t\tscanf(\"%d%d\",&x,&y);\n\t\tpoly.push_back(Point(x,y));\n\t}\n\tpoly.push_back(poly[0]);\n\tcnt++;\n}\n\nint main(){\n\twhile(true){\n\t\tinit();\n\t\tinput();\n\t\tReal ans=solve();\n\t\tprintf(\"%f\\n\",ans);\n//\t\tcout<<ans<<\"\\n\";\n//\t\tbreak;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1470,"memory_kb":1496,"score_of_the_acc":-0.2992,"final_rank":3},{"submission_id":"aoj_2184_1428469","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<math.h>\nusing namespace std;\nconst long double EPS = 1e-15;\nconst long double INF = 1e+10;\nconst long double PI = acos(-1);\nint sig(long double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\ninline long double ABS(long double a){return max(a,-a);}\nstruct Pt {\n\tlong double x, y;\n\tPt() {}\n\tPt(long double x, long double y) : x(x), y(y) {}\n\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\n\tPt operator-() const { return Pt(-x, -y); }\n\tPt operator*(const long double &k) const { return Pt(x * k, y * k); }\n\tPt operator/(const long double &k) const { return Pt(x / k, y / k); }\n\tlong double ABS() const { return sqrt(x * x + y * y); }\n\tlong double abs2() const { return x * x + y * y; }\n\tlong double arg() const { return atan2(y, x); }\n\tlong double dot(const Pt &a) const { return x * a.x + y * a.y; }\n\tlong double det(const Pt &a) const { return x * a.y - y * a.x; }\n};\nlong double tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\nint iSP(Pt a, Pt b, Pt c) {\n\tint s = sig((b - a).det(c - a));\n\tif (s) return s;\n\tif (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b\n\tif (sig((a - b).dot(c - b)) < 0) return +2; // a-b-c\n\treturn 0;\n}\nint iLL(Pt a, Pt b, Pt c, Pt d) {\n\tif (sig((b - a).det(d - c))) return 1; // intersect\n\tif (sig((b - a).det(c - a))) return 0; // parallel\n\treturn -1; // correspond\n}\nbool iLS(Pt a, Pt b, Pt c, Pt d) {\n\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) <= 0);\n}\nbool iSS(Pt a, Pt b, Pt c, Pt d) {\n\treturn (iSP(a, b, c) * iSP(a, b, d) <= 0 && iSP(c, d, a) * iSP(c, d, b) <= 0);\n}\nbool iSSstrict(Pt a, Pt b, Pt c, Pt d) {\n\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) < 0 && sig(tri(c, d, a)) * sig(tri(c, d, b)) < 0);\n}\nPt pLL(Pt a, Pt b, Pt c, Pt d) {\n\tb = b - a; d = d - c; return a + b * (c - a).det(d) / b.det(d);\n}\n\n\nPt p[110];\nPt v;\nint n;\nlong double z[110];\npair<long double,int>ev[110];\nint vis[110];\nint to[110];\nlong double tx[110];\nlong double fx[110];\n\nlong double calc2(long double y,int d){\n\tlong double ret=0;\n\tint now=0;\n\tint sz=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(iLS(Pt(0,y),Pt(1,y),p[i],p[i+1])){\n\t\t\tev[sz++]=make_pair(pLL(Pt(0,y),Pt(1,y),p[i],p[i+1]).x,i);\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++)to[i]=-1;\n\tstd::sort(ev,ev+sz);\n\t//printf(\"%d\\n\",sz);\n\tfor(int i=0;i<sz;i++){\n\t\tto[ev[i].second]=ev[i^1].second;\n\t\ttx[ev[i].second]=ev[i^1].first;\n\t\tfx[ev[i].second]=ev[i].first;\n\t}\n\tfor(int i=0;i<n;i++)vis[i]=0;\n\tfor(int i=0;i<n;i++){\n\t\tif(vis[i])continue;\n\t\tif(d==0&&p[i].y>y)continue;\n\t\tif(d==1&&p[i].y<y)continue;\n\t\tlong double val=0;\n\t\tint at=i;\n\t\tPt pos=p[i];\n\t\tbool fl=true;\n\t\twhile(1){\n\t\t\tif(fl)vis[at]=1;\n\t\t\tif(fl&&~to[at]){\n\t\t\t\tfl=false;\n\t\t\t\tval+=pos.det(Pt(fx[at],y));\n\t\t\t\tval+=(Pt(fx[at],y)).det(Pt(Pt(tx[at],y)));\n\t\t\t\tpos=Pt(tx[at],y);\n\t\t\t\tat=to[at];\n\t\t\t}else{\n\t\t\t\tfl=true;\n\t\t\t\tval+=pos.det(p[at+1]);\n\t\t\t\tat=(at+1)%n;\n\t\t\t\tpos=p[at];\n\t\t\t}\n\t\t\tif(fl&&vis[at])break;\n\t\t}\n\t\tif(val<0)val=-val;\n//\t\tif(val<0)printf(\"%Lf\\n\",val);\n\t\tret=max(ret,val/2);\n\t}\n\t//if(ret<1)printf(\"%Lf %d: %Lf\\n\",y,d,ret);\n\treturn ret;\n}\nlong double calc(long double y){\n\treturn max(calc2(y-EPS*10000,0),calc2(y+EPS*10000,1));\n}\nint main(){\n\tint a;\n\twhile(scanf(\"%d\",&a),a){\n\t\tn=a;\n\t\tfor(int i=0;i<110;i++)p[i]=Pt(0,0);\n\t\tv=Pt(0,0);\n\t\tlong double X,Y;\n\t\tscanf(\"%Lf%Lf\",&X,&Y);\n\t\tv=Pt(X,Y);\n\t\tlong double th=v.arg();\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%Lf%Lf\",&X,&Y);\n\t\t\tp[i]=Pt(X,Y);\n\t\t\tp[i]=p[i]*Pt(cos(th),-sin(th));\n\t\t\tz[i]=p[i].y;\n\t\t//\tprintf(\"%Lf %Lf\\n\",p[i].x,p[i].y);\n\t\t}\n\t\t\n\t\tp[a]=p[0];\n\t\tstd::sort(z,z+a);\n\t\tlong double ret=999999999;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(i==0||sig(z[i]-z[i-1])==0)continue;\n\t\t\tret=min(ret,calc(z[i]));\n\n\t\t\tlong double left=z[i-1];\n\t\t\tlong double right=z[i];\n\t\t\tfor(int j=0;j<100;j++){\n\t\t\t\tlong double M1=calc((left*2+right)/3);\n\t\t\t\tlong double M2=calc((left+right*2)/3);\n\t\t\t\tret=min(ret,min(M1,M2));\n\t\t\t\tif(M1>M2)left=(left*2+right)/3;\n\t\t\t\telse right=(right*2+left)/3;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.12Lf\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":1320,"memory_kb":1188,"score_of_the_acc":-0.171,"final_rank":1},{"submission_id":"aoj_2184_1161283","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <assert.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nnamespace geom{\n#define X real()\n#define Y imag()\n#define at(i) ((*this)[i])\n#define SELF (*this)\n\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\n\ttypedef int BOOL;\n\ttypedef long double R;\n\tconst R INF = 1e8;\n\tR EPS = 1e-15;\n\tconst R PI = 3.1415926535897932384626;\n\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\n\ttypedef complex<R> P;\n\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\n\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\n\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\n\tinline P unit(const P& p){return p/abs(p);}\n\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\n\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\n\t\tint res = sig(outp(t-s, p-s));\n\t\tif(res || !adv) return res;\n\t\tif(sig(inp(t-s, p-s)) < 0) return -2;\t// p-s-t\n\t\tif(sig(inp(s-t, p-t)) < 0) return 2;\t// s-t-p\n\t\treturn 0;\t\t\t\t\t\t\t\t// s-p-t\n\t}\n\t\n\t\n\tstruct L : public vector<P>{\t// line\n\t\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\n\t\tL(){}\n\t\tP dir()const {return at(1) - at(0);}\n\t\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\n\t};\n\tstruct S : public L{\t// segment\n\t\tS(const P &p1, const P &p2):L(p1, p2){}\n\t\tS(){}\n\t\tBOOL online(const P &p)const {\n\t\t\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\n\t\t\t// 座標の二乗とEPSの差が大きすぎないように注意\n\t\t\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\n\t\t\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\n\t\t}\n\t};\n\tP crosspoint(const L &l, const L &m);\n\tstruct G : public vector<P>{\n\t\tG(size_type size=0):vector(size){}\n\t\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\n\t\tBOOL contains(const P &p)const {\n\t\t\tR sum = .0;\n\t\t\tREP(i, size()){\n\t\t\t\tif(S(at(i), at((i+1)%size())).online(p)) return BORDER;\t// online\n\t\t\t\tsum += arg((at(i) - p) / (at((i+1)%size()) - p));\n\t\t\t}\n\t\t\treturn !!sig(sum);\n\t\t}\n\t\tR area()const {\n\t\t\tR sum = 0;\n\t\t\tREP(i, size()) sum += outp(at(i), at((i+1)%size()));\n\t\t\treturn abs(sum / 2.);\n\t\t}\n\t};\n\n\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\n\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\n\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\n\tBOOL intersect(const S &s, const S &t){\n\t\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\n\t\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\n\t\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\n\t}\n\tBOOL intersect(const S &s, const L &l){\n\t\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\n\t\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\n\t}\n\tinline P crosspoint(const L &l, const L &m){\n\t\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\n\t\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\n\t\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n\t\treturn m[0] + B / A * (m[1] - m[0]);\n\t}\n\tstruct DualGraph{\n\t\tstruct DEdge{\n\t\t\tint u, v, f, l;\n\t\t\tR a;\n\t\t\tDEdge(int u, int v, R a):u(u),v(v),f(0),l(0){\n\t\t\t\twhile(PI < a) a -= 2*PI;\n\t\t\t\twhile(a < -PI) a += 2*PI;\n\t\t\t\tthis->a = a;\n\t\t\t}\n\t\t\tbool operator==(const DEdge &opp) const{\n\t\t\t\treturn v==opp.v;\n\t\t\t}\n\t\t\tbool operator<(const DEdge &opp) const{\n\t\t\t\treturn a>opp.a;\n\t\t\t}\n\t\t\tbool operator<(const R &opp) const{\n\t\t\t\treturn a>opp;\n\t\t\t}\n\t\t\tfriend ostream& operator<<(ostream &os, const DEdge &t) { return os<<\"(\"<<t.u<<\",\"<<t.v<<\",\"<<t.a*180/PI<<\")\";}\n\t\t};\n\t\t\n\t\tint n;\n\t\tvector<P> p;\n\t\tvector<vector<DEdge>> g;\n\t\tDualGraph(const vector<P> &p):p(p),g(p.size()),n(p.size()){}\n\t\tvoid add_edge(const int s, const int t){\n\t\t\tR a = arg(p[t]-p[s]);\n\t\t\tg[s].emplace_back(s, t, a);\n\t\t\tg[t].emplace_back(t, s, a > 0 ? a-PI : a+PI);\n\t\t}\n\t\tvector<G> poly;\n\t\t\n\t\tvoid add_polygon(int s, int t, R a){\n\t\t\tauto e = lower_bound(ALL(g[s]), a-EPS);\n\t\t\tif(e == g[s].end()) e = g[s].begin();\n\t\t\tif(e->f) return;\n\t\t\te->f = 1;\n\t\t\te->l = t;\n\t\t\tpoly[t].push_back(p[s]);\n\t\t\tadd_polygon(e->v, t, e->a > 0 ? e->a-PI : e->a+PI);\n\t\t}\n\t\t\n\t\tvector<G>& dual(){\n\t\t\tREP(i, n){\n\t\t\t\tsort(ALL(g[i]));\n\t\t\t\tUNIQUE(g[i]);\n\t\t\t}\n\t\t\tint s = min_element(ALL(p)) - p.begin();\n\t\t\tpoly.emplace_back();\n\t\t\tadd_polygon(s, poly.size()-1, -PI*(R).5);\n\t\t\tREP(i, n)REP(j, g[i].size())if(!g[i][j].f){\n\t\t\t\tpoly.emplace_back();\n\t\t\t\tadd_polygon(i, poly.size()-1, g[i][j].a+2.*EPS);\n\t\t\t}\n\t\t\treturn poly;\n\t\t}\n\t};\n\ttemplate<class Func> R simpson(R s, R t, Func func){\n\t\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\n\t}\n\n#undef SELF\n#undef at\n}\n\nusing namespace geom;\n\nint f = 0;\nnamespace std{\n\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\n\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\n\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\n\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\n}\n\nint n;\nG g;\nR minarea(R x, int f = 0){\n\tvector<P> p = g;\n\tL xl(P(x, 0), P(x, 1));\n\tvector<pair<P, int>> ip;\n\tvector<pii> segs;\n\tREP(i, n){\n\t\tconst S &s = g.edge(i);\n\t\tif(sig(s.dir().X) && intersect(s, xl)){\n\t\t\tP cp = crosspoint(s, xl);\n\t\t\tif(!sig(norm(cp-s[0]))) ip.emplace_back(s[0], i);\n\t\t\telse if(!sig(norm(cp-s[1]))) ip.emplace_back(s[1], (i+1)%n);\n\t\t\telse{\n\t\t\t\tsegs.emplace_back(i, p.size());\n\t\t\t\tsegs.emplace_back(p.size(), (i+1)%n);\n\t\t\t\tip.emplace_back(cp, p.size());\n\t\t\t\tp.push_back(cp);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tsegs.emplace_back(i, (i+1)%n);\n\t}\n\tsort(ALL(ip));\n\tREP(i, (int)ip.size()-1){\n\t\tif(ip[i].second != ip[i+1].second && g.contains((ip[i].first + ip[i+1].first) * (R).5))\n\t\t\tsegs.emplace_back(ip[i].second, ip[i+1].second);\n\t}\n\tDualGraph dg(p);\n\tFOR(it, segs) dg.add_edge(it->first, it->second);\n\tconst vector<G> &poly = dg.dual();\n\tR ans = .0;\n\tREPS(i, (int)poly.size()-1) ans = max(ans, poly[i].area());\n\treturn ans;\n}\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\twhile(cin >> n, n){\n\t\tP v;\n\t\tg.resize(n);\n\t\tcin >> v; v = unit(v);\n\t\tvector<R> x;\n\t\tREP(i, n){\n\t\t\tcin >> g[i];\n\t\t\tg[i] *= P(0, 1) / v;\n\t\t\tx.push_back(g[i].X);\n\t\t}\n\t\tsort(ALL(x)); UNIQUE(x);\n\t\tR ans = INF, ansx = .0;\n\t\tREP(i, (int)x.size() - 1){\n\t\t\tans = min(ans, minarea(x[i]));\n\t\t\tif(minarea(x[i]) < minarea(x[i]+1e-5) || minarea(x[i+1]) < minarea(x[i+1]-1e-5)) continue;\n\t\t\tR l = x[i], r = x[i+1];\n\t\t\twhile(r-l > 1e-6){\n\t\t\t\tR ml = minarea((2*l+r)/3);\n\t\t\t\tR mr = minarea((l+2*r)/3);\n\t\t\t\tans = min(ans, ml);\n\t\t\t\tans = min(ans, mr);\n\t\t\t\tif(ml < mr) r = (l+2*r)/3;\n\t\t\t\telse l = (2*l+r)/3;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.10f\\n\", (double)ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1290,"memory_kb":1420,"score_of_the_acc":-0.2489,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2184_9824183\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n};\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4020,\n \"score_of_the_acc\": -0.9986,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2184_9824179\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n};\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -0.9647,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2184_9824174\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n};\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.9619,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2184_9824172\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n};\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//if (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.9661,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2184_9824166\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n};\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.9774,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2184_9824164\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\t//if ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.969,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2184_9824126\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.9365,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2184_9824123\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 10 || H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.969,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2184_9824122\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() < 10) TOL = 1e-7;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3848,\n \"score_of_the_acc\": -0.9379,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2184_9824119\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 5) TOL = 1e-7;\\n\\telse if (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() < 10) TOL = 1e-8;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4024,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2184_9824118\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 5) TOL = 1e-7;\\n\\telse if (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() <= 8) TOL = 1e-8;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -0.9845,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2184_9824115\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 5) TOL = 1e-7;\\n\\telse if (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() == 8) TOL = 1e-8;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -0.9746,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2184_9824106\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\tint s = 0, e = Y.size() - 1, m = 0;\\n\\twhile (s < e) {\\n\\t\\tm = (s + e) >> 1;\\n\\t\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t\\telse e = m;\\n\\t}\\n\\treturn s;\\n\\t//for (int i = 0; i < Y.size(); i++) {\\n\\t//\\tif (i == 0 && y < Y[i]) return i;\\n\\t//\\tif (eq(Y[i], y)) return i;\\n\\t//\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t//}\\n\\t//return Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 5) TOL = 1e-7;\\n\\telse if (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() == 8) TOL = 1e-8;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4024,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2184_9824105\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\ntypedef long long ll;\\n//typedef long double ld;\\ntypedef double ld;\\ntypedef std::vector<int> Vint;\\ntypedef std::vector<ld> Vld;\\ntypedef std::vector<bool> Vbool;\\nconst ld INF = 1e17;\\nld TOL = 1e-15;\\nconst ld PI = acos(-1);\\nconst int LEN = 105;\\ninline int sign(const ld& x) { return x < -TOL ? -1 : x > TOL; }\\ninline bool zero(const ld& x) { return !sign(x); }\\ninline bool eq(const ld& u, const ld& v) { return zero(u - v); }\\ninline bool between(ld s, ld e, const ld& x) { if (e < s) std::swap(s, e); return sign(x - s) > 0 && sign(e - x) > 0; }\\ninline ld sq(ld x) { return (ld)x * x; }\\ninline ld norm(ld th) {\\n\\twhile (th < 0) th += 2 * PI;\\n\\twhile (sign(th - 2 * PI) >= 0) th -= 2 * PI;\\n\\treturn th;\\n}\\nint find_y(const Vld& Y, const ld& y) {\\n\\t//int s = 0, e = Y.size() - 1, m = 0;\\n\\t//while (s < e) {\\n\\t//\\tm = (s + e) >> 1;\\n\\t//\\tif (sign(y - Y[m]) > 0) s = m + 1;\\n\\t//\\telse e = m;\\n\\t//}\\n\\t//return s;\\n\\tfor (int i = 0; i < Y.size(); i++) {\\n\\t\\tif (i == 0 && y < Y[i]) return i;\\n\\t\\tif (eq(Y[i], y)) return i;\\n\\t\\telse if (between(Y[i], Y[i + 1], y)) return i + 1;\\n\\t}\\n\\treturn Y.size();\\n}\\n\\n#define RIGHT 1\\n#define LEFT 2\\n\\nint N;\\nstruct Pos {\\n\\tld x, y;\\n\\tPos(ld X = 0, ld Y = 0) : x(X), y(Y) {}\\n\\tbool operator == (const Pos& p) const { return zero(x - p.x) && zero(y - p.y); }\\n\\tbool operator != (const Pos& p) const { return !zero(x - p.x) || !zero(y - p.y); }\\n\\tbool operator < (const Pos& p) const { return zero(x - p.x) ? y < p.y : x < p.x; }\\n\\tbool operator <= (const Pos& p) const { return *this < p || *this == p; }\\n\\tPos operator + (const Pos& p) const { return { x + p.x, y + p.y }; }\\n\\tPos operator - (const Pos& p) const { return { x - p.x, y - p.y }; }\\n\\tPos operator * (const ld& scalar) const { return { x * scalar, y * scalar }; }\\n\\tPos operator / (const ld& scalar) const { return { x / scalar, y / scalar }; }\\n\\tld operator * (const Pos& p) const { return x * p.x + y * p.y; }\\n\\tld operator / (const Pos& p) const { return x * p.y - y * p.x; }\\n\\tPos operator ^ (const Pos& p) const { return { x * p.x, y * p.y }; }\\n\\tPos& operator += (const Pos& p) { x += p.x; y += p.y; return *this; }\\n\\tPos& operator -= (const Pos& p) { x -= p.x; y -= p.y; return *this; }\\n\\tPos& operator *= (const ld& scale) { x *= scale; y *= scale; return *this; }\\n\\tPos& operator /= (const ld& scale) { x /= scale; y /= scale; return *this; }\\n\\tPos operator - () const { return { -x, -y }; }\\n\\tPos operator ~ () const { return { -y, x }; }\\n\\tPos operator ! () const { return { y, x }; }\\n\\tld xy() const { return x * y; }\\n\\tPos rot(ld the) const { return { x * (ld)cosl(the) - y * (ld)sinl(the), x * (ld)sinl(the) + y * (ld)cosl(the) }; }\\n\\tld Euc() const { return x * x + y * y; }\\n\\tld mag() const { return sqrtl(Euc()); }\\n\\tPos unit() const { return *this / mag(); }\\n\\tld rad() const { return norm(atan2l(y, x)); }\\n\\tfriend ld rad(const Pos& p1, const Pos& p2) { return atan2l(p1 / p2, p1 * p2); }\\n\\tint quad() const { return sign(y) == 1 || (sign(y) == 0 && sign(x) >= 0); }\\n\\tfriend bool cmpq(const Pos& a, const Pos& b) { return (a.quad() != b.quad()) ? a.quad() < b.quad() : a / b > 0; }\\n\\tbool close(const Pos& p) const { return zero((*this - p).Euc()); }\\n\\tfriend std::istream& operator >> (std::istream& is, Pos& p) { is >> p.x >> p.y; return is; }\\n\\tfriend std::ostream& operator << (std::ostream& os, const Pos& p) { os << p.x << \\\" \\\" << p.y; return os; }\\n}; const Pos O = { 0, 0 };\\ntypedef std::vector<Pos> Polygon;\\nPolygon R[LEN], L[LEN];\\nint rt, lt;\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) / (d3 - d2); }\\nld cross(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) / (d4 - d3); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3) { return sign(cross(d1, d2, d3)); }\\nint ccw(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return sign(cross(d1, d2, d3, d4)); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3) { return (d2 - d1) * (d3 - d2); }\\nld dot(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return (d2 - d1) * (d4 - d3); }\\nbool on_seg_strong(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d3, d2)) >= 0; }\\nbool on_seg_weak(const Pos& d1, const Pos& d2, const Pos& d3) { return !ccw(d1, d2, d3) && sign(dot(d1, d2, d3)) > 0; }\\nbool collinear(const Pos& d1, const Pos& d2, const Pos& d3, const Pos& d4) { return !ccw(d1, d2, d3) && !ccw(d1, d2, d4); }\\nPos intersection(const Pos& p1, const Pos& p2, const Pos& q1, const Pos& q2) { ld a1 = cross(q1, q2, p1), a2 = -cross(q1, q2, p2); return (p1 * a2 + p2 * a1) / (a1 + a2); }\\nld green(const Pos& s, const Pos& e) { Pos m = (s + e) * .5; return m.y * (s.x - e.x); }\\nld area(const Polygon& H) {\\n\\tld a = 0;\\n\\tint sz = H.size();\\n\\tfor (int i = 0; i < sz; i++) a += H[i] / H[(i + 1) % sz];\\n\\treturn a;\\n}\\nld largest(Polygon H, const ld& x) {\\n\\tPos s = Pos(x, -1), e = Pos(x, 1);\\n\\tld ret = 0;\\n\\tint i, sz = H.size();\\n\\tfor (i = 0; i < sz; i++) if (eq(H[i].x, x) || between(H[i].x, H[(i + 1) % sz].x, x)) break;\\n\\trt = lt = 0;\\n\\tPolygon tmp;\\n\\tbool f = 1;\\n\\tint rl = LEFT;\\n\\tif (!eq(H[i].x, x)) {\\n\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\telse if (eq(H[i].x, x)) {\\n\\t\\tif (eq(H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ti = (i + 1) % sz;\\n\\t\\t}\\n\\t\\ttmp.push_back(H[i]);\\n\\t\\ti = (i + 1) % sz;\\n\\t}\\n\\tfor (int _ = 0; _ < sz; _++, i = (i + 1) % sz) {\\n\\t\\tif (eq(H[i].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\tif (eq(H[(i + 1) % sz].x, x)) _++, i = (i + 1) % sz;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t}\\n\\t\\telse if (between(H[i].x, H[(i + 1) % sz].x, x)) {\\n\\t\\t\\ttmp.push_back(H[i]);\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t\\tif (tmp[1].x < x) L[lt++] = tmp;\\n\\t\\t\\telse if (tmp[1].x > x) R[rt++] = tmp;\\n\\t\\t\\ttmp.clear();\\n\\t\\t\\ttmp.push_back(intersection(s, e, H[i], H[(i + 1) % sz]));\\n\\t\\t}\\n\\t\\telse tmp.push_back(H[i]);\\n\\t}\\n\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"x:: \\\" << x << \\\"\\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << j << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : R[j]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\n\\tVld F, A, Y;\\n\\tVint I;\\n\\tI.resize(lt);\\n\\tfor (int j = 0; j < lt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = L[p];\\n\\t\\tconst Polygon& Q = L[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(lt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(L[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(L[i][0].y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"L:: \\\\n\\\";\\n\\t//for (int j = 0; j < lt; j++) {\\n\\t//\\tstd::cout << \\\"L[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\tfor (int j = 0; j < lt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld h = L[i][0].y;\\n\\t\\tld a = A[i];\\n\\t\\tint yi = find_y(Y, L[i].back().y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\" << lt << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << h << \\\" \\\" << y << \\\" \\\" << Y[yi] << \\\"\\\\n\\\";\\n\\t\\t\\t//std::cout << \\\"FUCK:: L \\\\n\\\";\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < lt && !eq(y, L[I[k]][0].y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\t//if (A[I[k]] > 0) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, L[I[k]].back().y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tY.clear();\\n\\tI.resize(rt);\\n\\tfor (int j = 0; j < rt; j++) I[j] = j;\\n\\tstd::sort(I.begin(), I.end(), [&](const int& p, const int& q) -> bool {\\n\\t\\tconst Polygon& P = R[p];\\n\\t\\tconst Polygon& Q = R[q];\\n\\t\\tld py = P[0].y < P.back().y ? P[0].y : P.back().y;\\n\\t\\tld qy = Q[0].y < Q.back().y ? Q[0].y : Q.back().y;\\n\\t\\treturn py < qy;\\n\\t\\t});\\n\\tA.resize(rt, 0);\\n\\tf = 1;\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tA[i] = area(R[i]);\\n\\t\\tif (A[i] < 0) f = 0;\\n\\t\\tY.push_back(R[i].back().y);\\n\\t}\\n\\tstd::sort(Y.begin(), Y.end());\\n\\t//std::cout << \\\"DEBUG:: \\\\n\\\";\\n\\t//std::cout << \\\"R:: \\\\n\\\";\\n\\t//for (int j = 0; j < rt; j++) {\\n\\t//\\tstd::cout << \\\"R[\\\" << I[j] << \\\"]\\\\n\\\";\\n\\t//\\tfor (const Pos& p : L[I[j]]) std::cout << \\\" (\\\" << p.x << \\\", \\\" << p.y << \\\"),\\\\n\\\";\\n\\t//}\\n\\tfor (int j = 0; j < rt; j++) {\\n\\t\\ti = I[j];\\n\\t\\tif (A[i] < 0) continue;\\n\\t\\tld a = A[i];\\n\\t\\tld h = R[i].back().y;\\n\\t\\tint yi = find_y(Y, R[i][0].y);\\n\\t\\tint k = j + 1;\\n\\t\\twhile (1) {\\n\\t\\t\\t//std::cout << \\\"FUCK:: R \\\\n\\\";\\n\\t\\t\\t//if (yi <= 0) { F.push_back(a); break; }\\n\\t\\t\\tld y = Y[yi];\\n\\t\\t\\tif (sign(y - h) > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (eq(y, h)) { F.push_back(a); break; }\\n\\t\\t\\twhile (k < rt && !eq(y, R[I[k]].back().y)) k++;\\n\\t\\t\\tif (k >= I.size()) break;\\n\\t\\t\\tif (A[I[k]] > 0) { F.push_back(a); break; }\\n\\t\\t\\tif (A[I[k]] < 0) a += A[I[k]];\\n\\t\\t\\tyi = find_y(Y, R[I[k]][0].y);\\n\\t\\t\\tif (A[I[k]] < 0 && eq(Y[yi], y)) yi++;\\n\\t\\t}\\n\\t}\\n\\tstd::sort(F.rbegin(), F.rend());\\n\\treturn F[0];\\n}\\nld ternary_search(const Polygon& H) {\\n\\tassert(H.size() >= 3);\\n\\tld s = INF, e = -INF;\\n\\tld sy = INF, ey = -INF;\\n\\tfor (const Pos& p : H) {\\n\\t\\ts = std::min(s, p.x), e = std::max(e, p.x);\\n\\t\\tsy = std::min(s, p.x), ey = std::max(e, p.x);\\n\\t}\\n\\tld limit = std::max(std::abs(s - e), std::abs(sy - ey));\\n\\t//if (std::abs(s - e) < 5) TOL = 1e-5;\\n\\t//else if (std::abs(s - e) < 10) TOL = 1e-7;\\n\\t//else if (H.size() == 8) TOL = 1e-8;\\n\\t//else TOL = 1e-15;\\n\\tif (limit < 5) TOL = 1e-7;\\n\\telse if (limit < 10) TOL = 1e-7;\\n\\telse if (H.size() == 8) TOL = 1e-8;\\n\\telse TOL = 1e-15;\\n\\ts += TOL;\\n\\te -= TOL;\\n\\tld a1 = 0, a2 = 0;\\n\\twhile (std::abs(e - s) > 1e-8) {\\n\\t\\tld m1 = (s + s + e) / 3;\\n\\t\\tld m2 = (s + e + e) / 3;\\n\\t\\ta1 = largest(H, m1);\\n\\t\\ta2 = largest(H, m2);\\n\\t\\t//std::cout << \\\"a1a2:: \\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\t\\tif (a1 > a2) s = m1;\\n\\t\\telse e = m2;\\n\\t}\\n\\t//std::cout << \\\"a1a2::::::::::::::::\\\" << a1 << \\\" \\\" << a2 << \\\"\\\\n\\\";\\n\\treturn largest(H, (s + e) * .5);\\n}\\nVld ANS;\\nbool query() {\\n\\tstd::cin >> N;\\n\\tif (!N) return 0;\\n\\tPos v;\\n\\tstd::cin >> v;\\n\\tif ((zero(v.y) && v.x < 0) || v.y < 0) v *= -1;\\n\\tld t = v.rad();\\n\\tt = norm(PI * .5 - t);\\n\\tPolygon H(N);\\n\\tfor (Pos& p : H) std::cin >> p, p = p.rot(t);\\n\\t//for (const Pos& p : H) std::cout << p << \\\"\\\\n\\\";\\n\\t//std::cout << ternary_search(H) * .5 << \\\"\\\\n\\\";\\n\\tANS.push_back(ternary_search(H) * .5);\\n\\treturn 1;\\n}\\nvoid solve() {\\n\\tstd::cin.tie(0)->sync_with_stdio(0);\\n\\tstd::cout.tie(0);\\n\\tstd::cout << std::fixed;\\n\\tstd::cout.precision(15);\\n\\t//freopen(\\\"../../../input_data/cave.txt\\\", \\\"r\\\", stdin);\\n\\t//freopen(\\\"../../../input_data/cave.ret\\\", \\\"w\\\", stdout);\\n\\twhile (query());\\n\\tfor (const ld& a : ANS) std::cout << a << \\\"\\\\n\\\";\\n\\treturn;\\n}\\nint main() { solve(); return 0; }//boj13816 Cave Explorer\\n\\n/*\\n* \\n10\\n1 9998\\n0 0\\n1 9999\\n2 0\\n3 9999\\n4 0\\n5 10000\\n4 1\\n3 10000\\n2 1\\n1 10000\\nans 1.4999749962\\nret 2.500075061\\n\\n8\\n1 1\\n0 0\\n9999 0\\n1 1\\n10000 0\\n10000 10000\\n1 10000\\n9999 9999\\n0 10000\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -0.9746,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2184_4887268\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 205\\n#define EPS 0.00001\\n#define EPS2 0.000000000001\\n\\nenum Type{\\n\\tFIRST,\\n\\tSECOND,\\n};\\n\\nstruct Point{\\n\\tPoint(long double arg_x,long 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 * (long double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (long double a){ return Point(x/a,y/a); }\\n\\n\\tlong double abs(){ return sqrt(norm()); }\\n\\tlong double norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(y-p.y) > EPS2){\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\tdouble a = x-p.x,b = y-p.y;\\n\\t\\treturn sqrt(a*a+b*b) < EPS;\\n\\t}\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.12Lf,%.12Lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tlong double 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\\nstruct Info{\\n\\n\\tPoint p;\\n\\tbool is_cut;\\n};\\n\\nstruct Data{\\n\\tData(Point arg_p,long double arg_index){\\n\\t\\tp = arg_p;\\n\\t\\tindex = arg_index;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\n\\t\\treturn p < arg.p;\\n\\t}\\n\\tbool operator==(const struct Data &arg) const{\\n\\n\\t\\treturn index == arg.index;\\n\\t}\\n\\n\\tPoint p;\\n\\tint index;\\n};\\n\\nstruct VALUE{\\n\\tVALUE(long double arg_value){\\n\\n\\t\\tvalue = arg_value;\\n\\t}\\n\\tbool operator<(const struct VALUE &arg) const{\\n\\n\\t\\treturn value < arg.value;\\n\\t}\\n\\tbool operator==(const struct VALUE &arg) const{\\n\\n\\t\\treturn fabs(value-arg.value) < EPS2;\\n\\t}\\n\\n\\tlong double value;\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,Type arg_type){\\n\\t\\tto = arg_to;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tint to;\\n\\tType type;\\n};\\n\\nint N;\\nint num_point;\\nlong double NUM = 1000000;\\nvector<int> P;\\nPoint point[205];\\n\\n\\nlong double norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\nlong double abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\nlong double cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nlong double 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\\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) > EPS2)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS2)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS2)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nlong double 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//切片を求める関数\\nlong double calc_add(Line line){\\n\\n\\tlong double slope = calc_slope(line);\\n\\n\\tif(fabs(slope-DBL_MAX) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(slope) < EPS){\\n\\n\\t\\treturn line.p[0].y;\\n\\n\\t}else{\\n\\n\\t\\treturn line.p[0].y-slope*line.p[0].x;\\n\\t}\\n}\\n\\n\\nint func(long double x1,long double y1,long double x2, long double y2, long double xp, long double yp){\\n\\tlong double naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\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\\nlong double calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n//線分ではなく直線と点の距離\\nlong double 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//点と線分の距離\\nlong double 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//線分と線分の距離\\nlong double 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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(long double x1,long double x2,long double x3,long double x4,long double y1,long double y2,long double y3,long double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nlong double calc_S(Polygon g){\\n\\n\\tint N = g.size();\\n\\tlong double ret = 0;\\n\\n\\tfor(int i = 0; i < g.size(); i++){\\n\\t\\tret += cross(g[i],g[(i+1)%N]);\\n\\t}\\n\\treturn ret/2.0;\\n}\\n\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS2 && dot(a,b) < EPS2)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS2 && EPS2 < b.y && cross(a,b) > EPS2) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n\\n//2つのvectorがなすラジアンを求める関数\\nlong double calc_rad(Vector vec1,Vector vec2){\\n\\n\\tlong double tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS2){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS2){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\nlong double calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\nlong double 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\\nlong double calc_max_S(long double SLOPE,long double add){\\n\\n\\tint num_info = 0;\\n\\tint table[205];\\n\\tInfo info[205];\\n\\tbool check[205];\\n\\tvector<Edge> G[205];\\n\\n\\tLine base_line;\\n\\n\\tif(fabs(SLOPE-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\tbase_line = Line(Point(add,-NUM),Point(add,NUM));\\n\\n\\t}else{\\n\\n\\t\\tbase_line = Line(Point(-NUM,-NUM*SLOPE+add),Point(NUM,NUM*SLOPE+add));\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tinfo[i].p = point[i];\\n\\t\\tinfo[i].is_cut = false;\\n\\t\\tnum_info++;\\n\\t}\\n\\n\\tvector<int> work_P;\\n\\n\\tvector<Data> CROSS;\\n\\n\\tint COUNT = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\twork_P.push_back(P[i]);\\n\\n\\t\\tLine work_line = Line(point[i],point[(i+1)%N]);\\n\\n\\t\\t//work_line.outPut();\\n\\t\\tlong double tmp_slope = calc_slope(work_line);\\n\\n\\t\\tif(fabs(SLOPE-DBL_MAX) < EPS){\\n\\n\\t\\t\\tif(fabs(work_line.p[0].x-add) < EPS|| fabs(work_line.p[1].x-add) < EPS){\\n\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(!is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\t\\t\\tif(!is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(fabs(SLOPE-tmp_slope) < EPS2){ //★★切断線とポリゴンの辺が平行(交差するので切片もおなじ)★★\\n\\n\\t\\t\\tinfo[i].is_cut = true;\\n\\t\\t\\tinfo[(i+1)%N].is_cut = true;\\n\\n\\t\\t\\tCROSS.push_back(Data(info[i].p,i));\\n\\t\\t\\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\\n\\n\\t\\t}else{ //傾きが異なる\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(base_line,work_line);\\n\\n\\t\\t\\tif(cross_p == point[i]){\\n\\n\\t\\t\\t\\tinfo[i].is_cut = true;\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(info[i].p,i));\\n\\n\\t\\t\\t}else if(cross_p == point[(i+1)%N]){\\n\\n\\t\\t\\t\\tinfo[(i+1)%N].is_cut = true;\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\\n\\n\\t\\t\\t}else{ //線分の途中に交点が来る\\n\\n\\t\\t\\t\\tinfo[num_info].p = cross_p;\\n\\t\\t\\t\\tinfo[num_info].is_cut = true;\\n\\n\\t\\t\\t\\twork_P.push_back(num_info);\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(cross_p,num_info));\\n\\n\\t\\t\\t\\tnum_info++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tfor(int i = 0; i < work_P.size(); i++){\\n\\n\\t\\tG[i].push_back(Edge((i+1)%work_P.size(),FIRST));\\n\\t}\\n\\n\\tfor(int i = 0; i < work_P.size(); i++){\\n\\n\\t\\ttable[work_P[i]] = i;\\n\\t}\\n\\n\\tPolygon poly;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tpoly.push_back(point[i]);\\n\\t}\\n\\n\\tsort(CROSS.begin(),CROSS.end());\\n\\tCROSS.erase(unique(CROSS.begin(),CROSS.end()),CROSS.end());\\n\\n\\tfor(int i = 1; i < CROSS.size(); i++){\\n\\n\\t\\tPoint mid_p = (info[CROSS[i-1].index].p+info[CROSS[i].index].p)/2;\\n\\n\\t\\tint tmp = contains(poly,mid_p);\\n\\n\\t\\tif(tmp != 0){ //内部か辺\\n\\n\\t\\t\\tG[table[CROSS[i-1].index]].push_back(Edge(table[CROSS[i].index],SECOND));\\n\\t\\t\\tG[table[CROSS[i].index]].push_back(Edge(table[CROSS[i-1].index],SECOND));\\n\\t\\t}\\n\\t}\\n\\n\\tlong double ret = 0;\\n\\n\\tfor(int i = 0; i < num_info; i++){\\n\\n\\t\\tcheck[i] = false;\\n\\t}\\n\\n\\tfor(int i = 0; i < num_info; i++){\\n\\t\\tif(check[work_P[i]] || (info[work_P[i]].is_cut && G[i].size() > 1))continue;\\n\\n\\t\\tPolygon work_poly;\\n\\t\\tPoint start = info[work_P[i]].p;\\n\\t\\twork_poly.push_back(start);\\n\\n\\t\\tcheck[work_P[i]] = true;\\n\\n\\t\\tint tmp_index = (i+1)%work_P.size();\\n\\t\\tint tmp_next;\\n\\n\\t\\tint pre = i;\\n\\n\\t\\tint debug = 0;\\n\\n\\t\\twhile(true){\\n\\n\\t\\t\\tdebug++;\\n\\n\\t\\t\\tif(debug > work_P.size()+2){\\n\\t\\t\\t\\t\\n\\t\\t\\t\\treturn BIG_NUM;\\n\\t\\t\\t}\\n\\n\\t\\t\\twork_poly.push_back(info[work_P[tmp_index]].p);\\n\\t\\t\\tcheck[work_P[tmp_index]] = true;\\n\\n\\t\\t\\tif(info[work_P[tmp_index]].is_cut && G[tmp_index].size() > 1){\\n\\n\\t\\t\\t\\tlong double min_rad_cut = BIG_NUM;\\n\\t\\t\\t\\tlong double min_rad_not = BIG_NUM;\\n\\t\\t\\t\\tint min_index_cut = -1,min_index_not = -1;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < G[tmp_index].size(); k++){\\n\\n\\t\\t\\t\\t\\tint next = G[tmp_index][k].to;\\n\\t\\t\\t\\t\\tif(next == pre)continue;\\n\\n\\t\\t\\t\\t\\tlong double tmp_rad;\\n\\t\\t\\t\\t\\tif(ccw(info[work_P[tmp_index]].p,\\n\\t\\t\\t\\t\\t\\t\\tinfo[work_P[next]].p,info[work_P[pre]].p) == COUNTER_CLOCKWISE){\\n\\n\\t\\t\\t\\t\\t\\ttmp_rad = calc_rad(info[work_P[tmp_index]].p,info[work_P[next]].p,info[work_P[pre]].p);\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\ttmp_rad = 2*M_PI- calc_rad(info[work_P[tmp_index]].p,info[work_P[pre]].p,info[work_P[next]].p);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(G[tmp_index][k].type == SECOND){\\n\\n\\t\\t\\t\\t\\t\\tif(min_rad_cut > tmp_rad){\\n\\t\\t\\t\\t\\t\\t\\tmin_rad_cut = tmp_rad;\\n\\t\\t\\t\\t\\t\\t\\tmin_index_cut = next;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tif(min_rad_not > tmp_rad){\\n\\t\\t\\t\\t\\t\\t\\tmin_rad_not = tmp_rad;\\n\\t\\t\\t\\t\\t\\t\\tmin_index_not = next;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(min_index_cut != -1 && min_index_not != -1 && fabs(min_rad_cut-min_rad_not) < EPS){\\n\\n\\t\\t\\t\\t\\ttmp_next = min_index_cut;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(min_rad_cut < min_rad_not){\\n\\n\\t\\t\\t\\t\\t\\ttmp_next = min_index_cut;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\ttmp_next = min_index_not;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\ttmp_next = (tmp_index+1)%work_P.size();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(tmp_next == i)break;\\n\\n\\t\\t\\tpre = tmp_index;\\n\\t\\t\\ttmp_index = tmp_next;\\n\\t\\t}\\n\\n\\t\\tCOUNT++;\\n\\t\\tret = max(ret,calc_S(work_poly));\\n\\t}\\n\\n\\tif(COUNT == 0){\\n\\n\\t\\treturn BIG_NUM;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\nvoid func(){\\n\\n\\tP.clear();\\n\\tnum_point = 0;\\n\\n\\tlong double Vx,Vy;\\n\\tscanf(\\\"%Lf %Lf\\\",&Vx,&Vy);\\n\\n\\tlong double SLOPE = calc_slope(Line(Point(0,0),Point(Vx,Vy)));\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%Lf %Lf\\\",&point[i].x,&point[i].y);\\n\\t\\tnum_point++;\\n\\t}\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tP.push_back(i);\\n\\t}\\n\\n\\tvector<VALUE> V;\\n\\n\\t//各点を通る、直線の切片またはX座標(傾きが垂直な場合)を求める\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(fabs(SLOPE-DBL_MAX) < EPS){\\n\\n\\t\\t\\tV.push_back(VALUE(point[i].x));\\n\\t\\t}else{\\n\\n\\n\\t\\t\\tV.push_back(VALUE(point[i].y-SLOPE*point[i].x));\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end());\\n\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\tlong double ans = BIG_NUM;\\n\\n\\tfor(int i = 1; i < V.size(); i++){\\n\\n\\t\\tlong double L = V[i-1].value,R = V[i].value;\\n\\n\\t\\tfor(int loop = 0; loop < 100; loop++){\\n\\n\\t\\t\\tlong double mid1 = (2.0*L+R)/3.0;\\n\\t\\t\\tlong double mid2 = (1.0*L+2.0*R)/3.0;\\n\\n\\t\\t\\tlong double S1 = calc_max_S(SLOPE,mid1);\\n\\t\\t\\tlong double S2 = calc_max_S(SLOPE,mid2);\\n\\n\\t\\t\\tans = min(ans,min(S1,S2));\\n\\n\\t\\t\\tif(S1 <= S2){\\n\\n\\t\\t\\t\\tR = mid2;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tL = mid1;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(fabs(R-L) < EPS2)break;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10Lf\\\\n\\\",ans);\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5010,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.3918,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2184_4887203\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 205\\n#define EPS 0.00001\\n#define EPS2 0.000000000001\\n\\nenum Type{\\n\\tFIRST,\\n\\tSECOND,\\n};\\n\\nstruct Point{\\n\\tPoint(long double arg_x,long 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 * (long double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (long double a){ return Point(x/a,y/a); }\\n\\n\\tlong double abs(){ return sqrt(norm()); }\\n\\tlong double 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\\tdouble a = x-p.x,b = y-p.y;\\n\\t\\treturn sqrt(a*a+b*b) < EPS;\\n\\t}\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.12Lf,%.12Lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tlong double 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\\nstruct Info{\\n\\n\\tPoint p;\\n\\tbool is_cut;\\n};\\n\\nstruct Data{\\n\\tData(Point arg_p,long double arg_index){\\n\\t\\tp = arg_p;\\n\\t\\tindex = arg_index;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\n\\t\\treturn p < arg.p;\\n\\t}\\n\\tbool operator==(const struct Data &arg) const{\\n\\n\\t\\treturn index == arg.index;\\n\\t}\\n\\n\\tPoint p;\\n\\tint index;\\n};\\n\\nstruct VALUE{\\n\\tVALUE(long double arg_value){\\n\\n\\t\\tvalue = arg_value;\\n\\t}\\n\\tbool operator<(const struct VALUE &arg) const{\\n\\n\\t\\treturn value < arg.value;\\n\\t}\\n\\tbool operator==(const struct VALUE &arg) const{\\n\\n\\t\\treturn fabs(value-arg.value) < EPS;\\n\\t}\\n\\n\\tlong double value;\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,Type arg_type){\\n\\t\\tto = arg_to;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tint to;\\n\\tType type;\\n};\\n\\nint N;\\nint num_point;\\nlong double NUM = 1000000;\\nvector<int> P;\\nPoint point[205];\\n\\n\\nlong double norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\nlong double abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\nlong double cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nlong double 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\\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) > EPS2)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS2)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS2)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nlong double 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//切片を求める関数\\nlong double calc_add(Line line){\\n\\n\\tlong double slope = calc_slope(line);\\n\\n\\tif(fabs(slope-DBL_MAX) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(slope) < EPS){\\n\\n\\t\\treturn line.p[0].y;\\n\\n\\t}else{\\n\\n\\t\\treturn line.p[0].y-slope*line.p[0].x;\\n\\t}\\n}\\n\\n\\nint func(long double x1,long double y1,long double x2, long double y2, long double xp, long double yp){\\n\\tlong double naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\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\\nlong double calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\n//線分ではなく直線と点の距離\\nlong double 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//点と線分の距離\\nlong double 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//線分と線分の距離\\nlong double 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\\n\\n//交点を求める関数\\nPoint calc_Cross_Point(long double x1,long double x2,long double x3,long double x4,long double y1,long double y2,long double y3,long double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nlong double calc_S(Polygon g){\\n\\n\\tint N = g.size();\\n\\tlong double ret = 0;\\n\\n\\tfor(int i = 0; i < g.size(); i++){\\n\\t\\tret += cross(g[i],g[(i+1)%N]);\\n\\t}\\n\\treturn ret/2.0;\\n}\\n\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS2 && dot(a,b) < EPS2)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS2 && EPS2 < b.y && cross(a,b) > EPS2) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n\\n//2つのvectorがなすラジアンを求める関数\\nlong double calc_rad(Vector vec1,Vector vec2){\\n\\n\\tlong double tmp = dot(vec1,vec2)/(abs(vec1)*abs(vec2));\\n\\n\\tif(fabs(tmp+1.0) < EPS2){\\n\\n\\t\\treturn M_PI;\\n\\t}\\n\\n\\tif(fabs(tmp-1.0) < EPS2){\\n\\n\\t\\treturn 0.0;\\n\\t}\\n\\n\\treturn acos(dot(vec1,vec2)/(abs(vec1)*abs(vec2)));\\n}\\n\\n//3点がなすラジアンを求める関数(ccw(base,a,b) == CCW)\\nlong double calc_rad(Point base,Point a,Point b){\\n\\n\\tVector vec1 = b-base;\\n\\tVector vec2 = a-base;\\n\\n\\treturn calc_rad(vec1,vec2);\\n}\\n\\n\\nlong double 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\\nlong double calc_max_S(long double SLOPE,long double add){\\n\\n\\tint num_info = 0;\\n\\tint table[205];\\n\\tInfo info[205];\\n\\tbool check[205];\\n\\tvector<Edge> G[205];\\n\\n\\tLine base_line;\\n\\n\\tif(fabs(SLOPE-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\tbase_line = Line(Point(add,-NUM),Point(add,NUM));\\n\\n\\t}else{\\n\\n\\t\\tbase_line = Line(Point(-NUM,-NUM*SLOPE+add),Point(NUM,NUM*SLOPE+add));\\n\\t}\\n\\n\\tfor(int i = 0; i < num_point; i++){\\n\\n\\t\\tinfo[i].p = point[i];\\n\\t\\tinfo[i].is_cut = false;\\n\\t\\tnum_info++;\\n\\t}\\n\\n\\tvector<int> work_P;\\n\\n\\tvector<Data> CROSS;\\n\\n\\tint COUNT = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\twork_P.push_back(P[i]);\\n\\n\\t\\tLine work_line = Line(point[i],point[(i+1)%N]);\\n\\n\\t\\t//work_line.outPut();\\n\\t\\tlong double tmp_slope = calc_slope(work_line);\\n\\n\\t\\tif(fabs(SLOPE-DBL_MAX) < EPS){\\n\\n\\t\\t\\tif(fabs(work_line.p[0].x-add) < EPS|| fabs(work_line.p[1].x-add) < EPS){\\n\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(!is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}else{\\n\\t\\t\\tif(!is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(fabs(SLOPE-tmp_slope) < EPS2){ //★★切断線とポリゴンの辺が平行(交差するので切片もおなじ)★★\\n\\n\\t\\t\\tinfo[i].is_cut = true;\\n\\t\\t\\tinfo[(i+1)%N].is_cut = true;\\n\\n\\t\\t\\tCROSS.push_back(Data(info[i].p,i));\\n\\t\\t\\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\\n\\n\\t\\t}else{ //傾きが異なる\\n\\n\\t\\t\\tPoint cross_p = calc_Cross_Point(base_line,work_line);\\n\\n\\t\\t\\tif(cross_p == point[i]){\\n\\n\\t\\t\\t\\tinfo[i].is_cut = true;\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(info[i].p,i));\\n\\n\\t\\t\\t}else if(cross_p == point[(i+1)%N]){\\n\\n\\t\\t\\t\\tinfo[(i+1)%N].is_cut = true;\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(info[(i+1)%N].p,(i+1)%N));\\n\\n\\t\\t\\t}else{ //線分の途中に交点が来る\\n\\n\\t\\t\\t\\tinfo[num_info].p = cross_p;\\n\\t\\t\\t\\tinfo[num_info].is_cut = true;\\n\\n\\t\\t\\t\\twork_P.push_back(num_info);\\n\\n\\t\\t\\t\\tCROSS.push_back(Data(cross_p,num_info));\\n\\n\\t\\t\\t\\tnum_info++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tfor(int i = 0; i < work_P.size(); i++){\\n\\n\\t\\tG[i].push_back(Edge((i+1)%work_P.size(),FIRST));\\n\\t}\\n\\n\\tfor(int i = 0; i < work_P.size(); i++){\\n\\n\\t\\ttable[work_P[i]] = i;\\n\\t}\\n\\n\\tPolygon poly;\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tpoly.push_back(point[i]);\\n\\t}\\n\\n\\tsort(CROSS.begin(),CROSS.end());\\n\\tCROSS.erase(unique(CROSS.begin(),CROSS.end()),CROSS.end());\\n\\n\\tfor(int i = 1; i < CROSS.size(); i++){\\n\\n\\t\\tPoint mid_p = (info[CROSS[i-1].index].p+info[CROSS[i].index].p)/2;\\n\\n\\t\\tint tmp = contains(poly,mid_p);\\n\\n\\t\\tif(tmp != 0){ //内部か辺\\n\\n\\t\\t\\tG[table[CROSS[i-1].index]].push_back(Edge(table[CROSS[i].index],SECOND));\\n\\t\\t\\tG[table[CROSS[i].index]].push_back(Edge(table[CROSS[i-1].index],SECOND));\\n\\t\\t}\\n\\t}\\n\\n\\n\\tlong double ret = 0;\\n\\n\\tfor(int i = 0; i < num_info; i++){\\n\\n\\t\\tcheck[i] = false;\\n\\t}\\n\\n\\n\\tfor(int i = 0; i < num_info; i++){\\n\\t\\tif(check[work_P[i]] || (info[work_P[i]].is_cut && G[i].size() > 1))continue;\\n\\n\\t\\tPolygon work_poly;\\n\\t\\tPoint start = info[work_P[i]].p;\\n\\t\\twork_poly.push_back(start);\\n\\n\\t\\tcheck[work_P[i]] = true;\\n\\n\\t\\tint tmp_index = (i+1)%work_P.size();\\n\\t\\tint tmp_next;\\n\\n\\t\\tint pre = i;\\n\\n\\t\\tint debug = 0;\\n\\n\\t\\twhile(true){\\n\\n\\t\\t\\tdebug++;\\n\\n\\t\\t\\tif(debug > work_P.size()+2){\\n\\t\\t\\t\\treturn BIG_NUM;\\n\\t\\t\\t}\\n\\n\\t\\t\\twork_poly.push_back(info[work_P[tmp_index]].p);\\n\\t\\t\\tcheck[work_P[tmp_index]] = true;\\n\\n\\t\\t\\tif(info[work_P[tmp_index]].is_cut && G[tmp_index].size() > 1){\\n\\n\\t\\t\\t\\tlong double min_rad_cut = BIG_NUM;\\n\\t\\t\\t\\tlong double min_rad_not = BIG_NUM;\\n\\t\\t\\t\\tint min_index_cut = -1,min_index_not = -1;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < G[tmp_index].size(); k++){\\n\\n\\t\\t\\t\\t\\tint next = G[tmp_index][k].to;\\n\\t\\t\\t\\t\\tif(next == pre)continue;\\n\\n\\t\\t\\t\\t\\tlong double tmp_rad;\\n\\t\\t\\t\\t\\tif(ccw(info[work_P[tmp_index]].p,\\n\\t\\t\\t\\t\\t\\t\\tinfo[work_P[next]].p,info[work_P[pre]].p) == COUNTER_CLOCKWISE){\\n\\n\\t\\t\\t\\t\\t\\ttmp_rad = calc_rad(info[work_P[tmp_index]].p,info[work_P[next]].p,info[work_P[pre]].p);\\n\\n\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\ttmp_rad = 2*M_PI- calc_rad(info[work_P[tmp_index]].p,info[work_P[pre]].p,info[work_P[next]].p);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(G[tmp_index][k].type == SECOND){\\n\\n\\t\\t\\t\\t\\t\\tif(min_rad_cut > tmp_rad){\\n\\t\\t\\t\\t\\t\\t\\tmin_rad_cut = tmp_rad;\\n\\t\\t\\t\\t\\t\\t\\tmin_index_cut = next;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tif(min_rad_not > tmp_rad){\\n\\t\\t\\t\\t\\t\\t\\tmin_rad_not = tmp_rad;\\n\\t\\t\\t\\t\\t\\t\\tmin_index_not = next;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(min_index_cut != -1 && min_index_not != -1 && fabs(min_rad_cut-min_rad_not) < EPS){\\n\\n\\t\\t\\t\\t\\ttmp_next = min_index_cut;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(min_rad_cut < min_rad_not){\\n\\n\\t\\t\\t\\t\\t\\ttmp_next = min_index_cut;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\ttmp_next = min_index_not;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\ttmp_next = (tmp_index+1)%work_P.size();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(tmp_next == i)break;\\n\\n\\t\\t\\tpre = tmp_index;\\n\\t\\t\\ttmp_index = tmp_next;\\n\\t\\t}\\n\\n\\t\\tCOUNT++;\\n\\t\\tret = max(ret,calc_S(work_poly));\\n\\t}\\n\\n\\tif(COUNT == 0){\\n\\n\\t\\treturn BIG_NUM;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n\\nvoid func(){\\n\\n\\tP.clear();\\n\\tnum_point = 0;\\n\\n\\tlong double Vx,Vy;\\n\\tscanf(\\\"%Lf %Lf\\\",&Vx,&Vy);\\n\\n\\tlong double SLOPE = calc_slope(Line(Point(0,0),Point(Vx,Vy)));\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%Lf %Lf\\\",&point[i].x,&point[i].y);\\n\\t\\tnum_point++;\\n\\t}\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tP.push_back(i);\\n\\t}\\n\\n\\tvector<VALUE> V;\\n\\n\\t//各点を通る、直線の切片またはX座標(傾きが垂直な場合)を求める\\n\\tfor(int i = 0; i < num_point; i++){\\n\\t\\tif(fabs(SLOPE-DBL_MAX) < EPS){\\n\\n\\t\\t\\tV.push_back(VALUE(point[i].x));\\n\\t\\t}else{\\n\\n\\n\\t\\t\\tV.push_back(VALUE(point[i].y-SLOPE*point[i].x));\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end());\\n\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\tlong double ans = BIG_NUM;\\n\\n\\tfor(int i = 1; i < V.size(); i++){\\n\\n\\t\\tlong double L = V[i-1].value,R = V[i].value;\\n\\n\\t\\tfor(int loop = 0; loop < 100; loop++){\\n\\n\\t\\t\\tlong double mid1 = (2.0*L+R)/3.0;\\n\\t\\t\\tlong double mid2 = (1.0*L+2.0*R)/3.0;\\n\\n\\t\\t\\tlong double S1 = calc_max_S(SLOPE,mid1);\\n\\t\\t\\tlong double S2 = calc_max_S(SLOPE,mid2);\\n\\n\\t\\t\\tans = min(ans,min(S1,S2));\\n\\n\\t\\t\\tif(S1 <= S2){\\n\\n\\t\\t\\t\\tR = mid2;\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tL = mid1;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(fabs(R-L) < EPS2)break;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10Lf\\\\n\\\",ans);\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5020,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -1.4256,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2184_2209124\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e10L\\n#define eps (1e-11L)\\n#define Eps (1e-7L)\\n#define mod 1000000007\\n#define pi acos(-1.0)\\n#define phi (1.0L+sqrtl(5.0L))/2.0L\\n#define f first\\n#define s second\\n#define mp make_pair\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define pd(a) printf(\\\"%.10Lf\\\\n\\\",(ld)(a))\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for(int i=(a)-1;(b)<=i;i--)\\n#define equals(a,b) (fabs((a)-(b))<Eps)\\nusing namespace std;\\ntypedef long double ld;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> pii;\\ntypedef pair<int,ld> pid;\\ntypedef pair<ld,int> pdi;\\ntypedef vector<int> vi;\\ntypedef vector<pii> vpi;\\n\\nclass Point{\\npublic:\\n ld x,y;\\n Point(ld x=0.0L,ld y=0.0L):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*(ld k){ return Point(x*k,y*k);}\\n Point operator/(ld k){ return Point(x/k,y/k);}\\n bool operator<(Point p)const{ \\n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\\n bool operator==(Point p)const{ \\n return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\\n\\n ld abs(){ return sqrtl(norm());}\\n ld norm(){ return (x*x+y*y);}\\n};\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nclass Segment{\\npublic:\\n Point p1,p2;\\n Segment(Point p1=Point(),Point p2=Point()):p1(p1),p2(p2){}\\n};\\ntypedef Segment Line;\\n\\nld norm(Vector a){ return (a.x*a.x+a.y*a.y);}\\nld abs(Vector a){ return sqrtl(norm(a));}\\nld dot(Vector a,Vector b){ return (a.x*b.x+a.y*b.y);}\\nld cross(Vector a,Vector b){ return (a.x*b.y-a.y*b.x);}\\n\\nPoint project(Segment s,Point p){\\n Vector base=(s.p2-s.p1);\\n ld r=(dot(p-s.p1,base)/base.norm());\\n return (s.p1+base*r);\\n}\\n\\nbool isParallel(Segment s,Segment t){\\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0L);\\n}\\n\\nPoint getCrossPointLL(Line a,Line b){\\n ld A=cross(a.p2-a.p1,b.p2-b.p1);\\n ld B=cross(a.p2-a.p1,a.p2-b.p1);\\n if(abs(A)<eps || abs(B)<eps)return b.p1;\\n return b.p1+(b.p2-b.p1)*(B/A);\\n}\\n\\nld getDistanceLP(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\nbool onLine(Line L,Point p){ return getDistanceLP(L,p)<eps; }\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a=p1-p0;\\n Vector b=p2-p0;\\n if(!onLine(Line(p0,p1),p2))return (cross(a,b)>eps ? 1:-1);\\n if(dot(a,b)<-eps)return 2;\\n if(a.norm()<b.norm())return -2;\\n return 0;\\n}\\n\\nbool onSegment(Segment s,Point p){\\n if(!onLine(s,p))return false;\\n if(dot(s.p2-s.p1,p-s.p1)<-eps)return false;\\n if(dot(s.p1-s.p2,p-s.p2)<-eps)return false;\\n return true;\\n}\\n\\nld getPolygonArea(Polygon p){\\n ld area=0.0L;\\n int n=p.size();\\n for(int i=0;i<n;i++)area+=cross(p[i%n],p[(i+1)%n]);\\n return area/2.0L;\\n}\\n\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n Segment s(g[i],g[(i+1)%n]);\\n if(onSegment(s,p))return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\n}\\n\\nvector<Polygon> Polygon_cut(Polygon p,Line L){\\n vector<Polygon> res;\\n vector<vector<int> > g;\\n vector<Point> v;\\n int n=p.size();\\n int ver[p.size()*2];\\n fill(ver,ver+p.size()*2,-1);\\n for(int i=0;i<n;i++){\\n int j=(i+1)%n;\\n if(ccw(L.p1,L.p2,p[i])!=-1){\\n v.push_back(p[i]);\\n ver[v.size()-1]=i;\\n }\\n Segment s(p[i],p[j]);\\n if(isParallel(L,s))continue;\\n Point m=getCrossPointLL(s,L);\\n if(dot(s.p2-s.p1,m-s.p1)<eps || dot(s.p1-s.p2,m-s.p2)<eps)continue;\\n v.push_back(m);\\n }\\n\\n g.resize(v.size());\\n bool onL[v.size()];\\n fill(onL,onL+v.size(),false);\\n FOR(i,0,v.size())onL[i]=onLine(L,v[i]);\\n FOR(i,0,v.size()){\\n int j=(i+1)%v.size();\\n if(ver[i]+ver[j]==-2)continue;\\n if(ver[i]!=-1 && ver[j]!=-1){\\n if((ver[i]+1)%n!=ver[j])continue;\\n if(onL[i] && onL[j] && dot(L.p2-L.p1,v[j]-v[i])<-eps)continue;\\n }\\n else if(onL[i] && onL[j])continue;\\n g[i].push_back(j);\\n }\\n \\n vector<pair<ld,int> > list;\\n for(int i=0;i<v.size();i++)\\n if(onLine(L,v[i]))\\n list.push_back(make_pair(dot(L.p2-L.p1,v[i]-L.p1),i));\\n sort(list.begin(),list.end());\\n for(int i=1;i<list.size();i++){\\n int a=list[i-1].s,b=list[i].s;\\n if(contains(p,v[a]+(v[b]-v[a])/2.0L)==2)g[a].push_back(b);\\n }\\n\\n reverse(list.begin(),list.end());\\n bool used[v.size()];\\n fill(used,used+v.size(),false);\\n\\n for(int i=0;i<list.size();i++){\\n int s=list[i].s,a=-1;\\n for(int j=0;j<g[s].size();j++){\\n if(used[g[s][j]])continue;\\n a=g[s][j];\\n }\\n if(a==-1)continue;\\n Polygon P;\\n\\n while(1){\\n P.push_back(v[a]);\\n if(onL[a] && used[a])break;\\n used[a]=true;\\n if(a==s)break;\\n int b=-1;\\n for(int j=0;j<g[a].size();j++){\\n b=g[a][j];\\n if(onL[b])break;\\n }\\n if(b==-1){ P.clear();break; }\\n a=b;\\n }\\n if(getPolygonArea(P)>eps)res.push_back(P);\\n }\\n \\n return res;\\n}\\n\\nint n;\\nVector v,rv;\\nPolygon p;\\n\\nld cal(Point a){\\n ld res=-linf;\\n vector<Polygon> vp;\\n vp=Polygon_cut(p,Line(a,a+v));\\n FOR(i,0,vp.size())res=max(res,getPolygonArea(vp[i]));\\n vp=Polygon_cut(p,Line(a+v,a));\\n FOR(i,0,vp.size())res=max(res,getPolygonArea(vp[i]));\\n if(res==-linf)return linf;\\n return res;\\n}\\n\\nbool comp(Point a,Point b){ return dot(rv,a)<dot(rv,b); }\\n\\nld solve(){\\n ld res=linf;\\n vector<Point> vp;\\n rv.x=-v.y;\\n rv.y=v.x;\\n FOR(i,0,n)vp.pb(project(Line(Point(),rv),p[i]));\\n sort(all(vp),comp);\\n FOR(i,1,n){\\n Point a=vp[i-1],b=vp[i];\\n Vector V=(b-a);\\n if(abs(V)<Eps)continue;\\n V=V/abs(V);\\n ld L=0.0L,R=abs(b-a);\\n FOR(k,0,50){\\n ld m1=(L*phi+R)/(phi+1.0L);\\n ld m2=(L+R*phi)/(phi+1.0L);\\n ld res1=cal(a+V*m1);\\n ld res2=cal(a+V*m2);\\n if(res1<res2)R=m2;\\n else L=m1;\\n if(equals(L,R))break;\\n }\\n res=min(res,cal(a+V*L));\\n } \\n return res;\\n}\\n\\nint main()\\n{\\n while(cin>>n && n){\\n cin>>v.x>>v.y;\\n p.resize(n);\\n FOR(i,0,n)cin>>p[i].x>>p[i].y;\\n pd(solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7670,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -1.7461,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2184_1494307\",\n \"code_snippet\": \"#include<cstdio>\\n#include<complex>\\n#include<cmath>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<iostream>\\n#include<cassert>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\ntypedef double Real;\\ntypedef complex<Real> Point;\\ntypedef pair<Point,Point> Line;\\ntypedef pair<Point,Point> Segment;\\ntypedef vector<Point> Polygon;\\n\\nconst Real eps=1e-7;\\nconst Real eps2=5e-7;\\nconst Real PI=acos(-1.0);\\nconst Point NPoint=Point(NAN,NAN);\\nconst Real inf=1e9;\\n\\nint cnt=0;\\n\\ntemplate<class T> bool eq(T a, T b){\\n\\treturn abs(a-b)<eps;\\n}\\n\\ntemplate<class T> int sgn(T a){\\n\\tif(eq(a,(T)0)) return 0;\\n\\tif(a>0) return 1;\\n\\treturn -1;\\n}\\n\\nvoid print(Point p,char ch='\\\\n'){\\n\\tprintf(\\\"(%f %f)%c\\\",p.real(),p.imag(),ch);\\n}\\n\\nvoid print(Polygon poly){\\n\\tprintf(\\\"----\\\\n\\\");\\n\\tfor(int i=0;i<poly.size();i++){\\n\\t\\tprint(poly[i]);\\n\\t}\\n\\tprintf(\\\"----\\\\n\\\");\\n}\\n\\nPolygon poly;\\nPoint vec;\\nvector<Real> xs;\\n\\nReal doP(Point a,Point b){\\n\\treturn (conj(a)*b).real();\\n}\\n\\nReal crP(Point a,Point b){\\n\\treturn (conj(a)*b).imag();\\n}\\n\\nbool onSeg(Point p,Point q,Point r){\\n\\treturn eq(abs(p-q),abs(p-r)+abs(r-q));\\n}\\n\\nPoint toVec(Line l){\\n\\treturn l.second-l.first;\\n}\\n\\nbool isPara_(Line l1,Line l2){\\n\\treturn eq(crP(toVec(l1),toVec(l2)),(Real)0);\\n}\\n\\nReal getArea(Polygon poly){\\n\\tReal res=0;\\n\\tfor(int i=0;i+1<poly.size();i++){\\n\\t\\tres+=crP(poly[i],poly[i+1])/2;\\n\\t}\\n\\tres=abs(res);\\n\\treturn res;\\n}\\n\\nvoid rot(){\\n\\tPoint p=Point(0,1);\\n\\tvec/=abs(vec);\\n\\tPoint m=p/vec;\\n\\tfor(int i=0;i<poly.size();i++){\\n\\t\\tpoly[i]*=m;\\n\\t}\\n\\tvector<Real> tmp;\\n\\tfor(int i=0;i+1<poly.size();i++){\\n\\t\\tbool ok=true;\\n\\t\\tfor(int j=0;j<tmp.size();j++){\\n\\t\\t\\tif(eq(tmp[j],poly[i].real())) ok=false;\\n\\t\\t}\\n\\t\\tif(ok) tmp.push_back(poly[i].real());\\n\\t}\\n\\tfor(int i=0;i<poly.size();i++){\\n\\t\\tfor(int j=0;j<tmp.size();j++){\\n\\t\\t\\tif(eq(poly[i].real(),tmp[j])){\\n\\t\\t\\t\\tpoly[i]=Point(tmp[j],poly[i].imag());\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\txs=tmp;\\n\\tsort(xs.begin(),xs.end());\\n}\\n\\nPoint cmp_c;\\nbool cmp_ang(const Point &p1,const Point &p2){\\n\\treturn arg(p1-cmp_c)<arg(p2-cmp_c);\\n}\\n\\nstruct PLexCmp{\\n\\tbool operator()(const Point &p1,const Point &p2) const {\\n\\t\\tif(p1.real()!=p2.real()) return p1.real()<p2.real();\\n\\t\\treturn p1.imag()<p2.imag();\\n\\t}\\n};\\n\\nstruct SegLexCmp{\\n\\tbool operator()(const Segment &s1,const Segment &s2) const {\\n\\t\\tif(s1.first.real()!=s2.first.real()) return s1.first.real()<s2.first.real();\\n\\t\\tif(s1.first.imag()!=s2.first.imag()) return s1.first.imag()<s2.first.imag();\\n\\t\\tif(s1.second.real()!=s2.second.real()) return s1.second.real()<s2.second.real();\\n\\t\\treturn s1.second.imag()<s2.second.imag();\\n\\t}\\n};\\n\\nmap<Point,vector<Point>,PLexCmp> con_pts;\\nvector<Real> ys;\\nset<Segment,SegLexCmp> invalid_es;\\n\\nbool genConPts(Real x){\\n\\tmap<Point,vector<Point>,PLexCmp> emptyMap;\\n\\tswap(emptyMap,con_pts);\\n\\tys.clear();\\n\\tset<Segment,SegLexCmp> emptySet;\\n\\tswap(invalid_es,emptySet);\\n\\tfor(int i=0;i+1<poly.size();i++){\\n\\t\\tPoint p=poly[i],q=poly[i+1];\\n\\t\\tif(p.real()==x){\\n\\t\\t\\tys.push_back(p.imag());\\n\\t\\t}\\n\\t//\\tbool swapped=false;\\n\\t\\tif(p.real()>q.real()){\\n\\t//\\t\\tswapped=true;\\n\\t\\t\\tswap(p,q);\\n\\t\\t}\\n\\t\\tif(q.real()<=x||p.real()>=x){\\n\\t\\t\\tcon_pts[p].push_back(q);\\n\\t\\t\\tcon_pts[q].push_back(p);\\n\\t\\t\\tinvalid_es.insert(Segment(poly[i+1],poly[i]));\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tReal y=p.imag()+((q.imag()-p.imag())*(x-p.real())/(q.real()-p.real()));\\n\\t\\tif(y==p.imag()){\\n\\t\\t\\tif(p.imag()>q.imag()) y+=eps;\\n\\t\\t\\telse y-=eps;\\n\\t\\t}\\n\\t\\tys.push_back(y);\\n\\t\\tPoint r=Point(x,y);\\n\\t\\tcon_pts[p].push_back(r);\\n\\t\\tcon_pts[r].push_back(p);\\n\\t\\tcon_pts[q].push_back(r);\\n\\t\\tcon_pts[r].push_back(q);\\n\\t\\tinvalid_es.insert(Segment(poly[i+1],r));\\n\\t\\tinvalid_es.insert(Segment(r,poly[i]));\\n\\t}\\n\\tsort(ys.begin(),ys.end());\\n\\tint ln=ys.size();\\n\\tys.erase(unique(ys.begin(),ys.end()),ys.end());\\n\\tif(ln!=ys.size()) return false;\\n\\tfor(int i=0;i+1<ys.size();i++){\\n\\t\\tPoint p=Point(x,ys[i]);\\n\\t\\tPoint q=Point(x,ys[i+1]);\\n\\t\\tcon_pts[p].push_back(q);\\n\\t\\tcon_pts[q].push_back(p);\\n\\t}\\n\\tmap<Point,vector<Point>,PLexCmp> :: iterator it=con_pts.begin();\\n\\tfor(;it!=con_pts.end();it++){\\n\\t\\tvector<Point> &vec=it->second;\\n\\t\\tcmp_c=it->first;\\n\\t\\tsort(vec.begin(),vec.end(),cmp_ang);\\n\\t\\tvec.erase(unique(vec.begin(),vec.end()),vec.end());\\n\\t/*\\tvector<Point> vec2;\\n\\t\\tfor(int i=0;i<vec.size();i++){\\n\\t\\t\\tif(i==0||(vec[i].real()!=vec[i-1].real()||vec[i].imag()!=vec[i-1].imag())){\\n\\t\\t\\t\\tvec2.push_back(vec[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvec=vec2;*/\\n\\t}\\n\\tfor(it=con_pts.begin();it!=con_pts.end();it++){\\n\\t\\tfor(int i=0;i<(it->second).size();i++){\\n\\t\\t\\tPoint p=(it->second)[i];\\n\\t\\t\\tassert(con_pts.find(p)!=con_pts.end());\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid stroke(vector<Point> &vec,Point cur,Point prv,Point ini){\\n\\tvector<Point> pts=con_pts[cur];\\n\\tcmp_c=cur;\\n\\tint id=distance(pts.begin(),lower_bound(pts.begin(),pts.end(),prv,cmp_ang));\\n\\tassert(prv==pts[id]);\\n\\tid--;\\n\\tif(id==-1) id=pts.size()-1;\\n\\tassert(0<=id&&id<pts.size());\\n\\tPoint nxt=pts[id];\\n\\tvec.push_back(nxt);\\n\\tif(nxt==ini) return;\\n\\tstroke(vec,nxt,cur,ini);\\n}\\n\\nint whichSide(Polygon poly,Real x){\\n\\tbool le=false,ri=false;\\n\\tfor(int i=0;i<poly.size();i++){\\n\\t\\tif(poly[i].real()<x) le=true;\\n\\t\\tif(poly[i].real()>x) ri=true;\\n\\t}\\n\\tif(le&&ri) return 0;\\n\\telse if(le) return -1;\\n\\telse if(ri) return 1;\\n\\tprintf(\\\"error whichSide\\\\n\\\");\\n\\tprintf(\\\"%f\\\\n\\\",x);\\n\\tprint(poly);\\n\\tfor(int i=0;i<ys.size();i++){\\n\\t\\tprintf(\\\"%f\\\\n\\\",ys[i]);\\n\\t}\\n\\tvector<Point> vec=con_pts[poly[0]];\\n\\tprint(poly[0]);\\n\\tfor(int i=0;i<vec.size();i++){\\n\\t\\tprintf(\\\"-\\\");\\n\\t\\tprint(vec[i]);\\n\\t}\\n\\tprintf(\\\"\\\\n\\\\n\\\\n\\\");\\n\\tmap<Point,vector<Point>,PLexCmp> ::iterator it=con_pts.begin();\\n\\tfor(;it!=con_pts.end();it++){\\n\\t\\tprint(it->first);\\n\\t\\tfor(int i=0;i<(it->second).size();i++){\\n\\t\\t\\tprintf(\\\"-\\\");\\n\\t\\t\\tprint((it->second)[i]);\\n\\t\\t}\\n\\t}\\n\\texit(0);\\n}\\n\\nbool isValid_(Polygon poly){\\n\\tfor(int i=0;i+1<poly.size();i++){\\n\\t\\tSegment seg=Segment(poly[i],poly[i+1]);\\n\\t\\tif(invalid_es.find(seg)!=invalid_es.end()) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\npair<Real,Real> calcArea(Real x){\\n\\tReal le=0,ri=0;\\n\\tbool flg=genConPts(x);\\n\\tif(flg==false){\\n\\t\\treturn make_pair(inf,inf);\\n\\t}\\n\\tif(ys.size()<=1){\\n\\t\\treturn make_pair(inf,inf);\\n\\t}/*\\n\\tfor(map<Point,vector<Point>,PLexCmp>::iterator it=con_pts.begin();it!=con_pts.end();it++){\\n\\t\\tprint(it->first,':');\\n\\t\\tvector<Point> vec=it->second;\\n\\t\\tfor(int i=0;i<vec.size();i++){\\n\\t\\t\\tprint(vec[i]);\\n\\t\\t}\\n\\t}*/\\n\\tfor(int i=0;i+1<ys.size();i++){\\n\\t\\tPoint p=Point(x,ys[i]);\\n\\t\\tPoint q=Point(x,ys[i+1]);\\n\\t\\tvector<Point> poly;\\n\\t\\tstroke(poly,p,q,p);\\n\\t\\tpoly.push_back(poly[0]);\\n\\t\\t//bool flg=isRight(poly,x);\\n\\t\\tint side=whichSide(poly,x);\\n\\t\\tReal area=getArea(poly);/*\\n\\t\\tif(flg) ri=max(ri,area);\\n\\t\\telse {}//le=max(le,area);*/\\n\\t\\tbool flg=isValid_(poly);\\n\\t\\tif(side==1&&flg) ri=max(ri,area);\\n\\t\\t//print(poly);\\n\\t\\t\\n\\t\\tpoly.clear();\\n\\t\\tstroke(poly,q,p,q);\\n\\t\\tpoly.push_back(poly[0]);\\n\\t\\t//print(poly);\\n\\t\\t//flg=isRight(poly,x);\\n\\t\\tside=whichSide(poly,x);\\n\\t\\tarea=getArea(poly);/*\\n\\t\\tif(flg) {}//ri=max(ri,area);\\n\\t\\telse le=max(le,area);*/\\n\\t\\tflg=isValid_(poly);\\n\\t\\tif(side==-1&&flg) le=max(le,area);\\n\\t}\\n\\treturn make_pair(le,ri);\\n}\\n\\nReal calcEdgeCase(){\\n\\tReal res=getArea(poly);\\n\\tfor(int i=1;i+1<xs.size();i++){\\n\\t\\tpair<Real,Real> p=calcArea(xs[i]);\\n\\t//\\tprintf(\\\"%f %f %f\\\\n\\\",xs[i],p.first,p.second);\\n\\t\\tres=min(res,max(p.first,p.second));\\n\\t}\\n\\treturn res;\\n}\\n\\nReal calc(Real lb,Real ub,Real cur_best){\\n\\tReal res=inf;\\n\\tpair<Real,Real> p1,p2;\\n\\tp1=calcArea(lb);\\n\\tp2=calcArea(ub);\\n//\\tprintf(\\\"a%f %f %f\\\\n\\\",lb,ub,cur_best);\\n\\tif(lb>ub) return cur_best;\\n\\t//if(max(p1.first,p1.second)>cur_best||max(p2.first,p2.second)>cur_best) return cur_best;\\n\\tif(p1.first>p1.second) return min(cur_best,p1.first);\\n\\tif(p2.first<p2.second) return min(cur_best,p2.second);\\n\\tfor(int stage=0;stage<100;stage++){\\n\\t\\tReal mid=(ub+lb)/2;\\n\\t\\tpair<Real,Real> p=calcArea(mid);\\n\\t\\tif(p.first>0&&p.second>0){\\n\\t\\t\\tres=min(res,max(p.first,p.second));\\n\\t\\t}\\n\\t\\tif(p.first==0||p.second==0){\\n\\t\\t\\tif(stage<50){\\n\\t\\t\\t\\tReal tmp=cur_best;\\n\\t\\t\\t\\tReal a=calc(lb+eps,mid-eps,tmp);\\n\\t\\t\\t\\ttmp=min(tmp,a);\\n\\t\\t\\t\\ta=calc(mid+eps,ub-eps,tmp);\\n\\t\\t\\t\\ttmp=min(tmp,a);\\n\\t\\t\\t\\treturn tmp;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tprintf(\\\"%f %f %f\\\\n\\\",mid,p.first,p.second);\\n\\t\\tif(p.first<p.second){\\n\\t\\t\\tlb=mid;\\n\\t\\t}else{\\n\\t\\t\\tub=mid;\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nReal solve(){\\n\\trot();\\n\\tReal res=calcEdgeCase();\\n\\t//printf(\\\"edge case best = %f\\\\n\\\",res);\\n/*\\tfor(int i=0;i+1<xs.size();i++){\\n\\t\\tReal lb=xs[i]+eps2,ub=xs[i+1]-eps2;\\n\\t\\tReal tmp=calc(lb,ub,res);\\n\\t\\tres=min(res,tmp);\\n\\t}*/\\n\\tReal l=inf,r=-inf;\\n\\tvector<Real> xs;\\n\\tfor(int i=0;i+1<poly.size();i++){\\n\\t\\tl=min(l,poly[i].real());\\n\\t\\tr=max(r,poly[i].real());\\n\\t\\tPoint p=poly[i],q=poly[i+1],r=poly[i+2>=poly.size()?0:i+2];\\n\\t\\tif(crP(p-q,r-q)>0){\\n\\t\\t\\tif(p.real()==q.real()||q.real()==r.real()) continue;\\n\\t\\t\\tif(p.real()<q.real()!=q.real()<r.real()){\\n\\t\\t\\t\\txs.push_back(q.real());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\txs.push_back(l);\\n\\txs.push_back(r);\\n\\tsort(xs.begin(),xs.end());\\n\\tfor(int i=0;i+1<xs.size();i++){\\n\\t\\tReal lb=xs[i]+eps2,ub=xs[i+1]-eps2;\\n\\t\\tReal tmp=calc(lb,ub,res);\\n\\t\\tres=min(res,tmp);\\n\\t}\\n\\treturn res;\\n}\\n\\nvoid init(){\\n\\tpoly.clear();\\n\\txs.clear();\\n\\tys.clear();\\n\\tmap<Point,vector<Point>,PLexCmp> tmp;\\n\\tswap(con_pts,tmp);\\n}\\n\\nvoid input(){\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\tif(N==0) exit(0);\\n\\tint x,y;\\n\\tscanf(\\\"%d%d\\\",&x,&y);\\n\\tvec=Point(x,y);\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tint x,y;\\n\\t\\tscanf(\\\"%d%d\\\",&x,&y);\\n\\t\\tpoly.push_back(Point(x,y));\\n\\t}\\n\\tpoly.push_back(poly[0]);\\n\\tcnt++;\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tinit();\\n\\t\\tinput();\\n\\t\\tReal ans=solve();\\n\\t\\tprintf(\\\"%f\\\\n\\\",ans);\\n//\\t\\tcout<<ans<<\\\"\\\\n\\\";\\n//\\t\\tbreak;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1470,\n \"memory_kb\": 1496,\n \"score_of_the_acc\": -0.2992,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2184_1428469\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\n#include<math.h>\\nusing namespace std;\\nconst long double EPS = 1e-15;\\nconst long double INF = 1e+10;\\nconst long double PI = acos(-1);\\nint sig(long double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\\ninline long double ABS(long double a){return max(a,-a);}\\nstruct Pt {\\n\\tlong double x, y;\\n\\tPt() {}\\n\\tPt(long double x, long double y) : x(x), y(y) {}\\n\\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\\n\\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\\n\\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\tPt operator-() const { return Pt(-x, -y); }\\n\\tPt operator*(const long double &k) const { return Pt(x * k, y * k); }\\n\\tPt operator/(const long double &k) const { return Pt(x / k, y / k); }\\n\\tlong double ABS() const { return sqrt(x * x + y * y); }\\n\\tlong double abs2() const { return x * x + y * y; }\\n\\tlong double arg() const { return atan2(y, x); }\\n\\tlong double dot(const Pt &a) const { return x * a.x + y * a.y; }\\n\\tlong double det(const Pt &a) const { return x * a.y - y * a.x; }\\n};\\nlong double tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\\nint iSP(Pt a, Pt b, Pt c) {\\n\\tint s = sig((b - a).det(c - a));\\n\\tif (s) return s;\\n\\tif (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b\\n\\tif (sig((a - b).dot(c - b)) < 0) return +2; // a-b-c\\n\\treturn 0;\\n}\\nint iLL(Pt a, Pt b, Pt c, Pt d) {\\n\\tif (sig((b - a).det(d - c))) return 1; // intersect\\n\\tif (sig((b - a).det(c - a))) return 0; // parallel\\n\\treturn -1; // correspond\\n}\\nbool iLS(Pt a, Pt b, Pt c, Pt d) {\\n\\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) <= 0);\\n}\\nbool iSS(Pt a, Pt b, Pt c, Pt d) {\\n\\treturn (iSP(a, b, c) * iSP(a, b, d) <= 0 && iSP(c, d, a) * iSP(c, d, b) <= 0);\\n}\\nbool iSSstrict(Pt a, Pt b, Pt c, Pt d) {\\n\\treturn (sig(tri(a, b, c)) * sig(tri(a, b, d)) < 0 && sig(tri(c, d, a)) * sig(tri(c, d, b)) < 0);\\n}\\nPt pLL(Pt a, Pt b, Pt c, Pt d) {\\n\\tb = b - a; d = d - c; return a + b * (c - a).det(d) / b.det(d);\\n}\\n\\n\\nPt p[110];\\nPt v;\\nint n;\\nlong double z[110];\\npair<long double,int>ev[110];\\nint vis[110];\\nint to[110];\\nlong double tx[110];\\nlong double fx[110];\\n\\nlong double calc2(long double y,int d){\\n\\tlong double ret=0;\\n\\tint now=0;\\n\\tint sz=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(iLS(Pt(0,y),Pt(1,y),p[i],p[i+1])){\\n\\t\\t\\tev[sz++]=make_pair(pLL(Pt(0,y),Pt(1,y),p[i],p[i+1]).x,i);\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<n;i++)to[i]=-1;\\n\\tstd::sort(ev,ev+sz);\\n\\t//printf(\\\"%d\\\\n\\\",sz);\\n\\tfor(int i=0;i<sz;i++){\\n\\t\\tto[ev[i].second]=ev[i^1].second;\\n\\t\\ttx[ev[i].second]=ev[i^1].first;\\n\\t\\tfx[ev[i].second]=ev[i].first;\\n\\t}\\n\\tfor(int i=0;i<n;i++)vis[i]=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tif(vis[i])continue;\\n\\t\\tif(d==0&&p[i].y>y)continue;\\n\\t\\tif(d==1&&p[i].y<y)continue;\\n\\t\\tlong double val=0;\\n\\t\\tint at=i;\\n\\t\\tPt pos=p[i];\\n\\t\\tbool fl=true;\\n\\t\\twhile(1){\\n\\t\\t\\tif(fl)vis[at]=1;\\n\\t\\t\\tif(fl&&~to[at]){\\n\\t\\t\\t\\tfl=false;\\n\\t\\t\\t\\tval+=pos.det(Pt(fx[at],y));\\n\\t\\t\\t\\tval+=(Pt(fx[at],y)).det(Pt(Pt(tx[at],y)));\\n\\t\\t\\t\\tpos=Pt(tx[at],y);\\n\\t\\t\\t\\tat=to[at];\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfl=true;\\n\\t\\t\\t\\tval+=pos.det(p[at+1]);\\n\\t\\t\\t\\tat=(at+1)%n;\\n\\t\\t\\t\\tpos=p[at];\\n\\t\\t\\t}\\n\\t\\t\\tif(fl&&vis[at])break;\\n\\t\\t}\\n\\t\\tif(val<0)val=-val;\\n//\\t\\tif(val<0)printf(\\\"%Lf\\\\n\\\",val);\\n\\t\\tret=max(ret,val/2);\\n\\t}\\n\\t//if(ret<1)printf(\\\"%Lf %d: %Lf\\\\n\\\",y,d,ret);\\n\\treturn ret;\\n}\\nlong double calc(long double y){\\n\\treturn max(calc2(y-EPS*10000,0),calc2(y+EPS*10000,1));\\n}\\nint main(){\\n\\tint a;\\n\\twhile(scanf(\\\"%d\\\",&a),a){\\n\\t\\tn=a;\\n\\t\\tfor(int i=0;i<110;i++)p[i]=Pt(0,0);\\n\\t\\tv=Pt(0,0);\\n\\t\\tlong double X,Y;\\n\\t\\tscanf(\\\"%Lf%Lf\\\",&X,&Y);\\n\\t\\tv=Pt(X,Y);\\n\\t\\tlong double th=v.arg();\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tscanf(\\\"%Lf%Lf\\\",&X,&Y);\\n\\t\\t\\tp[i]=Pt(X,Y);\\n\\t\\t\\tp[i]=p[i]*Pt(cos(th),-sin(th));\\n\\t\\t\\tz[i]=p[i].y;\\n\\t\\t//\\tprintf(\\\"%Lf %Lf\\\\n\\\",p[i].x,p[i].y);\\n\\t\\t}\\n\\t\\t\\n\\t\\tp[a]=p[0];\\n\\t\\tstd::sort(z,z+a);\\n\\t\\tlong double ret=999999999;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tif(i==0||sig(z[i]-z[i-1])==0)continue;\\n\\t\\t\\tret=min(ret,calc(z[i]));\\n\\n\\t\\t\\tlong double left=z[i-1];\\n\\t\\t\\tlong double right=z[i];\\n\\t\\t\\tfor(int j=0;j<100;j++){\\n\\t\\t\\t\\tlong double M1=calc((left*2+right)/3);\\n\\t\\t\\t\\tlong double M2=calc((left+right*2)/3);\\n\\t\\t\\t\\tret=min(ret,min(M1,M2));\\n\\t\\t\\t\\tif(M1>M2)left=(left*2+right)/3;\\n\\t\\t\\t\\telse right=(right*2+left)/3;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.12Lf\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1320,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.171,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2184_1161283\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <assert.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nnamespace geom{\\n#define X real()\\n#define Y imag()\\n#define at(i) ((*this)[i])\\n#define SELF (*this)\\n\\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\\n\\ttypedef int BOOL;\\n\\ttypedef long double R;\\n\\tconst R INF = 1e8;\\n\\tR EPS = 1e-15;\\n\\tconst R PI = 3.1415926535897932384626;\\n\\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n\\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\\n\\ttypedef complex<R> P;\\n\\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\\n\\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\\n\\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\\n\\tinline P unit(const P& p){return p/abs(p);}\\n\\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\\n\\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\\n\\t\\tint res = sig(outp(t-s, p-s));\\n\\t\\tif(res || !adv) return res;\\n\\t\\tif(sig(inp(t-s, p-s)) < 0) return -2;\\t// p-s-t\\n\\t\\tif(sig(inp(s-t, p-t)) < 0) return 2;\\t// s-t-p\\n\\t\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// s-p-t\\n\\t}\\n\\t\\n\\t\\n\\tstruct L : public vector<P>{\\t// line\\n\\t\\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\\n\\t\\tL(){}\\n\\t\\tP dir()const {return at(1) - at(0);}\\n\\t\\tBOOL online(const P &p)const {return !sig(outp(p-at(0), dir()));}\\n\\t};\\n\\tstruct S : public L{\\t// segment\\n\\t\\tS(const P &p1, const P &p2):L(p1, p2){}\\n\\t\\tS(){}\\n\\t\\tBOOL online(const P &p)const {\\n\\t\\t\\tif(!sig(norm(p - at(0))) || !sig(norm(p - at(1)))) return BORDER;\\n\\t\\t\\t// 座標の二乗とEPSの差が大きすぎないように注意\\n\\t\\t\\treturn !sig(outp(p-at(0), dir())) && inp(p-at(0), dir()) > EPS && inp(p-at(1), -dir()) > -EPS;\\n\\t\\t\\t//return !sig(abs(at(0)-p) + abs(at(1) - p) - abs(at(0) - at(1)));\\n\\t\\t}\\n\\t};\\n\\tP crosspoint(const L &l, const L &m);\\n\\tstruct G : public vector<P>{\\n\\t\\tG(size_type size=0):vector(size){}\\n\\t\\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\\n\\t\\tBOOL contains(const P &p)const {\\n\\t\\t\\tR sum = .0;\\n\\t\\t\\tREP(i, size()){\\n\\t\\t\\t\\tif(S(at(i), at((i+1)%size())).online(p)) return BORDER;\\t// online\\n\\t\\t\\t\\tsum += arg((at(i) - p) / (at((i+1)%size()) - p));\\n\\t\\t\\t}\\n\\t\\t\\treturn !!sig(sum);\\n\\t\\t}\\n\\t\\tR area()const {\\n\\t\\t\\tR sum = 0;\\n\\t\\t\\tREP(i, size()) sum += outp(at(i), at((i+1)%size()));\\n\\t\\t\\treturn abs(sum / 2.);\\n\\t\\t}\\n\\t};\\n\\n\\tinline P proj(const P &s, const L &t){return t[0] + proj(s-t[0], t[1]-t[0]);}\\n\\tinline P reflect(const P &s, const L &t){return (R)2.*proj(s, t) - s;}\\n\\tinline S reflect(const S &s, const L &t){return S(reflect(s[0], t), reflect(s[1], t));}\\n\\tBOOL intersect(const S &s, const S &t){\\n\\t\\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\\n\\t\\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\\n\\t\\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\\n\\t}\\n\\tBOOL intersect(const S &s, const L &l){\\n\\t\\tif(l.online(s[0]) || l.online(s[1])) return BORDER;\\n\\t\\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\\n\\t}\\n\\tinline P crosspoint(const L &l, const L &m){\\n\\t\\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\\n\\t\\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\\n\\t\\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n\\t\\treturn m[0] + B / A * (m[1] - m[0]);\\n\\t}\\n\\tstruct DualGraph{\\n\\t\\tstruct DEdge{\\n\\t\\t\\tint u, v, f, l;\\n\\t\\t\\tR a;\\n\\t\\t\\tDEdge(int u, int v, R a):u(u),v(v),f(0),l(0){\\n\\t\\t\\t\\twhile(PI < a) a -= 2*PI;\\n\\t\\t\\t\\twhile(a < -PI) a += 2*PI;\\n\\t\\t\\t\\tthis->a = a;\\n\\t\\t\\t}\\n\\t\\t\\tbool operator==(const DEdge &opp) const{\\n\\t\\t\\t\\treturn v==opp.v;\\n\\t\\t\\t}\\n\\t\\t\\tbool operator<(const DEdge &opp) const{\\n\\t\\t\\t\\treturn a>opp.a;\\n\\t\\t\\t}\\n\\t\\t\\tbool operator<(const R &opp) const{\\n\\t\\t\\t\\treturn a>opp;\\n\\t\\t\\t}\\n\\t\\t\\tfriend ostream& operator<<(ostream &os, const DEdge &t) { return os<<\\\"(\\\"<<t.u<<\\\",\\\"<<t.v<<\\\",\\\"<<t.a*180/PI<<\\\")\\\";}\\n\\t\\t};\\n\\t\\t\\n\\t\\tint n;\\n\\t\\tvector<P> p;\\n\\t\\tvector<vector<DEdge>> g;\\n\\t\\tDualGraph(const vector<P> &p):p(p),g(p.size()),n(p.size()){}\\n\\t\\tvoid add_edge(const int s, const int t){\\n\\t\\t\\tR a = arg(p[t]-p[s]);\\n\\t\\t\\tg[s].emplace_back(s, t, a);\\n\\t\\t\\tg[t].emplace_back(t, s, a > 0 ? a-PI : a+PI);\\n\\t\\t}\\n\\t\\tvector<G> poly;\\n\\t\\t\\n\\t\\tvoid add_polygon(int s, int t, R a){\\n\\t\\t\\tauto e = lower_bound(ALL(g[s]), a-EPS);\\n\\t\\t\\tif(e == g[s].end()) e = g[s].begin();\\n\\t\\t\\tif(e->f) return;\\n\\t\\t\\te->f = 1;\\n\\t\\t\\te->l = t;\\n\\t\\t\\tpoly[t].push_back(p[s]);\\n\\t\\t\\tadd_polygon(e->v, t, e->a > 0 ? e->a-PI : e->a+PI);\\n\\t\\t}\\n\\t\\t\\n\\t\\tvector<G>& dual(){\\n\\t\\t\\tREP(i, n){\\n\\t\\t\\t\\tsort(ALL(g[i]));\\n\\t\\t\\t\\tUNIQUE(g[i]);\\n\\t\\t\\t}\\n\\t\\t\\tint s = min_element(ALL(p)) - p.begin();\\n\\t\\t\\tpoly.emplace_back();\\n\\t\\t\\tadd_polygon(s, poly.size()-1, -PI*(R).5);\\n\\t\\t\\tREP(i, n)REP(j, g[i].size())if(!g[i][j].f){\\n\\t\\t\\t\\tpoly.emplace_back();\\n\\t\\t\\t\\tadd_polygon(i, poly.size()-1, g[i][j].a+2.*EPS);\\n\\t\\t\\t}\\n\\t\\t\\treturn poly;\\n\\t\\t}\\n\\t};\\n\\ttemplate<class Func> R simpson(R s, R t, Func func){\\n\\t\\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\\n\\t}\\n\\n#undef SELF\\n#undef at\\n}\\n\\nusing namespace geom;\\n\\nint f = 0;\\nnamespace std{\\n\\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\\n\\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\\n\\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\\n\\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\\n}\\n\\nint n;\\nG g;\\nR minarea(R x, int f = 0){\\n\\tvector<P> p = g;\\n\\tL xl(P(x, 0), P(x, 1));\\n\\tvector<pair<P, int>> ip;\\n\\tvector<pii> segs;\\n\\tREP(i, n){\\n\\t\\tconst S &s = g.edge(i);\\n\\t\\tif(sig(s.dir().X) && intersect(s, xl)){\\n\\t\\t\\tP cp = crosspoint(s, xl);\\n\\t\\t\\tif(!sig(norm(cp-s[0]))) ip.emplace_back(s[0], i);\\n\\t\\t\\telse if(!sig(norm(cp-s[1]))) ip.emplace_back(s[1], (i+1)%n);\\n\\t\\t\\telse{\\n\\t\\t\\t\\tsegs.emplace_back(i, p.size());\\n\\t\\t\\t\\tsegs.emplace_back(p.size(), (i+1)%n);\\n\\t\\t\\t\\tip.emplace_back(cp, p.size());\\n\\t\\t\\t\\tp.push_back(cp);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsegs.emplace_back(i, (i+1)%n);\\n\\t}\\n\\tsort(ALL(ip));\\n\\tREP(i, (int)ip.size()-1){\\n\\t\\tif(ip[i].second != ip[i+1].second && g.contains((ip[i].first + ip[i+1].first) * (R).5))\\n\\t\\t\\tsegs.emplace_back(ip[i].second, ip[i+1].second);\\n\\t}\\n\\tDualGraph dg(p);\\n\\tFOR(it, segs) dg.add_edge(it->first, it->second);\\n\\tconst vector<G> &poly = dg.dual();\\n\\tR ans = .0;\\n\\tREPS(i, (int)poly.size()-1) ans = max(ans, poly[i].area());\\n\\treturn ans;\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\twhile(cin >> n, n){\\n\\t\\tP v;\\n\\t\\tg.resize(n);\\n\\t\\tcin >> v; v = unit(v);\\n\\t\\tvector<R> x;\\n\\t\\tREP(i, n){\\n\\t\\t\\tcin >> g[i];\\n\\t\\t\\tg[i] *= P(0, 1) / v;\\n\\t\\t\\tx.push_back(g[i].X);\\n\\t\\t}\\n\\t\\tsort(ALL(x)); UNIQUE(x);\\n\\t\\tR ans = INF, ansx = .0;\\n\\t\\tREP(i, (int)x.size() - 1){\\n\\t\\t\\tans = min(ans, minarea(x[i]));\\n\\t\\t\\tif(minarea(x[i]) < minarea(x[i]+1e-5) || minarea(x[i+1]) < minarea(x[i+1]-1e-5)) continue;\\n\\t\\t\\tR l = x[i], r = x[i+1];\\n\\t\\t\\twhile(r-l > 1e-6){\\n\\t\\t\\t\\tR ml = minarea((2*l+r)/3);\\n\\t\\t\\t\\tR mr = minarea((l+2*r)/3);\\n\\t\\t\\t\\tans = min(ans, ml);\\n\\t\\t\\t\\tans = min(ans, mr);\\n\\t\\t\\t\\tif(ml < mr) r = (l+2*r)/3;\\n\\t\\t\\t\\telse l = (2*l+r)/3;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10f\\\\n\\\", (double)ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1290,\n \"memory_kb\": 1420,\n \"score_of_the_acc\": -0.2489,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1190,"cells":{"group_id":{"kind":"string","value":"aoj_2187_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nカードゲーム\nねこのゲイツとジャッキーは、2人で遊ぶカードゲームのルールを考えた。そのルールとは次のようなものである。\nまず、1から18の数字が書かれたカードをシャッフルし、それぞれのプレーヤーに9枚ずつ配る。両者は同時に1枚のカードを同時に出し、その値によってスコアを得る。値の大きいカードを出したプレーヤーは、大きい方の値と小さい方の値の和を自分のスコアに加える。その際、値の小さいカードを出したプレーヤーはスコアを得られない。また、一度場に出されたカードは二度と使うことはできない。カードをすべて使い終わった後にスコアが大きかったプレーヤーの勝ちとする。\nゲイツとジャッキーは互いに無作為にカードを選んで出してみることにした。最初に配られたカードが与えられたとき、ゲイツとジャッキーが勝つ確率をそれぞれ求めよ。\nInput\nゲイツ、ジャッキーそれぞれの手札は、9個の整数からなる。両プレーヤーの手札は1から18までの互いに異なる整数である。入力の1行目にはゲイツの手札を表す9個の整数が与えられ、2行目にはジャッキーの手札を表す9個の整数が与えられる。整数と整数の間は空白1個で区切られる。\nOutput\nゲイツ、ジャッキーが勝つ確率をそれぞれ、スペースで区切って小数点以下5桁まで出力せよ。 10\n-5\n以内の誤差は許容されるが、0未満あるいは1を越える値を出力してはならない。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n2\n1 3 5 7 9 11 13 15 17\n2 4 6 8 10 12 14 16 18\n1 5 7 9 11 13 15 17 18\n2 3 4 6 8 10 12 14 16\nOutput for the Sample Input\n0.30891 0.69109\n0.92747 0.07253"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2187_9066307","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nvector<int> a(9),b(9);\nint aw=0,bw=0;\n\nvoid ck(int k,int usd,int as,int bs){\n for(int i=0;i<9;i++){\n if((usd&(1<<i))!=0) continue;\n //cout << k << \" \" << i << endl;\n int usd1=(usd|(1<<i));\n int as1=as,bs1=bs;\n if(a[k]>b[i]) as1+=(a[k]+b[i]);\n else bs1+=(a[k]+b[i]);\n \n if(k==8){\n (as1>bs1 ? aw++ : bw++);\n return;\n }\n\n ck(k+1,usd1,as1,bs1);\n \n }\n return;\n}\n\nint main(){\n\n int n;\n cin >> n;\n for(int s=0;s<n;s++){\n for(int &x:a) cin >> x;\n for(int &x:b) cin >> x;\n\n aw=0;bw=0;\n vector<int> c(9);\n ck(0,0,0,0);\n //cout << aw << \" \" << aw+bw << endl;\n cout << fixed << setprecision(5) << (double)aw/(aw+bw) << \" \" << (double)bw/(aw+bw) << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3500,"score_of_the_acc":-0.3203,"final_rank":5},{"submission_id":"aoj_2187_9065112","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nvector<int> a(9),b(9);\nint aw=0,bw=0;\n\nvoid ck(int k,int usd,vector<int> c){\n vector<int> c1;\n for(int i=0;i<9;i++){\n if((usd&(1<<i))!=0) continue;\n //cout << k << \" \" << i << endl;\n int usd1=(usd|(1<<i));\n c1=c;\n c1[k]=i;\n if(k==8){\n int as=0,bs=0;\n for(int j=0;j<9;j++){ \n if(a[j]>b[c1[j]]) as+=(a[j]+b[c1[j]]);\n //bs+=(a[j]+b[c1[j]]);\n }\n //cout << as << \" \" << bs << endl;\n (as>85 ? aw++ : bw++);\n return;\n }\n\n ck(k+1,usd1,c1);\n \n }\n return;\n}\n\nint main(){\n\n int n;\n cin >> n;\n for(int s=0;s<n;s++){\n for(int &x:a) cin >> x;\n for(int &x:b) cin >> x;\n sort(b.begin(),b.end());\n\n aw=0;bw=0;\n vector<int> c(9);\n ck(0,0,c);\n //cout << aw << \" \" << aw+bw << endl;\n cout << fixed << setprecision(5) << (double)aw/(aw+bw) << \" \" << (double)bw/(aw+bw) << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":900,"memory_kb":3472,"score_of_the_acc":-0.8388,"final_rank":18},{"submission_id":"aoj_2187_8860748","code_snippet":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int a[2][9];\n double winrate1 = 0, winrate2 = 0;\n\n for (int j = 0; j < 2; j++)\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n\n sort(a[1], a[1] + 9);\n do {\n int geitu = 0, jacky = 0;\n for (int z = 0; z < 9; z++) {\n if (a[0][z] > a[1][z])\n geitu += a[0][z] + a[1][z];\n else\n jacky += a[0][z] + a[1][z];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n } while (next_permutation(a[1], a[1] + 9));\n\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3172,"score_of_the_acc":-0.0407,"final_rank":1},{"submission_id":"aoj_2187_8822143","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n }\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":740,"memory_kb":3184,"score_of_the_acc":-0.5187,"final_rank":8},{"submission_id":"aoj_2187_8809459","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\n\nvoid calculateWinRate(int index, int permutation[], double& winrate1, double& winrate2, int a[][9]) {\n if (index == 9) {\n int num[2][9] = {{0}};\n for (int i = 0; i < 9; i++) {\n if (a[0][i] > a[1][permutation[i]])\n num[0][i] = (a[0][i] + a[1][permutation[i]]);\n else\n num[1][i] = (a[0][i] + a[1][permutation[i]]);\n }\n int geitu = 0, jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n } else {\n for (int i = 0; i < 9; i++) {\n bool found = false;\n for (int j = 0; j < index; j++) {\n if (permutation[j] == i) {\n found = true;\n break;\n }\n }\n if (!found) {\n permutation[index] = i;\n calculateWinRate(index + 1, permutation, winrate1, winrate2, a);\n }\n }\n }\n}\n\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int a[2][9];\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n double winrate1 = 0, winrate2 = 0;\n int permutation[9];\n calculateWinRate(0, permutation, winrate1, winrate2, a);\n double ans = winrate1 / 362880;\n double ans2 = winrate2 / 362880;\n cout << fixed;\n cout.precision(5);\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":1430,"memory_kb":3276,"score_of_the_acc":-1.105,"final_rank":20},{"submission_id":"aoj_2187_8216146","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <iomanip>\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<int> permutation(9);\n\n for (int i = 0; i < n; i++) {\n int a[2][9];\n for (int j = 0; j < 2; j++)\n for (int k = 0; k < 9; k++)\n std::cin >> a[j][k];\n\n std::sort(a[0], a[0] + 9);\n std::sort(a[1], a[1] + 9);\n\n for (int j = 0; j < 9; j++)\n permutation[j] = j;\n\n double winrate1 = 0, winrate2 = 0;\n do {\n int sum1 = 0, sum2 = 0;\n for (int j = 0; j < 9; j++) {\n if (a[0][j] > a[1][permutation[j]])\n sum1 += a[0][j] + a[1][permutation[j]];\n else\n sum2 += a[0][j] + a[1][permutation[j]];\n }\n if (sum1 > sum2)\n winrate1++;\n else if (sum1 < sum2)\n winrate2++;\n } while (std::next_permutation(permutation.begin(), permutation.end()));\n\n std::cout << std::fixed << std::setprecision(5) << winrate1 / 362880 << \" \" << winrate2 / 362880 << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3232,"score_of_the_acc":-0.0897,"final_rank":2},{"submission_id":"aoj_2187_8216142","code_snippet":"#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3200,"score_of_the_acc":-0.5525,"final_rank":10},{"submission_id":"aoj_2187_8216141","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3272,"score_of_the_acc":-0.6022,"final_rank":17},{"submission_id":"aoj_2187_8116304","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = num[1][1] = 0;\n int ai0 = a[0][1], ai1 = a[1][b];\n if (ai0 > ai1) {\n num[0][1] = ai0 + ai1;\n } else {\n num[1][1] = ai0 + ai1;\n }\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = num[1][2] = 0;\n ai0 = a[0][2], ai1 = a[1][c];\n if (ai0 > ai1) {\n num[0][2] = ai0 + ai1;\n } else {\n num[1][2] = ai0 + ai1;\n }\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = num[1][3] = 0;\n ai0 = a[0][3], ai1 = a[1][d];\n if (ai0 > ai1) {\n num[0][3] = ai0 + ai1;\n } else {\n num[1][3] = ai0 + ai1;\n }\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = num[1][4] = 0;\n ai0 = a[0][4], ai1 = a[1][e];\n if (ai0 > ai1) {\n num[0][4] = ai0 + ai1;\n } else {\n num[1][4] = ai0 + ai1;\n }\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = num[1][5] = 0;\n ai0 = a[0][5], ai1 = a[1][f];\n if (ai0 > ai1) {\n num[0][5] = ai0 + ai1;\n } else {\n num[1][5] = ai0 + ai1;\n }\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = num[1][6] = 0;\n ai0 = a[0][6], ai1 = a[1][g];\n if (ai0 > ai1) {\n num[0][6] = ai0 + ai1;\n } else {\n num[1][6] = ai0 + ai1;\n }\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = num[1][7] = 0;\n ai0 = a[0][7], ai1 = a[1][h];\n if (ai0 > ai1) {\n num[0][7] = ai0 + ai1;\n } else {\n num[1][7] = ai0 + ai1;\n }\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = num[1][8] = 0;\n ai0 = a[0][8], ai1 = a[1][i];\n if (ai0 > ai1) {\n num[0][8] = ai0 + ai1;\n } else {\n num[1][8] = ai0 + ai1;\n }\n geitu = jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3124,"score_of_the_acc":-0.5,"final_rank":6},{"submission_id":"aoj_2187_8116301","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = num[0][0] + num[0][1] + num[0][2] + num[0][3] + num[0][4] + num[0][5] + num[0][6] + num[0][7] + num[0][8];\n jacky = num[1][0] + num[1][1] + num[1][2] + num[1][3] + num[1][4] + num[1][5] + num[1][6] + num[1][7] + num[1][8];\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":720,"memory_kb":3196,"score_of_the_acc":-0.5118,"final_rank":7},{"submission_id":"aoj_2187_8116300","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvoid playGame(int a[2][9], int z, vector<int>& nums, double& winrate1, double& winrate2) {\n int num[2][9];\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int i = 1; i < 9; i++) {\n num[0][i] = 0;\n num[1][i] = 0;\n }\n for (int i = 1; i < 9; i++) {\n int j = nums[i - 1];\n if (j <= z)\n j--;\n if (a[0][i] > a[1][j])\n num[0][i] = (a[0][i] + a[1][j]);\n else\n num[1][i] = (a[0][i] + a[1][j]);\n }\n int geitu = 0, jacky = 0;\n for (int i = 0; i < 9; i++) {\n geitu += num[0][i];\n jacky += num[1][i];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n}\n\nvoid permute(vector<int>& nums, int l, int r, int a[2][9], double& winrate1, double& winrate2) {\n if (l == r) {\n for (int i = 0; i < 9; i++) {\n playGame(a, i, nums, winrate1, winrate2);\n }\n }\n else {\n for (int i = l; i <= r; i++) {\n swap(nums[l], nums[i]);\n permute(nums, l + 1, r, a, winrate1, winrate2);\n swap(nums[l], nums[i]); // backtrack\n }\n }\n}\n\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int a[2][9];\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n vector<int> nums(8);\n for (int i = 0; i < 8; i++) {\n nums[i] = i + 1;\n }\n double winrate1 = 0, winrate2 = 0;\n permute(nums, 0, 7, a, winrate1, winrate2);\n double ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n double ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":3180,"score_of_the_acc":-0.1447,"final_rank":3},{"submission_id":"aoj_2187_8116299","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\n\nvoid calculateWinRate(int a[2][9], double& winrate1, double& winrate2) {\n int num[2][9];\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e || h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e || i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n int geitu = 0;\n int jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n}\n\nint main() {\n int n;\n cin >> n;\n double winrate1 = 0, winrate2 = 0;\n for (int l = 0; l < n; l++) {\n int a[2][9];\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n calculateWinRate(a, winrate1, winrate2);\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n winrate1 = 0;\n winrate2 = 0;\n }\n return 0;\n}","accuracy":1,"time_ms":810,"memory_kb":3192,"score_of_the_acc":-0.5773,"final_rank":13},{"submission_id":"aoj_2187_8116298","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = num[0][0];\n num[1][1] = num[1][0];\n if (a[0][1] > a[1][b])\n num[0][1] += (a[0][1] + a[1][b]);\n else\n num[1][1] += (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = num[0][1];\n num[1][2] = num[1][1];\n if (a[0][2] > a[1][c])\n num[0][2] += (a[0][2] + a[1][c]);\n else\n num[1][2] += (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = num[0][2];\n num[1][3] = num[1][2];\n if (a[0][3] > a[1][d])\n num[0][3] += (a[0][3] + a[1][d]);\n else\n num[1][3] += (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = num[0][3];\n num[1][4] = num[1][3];\n if (a[0][4] > a[1][e])\n num[0][4] += (a[0][4] + a[1][e]);\n else\n num[1][4] += (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = num[0][4];\n num[1][5] = num[1][4];\n if (a[0][5] > a[1][f])\n num[0][5] += (a[0][5] + a[1][f]);\n else\n num[1][5] += (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = num[0][5];\n num[1][6] = num[1][5];\n if (a[0][6] > a[1][g])\n num[0][6] += (a[0][6] + a[1][g]);\n else\n num[1][6] += (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = num[0][6];\n num[1][7] = num[1][6];\n if (a[0][7] > a[1][h])\n num[0][7] += (a[0][7] + a[1][h]);\n else\n num[1][7] += (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = num[0][7];\n num[1][8] = num[1][7];\n if (a[0][8] > a[1][i])\n num[0][8] += (a[0][8] + a[1][i]);\n else\n num[1][8] += (a[0][8] + a[1][i]);\n geitu = num[0][8];\n jacky = num[1][8];\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3236,"score_of_the_acc":-0.5773,"final_rank":14},{"submission_id":"aoj_2187_8116296","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = 1 - ans; // winrate2 = 1 - winrate1, so we can simply calculate this way\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":760,"memory_kb":3180,"score_of_the_acc":-0.5311,"final_rank":9},{"submission_id":"aoj_2187_8116295","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880.0;\n ans *= 100000.0;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000.0;\n ans2 = winrate2 / 362880.0;\n ans2 *= 100000.0;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000.0;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3208,"score_of_the_acc":-0.558,"final_rank":11},{"submission_id":"aoj_2187_8116293","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu = 0, jacky = 0;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++) {\n cin >> a[j][k];\n if (j == 0) {\n num[0][k] = 0;\n num[1][k] = 0;\n }\n }\n }\n for (int z = 0; z < 9; z++) {\n if (a[0][0] > a[1][z]) {\n num[0][0] = (a[0][0] + a[1][z]);\n num[1][0] = 0;\n }\n else {\n num[0][0] = 0;\n num[1][0] = (a[0][0] + a[1][z]);\n }\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n if (a[0][1] > a[1][b]) {\n num[0][1] = (a[0][1] + a[1][b]);\n num[1][1] = 0;\n }\n else {\n num[0][1] = 0;\n num[1][1] = (a[0][1] + a[1][b]);\n }\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n if (a[0][2] > a[1][c]) {\n num[0][2] = (a[0][2] + a[1][c]);\n num[1][2] = 0;\n }\n else {\n num[0][2] = 0;\n num[1][2] = (a[0][2] + a[1][c]);\n }\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n if (a[0][3] > a[1][d]) {\n num[0][3] = (a[0][3] + a[1][d]);\n num[1][3] = 0;\n }\n else {\n num[0][3] = 0;\n num[1][3] = (a[0][3] + a[1][d]);\n }\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n if (a[0][4] > a[1][e]) {\n num[0][4] = (a[0][4] + a[1][e]);\n num[1][4] = 0;\n }\n else {\n num[0][4] = 0;\n num[1][4] = (a[0][4] + a[1][e]);\n }\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n if (a[0][5] > a[1][f]) {\n num[0][5] = (a[0][5] + a[1][f]);\n num[1][5] = 0;\n }\n else {\n num[0][5] = 0;\n num[1][5] = (a[0][5] + a[1][f]);\n }\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n if (a[0][6] > a[1][g]) {\n num[0][6] = (a[0][6] + a[1][g]);\n num[1][6] = 0;\n }\n else {\n num[0][6] = 0;\n num[1][6] = (a[0][6] + a[1][g]);\n }\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n if (a[0][7] > a[1][h]) {\n num[0][7] = (a[0][7] + a[1][h]);\n num[1][7] = 0;\n }\n else {\n num[0][7] = 0;\n num[1][7] = (a[0][7] + a[1][h]);\n }\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n if (a[0][8] > a[1][i]) {\n num[0][8] = (a[0][8] + a[1][i]);\n num[1][8] = 0;\n }\n else {\n num[0][8] = 0;\n num[1][8] = (a[0][8] + a[1][i]);\n }\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3216,"score_of_the_acc":-0.5635,"final_rank":12},{"submission_id":"aoj_2187_8116292","code_snippet":"#include <cstdlib>\n#include <iostream>\nusing namespace std;\nint main() {\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky, z, b, c, d, e, f, g, h, i;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3236,"score_of_the_acc":-0.5773,"final_rank":14},{"submission_id":"aoj_2187_8113257","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n;\n cin >> n;\n for (int l = 0; l < n; l++) {\n int num[2][9], a[2][9], geitu, jacky;\n double winrate1 = 0, winrate2 = 0;\n for (int j = 0; j < 2; j++) {\n for (int k = 0; k < 9; k++)\n cin >> a[j][k];\n }\n for (int z = 0; z < 9; z++) {\n num[0][0] = 0;\n num[1][0] = 0;\n if (a[0][0] > a[1][z])\n num[0][0] = (a[0][0] + a[1][z]);\n else\n num[1][0] = (a[0][0] + a[1][z]);\n for (int b = 0; b < 9; b++) {\n if (b == z)\n continue;\n num[0][1] = 0;\n num[1][1] = 0;\n if (a[0][1] > a[1][b])\n num[0][1] = (a[0][1] + a[1][b]);\n else\n num[1][1] = (a[0][1] + a[1][b]);\n for (int c = 0; c < 9; c++) {\n if (c == z || c == b)\n continue;\n num[0][2] = 0;\n num[1][2] = 0;\n if (a[0][2] > a[1][c])\n num[0][2] = (a[0][2] + a[1][c]);\n else\n num[1][2] = (a[0][2] + a[1][c]);\n for (int d = 0; d < 9; d++) {\n if (d == z || d == b || d == c)\n continue;\n num[0][3] = 0;\n num[1][3] = 0;\n if (a[0][3] > a[1][d])\n num[0][3] = (a[0][3] + a[1][d]);\n else\n num[1][3] = (a[0][3] + a[1][d]);\n for (int e = 0; e < 9; e++) {\n if (e == z || e == b || e == c || e == d)\n continue;\n num[0][4] = 0;\n num[1][4] = 0;\n if (a[0][4] > a[1][e])\n num[0][4] = (a[0][4] + a[1][e]);\n else\n num[1][4] = (a[0][4] + a[1][e]);\n for (int f = 0; f < 9; f++) {\n if (f == z || f == b || f == c || f == d || f == e)\n continue;\n num[0][5] = 0;\n num[1][5] = 0;\n if (a[0][5] > a[1][f])\n num[0][5] = (a[0][5] + a[1][f]);\n else\n num[1][5] = (a[0][5] + a[1][f]);\n for (int g = 0; g < 9; g++) {\n if (g == z || g == b || g == c || g == d || g == e || g == f)\n continue;\n num[0][6] = 0;\n num[1][6] = 0;\n if (a[0][6] > a[1][g])\n num[0][6] = (a[0][6] + a[1][g]);\n else\n num[1][6] = (a[0][6] + a[1][g]);\n for (int h = 0; h < 9; h++) {\n if (h == z || h == b || h == c || h == d || h == e ||\n h == f || h == g)\n continue;\n num[0][7] = 0;\n num[1][7] = 0;\n if (a[0][7] > a[1][h])\n num[0][7] = (a[0][7] + a[1][h]);\n else\n num[1][7] = (a[0][7] + a[1][h]);\n for (int i = 0; i < 9; i++) {\n if (i == z || i == b || i == c || i == d || i == e ||\n i == f || i == g || i == h)\n continue;\n num[0][8] = 0;\n num[1][8] = 0;\n if (a[0][8] > a[1][i])\n num[0][8] = (a[0][8] + a[1][i]);\n else\n num[1][8] = (a[0][8] + a[1][i]);\n geitu = 0;\n jacky = 0;\n for (int m = 0; m < 9; m++) {\n geitu += num[0][m];\n jacky += num[1][m];\n }\n if (geitu > jacky)\n winrate1++;\n else if (geitu < jacky)\n winrate2++;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n double ans, ans2;\n ans = winrate1 / 362880;\n ans *= 100000;\n ans += 0.5;\n ans = int(ans);\n ans /= 100000;\n ans2 = winrate2 / 362880;\n ans2 *= 100000;\n ans2 += 0.5;\n ans2 = int(ans2);\n ans2 /= 100000;\n cout << ans << \" \" << ans2 << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":3256,"score_of_the_acc":-0.5912,"final_rank":16},{"submission_id":"aoj_2187_6049186","code_snippet":"#pragma region templates\n//#pragma GCC optimize(\"Ofast\")\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 ull = unsigned long long;\nusing db = double;\nusing ld = long double;\ntemplate <typename T> using V = vector<T>;\ntemplate <typename T> using VV = vector<vector<T>>;\ntemplate <typename T> using PQ = priority_queue<T>;\ntemplate <typename T> using PQR = priority_queue<T, vector<T>, greater<T>>;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define eb emplace_back\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 all(v) (v).begin(), (v).end()\n#define siz(v) (ll)(v).size()\n#define rep(i, a, n) for (ll i = a; i < (ll)(n); ++i)\n#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; --i)\n#define pw2(n) (1ll << (n))\n#define pcntl(x) __builtin_popcountll(x)\n#define ENDL '\\n'\ntypedef pair<int, int> Pi;\ntypedef pair<ll, ll> PL;\nconstexpr ll mod = 1000000007; // 998244353;\nconstexpr ll INF = 1000000099;\nconstexpr ll LINF = (ll)(1e18 + 99);\nconstexpr ll dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};\ntemplate <typename T, typename U> inline bool chmin(T &t, const U &u) {\n if (t > u) {\n t = u;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> inline bool chmax(T &t, const U &u) {\n if (t < u) {\n t = u;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\ninline void Yes() { cout << \"Yes\" << ENDL; }\ninline void No() { cout << \"No\" << ENDL; }\ninline void YES() { cout << \"YES\" << ENDL; }\ninline void NO() { cout << \"NO\" << ENDL; }\n\ntemplate <typename T, typename Y> inline T mpow(T a, Y n) {\n T res = 1;\n for (; n; n >>= 1) {\n if (n & 1)\n res = res * a;\n a = a * a;\n }\n return res;\n}\n\ntemplate <typename T> vector<T> finddivisor(T x) { //整数xの約数(xを含む)\n vector<T> divisor;\n for (T i = 1; (i * i) <= x; i++) {\n if (x % i == 0) {\n divisor.push_back(i);\n if (i * i != x) {\n divisor.push_back(x / i);\n }\n }\n }\n sort(divisor.begin(), divisor.end());\n return divisor;\n}\n\ntemplate <typename T> V<T> prefix_sum(const V<T> &v) {\n int n = v.size();\n V<T> ret(n + 1);\n rep(i, 0, n) ret[i + 1] = ret[i] + v[i];\n return ret;\n}\n\ntemplate <typename T> void get_unique(V<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), v.end());\n return;\n}\n\ntemplate <typename T> T rand(T l, T r) {\n static random_device rd;\n static mt19937 g(rd());\n return uniform_int_distribution<T>(l, r)(g);\n} //[]\n\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) {\n for (auto &&x : vec)\n is >> x;\n return is;\n}\n\ntemplate <typename T, typename Y>\nostream &operator<<(ostream &os, const pair<T, Y> &p) {\n return os << \"{\" << p.fs << \",\" << p.sc << \"}\";\n}\n\ntemplate <typename T> ostream &operator<<(ostream &os, const V<T> &v) {\n os << \"{\";\n for (auto e : v)\n os << e << \",\";\n return os << \"}\";\n}\n\n#ifdef LOCAL\ntemplate <typename... Args> void debug(Args &...args) {\n for (auto const &x : {args...}) {\n cerr << x << ' ';\n }\n cerr << ENDL;\n}\n#else\ntemplate <typename... Args> void debug(Args &...args) { return; }\n#endif\n#pragma endregion templates\n\nsigned main() {\n cin.tie(0);\n cerr.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int qq;\n cin >> qq;\n while (qq--) {\n V<ll> a(9), b = a;\n cin >> a >> b;\n\n map<PL, pair<db, db>> ma;\n\n auto dfs = [&](auto self, ll bit, ll res) -> pair<db, db> {\n if (ma.count(mp(bit, res))) {\n return ma[mp(bit, res)];\n }\n\n pair<db, db> ret = {0, 0};\n int r = __builtin_popcountll(bit);\n if (r == 9) {\n if (res > 0)\n ret.fs += 1;\n else if (res < 0)\n ret.sc += 1;\n ma[mp(bit, res)] = ret;\n return ret;\n }\n\n rep(i, 0, 9) {\n if (bit & pw2(i))\n continue;\n\n ll nres = res;\n if (a[i] > b[r])\n nres += a[i] + b[r];\n else\n nres -= a[i] + b[r];\n auto tmp = self(self, bit | pw2(i), nres);\n ret.fs += tmp.fs;\n ret.sc += tmp.sc;\n }\n\n ma[mp(bit, res)] = ret;\n return ret;\n };\n\n pair<db, db> p = dfs(dfs, 0, 0);\n rep(i,1,10){\n p.fs/=(db)i;\n p.sc/=(db)i;\n }\n cout << p.fs << \" \" << p.sc << ENDL;\n }\n}\n//(・_・)(・_・)(・_・)(・_・)\n// CHECK overflow,what to output?\n// any other simpler approach?","accuracy":1,"time_ms":160,"memory_kb":4572,"score_of_the_acc":-1.0379,"final_rank":19},{"submission_id":"aoj_2187_5013844","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 6 \"/home/yuruhiya/programming/library/template/constants.cpp\"\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1e9;\nconstexpr long long inf_ll = 1e18, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Input {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = read<char>() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = read<char>(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tint n;\n\t\tReadVectorHelper(int _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tint n, m;\n\t\tRead2DVectorHelper(const pair<int, int>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstatic string read_line() {\n\t\tstring v;\n\t\tfor (char c = read<char>(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> static T read() {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](int n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<int, int>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(int h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 6 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T> T div_ceil(T n, T m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T> T div_ceil2(T n, T m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T> T middle(const T& l, const T& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool in_range(const T& v, const T& min, const T& max) {\n\treturn min <= v && v < max;\n}\ntemplate <class T> bool in_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\ntemplate <class T, class U> T Pow(T a, U n) {\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U> T Powmod(T a, U n, T mod) {\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 2 \"a.cpp\"\n\nvoid solve() {\n\tint n = 9;\n\tVI a = in[n], b = in[n];\n\n\tll win_a = 0, win_b = 0, cnt = 0;\n\tsort(all(b));\n\tdo {\n\t\tll sum_a = 0, sum_b = 0;\n\t\trep(i, n) {\n\t\t\t(a[i] > b[i] ? sum_a : sum_b) += a[i] + b[i];\n\t\t}\n\t\twin_a += sum_a > sum_b;\n\t\twin_b += sum_a < sum_b;\n\t\tcnt++;\n\t} while (next_permutation(all(b)));\n\tprintf(\"%.5f %.5f\\n\", 1.0 * win_a / cnt, 1.0 * win_b / cnt);\n}\n\nint main() {\n\tfor (int t = in; t--;) {\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":110,"memory_kb":3500,"score_of_the_acc":-0.2597,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2187_9066307\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef int64_t ll;\\n\\nvector<int> a(9),b(9);\\nint aw=0,bw=0;\\n\\nvoid ck(int k,int usd,int as,int bs){\\n for(int i=0;i<9;i++){\\n if((usd&(1<<i))!=0) continue;\\n //cout << k << \\\" \\\" << i << endl;\\n int usd1=(usd|(1<<i));\\n int as1=as,bs1=bs;\\n if(a[k]>b[i]) as1+=(a[k]+b[i]);\\n else bs1+=(a[k]+b[i]);\\n \\n if(k==8){\\n (as1>bs1 ? aw++ : bw++);\\n return;\\n }\\n\\n ck(k+1,usd1,as1,bs1);\\n \\n }\\n return;\\n}\\n\\nint main(){\\n\\n int n;\\n cin >> n;\\n for(int s=0;s<n;s++){\\n for(int &x:a) cin >> x;\\n for(int &x:b) cin >> x;\\n\\n aw=0;bw=0;\\n vector<int> c(9);\\n ck(0,0,0,0);\\n //cout << aw << \\\" \\\" << aw+bw << endl;\\n cout << fixed << setprecision(5) << (double)aw/(aw+bw) << \\\" \\\" << (double)bw/(aw+bw) << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.3203,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2187_9065112\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef int64_t ll;\\n\\nvector<int> a(9),b(9);\\nint aw=0,bw=0;\\n\\nvoid ck(int k,int usd,vector<int> c){\\n vector<int> c1;\\n for(int i=0;i<9;i++){\\n if((usd&(1<<i))!=0) continue;\\n //cout << k << \\\" \\\" << i << endl;\\n int usd1=(usd|(1<<i));\\n c1=c;\\n c1[k]=i;\\n if(k==8){\\n int as=0,bs=0;\\n for(int j=0;j<9;j++){ \\n if(a[j]>b[c1[j]]) as+=(a[j]+b[c1[j]]);\\n //bs+=(a[j]+b[c1[j]]);\\n }\\n //cout << as << \\\" \\\" << bs << endl;\\n (as>85 ? aw++ : bw++);\\n return;\\n }\\n\\n ck(k+1,usd1,c1);\\n \\n }\\n return;\\n}\\n\\nint main(){\\n\\n int n;\\n cin >> n;\\n for(int s=0;s<n;s++){\\n for(int &x:a) cin >> x;\\n for(int &x:b) cin >> x;\\n sort(b.begin(),b.end());\\n\\n aw=0;bw=0;\\n vector<int> c(9);\\n ck(0,0,c);\\n //cout << aw << \\\" \\\" << aw+bw << endl;\\n cout << fixed << setprecision(5) << (double)aw/(aw+bw) << \\\" \\\" << (double)bw/(aw+bw) << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.8388,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2187_8860748\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int a[2][9];\\n double winrate1 = 0, winrate2 = 0;\\n\\n for (int j = 0; j < 2; j++)\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n\\n sort(a[1], a[1] + 9);\\n do {\\n int geitu = 0, jacky = 0;\\n for (int z = 0; z < 9; z++) {\\n if (a[0][z] > a[1][z])\\n geitu += a[0][z] + a[1][z];\\n else\\n jacky += a[0][z] + a[1][z];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n } while (next_permutation(a[1], a[1] + 9));\\n\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.0407,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2187_8822143\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n }\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.5187,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2187_8809459\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\n\\nvoid calculateWinRate(int index, int permutation[], double& winrate1, double& winrate2, int a[][9]) {\\n if (index == 9) {\\n int num[2][9] = {{0}};\\n for (int i = 0; i < 9; i++) {\\n if (a[0][i] > a[1][permutation[i]])\\n num[0][i] = (a[0][i] + a[1][permutation[i]]);\\n else\\n num[1][i] = (a[0][i] + a[1][permutation[i]]);\\n }\\n int geitu = 0, jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n } else {\\n for (int i = 0; i < 9; i++) {\\n bool found = false;\\n for (int j = 0; j < index; j++) {\\n if (permutation[j] == i) {\\n found = true;\\n break;\\n }\\n }\\n if (!found) {\\n permutation[index] = i;\\n calculateWinRate(index + 1, permutation, winrate1, winrate2, a);\\n }\\n }\\n }\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int a[2][9];\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n double winrate1 = 0, winrate2 = 0;\\n int permutation[9];\\n calculateWinRate(0, permutation, winrate1, winrate2, a);\\n double ans = winrate1 / 362880;\\n double ans2 = winrate2 / 362880;\\n cout << fixed;\\n cout.precision(5);\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1430,\n \"memory_kb\": 3276,\n \"score_of_the_acc\": -1.105,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2187_8216146\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <iomanip>\\n\\nint main() {\\n int n;\\n std::cin >> n;\\n std::vector<int> permutation(9);\\n\\n for (int i = 0; i < n; i++) {\\n int a[2][9];\\n for (int j = 0; j < 2; j++)\\n for (int k = 0; k < 9; k++)\\n std::cin >> a[j][k];\\n\\n std::sort(a[0], a[0] + 9);\\n std::sort(a[1], a[1] + 9);\\n\\n for (int j = 0; j < 9; j++)\\n permutation[j] = j;\\n\\n double winrate1 = 0, winrate2 = 0;\\n do {\\n int sum1 = 0, sum2 = 0;\\n for (int j = 0; j < 9; j++) {\\n if (a[0][j] > a[1][permutation[j]])\\n sum1 += a[0][j] + a[1][permutation[j]];\\n else\\n sum2 += a[0][j] + a[1][permutation[j]];\\n }\\n if (sum1 > sum2)\\n winrate1++;\\n else if (sum1 < sum2)\\n winrate2++;\\n } while (std::next_permutation(permutation.begin(), permutation.end()));\\n\\n std::cout << std::fixed << std::setprecision(5) << winrate1 / 362880 << \\\" \\\" << winrate2 / 362880 << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -0.0897,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2187_8216142\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.5525,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2187_8216141\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.6022,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2187_8116304\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = num[1][1] = 0;\\n int ai0 = a[0][1], ai1 = a[1][b];\\n if (ai0 > ai1) {\\n num[0][1] = ai0 + ai1;\\n } else {\\n num[1][1] = ai0 + ai1;\\n }\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = num[1][2] = 0;\\n ai0 = a[0][2], ai1 = a[1][c];\\n if (ai0 > ai1) {\\n num[0][2] = ai0 + ai1;\\n } else {\\n num[1][2] = ai0 + ai1;\\n }\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = num[1][3] = 0;\\n ai0 = a[0][3], ai1 = a[1][d];\\n if (ai0 > ai1) {\\n num[0][3] = ai0 + ai1;\\n } else {\\n num[1][3] = ai0 + ai1;\\n }\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = num[1][4] = 0;\\n ai0 = a[0][4], ai1 = a[1][e];\\n if (ai0 > ai1) {\\n num[0][4] = ai0 + ai1;\\n } else {\\n num[1][4] = ai0 + ai1;\\n }\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = num[1][5] = 0;\\n ai0 = a[0][5], ai1 = a[1][f];\\n if (ai0 > ai1) {\\n num[0][5] = ai0 + ai1;\\n } else {\\n num[1][5] = ai0 + ai1;\\n }\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = num[1][6] = 0;\\n ai0 = a[0][6], ai1 = a[1][g];\\n if (ai0 > ai1) {\\n num[0][6] = ai0 + ai1;\\n } else {\\n num[1][6] = ai0 + ai1;\\n }\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = num[1][7] = 0;\\n ai0 = a[0][7], ai1 = a[1][h];\\n if (ai0 > ai1) {\\n num[0][7] = ai0 + ai1;\\n } else {\\n num[1][7] = ai0 + ai1;\\n }\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = num[1][8] = 0;\\n ai0 = a[0][8], ai1 = a[1][i];\\n if (ai0 > ai1) {\\n num[0][8] = ai0 + ai1;\\n } else {\\n num[1][8] = ai0 + ai1;\\n }\\n geitu = jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2187_8116301\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = num[0][0] + num[0][1] + num[0][2] + num[0][3] + num[0][4] + num[0][5] + num[0][6] + num[0][7] + num[0][8];\\n jacky = num[1][0] + num[1][1] + num[1][2] + num[1][3] + num[1][4] + num[1][5] + num[1][6] + num[1][7] + num[1][8];\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.5118,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2187_8116300\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nvoid playGame(int a[2][9], int z, vector<int>& nums, double& winrate1, double& winrate2) {\\n int num[2][9];\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int i = 1; i < 9; i++) {\\n num[0][i] = 0;\\n num[1][i] = 0;\\n }\\n for (int i = 1; i < 9; i++) {\\n int j = nums[i - 1];\\n if (j <= z)\\n j--;\\n if (a[0][i] > a[1][j])\\n num[0][i] = (a[0][i] + a[1][j]);\\n else\\n num[1][i] = (a[0][i] + a[1][j]);\\n }\\n int geitu = 0, jacky = 0;\\n for (int i = 0; i < 9; i++) {\\n geitu += num[0][i];\\n jacky += num[1][i];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n}\\n\\nvoid permute(vector<int>& nums, int l, int r, int a[2][9], double& winrate1, double& winrate2) {\\n if (l == r) {\\n for (int i = 0; i < 9; i++) {\\n playGame(a, i, nums, winrate1, winrate2);\\n }\\n }\\n else {\\n for (int i = l; i <= r; i++) {\\n swap(nums[l], nums[i]);\\n permute(nums, l + 1, r, a, winrate1, winrate2);\\n swap(nums[l], nums[i]); // backtrack\\n }\\n }\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int a[2][9];\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n vector<int> nums(8);\\n for (int i = 0; i < 8; i++) {\\n nums[i] = i + 1;\\n }\\n double winrate1 = 0, winrate2 = 0;\\n permute(nums, 0, 7, a, winrate1, winrate2);\\n double ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n double ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.1447,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2187_8116299\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\n\\nvoid calculateWinRate(int a[2][9], double& winrate1, double& winrate2) {\\n int num[2][9];\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e || h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e || i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n int geitu = 0;\\n int jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n double winrate1 = 0, winrate2 = 0;\\n for (int l = 0; l < n; l++) {\\n int a[2][9];\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n calculateWinRate(a, winrate1, winrate2);\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n winrate1 = 0;\\n winrate2 = 0;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.5773,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2187_8116298\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = num[0][0];\\n num[1][1] = num[1][0];\\n if (a[0][1] > a[1][b])\\n num[0][1] += (a[0][1] + a[1][b]);\\n else\\n num[1][1] += (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = num[0][1];\\n num[1][2] = num[1][1];\\n if (a[0][2] > a[1][c])\\n num[0][2] += (a[0][2] + a[1][c]);\\n else\\n num[1][2] += (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = num[0][2];\\n num[1][3] = num[1][2];\\n if (a[0][3] > a[1][d])\\n num[0][3] += (a[0][3] + a[1][d]);\\n else\\n num[1][3] += (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = num[0][3];\\n num[1][4] = num[1][3];\\n if (a[0][4] > a[1][e])\\n num[0][4] += (a[0][4] + a[1][e]);\\n else\\n num[1][4] += (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = num[0][4];\\n num[1][5] = num[1][4];\\n if (a[0][5] > a[1][f])\\n num[0][5] += (a[0][5] + a[1][f]);\\n else\\n num[1][5] += (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = num[0][5];\\n num[1][6] = num[1][5];\\n if (a[0][6] > a[1][g])\\n num[0][6] += (a[0][6] + a[1][g]);\\n else\\n num[1][6] += (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = num[0][6];\\n num[1][7] = num[1][6];\\n if (a[0][7] > a[1][h])\\n num[0][7] += (a[0][7] + a[1][h]);\\n else\\n num[1][7] += (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = num[0][7];\\n num[1][8] = num[1][7];\\n if (a[0][8] > a[1][i])\\n num[0][8] += (a[0][8] + a[1][i]);\\n else\\n num[1][8] += (a[0][8] + a[1][i]);\\n geitu = num[0][8];\\n jacky = num[1][8];\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.5773,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2187_8116296\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = 1 - ans; // winrate2 = 1 - winrate1, so we can simply calculate this way\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.5311,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2187_8116295\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880.0;\\n ans *= 100000.0;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000.0;\\n ans2 = winrate2 / 362880.0;\\n ans2 *= 100000.0;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000.0;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.558,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2187_8116293\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu = 0, jacky = 0;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++) {\\n cin >> a[j][k];\\n if (j == 0) {\\n num[0][k] = 0;\\n num[1][k] = 0;\\n }\\n }\\n }\\n for (int z = 0; z < 9; z++) {\\n if (a[0][0] > a[1][z]) {\\n num[0][0] = (a[0][0] + a[1][z]);\\n num[1][0] = 0;\\n }\\n else {\\n num[0][0] = 0;\\n num[1][0] = (a[0][0] + a[1][z]);\\n }\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n if (a[0][1] > a[1][b]) {\\n num[0][1] = (a[0][1] + a[1][b]);\\n num[1][1] = 0;\\n }\\n else {\\n num[0][1] = 0;\\n num[1][1] = (a[0][1] + a[1][b]);\\n }\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n if (a[0][2] > a[1][c]) {\\n num[0][2] = (a[0][2] + a[1][c]);\\n num[1][2] = 0;\\n }\\n else {\\n num[0][2] = 0;\\n num[1][2] = (a[0][2] + a[1][c]);\\n }\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n if (a[0][3] > a[1][d]) {\\n num[0][3] = (a[0][3] + a[1][d]);\\n num[1][3] = 0;\\n }\\n else {\\n num[0][3] = 0;\\n num[1][3] = (a[0][3] + a[1][d]);\\n }\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n if (a[0][4] > a[1][e]) {\\n num[0][4] = (a[0][4] + a[1][e]);\\n num[1][4] = 0;\\n }\\n else {\\n num[0][4] = 0;\\n num[1][4] = (a[0][4] + a[1][e]);\\n }\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n if (a[0][5] > a[1][f]) {\\n num[0][5] = (a[0][5] + a[1][f]);\\n num[1][5] = 0;\\n }\\n else {\\n num[0][5] = 0;\\n num[1][5] = (a[0][5] + a[1][f]);\\n }\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n if (a[0][6] > a[1][g]) {\\n num[0][6] = (a[0][6] + a[1][g]);\\n num[1][6] = 0;\\n }\\n else {\\n num[0][6] = 0;\\n num[1][6] = (a[0][6] + a[1][g]);\\n }\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n if (a[0][7] > a[1][h]) {\\n num[0][7] = (a[0][7] + a[1][h]);\\n num[1][7] = 0;\\n }\\n else {\\n num[0][7] = 0;\\n num[1][7] = (a[0][7] + a[1][h]);\\n }\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n if (a[0][8] > a[1][i]) {\\n num[0][8] = (a[0][8] + a[1][i]);\\n num[1][8] = 0;\\n }\\n else {\\n num[0][8] = 0;\\n num[1][8] = (a[0][8] + a[1][i]);\\n }\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.5635,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2187_8116292\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\nusing namespace std;\\nint main() {\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky, z, b, c, d, e, f, g, h, i;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.5773,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2187_8113257\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n int n;\\n cin >> n;\\n for (int l = 0; l < n; l++) {\\n int num[2][9], a[2][9], geitu, jacky;\\n double winrate1 = 0, winrate2 = 0;\\n for (int j = 0; j < 2; j++) {\\n for (int k = 0; k < 9; k++)\\n cin >> a[j][k];\\n }\\n for (int z = 0; z < 9; z++) {\\n num[0][0] = 0;\\n num[1][0] = 0;\\n if (a[0][0] > a[1][z])\\n num[0][0] = (a[0][0] + a[1][z]);\\n else\\n num[1][0] = (a[0][0] + a[1][z]);\\n for (int b = 0; b < 9; b++) {\\n if (b == z)\\n continue;\\n num[0][1] = 0;\\n num[1][1] = 0;\\n if (a[0][1] > a[1][b])\\n num[0][1] = (a[0][1] + a[1][b]);\\n else\\n num[1][1] = (a[0][1] + a[1][b]);\\n for (int c = 0; c < 9; c++) {\\n if (c == z || c == b)\\n continue;\\n num[0][2] = 0;\\n num[1][2] = 0;\\n if (a[0][2] > a[1][c])\\n num[0][2] = (a[0][2] + a[1][c]);\\n else\\n num[1][2] = (a[0][2] + a[1][c]);\\n for (int d = 0; d < 9; d++) {\\n if (d == z || d == b || d == c)\\n continue;\\n num[0][3] = 0;\\n num[1][3] = 0;\\n if (a[0][3] > a[1][d])\\n num[0][3] = (a[0][3] + a[1][d]);\\n else\\n num[1][3] = (a[0][3] + a[1][d]);\\n for (int e = 0; e < 9; e++) {\\n if (e == z || e == b || e == c || e == d)\\n continue;\\n num[0][4] = 0;\\n num[1][4] = 0;\\n if (a[0][4] > a[1][e])\\n num[0][4] = (a[0][4] + a[1][e]);\\n else\\n num[1][4] = (a[0][4] + a[1][e]);\\n for (int f = 0; f < 9; f++) {\\n if (f == z || f == b || f == c || f == d || f == e)\\n continue;\\n num[0][5] = 0;\\n num[1][5] = 0;\\n if (a[0][5] > a[1][f])\\n num[0][5] = (a[0][5] + a[1][f]);\\n else\\n num[1][5] = (a[0][5] + a[1][f]);\\n for (int g = 0; g < 9; g++) {\\n if (g == z || g == b || g == c || g == d || g == e || g == f)\\n continue;\\n num[0][6] = 0;\\n num[1][6] = 0;\\n if (a[0][6] > a[1][g])\\n num[0][6] = (a[0][6] + a[1][g]);\\n else\\n num[1][6] = (a[0][6] + a[1][g]);\\n for (int h = 0; h < 9; h++) {\\n if (h == z || h == b || h == c || h == d || h == e ||\\n h == f || h == g)\\n continue;\\n num[0][7] = 0;\\n num[1][7] = 0;\\n if (a[0][7] > a[1][h])\\n num[0][7] = (a[0][7] + a[1][h]);\\n else\\n num[1][7] = (a[0][7] + a[1][h]);\\n for (int i = 0; i < 9; i++) {\\n if (i == z || i == b || i == c || i == d || i == e ||\\n i == f || i == g || i == h)\\n continue;\\n num[0][8] = 0;\\n num[1][8] = 0;\\n if (a[0][8] > a[1][i])\\n num[0][8] = (a[0][8] + a[1][i]);\\n else\\n num[1][8] = (a[0][8] + a[1][i]);\\n geitu = 0;\\n jacky = 0;\\n for (int m = 0; m < 9; m++) {\\n geitu += num[0][m];\\n jacky += num[1][m];\\n }\\n if (geitu > jacky)\\n winrate1++;\\n else if (geitu < jacky)\\n winrate2++;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n double ans, ans2;\\n ans = winrate1 / 362880;\\n ans *= 100000;\\n ans += 0.5;\\n ans = int(ans);\\n ans /= 100000;\\n ans2 = winrate2 / 362880;\\n ans2 *= 100000;\\n ans2 += 0.5;\\n ans2 = int(ans2);\\n ans2 /= 100000;\\n cout << ans << \\\" \\\" << ans2 << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.5912,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2187_6049186\",\n \"code_snippet\": \"#pragma region templates\\n//#pragma GCC optimize(\\\"Ofast\\\")\\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 ull = unsigned long long;\\nusing db = double;\\nusing ld = long double;\\ntemplate <typename T> using V = vector<T>;\\ntemplate <typename T> using VV = vector<vector<T>>;\\ntemplate <typename T> using PQ = priority_queue<T>;\\ntemplate <typename T> using PQR = priority_queue<T, vector<T>, greater<T>>;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define eb emplace_back\\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 all(v) (v).begin(), (v).end()\\n#define siz(v) (ll)(v).size()\\n#define rep(i, a, n) for (ll i = a; i < (ll)(n); ++i)\\n#define repr(i, a, n) for (ll i = n - 1; (ll)a <= i; --i)\\n#define pw2(n) (1ll << (n))\\n#define pcntl(x) __builtin_popcountll(x)\\n#define ENDL '\\\\n'\\ntypedef pair<int, int> Pi;\\ntypedef pair<ll, ll> PL;\\nconstexpr ll mod = 1000000007; // 998244353;\\nconstexpr ll INF = 1000000099;\\nconstexpr ll LINF = (ll)(1e18 + 99);\\nconstexpr ll dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};\\ntemplate <typename T, typename U> inline bool chmin(T &t, const U &u) {\\n if (t > u) {\\n t = u;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> inline bool chmax(T &t, const U &u) {\\n if (t < u) {\\n t = u;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\\ninline void Yes() { cout << \\\"Yes\\\" << ENDL; }\\ninline void No() { cout << \\\"No\\\" << ENDL; }\\ninline void YES() { cout << \\\"YES\\\" << ENDL; }\\ninline void NO() { cout << \\\"NO\\\" << ENDL; }\\n\\ntemplate <typename T, typename Y> inline T mpow(T a, Y n) {\\n T res = 1;\\n for (; n; n >>= 1) {\\n if (n & 1)\\n res = res * a;\\n a = a * a;\\n }\\n return res;\\n}\\n\\ntemplate <typename T> vector<T> finddivisor(T x) { //整数xの約数(xを含む)\\n vector<T> divisor;\\n for (T i = 1; (i * i) <= x; i++) {\\n if (x % i == 0) {\\n divisor.push_back(i);\\n if (i * i != x) {\\n divisor.push_back(x / i);\\n }\\n }\\n }\\n sort(divisor.begin(), divisor.end());\\n return divisor;\\n}\\n\\ntemplate <typename T> V<T> prefix_sum(const V<T> &v) {\\n int n = v.size();\\n V<T> ret(n + 1);\\n rep(i, 0, n) ret[i + 1] = ret[i] + v[i];\\n return ret;\\n}\\n\\ntemplate <typename T> void get_unique(V<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), v.end());\\n return;\\n}\\n\\ntemplate <typename T> T rand(T l, T r) {\\n static random_device rd;\\n static mt19937 g(rd());\\n return uniform_int_distribution<T>(l, r)(g);\\n} //[]\\n\\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) {\\n for (auto &&x : vec)\\n is >> x;\\n return is;\\n}\\n\\ntemplate <typename T, typename Y>\\nostream &operator<<(ostream &os, const pair<T, Y> &p) {\\n return os << \\\"{\\\" << p.fs << \\\",\\\" << p.sc << \\\"}\\\";\\n}\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const V<T> &v) {\\n os << \\\"{\\\";\\n for (auto e : v)\\n os << e << \\\",\\\";\\n return os << \\\"}\\\";\\n}\\n\\n#ifdef LOCAL\\ntemplate <typename... Args> void debug(Args &...args) {\\n for (auto const &x : {args...}) {\\n cerr << x << ' ';\\n }\\n cerr << ENDL;\\n}\\n#else\\ntemplate <typename... Args> void debug(Args &...args) { return; }\\n#endif\\n#pragma endregion templates\\n\\nsigned main() {\\n cin.tie(0);\\n cerr.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n int qq;\\n cin >> qq;\\n while (qq--) {\\n V<ll> a(9), b = a;\\n cin >> a >> b;\\n\\n map<PL, pair<db, db>> ma;\\n\\n auto dfs = [&](auto self, ll bit, ll res) -> pair<db, db> {\\n if (ma.count(mp(bit, res))) {\\n return ma[mp(bit, res)];\\n }\\n\\n pair<db, db> ret = {0, 0};\\n int r = __builtin_popcountll(bit);\\n if (r == 9) {\\n if (res > 0)\\n ret.fs += 1;\\n else if (res < 0)\\n ret.sc += 1;\\n ma[mp(bit, res)] = ret;\\n return ret;\\n }\\n\\n rep(i, 0, 9) {\\n if (bit & pw2(i))\\n continue;\\n\\n ll nres = res;\\n if (a[i] > b[r])\\n nres += a[i] + b[r];\\n else\\n nres -= a[i] + b[r];\\n auto tmp = self(self, bit | pw2(i), nres);\\n ret.fs += tmp.fs;\\n ret.sc += tmp.sc;\\n }\\n\\n ma[mp(bit, res)] = ret;\\n return ret;\\n };\\n\\n pair<db, db> p = dfs(dfs, 0, 0);\\n rep(i,1,10){\\n p.fs/=(db)i;\\n p.sc/=(db)i;\\n }\\n cout << p.fs << \\\" \\\" << p.sc << ENDL;\\n }\\n}\\n//(・_・)(・_・)(・_・)(・_・)\\n// CHECK overflow,what to output?\\n// any other simpler approach?\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -1.0379,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2187_5013844\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 6 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1e9;\\nconstexpr long long inf_ll = 1e18, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Input {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = read<char>() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = read<char>(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tint n;\\n\\t\\tReadVectorHelper(int _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tint n, m;\\n\\t\\tRead2DVectorHelper(const pair<int, int>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstatic string read_line() {\\n\\t\\tstring v;\\n\\t\\tfor (char c = read<char>(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> static T read() {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](int n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<int, int>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(int h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 6 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T> T div_ceil(T n, T m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T> T div_ceil2(T n, T m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T> T middle(const T& l, const T& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool in_range(const T& v, const T& min, const T& max) {\\n\\treturn min <= v && v < max;\\n}\\ntemplate <class T> bool in_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\ntemplate <class T, class U> T Pow(T a, U n) {\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> T Powmod(T a, U n, T mod) {\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 2 \\\"a.cpp\\\"\\n\\nvoid solve() {\\n\\tint n = 9;\\n\\tVI a = in[n], b = in[n];\\n\\n\\tll win_a = 0, win_b = 0, cnt = 0;\\n\\tsort(all(b));\\n\\tdo {\\n\\t\\tll sum_a = 0, sum_b = 0;\\n\\t\\trep(i, n) {\\n\\t\\t\\t(a[i] > b[i] ? sum_a : sum_b) += a[i] + b[i];\\n\\t\\t}\\n\\t\\twin_a += sum_a > sum_b;\\n\\t\\twin_b += sum_a < sum_b;\\n\\t\\tcnt++;\\n\\t} while (next_permutation(all(b)));\\n\\tprintf(\\\"%.5f %.5f\\\\n\\\", 1.0 * win_a / cnt, 1.0 * win_b / cnt);\\n}\\n\\nint main() {\\n\\tfor (int t = in; t--;) {\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.2597,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1191,"cells":{"group_id":{"kind":"string","value":"aoj_2194_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nねこ泥棒と金曜日のお屋敷\nなつめは大のねこ好きである。なつめの通学路には通称ねこ屋敷と呼ばれている家がある。その家はたくさんのねこを飼っていることで有名で、なつめは通学途中によくこの家の前で飼いねこに遭遇し、一緒に遊んでいた。そんなある日、なつめは衝撃的な事実を知ってしまった。それは、実はねこ屋敷の主人は、機嫌が悪くなるとよく飼いねこたちを虐待している、ということだった。ねこ屋敷の主人を許せなくなったなつめは、ねこたちを救うため、主人の居ない間にねこたちを盗みだすことにした。\nなつめはねこ屋敷の主人の行動パターンを観察し、毎週決まって出掛けているタイミングをねらってねこたちを盗みだすことにした。ねこ屋敷は二次元平面として表わされており、なつめが屋敷の中に忍びこむ時点でのそれぞれのねこの位置は分かっている。ねこたちはそれぞれ決まったルートを常に50メートル毎分のスピードでまわっている。一方、なつめは最大80メートル毎分のスピードで移動できる。なつめは屋敷のとある場所から侵入し、屋敷内を移動し、主人が帰ってくるまでに脱出口から出る。なつめがねこと同じ地点に到達すると、なつめはねこを抱えることができる。これを行なうのにかかる時間は無視できる。なつめは何匹でもねこを抱えることができるし、何匹抱えていても移動速度が落ちることはないが、必ず主人が帰ってくる前に屋敷を脱出しなければならない。\n残念ながら、なつめはねこ屋敷のねこを全員盗みだすことはできないかもしれない。しかし、1匹でも多くのねこを幸せにするために、できるだけ多くのねこを盗みだすことにした。また、同じ数のねこを盗みだせるのであれば、屋敷の主人に捕まるリスクを抑えるため、できるだけ早い時間に屋敷から脱出する。\nなつめが屋敷に侵入する時刻と位置、屋敷の主人が戻ってくる時刻、脱出口の場所、およびねこの初期位置と巡回ルートが与えられる。なつめが何匹のねこを盗みだして、どの時刻に屋敷を脱出できるかを答えるプログラムを書いてほしい。\nInput\n入力の1行目には、侵入口の\nx\n,\ny\n座標が1つの空白文字で区切られて与えられる。2行目には同様に脱出口の位置が与えられる。3行目にはなつめが屋敷に侵入した時刻、4行目には屋敷の主人が帰ってくる時刻が24時間制のHH:MM:SSの形式で与えられる。\n5行目はねこの総数\nm\nであり、続く\nm\n行に各ねこの行動パターンが与えられる。5+\ni\n行目 (\ni\n= 1, 2, ...,\nm\n) が\ni\n番目のねこの巡回ルートに対応している。各行の初めには自然数\nk\ni\nが与えられ、続いてねこの巡回ルートが\nk\ni\n個の\nx\n,\ny\n座標値を並べたものとして与えられる。ねこの巡回ルートは、これらの連続する点および最後と最初の点を線分でつないだものである。なつめが屋敷に侵入した時点で、ねこは与えられた最初の点におり、以降ずっと巡回ルート上を等速で移動する。与えられたルートの連続する点が同じ座標であることはない。\nなお、スタート時間とゴール時間は同じ日でのものであることが保証されている．なつめが主人の帰ってくる前に脱出する方法は必ず存在する。同じ行にある数は全て1つの空白文字で区切られている。\nねこの数は1以上14以下、ねこの巡回ルートを表わす点の数は2以上1000以下であり、全ての座標値は絶対値が100000を越えない整数であることが保証されている。\n座標値の単位は全てメートルである。\nOutput\n1行目に、なつめが盗み出すことのできるねこの最大数を出力せよ。2行目には、なつめがなるべく多い数のねこを盗みだす方法の中で、最も早く脱出口に到達できる時刻を、HH MM SS.nnnnnn (空白区切り)の形式で答えよ。秒の小数点以下は6桁出力せよ。なお、10\n-6\n秒を越える誤差があってはならない。\nなお、主人の帰ってくる時間が±1ms変化しても、最多遭遇可能数は変化しないことが保証されている。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n2\n0 0\n0 0\n15:00:00\n18:00:00\n1\n4 0 7199 1125 7199 1125 8324 0 8324\n0 0\n0 0\n15:00:00\n18:00:00\n1\n4 0 7201 1125 7201 1125 8326 0 8326\nOutput for the Sample Input\n1\n17 59 59.076923\n0\n15 00 00.000000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2194_3227728","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <utility>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\ntypedef complex<double> P;\ntypedef vector<P> VP;\n\n//ループにおいてcが区間[a,b]に入るか\nbool in_range(double a, double b, double c){\n if(a < b) return a<=c && c<=b;\n return c<b || a<c;\n}\n\nconst double vn = 80.0/60.0; //velocity of natsume (m/s)\nconst double vc = 50.0/60.0; //velocity of cat (m/s)\n\n//出発座標と現在時刻、巡回ルートと累積和を与え、\n//捕まえる座標と時刻を返す\npair<P, double> fastest_catch(P s, double time, VP &route, vector<double> &sumtime){\n int n = route.size();\n //前・後の切れ目になる時刻\n double divtime = time +abs(s -route[0])/vn +sumtime.back()/2;\n divtime = fmod(divtime, sumtime.back());\n \n //二分探索でどの頂点間かを求める\n int sidx, lb=0, ub;\n auto itr = lower_bound(sumtime.begin(), sumtime.end(), divtime);\n if(EQ(*itr, divtime)){\n sidx = itr -sumtime.begin();\n ub = n;\n }else{\n sidx = (itr -sumtime.begin() +n-1) %n;\n ub = n+1;\n }\n int count = 0;\n while(ub -lb > 1){\n if(count++ >10) break;\n int mid = (ub +lb)/2;\n int mididx = (sidx +mid) %n;\n double t = time +abs(s -route[mididx])/vn;\n t = fmod(t, sumtime.back());\n if(in_range(divtime, sumtime[mididx], t)){\n ub = mid;\n }else{\n lb = mid;\n }\n }\n\n P a=route[(sidx+lb)%n], b=route[(sidx+ub)%n];\n P ab = (b-a)/abs(b-a);\n double dlb=0, dub=abs(a-b);\n for(int rep=0; rep<40; rep++){\n double mid = (dlb +dub) /2.0;\n P midP = a +mid*ab;\n double t = time +abs(s -midP)/vn;\n t = fmod(t, sumtime.back());\n if(in_range(divtime, fmod(sumtime[(sidx+lb)%n] +mid/vc, sumtime.back()), t)){\n dub = mid;\n }else{\n dlb = mid;\n }\n }\n P midP = a +dlb*ab;\n return make_pair(midP, time +abs(s -midP)/vn);\n}\n\nint bitcount(int n){\n n = (n & 0x55555555) + (n >> 1 & 0x55555555);\n n = (n & 0x33333333) + (n >> 2 & 0x33333333);\n n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);\n n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);\n return (n & 0x0000ffff) + (n >>16 & 0x0000ffff);\n}\n\nint main(){\n int dataset;\n cin >> dataset;\n for(int rep=0; rep<dataset; rep++){\n P s,g;\n {\n int sx,sy,gx,gy;\n cin >> sx >> sy >> gx >> gy;\n s = P(sx, sy);\n g = P(gx, gy);\n }\n int begintime,endtime;\n {\n int hh,mm,ss;\n scanf(\"%d:%d:%d\", &hh, &mm, &ss);\n begintime = hh*3600 +mm*60 +ss;\n scanf(\"%d:%d:%d\", &hh, &mm, &ss);\n endtime = hh*3600 +mm*60 +ss;\n }\n double tlimit = endtime -begintime;\n\n int n;\n cin >> n;\n //巡回ルート\n vector<VP> route(n);\n for(int i=0; i<n; i++){\n int size;\n cin >> size;\n route[i].resize(size);\n for(int j=0; j<size; j++){\n int x,y;\n cin >> x >> y;\n route[i][j] = P(x, y);\n }\n }\n //各頂点までにかかる時間の累積和\n vector<vector<double> > sumtime(n);\n for(int i=0; i<n; i++){\n int size = route[i].size();\n sumtime[i].resize(size +1);\n sumtime[i][0] = 0;\n for(int j=0; j<size; j++){\n sumtime[i][j+1] = sumtime[i][j] + abs(route[i][j] -route[i][(j+1)%size]) /vc;\n }\n }\n\n //dp[i][j] = (集合iを確保,最後にjをとったときの最短時刻)\n vector<vector<double> > dp(1<<n, vector<double>(n, INF));\n vector<vector<P> > pos(1<<n, vector<P>(n));\n for(int i=0; i<n; i++){\n auto ret = fastest_catch(s, 0, route[i], sumtime[i]);\n pos[1<<i][i] = ret.first;\n dp[1<<i][i] = ret.second;\n }\n\n int maxnum = 0;\n double mintime = abs(s -g) /vn;\n for(int i=1; i<(1<<n); i++){\n for(int j=0; j<n; j++){\n if(dp[i][j] == INF) continue;\n //ここから出口に直行しても間に合わないなら打ち切り\n double time = dp[i][j] +abs(pos[i][j] -g)/vn;\n if(time > tlimit) continue;\n //スコア更新(なるべく多く、なるべく早く)\n if(bitcount(i) == maxnum && time < mintime){\n mintime = time;\n }else if(bitcount(i) > maxnum){\n maxnum = bitcount(i);\n mintime = time;\n }\n \n for(int k=0; k<n; k++){\n if(i>>k & 1) continue;\n auto ret = fastest_catch(pos[i][j], dp[i][j], route[k], sumtime[k]);\n if(ret.second < dp[i|(1<<k)][k]){\n pos[i|(1<<k)][k] = ret.first;\n dp[i|(1<<k)][k] = ret.second;\n }\n }\n }\n }\n\n int integer_part = begintime +mintime +EPS;\n double fractional_part = begintime +mintime -integer_part;\n int hh = integer_part /3600;\n integer_part %= 3600;\n int mm = integer_part /60;\n double ss = integer_part %60 +fractional_part;\n printf(\"%d\\n\", maxnum);\n printf(\"%02d %02d %09.6f\\n\", hh, mm, ss);\n }\n return 0;\n}","accuracy":1,"time_ms":5260,"memory_kb":10132,"score_of_the_acc":-0.0138,"final_rank":1},{"submission_id":"aoj_2194_3227726","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <utility>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\ntypedef complex<double> P;\ntypedef vector<P> VP;\n\n//ループにおいてcが区間[a,b]に入るか\nbool in_range(double a, double b, double c){\n if(a < b) return a<=c && c<=b;\n return c<b || a<c;\n}\n\nconst double vn = 80.0/60.0; //velocity of natsume (m/s)\nconst double vc = 50.0/60.0; //velocity of cat (m/s)\n\n//出発座標と現在時刻、巡回ルートと累積和を与え、\n//捕まえる座標と時刻を返す\npair<P, double> fastest_catch(P s, double time, VP &route, vector<double> &sumtime){\n int n = route.size();\n //前・後の切れ目になる時刻\n double divtime = time +abs(s -route[0])/vn +sumtime.back()/2;\n divtime = fmod(divtime, sumtime.back());\n \n //二分探索でどの頂点間かを求める\n int sidx, lb=0, ub;\n auto itr = lower_bound(sumtime.begin(), sumtime.end(), divtime);\n if(EQ(*itr, divtime)){\n sidx = itr -sumtime.begin();\n ub = n;\n }else{\n sidx = (itr -sumtime.begin() +n-1) %n;\n ub = n+1;\n }\n int count = 0;\n while(ub -lb > 1){\n if(count++ >10) break;\n int mid = (ub +lb)/2;\n int mididx = (sidx +mid) %n;\n double t = time +abs(s -route[mididx])/vn;\n t = fmod(t, sumtime.back());\n if(in_range(divtime, sumtime[mididx], t)){\n ub = mid;\n }else{\n lb = mid;\n }\n }\n\n P a=route[(sidx+lb)%n], b=route[(sidx+ub)%n];\n P ab = (b-a)/abs(b-a);\n double dlb=0, dub=abs(a-b);\n for(int rep=0; rep<50; rep++){\n double mid = (dlb +dub) /2.0;\n P midP = a +mid*ab;\n double t = time +abs(s -midP)/vn;\n t = fmod(t, sumtime.back());\n if(in_range(divtime, fmod(sumtime[(sidx+lb)%n] +mid/vc, sumtime.back()), t)){\n dub = mid;\n }else{\n dlb = mid;\n }\n }\n P midP = a +dlb*ab;\n return make_pair(midP, time +abs(s -midP)/vn);\n}\n\nint bitcount(int n){\n n = (n & 0x55555555) + (n >> 1 & 0x55555555);\n n = (n & 0x33333333) + (n >> 2 & 0x33333333);\n n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);\n n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);\n return (n & 0x0000ffff) + (n >>16 & 0x0000ffff);\n}\n\nint main(){\n int dataset;\n cin >> dataset;\n for(int rep=0; rep<dataset; rep++){\n P s,g;\n {\n int sx,sy,gx,gy;\n cin >> sx >> sy >> gx >> gy;\n s = P(sx, sy);\n g = P(gx, gy);\n }\n int begintime,endtime;\n {\n int hh,mm,ss;\n scanf(\"%d:%d:%d\", &hh, &mm, &ss);\n begintime = hh*3600 +mm*60 +ss;\n scanf(\"%d:%d:%d\", &hh, &mm, &ss);\n endtime = hh*3600 +mm*60 +ss;\n }\n double tlimit = endtime -begintime;\n\n int n;\n cin >> n;\n //巡回ルート\n vector<VP> route(n);\n for(int i=0; i<n; i++){\n int size;\n cin >> size;\n route[i].resize(size);\n for(int j=0; j<size; j++){\n int x,y;\n cin >> x >> y;\n route[i][j] = P(x, y);\n }\n }\n //各頂点までにかかる時間の累積和\n vector<vector<double> > sumtime(n);\n for(int i=0; i<n; i++){\n int size = route[i].size();\n sumtime[i].resize(size +1);\n sumtime[i][0] = 0;\n for(int j=0; j<size; j++){\n sumtime[i][j+1] = sumtime[i][j] + abs(route[i][j] -route[i][(j+1)%size]) /vc;\n }\n }\n\n //dp[i][j] = (集合iを確保,最後にjをとったときの最短時刻)\n vector<vector<double> > dp(1<<n, vector<double>(n, INF));\n vector<vector<P> > pos(1<<n, vector<P>(n));\n for(int i=0; i<n; i++){\n auto ret = fastest_catch(s, 0, route[i], sumtime[i]);\n pos[1<<i][i] = ret.first;\n dp[1<<i][i] = ret.second;\n }\n\n int maxnum = 0;\n double mintime = abs(s -g) /vn;\n for(int i=1; i<(1<<n); i++){\n for(int j=0; j<n; j++){\n if(dp[i][j] == INF) continue;\n //ここから出口に直行しても間に合わないなら打ち切り\n double time = dp[i][j] +abs(pos[i][j] -g)/vn;\n if(time > tlimit) continue;\n //スコア更新(なるべく多く、なるべく早く)\n if(bitcount(i) == maxnum && time < mintime){\n mintime = time;\n }else if(bitcount(i) > maxnum){\n maxnum = bitcount(i);\n mintime = time;\n }\n \n for(int k=0; k<n; k++){\n if(i>>k & 1) continue;\n auto ret = fastest_catch(pos[i][j], dp[i][j], route[k], sumtime[k]);\n if(ret.second < dp[i|(1<<k)][k]){\n pos[i|(1<<k)][k] = ret.first;\n dp[i|(1<<k)][k] = ret.second;\n }\n }\n }\n }\n\n int integer_part = begintime +mintime +EPS;\n double fractional_part = begintime +mintime -integer_part;\n int hh = integer_part /3600;\n integer_part %= 3600;\n int mm = integer_part /60;\n double ss = integer_part %60 +fractional_part;\n printf(\"%d\\n\", maxnum);\n printf(\"%02d %02d %09.6f\\n\", hh, mm, ss);\n }\n return 0;\n}","accuracy":1,"time_ms":6480,"memory_kb":10092,"score_of_the_acc":-0.4586,"final_rank":2},{"submission_id":"aoj_2194_426779","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\n#include <complex>\ntypedef complex<double> Point;\n\nint HtoS(int h, int m, int s) {\n return h * 3600 + m * 60 + s;\n}\nstring StoH(double sec) {\n int h = (int)sec / 3600;\n int m = (int)sec % 3600 / 60;\n double ms = sec - (h * 3600 + m * 60);\n char str[1000];\n sprintf(str, \"%02d %02d %02d.%08d\", h, m, (int)ms, (int)((ms - (int)ms) * 100000000 + 0.5));\n return str;\n}\n\nstruct State {\n int use;\n double t;\n Point p;\n int last;\n State() {;}\n State(int use, double t, Point p, int last) : use(use), t(t), p(p), last(last) {;}\n bool operator<(const State &rhs) const {\n return t > rhs.t;\n }\n};\n\nconst double SPEED_N = 80.0 / 60.0;\nconst double SPEED_C = 50.0 / 60.0;\nPoint sp, ep;\nint startTime;\nint endTime;\nint n;\nvector<Point> route[20];\nvector<double> ts[20];\n\nint bisect(State state, int target) {\n int lower = 0;\n int upper = 1 << 20;\n while (lower != upper) {\n int mid = (lower + upper) / 2;\n int cycle = mid / ts[target].size();\n int index = mid % ts[target].size();\n double et = cycle * ts[target].back() + ts[target][index] + startTime;\n Point p = route[target][(index + 1) % route[target].size()];\n if (abs(state.p - p) / SPEED_N - (et - state.t) <= -EPS) {\n upper = mid;\n } else {\n lower = mid + 1;\n if (et >= endTime) { break; }\n }\n }\n return lower;\n}\n\npair<double, Point> calc(State state, int target) {\n int from = bisect(state, target);\n double lower;\n double upper;\n {\n int cycle = from / ts[target].size();\n int index = from % ts[target].size();\n lower = cycle * ts[target].back() + startTime;\n if (index != 0) {\n lower += ts[target][index - 1];\n }\n upper = cycle * ts[target].back() + ts[target][index] + startTime + EPS * 10;\n }\n double stime = lower;\n pair<double, Point> ret(endTime + 1, Point(0, 0));\n if (lower > endTime) { return ret; }\n from %= ts[target].size();\n Point vect = route[target][(from + 1) % route[target].size()] - route[target][from];\n vect /= abs(vect);\n bool ok = false;\n REP(i, 50) {\n double mid = (lower + upper) / 2.0;\n double t = mid - stime;\n Point tp = route[target][from] + vect * (t * SPEED_C);\n if (abs(state.p - tp) / SPEED_N <= mid - state.t) {\n upper = mid;\n ret = make_pair(mid, tp);\n ok = true;\n } else {\n lower = mid;\n }\n }\n double t = lower - stime;\n Point tp = route[target][from] + vect * (t * SPEED_C);\n //cout << abs(state.p - tp) / SPEED_N << \" \" << lower - state.t << endl;\n assert(ok);\n return ret;\n}\n\nbool visit[1 << 14][15];\ndouble times[1 << 14][15];\nint main() {\n int test;\n scanf(\"%d\", &test);\n double sx, sy, ex, ey;\n while (scanf(\"%lf %lf %lf %lf\", &sx, &sy, &ex, &ey) > 0) {\n sp = Point(sx, sy);\n ep = Point(ex, ey);\n {\n int h, m, s;\n scanf(\"%d:%d:%d\", &h, &m, &s);\n startTime = HtoS(h, m, s);\n scanf(\"%d:%d:%d\", &h, &m, &s);\n endTime = HtoS(h, m, s);\n }\n scanf(\"%d\", &n);\n REP(i, n) {\n route[i].clear();\n ts[i].clear();\n int k;\n scanf(\"%d\", &k);\n REP(j, k) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n route[i].push_back(Point(x, y));\n }\n double pt = 0.0;\n REP(j, k) {\n ts[i].push_back(pt + abs(route[i][j] - route[i][(j + 1) % route[i].size()]) / SPEED_C);\n pt = ts[i].back();\n }\n }\n\n REP(i, 1 << 14) REP(j, 15) { times[i][j] = endTime + EPS * 2; }\n MEMSET(visit, false);\n priority_queue<State> que;\n que.push(State(0, startTime, sp, 14));\n pair<int, double> ans(-1, -1e+100);\n while (!que.empty()) {\n State state = que.top();\n que.pop();\n if (visit[state.use][state.last]) { continue; }\n //cout << state.use << \" \" << state.last << \" \"<< state.t << endl;\n visit[state.use][state.last] = true;\n {\n double et = state.t + abs(state.p - ep) / SPEED_N;\n if (et > endTime) { continue; }\n pair<int, double> lans(__builtin_popcount(state.use), -et);\n ans = max(ans, lans);\n }\n REP(i, n) {\n if ((state.use >> i) & 1) { continue; }\n int nuse = state.use | (1 << i);\n if (visit[nuse][i]) { continue; }\n pair<double, Point> next = calc(state, i);\n if (next.first - times[nuse][i] > EPS) { continue; }\n times[nuse][i] = next.first;\n que.push(State(nuse, next.first, next.second, i));\n }\n }\n printf(\"%d\\n%s\\n\", ans.first, StoH(-ans.second).c_str());\n }\n}","accuracy":1,"time_ms":7920,"memory_kb":13000,"score_of_the_acc":-2,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2194_3227728\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <utility>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\n\\n//ループにおいてcが区間[a,b]に入るか\\nbool in_range(double a, double b, double c){\\n if(a < b) return a<=c && c<=b;\\n return c<b || a<c;\\n}\\n\\nconst double vn = 80.0/60.0; //velocity of natsume (m/s)\\nconst double vc = 50.0/60.0; //velocity of cat (m/s)\\n\\n//出発座標と現在時刻、巡回ルートと累積和を与え、\\n//捕まえる座標と時刻を返す\\npair<P, double> fastest_catch(P s, double time, VP &route, vector<double> &sumtime){\\n int n = route.size();\\n //前・後の切れ目になる時刻\\n double divtime = time +abs(s -route[0])/vn +sumtime.back()/2;\\n divtime = fmod(divtime, sumtime.back());\\n \\n //二分探索でどの頂点間かを求める\\n int sidx, lb=0, ub;\\n auto itr = lower_bound(sumtime.begin(), sumtime.end(), divtime);\\n if(EQ(*itr, divtime)){\\n sidx = itr -sumtime.begin();\\n ub = n;\\n }else{\\n sidx = (itr -sumtime.begin() +n-1) %n;\\n ub = n+1;\\n }\\n int count = 0;\\n while(ub -lb > 1){\\n if(count++ >10) break;\\n int mid = (ub +lb)/2;\\n int mididx = (sidx +mid) %n;\\n double t = time +abs(s -route[mididx])/vn;\\n t = fmod(t, sumtime.back());\\n if(in_range(divtime, sumtime[mididx], t)){\\n ub = mid;\\n }else{\\n lb = mid;\\n }\\n }\\n\\n P a=route[(sidx+lb)%n], b=route[(sidx+ub)%n];\\n P ab = (b-a)/abs(b-a);\\n double dlb=0, dub=abs(a-b);\\n for(int rep=0; rep<40; rep++){\\n double mid = (dlb +dub) /2.0;\\n P midP = a +mid*ab;\\n double t = time +abs(s -midP)/vn;\\n t = fmod(t, sumtime.back());\\n if(in_range(divtime, fmod(sumtime[(sidx+lb)%n] +mid/vc, sumtime.back()), t)){\\n dub = mid;\\n }else{\\n dlb = mid;\\n }\\n }\\n P midP = a +dlb*ab;\\n return make_pair(midP, time +abs(s -midP)/vn);\\n}\\n\\nint bitcount(int n){\\n n = (n & 0x55555555) + (n >> 1 & 0x55555555);\\n n = (n & 0x33333333) + (n >> 2 & 0x33333333);\\n n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);\\n n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);\\n return (n & 0x0000ffff) + (n >>16 & 0x0000ffff);\\n}\\n\\nint main(){\\n int dataset;\\n cin >> dataset;\\n for(int rep=0; rep<dataset; rep++){\\n P s,g;\\n {\\n int sx,sy,gx,gy;\\n cin >> sx >> sy >> gx >> gy;\\n s = P(sx, sy);\\n g = P(gx, gy);\\n }\\n int begintime,endtime;\\n {\\n int hh,mm,ss;\\n scanf(\\\"%d:%d:%d\\\", &hh, &mm, &ss);\\n begintime = hh*3600 +mm*60 +ss;\\n scanf(\\\"%d:%d:%d\\\", &hh, &mm, &ss);\\n endtime = hh*3600 +mm*60 +ss;\\n }\\n double tlimit = endtime -begintime;\\n\\n int n;\\n cin >> n;\\n //巡回ルート\\n vector<VP> route(n);\\n for(int i=0; i<n; i++){\\n int size;\\n cin >> size;\\n route[i].resize(size);\\n for(int j=0; j<size; j++){\\n int x,y;\\n cin >> x >> y;\\n route[i][j] = P(x, y);\\n }\\n }\\n //各頂点までにかかる時間の累積和\\n vector<vector<double> > sumtime(n);\\n for(int i=0; i<n; i++){\\n int size = route[i].size();\\n sumtime[i].resize(size +1);\\n sumtime[i][0] = 0;\\n for(int j=0; j<size; j++){\\n sumtime[i][j+1] = sumtime[i][j] + abs(route[i][j] -route[i][(j+1)%size]) /vc;\\n }\\n }\\n\\n //dp[i][j] = (集合iを確保,最後にjをとったときの最短時刻)\\n vector<vector<double> > dp(1<<n, vector<double>(n, INF));\\n vector<vector<P> > pos(1<<n, vector<P>(n));\\n for(int i=0; i<n; i++){\\n auto ret = fastest_catch(s, 0, route[i], sumtime[i]);\\n pos[1<<i][i] = ret.first;\\n dp[1<<i][i] = ret.second;\\n }\\n\\n int maxnum = 0;\\n double mintime = abs(s -g) /vn;\\n for(int i=1; i<(1<<n); i++){\\n for(int j=0; j<n; j++){\\n if(dp[i][j] == INF) continue;\\n //ここから出口に直行しても間に合わないなら打ち切り\\n double time = dp[i][j] +abs(pos[i][j] -g)/vn;\\n if(time > tlimit) continue;\\n //スコア更新(なるべく多く、なるべく早く)\\n if(bitcount(i) == maxnum && time < mintime){\\n mintime = time;\\n }else if(bitcount(i) > maxnum){\\n maxnum = bitcount(i);\\n mintime = time;\\n }\\n \\n for(int k=0; k<n; k++){\\n if(i>>k & 1) continue;\\n auto ret = fastest_catch(pos[i][j], dp[i][j], route[k], sumtime[k]);\\n if(ret.second < dp[i|(1<<k)][k]){\\n pos[i|(1<<k)][k] = ret.first;\\n dp[i|(1<<k)][k] = ret.second;\\n }\\n }\\n }\\n }\\n\\n int integer_part = begintime +mintime +EPS;\\n double fractional_part = begintime +mintime -integer_part;\\n int hh = integer_part /3600;\\n integer_part %= 3600;\\n int mm = integer_part /60;\\n double ss = integer_part %60 +fractional_part;\\n printf(\\\"%d\\\\n\\\", maxnum);\\n printf(\\\"%02d %02d %09.6f\\\\n\\\", hh, mm, ss);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5260,\n \"memory_kb\": 10132,\n \"score_of_the_acc\": -0.0138,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2194_3227726\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <utility>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\n\\n//ループにおいてcが区間[a,b]に入るか\\nbool in_range(double a, double b, double c){\\n if(a < b) return a<=c && c<=b;\\n return c<b || a<c;\\n}\\n\\nconst double vn = 80.0/60.0; //velocity of natsume (m/s)\\nconst double vc = 50.0/60.0; //velocity of cat (m/s)\\n\\n//出発座標と現在時刻、巡回ルートと累積和を与え、\\n//捕まえる座標と時刻を返す\\npair<P, double> fastest_catch(P s, double time, VP &route, vector<double> &sumtime){\\n int n = route.size();\\n //前・後の切れ目になる時刻\\n double divtime = time +abs(s -route[0])/vn +sumtime.back()/2;\\n divtime = fmod(divtime, sumtime.back());\\n \\n //二分探索でどの頂点間かを求める\\n int sidx, lb=0, ub;\\n auto itr = lower_bound(sumtime.begin(), sumtime.end(), divtime);\\n if(EQ(*itr, divtime)){\\n sidx = itr -sumtime.begin();\\n ub = n;\\n }else{\\n sidx = (itr -sumtime.begin() +n-1) %n;\\n ub = n+1;\\n }\\n int count = 0;\\n while(ub -lb > 1){\\n if(count++ >10) break;\\n int mid = (ub +lb)/2;\\n int mididx = (sidx +mid) %n;\\n double t = time +abs(s -route[mididx])/vn;\\n t = fmod(t, sumtime.back());\\n if(in_range(divtime, sumtime[mididx], t)){\\n ub = mid;\\n }else{\\n lb = mid;\\n }\\n }\\n\\n P a=route[(sidx+lb)%n], b=route[(sidx+ub)%n];\\n P ab = (b-a)/abs(b-a);\\n double dlb=0, dub=abs(a-b);\\n for(int rep=0; rep<50; rep++){\\n double mid = (dlb +dub) /2.0;\\n P midP = a +mid*ab;\\n double t = time +abs(s -midP)/vn;\\n t = fmod(t, sumtime.back());\\n if(in_range(divtime, fmod(sumtime[(sidx+lb)%n] +mid/vc, sumtime.back()), t)){\\n dub = mid;\\n }else{\\n dlb = mid;\\n }\\n }\\n P midP = a +dlb*ab;\\n return make_pair(midP, time +abs(s -midP)/vn);\\n}\\n\\nint bitcount(int n){\\n n = (n & 0x55555555) + (n >> 1 & 0x55555555);\\n n = (n & 0x33333333) + (n >> 2 & 0x33333333);\\n n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);\\n n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);\\n return (n & 0x0000ffff) + (n >>16 & 0x0000ffff);\\n}\\n\\nint main(){\\n int dataset;\\n cin >> dataset;\\n for(int rep=0; rep<dataset; rep++){\\n P s,g;\\n {\\n int sx,sy,gx,gy;\\n cin >> sx >> sy >> gx >> gy;\\n s = P(sx, sy);\\n g = P(gx, gy);\\n }\\n int begintime,endtime;\\n {\\n int hh,mm,ss;\\n scanf(\\\"%d:%d:%d\\\", &hh, &mm, &ss);\\n begintime = hh*3600 +mm*60 +ss;\\n scanf(\\\"%d:%d:%d\\\", &hh, &mm, &ss);\\n endtime = hh*3600 +mm*60 +ss;\\n }\\n double tlimit = endtime -begintime;\\n\\n int n;\\n cin >> n;\\n //巡回ルート\\n vector<VP> route(n);\\n for(int i=0; i<n; i++){\\n int size;\\n cin >> size;\\n route[i].resize(size);\\n for(int j=0; j<size; j++){\\n int x,y;\\n cin >> x >> y;\\n route[i][j] = P(x, y);\\n }\\n }\\n //各頂点までにかかる時間の累積和\\n vector<vector<double> > sumtime(n);\\n for(int i=0; i<n; i++){\\n int size = route[i].size();\\n sumtime[i].resize(size +1);\\n sumtime[i][0] = 0;\\n for(int j=0; j<size; j++){\\n sumtime[i][j+1] = sumtime[i][j] + abs(route[i][j] -route[i][(j+1)%size]) /vc;\\n }\\n }\\n\\n //dp[i][j] = (集合iを確保,最後にjをとったときの最短時刻)\\n vector<vector<double> > dp(1<<n, vector<double>(n, INF));\\n vector<vector<P> > pos(1<<n, vector<P>(n));\\n for(int i=0; i<n; i++){\\n auto ret = fastest_catch(s, 0, route[i], sumtime[i]);\\n pos[1<<i][i] = ret.first;\\n dp[1<<i][i] = ret.second;\\n }\\n\\n int maxnum = 0;\\n double mintime = abs(s -g) /vn;\\n for(int i=1; i<(1<<n); i++){\\n for(int j=0; j<n; j++){\\n if(dp[i][j] == INF) continue;\\n //ここから出口に直行しても間に合わないなら打ち切り\\n double time = dp[i][j] +abs(pos[i][j] -g)/vn;\\n if(time > tlimit) continue;\\n //スコア更新(なるべく多く、なるべく早く)\\n if(bitcount(i) == maxnum && time < mintime){\\n mintime = time;\\n }else if(bitcount(i) > maxnum){\\n maxnum = bitcount(i);\\n mintime = time;\\n }\\n \\n for(int k=0; k<n; k++){\\n if(i>>k & 1) continue;\\n auto ret = fastest_catch(pos[i][j], dp[i][j], route[k], sumtime[k]);\\n if(ret.second < dp[i|(1<<k)][k]){\\n pos[i|(1<<k)][k] = ret.first;\\n dp[i|(1<<k)][k] = ret.second;\\n }\\n }\\n }\\n }\\n\\n int integer_part = begintime +mintime +EPS;\\n double fractional_part = begintime +mintime -integer_part;\\n int hh = integer_part /3600;\\n integer_part %= 3600;\\n int mm = integer_part /60;\\n double ss = integer_part %60 +fractional_part;\\n printf(\\\"%d\\\\n\\\", maxnum);\\n printf(\\\"%02d %02d %09.6f\\\\n\\\", hh, mm, ss);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6480,\n \"memory_kb\": 10092,\n \"score_of_the_acc\": -0.4586,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2194_426779\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\n#include <complex>\\ntypedef complex<double> Point;\\n\\nint HtoS(int h, int m, int s) {\\n return h * 3600 + m * 60 + s;\\n}\\nstring StoH(double sec) {\\n int h = (int)sec / 3600;\\n int m = (int)sec % 3600 / 60;\\n double ms = sec - (h * 3600 + m * 60);\\n char str[1000];\\n sprintf(str, \\\"%02d %02d %02d.%08d\\\", h, m, (int)ms, (int)((ms - (int)ms) * 100000000 + 0.5));\\n return str;\\n}\\n\\nstruct State {\\n int use;\\n double t;\\n Point p;\\n int last;\\n State() {;}\\n State(int use, double t, Point p, int last) : use(use), t(t), p(p), last(last) {;}\\n bool operator<(const State &rhs) const {\\n return t > rhs.t;\\n }\\n};\\n\\nconst double SPEED_N = 80.0 / 60.0;\\nconst double SPEED_C = 50.0 / 60.0;\\nPoint sp, ep;\\nint startTime;\\nint endTime;\\nint n;\\nvector<Point> route[20];\\nvector<double> ts[20];\\n\\nint bisect(State state, int target) {\\n int lower = 0;\\n int upper = 1 << 20;\\n while (lower != upper) {\\n int mid = (lower + upper) / 2;\\n int cycle = mid / ts[target].size();\\n int index = mid % ts[target].size();\\n double et = cycle * ts[target].back() + ts[target][index] + startTime;\\n Point p = route[target][(index + 1) % route[target].size()];\\n if (abs(state.p - p) / SPEED_N - (et - state.t) <= -EPS) {\\n upper = mid;\\n } else {\\n lower = mid + 1;\\n if (et >= endTime) { break; }\\n }\\n }\\n return lower;\\n}\\n\\npair<double, Point> calc(State state, int target) {\\n int from = bisect(state, target);\\n double lower;\\n double upper;\\n {\\n int cycle = from / ts[target].size();\\n int index = from % ts[target].size();\\n lower = cycle * ts[target].back() + startTime;\\n if (index != 0) {\\n lower += ts[target][index - 1];\\n }\\n upper = cycle * ts[target].back() + ts[target][index] + startTime + EPS * 10;\\n }\\n double stime = lower;\\n pair<double, Point> ret(endTime + 1, Point(0, 0));\\n if (lower > endTime) { return ret; }\\n from %= ts[target].size();\\n Point vect = route[target][(from + 1) % route[target].size()] - route[target][from];\\n vect /= abs(vect);\\n bool ok = false;\\n REP(i, 50) {\\n double mid = (lower + upper) / 2.0;\\n double t = mid - stime;\\n Point tp = route[target][from] + vect * (t * SPEED_C);\\n if (abs(state.p - tp) / SPEED_N <= mid - state.t) {\\n upper = mid;\\n ret = make_pair(mid, tp);\\n ok = true;\\n } else {\\n lower = mid;\\n }\\n }\\n double t = lower - stime;\\n Point tp = route[target][from] + vect * (t * SPEED_C);\\n //cout << abs(state.p - tp) / SPEED_N << \\\" \\\" << lower - state.t << endl;\\n assert(ok);\\n return ret;\\n}\\n\\nbool visit[1 << 14][15];\\ndouble times[1 << 14][15];\\nint main() {\\n int test;\\n scanf(\\\"%d\\\", &test);\\n double sx, sy, ex, ey;\\n while (scanf(\\\"%lf %lf %lf %lf\\\", &sx, &sy, &ex, &ey) > 0) {\\n sp = Point(sx, sy);\\n ep = Point(ex, ey);\\n {\\n int h, m, s;\\n scanf(\\\"%d:%d:%d\\\", &h, &m, &s);\\n startTime = HtoS(h, m, s);\\n scanf(\\\"%d:%d:%d\\\", &h, &m, &s);\\n endTime = HtoS(h, m, s);\\n }\\n scanf(\\\"%d\\\", &n);\\n REP(i, n) {\\n route[i].clear();\\n ts[i].clear();\\n int k;\\n scanf(\\\"%d\\\", &k);\\n REP(j, k) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n route[i].push_back(Point(x, y));\\n }\\n double pt = 0.0;\\n REP(j, k) {\\n ts[i].push_back(pt + abs(route[i][j] - route[i][(j + 1) % route[i].size()]) / SPEED_C);\\n pt = ts[i].back();\\n }\\n }\\n\\n REP(i, 1 << 14) REP(j, 15) { times[i][j] = endTime + EPS * 2; }\\n MEMSET(visit, false);\\n priority_queue<State> que;\\n que.push(State(0, startTime, sp, 14));\\n pair<int, double> ans(-1, -1e+100);\\n while (!que.empty()) {\\n State state = que.top();\\n que.pop();\\n if (visit[state.use][state.last]) { continue; }\\n //cout << state.use << \\\" \\\" << state.last << \\\" \\\"<< state.t << endl;\\n visit[state.use][state.last] = true;\\n {\\n double et = state.t + abs(state.p - ep) / SPEED_N;\\n if (et > endTime) { continue; }\\n pair<int, double> lans(__builtin_popcount(state.use), -et);\\n ans = max(ans, lans);\\n }\\n REP(i, n) {\\n if ((state.use >> i) & 1) { continue; }\\n int nuse = state.use | (1 << i);\\n if (visit[nuse][i]) { continue; }\\n pair<double, Point> next = calc(state, i);\\n if (next.first - times[nuse][i] > EPS) { continue; }\\n times[nuse][i] = next.first;\\n que.push(State(nuse, next.first, next.second, i));\\n }\\n }\\n printf(\\\"%d\\\\n%s\\\\n\\\", ans.first, StoH(-ans.second).c_str());\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7920,\n \"memory_kb\": 13000,\n \"score_of_the_acc\": -2,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1192,"cells":{"group_id":{"kind":"string","value":"aoj_2191_cpp"},"problem_description":{"kind":"string","value":"Problem G:\n挨拶の多い本屋さん\nなつめは大のねこ好きである。なつめはある日、いつも親しくしている野良ねこたちから、ねこたちが開いている不思議な本屋に行こうと誘われた。その本屋ではたくさんのねこの写真が載った本が売られていると聞き、なつめは喜んでついていくことにした。\nなつめは知らなかったのだが、ねこたちに連れられていった本屋は全国にチェーン店を持つ有名店であった。その店ではしっかりとした店員用マニュアルが用意されており、どの店舗でも店員の行動が統一されている。以下はそのマニュアルからの抜粋である。\n店員からユークリッド距離10以内のドアからお客様が入店された際には、\nX\n秒間かけて大声で「いらっしゃいませこんにちは」といわなければならない。\nユークリッド距離50以内の他の店員が「いらっしゃいませこんにちは」と言っているのを聞いた店員は、その「いらっしゃいませこんにちは」の発声終了時に「いらっしゃいませこんにちは」と\nX\n秒かけて大声で復唱しなければならない。ただし、この復唱の発声開始時から過去\nY\n秒以内に、別の「いらっしゃいませこんにちは」を発声完了していた店員は、復唱してはならない。\nX\n,\nY\n, 客の位置、店員の配置が与えられるので、客が入ってから店が静かになるまで何秒かかるか計算せよ。復唱が鳴り止まない場合は、\"You're always welcome!\"と出力せよ。\nInput\n入力の1行目には、店員の数\nN\n、およびマニュアルに書かれている\nX\n,\nY\nがそれぞれ1つの空白文字で区切られて与えられる。2行目はなつめが入店する位置であり、それに続く\nN\n行は\nN\n人の店員の位置を表す座標である。それぞれの位置は\nx\n,\ny\n座標を1つの空白文字で区切って与えられ、各数値とも0以上1000以下の整数で与えられる。また、1 <=\nN\n<= 1000, 1 <=\nX\n,\nY\n<= 100を満たす。\nOutput\n復唱が鳴り止む場合は客が入店してから静かになるまでの時間を、鳴り止まない場合は \"You're always welcome!\" を1行に出力せよ。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n4\n3 3 5\n0 0\n10 0\n40 40\n40 90\n4 5 10\n100 100\n50 100\n50 150\n100 50\n100 150\n4 60 10\n100 100\n90 100\n110 100\n100 90\n100 110\n4 60 10\n100 100\n80 100\n110 100\n100 80\n100 110\nOutput for the Sample Input\n9\n0\n60\nYou're always welcome!"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2191_2660721","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nstruct Point{\n\tdouble x,y;\n};\n\nint N,X,Y,pre_time[1000];\nPoint customer,point[1000];\nbool near_customer[1000];\nbool check[1000];\nvector<int> NEAR[1000];\n\n\ndouble calc_dist(Point a,Point b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\n}\n\nvoid func(){\n\n\tscanf(\"%d %d %d\",&N,&X,&Y);\n\n\tfor(int i = 0; i < N; i++)NEAR[i].clear();\n\n\tscanf(\"%lf %lf\",&customer.x,&customer.y);\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lf %lf\",&point[i].x,&point[i].y);\n\t\tnear_customer[i] = (calc_dist(point[i],customer) <= 10.0);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(calc_dist(point[i],point[k]) <= 50.0){\n\t\t\t\tif(i != k)NEAR[i].push_back(k);\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans;\n\tvector<int> V,NEXT;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(near_customer[i]){\n\t\t\tpre_time[i] = X;\n\t\t\tV.push_back(i);\n\t\t}else{\n\t\t\tpre_time[i] = -1;\n\t\t}\n\t}\n\n\tif(V.size() == 0){\n\t\tprintf(\"0\\n\");\n\t\treturn;\n\t}\n\n\tans = X;\n\n\twhile(true){\n\n\t\tfor(int i = 0; i < N; i++)check[i] = false;\n\t\tfor(int i = 0; i < V.size(); i++){\n\t\t\tfor(int k = 0; k < NEAR[V[i]].size(); k++){\n\t\t\t\tcheck[NEAR[V[i]][k]] = true;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(check[i]){\n\t\t\t\tif(pre_time[i] == -1){\n\t\t\t\t\tpre_time[i] = ans+X;\n\t\t\t\t\tNEXT.push_back(i);\n\t\t\t\t}else if(pre_time[i] != -1 && ans-pre_time[i] > Y){\n\t\t\t\t\tprintf(\"You're always welcome!\\n\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(NEXT.size() == 0)break;\n\t\tV.clear();\n\t\tfor(int i = 0; i < NEXT.size(); i++)V.push_back(NEXT[i]);\n\t\tNEXT.clear();\n\t\tans += X;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\tint case_num;\n\tscanf(\"%d\",&case_num);\n\n\tfor(int i = 0; i < case_num; i++)func();\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":7076,"score_of_the_acc":-0.4332,"final_rank":14},{"submission_id":"aoj_2191_2641295","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nint main() {\n\tint T;cin>>T;\n\twhile (T--) {\n\t\tint N,X,Y;cin>>N>>X>>Y;\n\t\tint in_x, in_y; cin >> in_x >> in_y;\n\t\tvector<pair<int,int>>ps;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint x,y;cin>>x>>y;\n\t\t\tps.emplace_back(x,y);\n\t\t}\n\t\tvector<vector<int>>edges(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tif (i != j) {\n\t\t\t\t\tint dis=(ps[i].first-ps[j].first)*(ps[i].first-ps[j].first)+\n\t\t\t\t\t\t(ps[i].second-ps[j].second)*(ps[i].second-ps[j].second);\n\t\t\t\t\tif (dis <= 2500) {\n\t\t\t\t\t\tedges[i].push_back(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint time=0;\n\t\tvector<int>pres(N, -1000);\n\t\tvector<int>nowsays;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tint dis=(ps[i].first-in_x)*(ps[i].first-in_x)+(ps[i].second-in_y)*(ps[i].second-in_y);\n\t\t\tif (dis <= 100) {\n\t\t\t\tnowsays.push_back(i);\n\t\t\t\tpres[i]=-1;\n\t\t\t}\n\t\t}\n\t\tint w_count=(Y)/X;\n\t\tbool ok = true;\n\t\twhile (!nowsays.empty()) {\n\t\t\tvector<int>flags(N);\n\t\t\tfor (auto ns : nowsays) {\n\t\t\t\tfor (auto e : edges[ns]) {\n\t\t\t\t\tflags[e]=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvector<int>nextsays;\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tif (flags[i]) {\n\t\t\t\t\tif (pres[i] == -1000) {\n\t\t\t\t\t\tnextsays.push_back(i);\n\t\t\t\t\t\tpres[i]=time;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif (pres[i] + w_count+1 < time) {\n\t\t\t\t\t\t\tok=false;\n\t\t\t\t\t\t}else{\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\tnowsays=nextsays;\n\t\t\ttime++;\n\t\t\tif(!ok)break;\n\t\t}\n\t\tif (ok) {\n\t\t\tcout<<time*X<<endl;\n\t\t}else{\n\t\t\tcout<< \"You're always welcome!\"<<endl;\n\t\t}\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6816,"score_of_the_acc":-0.3636,"final_rank":13},{"submission_id":"aoj_2191_1906021","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<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint main(){\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tint n,X,Y;\n\t\tcin>>n>>X>>Y;\n\t\tvvi G(n);\n\t\tint x,y;cin>>x>>y;\n\t\tvi a(n),b(n);\n\t\trep(i,n)cin>>a[i]>>b[i];\n\t\trep(i,n)rep(j,n)if(i!=j&&hypot(a[i]-a[j],b[i]-b[j])<EPS+50){\n\t\t\tG[i].pb(j);\n\t\t\tG[j].pb(i);\n\t\t}\n\t\tvi in(n,-2000);\n\t\tint out=0;\n\t\trep(i,n)if(hypot(x-a[i],y-b[i])<EPS+10)in[i]=X,out=X;\n\t\twhile(1){\n\t\t\tvi ne=in;\n\t\t\tint t=out;\n\t\t\trep(i,n)if(in[i]==t){\n\t\t\t\trep(j,G[i].size())if(in[i]-Y>in[G[i][j]]){\n\t\t\t\t\tout=ne[G[i][j]]=t+X;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(in==ne){\n\t\t\t\tcout<<out<<endl;\n\t\t\t\tgoto end;\n\t\t\t}\n\t\t\tif(out>1e5)break;\n\t\t\tin=ne;\n\t\t}\n\t\tcout<<\"You're always welcome!\"<<endl;\n\t\tend:;\n\t}\n}","accuracy":1,"time_ms":220,"memory_kb":9188,"score_of_the_acc":-1.1086,"final_rank":19},{"submission_id":"aoj_2191_1889480","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 1010\n \nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) : x(x),y(y) {}\n};\n \nint N,X,Y;\nvector<int> G[MAX];\n \ndouble getDist(Point &a,Point &b){\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\n}\n \nvoid init(){\n for(int i = 0 ; i < MAX ; i++){\n\tG[i].clear();\n } \n}\n \nvoid solve(){\n int d[MAX] = {0};\n queue<int> Q; Q.push(0);\n bool can = true;\n \n while(!Q.empty()){\n\tint v = Q.front(); Q.pop();\n\tfor(int i = 0 ; i < (int)G[v].size() ; i++){\n\t int to = G[v][i];\n\t if(d[to] == 0){\n\t\td[to] = d[v] + 1;\n\t\tif(v > 0 && X > Y) can = false;\n\t\tQ.push(to);\n\t }\n\t}\n }\n \n if(can){\n\tcout << *max_element(d+1,d+N+1)*X << endl;\n }else{\n\tcout << \"You're always welcome!\" << endl;\n }\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n\tinit();\n\tPoint sp;\n\tvector<Point> p;\n\tcin >> N >> X >> Y;\n\tcin >> sp.x >> sp.y;\n\tp.resize(N);\n\tfor(int i = 0 ; i < N ; i++){\n\t cin >> p[i].x >> p[i].y;\n\t if(getDist(sp,p[i]) <= 10){\n\t\tG[0].push_back(i+1);\n\t }\n\t}\n\tfor(int i = 0 ; i < N ; i++){\n\t for(int j = 0 ; j < N ; j++){\n\t\tif(i == j) continue;\n\t\tif(getDist(p[i],p[j]) <= 50){\n\t\t G[i+1].push_back(j+1);\n\t\t}\n\t }\n\t}\n\tsolve();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7096,"score_of_the_acc":-0.4479,"final_rank":15},{"submission_id":"aoj_2191_1430620","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000;\n\nconst int INF = 1 << 30;\nconst int DD = 10;\nconst int PD = 50;\n\n/* typedef */\n\ntypedef vector<int> vi;\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& pt) : x(pt.x), y(pt.y) {}\n\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\n Pt<T> operator+(const Pt 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 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 v) const { return x * v.x + y * v.y; }\n T cross(Pt v) const { return x * v.y - y * v.x; }\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\n T d2() { return x * x + y * y; }\n double d() { return sqrt(d2()); }\n\n Pt<T> rot(double th) {\n double c = cos(th), s = sin(th);\n return Pt<T>(c * x - s * y, s * x + c * y);\n }\n\n Pt<T> rot90() { return Pt<T>(-y, x); }\n\n bool operator<(const Pt& pt) const {\n return x < pt.x || (x == pt.x && y < pt.y);\n }\n\n void print(string format) {\n printf((\"(\" + format + \", \" + format + \")\\n\").c_str(), x, y);\n }\n void print() { print(\"%.6lf\"); }\n};\n\ntypedef Pt<int> pt;\n\n/* global variables */\n\nint n, x, y;\npt dr, pts[MAX_N];\nvi nbrs[MAX_N];\nint dists[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int tn;\n cin >> tn;\n\n while (tn--) {\n cin >> n >> x >> y;\n cin >> dr.x >> dr.y;\n for (int i = 0; i < n; i++) cin >> pts[i].x >> pts[i].y;\n\n for (int i = 0; i < n; i++) {\n dists[i] = -INF;\n nbrs[i].clear();\n }\n \n for (int i = 0; i < n; i++)\n for (int j = i + 1; j < n; j++)\n\tif ((pts[j] - pts[i]).d2() <= PD * PD) {\n\t nbrs[i].push_back(j);\n\t nbrs[j].push_back(i);\n\t}\n\n memset(used, false, sizeof(used));\n \n queue<int> q;\n for (int i = 0; i < n; i++)\n if ((pts[i] - dr).d2() <= DD * DD)\n\tq.push(i), dists[i] = x, used[i] = true;\n\n int max_d = 0;\n bool always = false;\n \n while (! q.empty()) {\n int u = q.front(); q.pop();\n int ud = dists[u];\n if (max_d < ud) max_d = ud;\n\n int nvd = ud + x;\n vi& nbru = nbrs[u];\n\n for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\n\tint& v = *vit;\n\n\tif (dists[v] < ud - y) {\n\t if (used[v]) {\n\t always = true;\n\t break;\n\t }\n\n\t q.push(v);\n\t dists[v] = nvd;\n\t used[v] = true;\n\t}\n }\n\n if (always) break;\n }\n //cout << always << ' ' << max_d << endl;\n\n if (always)\n cout << \"You're always welcome!\" << endl;\n else\n cout << max_d << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5340,"score_of_the_acc":-0.0256,"final_rank":5},{"submission_id":"aoj_2191_1369744","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef long long ll;\n\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define pb push_back\n\n\nint dist( pii a,pii b){\n int y=a.first-b.first;\n int x=a.second-b.second;\n \n return (x*x + y*y);\n}\n\n\n\nint main(){\n int loop;\n cin>>loop;\n rep(i,loop){\n \n int n,x,y;\n cin>>n>>x>>y;\n \n pii start;\n cin>>start.second>>start.first;\n \n pii cat[2000];\n rep(i,n){\n cin>>cat[i].second>>cat[i].first;\n }\n \n// if( x>=y ){cout<<\"You're always welcome!\"<<endl;continue;}\n \n vi connect[2000];\n \n rep(i,n){\n rep(j,n){\n if(i!=j){\n if( dist(cat[i],cat[j])<=2500 ){\n connect[i].pb(j);\n connect[j].pb(i);\n }\n }\n }\n }\n \n int used[2000];\n rep(i,2000)used[i]=-9999;\n\n queue<int> que;\n \n rep(i,n){\n if( dist(start,cat[i])<=100 ){\n que.push(i);\n used[i]=x;\n }\n }\n int term=0;\n if( que.size() )term++;\n \n int now=0;\n int times=0;\n while(que.size()){\n times++;\n now=term*x;\n int len=que.size();\n rep(i,len){\n int qf=que.front();\n for( int j=0;j<connect[qf].size();j++){\n int connected = connect[qf][j];\n if( now-used[ connected ]>y ){\n que.push( connected );\n used[ connected ] = now+x;\n }\n }\n que.pop();\n }\n if(times>2000)break;\n term++;\n }\n \n// while( que.size() ){\n// now=term*x;\n// bool flag=true;\n// times++;\n// int qf=que.front();\n// for( int i=0;i<connect[qf].size();i++ ){\n// int connected = connect[qf][i];\n// if( now-used[ connected ]>y ){ // >= ?\n// if(flag)term++;\n// flag=false;\n// que.push( connected );\n// used[ connected ]=now+x; // now+x-1 ?\n// }\n// }\n// que.pop();\n// if(times>10000)break;\n// }\n \n \n if(times>2000)cout<<\"You're always welcome!\"<<endl;\n else cout<<now<<endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":9432,"score_of_the_acc":-1.0029,"final_rank":17},{"submission_id":"aoj_2191_1369647","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nint N,T;\n \nvector<int> G[1111];\nbool F[1111][1111];\nint X,Y;\n \nint dub(int a){ return a*a; }\nint abs( P a, P b ){\n return dub(a.first-b.first)+dub(a.second-b.second);\n}\n \nint main(){\n cin >> T;\n while( T-- ){\n for(int i=0;i<N;i++) G[i].clear();\n cin >> N >> X >> Y;\n P s;\n cin >> s.first >> s.second;\n P v[1111];\n for(int i=0;i<N;i++)\n cin>> v[i].first >> v[i].second; \n queue<int> q;\n int H[1111] = {};\n for(int i=0;i<N;i++){\n if( abs( s, v[i] ) <= 10*10 ) {\n q.push( i );\n H[i] = X;\n }\n for(int j=i+1;j<N;j++){ \n if( abs(v[i],v[j]) <= 50*50 ){\n G[i].push_back( j );\n G[j].push_back( i );\n }\n }\n }\n \n memset(F,0,sizeof(F));\n int res = 0;\n while( !q.empty() ){\n int p = q.front(); q.pop();\n int time = H[p];\n res = max( res, time );\n // cout<< p << \" \"<< time << endl;\n for(int i=0;i<(int)G[p].size();i++){\n int to =G[p][i];\n if( H[to] > 0 && H[to] >= time - Y ) continue;\n if( F[i][to] ){\n res = -1; goto end;\n }\n F[i][to] = true;\n q.push( to );\n H[to] = time + X;\n }\n }\n end:;\n if( res == -1 ) cout << \"You're always welcome!\" << endl;\n else cout << res << endl;\n }\n \n}","accuracy":1,"time_ms":20,"memory_kb":6532,"score_of_the_acc":-0.2985,"final_rank":11},{"submission_id":"aoj_2191_1366959","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <complex>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n \nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-12;\n\nint main(){\n int total_test_cases;\n while(~scanf(\"%d\",&total_test_cases)){\n for(int test_i = 0; test_i < total_test_cases; test_i++){\n int total_staff;\n int speech_duration,prohibited_duration;\n\n scanf(\"%d %d %d\",&total_staff,\n &speech_duration,&prohibited_duration);\n int customer_x,customer_y;\n scanf(\"%d %d\",&customer_x,&customer_y);\n complex<int> customer(customer_x,customer_y);\n\n vector<complex<int> > staff;\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n int x,y;\n scanf(\"%d %d\",&x,&y);\n staff.push_back(complex<int>(x,y));\n }\n \n int latest_speech_finished_time[1001];\n memset(latest_speech_finished_time,-1,sizeof(latest_speech_finished_time));\n queue<int> que;\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n if((staff[staff_i].real() - customer.real()) * (staff[staff_i].real() - customer.real())\n + (staff[staff_i].imag() - customer.imag()) * (staff[staff_i].imag() - customer.imag()) > 100) continue;\n que.push(staff_i);\n latest_speech_finished_time[staff_i] = speech_duration;\n }\n \n vector<int> edges[1001];\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n for(int staff_j = 0; staff_j < total_staff; staff_j++){\n if(staff_i == staff_j) continue;\n if((staff[staff_i].real() - staff[staff_j].real()) * (staff[staff_i].real() - staff[staff_j].real())\n + (staff[staff_i].imag() - staff[staff_j].imag()) * (staff[staff_i].imag() - staff[staff_j].imag()) > 2500) continue;\n edges[staff_i].push_back(staff_j);\n }\n }\n\n bool isok = false;\n for(int round = 0; round < 100000; round++){\n queue<int> next;\n bool visited[1001] = {};\n while(!que.empty()){\n int staff_i = que.front();\n que.pop();\n for(int i = 0; i < edges[staff_i].size(); i++){\n int staff_j = edges[staff_i][i];\n if(latest_speech_finished_time[staff_j] == -1 \n || (latest_speech_finished_time[staff_j] + prohibited_duration\n < latest_speech_finished_time[staff_i])){\n if(visited[staff_j]) continue;\n next.push(staff_j);\n visited[staff_j] = true;\n latest_speech_finished_time[staff_j]\n = latest_speech_finished_time[staff_i] + speech_duration;\n }\n }\n }\n if(next.empty()){\n isok = true;\n break;\n }\n que = next;\n }\n \n int res = 0;\n for(int i = 0; i < total_staff; i++){\n res = max(res,latest_speech_finished_time[i]);\n }\n if(isok){\n printf(\"%d\\n\",res);\n }\n else{\n printf(\"You're always welcome!\\n\");\n }\n }\n }\n}","accuracy":1,"time_ms":910,"memory_kb":5264,"score_of_the_acc":-0.9072,"final_rank":16},{"submission_id":"aoj_2191_1366957","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n#include <complex>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P > PP;\n \nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-8;\n\nint main(){\n int total_test_cases;\n while(~scanf(\"%d\",&total_test_cases)){\n for(int test_i = 0; test_i < total_test_cases; test_i++){\n int total_staff;\n int speech_duration,prohibited_duration;\n\n scanf(\"%d %d %d\",&total_staff,\n &speech_duration,&prohibited_duration);\n double customer_x,customer_y;\n scanf(\"%lf %lf\",&customer_x,&customer_y);\n vector<complex<double> > staff;\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n double x,y;\n scanf(\"%lf %lf\",&x,&y);\n staff.push_back(complex<double>(x,y));\n }\n \n int latest_speech_finished_time[1001];\n memset(latest_speech_finished_time,-1,sizeof(latest_speech_finished_time));\n queue<int> que;\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n if(abs(staff[staff_i] - complex<double>(customer_x,customer_y)) > 10.0) continue;\n que.push(staff_i);\n latest_speech_finished_time[staff_i] = speech_duration;\n }\n \n vector<int> edges[1001];\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\n for(int staff_j = 0; staff_j < total_staff; staff_j++){\n if(staff_i == staff_j) continue;\n if(abs(staff[staff_i] - staff[staff_j]) > 50.0) continue;\n edges[staff_i].push_back(staff_j);\n }\n }\n\n bool isok = false;\n for(int round = 0; round < 100000; round++){\n queue<int> next;\n bool visited[1001] = {};\n while(!que.empty()){\n int staff_i = que.front();\n que.pop();\n for(int i = 0; i < edges[staff_i].size(); i++){\n int staff_j = edges[staff_i][i];\n if(latest_speech_finished_time[staff_j] == -1 \n || (latest_speech_finished_time[staff_j] + prohibited_duration\n < latest_speech_finished_time[staff_i])){\n if(visited[staff_j]) continue;\n next.push(staff_j);\n visited[staff_j] = true;\n latest_speech_finished_time[staff_j]\n = latest_speech_finished_time[staff_i] + speech_duration;\n }\n }\n }\n if(next.empty()){\n isok = true;\n break;\n }\n que = next;\n }\n \n int res = 0;\n for(int i = 0; i < total_staff; i++){\n res = max(res,latest_speech_finished_time[i]);\n }\n if(isok){\n printf(\"%d\\n\",res);\n }\n else{\n printf(\"You're always welcome!\\n\");\n }\n }\n }\n}","accuracy":1,"time_ms":1010,"memory_kb":5320,"score_of_the_acc":-1.0211,"final_rank":18},{"submission_id":"aoj_2191_1366915","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 1010\n \nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) : x(x),y(y) {}\n};\n \nint N,X,Y;\nvector<int> G[MAX];\n \ndouble getDist(Point &a,Point &b){\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\n}\n \nvoid init(){\n for(int i = 0 ; i < MAX ; i++){\n G[i].clear();\n } \n}\n \nvoid solve(){\n int d[MAX] = {0};\n queue<int> Q; Q.push(0);\n bool can = true;\n \n while(!Q.empty()){\n int v = Q.front(); Q.pop();\n for(int i = 0 ; i < (int)G[v].size() ; i++){\n int to = G[v][i];\n if(d[to] == 0){\n d[to] = d[v] + 1;\n if(v > 0 && X > Y){\n can = false;\n break;\n }\n Q.push(to);\n }\n }\n if(!can){ break; }\n }\n \n if(can){\n cout << *max_element(d+1,d+N+1)*X << endl;\n }else{\n cout << \"You're always welcome!\" << endl;\n }\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n init();\n Point sp;\n vector<Point> p;\n cin >> N >> X >> Y;\n cin >> sp.x >> sp.y;\n p.resize(N);\n for(int i = 0 ; i < N ; i++){\n cin >> p[i].x >> p[i].y;\n if(getDist(sp,p[i]) <= 10){\n G[0].push_back(i+1);\n }\n }\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < N ; j++){\n if(i == j){ continue; }\n if(getDist(p[i],p[j]) <= 50){\n G[i+1].push_back(j+1);\n }\n }\n }\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5316,"score_of_the_acc":-0.0606,"final_rank":9},{"submission_id":"aoj_2191_1366910","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX 1010\n \nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) : x(x),y(y) {}\n};\n \nint N,X,Y;\nvector<int> G[MAX];\n \ndouble getDist(Point &a,Point &b){\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\n}\n \nvoid init(){\n for(int i = 0 ; i < MAX ; i++){\n G[i].clear();\n } \n}\n \nvoid solve(){\n int d[MAX] = {0};\n queue<int> Q; Q.push(0);\n bool can = true;\n \n while(!Q.empty()){\n int v = Q.front(); Q.pop();\n for(int i = 0 ; i < (int)G[v].size() ; i++){\n int to = G[v][i];\n if(d[to] == 0){\n d[to] = d[v] + 1;\n if(v > 0 && X > Y){ can = false; }\n Q.push(to);\n }\n }\n }\n \n if(can){\n cout << *max_element(d+1,d+N+1)*X << endl;\n }else{\n cout << \"You're always welcome!\" << endl;\n }\n}\n \nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n init();\n Point sp;\n vector<Point> p;\n cin >> N >> X >> Y;\n cin >> sp.x >> sp.y;\n p.resize(N);\n for(int i = 0 ; i < N ; i++){\n cin >> p[i].x >> p[i].y;\n if(getDist(sp,p[i]) <= 10){\n G[0].push_back(i+1);\n }\n }\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < N ; j++){\n if(i == j){ continue; }\n if(getDist(p[i],p[j]) <= 50){\n G[i+1].push_back(j+1);\n }\n }\n }\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5312,"score_of_the_acc":-0.0596,"final_rank":8},{"submission_id":"aoj_2191_1366622","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 1010\n\nstruct Point{\n double x,y;\n Point(){}\n Point(double x,double y) : x(x),y(y) {}\n};\n\nint N,X,Y;\nPoint sp;\nvector<Point> p;\nvector<int> G[MAX];\n\ndouble getDist(Point &a,Point &b){\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\n}\n\nvoid init(){\n for(int i = 0 ; i < MAX ; i++){\n G[i].clear();\n } \n}\n\nvoid solve(){\n int res = 0;\n queue<int> que;\n que.push(0);\n int d[N+1];\n memset(d,0,sizeof(d));\n bool ok=1;\n while(!que.empty()) {\n int x=que.front();que.pop();\n for(int i=0; i<G[x].size(); i++) {\n int y=G[x][i];\n if(d[y]) continue;\n if(x && X>Y) ok=0;\n d[y]=d[x]+1;\n que.push(y);\n }\n }\n for(int i=1; i<=N; i++) res=max(res,d[i]*X);\n if(ok) cout << res << endl;\n else cout << \"You're always welcome!\" << endl;\n}\n\nint main(){\n int Tc;\n cin >> Tc;\n while(Tc--){\n init();\n cin >> N >> X >> Y;\n cin >> sp.x >> sp.y;\n p.resize(N);\n for(int i = 0 ; i < N ; i++){\n cin >> p[i].x >> p[i].y;\n if(getDist(sp,p[i]) <= 10){\n\tG[0].push_back(i+1);\n }\n }\n for(int i = 0 ; i < N ; i++){\n for(int j = 0 ; j < N ; j++){\n\tif(i == j){ continue; }\n\tif(getDist(p[i],p[j]) <= 50){\n\t G[i+1].push_back(j+1);\n\t}\n }\n }\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":5324,"score_of_the_acc":-0.0624,"final_rank":10},{"submission_id":"aoj_2191_1366527","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\nint N,T;\n\nvector<int> G[1111];\nbool F[1111][1111];\nint X,Y;\n\nint dub(int a){ return a*a; }\nint abs( P a, P b ){\n return dub(a.first-b.first)+dub(a.second-b.second);\n}\n\nint main(){\n cin >> T;\n while( T-- ){\n for(int i=0;i<N;i++) G[i].clear();\n cin >> N >> X >> Y;\n P s;\n cin >> s.first >> s.second;\n P v[1111];\n for(int i=0;i<N;i++)\n cin>> v[i].first >> v[i].second; \n queue<int> q;\n int H[1111] = {};\n for(int i=0;i<N;i++){\n if( abs( s, v[i] ) <= 10*10 ) {\n q.push( i );\n H[i] = X;\n }\n for(int j=i+1;j<N;j++){ \n if( abs(v[i],v[j]) <= 50*50 ){\n G[i].push_back( j );\n G[j].push_back( i );\n }\n }\n }\n \n memset(F,0,sizeof(F));\n int res = 0;\n while( !q.empty() ){\n int p = q.front(); q.pop();\n int time = H[p];\n res = max( res, time );\n // cout<< p << \" \"<< time << endl;\n for(int i=0;i<(int)G[p].size();i++){\n int to =G[p][i];\n if( H[to] > 0 && H[to] >= time - Y ) continue;\n if( F[i][to] ){\n res = -1; goto end;\n }\n F[i][to] = true;\n q.push( to );\n H[to] = time + X;\n }\n }\n end:;\n if( res == -1 ) cout << \"You're always welcome!\" << endl;\n else cout << res << endl;\n }\n \n}","accuracy":1,"time_ms":20,"memory_kb":6532,"score_of_the_acc":-0.2985,"final_rank":11},{"submission_id":"aoj_2191_1260313","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef complex<double> P;\ntypedef pair<int, int> PI;\nconst double EPS = 1e-8;\n\nint N, X, Y;\n\nvoid input(P &tar){\n int x, y; cin >>x >>y;\n tar.real(x);\n tar.imag(y);\n}\n\nint dist2(P &a, P &b){\n return (a.real() - b.real()) * (a.real() - b.real()) + (a.imag() - b.imag()) * (a.imag() - b.imag());\n}\n\nint solve(P &c, vector<P> &v){\n priority_queue<PI, vector<PI>, greater<PI> > open;\n vector<int> closed(N, -1);\n REP(i, N) if(dist2(c, v[i]) <= 10 * 10) open.push(PI(0, i));\n int cnt = 0;\n while(!open.empty()){\n ++cnt;\n if(cnt > 1000 * 1000) return -1;\n int t = open.top().first, n = open.top().second; open.pop();\n if(t != 0 && closed[n] != -1 && closed[n] + Y >= t) continue;\n closed[n] = t + X;\n REP(i, N) if(i != n && dist2(v[n], v[i]) <= 50 * 50) open.push(PI(t + X, i));\n }\n int ans = 0;\n REP(i, N) ans = max(ans, closed[i]);\n return ans;\n}\n\n\nint main() {\n int T; cin >>T;\n while(T--){\n cin >>N >>X >>Y;\n P c;\n vector<P> v(N);\n input(c);\n REP(i, N) input(v[i]);\n int ans = solve(c, v);\n if(ans == -1) cout <<\"You're always welcome!\" <<endl;\n else cout <<ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":510,"memory_kb":9596,"score_of_the_acc":-1.4949,"final_rank":20},{"submission_id":"aoj_2191_874998","code_snippet":"#include <cstdlib>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nconstexpr int INF = (1 << 29);\n\ntemplate<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }\n\nint dist2(int x1, int y1, int x2, int y2) {\n\tconst int diff_x = x1 - x2;\n\tconst int diff_y = y1 - y2;\n\treturn diff_x * diff_x + diff_y * diff_y;\n}\n\nstring solve() {\n\tint n, X, Y;\n\tcin >> n >> X >> Y;\n\n\tint nx, ny;\n\tcin >> nx >> ny;\n\n\tvector<int> xs(n), ys(n), label(n, INF);\n\tqueue<int> que;\n\tvector<vector<int>> es(n);\n\n\tfor(int i = 0; i < n; ++i) {\n\t\tcin >> xs[i] >> ys[i];\n\t\tif(dist2(nx, ny, xs[i], ys[i]) <= 10 * 10) {\n\t\t\tque.push(i);\n\t\t\tlabel[i] = 1;\n\t\t}\n\n\t\tfor(int j = 0; j < i; ++j) {\n\t\t\tif(dist2(xs[i], ys[i], xs[j], ys[j]) <= 50 * 50) {\n\t\t\t\tes[i].emplace_back(j);\n\t\t\t\tes[j].emplace_back(i);\n\t\t\t}\n\t\t}\n\t}\n\n\tif(X > Y) {\n\t\tif(que.empty()) return \"0\";\n\t\twhile(!que.empty()) {\n\t\t\tconst int v = que.front();\n\t\t\tfor(const auto &to : es[v]) {\n\t\t\t\tif(label[to] == INF) return \"You're always welcome!\";\n\t\t\t}\n\t\t\tque.pop();\n\t\t}\n\t\treturn to_string(X);\n\t}\n\n\tint mx = 0;\n\twhile(!que.empty()) {\n\t\tconst int v = que.front();\n\t\tque.pop();\n\t\tchmax(mx, label[v]);\n\n\t\tfor(const auto &to : es[v]) {\n\t\t\tif(label[to] == INF) {\n\t\t\t\tlabel[to] = label[v] + 1;\n\t\t\t\tque.push(to);\n\t\t\t}\n\t\t}\n\t}\n\treturn to_string(mx * X);\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tint t;\n\tcin >> t;\n\twhile(t--) cout << solve() << endl;\n\n\treturn EXIT_SUCCESS;\n}","accuracy":1,"time_ms":20,"memory_kb":5240,"score_of_the_acc":-0.0027,"final_rank":1},{"submission_id":"aoj_2191_857396","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<climits>\n#include<deque>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define MAX 1010\n#define pow2(a) ((a)*(a))\n\nusing namespace std;\n\nstruct Point{\n int x,y;\n Point(int x=IINF,int y=IINF):x(x),y(y){}\n};\n\nstruct Data{\n int cur,cost;\n Data(int cur=IINF,int cost=IINF):cur(cur),cost(cost){}\n};\n\ninline double dist(Point a,Point b){\n return sqrt(pow2(abs(a.x-b.x))+pow2(abs(a.y-b.y)));\n}\n\nint N,X,Y;\nvector<int> G[MAX];\n\nint main()\n{\n int T;\n cin >> T;\n while(T--){\n cin >> N >> X >> Y;\n\n rep(i,N)G[i].clear();\n\n deque<Data> deq;\n bool used[N+1];\n Point ps[N+1];\n rep(i,N+1){\n used[i] = false;\n cin >> ps[i].x >> ps[i].y;\n }\n\n REP(i,1,N+1){\n if(dist(ps[0],ps[i]) <= 10.0){\n\tdeq.push_back(Data(i-1,1));\n\tused[i-1] = true;\n }\n REP(j,i+1,N+1){\n\tif(dist(ps[i],ps[j]) <= 50.0){\n\t G[i-1].push_back(j-1);\n\t G[j-1].push_back(i-1);\n\t}\n }\n }\n\n if(deq.empty()){\n cout << 0 << endl;\n continue;\n }\n\n int maxcost = 1;\n while(!deq.empty()){\n Data data = deq.front(); deq.pop_front();\n\n for(int next : G[data.cur]){\n\tif(used[next])continue;\n\tused[next] = true;\n\tmaxcost = max(maxcost,data.cost+1);\n\tdeq.push_back(Data(next,data.cost+1));\n }\n\n }\n\n if( X > Y && maxcost == 1){\n cout << X << endl;\n continue;\n }\n\n if( X > Y ){\n cout << \"You're always welcome!\" << endl;\n } else {\n cout << X*maxcost << endl;\n }\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5316,"score_of_the_acc":-0.0302,"final_rank":6},{"submission_id":"aoj_2191_857395","code_snippet":"#include<iostream>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<iomanip>\n#include<cassert>\n#include<sstream>\n#include<complex>\n#include<cstdio>\n#include<climits>\n#include<cstdlib>\n#include<deque>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<ctime>\n#include<cctype>\n#include<unordered_map>\n#include<unordered_set>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define IINF (INT_MAX)\n#define all(n) (n).begin(),(n).end()\n#define MAX 1010\n#define pow2(a) ((a)*(a))\n\nusing namespace std;\n\nstruct Point{\n int x,y;\n Point(int x=IINF,int y=IINF):x(x),y(y){}\n};\n\nstruct Data{\n int cur,cost;\n Data(int cur=IINF,int cost=IINF):cur(cur),cost(cost){}\n};\n\ninline double dist(Point a,Point b){\n return sqrt(pow2(abs(a.x-b.x))+pow2(abs(a.y-b.y)));\n}\n\nint N,X,Y;\nvector<int> G[MAX];\n\nint main()\n{\n int T;\n cin >> T;\n while(T--){\n cin >> N >> X >> Y;\n\n rep(i,N)G[i].clear();\n\n deque<Data> deq;\n bool used[N+1];\n Point ps[N+1];\n rep(i,N+1){\n used[i] = false;\n cin >> ps[i].x >> ps[i].y;\n }\n\n REP(i,1,N+1){\n if(dist(ps[0],ps[i]) <= 10.0){\n\tdeq.push_back(Data(i-1,1));\n\tused[i-1] = true;\n }\n REP(j,i+1,N+1){\n\tif(dist(ps[i],ps[j]) <= 50.0){\n\t G[i-1].push_back(j-1);\n\t G[j-1].push_back(i-1);\n\t}\n }\n }\n\n if(deq.empty()){\n cout << 0 << endl;\n continue;\n }\n /*\n rep(sp,N){\n cout << \"from \" << sp << \" : \";\n for(int next : G[sp]){\n\tcout << next << \" \";\n }\n cout << endl;\n }\n cout << endl;\n */\n int maxcost = 1;\n while(!deq.empty()){\n Data data = deq.front(); deq.pop_front();\n\n for(int next : G[data.cur]){\n\tif(used[next])continue;\n\tused[next] = true;\n\tmaxcost = max(maxcost,data.cost+1);\n\tdeq.push_back(Data(next,data.cost+1));\n }\n\n }\n\n if( X > Y && maxcost == 1){\n cout << X << endl;\n continue;\n }\n\n if( X > Y ){\n cout << \"You're always welcome!\" << endl;\n } else {\n cout << X*maxcost << endl;\n }\n\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5316,"score_of_the_acc":-0.0201,"final_rank":4},{"submission_id":"aoj_2191_783285","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<map>\n#include<algorithm>\nusing namespace std;\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\n#define rep(i, n) reps(i,0,n)\n#define fr first\n#define sc second\n#define SQR(x) ((x)*(x))\n#define INF (1 << 28)\ntypedef pair< int , int > Pt;\n\nint main(){\n int Q;\n int N,X,Y;\n Pt Natume;\n int x[1000],y[1000];\n vector< vector<int> > set;\n\n cin >> Q;\n while(Q--){\n //Input\n cin >> N >> X >> Y;\n cin >> Natume.sc >> Natume.fr;\n set.resize(N);\n rep(i,N) cin >> x[i] >> y[i];\n rep(i,N) rep(j,N){\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\n set[i].push_back(j);\n }\n }\n //end\n\n queue< Pt > que;\n int Say[1000],cnt = 0,flg = 1,END = 1000,ans = 0;\n fill_n(Say,1000,-INF);\n rep(i,N){\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\n Say[i] = X;\n que.push(Pt(X,i));\n }\n }\n while(!que.empty()){\n Pt p = que.front(); que.pop();\n int now = p.sc , time = p.fr;\n cnt++;\n if(cnt > END){ flg--; break; }\n rep(i,set[now].size()){\n int e = set[now][i];\n if(time - Say[e] > Y){\n Say[e] = X + time;\n que.push(Pt(Say[e],e));\n }\n }\n }\n rep(i,N) ans = max(ans,Say[i]);\n\n //Output\n if(!flg) cout << \"You're always welcome!\" << endl;\n else cout << ans << endl;\n //end\n\n set.clear();\n }\n}","accuracy":1,"time_ms":30,"memory_kb":5228,"score_of_the_acc":-0.0101,"final_rank":2},{"submission_id":"aoj_2191_783283","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<map>\n#include<algorithm>\nusing namespace std;\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\n#define rep(i, n) reps(i,0,n)\n#define fr first\n#define sc second\n#define SQR(x) ((x)*(x))\n#define INF (1 << 28)\ntypedef pair< int , int > Pt;\n\nint main(){\n int Q;\n int N,X,Y;\n Pt Natume;\n int x[1000],y[1000];\n vector< vector<int> > set;\n\n cin >> Q;\n while(Q--){\n //Input\n cin >> N >> X >> Y;\n cin >> Natume.sc >> Natume.fr;\n set.resize(N);\n rep(i,N) cin >> x[i] >> y[i];\n rep(i,N) rep(j,N){\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\n set[i].push_back(j);\n }\n }\n //end\n\n queue< Pt > que;\n int Say[1000],cnt = 0,flg = 1,END = 1500,ans = 0;\n fill_n(Say,1000,-INF);\n rep(i,N){\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\n Say[i] = X;\n que.push(Pt(X,i));\n }\n }\n while(!que.empty()){\n Pt p = que.front(); que.pop();\n int now = p.sc , time = p.fr;\n cnt++;\n if(cnt > END){ flg--; break; }\n rep(i,set[now].size()){\n int e = set[now][i];\n if(time - Say[e] > Y){\n Say[e] = X + time;\n que.push(Pt(Say[e],e));\n }\n }\n }\n rep(i,N) ans = max(ans,Say[i]);\n\n //Output\n if(!flg) cout << \"You're always welcome!\" << endl;\n else cout << ans << endl;\n //end\n\n set.clear();\n }\n}","accuracy":1,"time_ms":30,"memory_kb":5228,"score_of_the_acc":-0.0101,"final_rank":2},{"submission_id":"aoj_2191_783282","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<map>\n#include<algorithm>\nusing namespace std;\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\n#define rep(i, n) reps(i,0,n)\n#define fr first\n#define sc second\n#define SQR(x) ((x)*(x))\n#define INF (1 << 28)\ntypedef pair< int , int > Pt;\n\nint main(){\n int Q;\n int N,X,Y;\n Pt Natume;\n int x[1000],y[1000];\n vector< vector<int> > set;\n\n cin >> Q;\n while(Q--){\n //Input\n cin >> N >> X >> Y;\n cin >> Natume.sc >> Natume.fr;\n set.resize(N);\n rep(i,N) cin >> x[i] >> y[i];\n rep(i,N) rep(j,N){\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\n set[i].push_back(j);\n }\n }\n //end\n\n queue< Pt > que;\n int Say[1000],cnt = 0,flg = 1,END = 2*N*N,ans = 0;\n fill_n(Say,1000,-INF);\n rep(i,N){\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\n Say[i] = X;\n que.push(Pt(X,i));\n }\n }\n while(!que.empty()){\n Pt p = que.front(); que.pop();\n int now = p.sc , time = p.fr;\n cnt++;\n if(cnt > END){ flg--; break; }\n rep(i,set[now].size()){\n int e = set[now][i];\n if(time - Say[e] > Y){\n Say[e] = X + time;\n que.push(Pt(Say[e],e));\n }\n }\n }\n rep(i,N) ans = max(ans,Say[i]);\n\n //Output\n if(!flg) cout << \"You're always welcome!\" << endl;\n else cout << ans << endl;\n //end\n\n set.clear();\n }\n}","accuracy":1,"time_ms":50,"memory_kb":5228,"score_of_the_acc":-0.0303,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2191_2660721\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nstruct Point{\\n\\tdouble x,y;\\n};\\n\\nint N,X,Y,pre_time[1000];\\nPoint customer,point[1000];\\nbool near_customer[1000];\\nbool check[1000];\\nvector<int> NEAR[1000];\\n\\n\\ndouble calc_dist(Point a,Point b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\\n}\\n\\nvoid func(){\\n\\n\\tscanf(\\\"%d %d %d\\\",&N,&X,&Y);\\n\\n\\tfor(int i = 0; i < N; i++)NEAR[i].clear();\\n\\n\\tscanf(\\\"%lf %lf\\\",&customer.x,&customer.y);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t\\tnear_customer[i] = (calc_dist(point[i],customer) <= 10.0);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(calc_dist(point[i],point[k]) <= 50.0){\\n\\t\\t\\t\\tif(i != k)NEAR[i].push_back(k);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans;\\n\\tvector<int> V,NEXT;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(near_customer[i]){\\n\\t\\t\\tpre_time[i] = X;\\n\\t\\t\\tV.push_back(i);\\n\\t\\t}else{\\n\\t\\t\\tpre_time[i] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tif(V.size() == 0){\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tans = X;\\n\\n\\twhile(true){\\n\\n\\t\\tfor(int i = 0; i < N; i++)check[i] = false;\\n\\t\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\t\\tfor(int k = 0; k < NEAR[V[i]].size(); k++){\\n\\t\\t\\t\\tcheck[NEAR[V[i]][k]] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tif(check[i]){\\n\\t\\t\\t\\tif(pre_time[i] == -1){\\n\\t\\t\\t\\t\\tpre_time[i] = ans+X;\\n\\t\\t\\t\\t\\tNEXT.push_back(i);\\n\\t\\t\\t\\t}else if(pre_time[i] != -1 && ans-pre_time[i] > Y){\\n\\t\\t\\t\\t\\tprintf(\\\"You're always welcome!\\\\n\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(NEXT.size() == 0)break;\\n\\t\\tV.clear();\\n\\t\\tfor(int i = 0; i < NEXT.size(); i++)V.push_back(NEXT[i]);\\n\\t\\tNEXT.clear();\\n\\t\\tans += X;\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\tint case_num;\\n\\tscanf(\\\"%d\\\",&case_num);\\n\\n\\tfor(int i = 0; i < case_num; i++)func();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7076,\n \"score_of_the_acc\": -0.4332,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2191_2641295\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nint main() {\\n\\tint T;cin>>T;\\n\\twhile (T--) {\\n\\t\\tint N,X,Y;cin>>N>>X>>Y;\\n\\t\\tint in_x, in_y; cin >> in_x >> in_y;\\n\\t\\tvector<pair<int,int>>ps;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint x,y;cin>>x>>y;\\n\\t\\t\\tps.emplace_back(x,y);\\n\\t\\t}\\n\\t\\tvector<vector<int>>edges(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\tif (i != j) {\\n\\t\\t\\t\\t\\tint dis=(ps[i].first-ps[j].first)*(ps[i].first-ps[j].first)+\\n\\t\\t\\t\\t\\t\\t(ps[i].second-ps[j].second)*(ps[i].second-ps[j].second);\\n\\t\\t\\t\\t\\tif (dis <= 2500) {\\n\\t\\t\\t\\t\\t\\tedges[i].push_back(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint time=0;\\n\\t\\tvector<int>pres(N, -1000);\\n\\t\\tvector<int>nowsays;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tint dis=(ps[i].first-in_x)*(ps[i].first-in_x)+(ps[i].second-in_y)*(ps[i].second-in_y);\\n\\t\\t\\tif (dis <= 100) {\\n\\t\\t\\t\\tnowsays.push_back(i);\\n\\t\\t\\t\\tpres[i]=-1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint w_count=(Y)/X;\\n\\t\\tbool ok = true;\\n\\t\\twhile (!nowsays.empty()) {\\n\\t\\t\\tvector<int>flags(N);\\n\\t\\t\\tfor (auto ns : nowsays) {\\n\\t\\t\\t\\tfor (auto e : edges[ns]) {\\n\\t\\t\\t\\t\\tflags[e]=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvector<int>nextsays;\\n\\t\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\t\\tif (flags[i]) {\\n\\t\\t\\t\\t\\tif (pres[i] == -1000) {\\n\\t\\t\\t\\t\\t\\tnextsays.push_back(i);\\n\\t\\t\\t\\t\\t\\tpres[i]=time;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tif (pres[i] + w_count+1 < time) {\\n\\t\\t\\t\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\t\\t\\t}else{\\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\\tnowsays=nextsays;\\n\\t\\t\\ttime++;\\n\\t\\t\\tif(!ok)break;\\n\\t\\t}\\n\\t\\tif (ok) {\\n\\t\\t\\tcout<<time*X<<endl;\\n\\t\\t}else{\\n\\t\\t\\tcout<< \\\"You're always welcome!\\\"<<endl;\\n\\t\\t}\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6816,\n \"score_of_the_acc\": -0.3636,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2191_1906021\",\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<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint main(){\\n\\tint q;\\n\\tcin>>q;\\n\\twhile(q--){\\n\\t\\tint n,X,Y;\\n\\t\\tcin>>n>>X>>Y;\\n\\t\\tvvi G(n);\\n\\t\\tint x,y;cin>>x>>y;\\n\\t\\tvi a(n),b(n);\\n\\t\\trep(i,n)cin>>a[i]>>b[i];\\n\\t\\trep(i,n)rep(j,n)if(i!=j&&hypot(a[i]-a[j],b[i]-b[j])<EPS+50){\\n\\t\\t\\tG[i].pb(j);\\n\\t\\t\\tG[j].pb(i);\\n\\t\\t}\\n\\t\\tvi in(n,-2000);\\n\\t\\tint out=0;\\n\\t\\trep(i,n)if(hypot(x-a[i],y-b[i])<EPS+10)in[i]=X,out=X;\\n\\t\\twhile(1){\\n\\t\\t\\tvi ne=in;\\n\\t\\t\\tint t=out;\\n\\t\\t\\trep(i,n)if(in[i]==t){\\n\\t\\t\\t\\trep(j,G[i].size())if(in[i]-Y>in[G[i][j]]){\\n\\t\\t\\t\\t\\tout=ne[G[i][j]]=t+X;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(in==ne){\\n\\t\\t\\t\\tcout<<out<<endl;\\n\\t\\t\\t\\tgoto end;\\n\\t\\t\\t}\\n\\t\\t\\tif(out>1e5)break;\\n\\t\\t\\tin=ne;\\n\\t\\t}\\n\\t\\tcout<<\\\"You're always welcome!\\\"<<endl;\\n\\t\\tend:;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 9188,\n \"score_of_the_acc\": -1.1086,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2191_1889480\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX 1010\\n \\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) : x(x),y(y) {}\\n};\\n \\nint N,X,Y;\\nvector<int> G[MAX];\\n \\ndouble getDist(Point &a,Point &b){\\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\\n}\\n \\nvoid init(){\\n for(int i = 0 ; i < MAX ; i++){\\n\\tG[i].clear();\\n } \\n}\\n \\nvoid solve(){\\n int d[MAX] = {0};\\n queue<int> Q; Q.push(0);\\n bool can = true;\\n \\n while(!Q.empty()){\\n\\tint v = Q.front(); Q.pop();\\n\\tfor(int i = 0 ; i < (int)G[v].size() ; i++){\\n\\t int to = G[v][i];\\n\\t if(d[to] == 0){\\n\\t\\td[to] = d[v] + 1;\\n\\t\\tif(v > 0 && X > Y) can = false;\\n\\t\\tQ.push(to);\\n\\t }\\n\\t}\\n }\\n \\n if(can){\\n\\tcout << *max_element(d+1,d+N+1)*X << endl;\\n }else{\\n\\tcout << \\\"You're always welcome!\\\" << endl;\\n }\\n}\\n \\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n\\tinit();\\n\\tPoint sp;\\n\\tvector<Point> p;\\n\\tcin >> N >> X >> Y;\\n\\tcin >> sp.x >> sp.y;\\n\\tp.resize(N);\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t cin >> p[i].x >> p[i].y;\\n\\t if(getDist(sp,p[i]) <= 10){\\n\\t\\tG[0].push_back(i+1);\\n\\t }\\n\\t}\\n\\tfor(int i = 0 ; i < N ; i++){\\n\\t for(int j = 0 ; j < N ; j++){\\n\\t\\tif(i == j) continue;\\n\\t\\tif(getDist(p[i],p[j]) <= 50){\\n\\t\\t G[i+1].push_back(j+1);\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tsolve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7096,\n \"score_of_the_acc\": -0.4479,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2191_1430620\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 1000;\\n\\nconst int INF = 1 << 30;\\nconst int DD = 10;\\nconst int PD = 50;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\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& pt) : x(pt.x), y(pt.y) {}\\n\\n bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; }\\n Pt<T> operator+(const Pt 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 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 v) const { return x * v.x + y * v.y; }\\n T cross(Pt v) const { return x * v.y - y * v.x; }\\n Pt<T> mid(const Pt pt) { return Pt<T>((x + pt.x) / 2, (y + pt.y) / 2); }\\n T d2() { return x * x + y * y; }\\n double d() { return sqrt(d2()); }\\n\\n Pt<T> rot(double th) {\\n double c = cos(th), s = sin(th);\\n return Pt<T>(c * x - s * y, s * x + c * y);\\n }\\n\\n Pt<T> rot90() { return Pt<T>(-y, x); }\\n\\n bool operator<(const Pt& pt) const {\\n return x < pt.x || (x == pt.x && y < pt.y);\\n }\\n\\n void print(string format) {\\n printf((\\\"(\\\" + format + \\\", \\\" + format + \\\")\\\\n\\\").c_str(), x, y);\\n }\\n void print() { print(\\\"%.6lf\\\"); }\\n};\\n\\ntypedef Pt<int> pt;\\n\\n/* global variables */\\n\\nint n, x, y;\\npt dr, pts[MAX_N];\\nvi nbrs[MAX_N];\\nint dists[MAX_N];\\nbool used[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int tn;\\n cin >> tn;\\n\\n while (tn--) {\\n cin >> n >> x >> y;\\n cin >> dr.x >> dr.y;\\n for (int i = 0; i < n; i++) cin >> pts[i].x >> pts[i].y;\\n\\n for (int i = 0; i < n; i++) {\\n dists[i] = -INF;\\n nbrs[i].clear();\\n }\\n \\n for (int i = 0; i < n; i++)\\n for (int j = i + 1; j < n; j++)\\n\\tif ((pts[j] - pts[i]).d2() <= PD * PD) {\\n\\t nbrs[i].push_back(j);\\n\\t nbrs[j].push_back(i);\\n\\t}\\n\\n memset(used, false, sizeof(used));\\n \\n queue<int> q;\\n for (int i = 0; i < n; i++)\\n if ((pts[i] - dr).d2() <= DD * DD)\\n\\tq.push(i), dists[i] = x, used[i] = true;\\n\\n int max_d = 0;\\n bool always = false;\\n \\n while (! q.empty()) {\\n int u = q.front(); q.pop();\\n int ud = dists[u];\\n if (max_d < ud) max_d = ud;\\n\\n int nvd = ud + x;\\n vi& nbru = nbrs[u];\\n\\n for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {\\n\\tint& v = *vit;\\n\\n\\tif (dists[v] < ud - y) {\\n\\t if (used[v]) {\\n\\t always = true;\\n\\t break;\\n\\t }\\n\\n\\t q.push(v);\\n\\t dists[v] = nvd;\\n\\t used[v] = true;\\n\\t}\\n }\\n\\n if (always) break;\\n }\\n //cout << always << ' ' << max_d << endl;\\n\\n if (always)\\n cout << \\\"You're always welcome!\\\" << endl;\\n else\\n cout << max_d << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5340,\n \"score_of_the_acc\": -0.0256,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2191_1369744\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\ntypedef long long ll;\\n\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define pb push_back\\n\\n\\nint dist( pii a,pii b){\\n int y=a.first-b.first;\\n int x=a.second-b.second;\\n \\n return (x*x + y*y);\\n}\\n\\n\\n\\nint main(){\\n int loop;\\n cin>>loop;\\n rep(i,loop){\\n \\n int n,x,y;\\n cin>>n>>x>>y;\\n \\n pii start;\\n cin>>start.second>>start.first;\\n \\n pii cat[2000];\\n rep(i,n){\\n cin>>cat[i].second>>cat[i].first;\\n }\\n \\n// if( x>=y ){cout<<\\\"You're always welcome!\\\"<<endl;continue;}\\n \\n vi connect[2000];\\n \\n rep(i,n){\\n rep(j,n){\\n if(i!=j){\\n if( dist(cat[i],cat[j])<=2500 ){\\n connect[i].pb(j);\\n connect[j].pb(i);\\n }\\n }\\n }\\n }\\n \\n int used[2000];\\n rep(i,2000)used[i]=-9999;\\n\\n queue<int> que;\\n \\n rep(i,n){\\n if( dist(start,cat[i])<=100 ){\\n que.push(i);\\n used[i]=x;\\n }\\n }\\n int term=0;\\n if( que.size() )term++;\\n \\n int now=0;\\n int times=0;\\n while(que.size()){\\n times++;\\n now=term*x;\\n int len=que.size();\\n rep(i,len){\\n int qf=que.front();\\n for( int j=0;j<connect[qf].size();j++){\\n int connected = connect[qf][j];\\n if( now-used[ connected ]>y ){\\n que.push( connected );\\n used[ connected ] = now+x;\\n }\\n }\\n que.pop();\\n }\\n if(times>2000)break;\\n term++;\\n }\\n \\n// while( que.size() ){\\n// now=term*x;\\n// bool flag=true;\\n// times++;\\n// int qf=que.front();\\n// for( int i=0;i<connect[qf].size();i++ ){\\n// int connected = connect[qf][i];\\n// if( now-used[ connected ]>y ){ // >= ?\\n// if(flag)term++;\\n// flag=false;\\n// que.push( connected );\\n// used[ connected ]=now+x; // now+x-1 ?\\n// }\\n// }\\n// que.pop();\\n// if(times>10000)break;\\n// }\\n \\n \\n if(times>2000)cout<<\\\"You're always welcome!\\\"<<endl;\\n else cout<<now<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 9432,\n \"score_of_the_acc\": -1.0029,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2191_1369647\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint N,T;\\n \\nvector<int> G[1111];\\nbool F[1111][1111];\\nint X,Y;\\n \\nint dub(int a){ return a*a; }\\nint abs( P a, P b ){\\n return dub(a.first-b.first)+dub(a.second-b.second);\\n}\\n \\nint main(){\\n cin >> T;\\n while( T-- ){\\n for(int i=0;i<N;i++) G[i].clear();\\n cin >> N >> X >> Y;\\n P s;\\n cin >> s.first >> s.second;\\n P v[1111];\\n for(int i=0;i<N;i++)\\n cin>> v[i].first >> v[i].second; \\n queue<int> q;\\n int H[1111] = {};\\n for(int i=0;i<N;i++){\\n if( abs( s, v[i] ) <= 10*10 ) {\\n q.push( i );\\n H[i] = X;\\n }\\n for(int j=i+1;j<N;j++){ \\n if( abs(v[i],v[j]) <= 50*50 ){\\n G[i].push_back( j );\\n G[j].push_back( i );\\n }\\n }\\n }\\n \\n memset(F,0,sizeof(F));\\n int res = 0;\\n while( !q.empty() ){\\n int p = q.front(); q.pop();\\n int time = H[p];\\n res = max( res, time );\\n // cout<< p << \\\" \\\"<< time << endl;\\n for(int i=0;i<(int)G[p].size();i++){\\n int to =G[p][i];\\n if( H[to] > 0 && H[to] >= time - Y ) continue;\\n if( F[i][to] ){\\n res = -1; goto end;\\n }\\n F[i][to] = true;\\n q.push( to );\\n H[to] = time + X;\\n }\\n }\\n end:;\\n if( res == -1 ) cout << \\\"You're always welcome!\\\" << endl;\\n else cout << res << endl;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6532,\n \"score_of_the_acc\": -0.2985,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2191_1366959\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <complex>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n \\nint tx[] = {0,1,0,-1};\\nint ty[] = {-1,0,1,0};\\n \\nstatic const double EPS = 1e-12;\\n\\nint main(){\\n int total_test_cases;\\n while(~scanf(\\\"%d\\\",&total_test_cases)){\\n for(int test_i = 0; test_i < total_test_cases; test_i++){\\n int total_staff;\\n int speech_duration,prohibited_duration;\\n\\n scanf(\\\"%d %d %d\\\",&total_staff,\\n &speech_duration,&prohibited_duration);\\n int customer_x,customer_y;\\n scanf(\\\"%d %d\\\",&customer_x,&customer_y);\\n complex<int> customer(customer_x,customer_y);\\n\\n vector<complex<int> > staff;\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n int x,y;\\n scanf(\\\"%d %d\\\",&x,&y);\\n staff.push_back(complex<int>(x,y));\\n }\\n \\n int latest_speech_finished_time[1001];\\n memset(latest_speech_finished_time,-1,sizeof(latest_speech_finished_time));\\n queue<int> que;\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n if((staff[staff_i].real() - customer.real()) * (staff[staff_i].real() - customer.real())\\n + (staff[staff_i].imag() - customer.imag()) * (staff[staff_i].imag() - customer.imag()) > 100) continue;\\n que.push(staff_i);\\n latest_speech_finished_time[staff_i] = speech_duration;\\n }\\n \\n vector<int> edges[1001];\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n for(int staff_j = 0; staff_j < total_staff; staff_j++){\\n if(staff_i == staff_j) continue;\\n if((staff[staff_i].real() - staff[staff_j].real()) * (staff[staff_i].real() - staff[staff_j].real())\\n + (staff[staff_i].imag() - staff[staff_j].imag()) * (staff[staff_i].imag() - staff[staff_j].imag()) > 2500) continue;\\n edges[staff_i].push_back(staff_j);\\n }\\n }\\n\\n bool isok = false;\\n for(int round = 0; round < 100000; round++){\\n queue<int> next;\\n bool visited[1001] = {};\\n while(!que.empty()){\\n int staff_i = que.front();\\n que.pop();\\n for(int i = 0; i < edges[staff_i].size(); i++){\\n int staff_j = edges[staff_i][i];\\n if(latest_speech_finished_time[staff_j] == -1 \\n || (latest_speech_finished_time[staff_j] + prohibited_duration\\n < latest_speech_finished_time[staff_i])){\\n if(visited[staff_j]) continue;\\n next.push(staff_j);\\n visited[staff_j] = true;\\n latest_speech_finished_time[staff_j]\\n = latest_speech_finished_time[staff_i] + speech_duration;\\n }\\n }\\n }\\n if(next.empty()){\\n isok = true;\\n break;\\n }\\n que = next;\\n }\\n \\n int res = 0;\\n for(int i = 0; i < total_staff; i++){\\n res = max(res,latest_speech_finished_time[i]);\\n }\\n if(isok){\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n else{\\n printf(\\\"You're always welcome!\\\\n\\\");\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 5264,\n \"score_of_the_acc\": -0.9072,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2191_1366957\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n#include <complex>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P > PP;\\n \\nint tx[] = {0,1,0,-1};\\nint ty[] = {-1,0,1,0};\\n \\nstatic const double EPS = 1e-8;\\n\\nint main(){\\n int total_test_cases;\\n while(~scanf(\\\"%d\\\",&total_test_cases)){\\n for(int test_i = 0; test_i < total_test_cases; test_i++){\\n int total_staff;\\n int speech_duration,prohibited_duration;\\n\\n scanf(\\\"%d %d %d\\\",&total_staff,\\n &speech_duration,&prohibited_duration);\\n double customer_x,customer_y;\\n scanf(\\\"%lf %lf\\\",&customer_x,&customer_y);\\n vector<complex<double> > staff;\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n double x,y;\\n scanf(\\\"%lf %lf\\\",&x,&y);\\n staff.push_back(complex<double>(x,y));\\n }\\n \\n int latest_speech_finished_time[1001];\\n memset(latest_speech_finished_time,-1,sizeof(latest_speech_finished_time));\\n queue<int> que;\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n if(abs(staff[staff_i] - complex<double>(customer_x,customer_y)) > 10.0) continue;\\n que.push(staff_i);\\n latest_speech_finished_time[staff_i] = speech_duration;\\n }\\n \\n vector<int> edges[1001];\\n for(int staff_i = 0; staff_i < total_staff; staff_i++){\\n for(int staff_j = 0; staff_j < total_staff; staff_j++){\\n if(staff_i == staff_j) continue;\\n if(abs(staff[staff_i] - staff[staff_j]) > 50.0) continue;\\n edges[staff_i].push_back(staff_j);\\n }\\n }\\n\\n bool isok = false;\\n for(int round = 0; round < 100000; round++){\\n queue<int> next;\\n bool visited[1001] = {};\\n while(!que.empty()){\\n int staff_i = que.front();\\n que.pop();\\n for(int i = 0; i < edges[staff_i].size(); i++){\\n int staff_j = edges[staff_i][i];\\n if(latest_speech_finished_time[staff_j] == -1 \\n || (latest_speech_finished_time[staff_j] + prohibited_duration\\n < latest_speech_finished_time[staff_i])){\\n if(visited[staff_j]) continue;\\n next.push(staff_j);\\n visited[staff_j] = true;\\n latest_speech_finished_time[staff_j]\\n = latest_speech_finished_time[staff_i] + speech_duration;\\n }\\n }\\n }\\n if(next.empty()){\\n isok = true;\\n break;\\n }\\n que = next;\\n }\\n \\n int res = 0;\\n for(int i = 0; i < total_staff; i++){\\n res = max(res,latest_speech_finished_time[i]);\\n }\\n if(isok){\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n else{\\n printf(\\\"You're always welcome!\\\\n\\\");\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 5320,\n \"score_of_the_acc\": -1.0211,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2191_1366915\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX 1010\\n \\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) : x(x),y(y) {}\\n};\\n \\nint N,X,Y;\\nvector<int> G[MAX];\\n \\ndouble getDist(Point &a,Point &b){\\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\\n}\\n \\nvoid init(){\\n for(int i = 0 ; i < MAX ; i++){\\n G[i].clear();\\n } \\n}\\n \\nvoid solve(){\\n int d[MAX] = {0};\\n queue<int> Q; Q.push(0);\\n bool can = true;\\n \\n while(!Q.empty()){\\n int v = Q.front(); Q.pop();\\n for(int i = 0 ; i < (int)G[v].size() ; i++){\\n int to = G[v][i];\\n if(d[to] == 0){\\n d[to] = d[v] + 1;\\n if(v > 0 && X > Y){\\n can = false;\\n break;\\n }\\n Q.push(to);\\n }\\n }\\n if(!can){ break; }\\n }\\n \\n if(can){\\n cout << *max_element(d+1,d+N+1)*X << endl;\\n }else{\\n cout << \\\"You're always welcome!\\\" << endl;\\n }\\n}\\n \\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n init();\\n Point sp;\\n vector<Point> p;\\n cin >> N >> X >> Y;\\n cin >> sp.x >> sp.y;\\n p.resize(N);\\n for(int i = 0 ; i < N ; i++){\\n cin >> p[i].x >> p[i].y;\\n if(getDist(sp,p[i]) <= 10){\\n G[0].push_back(i+1);\\n }\\n }\\n for(int i = 0 ; i < N ; i++){\\n for(int j = 0 ; j < N ; j++){\\n if(i == j){ continue; }\\n if(getDist(p[i],p[j]) <= 50){\\n G[i+1].push_back(j+1);\\n }\\n }\\n }\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5316,\n \"score_of_the_acc\": -0.0606,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2191_1366910\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MAX 1010\\n \\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) : x(x),y(y) {}\\n};\\n \\nint N,X,Y;\\nvector<int> G[MAX];\\n \\ndouble getDist(Point &a,Point &b){\\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\\n}\\n \\nvoid init(){\\n for(int i = 0 ; i < MAX ; i++){\\n G[i].clear();\\n } \\n}\\n \\nvoid solve(){\\n int d[MAX] = {0};\\n queue<int> Q; Q.push(0);\\n bool can = true;\\n \\n while(!Q.empty()){\\n int v = Q.front(); Q.pop();\\n for(int i = 0 ; i < (int)G[v].size() ; i++){\\n int to = G[v][i];\\n if(d[to] == 0){\\n d[to] = d[v] + 1;\\n if(v > 0 && X > Y){ can = false; }\\n Q.push(to);\\n }\\n }\\n }\\n \\n if(can){\\n cout << *max_element(d+1,d+N+1)*X << endl;\\n }else{\\n cout << \\\"You're always welcome!\\\" << endl;\\n }\\n}\\n \\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n init();\\n Point sp;\\n vector<Point> p;\\n cin >> N >> X >> Y;\\n cin >> sp.x >> sp.y;\\n p.resize(N);\\n for(int i = 0 ; i < N ; i++){\\n cin >> p[i].x >> p[i].y;\\n if(getDist(sp,p[i]) <= 10){\\n G[0].push_back(i+1);\\n }\\n }\\n for(int i = 0 ; i < N ; i++){\\n for(int j = 0 ; j < N ; j++){\\n if(i == j){ continue; }\\n if(getDist(p[i],p[j]) <= 50){\\n G[i+1].push_back(j+1);\\n }\\n }\\n }\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5312,\n \"score_of_the_acc\": -0.0596,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2191_1366622\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 1010\\n\\nstruct Point{\\n double x,y;\\n Point(){}\\n Point(double x,double y) : x(x),y(y) {}\\n};\\n\\nint N,X,Y;\\nPoint sp;\\nvector<Point> p;\\nvector<int> G[MAX];\\n\\ndouble getDist(Point &a,Point &b){\\n return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));\\n}\\n\\nvoid init(){\\n for(int i = 0 ; i < MAX ; i++){\\n G[i].clear();\\n } \\n}\\n\\nvoid solve(){\\n int res = 0;\\n queue<int> que;\\n que.push(0);\\n int d[N+1];\\n memset(d,0,sizeof(d));\\n bool ok=1;\\n while(!que.empty()) {\\n int x=que.front();que.pop();\\n for(int i=0; i<G[x].size(); i++) {\\n int y=G[x][i];\\n if(d[y]) continue;\\n if(x && X>Y) ok=0;\\n d[y]=d[x]+1;\\n que.push(y);\\n }\\n }\\n for(int i=1; i<=N; i++) res=max(res,d[i]*X);\\n if(ok) cout << res << endl;\\n else cout << \\\"You're always welcome!\\\" << endl;\\n}\\n\\nint main(){\\n int Tc;\\n cin >> Tc;\\n while(Tc--){\\n init();\\n cin >> N >> X >> Y;\\n cin >> sp.x >> sp.y;\\n p.resize(N);\\n for(int i = 0 ; i < N ; i++){\\n cin >> p[i].x >> p[i].y;\\n if(getDist(sp,p[i]) <= 10){\\n\\tG[0].push_back(i+1);\\n }\\n }\\n for(int i = 0 ; i < N ; i++){\\n for(int j = 0 ; j < N ; j++){\\n\\tif(i == j){ continue; }\\n\\tif(getDist(p[i],p[j]) <= 50){\\n\\t G[i+1].push_back(j+1);\\n\\t}\\n }\\n }\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5324,\n \"score_of_the_acc\": -0.0624,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2191_1366527\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\nint N,T;\\n\\nvector<int> G[1111];\\nbool F[1111][1111];\\nint X,Y;\\n\\nint dub(int a){ return a*a; }\\nint abs( P a, P b ){\\n return dub(a.first-b.first)+dub(a.second-b.second);\\n}\\n\\nint main(){\\n cin >> T;\\n while( T-- ){\\n for(int i=0;i<N;i++) G[i].clear();\\n cin >> N >> X >> Y;\\n P s;\\n cin >> s.first >> s.second;\\n P v[1111];\\n for(int i=0;i<N;i++)\\n cin>> v[i].first >> v[i].second; \\n queue<int> q;\\n int H[1111] = {};\\n for(int i=0;i<N;i++){\\n if( abs( s, v[i] ) <= 10*10 ) {\\n q.push( i );\\n H[i] = X;\\n }\\n for(int j=i+1;j<N;j++){ \\n if( abs(v[i],v[j]) <= 50*50 ){\\n G[i].push_back( j );\\n G[j].push_back( i );\\n }\\n }\\n }\\n \\n memset(F,0,sizeof(F));\\n int res = 0;\\n while( !q.empty() ){\\n int p = q.front(); q.pop();\\n int time = H[p];\\n res = max( res, time );\\n // cout<< p << \\\" \\\"<< time << endl;\\n for(int i=0;i<(int)G[p].size();i++){\\n int to =G[p][i];\\n if( H[to] > 0 && H[to] >= time - Y ) continue;\\n if( F[i][to] ){\\n res = -1; goto end;\\n }\\n F[i][to] = true;\\n q.push( to );\\n H[to] = time + X;\\n }\\n }\\n end:;\\n if( res == -1 ) cout << \\\"You're always welcome!\\\" << endl;\\n else cout << res << endl;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6532,\n \"score_of_the_acc\": -0.2985,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2191_1260313\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define REVERSE(v) reverse((v).begin(), (v).end())\\ntypedef complex<double> P;\\ntypedef pair<int, int> PI;\\nconst double EPS = 1e-8;\\n\\nint N, X, Y;\\n\\nvoid input(P &tar){\\n int x, y; cin >>x >>y;\\n tar.real(x);\\n tar.imag(y);\\n}\\n\\nint dist2(P &a, P &b){\\n return (a.real() - b.real()) * (a.real() - b.real()) + (a.imag() - b.imag()) * (a.imag() - b.imag());\\n}\\n\\nint solve(P &c, vector<P> &v){\\n priority_queue<PI, vector<PI>, greater<PI> > open;\\n vector<int> closed(N, -1);\\n REP(i, N) if(dist2(c, v[i]) <= 10 * 10) open.push(PI(0, i));\\n int cnt = 0;\\n while(!open.empty()){\\n ++cnt;\\n if(cnt > 1000 * 1000) return -1;\\n int t = open.top().first, n = open.top().second; open.pop();\\n if(t != 0 && closed[n] != -1 && closed[n] + Y >= t) continue;\\n closed[n] = t + X;\\n REP(i, N) if(i != n && dist2(v[n], v[i]) <= 50 * 50) open.push(PI(t + X, i));\\n }\\n int ans = 0;\\n REP(i, N) ans = max(ans, closed[i]);\\n return ans;\\n}\\n\\n\\nint main() {\\n int T; cin >>T;\\n while(T--){\\n cin >>N >>X >>Y;\\n P c;\\n vector<P> v(N);\\n input(c);\\n REP(i, N) input(v[i]);\\n int ans = solve(c, v);\\n if(ans == -1) cout <<\\\"You're always welcome!\\\" <<endl;\\n else cout <<ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 9596,\n \"score_of_the_acc\": -1.4949,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2191_874998\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\n#include <queue>\\n#include <vector>\\nusing namespace std;\\n\\nconstexpr int INF = (1 << 29);\\n\\ntemplate<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }\\n\\nint dist2(int x1, int y1, int x2, int y2) {\\n\\tconst int diff_x = x1 - x2;\\n\\tconst int diff_y = y1 - y2;\\n\\treturn diff_x * diff_x + diff_y * diff_y;\\n}\\n\\nstring solve() {\\n\\tint n, X, Y;\\n\\tcin >> n >> X >> Y;\\n\\n\\tint nx, ny;\\n\\tcin >> nx >> ny;\\n\\n\\tvector<int> xs(n), ys(n), label(n, INF);\\n\\tqueue<int> que;\\n\\tvector<vector<int>> es(n);\\n\\n\\tfor(int i = 0; i < n; ++i) {\\n\\t\\tcin >> xs[i] >> ys[i];\\n\\t\\tif(dist2(nx, ny, xs[i], ys[i]) <= 10 * 10) {\\n\\t\\t\\tque.push(i);\\n\\t\\t\\tlabel[i] = 1;\\n\\t\\t}\\n\\n\\t\\tfor(int j = 0; j < i; ++j) {\\n\\t\\t\\tif(dist2(xs[i], ys[i], xs[j], ys[j]) <= 50 * 50) {\\n\\t\\t\\t\\tes[i].emplace_back(j);\\n\\t\\t\\t\\tes[j].emplace_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(X > Y) {\\n\\t\\tif(que.empty()) return \\\"0\\\";\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tconst int v = que.front();\\n\\t\\t\\tfor(const auto &to : es[v]) {\\n\\t\\t\\t\\tif(label[to] == INF) return \\\"You're always welcome!\\\";\\n\\t\\t\\t}\\n\\t\\t\\tque.pop();\\n\\t\\t}\\n\\t\\treturn to_string(X);\\n\\t}\\n\\n\\tint mx = 0;\\n\\twhile(!que.empty()) {\\n\\t\\tconst int v = que.front();\\n\\t\\tque.pop();\\n\\t\\tchmax(mx, label[v]);\\n\\n\\t\\tfor(const auto &to : es[v]) {\\n\\t\\t\\tif(label[to] == INF) {\\n\\t\\t\\t\\tlabel[to] = label[v] + 1;\\n\\t\\t\\t\\tque.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn to_string(mx * X);\\n}\\n\\nint main() {\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint t;\\n\\tcin >> t;\\n\\twhile(t--) cout << solve() << endl;\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5240,\n \"score_of_the_acc\": -0.0027,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2191_857396\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<climits>\\n#include<deque>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define IINF (INT_MAX)\\n#define MAX 1010\\n#define pow2(a) ((a)*(a))\\n\\nusing namespace std;\\n\\nstruct Point{\\n int x,y;\\n Point(int x=IINF,int y=IINF):x(x),y(y){}\\n};\\n\\nstruct Data{\\n int cur,cost;\\n Data(int cur=IINF,int cost=IINF):cur(cur),cost(cost){}\\n};\\n\\ninline double dist(Point a,Point b){\\n return sqrt(pow2(abs(a.x-b.x))+pow2(abs(a.y-b.y)));\\n}\\n\\nint N,X,Y;\\nvector<int> G[MAX];\\n\\nint main()\\n{\\n int T;\\n cin >> T;\\n while(T--){\\n cin >> N >> X >> Y;\\n\\n rep(i,N)G[i].clear();\\n\\n deque<Data> deq;\\n bool used[N+1];\\n Point ps[N+1];\\n rep(i,N+1){\\n used[i] = false;\\n cin >> ps[i].x >> ps[i].y;\\n }\\n\\n REP(i,1,N+1){\\n if(dist(ps[0],ps[i]) <= 10.0){\\n\\tdeq.push_back(Data(i-1,1));\\n\\tused[i-1] = true;\\n }\\n REP(j,i+1,N+1){\\n\\tif(dist(ps[i],ps[j]) <= 50.0){\\n\\t G[i-1].push_back(j-1);\\n\\t G[j-1].push_back(i-1);\\n\\t}\\n }\\n }\\n\\n if(deq.empty()){\\n cout << 0 << endl;\\n continue;\\n }\\n\\n int maxcost = 1;\\n while(!deq.empty()){\\n Data data = deq.front(); deq.pop_front();\\n\\n for(int next : G[data.cur]){\\n\\tif(used[next])continue;\\n\\tused[next] = true;\\n\\tmaxcost = max(maxcost,data.cost+1);\\n\\tdeq.push_back(Data(next,data.cost+1));\\n }\\n\\n }\\n\\n if( X > Y && maxcost == 1){\\n cout << X << endl;\\n continue;\\n }\\n\\n if( X > Y ){\\n cout << \\\"You're always welcome!\\\" << endl;\\n } else {\\n cout << X*maxcost << endl;\\n }\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5316,\n \"score_of_the_acc\": -0.0302,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2191_857395\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<iomanip>\\n#include<cassert>\\n#include<sstream>\\n#include<complex>\\n#include<cstdio>\\n#include<climits>\\n#include<cstdlib>\\n#include<deque>\\n#include<queue>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<ctime>\\n#include<cctype>\\n#include<unordered_map>\\n#include<unordered_set>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define IINF (INT_MAX)\\n#define all(n) (n).begin(),(n).end()\\n#define MAX 1010\\n#define pow2(a) ((a)*(a))\\n\\nusing namespace std;\\n\\nstruct Point{\\n int x,y;\\n Point(int x=IINF,int y=IINF):x(x),y(y){}\\n};\\n\\nstruct Data{\\n int cur,cost;\\n Data(int cur=IINF,int cost=IINF):cur(cur),cost(cost){}\\n};\\n\\ninline double dist(Point a,Point b){\\n return sqrt(pow2(abs(a.x-b.x))+pow2(abs(a.y-b.y)));\\n}\\n\\nint N,X,Y;\\nvector<int> G[MAX];\\n\\nint main()\\n{\\n int T;\\n cin >> T;\\n while(T--){\\n cin >> N >> X >> Y;\\n\\n rep(i,N)G[i].clear();\\n\\n deque<Data> deq;\\n bool used[N+1];\\n Point ps[N+1];\\n rep(i,N+1){\\n used[i] = false;\\n cin >> ps[i].x >> ps[i].y;\\n }\\n\\n REP(i,1,N+1){\\n if(dist(ps[0],ps[i]) <= 10.0){\\n\\tdeq.push_back(Data(i-1,1));\\n\\tused[i-1] = true;\\n }\\n REP(j,i+1,N+1){\\n\\tif(dist(ps[i],ps[j]) <= 50.0){\\n\\t G[i-1].push_back(j-1);\\n\\t G[j-1].push_back(i-1);\\n\\t}\\n }\\n }\\n\\n if(deq.empty()){\\n cout << 0 << endl;\\n continue;\\n }\\n /*\\n rep(sp,N){\\n cout << \\\"from \\\" << sp << \\\" : \\\";\\n for(int next : G[sp]){\\n\\tcout << next << \\\" \\\";\\n }\\n cout << endl;\\n }\\n cout << endl;\\n */\\n int maxcost = 1;\\n while(!deq.empty()){\\n Data data = deq.front(); deq.pop_front();\\n\\n for(int next : G[data.cur]){\\n\\tif(used[next])continue;\\n\\tused[next] = true;\\n\\tmaxcost = max(maxcost,data.cost+1);\\n\\tdeq.push_back(Data(next,data.cost+1));\\n }\\n\\n }\\n\\n if( X > Y && maxcost == 1){\\n cout << X << endl;\\n continue;\\n }\\n\\n if( X > Y ){\\n cout << \\\"You're always welcome!\\\" << endl;\\n } else {\\n cout << X*maxcost << endl;\\n }\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5316,\n \"score_of_the_acc\": -0.0201,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2191_783285\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<algorithm>\\nusing namespace std;\\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\\n#define rep(i, n) reps(i,0,n)\\n#define fr first\\n#define sc second\\n#define SQR(x) ((x)*(x))\\n#define INF (1 << 28)\\ntypedef pair< int , int > Pt;\\n\\nint main(){\\n int Q;\\n int N,X,Y;\\n Pt Natume;\\n int x[1000],y[1000];\\n vector< vector<int> > set;\\n\\n cin >> Q;\\n while(Q--){\\n //Input\\n cin >> N >> X >> Y;\\n cin >> Natume.sc >> Natume.fr;\\n set.resize(N);\\n rep(i,N) cin >> x[i] >> y[i];\\n rep(i,N) rep(j,N){\\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\\n set[i].push_back(j);\\n }\\n }\\n //end\\n\\n queue< Pt > que;\\n int Say[1000],cnt = 0,flg = 1,END = 1000,ans = 0;\\n fill_n(Say,1000,-INF);\\n rep(i,N){\\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\\n Say[i] = X;\\n que.push(Pt(X,i));\\n }\\n }\\n while(!que.empty()){\\n Pt p = que.front(); que.pop();\\n int now = p.sc , time = p.fr;\\n cnt++;\\n if(cnt > END){ flg--; break; }\\n rep(i,set[now].size()){\\n int e = set[now][i];\\n if(time - Say[e] > Y){\\n Say[e] = X + time;\\n que.push(Pt(Say[e],e));\\n }\\n }\\n }\\n rep(i,N) ans = max(ans,Say[i]);\\n\\n //Output\\n if(!flg) cout << \\\"You're always welcome!\\\" << endl;\\n else cout << ans << endl;\\n //end\\n\\n set.clear();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5228,\n \"score_of_the_acc\": -0.0101,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2191_783283\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<algorithm>\\nusing namespace std;\\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\\n#define rep(i, n) reps(i,0,n)\\n#define fr first\\n#define sc second\\n#define SQR(x) ((x)*(x))\\n#define INF (1 << 28)\\ntypedef pair< int , int > Pt;\\n\\nint main(){\\n int Q;\\n int N,X,Y;\\n Pt Natume;\\n int x[1000],y[1000];\\n vector< vector<int> > set;\\n\\n cin >> Q;\\n while(Q--){\\n //Input\\n cin >> N >> X >> Y;\\n cin >> Natume.sc >> Natume.fr;\\n set.resize(N);\\n rep(i,N) cin >> x[i] >> y[i];\\n rep(i,N) rep(j,N){\\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\\n set[i].push_back(j);\\n }\\n }\\n //end\\n\\n queue< Pt > que;\\n int Say[1000],cnt = 0,flg = 1,END = 1500,ans = 0;\\n fill_n(Say,1000,-INF);\\n rep(i,N){\\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\\n Say[i] = X;\\n que.push(Pt(X,i));\\n }\\n }\\n while(!que.empty()){\\n Pt p = que.front(); que.pop();\\n int now = p.sc , time = p.fr;\\n cnt++;\\n if(cnt > END){ flg--; break; }\\n rep(i,set[now].size()){\\n int e = set[now][i];\\n if(time - Say[e] > Y){\\n Say[e] = X + time;\\n que.push(Pt(Say[e],e));\\n }\\n }\\n }\\n rep(i,N) ans = max(ans,Say[i]);\\n\\n //Output\\n if(!flg) cout << \\\"You're always welcome!\\\" << endl;\\n else cout << ans << endl;\\n //end\\n\\n set.clear();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5228,\n \"score_of_the_acc\": -0.0101,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2191_783282\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<algorithm>\\nusing namespace std;\\n#define reps(i,j,n) for(int i = j ; i < n ; ++i)\\n#define rep(i, n) reps(i,0,n)\\n#define fr first\\n#define sc second\\n#define SQR(x) ((x)*(x))\\n#define INF (1 << 28)\\ntypedef pair< int , int > Pt;\\n\\nint main(){\\n int Q;\\n int N,X,Y;\\n Pt Natume;\\n int x[1000],y[1000];\\n vector< vector<int> > set;\\n\\n cin >> Q;\\n while(Q--){\\n //Input\\n cin >> N >> X >> Y;\\n cin >> Natume.sc >> Natume.fr;\\n set.resize(N);\\n rep(i,N) cin >> x[i] >> y[i];\\n rep(i,N) rep(j,N){\\n if(SQR(x[i] - x[j]) + SQR(y[i] - y[j]) <= 2500){\\n set[i].push_back(j);\\n }\\n }\\n //end\\n\\n queue< Pt > que;\\n int Say[1000],cnt = 0,flg = 1,END = 2*N*N,ans = 0;\\n fill_n(Say,1000,-INF);\\n rep(i,N){\\n if(SQR(x[i] - Natume.sc) + SQR(y[i] - Natume.fr) <= 100){\\n Say[i] = X;\\n que.push(Pt(X,i));\\n }\\n }\\n while(!que.empty()){\\n Pt p = que.front(); que.pop();\\n int now = p.sc , time = p.fr;\\n cnt++;\\n if(cnt > END){ flg--; break; }\\n rep(i,set[now].size()){\\n int e = set[now][i];\\n if(time - Say[e] > Y){\\n Say[e] = X + time;\\n que.push(Pt(Say[e],e));\\n }\\n }\\n }\\n rep(i,N) ans = max(ans,Say[i]);\\n\\n //Output\\n if(!flg) cout << \\\"You're always welcome!\\\" << endl;\\n else cout << ans << endl;\\n //end\\n\\n set.clear();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5228,\n \"score_of_the_acc\": -0.0303,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1193,"cells":{"group_id":{"kind":"string","value":"aoj_2190_cpp"},"problem_description":{"kind":"string","value":"Problem F:\n天使の階段\nなつめの住んでいる街の上に浮かんでいる雲には、天使が住んでいる。その天使はなつめと同じくねこ好きで、しばしばねこと遊びに地上に降りてくる。地上に降りるために、天使は雲から地上へ繋がる長い長い階段を作った。しかし、毎回毎回ただ降りていくだけではつまらないと思った天使は、階段に細工をして、段を踏むと音が出るようにした。これを使って、音楽を奏でながら降りていくのだ。\n音楽は12種類の音を使って奏でるものである。今回、音のオクターブは無視することにして、 C, C#, D, D#, E, F, F#, G, G#, A, A#, B の12種類のみを考える。隣りあう音同士の差を半音と呼ぶ。たとえば、Cを半音上げるとC#、C#を半音上げるとDとなる。逆に、Gを半音下げるとF#、 F#を半音下げるとFとなる。なお、Eを半音上げるとF、Bを半音上げるとCになることに注意してほしい。\n階段から音が出る仕組みは次のようになっている。まず、階段は空中に浮かぶ\nn\n枚の白い板からなっている。雲から数えて 1 ~\nn\n段目の板には、それぞれに12音のどれかが割り振られている。これを\nT\ni\n(\ni\n= 1 ...\nn\n) と書くことにする。また簡単のために、雲は0段目、地上は\nn\n+1 段目と考える (ただしこれらには音階は割り当てられていない) 。天使が\nk\n(\nk\n= 0 ...\nn\n) 段目にいるとき、次は\nk\n-1,\nk\n+1,\nk\n+2 段のうち存在するもののどれかに行くことができる。ただし、\nn\n+1 段目 (地上) に降りた後は動くことはできず、0段目 (雲) を離れた後はそこに戻ることはできない。それぞれの動き方をしたとき、次のようなルールで音が鳴る。\nk\n+1 段目に降りた\nT\nk\n+1\nの音が鳴る。\nk\n+2 段目に降りた\nT\nk\n+2\nを半音上げた音が鳴る。\nk\n-1 段目に戻った\nT\nk\n-1\nを半音下げた音が鳴る。\n階段の情報\nT\n1\n...\nT\nn\nと、天使が奏でたい曲\nS\n1\n...\nS\nm\nが与えられる。このとき、奏でたい曲の前、途中、後で別の音を鳴らしてはならない。天使がこの曲を奏でて雲から地上へ降りられるかどうか判定せよ。\nInput\n入力の1行目には、階段の段数\nn\nと天使が奏でたい曲の長さ\nm\nが与えられる。2行目は階段の情報であり、\nT\n1\n,\nT\n2\n, ...,\nT\nn\nがこの順で与えられる。3行目は天使が奏でたい曲であり、\nS\n1\n,\nS\n2\n, ...,\nS\nm\nがこの順で与えられる。これらは全て1つの空白文字で区切られており、1 <=\nn\n,\nm\n<= 50000を満たす。\nOutput\n天使が与えられた曲を奏でながら地上に降りられるなら\"Yes\"、そうでなければ\"No\"を1行に出力せよ。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n4\n6 4\nC E D# F G A\nC E F G\n6 4\nC E D# F G A\nC D# F G\n3 6\nC D D\nD# B D B D# C#\n8 8\nC B B B B B F F\nC B B B B B B B\nOutput for the Sample Input\nYes\nNo\nYes\nNo"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2190_9073606","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nvector<string> oc={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\nvector<int> ti(50000+1),si(50000+1);\n\nint tc=0,sc=0;\n\nbool nxt(int ps,int cnt){\n //cout << ps << \" \" << cnt << endl;\n if(cnt==0){\n if(ps==0) return true;\n else return false;\n }\n bool res=false;\n if(((ps-1)>=0)&&(si[cnt]==ti[ps])){\n res=(res||nxt(ps-1,cnt-1));\n }\n if(((ps-2)>=0)&&(si[cnt]==(ti[ps]+1)%12)){\n res=(res||nxt(ps-2,cnt-1));\n }\n if(((ps+1)<=tc)&&(si[cnt]==(ti[ps]-1+12)%12)){\n res=(res||nxt(ps+1,cnt-1));\n }\n return res;\n}\n\n\nint main(){\n\n int n;\n cin >> n;\n \n for(int k=0;k<n;k++){\n cin >> tc >> sc;\n vector<string> t(tc),s(sc);\n for(auto &a:t) cin >> a;\n for(auto &a:s) cin >> a;\n \n for(int i=0;i<tc;i++){\n ti[i+1]=distance(oc.begin(),find(oc.begin(),oc.end(),t[i]));\n }\n for(int i=0;i<sc;i++){\n si[i+1]=distance(oc.begin(),find(oc.begin(),oc.end(),s[i]));\n }\n \n if(nxt(tc,sc)||nxt(tc-1,sc)) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":8404,"score_of_the_acc":-0.6581,"final_rank":12},{"submission_id":"aoj_2190_6049701","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n map<string,int> mp;\n mp[\"C\"] = 0;\n mp[\"C#\"] = 1;\n mp[\"D\"] = 2;\n mp[\"D#\"] = 3;\n mp[\"E\"] = 4;\n mp[\"F\"] = 5;\n mp[\"F#\"] = 6;\n mp[\"G\"] = 7;\n mp[\"G#\"] = 8;\n mp[\"A\"] = 9;\n mp[\"A#\"] = 10;\n mp[\"B\"] = 11;\n int q; cin >> q;\n while(q--){\n int n; cin >> n;\n int m; cin >> m;\n vector<int> a(n+2,1e9);\n for(int i=1;i<=n;i++){\n string s; cin >> s;\n a[i] = mp[s];\n }\n vector<int> b(m);\n for(int i=0;i<m;i++){\n string s; cin >> s;\n b[i] = mp[s];\n }\n auto solve=[&](auto self, int idx, int cur)->bool{\n if(idx == -1){\n return (cur == 0);\n }\n if(cur <= 0 or cur > n) return false;\n if(a[cur] == b[idx]){\n if(self(self, idx-1, cur-1)) return true;\n }\n if((a[cur] + 1)%12 == b[idx]){\n if(self(self, idx-1, cur-2)) return true;\n }\n if((a[cur] + 11)%12 == b[idx]){\n if(self(self, idx-1, cur+1)) return true;\n }\n return false;\n };\n if(solve(solve, m-1, n) or solve(solve, m-1, n-1)){\n cout << \"Yes\" << \"\\n\";\n }\n else{\n cout << \"No\" << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":7724,"score_of_the_acc":-0.5852,"final_rank":11},{"submission_id":"aoj_2190_6049234","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n map<string,int> mp;\n mp[\"C\"] = 0;\n mp[\"C#\"] = 1;\n mp[\"D\"] = 2;\n mp[\"D#\"] = 3;\n mp[\"E\"] = 4;\n mp[\"F\"] = 5;\n mp[\"F#\"] = 6;\n mp[\"G\"] = 7;\n mp[\"G#\"] = 8;\n mp[\"A\"] = 9;\n mp[\"A#\"] = 10;\n mp[\"B\"] = 11;\n int q; cin >> q;\n while(q--){\n int n; cin >> n;\n int m; cin >> m;\n vector<int> a(n+2,1e9);\n for(int i=1;i<=n;i++){\n string s; cin >> s;\n a[i] = mp[s];\n }\n vector<int> b(m);\n for(int i=0;i<m;i++){\n string s; cin >> s;\n b[i] = mp[s];\n }\n auto solve=[&](auto self, int idx, int cur)->bool{\n if(idx == -1){\n return (cur == 0);\n }\n if(cur <= 0 or cur > n) return false;\n if(a[cur] == b[idx]){\n if(self(self, idx-1, cur-1)) return true;\n }\n if((a[cur] + 1)%12 == b[idx]){\n if(self(self, idx-1, cur-2)) return true;\n }\n if((a[cur] + 11)%12 == b[idx]){\n if(self(self, idx-1, cur+1)) return true;\n }\n return false;\n };\n if(solve(solve, m-1, n) or solve(solve, m-1, n-1)){\n cout << \"Yes\" << \"\\n\";\n }\n else{\n cout << \"No\" << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":7700,"score_of_the_acc":-0.5827,"final_rank":10},{"submission_id":"aoj_2190_5014250","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 6 \"/home/yuruhiya/programming/library/template/constants.cpp\"\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1e9;\nconstexpr long long inf_ll = 1e18, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tint gc() const {\n\t\treturn getchar_unlocked();\n\t}\n\ttemplate <class T> void read(T& v) const {\n\t\tcin >> v;\n\t}\n\tvoid read(char& v) const {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tvoid read(bool& v) const {\n\t\tv = read<char>() != '0';\n\t}\n\tvoid read(string& v) const {\n\t\tv.clear();\n\t\tfor (char c = read<char>(); !isspace(c); c = gc()) v += c;\n\t}\n\tvoid read(int& v) const {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tvoid read(long long& v) const {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tvoid read(double& v) const {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tvoid read(long double& v) const {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = read<char>();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> void read(pair<T, U>& v) const {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> void read(vector<T>& v) const {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> void read_tuple_impl(T& v) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> void read(tuple<T...>& v) const {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = read<char>(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 6 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\n\ntemplate <class T> int sz(const T& v) {\n\treturn v.size();\n}\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\n\treturn lower_bound(all(a), v) - a.begin();\n}\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\n\treturn upper_bound(all(a), v) - a.begin();\n}\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\n\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\n}\ntemplate <class T> T div_ceil(T n, T m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T> T div_ceil2(T n, T m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T> T middle(const T& l, const T& r) {\n\treturn l + (r - l) / 2;\n}\ntemplate <class T> bool chmax(T& a, const T& b) {\n\tif (a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T> bool in_range(const T& v, const T& min, const T& max) {\n\treturn min <= v && v < max;\n}\ntemplate <class T> bool in_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> T BIT(int b) {\n\treturn T(1) << b;\n}\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\n}\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\n\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\n}\ntemplate <class T, class U> T Pow(T a, U n) {\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult *= a;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta *= a;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\ntemplate <class T, class U> T Powmod(T a, U n, T mod) {\n\tT result = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tresult = result * a % mod;\n\t\t\tn--;\n\t\t} else {\n\t\t\ta = a * a % mod;\n\t\t\tn >>= 1;\n\t\t}\n\t}\n\treturn result;\n}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 2 \"b.cpp\"\n\nconst int N = 12;\nconst VS sound{\n \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\",\n};\n\nbool solve() {\n\tini(n, m);\n\tauto a = in.read_vector<string>(n) |\n\t Map([&](const string& s) { return *(sound | Index(s)); });\n\tauto b = in.read_vector<string>(m) |\n\t Map([&](const string& s) { return *(sound | Index(s)); });\n\tdump(a, b);\n\n\tauto next_sound = [&](int i) {\n\t\treturn (i + 1) % N;\n\t};\n\tauto prev_sound = [&](int i) {\n\t\treturn (i + 11) % N;\n\t};\n\n\tauto dfs = [&](auto&& f, int i, int j) -> bool {\n\t\tdump(tuple(i, j));\n\t\tif (j == -1) {\n\t\t\treturn i == -1;\n\t\t} else if (!in_range(i, 0, n)) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tif (a[i] == b[j]) {\n\t\t\t\treturn f(f, i - 1, j - 1);\n\t\t\t} else if (next_sound(a[i]) == b[j]) {\n\t\t\t\treturn f(f, i - 2, j - 1);\n\t\t\t} else if (prev_sound(a[i]) == b[j]) {\n\t\t\t\treturn f(f, i + 1, j - 1);\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t};\n\treturn dfs(dfs, n - 1, m - 1) || dfs(dfs, n - 2, m - 1);\n}\n\nint main() {\n\tfor (int t = in; t--;) {\n\t\tout(solve());\n\t}\n}","accuracy":1,"time_ms":70,"memory_kb":6316,"score_of_the_acc":-0.4478,"final_rank":6},{"submission_id":"aoj_2190_4292564","code_snippet":"#include <bits/stdc++.h>\n//typedef\n//-------------------------#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\n \n \nusing namespace std;\n \n//conversion\n//------------------------------------------\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }\ninline int readInt() { int x; scanf(\"%d\", &x); return x; }\n \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 \n//container util\n \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 \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 998244353\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;\nconst double EPS = 1E-8;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n \nclass UnionFind {\npublic:\n vector <int> par; \n vector <int> siz; \n\n UnionFind(int sz_): par(sz_), siz(sz_, 1) {\n for (ll i = 0; i < sz_; ++i) par[i] = i;\n }\n void init(int sz_) {\n par.resize(sz_);\n siz.assign(sz_, 1LL);\n for (ll i = 0; i < sz_; ++i) par[i] = i;\n }\n \n int root(int x) { \n while (par[x] != x) {\n x = par[x] = par[par[x]];\n }\n return x;\n }\n \n bool merge(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n \n bool issame(int x, int y) { \n return root(x) == root(y);\n }\n \n int size(int x) { \n return siz[root(x)];\n }\n};\n \n \nll modPow(ll x, ll n, ll mod = MOD){\n ll res = 1;\n while(n){\n if(n&1) res = (res * x)%mod;\n \n res %= mod;\n x = x * x %mod;\n n >>= 1;\n }\n return res;\n}\n \n#define SIEVE_SIZE 5000000+10\nbool sieve[SIEVE_SIZE];\nvoid makeSieve(){\n for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;\n sieve[0] = sieve[1] = false;\n for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;\n}\n \nbool isprime(ll n){\n if(n == 0 || n == 1) return false;\n for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;\n return true;\n}\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n \nlong long extGCD(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\n// 負の数にも対応した mod (a = -11 とかでも OK) \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\n \n// 逆元計算 (ここでは a と m が互いに素であることが必要)\nlong long modinv(long long a, long long m) {\n long long x, y;\n extGCD(a, m, x, y);\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\n}\nll GCD(ll a, ll b){\n \n if(b == 0) return a;\n return GCD(b, a%b);\n}\n\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nmat mul(mat &A, mat &B) {\n mat C(A.size(), vec((int)B[0].size()));\n for(int i=0; i<A.size(); ++i){\n for(int k=0; k<B.size(); ++k){\n for(int j=0; j<B[0].size(); ++j){\n C[i][j] = (C[i][j] + A[i][k] * B[k][j] %MOD) % MOD;\n }\n }\n }\n return C;\n}\nmat matPow(mat A, ll n) {\n mat B(A.size(), vec((int)A.size()));\n \n for(int i=0; i<A.size(); ++i){\n B[i][i] = 1;\n }\n \n while(n > 0) {\n if(n & 1) B = mul(B, A);\n A = mul(A, A);\n n >>= 1;\n }\n return B;\n}\n\nstring ar[12] = {\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\"};\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n\n int t; cin >> t;\n map<string, int> mp;\n // C, C#, D, D#, E, F, F#, G, G#, A, A#, B -> C... \n\n for(int i=0; i<12; i++){\n mp[ar[i]] = i;\n }\n while(t--){\n int n, m; cin >> n >> m;\n vector<string> T(n+1), S(m+1);\n for(int i=1; i<=n; i++) cin >> T[i];\n for(int i=1; i<=m; i++) cin >> S[i];\n\n //Sは踏むべき音, Tは今いるposの音\n bool ok = false;\n //一番最後に踏む段(n)\n int pos = n;\n \n bool check1 = true;\n for(int i=m; i>=1; i--){\n if(mp[S[i]] == mp[T[pos]]){\n pos--;\n }else if(mp[S[i]] == (mp[T[pos]]+1)%12){\n //半音高い場合 -> 2段上に\n if(pos-2>=0){\n pos = pos-2;\n\n }else{\n check1 = false;\n }\n }else if(mp[S[i]] == (mp[T[pos]]-1 + 12) % 12){\n //半音低い場合 -> 1段下に\n if(pos+1<=n){\n pos = pos + 1;\n\n }else{\n check1 = false;\n }\n }else{\n check1 = false;\n }\n }\n if(check1 && pos == 0){\n ok = true;\n }\n\n bool check2 = true;\n pos = n-1;\n for(int i=m; i>=1; i--){\n if(mp[S[i]] == mp[T[pos]]){\n pos--;\n }else if(mp[S[i]] == (mp[T[pos]]+1)%12){\n //半音高い場合 -> 2段上に\n if(pos-2>=0){\n pos = pos-2;\n\n }else{\n check2 = false;\n }\n }else if(mp[S[i]] == (mp[T[pos]]-1 + 12) % 12){\n //半音低い場合 -> 1段下に\n if(pos+1<=n){\n pos = pos + 1;\n\n }else{\n check2 = false;\n }\n }else{\n check2 = false;\n }\n }\n if(pos == 0 && check2){\n ok = true;\n }\n\n if(ok){\n cout << \"Yes\" << endl;\n }else{\n cout << \"No\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":8308,"score_of_the_acc":-0.6592,"final_rank":13},{"submission_id":"aoj_2190_3423997","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nconst map<string, int> NOTE_NUMS = {\n {\"C\", 0},\n {\"C#\", 1},\n {\"D\", 2},\n {\"D#\", 3},\n {\"E\", 4},\n {\"F\", 5},\n {\"F#\", 6},\n {\"G\", 7},\n {\"G#\", 8},\n {\"A\", 9},\n {\"A#\", 10},\n {\"B\", 11},\n};\n\nvector<int> steps;\nvector<int> song;\nbool result;\n\nvector<string> split(const string &s, char delim) {\n vector<string> elems;\n stringstream ss(s);\n string item;\n while (getline(ss, item, delim)) {\n if (!item.empty()) {\n elems.push_back(item);\n }\n }\n return elems;\n}\n\nvoid canPlay(long stepPos, long songPos){\n if(result){\n return;\n }\n\n if(songPos == song.size()){\n if(steps.size() - stepPos < 3){\n result = true;\n }\n return;\n }\n\n if( 0 <= stepPos + 1 && stepPos + 1 < steps.size()){\n if(steps[stepPos + 1] == song[songPos]){\n canPlay(stepPos + 1, songPos + 1);\n }\n }\n\n if( 0 <= stepPos + 2 && stepPos + 2 < steps.size()){\n if((steps[stepPos + 2] + 1) % 12 == song[songPos]){\n canPlay(stepPos + 2, songPos + 1);\n }\n }\n\n if( 0 <= stepPos - 1 && stepPos - 1 < steps.size()){\n if((steps[stepPos - 1] + 11) % 12 == song[songPos]){\n canPlay(stepPos - 1, songPos + 1);\n }\n }\n}\n\nint main(){\n string n;\n getline(cin, n);\n int q = stoi(n);\n for(int i = 0; i < q; ++i){\n string x, stepsLine, songLine;\n getline(cin, x);\n getline(cin, stepsLine);\n getline(cin, songLine);\n auto stepsStr = split(stepsLine, ' ');\n auto songStr = split(songLine, ' ');\n\n steps.clear();\n for(auto it = stepsStr.begin(); it != stepsStr.end(); ++it){\n steps.push_back(NOTE_NUMS.at(*it));\n }\n\n song.clear();\n for(auto it = songStr.begin(); it != songStr.end(); ++it){\n song.push_back(NOTE_NUMS.at(*it));\n }\n\n result = false;\n canPlay(-1, 0);\n cout << (result ? \"Yes\": \"No\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":7390,"memory_kb":11732,"score_of_the_acc":-1.9861,"final_rank":19},{"submission_id":"aoj_2190_3423993","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nconst map<string, int> noteNums = {\n {\"C\", 0},\n {\"C#\", 1},\n {\"D\", 2},\n {\"D#\", 3},\n {\"E\", 4},\n {\"F\", 5},\n {\"F#\", 6},\n {\"G\", 7},\n {\"G#\", 8},\n {\"A\", 9},\n {\"A#\", 10},\n {\"B\", 11},\n};\n\nvector<int> steps;\nvector<int> song;\nbool result;\n\nvector<string> split(const string &s, char delim) {\n vector<string> elems;\n stringstream ss(s);\n string item;\n while (getline(ss, item, delim)) {\n if (!item.empty()) {\n elems.push_back(item);\n }\n }\n return elems;\n}\n\nvoid canPlay(long stepPos, long songPos){\n if(result){\n return;\n }\n if(songPos == song.size()){\n if(steps.size() - stepPos < 3){\n result = true;\n }\n return;\n }\n\n if( 0 <= stepPos + 1 && stepPos + 1 < steps.size()){\n if(steps[stepPos + 1] == song[songPos]){\n canPlay(stepPos + 1, songPos + 1);\n }\n }\n\n if( 0 <= stepPos + 2 && stepPos + 2 < steps.size()){\n if((steps[stepPos + 2] + 1) % 12 == song[songPos]){\n canPlay(stepPos + 2, songPos + 1);\n }\n }\n\n if( 0 <= stepPos - 1 && stepPos - 1 < steps.size()){\n if((steps[stepPos - 1] + 11) % 12 == song[songPos]){\n canPlay(stepPos - 1, songPos + 1);\n }\n }\n}\n\nint main(){\n string n;\n getline(cin, n);\n int q = stoi(n);\n for(int i = 0; i < q; ++i){\n string x, stepsLine, songLine;\n getline(cin, x);\n getline(cin, stepsLine);\n getline(cin, songLine);\n auto stepsStr = split(stepsLine, ' ');\n auto songStr = split(songLine, ' ');\n\n steps.clear();\n for(auto it = stepsStr.begin(); it != stepsStr.end(); ++it){\n steps.push_back(noteNums.at(*it));\n }\n\n song.clear();\n for(auto it = songStr.begin(); it != songStr.end(); ++it){\n song.push_back(noteNums.at(*it));\n }\n\n result = false;\n canPlay(-1, 0);\n cout << (result ? \"Yes\": \"No\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":7430,"memory_kb":11816,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2190_2691096","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n Int T;\n cin>>T;\n map<string,Int> ms;\n vector<string> vs({\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\" });\n for(Int i=0;i<12;i++) ms[vs[i]]=i;\n while(T--){\n Int n,m;\n cin>>n>>m;\n vector<Int> t(n+1,0),s(m);\n for(Int i=0;i<n;i++){\n string x;\n cin>>x;\n t[i+1]=ms[x];\n }\n for(Int i=0;i<m;i++){\n string x;\n cin>>x;\n s[i]=ms[x];\n }\n\n vector<Int> dp(1,n+1);\n for(Int i=m;i>=0;i--){\n vector<Int> nx;\n for(Int x: dp){\n\tif(x-1>=0&&(i==m||t[x]==s[i])) nx.emplace_back(x-1);\n\tif(x-2>=0&&(i==m||t[x]==(s[i]+11)%12)) nx.emplace_back(x-2);\n\tif(x+1<=n&&(i==m||t[x]==(s[i]+1)%12)) nx.emplace_back(x+1);\n }\n sort(nx.begin(),nx.end());\n nx.erase(unique(nx.begin(),nx.end()),nx.end());\n swap(dp,nx);\n if(dp.empty()) break;\n }\n \n cout<<(!dp.empty()&&dp.front()==0?\"Yes\":\"No\")<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3644,"score_of_the_acc":-0.1783,"final_rank":4},{"submission_id":"aoj_2190_2690833","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define Rep(i, n) for ( int i = 0; i < (n); i++ ) \ntypedef pair<int, int> Pii;\n\n#define fr first\n#define sc second\n\nclock_t start;\ndouble calcTime2(){\n clock_t end = clock(); // 終了時間\n return (double)(end - start) / CLOCKS_PER_SEC;\n}\n\n\nint main() {\n srand((unsigned)time(NULL));\n \n map<string, string> ne;\n ne[\"C\"] = \"C#\";\n ne[\"C#\"] = \"D\";\n ne[\"D\"] = \"D#\";\n ne[\"D#\"] = \"E\";\n ne[\"E\"] = \"F\";\n ne[\"F\"] = \"F#\";\n ne[\"F#\"] = \"G\";\n ne[\"G\"] = \"G#\";\n ne[\"G#\"] = \"A\";\n ne[\"A\"] = \"A#\";\n ne[\"A#\"] = \"B\";\n ne[\"B\"] = \"C\";\n map<string, string> pr;\n pr[\"C\"] = \"B\";\n pr[\"B\"] = \"A#\";\n pr[\"A#\"] = \"A\";\n pr[\"A\"] = \"G#\";\n pr[\"G#\"] = \"G\";\n pr[\"G\"] = \"F#\";\n pr[\"F#\"] = \"F\";\n pr[\"F\"] = \"E\";\n pr[\"E\"] = \"D#\";\n pr[\"D#\"] = \"D\";\n pr[\"D\"] = \"C#\";\n pr[\"C#\"] = \"C\";\n //string onp[12] = {\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\" };\n string T[50001], S[50001]; \n int k;\n cin >> k;\n while ( k-- ) {\n \n int n, m;\n start = clock();// スタート時間\n\n cin >> n >> m;\n //cout<<n<<\" \"<<m<<endl;\n //cout<<calcTime2()<<endl;\n Rep(i, n) cin >> T[i];\n Rep(i, m) cin >> S[i];\n //if(n == 50000 && m==50000)continue; \n vector<int>used(n+10);\n queue<Pii> q;\n bool flag = false;\n q.push(Pii(0, -1));\n while ( !q.empty() && calcTime2()<3) {\n Pii p = q.front(); q.pop();\n int s = p.fr, t = p.sc;\n \n //cout << s-1 << \" \" << t << endl;\n\n if ( s == m ) {\n\tif ( t == n-1 || t == n-2 ) {\n\t flag = true;\n\t break;\n\t} else {\n\t continue;\n\t}\n }\n if(t >= n) continue;\n // if((n-t) > (m-s)*2+1) continue;\n \n \n if ( t > 0 && pr[T[t-1]] == S[s] ) {\n\tif (used[t-1] != s+1 ) {\n\t q.push(Pii(s+1, t-1));\n\t used[t-1] = s+1;\n\t}\n }\n \n if ( t <= n-2 && T[t+1] == S[s] ) {\n\tif (used[t+1] != s+1 ) {\n\t q.push(Pii(s+1, t+1));\n\t used[t+1] = s+1;\n\t}\n }\n \n if ( t <= n-3 && ne[T[t+2]] == S[s] ) {\n\tif (used[t+2] != s+1 ) {\n\t q.push(Pii(s+1, t+2));\n\t used[t+2] = s+1;\n\t}\n }\n \n }\n \n if(calcTime2()>=2.8) flag = rand()%2;\n if ( flag ) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":3120,"memory_kb":8708,"score_of_the_acc":-1.1025,"final_rank":15},{"submission_id":"aoj_2190_2690690","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n int T;\n cin>>T;\n map<string,int> ms;\n vector<string> vs({\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"A#\", \"B\" });\n for(int i=0;i<12;i++) ms[vs[i]]=i;\n while(T--){\n int n,m;\n cin>>n>>m;\n vector<int> t(n+1,0),s(m);\n for(int i=0;i<n;i++){\n string x;\n cin>>x;\n t[i+1]=ms[x];\n }\n for(int i=0;i<m;i++){\n string x;\n cin>>x;\n s[i]=ms[x];\n }\n if(0){\n for(int i:s) cout<<i<<\" \";cout<<endl;\n for(int i:t) cout<<i<<\" \";cout<<endl;\n }\n \n auto check=[&](int x,int i){\n return x+(m-i)*2>=n+1;\n };\n\n if(n<=100){\n bool flg=0;\n vector<int> dp(1,0);\n for(int i=0;i<=m;i++){\n\tvector<int> nx;\n\tfor(int x: dp){\n\t if(i==m){\n\t if(x+2>=n+1){\n\t flg=1;\n\t break;\n\t }\n\t }else{\n\t if(x+1<=n&&(t[x+1]==s[i]))\n\t if(check(x+1,i)) nx.emplace_back(x+1);\n\t if(x+2<=n&&(t[x+2]==(s[i]+11)%12))\n\t if(check(x+2,i))nx.emplace_back(x+2);\n\t if(x-1>=0&&(t[x-1]==(s[i]+1)%12))\n\t if(check(x-1,i)) nx.emplace_back(x-1);\n\t }\n\t}\n\tsort(nx.begin(),nx.end());\n\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\n\tif(0){\n\t cout<<i<<\":\"<<endl;\n\t for(int x:nx) cout<<x<<\" \";cout<<endl;\n\t}\n\tswap(dp,nx);\n\tif(dp.empty()) break;\n }\n cout<<(flg?\"Yes\":\"No\")<<endl;\n continue;\n }\n \n bool flg=0;\n int h=n/2;\n vector<int> ff,tt;\n {\n vector<int> dp(1,0);\n for(int i=0;i<h;i++){\n\tvector<int> nx;\n\tfor(int x: dp){\n\t if(x+1<=n&&(t[x+1]==s[i]))\n\t if(check(x+1,i)) nx.emplace_back(x+1);\n\t if(x+2<=n&&(t[x+2]==(s[i]+11)%12))\n\t if(check(x+2,i))nx.emplace_back(x+2);\n\t if(x-1>=0&&(t[x-1]==(s[i]+1)%12))\n\t if(check(x-1,i)) nx.emplace_back(x-1);\n\t}\n\tsort(nx.begin(),nx.end());\n\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\n\tswap(dp,nx);\n\tif(dp.empty()) break;\n }\n ff=dp;\n }\n {\n vector<int> dp(1,n+1);\n for(int i=m;i>=h;i--){\n\tvector<int> nx;\n\tfor(int x: dp){\n\t if(x-1>=0&&(i==m||t[x]==s[i])) nx.emplace_back(x-1);\n\t if(x-2>=0&&(i==m||t[x]==(s[i]+11)%12)) nx.emplace_back(x-2);\n\t if(x+1<=n&&(i==m||t[x]==(s[i]+1)%12)) nx.emplace_back(x+1);\n\t}\n\tsort(nx.begin(),nx.end());\n\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\n\tswap(dp,nx);\n\tif(dp.empty()) break;\n }\n tt=dp;\n }\n \n set<int> cnt;\n for(int i:ff) cnt.emplace(i);\n for(int i:tt) flg|=cnt.count(i);\n cout<<(flg?\"Yes\":\"No\")<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":4350,"memory_kb":4480,"score_of_the_acc":-0.8401,"final_rank":14},{"submission_id":"aoj_2190_2648511","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nint stair[50000],melody[50000];\n\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nint getNUM(char buf[3]){\n\tswitch(buf[0]){\n\tcase 'C':\n\t\tif(buf[1] == '\\0'){\n\t\t\treturn 0;\n\t\t}else{\n\t\t\treturn 1;\n\t\t}\n\t\tbreak;\n\tcase 'D':\n\t\tif(buf[1] == '\\0'){\n\t\t\treturn 2;\n\t\t}else{\n\t\t\treturn 3;\n\t\t}\n\t\tbreak;\n\tcase 'E':\n\t\treturn 4;\n\t\tbreak;\n\tcase 'F':\n\t\tif(buf[1] == '\\0'){\n\t\t\treturn 5;\n\t\t}else{\n\t\t\treturn 6;\n\t\t}\n\t\tbreak;\n\tcase 'G':\n\t\tif(buf[1] == '\\0'){\n\t\t\treturn 7;\n\t\t}else{\n\t\t\treturn 8;\n\t\t}\n\t\tbreak;\n\tcase 'A':\n\t\tif(buf[1] == '\\0'){\n\t\t\treturn 9;\n\t\t}else{\n\t\t\treturn 10;\n\t\t}\n\t\tbreak;\n\tcase 'B':\n\t\treturn 11;\n\t\tbreak;\n\t}\n}\n\nbool is_UP(int to,int from){\n\n\tif((to == from+1) || (to == 0 && from == 11))return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nbool is_DOWN(int to,int from){\n\tif((to == from-1 || (to == 11 && from == 0)))return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\n\nvoid func(){\n\n\tint N,M;\n\tscanf(\"%d %d\",&N,&M);\n\n\tchar buf[3];\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s\",buf);\n\t\tstair[i] = getNUM(buf);\n\t}\n\treverse(stair,stair+N);\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%s\",buf);\n\t\tmelody[i] = getNUM(buf);\n\t}\n\treverse(melody,melody+M);\n\n\tbool FLG = false;\n\tint loc,index;\n\n\tif((stair[0] == melody[0]) || (N >= 2 && is_UP(melody[0],stair[0]) == true)){\n\t\tif(stair[0] == melody[0]){\n\t\t\tloc = 1;\n\t\t}else{\n\t\t\tloc = 2;\n\t\t}\n\n\t\tif(loc == N && M == 1){\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tindex = 1;\n\n\t\twhile(loc < N || index < M){\n\t\t\tif(melody[index] == stair[loc]){\n\t\t\t\tloc += 1;\n\t\t\t\tindex++;\n\t\t\t}else if(is_UP(melody[index],stair[loc]) == true && loc+2 <= N){\n\t\t\t\tloc += 2;\n\t\t\t\tindex++;\n\t\t\t}else if(is_DOWN(melody[index],stair[loc]) == true && loc > 0){\n\t\t\t\tloc -= 1;\n\t\t\t\tindex++;\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(loc == N && index == M)FLG = true;\n\t}\n\n\tif(FLG){\n\t\tprintf(\"Yes\\n\");\n\t\treturn;\n\t}\n\n\tif((N >= 2 && stair[1] == melody[0]) || (N >= 3 && is_UP(melody[0],stair[1]) == true) || (is_DOWN(melody[0],stair[1]) == true)){\n\t\tif(stair[1] == melody[0]){\n\t\t\tloc = 2;\n\t\t}else if(is_UP(melody[0],stair[1]) == true){\n\t\t\tloc = 3;\n\t\t}else{ //is_DOWN(melody[0],stair[1]) == true\n\t\t\tloc = 0;\n\t\t}\n\n\t\tif(loc == N && M == 1){\n\t\t\tprintf(\"Yes\\n\");\n\t\t\treturn;\n\t\t}\n\n\t\tindex = 1;\n\n\t\twhile(loc < N || index < M){\n\t\t\tif(melody[index] == stair[loc]){\n\t\t\t\tloc += 1;\n\t\t\t\tindex++;\n\t\t\t}else if(is_UP(melody[index],stair[loc]) == true && loc+2 <= N){\n\t\t\t\tloc += 2;\n\t\t\t\tindex++;\n\t\t\t}else if(is_DOWN(melody[index],stair[loc]) == true && loc > 0){\n\t\t\t\tloc -= 1;\n\t\t\t\tindex++;\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(loc == N && index == M)FLG = true;\n\t}\n\n\tif(FLG){\n\t\tprintf(\"Yes\\n\");\n\t}else{\n\t\tprintf(\"No\\n\");\n\t}\n}\n\n\nint main(){\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++)func();\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3416,"score_of_the_acc":-0.1484,"final_rank":3},{"submission_id":"aoj_2190_2290776","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \nint input(){\n char str[10];\n scanf(\"%s\",str);\n \n if(str[0]=='B'){\n return 11;\n }\n \n if(str[0]=='A'){\n if(str[1]=='#')return 10;\n return 9;\n }\n \n if(str[0]=='G'){\n if(str[1]=='#')return 8;\n return 7;\n }\n \n if(str[0]=='F'){\n if(str[1]=='#')return 6;\n return 5;\n }\n \n if(str[0]=='E'){\n return 4;\n }\n \n if(str[0]=='D'){\n if(str[1]=='#')return 3;\n return 2;\n }\n \n if(str[0]=='C'){\n if(str[1]=='#')return 1;\n return 0;\n }\n \n assert(0);\n return -1;\n}\n \nint n,m;\nint t[50005];\nint u[50005];\n \nint dfs(int depth,int pos){\n if(depth==m&&n<pos+2)return 1;\n if(depth==m)return 0;\n \n if( 1<=pos-1 && (t[pos-1]+11)%12 == u[depth] ){\n if( dfs( depth+1, pos-1 ) ) return 1;\n }\n \n if( pos+1 <= n && t[pos+1]==u[depth] ){\n if( dfs(depth+1,pos+1) )return 1;\n }\n \n if( pos+2 <= n && (t[pos+2]+1)%12==u[depth] ){\n if( dfs(depth+1,pos+2) )return 1;\n }\n \n return 0;\n}\n \nint main(){\n int Tc;\n scanf(\"%d\",&Tc);\n while(Tc--){\n scanf(\"%d %d\",&n,&m);\n for(int i=1;i<=n;i++)t[i]=input();\n for(int i=0;i<m;i++)u[i]=input();\n \n int ans=dfs(0,0);\n if(ans)printf(\"Yes\\n\");\n else printf(\"No\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":7240,"memory_kb":5804,"score_of_the_acc":-1.3648,"final_rank":18},{"submission_id":"aoj_2190_2290475","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint input(){\n char str[10];\n scanf(\"%s\",str);\n \n if(str[0]=='B'){\n return 11;\n }\n \n if(str[0]=='A'){\n if(str[1]=='#')return 10;\n return 9;\n }\n\n if(str[0]=='G'){\n if(str[1]=='#')return 8;\n return 7;\n }\n \n if(str[0]=='F'){\n if(str[1]=='#')return 6;\n return 5;\n }\n\n if(str[0]=='E'){\n return 4;\n }\n\n if(str[0]=='D'){\n if(str[1]=='#')return 3;\n return 2;\n }\n \n if(str[0]=='C'){\n if(str[1]=='#')return 1;\n return 0;\n }\n\n assert(0);\n return -1;\n}\n\nint n,m;\nint t[50005];\nint u[50005];\n\nint dfs(int depth,int pos){\n if(depth==m&&n<pos+2)return 1;\n if(depth==m)return 0;\n \n if( 1<=pos-1 && (t[pos-1]+11)%12 == u[depth] ){\n if( dfs( depth+1, pos-1 ) ) return 1;\n }\n\n if( pos+1 <= n && t[pos+1]==u[depth] ){\n if( dfs(depth+1,pos+1) )return 1;\n }\n\n if( pos+2 <= n && (t[pos+2]+1)%12==u[depth] ){\n if( dfs(depth+1,pos+2) )return 1;\n }\n\n return 0;\n}\n\nint main(){\n int Tc;\n scanf(\"%d\",&Tc);\n while(Tc--){\n scanf(\"%d %d\",&n,&m);\n for(int i=1;i<=n;i++)t[i]=input();\n for(int i=0;i<m;i++)u[i]=input();\n \n int ans=dfs(0,0);\n if(ans)printf(\"Yes\\n\");\n else printf(\"No\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":6430,"memory_kb":5856,"score_of_the_acc":-1.2606,"final_rank":16},{"submission_id":"aoj_2190_1912767","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 vi vector<int>\n#define pb push_back\n#define INF 999999999\n//#define INF (1LL<<59)\n\nstruct edge{int to,sound;};\n\nint f(string s){\n\tif(s==\"C\")return 0;\n\tif(s==\"C#\")return 1;\n\tif(s==\"D\")return 2;\n\tif(s==\"D#\")return 3;\n\tif(s==\"E\")return 4;\n\tif(s==\"F\")return 5;\n\tif(s==\"F#\")return 6;\n\tif(s==\"G\")return 7;\n\tif(s==\"G#\")return 8;\n\tif(s==\"A\")return 9;\n\tif(s==\"A#\")return 10;\n\tif(s==\"B\")return 11;\n\treturn -1;\n}\n\nbool isSame(vector<int> &a, vector<int> &b){\n\trep(i,a.size()){\n\t\tif(a[i]!=b[i+1])return false;\n\t}\n\treturn true;\n}\n\n\nint main(){\n\tint input;\n\tcin>>input;\n\trep(loop,input){\n\t\tint n,m;\n\t\tscanf(\"%d %d\",&n,&m);\n\t\tvector<int> step,song;\n\t\tstep.pb(-1);\t//1-index???????????????\n\t\trep(i,n){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tstep.pb(f(s));\n\t\t}\n\t\trep(i,m){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tsong.pb(f(s));\n\t\t}\n\t\tsong.pb(-1);\t//????????????????°???????????????????\n\t\t\n\t\tvector<edge> G[50010];\n\t\trep(i,n) G[i].pb( edge{(int)i+1,step[i+1]} );\n\t\trep(i,n) G[i+1].pb( edge{(int)i,(step[i]-1+12)%12} );\n\t\trep(i,n-1)G[i].pb( edge{(int)i+2,(step[i+2]+1)%12} );\n\t\tG[n].pb(edge{n+1,-1});\n\t\tG[n-1].pb(edge{n+2,-1});\n\t\t\n\t\tbool f=true;\n\t\t\n\t\tqueue<pii> que;\n\t\tque.push(make_pair(0,0));\n\t\twhile(!que.empty()){\n\t\t\tint pos = que.front().first;\n\t\t\tint num = que.front().second;\n\t\t\tque.pop();\n\t\t\t\n\t\t\tif(n+1-pos>2*(m+1-num))continue;\n\t\t\t\n\t\t\tif(num==m+1){\n\t\t\t\tcout<<\"Yes\"<<endl;\n\t\t\t\tf=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\trep(i,G[pos].size()){\n\t\t\t\tedge e = G[pos][i];\n\t\t\t\tif(e.sound == song[num]){\n\t\t\t\t\tque.push(make_pair(e.to,num+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(f) cout<<\"No\"<<endl;\n\t}\n}","accuracy":1,"time_ms":6060,"memory_kb":7108,"score_of_the_acc":-1.3376,"final_rank":17},{"submission_id":"aoj_2190_1908294","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<cstdio>\n#include<sstream>\n#include<iomanip>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef pair<int,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-8;\nconst int inf=1e8;\nint n,m;\nvi a,b;\nbool f(int s,int t){\n\tif(t==-1){\n\t\tif(s==-1)return true;\n\t\treturn false;\n\t}\n\tif(s>n||s<0)return false;\n\tif(a[s]==b[t]&&f(s-1,t-1))return true;\n\tif((a[s]+1)%12==b[t]&&f(s-2,t-1))return true;\n\tif((a[s]+11)%12==b[t]&&f(s+1,t-1))return true;\n\treturn false;\n}\nint main(){\n\tmap<string,int>M;\n\tM[\"A\"]=0;\n\tM[\"A#\"]=1;\n\tM[\"B\"]=2;\n\tM[\"C\"]=3;\n\tM[\"C#\"]=4;\n\tM[\"D\"]=5;\n\tM[\"D#\"]=6;\n\tM[\"E\"]=7;\n\tM[\"F\"]=8;\n\tM[\"F#\"]=9;\n\tM[\"G\"]=10;\n\tM[\"G#\"]=11;\n\tint q;\n\tcin>>q;\n\twhile(q--){\n\t\tcin>>n>>m;\n\t\ta=vi(n);\n\t\tb=vi(m);\n\t\trep(i,n){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\ta[i]=M[s];\n\t\t}\n\t\trep(i,m){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tb[i]=M[s];\n\t\t}\n\t\tif(f(n-1,m-1)||n!=1&&f(n-2,m-1))cout<<\"Yes\"<<endl;\n\t\telse cout<<\"No\"<<endl;\n\t}\n}","accuracy":1,"time_ms":170,"memory_kb":3540,"score_of_the_acc":-0.1799,"final_rank":5},{"submission_id":"aoj_2190_1886924","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MOD 12\ntypedef vector<int> Vec;\n \nint N,M;\n \nbool rec(int idxT,int idxS,Vec &T,Vec &S){\n if(idxT == N && idxS == M) return 1;\n if(idxT == N || idxS == M) return 0;\n bool res = false;\n if(idxT+1 <= N && T[idxT] == S[idxS]){\n res |= rec(idxT+1,idxS+1,T,S);\n }\n if(idxT+2 <= N && (T[idxT]+1)%MOD == S[idxS]){\n res |= rec(idxT+2,idxS+1,T,S);\n }\n if(idxT-1 >= 0 && (T[idxT]-1+MOD)%MOD == S[idxS]){\n res |= rec(idxT-1,idxS+1,T,S);\n }\n return res;\n}\n \nint main(){\n int Tc;\n map<string,int> mp = {\n {\"A\",0},{\"A#\",1},\n {\"B\",2},\n {\"C\",3},{\"C#\",4},\n {\"D\",5},{\"D#\",6},\n {\"E\",7},\n {\"F\",8},{\"F#\",9},\n {\"G\",10},{\"G#\",11},\n };\n string in;\n cin >> Tc;\n while(Tc--){\n cin >> N >> M;\n Vec T(N);\n for(int i = 0 ; i < N ; i++){\n cin >> in;\n T[i] = mp[in];\n }\n reverse(T.begin(),T.end());\n Vec S(M);\n for(int i = 0 ; i < M ; i++){\n cin >> in;\n S[i] = mp[in];\n }\n reverse(S.begin(),S.end());\n bool can = rec(0,0,T,S) | rec(1,0,T,S);\n cout << (can ? \"Yes\" : \"No\") << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":7084,"score_of_the_acc":-0.5297,"final_rank":9},{"submission_id":"aoj_2190_1804111","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstring c[12]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\nint main() {\n int T,n,m,f,x;\n cin>>T;\n while(T--){\n cin>>n>>m;\n string s[n],t[m];\n for(int i=0;i<n;i++)cin>>s[i];\n for(int i=0;i<m;i++)cin>>t[i];\n f=0;\n for(int k=1;k<3;k++){\n x=n-k;\n for(int i=m-1,p;i>=0;i--){\n if(x<0||x>=n)goto e;\n p=0;\n while(c[p]!=s[x])p++;\n if(t[i]==c[p])x--;\n else if(t[i]==c[(p+1)%12])x-=2;\n else if(t[i]==c[(p+11)%12])x++;\n else goto e;\n }\n if(x==-1)f=1;\n e:;\n }\n cout<<(f?\"Yes\":\"No\")<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":6676,"score_of_the_acc":-0.4965,"final_rank":7},{"submission_id":"aoj_2190_1803685","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nint main() {\n string c[12]={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\n int T;\n cin >> T;\n while(T--) {\n int n,m;\n cin >> n >> m;\n string s[n],t[m];\n for(int i=0; i<n; i++) cin >> s[i];\n for(int i=0; i<m; i++) cin >> t[i];\n bool ck=0;\n for(int k=1; k<3; k++) {\n int x=n-k;\n for(int i=m-1; i>=0; i--) {\n if(x<0||x>=n) {x=1<<29;break;}\n int p;\n for(p=0; p<12; p++) if(c[p]==s[x]) break;\n if(t[i]==c[p]) x--;\n else if(t[i]==c[(p+1)%12]) x-=2;\n else if(t[i]==c[(p+11)%12]) x++;\n else {x=1<<29;break;}\n }\n if(x==-1) ck=1;\n }\n if(ck) cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":6680,"score_of_the_acc":-0.4969,"final_rank":8},{"submission_id":"aoj_2190_1758559","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n\nint N,M;\nint T[50010];\nint S[50010];\nint lis[]={9,11,0,2,4,5,7};\n\nchar t[3];\ninline int in(){\n scanf(\"%s\",t);\n return lis[t[0]-'A']+(t[1]=='#');\n}\ninline int add(int a,int b){\n a+=b;\n if(a>=12)a-=12;\n return a;\n}\n\nvoid solve(){\n scanf(\"%lld%lld\",&N,&M);\n rep(i,N)T[i]=in();\n rep(i,M)S[i]=in();\n for(int fin=N-2;fin<N;fin++){\n bool ok=true;\n int pos=fin;\n for(int i=M-1;i>=0;i--){\n if(pos<0||pos==N){\n ok=false;\n break;\n }\n if(T[pos]==S[i])pos--;\n else if(add(T[pos],1)==S[i])pos-=2;\n else if(add(T[pos],11)==S[i])pos++;\n else{\n ok=false;\n break;\n }\n }\n if(ok&&pos==-1){\n puts(\"Yes\");\n return;\n }\n }\n puts(\"No\");\n}\n\nsigned main(){\n int T;scanf(\"%lld\",&T);\n while(T--)solve();\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1952,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2190_1758553","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef pair<int,int>pint;\ntypedef vector<int>vint;\ntypedef vector<pint>vpint;\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define all(v) (v).begin(),(v).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\n\nint N,M;\nint T[50010];\nint S[50010];\nint lis[]={9,11,0,2,4,5,7};\n\nchar t[3];\ninline int in(){\n scanf(\"%s\",t);\n return lis[t[0]-'A']+(t[1]=='#');\n}\n\nvoid solve(){\n scanf(\"%lld%lld\",&N,&M);\n rep(i,N)T[i]=in();\n rep(i,M)S[i]=in();\n for(int fin=N-2;fin<N;fin++){\n bool ok=true;\n int pos=fin;\n for(int i=M-1;i>=0;i--){\n if(pos<0||pos==N){\n ok=false;\n break;\n }\n if(T[pos]==S[i])pos--;\n else if((T[pos]+1)%12==S[i])pos-=2;\n else if((T[pos]+11)%12==S[i])pos++;\n else{\n ok=false;\n break;\n }\n }\n if(ok&&pos==-1){\n puts(\"Yes\");\n return;\n }\n }\n puts(\"No\");\n}\n\nsigned main(){\n int T;scanf(\"%lld\",&T);\n while(T--)solve();\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1952,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2190_9073606\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef int64_t ll;\\n\\nvector<string> oc={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\nvector<int> ti(50000+1),si(50000+1);\\n\\nint tc=0,sc=0;\\n\\nbool nxt(int ps,int cnt){\\n //cout << ps << \\\" \\\" << cnt << endl;\\n if(cnt==0){\\n if(ps==0) return true;\\n else return false;\\n }\\n bool res=false;\\n if(((ps-1)>=0)&&(si[cnt]==ti[ps])){\\n res=(res||nxt(ps-1,cnt-1));\\n }\\n if(((ps-2)>=0)&&(si[cnt]==(ti[ps]+1)%12)){\\n res=(res||nxt(ps-2,cnt-1));\\n }\\n if(((ps+1)<=tc)&&(si[cnt]==(ti[ps]-1+12)%12)){\\n res=(res||nxt(ps+1,cnt-1));\\n }\\n return res;\\n}\\n\\n\\nint main(){\\n\\n int n;\\n cin >> n;\\n \\n for(int k=0;k<n;k++){\\n cin >> tc >> sc;\\n vector<string> t(tc),s(sc);\\n for(auto &a:t) cin >> a;\\n for(auto &a:s) cin >> a;\\n \\n for(int i=0;i<tc;i++){\\n ti[i+1]=distance(oc.begin(),find(oc.begin(),oc.end(),t[i]));\\n }\\n for(int i=0;i<sc;i++){\\n si[i+1]=distance(oc.begin(),find(oc.begin(),oc.end(),s[i]));\\n }\\n \\n if(nxt(tc,sc)||nxt(tc-1,sc)) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 8404,\n \"score_of_the_acc\": -0.6581,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2190_6049701\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n map<string,int> mp;\\n mp[\\\"C\\\"] = 0;\\n mp[\\\"C#\\\"] = 1;\\n mp[\\\"D\\\"] = 2;\\n mp[\\\"D#\\\"] = 3;\\n mp[\\\"E\\\"] = 4;\\n mp[\\\"F\\\"] = 5;\\n mp[\\\"F#\\\"] = 6;\\n mp[\\\"G\\\"] = 7;\\n mp[\\\"G#\\\"] = 8;\\n mp[\\\"A\\\"] = 9;\\n mp[\\\"A#\\\"] = 10;\\n mp[\\\"B\\\"] = 11;\\n int q; cin >> q;\\n while(q--){\\n int n; cin >> n;\\n int m; cin >> m;\\n vector<int> a(n+2,1e9);\\n for(int i=1;i<=n;i++){\\n string s; cin >> s;\\n a[i] = mp[s];\\n }\\n vector<int> b(m);\\n for(int i=0;i<m;i++){\\n string s; cin >> s;\\n b[i] = mp[s];\\n }\\n auto solve=[&](auto self, int idx, int cur)->bool{\\n if(idx == -1){\\n return (cur == 0);\\n }\\n if(cur <= 0 or cur > n) return false;\\n if(a[cur] == b[idx]){\\n if(self(self, idx-1, cur-1)) return true;\\n }\\n if((a[cur] + 1)%12 == b[idx]){\\n if(self(self, idx-1, cur-2)) return true;\\n }\\n if((a[cur] + 11)%12 == b[idx]){\\n if(self(self, idx-1, cur+1)) return true;\\n }\\n return false;\\n };\\n if(solve(solve, m-1, n) or solve(solve, m-1, n-1)){\\n cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"No\\\" << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7724,\n \"score_of_the_acc\": -0.5852,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2190_6049234\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n map<string,int> mp;\\n mp[\\\"C\\\"] = 0;\\n mp[\\\"C#\\\"] = 1;\\n mp[\\\"D\\\"] = 2;\\n mp[\\\"D#\\\"] = 3;\\n mp[\\\"E\\\"] = 4;\\n mp[\\\"F\\\"] = 5;\\n mp[\\\"F#\\\"] = 6;\\n mp[\\\"G\\\"] = 7;\\n mp[\\\"G#\\\"] = 8;\\n mp[\\\"A\\\"] = 9;\\n mp[\\\"A#\\\"] = 10;\\n mp[\\\"B\\\"] = 11;\\n int q; cin >> q;\\n while(q--){\\n int n; cin >> n;\\n int m; cin >> m;\\n vector<int> a(n+2,1e9);\\n for(int i=1;i<=n;i++){\\n string s; cin >> s;\\n a[i] = mp[s];\\n }\\n vector<int> b(m);\\n for(int i=0;i<m;i++){\\n string s; cin >> s;\\n b[i] = mp[s];\\n }\\n auto solve=[&](auto self, int idx, int cur)->bool{\\n if(idx == -1){\\n return (cur == 0);\\n }\\n if(cur <= 0 or cur > n) return false;\\n if(a[cur] == b[idx]){\\n if(self(self, idx-1, cur-1)) return true;\\n }\\n if((a[cur] + 1)%12 == b[idx]){\\n if(self(self, idx-1, cur-2)) return true;\\n }\\n if((a[cur] + 11)%12 == b[idx]){\\n if(self(self, idx-1, cur+1)) return true;\\n }\\n return false;\\n };\\n if(solve(solve, m-1, n) or solve(solve, m-1, n-1)){\\n cout << \\\"Yes\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"No\\\" << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7700,\n \"score_of_the_acc\": -0.5827,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2190_5014250\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 6 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1e9;\\nconstexpr long long inf_ll = 1e18, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tint gc() const {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\ttemplate <class T> void read(T& v) const {\\n\\t\\tcin >> v;\\n\\t}\\n\\tvoid read(char& v) const {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tvoid read(bool& v) const {\\n\\t\\tv = read<char>() != '0';\\n\\t}\\n\\tvoid read(string& v) const {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = read<char>(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tvoid read(int& v) const {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tvoid read(long long& v) const {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tvoid read(double& v) const {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tvoid read(long double& v) const {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = read<char>();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> void read(pair<T, U>& v) const {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> void read(vector<T>& v) const {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> void read_tuple_impl(T& v) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> void read(tuple<T...>& v) const {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = read<char>(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 6 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> int sz(const T& v) {\\n\\treturn v.size();\\n}\\ntemplate <class T, class U> int lower_index(const T& a, const U& v) {\\n\\treturn lower_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T, class U> int upper_index(const T& a, const U& v) {\\n\\treturn upper_bound(all(a), v) - a.begin();\\n}\\ntemplate <class T> auto Slice(const T& v, size_t i, size_t len) {\\n\\treturn i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();\\n}\\ntemplate <class T> T div_ceil(T n, T m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T> T div_ceil2(T n, T m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T> T middle(const T& l, const T& r) {\\n\\treturn l + (r - l) / 2;\\n}\\ntemplate <class T> bool chmax(T& a, const T& b) {\\n\\tif (a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool chmin(T& a, const T& b) {\\n\\tif (a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T> bool in_range(const T& v, const T& min, const T& max) {\\n\\treturn min <= v && v < max;\\n}\\ntemplate <class T> bool in_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> T BIT(int b) {\\n\\treturn T(1) << b;\\n}\\ntemplate <class T, class U = typename T::value_type> U Gcdv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);\\n}\\ntemplate <class T, class U = typename T::value_type> U Lcmv(const T& v) {\\n\\treturn accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);\\n}\\ntemplate <class T, class U> T Pow(T a, U n) {\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult *= a;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta *= a;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> T Powmod(T a, U n, T mod) {\\n\\tT result = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tresult = result * a % mod;\\n\\t\\t\\tn--;\\n\\t\\t} else {\\n\\t\\t\\ta = a * a % mod;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 2 \\\"b.cpp\\\"\\n\\nconst int N = 12;\\nconst VS sound{\\n \\\"C\\\", \\\"C#\\\", \\\"D\\\", \\\"D#\\\", \\\"E\\\", \\\"F\\\", \\\"F#\\\", \\\"G\\\", \\\"G#\\\", \\\"A\\\", \\\"A#\\\", \\\"B\\\",\\n};\\n\\nbool solve() {\\n\\tini(n, m);\\n\\tauto a = in.read_vector<string>(n) |\\n\\t Map([&](const string& s) { return *(sound | Index(s)); });\\n\\tauto b = in.read_vector<string>(m) |\\n\\t Map([&](const string& s) { return *(sound | Index(s)); });\\n\\tdump(a, b);\\n\\n\\tauto next_sound = [&](int i) {\\n\\t\\treturn (i + 1) % N;\\n\\t};\\n\\tauto prev_sound = [&](int i) {\\n\\t\\treturn (i + 11) % N;\\n\\t};\\n\\n\\tauto dfs = [&](auto&& f, int i, int j) -> bool {\\n\\t\\tdump(tuple(i, j));\\n\\t\\tif (j == -1) {\\n\\t\\t\\treturn i == -1;\\n\\t\\t} else if (!in_range(i, 0, n)) {\\n\\t\\t\\treturn false;\\n\\t\\t} else {\\n\\t\\t\\tif (a[i] == b[j]) {\\n\\t\\t\\t\\treturn f(f, i - 1, j - 1);\\n\\t\\t\\t} else if (next_sound(a[i]) == b[j]) {\\n\\t\\t\\t\\treturn f(f, i - 2, j - 1);\\n\\t\\t\\t} else if (prev_sound(a[i]) == b[j]) {\\n\\t\\t\\t\\treturn f(f, i + 1, j - 1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\treturn dfs(dfs, n - 1, m - 1) || dfs(dfs, n - 2, m - 1);\\n}\\n\\nint main() {\\n\\tfor (int t = in; t--;) {\\n\\t\\tout(solve());\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6316,\n \"score_of_the_acc\": -0.4478,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2190_4292564\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//typedef\\n//-------------------------#include <bits/stdc++.h>\\n \\nconst double pi = 3.141592653589793238462643383279;\\n \\n \\nusing namespace std;\\n \\n//conversion\\n//------------------------------------------\\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }\\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }\\ninline int readInt() { int x; scanf(\\\"%d\\\", &x); return x; }\\n \\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 \\n//container util\\n \\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 \\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 998244353\\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;\\nconst double EPS = 1E-8;\\n \\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\n \\nclass UnionFind {\\npublic:\\n vector <int> par; \\n vector <int> siz; \\n\\n UnionFind(int sz_): par(sz_), siz(sz_, 1) {\\n for (ll i = 0; i < sz_; ++i) par[i] = i;\\n }\\n void init(int sz_) {\\n par.resize(sz_);\\n siz.assign(sz_, 1LL);\\n for (ll i = 0; i < sz_; ++i) par[i] = i;\\n }\\n \\n int root(int x) { \\n while (par[x] != x) {\\n x = par[x] = par[par[x]];\\n }\\n return x;\\n }\\n \\n bool merge(int x, int y) {\\n x = root(x);\\n y = root(y);\\n if (x == y) return false;\\n if (siz[x] < siz[y]) swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n \\n bool issame(int x, int y) { \\n return root(x) == root(y);\\n }\\n \\n int size(int x) { \\n return siz[root(x)];\\n }\\n};\\n \\n \\nll modPow(ll x, ll n, ll mod = MOD){\\n ll res = 1;\\n while(n){\\n if(n&1) res = (res * x)%mod;\\n \\n res %= mod;\\n x = x * x %mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n \\n#define SIEVE_SIZE 5000000+10\\nbool sieve[SIEVE_SIZE];\\nvoid makeSieve(){\\n for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;\\n sieve[0] = sieve[1] = false;\\n for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;\\n}\\n \\nbool isprime(ll n){\\n if(n == 0 || n == 1) return false;\\n for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;\\n return true;\\n}\\n \\nconst int MAX = 2000010;\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n \\n// テーブルを作る前処理\\nvoid COMinit() {\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for (int i = 2; i < MAX; i++){\\n fac[i] = fac[i - 1] * i % MOD;\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n finv[i] = finv[i - 1] * inv[i] % MOD;\\n }\\n}\\n \\n// 二項係数計算\\nlong long COM(int n, int k){\\n if (n < k) return 0;\\n if (n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\\n}\\n \\nlong long extGCD(long long a, long long b, long long &x, long long &y) {\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n long long d = extGCD(b, a%b, y, x);\\n y -= a/b * x;\\n return d;\\n}\\n// 負の数にも対応した mod (a = -11 とかでも OK) \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\n \\n// 逆元計算 (ここでは a と m が互いに素であることが必要)\\nlong long modinv(long long a, long long m) {\\n long long x, y;\\n extGCD(a, m, x, y);\\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\\n}\\nll GCD(ll a, ll b){\\n \\n if(b == 0) return a;\\n return GCD(b, a%b);\\n}\\n\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nmat mul(mat &A, mat &B) {\\n mat C(A.size(), vec((int)B[0].size()));\\n for(int i=0; i<A.size(); ++i){\\n for(int k=0; k<B.size(); ++k){\\n for(int j=0; j<B[0].size(); ++j){\\n C[i][j] = (C[i][j] + A[i][k] * B[k][j] %MOD) % MOD;\\n }\\n }\\n }\\n return C;\\n}\\nmat matPow(mat A, ll n) {\\n mat B(A.size(), vec((int)A.size()));\\n \\n for(int i=0; i<A.size(); ++i){\\n B[i][i] = 1;\\n }\\n \\n while(n > 0) {\\n if(n & 1) B = mul(B, A);\\n A = mul(A, A);\\n n >>= 1;\\n }\\n return B;\\n}\\n\\nstring ar[12] = {\\\"C\\\", \\\"C#\\\", \\\"D\\\", \\\"D#\\\", \\\"E\\\", \\\"F\\\", \\\"F#\\\", \\\"G\\\", \\\"G#\\\", \\\"A\\\", \\\"A#\\\", \\\"B\\\"};\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n\\n int t; cin >> t;\\n map<string, int> mp;\\n // C, C#, D, D#, E, F, F#, G, G#, A, A#, B -> C... \\n\\n for(int i=0; i<12; i++){\\n mp[ar[i]] = i;\\n }\\n while(t--){\\n int n, m; cin >> n >> m;\\n vector<string> T(n+1), S(m+1);\\n for(int i=1; i<=n; i++) cin >> T[i];\\n for(int i=1; i<=m; i++) cin >> S[i];\\n\\n //Sは踏むべき音, Tは今いるposの音\\n bool ok = false;\\n //一番最後に踏む段(n)\\n int pos = n;\\n \\n bool check1 = true;\\n for(int i=m; i>=1; i--){\\n if(mp[S[i]] == mp[T[pos]]){\\n pos--;\\n }else if(mp[S[i]] == (mp[T[pos]]+1)%12){\\n //半音高い場合 -> 2段上に\\n if(pos-2>=0){\\n pos = pos-2;\\n\\n }else{\\n check1 = false;\\n }\\n }else if(mp[S[i]] == (mp[T[pos]]-1 + 12) % 12){\\n //半音低い場合 -> 1段下に\\n if(pos+1<=n){\\n pos = pos + 1;\\n\\n }else{\\n check1 = false;\\n }\\n }else{\\n check1 = false;\\n }\\n }\\n if(check1 && pos == 0){\\n ok = true;\\n }\\n\\n bool check2 = true;\\n pos = n-1;\\n for(int i=m; i>=1; i--){\\n if(mp[S[i]] == mp[T[pos]]){\\n pos--;\\n }else if(mp[S[i]] == (mp[T[pos]]+1)%12){\\n //半音高い場合 -> 2段上に\\n if(pos-2>=0){\\n pos = pos-2;\\n\\n }else{\\n check2 = false;\\n }\\n }else if(mp[S[i]] == (mp[T[pos]]-1 + 12) % 12){\\n //半音低い場合 -> 1段下に\\n if(pos+1<=n){\\n pos = pos + 1;\\n\\n }else{\\n check2 = false;\\n }\\n }else{\\n check2 = false;\\n }\\n }\\n if(pos == 0 && check2){\\n ok = true;\\n }\\n\\n if(ok){\\n cout << \\\"Yes\\\" << endl;\\n }else{\\n cout << \\\"No\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 8308,\n \"score_of_the_acc\": -0.6592,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2190_3423997\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n\\nconst map<string, int> NOTE_NUMS = {\\n {\\\"C\\\", 0},\\n {\\\"C#\\\", 1},\\n {\\\"D\\\", 2},\\n {\\\"D#\\\", 3},\\n {\\\"E\\\", 4},\\n {\\\"F\\\", 5},\\n {\\\"F#\\\", 6},\\n {\\\"G\\\", 7},\\n {\\\"G#\\\", 8},\\n {\\\"A\\\", 9},\\n {\\\"A#\\\", 10},\\n {\\\"B\\\", 11},\\n};\\n\\nvector<int> steps;\\nvector<int> song;\\nbool result;\\n\\nvector<string> split(const string &s, char delim) {\\n vector<string> elems;\\n stringstream ss(s);\\n string item;\\n while (getline(ss, item, delim)) {\\n if (!item.empty()) {\\n elems.push_back(item);\\n }\\n }\\n return elems;\\n}\\n\\nvoid canPlay(long stepPos, long songPos){\\n if(result){\\n return;\\n }\\n\\n if(songPos == song.size()){\\n if(steps.size() - stepPos < 3){\\n result = true;\\n }\\n return;\\n }\\n\\n if( 0 <= stepPos + 1 && stepPos + 1 < steps.size()){\\n if(steps[stepPos + 1] == song[songPos]){\\n canPlay(stepPos + 1, songPos + 1);\\n }\\n }\\n\\n if( 0 <= stepPos + 2 && stepPos + 2 < steps.size()){\\n if((steps[stepPos + 2] + 1) % 12 == song[songPos]){\\n canPlay(stepPos + 2, songPos + 1);\\n }\\n }\\n\\n if( 0 <= stepPos - 1 && stepPos - 1 < steps.size()){\\n if((steps[stepPos - 1] + 11) % 12 == song[songPos]){\\n canPlay(stepPos - 1, songPos + 1);\\n }\\n }\\n}\\n\\nint main(){\\n string n;\\n getline(cin, n);\\n int q = stoi(n);\\n for(int i = 0; i < q; ++i){\\n string x, stepsLine, songLine;\\n getline(cin, x);\\n getline(cin, stepsLine);\\n getline(cin, songLine);\\n auto stepsStr = split(stepsLine, ' ');\\n auto songStr = split(songLine, ' ');\\n\\n steps.clear();\\n for(auto it = stepsStr.begin(); it != stepsStr.end(); ++it){\\n steps.push_back(NOTE_NUMS.at(*it));\\n }\\n\\n song.clear();\\n for(auto it = songStr.begin(); it != songStr.end(); ++it){\\n song.push_back(NOTE_NUMS.at(*it));\\n }\\n\\n result = false;\\n canPlay(-1, 0);\\n cout << (result ? \\\"Yes\\\": \\\"No\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7390,\n \"memory_kb\": 11732,\n \"score_of_the_acc\": -1.9861,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2190_3423993\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n\\nconst map<string, int> noteNums = {\\n {\\\"C\\\", 0},\\n {\\\"C#\\\", 1},\\n {\\\"D\\\", 2},\\n {\\\"D#\\\", 3},\\n {\\\"E\\\", 4},\\n {\\\"F\\\", 5},\\n {\\\"F#\\\", 6},\\n {\\\"G\\\", 7},\\n {\\\"G#\\\", 8},\\n {\\\"A\\\", 9},\\n {\\\"A#\\\", 10},\\n {\\\"B\\\", 11},\\n};\\n\\nvector<int> steps;\\nvector<int> song;\\nbool result;\\n\\nvector<string> split(const string &s, char delim) {\\n vector<string> elems;\\n stringstream ss(s);\\n string item;\\n while (getline(ss, item, delim)) {\\n if (!item.empty()) {\\n elems.push_back(item);\\n }\\n }\\n return elems;\\n}\\n\\nvoid canPlay(long stepPos, long songPos){\\n if(result){\\n return;\\n }\\n if(songPos == song.size()){\\n if(steps.size() - stepPos < 3){\\n result = true;\\n }\\n return;\\n }\\n\\n if( 0 <= stepPos + 1 && stepPos + 1 < steps.size()){\\n if(steps[stepPos + 1] == song[songPos]){\\n canPlay(stepPos + 1, songPos + 1);\\n }\\n }\\n\\n if( 0 <= stepPos + 2 && stepPos + 2 < steps.size()){\\n if((steps[stepPos + 2] + 1) % 12 == song[songPos]){\\n canPlay(stepPos + 2, songPos + 1);\\n }\\n }\\n\\n if( 0 <= stepPos - 1 && stepPos - 1 < steps.size()){\\n if((steps[stepPos - 1] + 11) % 12 == song[songPos]){\\n canPlay(stepPos - 1, songPos + 1);\\n }\\n }\\n}\\n\\nint main(){\\n string n;\\n getline(cin, n);\\n int q = stoi(n);\\n for(int i = 0; i < q; ++i){\\n string x, stepsLine, songLine;\\n getline(cin, x);\\n getline(cin, stepsLine);\\n getline(cin, songLine);\\n auto stepsStr = split(stepsLine, ' ');\\n auto songStr = split(songLine, ' ');\\n\\n steps.clear();\\n for(auto it = stepsStr.begin(); it != stepsStr.end(); ++it){\\n steps.push_back(noteNums.at(*it));\\n }\\n\\n song.clear();\\n for(auto it = songStr.begin(); it != songStr.end(); ++it){\\n song.push_back(noteNums.at(*it));\\n }\\n\\n result = false;\\n canPlay(-1, 0);\\n cout << (result ? \\\"Yes\\\": \\\"No\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7430,\n \"memory_kb\": 11816,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2190_2691096\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n Int T;\\n cin>>T;\\n map<string,Int> ms;\\n vector<string> vs({\\\"C\\\", \\\"C#\\\", \\\"D\\\", \\\"D#\\\", \\\"E\\\", \\\"F\\\", \\\"F#\\\", \\\"G\\\", \\\"G#\\\", \\\"A\\\", \\\"A#\\\", \\\"B\\\" });\\n for(Int i=0;i<12;i++) ms[vs[i]]=i;\\n while(T--){\\n Int n,m;\\n cin>>n>>m;\\n vector<Int> t(n+1,0),s(m);\\n for(Int i=0;i<n;i++){\\n string x;\\n cin>>x;\\n t[i+1]=ms[x];\\n }\\n for(Int i=0;i<m;i++){\\n string x;\\n cin>>x;\\n s[i]=ms[x];\\n }\\n\\n vector<Int> dp(1,n+1);\\n for(Int i=m;i>=0;i--){\\n vector<Int> nx;\\n for(Int x: dp){\\n\\tif(x-1>=0&&(i==m||t[x]==s[i])) nx.emplace_back(x-1);\\n\\tif(x-2>=0&&(i==m||t[x]==(s[i]+11)%12)) nx.emplace_back(x-2);\\n\\tif(x+1<=n&&(i==m||t[x]==(s[i]+1)%12)) nx.emplace_back(x+1);\\n }\\n sort(nx.begin(),nx.end());\\n nx.erase(unique(nx.begin(),nx.end()),nx.end());\\n swap(dp,nx);\\n if(dp.empty()) break;\\n }\\n \\n cout<<(!dp.empty()&&dp.front()==0?\\\"Yes\\\":\\\"No\\\")<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.1783,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2190_2690833\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define Rep(i, n) for ( int i = 0; i < (n); i++ ) \\ntypedef pair<int, int> Pii;\\n\\n#define fr first\\n#define sc second\\n\\nclock_t start;\\ndouble calcTime2(){\\n clock_t end = clock(); // 終了時間\\n return (double)(end - start) / CLOCKS_PER_SEC;\\n}\\n\\n\\nint main() {\\n srand((unsigned)time(NULL));\\n \\n map<string, string> ne;\\n ne[\\\"C\\\"] = \\\"C#\\\";\\n ne[\\\"C#\\\"] = \\\"D\\\";\\n ne[\\\"D\\\"] = \\\"D#\\\";\\n ne[\\\"D#\\\"] = \\\"E\\\";\\n ne[\\\"E\\\"] = \\\"F\\\";\\n ne[\\\"F\\\"] = \\\"F#\\\";\\n ne[\\\"F#\\\"] = \\\"G\\\";\\n ne[\\\"G\\\"] = \\\"G#\\\";\\n ne[\\\"G#\\\"] = \\\"A\\\";\\n ne[\\\"A\\\"] = \\\"A#\\\";\\n ne[\\\"A#\\\"] = \\\"B\\\";\\n ne[\\\"B\\\"] = \\\"C\\\";\\n map<string, string> pr;\\n pr[\\\"C\\\"] = \\\"B\\\";\\n pr[\\\"B\\\"] = \\\"A#\\\";\\n pr[\\\"A#\\\"] = \\\"A\\\";\\n pr[\\\"A\\\"] = \\\"G#\\\";\\n pr[\\\"G#\\\"] = \\\"G\\\";\\n pr[\\\"G\\\"] = \\\"F#\\\";\\n pr[\\\"F#\\\"] = \\\"F\\\";\\n pr[\\\"F\\\"] = \\\"E\\\";\\n pr[\\\"E\\\"] = \\\"D#\\\";\\n pr[\\\"D#\\\"] = \\\"D\\\";\\n pr[\\\"D\\\"] = \\\"C#\\\";\\n pr[\\\"C#\\\"] = \\\"C\\\";\\n //string onp[12] = {\\\"C\\\", \\\"C#\\\", \\\"D\\\", \\\"D#\\\", \\\"E\\\", \\\"F\\\", \\\"F#\\\", \\\"G\\\", \\\"G#\\\", \\\"A\\\", \\\"A#\\\", \\\"B\\\" };\\n string T[50001], S[50001]; \\n int k;\\n cin >> k;\\n while ( k-- ) {\\n \\n int n, m;\\n start = clock();// スタート時間\\n\\n cin >> n >> m;\\n //cout<<n<<\\\" \\\"<<m<<endl;\\n //cout<<calcTime2()<<endl;\\n Rep(i, n) cin >> T[i];\\n Rep(i, m) cin >> S[i];\\n //if(n == 50000 && m==50000)continue; \\n vector<int>used(n+10);\\n queue<Pii> q;\\n bool flag = false;\\n q.push(Pii(0, -1));\\n while ( !q.empty() && calcTime2()<3) {\\n Pii p = q.front(); q.pop();\\n int s = p.fr, t = p.sc;\\n \\n //cout << s-1 << \\\" \\\" << t << endl;\\n\\n if ( s == m ) {\\n\\tif ( t == n-1 || t == n-2 ) {\\n\\t flag = true;\\n\\t break;\\n\\t} else {\\n\\t continue;\\n\\t}\\n }\\n if(t >= n) continue;\\n // if((n-t) > (m-s)*2+1) continue;\\n \\n \\n if ( t > 0 && pr[T[t-1]] == S[s] ) {\\n\\tif (used[t-1] != s+1 ) {\\n\\t q.push(Pii(s+1, t-1));\\n\\t used[t-1] = s+1;\\n\\t}\\n }\\n \\n if ( t <= n-2 && T[t+1] == S[s] ) {\\n\\tif (used[t+1] != s+1 ) {\\n\\t q.push(Pii(s+1, t+1));\\n\\t used[t+1] = s+1;\\n\\t}\\n }\\n \\n if ( t <= n-3 && ne[T[t+2]] == S[s] ) {\\n\\tif (used[t+2] != s+1 ) {\\n\\t q.push(Pii(s+1, t+2));\\n\\t used[t+2] = s+1;\\n\\t}\\n }\\n \\n }\\n \\n if(calcTime2()>=2.8) flag = rand()%2;\\n if ( flag ) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3120,\n \"memory_kb\": 8708,\n \"score_of_the_acc\": -1.1025,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2190_2690690\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n int T;\\n cin>>T;\\n map<string,int> ms;\\n vector<string> vs({\\\"C\\\", \\\"C#\\\", \\\"D\\\", \\\"D#\\\", \\\"E\\\", \\\"F\\\", \\\"F#\\\", \\\"G\\\", \\\"G#\\\", \\\"A\\\", \\\"A#\\\", \\\"B\\\" });\\n for(int i=0;i<12;i++) ms[vs[i]]=i;\\n while(T--){\\n int n,m;\\n cin>>n>>m;\\n vector<int> t(n+1,0),s(m);\\n for(int i=0;i<n;i++){\\n string x;\\n cin>>x;\\n t[i+1]=ms[x];\\n }\\n for(int i=0;i<m;i++){\\n string x;\\n cin>>x;\\n s[i]=ms[x];\\n }\\n if(0){\\n for(int i:s) cout<<i<<\\\" \\\";cout<<endl;\\n for(int i:t) cout<<i<<\\\" \\\";cout<<endl;\\n }\\n \\n auto check=[&](int x,int i){\\n return x+(m-i)*2>=n+1;\\n };\\n\\n if(n<=100){\\n bool flg=0;\\n vector<int> dp(1,0);\\n for(int i=0;i<=m;i++){\\n\\tvector<int> nx;\\n\\tfor(int x: dp){\\n\\t if(i==m){\\n\\t if(x+2>=n+1){\\n\\t flg=1;\\n\\t break;\\n\\t }\\n\\t }else{\\n\\t if(x+1<=n&&(t[x+1]==s[i]))\\n\\t if(check(x+1,i)) nx.emplace_back(x+1);\\n\\t if(x+2<=n&&(t[x+2]==(s[i]+11)%12))\\n\\t if(check(x+2,i))nx.emplace_back(x+2);\\n\\t if(x-1>=0&&(t[x-1]==(s[i]+1)%12))\\n\\t if(check(x-1,i)) nx.emplace_back(x-1);\\n\\t }\\n\\t}\\n\\tsort(nx.begin(),nx.end());\\n\\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\\n\\tif(0){\\n\\t cout<<i<<\\\":\\\"<<endl;\\n\\t for(int x:nx) cout<<x<<\\\" \\\";cout<<endl;\\n\\t}\\n\\tswap(dp,nx);\\n\\tif(dp.empty()) break;\\n }\\n cout<<(flg?\\\"Yes\\\":\\\"No\\\")<<endl;\\n continue;\\n }\\n \\n bool flg=0;\\n int h=n/2;\\n vector<int> ff,tt;\\n {\\n vector<int> dp(1,0);\\n for(int i=0;i<h;i++){\\n\\tvector<int> nx;\\n\\tfor(int x: dp){\\n\\t if(x+1<=n&&(t[x+1]==s[i]))\\n\\t if(check(x+1,i)) nx.emplace_back(x+1);\\n\\t if(x+2<=n&&(t[x+2]==(s[i]+11)%12))\\n\\t if(check(x+2,i))nx.emplace_back(x+2);\\n\\t if(x-1>=0&&(t[x-1]==(s[i]+1)%12))\\n\\t if(check(x-1,i)) nx.emplace_back(x-1);\\n\\t}\\n\\tsort(nx.begin(),nx.end());\\n\\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\\n\\tswap(dp,nx);\\n\\tif(dp.empty()) break;\\n }\\n ff=dp;\\n }\\n {\\n vector<int> dp(1,n+1);\\n for(int i=m;i>=h;i--){\\n\\tvector<int> nx;\\n\\tfor(int x: dp){\\n\\t if(x-1>=0&&(i==m||t[x]==s[i])) nx.emplace_back(x-1);\\n\\t if(x-2>=0&&(i==m||t[x]==(s[i]+11)%12)) nx.emplace_back(x-2);\\n\\t if(x+1<=n&&(i==m||t[x]==(s[i]+1)%12)) nx.emplace_back(x+1);\\n\\t}\\n\\tsort(nx.begin(),nx.end());\\n\\tnx.erase(unique(nx.begin(),nx.end()),nx.end());\\n\\tswap(dp,nx);\\n\\tif(dp.empty()) break;\\n }\\n tt=dp;\\n }\\n \\n set<int> cnt;\\n for(int i:ff) cnt.emplace(i);\\n for(int i:tt) flg|=cnt.count(i);\\n cout<<(flg?\\\"Yes\\\":\\\"No\\\")<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4350,\n \"memory_kb\": 4480,\n \"score_of_the_acc\": -0.8401,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2190_2648511\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\nint stair[50000],melody[50000];\\n\\n\\nbool strCmp(char* base, char* comp){\\n\\tint length1,length2;\\n\\tfor(length1=0;base[length1] != '\\\\0';length1++);\\n\\tfor(length2=0;comp[length2] != '\\\\0';length2++);\\n\\tif(length1 != length2)return false;\\n\\n\\tfor(int i=0;base[i] != '\\\\0'; i++){\\n\\t\\tif(base[i] != comp[i])return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nint getNUM(char buf[3]){\\n\\tswitch(buf[0]){\\n\\tcase 'C':\\n\\t\\tif(buf[1] == '\\\\0'){\\n\\t\\t\\treturn 0;\\n\\t\\t}else{\\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase 'D':\\n\\t\\tif(buf[1] == '\\\\0'){\\n\\t\\t\\treturn 2;\\n\\t\\t}else{\\n\\t\\t\\treturn 3;\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase 'E':\\n\\t\\treturn 4;\\n\\t\\tbreak;\\n\\tcase 'F':\\n\\t\\tif(buf[1] == '\\\\0'){\\n\\t\\t\\treturn 5;\\n\\t\\t}else{\\n\\t\\t\\treturn 6;\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase 'G':\\n\\t\\tif(buf[1] == '\\\\0'){\\n\\t\\t\\treturn 7;\\n\\t\\t}else{\\n\\t\\t\\treturn 8;\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase 'A':\\n\\t\\tif(buf[1] == '\\\\0'){\\n\\t\\t\\treturn 9;\\n\\t\\t}else{\\n\\t\\t\\treturn 10;\\n\\t\\t}\\n\\t\\tbreak;\\n\\tcase 'B':\\n\\t\\treturn 11;\\n\\t\\tbreak;\\n\\t}\\n}\\n\\nbool is_UP(int to,int from){\\n\\n\\tif((to == from+1) || (to == 0 && from == 11))return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nbool is_DOWN(int to,int from){\\n\\tif((to == from-1 || (to == 11 && from == 0)))return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tint N,M;\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tchar buf[3];\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s\\\",buf);\\n\\t\\tstair[i] = getNUM(buf);\\n\\t}\\n\\treverse(stair,stair+N);\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%s\\\",buf);\\n\\t\\tmelody[i] = getNUM(buf);\\n\\t}\\n\\treverse(melody,melody+M);\\n\\n\\tbool FLG = false;\\n\\tint loc,index;\\n\\n\\tif((stair[0] == melody[0]) || (N >= 2 && is_UP(melody[0],stair[0]) == true)){\\n\\t\\tif(stair[0] == melody[0]){\\n\\t\\t\\tloc = 1;\\n\\t\\t}else{\\n\\t\\t\\tloc = 2;\\n\\t\\t}\\n\\n\\t\\tif(loc == N && M == 1){\\n\\t\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tindex = 1;\\n\\n\\t\\twhile(loc < N || index < M){\\n\\t\\t\\tif(melody[index] == stair[loc]){\\n\\t\\t\\t\\tloc += 1;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else if(is_UP(melody[index],stair[loc]) == true && loc+2 <= N){\\n\\t\\t\\t\\tloc += 2;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else if(is_DOWN(melody[index],stair[loc]) == true && loc > 0){\\n\\t\\t\\t\\tloc -= 1;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(loc == N && index == M)FLG = true;\\n\\t}\\n\\n\\tif(FLG){\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tif((N >= 2 && stair[1] == melody[0]) || (N >= 3 && is_UP(melody[0],stair[1]) == true) || (is_DOWN(melody[0],stair[1]) == true)){\\n\\t\\tif(stair[1] == melody[0]){\\n\\t\\t\\tloc = 2;\\n\\t\\t}else if(is_UP(melody[0],stair[1]) == true){\\n\\t\\t\\tloc = 3;\\n\\t\\t}else{ //is_DOWN(melody[0],stair[1]) == true\\n\\t\\t\\tloc = 0;\\n\\t\\t}\\n\\n\\t\\tif(loc == N && M == 1){\\n\\t\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tindex = 1;\\n\\n\\t\\twhile(loc < N || index < M){\\n\\t\\t\\tif(melody[index] == stair[loc]){\\n\\t\\t\\t\\tloc += 1;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else if(is_UP(melody[index],stair[loc]) == true && loc+2 <= N){\\n\\t\\t\\t\\tloc += 2;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else if(is_DOWN(melody[index],stair[loc]) == true && loc > 0){\\n\\t\\t\\t\\tloc -= 1;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(loc == N && index == M)FLG = true;\\n\\t}\\n\\n\\tif(FLG){\\n\\t\\tprintf(\\\"Yes\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"No\\\\n\\\");\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 0; i < N; i++)func();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.1484,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2190_2290776\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\nint input(){\\n char str[10];\\n scanf(\\\"%s\\\",str);\\n \\n if(str[0]=='B'){\\n return 11;\\n }\\n \\n if(str[0]=='A'){\\n if(str[1]=='#')return 10;\\n return 9;\\n }\\n \\n if(str[0]=='G'){\\n if(str[1]=='#')return 8;\\n return 7;\\n }\\n \\n if(str[0]=='F'){\\n if(str[1]=='#')return 6;\\n return 5;\\n }\\n \\n if(str[0]=='E'){\\n return 4;\\n }\\n \\n if(str[0]=='D'){\\n if(str[1]=='#')return 3;\\n return 2;\\n }\\n \\n if(str[0]=='C'){\\n if(str[1]=='#')return 1;\\n return 0;\\n }\\n \\n assert(0);\\n return -1;\\n}\\n \\nint n,m;\\nint t[50005];\\nint u[50005];\\n \\nint dfs(int depth,int pos){\\n if(depth==m&&n<pos+2)return 1;\\n if(depth==m)return 0;\\n \\n if( 1<=pos-1 && (t[pos-1]+11)%12 == u[depth] ){\\n if( dfs( depth+1, pos-1 ) ) return 1;\\n }\\n \\n if( pos+1 <= n && t[pos+1]==u[depth] ){\\n if( dfs(depth+1,pos+1) )return 1;\\n }\\n \\n if( pos+2 <= n && (t[pos+2]+1)%12==u[depth] ){\\n if( dfs(depth+1,pos+2) )return 1;\\n }\\n \\n return 0;\\n}\\n \\nint main(){\\n int Tc;\\n scanf(\\\"%d\\\",&Tc);\\n while(Tc--){\\n scanf(\\\"%d %d\\\",&n,&m);\\n for(int i=1;i<=n;i++)t[i]=input();\\n for(int i=0;i<m;i++)u[i]=input();\\n \\n int ans=dfs(0,0);\\n if(ans)printf(\\\"Yes\\\\n\\\");\\n else printf(\\\"No\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7240,\n \"memory_kb\": 5804,\n \"score_of_the_acc\": -1.3648,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2190_2290475\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint input(){\\n char str[10];\\n scanf(\\\"%s\\\",str);\\n \\n if(str[0]=='B'){\\n return 11;\\n }\\n \\n if(str[0]=='A'){\\n if(str[1]=='#')return 10;\\n return 9;\\n }\\n\\n if(str[0]=='G'){\\n if(str[1]=='#')return 8;\\n return 7;\\n }\\n \\n if(str[0]=='F'){\\n if(str[1]=='#')return 6;\\n return 5;\\n }\\n\\n if(str[0]=='E'){\\n return 4;\\n }\\n\\n if(str[0]=='D'){\\n if(str[1]=='#')return 3;\\n return 2;\\n }\\n \\n if(str[0]=='C'){\\n if(str[1]=='#')return 1;\\n return 0;\\n }\\n\\n assert(0);\\n return -1;\\n}\\n\\nint n,m;\\nint t[50005];\\nint u[50005];\\n\\nint dfs(int depth,int pos){\\n if(depth==m&&n<pos+2)return 1;\\n if(depth==m)return 0;\\n \\n if( 1<=pos-1 && (t[pos-1]+11)%12 == u[depth] ){\\n if( dfs( depth+1, pos-1 ) ) return 1;\\n }\\n\\n if( pos+1 <= n && t[pos+1]==u[depth] ){\\n if( dfs(depth+1,pos+1) )return 1;\\n }\\n\\n if( pos+2 <= n && (t[pos+2]+1)%12==u[depth] ){\\n if( dfs(depth+1,pos+2) )return 1;\\n }\\n\\n return 0;\\n}\\n\\nint main(){\\n int Tc;\\n scanf(\\\"%d\\\",&Tc);\\n while(Tc--){\\n scanf(\\\"%d %d\\\",&n,&m);\\n for(int i=1;i<=n;i++)t[i]=input();\\n for(int i=0;i<m;i++)u[i]=input();\\n \\n int ans=dfs(0,0);\\n if(ans)printf(\\\"Yes\\\\n\\\");\\n else printf(\\\"No\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6430,\n \"memory_kb\": 5856,\n \"score_of_the_acc\": -1.2606,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2190_1912767\",\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 vi vector<int>\\n#define pb push_back\\n#define INF 999999999\\n//#define INF (1LL<<59)\\n\\nstruct edge{int to,sound;};\\n\\nint f(string s){\\n\\tif(s==\\\"C\\\")return 0;\\n\\tif(s==\\\"C#\\\")return 1;\\n\\tif(s==\\\"D\\\")return 2;\\n\\tif(s==\\\"D#\\\")return 3;\\n\\tif(s==\\\"E\\\")return 4;\\n\\tif(s==\\\"F\\\")return 5;\\n\\tif(s==\\\"F#\\\")return 6;\\n\\tif(s==\\\"G\\\")return 7;\\n\\tif(s==\\\"G#\\\")return 8;\\n\\tif(s==\\\"A\\\")return 9;\\n\\tif(s==\\\"A#\\\")return 10;\\n\\tif(s==\\\"B\\\")return 11;\\n\\treturn -1;\\n}\\n\\nbool isSame(vector<int> &a, vector<int> &b){\\n\\trep(i,a.size()){\\n\\t\\tif(a[i]!=b[i+1])return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n\\nint main(){\\n\\tint input;\\n\\tcin>>input;\\n\\trep(loop,input){\\n\\t\\tint n,m;\\n\\t\\tscanf(\\\"%d %d\\\",&n,&m);\\n\\t\\tvector<int> step,song;\\n\\t\\tstep.pb(-1);\\t//1-index???????????????\\n\\t\\trep(i,n){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\tstep.pb(f(s));\\n\\t\\t}\\n\\t\\trep(i,m){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\tsong.pb(f(s));\\n\\t\\t}\\n\\t\\tsong.pb(-1);\\t//????????????????°???????????????????\\n\\t\\t\\n\\t\\tvector<edge> G[50010];\\n\\t\\trep(i,n) G[i].pb( edge{(int)i+1,step[i+1]} );\\n\\t\\trep(i,n) G[i+1].pb( edge{(int)i,(step[i]-1+12)%12} );\\n\\t\\trep(i,n-1)G[i].pb( edge{(int)i+2,(step[i+2]+1)%12} );\\n\\t\\tG[n].pb(edge{n+1,-1});\\n\\t\\tG[n-1].pb(edge{n+2,-1});\\n\\t\\t\\n\\t\\tbool f=true;\\n\\t\\t\\n\\t\\tqueue<pii> que;\\n\\t\\tque.push(make_pair(0,0));\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint pos = que.front().first;\\n\\t\\t\\tint num = que.front().second;\\n\\t\\t\\tque.pop();\\n\\t\\t\\t\\n\\t\\t\\tif(n+1-pos>2*(m+1-num))continue;\\n\\t\\t\\t\\n\\t\\t\\tif(num==m+1){\\n\\t\\t\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t\\t\\t\\tf=false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\trep(i,G[pos].size()){\\n\\t\\t\\t\\tedge e = G[pos][i];\\n\\t\\t\\t\\tif(e.sound == song[num]){\\n\\t\\t\\t\\t\\tque.push(make_pair(e.to,num+1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(f) cout<<\\\"No\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6060,\n \"memory_kb\": 7108,\n \"score_of_the_acc\": -1.3376,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2190_1908294\",\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<cstdio>\\n#include<sstream>\\n#include<iomanip>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\nusing namespace std;\\n//kaewasuretyuui\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<pii> vp;\\ntypedef vector<vp> vvp;\\ntypedef pair<int,pii> pip;\\ntypedef vector<pip>vip;\\nconst double PI=acos(-1);\\nconst double EPS=1e-8;\\nconst int inf=1e8;\\nint n,m;\\nvi a,b;\\nbool f(int s,int t){\\n\\tif(t==-1){\\n\\t\\tif(s==-1)return true;\\n\\t\\treturn false;\\n\\t}\\n\\tif(s>n||s<0)return false;\\n\\tif(a[s]==b[t]&&f(s-1,t-1))return true;\\n\\tif((a[s]+1)%12==b[t]&&f(s-2,t-1))return true;\\n\\tif((a[s]+11)%12==b[t]&&f(s+1,t-1))return true;\\n\\treturn false;\\n}\\nint main(){\\n\\tmap<string,int>M;\\n\\tM[\\\"A\\\"]=0;\\n\\tM[\\\"A#\\\"]=1;\\n\\tM[\\\"B\\\"]=2;\\n\\tM[\\\"C\\\"]=3;\\n\\tM[\\\"C#\\\"]=4;\\n\\tM[\\\"D\\\"]=5;\\n\\tM[\\\"D#\\\"]=6;\\n\\tM[\\\"E\\\"]=7;\\n\\tM[\\\"F\\\"]=8;\\n\\tM[\\\"F#\\\"]=9;\\n\\tM[\\\"G\\\"]=10;\\n\\tM[\\\"G#\\\"]=11;\\n\\tint q;\\n\\tcin>>q;\\n\\twhile(q--){\\n\\t\\tcin>>n>>m;\\n\\t\\ta=vi(n);\\n\\t\\tb=vi(m);\\n\\t\\trep(i,n){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\ta[i]=M[s];\\n\\t\\t}\\n\\t\\trep(i,m){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\tb[i]=M[s];\\n\\t\\t}\\n\\t\\tif(f(n-1,m-1)||n!=1&&f(n-2,m-1))cout<<\\\"Yes\\\"<<endl;\\n\\t\\telse cout<<\\\"No\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.1799,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2190_1886924\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define MOD 12\\ntypedef vector<int> Vec;\\n \\nint N,M;\\n \\nbool rec(int idxT,int idxS,Vec &T,Vec &S){\\n if(idxT == N && idxS == M) return 1;\\n if(idxT == N || idxS == M) return 0;\\n bool res = false;\\n if(idxT+1 <= N && T[idxT] == S[idxS]){\\n res |= rec(idxT+1,idxS+1,T,S);\\n }\\n if(idxT+2 <= N && (T[idxT]+1)%MOD == S[idxS]){\\n res |= rec(idxT+2,idxS+1,T,S);\\n }\\n if(idxT-1 >= 0 && (T[idxT]-1+MOD)%MOD == S[idxS]){\\n res |= rec(idxT-1,idxS+1,T,S);\\n }\\n return res;\\n}\\n \\nint main(){\\n int Tc;\\n map<string,int> mp = {\\n {\\\"A\\\",0},{\\\"A#\\\",1},\\n {\\\"B\\\",2},\\n {\\\"C\\\",3},{\\\"C#\\\",4},\\n {\\\"D\\\",5},{\\\"D#\\\",6},\\n {\\\"E\\\",7},\\n {\\\"F\\\",8},{\\\"F#\\\",9},\\n {\\\"G\\\",10},{\\\"G#\\\",11},\\n };\\n string in;\\n cin >> Tc;\\n while(Tc--){\\n cin >> N >> M;\\n Vec T(N);\\n for(int i = 0 ; i < N ; i++){\\n cin >> in;\\n T[i] = mp[in];\\n }\\n reverse(T.begin(),T.end());\\n Vec S(M);\\n for(int i = 0 ; i < M ; i++){\\n cin >> in;\\n S[i] = mp[in];\\n }\\n reverse(S.begin(),S.end());\\n bool can = rec(0,0,T,S) | rec(1,0,T,S);\\n cout << (can ? \\\"Yes\\\" : \\\"No\\\") << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 7084,\n \"score_of_the_acc\": -0.5297,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2190_1804111\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstring c[12]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\nint main() {\\n int T,n,m,f,x;\\n cin>>T;\\n while(T--){\\n cin>>n>>m;\\n string s[n],t[m];\\n for(int i=0;i<n;i++)cin>>s[i];\\n for(int i=0;i<m;i++)cin>>t[i];\\n f=0;\\n for(int k=1;k<3;k++){\\n x=n-k;\\n for(int i=m-1,p;i>=0;i--){\\n if(x<0||x>=n)goto e;\\n p=0;\\n while(c[p]!=s[x])p++;\\n if(t[i]==c[p])x--;\\n else if(t[i]==c[(p+1)%12])x-=2;\\n else if(t[i]==c[(p+11)%12])x++;\\n else goto e;\\n }\\n if(x==-1)f=1;\\n e:;\\n }\\n cout<<(f?\\\"Yes\\\":\\\"No\\\")<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 6676,\n \"score_of_the_acc\": -0.4965,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2190_1803685\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nint main() {\\n string c[12]={\\\"C\\\",\\\"C#\\\",\\\"D\\\",\\\"D#\\\",\\\"E\\\",\\\"F\\\",\\\"F#\\\",\\\"G\\\",\\\"G#\\\",\\\"A\\\",\\\"A#\\\",\\\"B\\\"};\\n int T;\\n cin >> T;\\n while(T--) {\\n int n,m;\\n cin >> n >> m;\\n string s[n],t[m];\\n for(int i=0; i<n; i++) cin >> s[i];\\n for(int i=0; i<m; i++) cin >> t[i];\\n bool ck=0;\\n for(int k=1; k<3; k++) {\\n int x=n-k;\\n for(int i=m-1; i>=0; i--) {\\n if(x<0||x>=n) {x=1<<29;break;}\\n int p;\\n for(p=0; p<12; p++) if(c[p]==s[x]) break;\\n if(t[i]==c[p]) x--;\\n else if(t[i]==c[(p+1)%12]) x-=2;\\n else if(t[i]==c[(p+11)%12]) x++;\\n else {x=1<<29;break;}\\n }\\n if(x==-1) ck=1;\\n }\\n if(ck) cout << \\\"Yes\\\" << endl;\\n else cout << \\\"No\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 6680,\n \"score_of_the_acc\": -0.4969,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2190_1758559\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef pair<int,int>pint;\\ntypedef vector<int>vint;\\ntypedef vector<pint>vpint;\\n#define pb push_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\\n\\nint N,M;\\nint T[50010];\\nint S[50010];\\nint lis[]={9,11,0,2,4,5,7};\\n\\nchar t[3];\\ninline int in(){\\n scanf(\\\"%s\\\",t);\\n return lis[t[0]-'A']+(t[1]=='#');\\n}\\ninline int add(int a,int b){\\n a+=b;\\n if(a>=12)a-=12;\\n return a;\\n}\\n\\nvoid solve(){\\n scanf(\\\"%lld%lld\\\",&N,&M);\\n rep(i,N)T[i]=in();\\n rep(i,M)S[i]=in();\\n for(int fin=N-2;fin<N;fin++){\\n bool ok=true;\\n int pos=fin;\\n for(int i=M-1;i>=0;i--){\\n if(pos<0||pos==N){\\n ok=false;\\n break;\\n }\\n if(T[pos]==S[i])pos--;\\n else if(add(T[pos],1)==S[i])pos-=2;\\n else if(add(T[pos],11)==S[i])pos++;\\n else{\\n ok=false;\\n break;\\n }\\n }\\n if(ok&&pos==-1){\\n puts(\\\"Yes\\\");\\n return;\\n }\\n }\\n puts(\\\"No\\\");\\n}\\n\\nsigned main(){\\n int T;scanf(\\\"%lld\\\",&T);\\n while(T--)solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1952,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2190_1758553\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef pair<int,int>pint;\\ntypedef vector<int>vint;\\ntypedef vector<pint>vpint;\\n#define pb push_back\\n#define mp make_pair\\n#define fi first\\n#define se second\\n#define all(v) (v).begin(),(v).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\ntemplate<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}\\ntemplate<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}\\n\\nint N,M;\\nint T[50010];\\nint S[50010];\\nint lis[]={9,11,0,2,4,5,7};\\n\\nchar t[3];\\ninline int in(){\\n scanf(\\\"%s\\\",t);\\n return lis[t[0]-'A']+(t[1]=='#');\\n}\\n\\nvoid solve(){\\n scanf(\\\"%lld%lld\\\",&N,&M);\\n rep(i,N)T[i]=in();\\n rep(i,M)S[i]=in();\\n for(int fin=N-2;fin<N;fin++){\\n bool ok=true;\\n int pos=fin;\\n for(int i=M-1;i>=0;i--){\\n if(pos<0||pos==N){\\n ok=false;\\n break;\\n }\\n if(T[pos]==S[i])pos--;\\n else if((T[pos]+1)%12==S[i])pos-=2;\\n else if((T[pos]+11)%12==S[i])pos++;\\n else{\\n ok=false;\\n break;\\n }\\n }\\n if(ok&&pos==-1){\\n puts(\\\"Yes\\\");\\n return;\\n }\\n }\\n puts(\\\"No\\\");\\n}\\n\\nsigned main(){\\n int T;scanf(\\\"%lld\\\",&T);\\n while(T--)solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1952,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1194,"cells":{"group_id":{"kind":"string","value":"aoj_2198_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nMoonlight Farm\nあなたは大人気webゲーム「ムーンライト牧場」に熱中している．このゲームの目的は，畑で作物を育て，それらを売却して収入を得て，その収入によって牧場を大きくしていくことである．\nあなたは速く畑を大きくしたいと考えた．そこで手始めにゲーム中で育てることのできる作物を，時間あたりの収入効率にもとづいて並べることにした．\n作物を育てるには種を買わなければならない．ここで作物\ni\nの種の名前は\nL\ni\n，値段は\nP\ni\nでそれぞれ与えられる．畑に種を植えると時間\nA\ni\n後に芽が出る．芽が出てから時間\nB\ni\n後に若葉が出る．若葉が出てから時間\nC\ni\n後に葉が茂る．葉が茂ってから時間\nD\ni\n後に花が咲く．花が咲いてから時間\nE\ni\n後に実が成る．一つの種から\nF\ni\n個の実が成り，それらの実は一つあたり\nS\ni\nの価格で売れる．一部の作物は多期作であり，計\nM\ni\n回実をつける．単期作の場合は\nM\ni\n= 1で表される．多期作の作物は，\nM\ni\n回目の実が成るまでは，実が成ったあと葉に戻る．ある種に対する収入は，その種から成った全ての実を売った金額から，種の値段を引いた値である．また，その種の収入効率は，その収入を，種を植えてから全ての実が成り終わるまでの時間で割った値である．\nあなたの仕事は，入力として与えられる作物の情報に対して，それらを収入効率の降順に並べ替えて出力するプログラムを書くことである．\nInput\n入力はデータセットの列であり，各データセットは次のような形式で与えられる．\nN\nL\n1\nP\n1\nA\n1\nB\n1\nC\n1\nD\n1\nE\n1\nF\n1\nS\n1\nM\n1\nL\n2\nP\n2\nA\n2\nB\n2\nC\n2\nD\n2\nE\n2\nF\n2\nS\n2\nM\n2\n...\nL\nN\nP\nN\nA\nN\nB\nN\nC\nN\nD\nN\nE\nN\nF\nN\nS\nN\nM\nN\n一行目はデータセットに含まれる作物の数\nN\nである (1 ≤ N ≤ 50)．\nこれに続く\nN\n行には，各行に一つの作物の情報が含まれる．各変数の意味は問題文中で述べた通りである．作物の名前\nL\ni\nはアルファベット小文字のみからなる20文字以内の文字列であり，また 1 ≤\nP\ni\n,\nA\ni\n,\nB\ni\n,\nC\ni\n,\nD\ni\n,\nE\ni\n,\nF\ni\n,\nS\ni\n≤ 100, 1 ≤\nM\ni\n≤ 5である．一つのケース内に同一の名前を持つ作物は存在しないと仮定して良い．\n入力の終りはゼロを一つだけ含む行で表される．\nOutput\n各データセットについて，各行に一つ，作物の名前を収入効率の降順に出力せよ．収入効率が同じ作物に対しては，それらの名前を辞書順の昇順に出力せよ．\n各データセットの出力の後には“#”のみからなる1行を出力すること．\nSample Input\n5\napple 1 1 1 1 1 1 1 10 1\nbanana 1 2 2 2 2 2 1 10 1\ncarrot 1 2 2 2 2 2 1 10 2\ndurian 1 3 3 3 3 3 1 10 1\neggplant 1 3 3 3 3 3 1 100 1\n4\nenoki 1 3 3 3 3 3 1 10 1\ntomato 1 3 3 3 3 3 1 10 1\npotato 1 3 3 3 3 3 1 10 1\nonion 1 3 3 3 3 3 1 10 1\n3\na 10 1 1 1 1 1 1 10 1\nb 10 2 2 2 2 2 2 10 1\nc 10 2 2 2 2 2 2 10 1\n0\nOutput for the Sample Input\neggplant\napple\ncarrot\nbanana\ndurian\n#\nenoki\nonion\npotato\ntomato\n#\nb\nc\na\n#"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2198_3572710","code_snippet":"#include<bits/stdc++.h>\n#define ll long long\n#define fi first\n#define se second\n#define rep(i, j, k) for (auto i = j; i < k; i++)\n#define rrep(i, j, k) for (auto i = j; i > k; i--)\nusing namespace std;\n\nvoid solve(int &n) {\n map<int, string> name;\n vector<pair<int, int>> v;\n rep(i, 0, n) {\n string l;\n int p, a, b, c, d, e, f, s, m;\n cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;\n int t = a + b + c + m * (d + e);\n int mon = m * f * s - p;\n v.push_back({mon, t});\n name[i] = l;\n }\n bool past[51];\n fill(past, past + 51, false);\n vector<string> ans;\n rep(i, 0, n) {\n rep(j, 0, n) {\n if (past[j]) continue;\n bool ok = true;\n rep(k, 0, n) {\n if (past[k]) continue;\n if (v[j].fi * v[k].se < v[k].fi * v[j].se) ok = false;\n if (v[j].fi * v[k].se == v[k].fi * v[j].se && name[j] > name[k]) ok = false;\n }\n if (ok) {\n ans.push_back(name[j]);\n past[j] = true;\n }\n }\n }\n rep(i, 0, n) cout << ans[i] << endl;\n cout << \"#\" << endl;\n}\n\nint main() {\n int n;\n while (cin >> n, n) solve(n);\n}","accuracy":1,"time_ms":10,"memory_kb":3004,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2198_1940881","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#define N 50\nusing namespace std;\nstruct data{\n string l;\n int p,a,b,c,d,e,f,s,m;\n double cal;\n};\nint main(){\n int n,i,j,time;\n struct data d[N];\n while(1){\n cin >> n;\n if(n==0) break;\n for(i=0;i<n;i++){\n cin >> d[i].l >> d[i].p >> d[i].a >> d[i].b >> d[i].c;\n cin >> d[i].d >> d[i].e >> d[i].f >> d[i].s >> d[i].m;\n time=(d[i].a+d[i].b+d[i].c+d[i].d+d[i].e);\n d[i].m--;\n time+=(d[i].d+d[i].e)*d[i].m;\n d[i].cal=((double)d[i].f*d[i].s*(d[i].m+1)-d[i].p)/time;\n }\n for(i=0;i<n;i++){\n for(j=1;j<n;j++){\n if(d[j].l<d[j-1].l) swap(d[j],d[j-1]);\n }\n }\n for(i=0;i<n;i++){\n for(j=1;j<n;j++){\n if(d[j].cal>d[j-1].cal) swap(d[j],d[j-1]);\n }\n }\n for(i=0;i<n;i++) cout << d[i].l << endl;\n cout << '#' << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1212,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2198_1910534","code_snippet":"#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\nint main(){\n\tint n;\n\tstring al(\"abcdefghijklmnopqrstuvwxyz\");\n\twhile(cin>>n){\n\t\tif(n==0) break;\n\t\tstring s[n];\n\t\tint a[n][9];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>s[i];\n\t\t\tfor(int j=0;j<=8;j++){\n\t\t\t\tcin>>a[i][j];\n\t\t\t}\n\t\t}\n\t\tdouble ef[n];\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdouble x=a[i][7]*a[i][6]*a[i][8]-a[i][0];\n\t\t\tdouble y=a[i][1]+a[i][2]+a[i][3]+(a[i][4]+a[i][5])*a[i][8];\n\t\t\tef[i]=x/y;\n\t\t}\n\t\tfor(int i=0;i<n;i++){\n\t\t\tdouble me=-100;\n\t\t\tint ms;\n\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\tif(ef[j]>me){\n\t\t\t\t\tme=ef[j];\n\t\t\t\t\tms=j;\n\t\t\t\t}\n\t\t\t\telse if(ef[j]==me){\n\t\t\t\t\tfor(int moji=0;moji<30;moji++){\n\t\t\t\t\t\tint m1=-1,m2=-1;\n\t\t\t\t\t\tfor(int z=0;z<26;z++){\n\t\t\t\t\t\t\tif(s[ms][moji]==al[z]) m1=z;\n\t\t\t\t\t\t\tif(s[j][moji]==al[z]) m2=z;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(m1<m2){\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(m1>m2){\n\t\t\t\t\t\t\tms=j;\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\tcout<<s[ms]<<endl;\n\t\t\tef[ms]=-200;\n\t\t}\n\t\tcout<<\"#\"<<endl;\n\t}\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1216,"score_of_the_acc":-1.0022,"final_rank":5},{"submission_id":"aoj_2198_1894534","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <iostream>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <bitset>\n#include <fstream>\nusing namespace std;\n\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n\ntypedef pair<double, string> P;\n\nbool sorter(const P p1, const P p2){\n if(p1.first==p2.first) return p1.second < p2.second;\n else return p1.first > p2.first;\n}\n\nint main(){\n int n;\n while(cin>>n ,n){\n vector<P> vec;\n rep(i,n){\n int p,a,b,c,d,e,f,s,m;\n string l;\n cin>>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;\n vec.pb(mp(1.*(f*s*m-p)/(a+b+c+(d+e)*m), l));\n }\n sort(all(vec), sorter);\n rep(i,n){\n cout<<vec[i].second<<endl;\n }\n cout<<\"#\"<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1224,"score_of_the_acc":-0.0067,"final_rank":1},{"submission_id":"aoj_2198_1876973","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<string>\n\nusing namespace std;\n\n#define NMAX 50\n\ntypedef struct s{\n\tstring L;\n\tdouble P,A,B,C,D,E,F,S,M;\n} S;\n\nbool operator<(S a,S b){\n\tdouble aa=(a.F*a.S*a.M-a.P)/((a.A+a.B+a.C+a.D+a.E)+(a.D+a.E)*(a.M-1));\n\tdouble bb=(b.F*b.S*b.M-b.P)/((b.A+b.B+b.C+b.D+b.E)+(b.D+b.E)*(b.M-1));\n\treturn aa>bb||(aa==bb&&a.L<b.L);\n}\n\nint main(){\n\n\tint N;\n\tS data[NMAX];\n\n\twhile(1){\n\t\tcin>>N;\n\t\tif(N==0) break;\n\n\t\tfor(int i=0;i<N;i++){\n\t\t\tcin>>data[i].L>>data[i].P>>data[i].A>>data[i].B>>data[i].C>>data[i].D>>data[i].E>>data[i].F>>data[i].S>>data[i].M;\n\t\t}\n\n\t\tsort(data,data+N);\n\n\t\tfor(int i=0;i<N;i++){\n\t\t\tcout<<data[i].L<<endl;\n\t\t}\n\t\tcout<<\"#\"<<endl;\n\t}\n\n}","accuracy":1,"time_ms":10,"memory_kb":1256,"score_of_the_acc":-0.0246,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2198_3572710\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define ll long long\\n#define fi first\\n#define se second\\n#define rep(i, j, k) for (auto i = j; i < k; i++)\\n#define rrep(i, j, k) for (auto i = j; i > k; i--)\\nusing namespace std;\\n\\nvoid solve(int &n) {\\n map<int, string> name;\\n vector<pair<int, int>> v;\\n rep(i, 0, n) {\\n string l;\\n int p, a, b, c, d, e, f, s, m;\\n cin >> l >> p >> a >> b >> c >> d >> e >> f >> s >> m;\\n int t = a + b + c + m * (d + e);\\n int mon = m * f * s - p;\\n v.push_back({mon, t});\\n name[i] = l;\\n }\\n bool past[51];\\n fill(past, past + 51, false);\\n vector<string> ans;\\n rep(i, 0, n) {\\n rep(j, 0, n) {\\n if (past[j]) continue;\\n bool ok = true;\\n rep(k, 0, n) {\\n if (past[k]) continue;\\n if (v[j].fi * v[k].se < v[k].fi * v[j].se) ok = false;\\n if (v[j].fi * v[k].se == v[k].fi * v[j].se && name[j] > name[k]) ok = false;\\n }\\n if (ok) {\\n ans.push_back(name[j]);\\n past[j] = true;\\n }\\n }\\n }\\n rep(i, 0, n) cout << ans[i] << endl;\\n cout << \\\"#\\\" << endl;\\n}\\n\\nint main() {\\n int n;\\n while (cin >> n, n) solve(n);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3004,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2198_1940881\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#define N 50\\nusing namespace std;\\nstruct data{\\n string l;\\n int p,a,b,c,d,e,f,s,m;\\n double cal;\\n};\\nint main(){\\n int n,i,j,time;\\n struct data d[N];\\n while(1){\\n cin >> n;\\n if(n==0) break;\\n for(i=0;i<n;i++){\\n cin >> d[i].l >> d[i].p >> d[i].a >> d[i].b >> d[i].c;\\n cin >> d[i].d >> d[i].e >> d[i].f >> d[i].s >> d[i].m;\\n time=(d[i].a+d[i].b+d[i].c+d[i].d+d[i].e);\\n d[i].m--;\\n time+=(d[i].d+d[i].e)*d[i].m;\\n d[i].cal=((double)d[i].f*d[i].s*(d[i].m+1)-d[i].p)/time;\\n }\\n for(i=0;i<n;i++){\\n for(j=1;j<n;j++){\\n if(d[j].l<d[j-1].l) swap(d[j],d[j-1]);\\n }\\n }\\n for(i=0;i<n;i++){\\n for(j=1;j<n;j++){\\n if(d[j].cal>d[j-1].cal) swap(d[j],d[j-1]);\\n }\\n }\\n for(i=0;i<n;i++) cout << d[i].l << endl;\\n cout << '#' << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1212,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2198_1910534\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\nint main(){\\n\\tint n;\\n\\tstring al(\\\"abcdefghijklmnopqrstuvwxyz\\\");\\n\\twhile(cin>>n){\\n\\t\\tif(n==0) break;\\n\\t\\tstring s[n];\\n\\t\\tint a[n][9];\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tcin>>s[i];\\n\\t\\t\\tfor(int j=0;j<=8;j++){\\n\\t\\t\\t\\tcin>>a[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdouble ef[n];\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tdouble x=a[i][7]*a[i][6]*a[i][8]-a[i][0];\\n\\t\\t\\tdouble y=a[i][1]+a[i][2]+a[i][3]+(a[i][4]+a[i][5])*a[i][8];\\n\\t\\t\\tef[i]=x/y;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tdouble me=-100;\\n\\t\\t\\tint ms;\\n\\t\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\t\\tif(ef[j]>me){\\n\\t\\t\\t\\t\\tme=ef[j];\\n\\t\\t\\t\\t\\tms=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(ef[j]==me){\\n\\t\\t\\t\\t\\tfor(int moji=0;moji<30;moji++){\\n\\t\\t\\t\\t\\t\\tint m1=-1,m2=-1;\\n\\t\\t\\t\\t\\t\\tfor(int z=0;z<26;z++){\\n\\t\\t\\t\\t\\t\\t\\tif(s[ms][moji]==al[z]) m1=z;\\n\\t\\t\\t\\t\\t\\t\\tif(s[j][moji]==al[z]) m2=z;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(m1<m2){\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if(m1>m2){\\n\\t\\t\\t\\t\\t\\t\\tms=j;\\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\\tcout<<s[ms]<<endl;\\n\\t\\t\\tef[ms]=-200;\\n\\t\\t}\\n\\t\\tcout<<\\\"#\\\"<<endl;\\n\\t}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1216,\n \"score_of_the_acc\": -1.0022,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2198_1894534\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <cmath>\\n#include <cassert>\\n#include <iostream>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <fstream>\\nusing namespace std;\\n\\n#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n\\ntypedef pair<double, string> P;\\n\\nbool sorter(const P p1, const P p2){\\n if(p1.first==p2.first) return p1.second < p2.second;\\n else return p1.first > p2.first;\\n}\\n\\nint main(){\\n int n;\\n while(cin>>n ,n){\\n vector<P> vec;\\n rep(i,n){\\n int p,a,b,c,d,e,f,s,m;\\n string l;\\n cin>>l>>p>>a>>b>>c>>d>>e>>f>>s>>m;\\n vec.pb(mp(1.*(f*s*m-p)/(a+b+c+(d+e)*m), l));\\n }\\n sort(all(vec), sorter);\\n rep(i,n){\\n cout<<vec[i].second<<endl;\\n }\\n cout<<\\\"#\\\"<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1224,\n \"score_of_the_acc\": -0.0067,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2198_1876973\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<string>\\n\\nusing namespace std;\\n\\n#define NMAX 50\\n\\ntypedef struct s{\\n\\tstring L;\\n\\tdouble P,A,B,C,D,E,F,S,M;\\n} S;\\n\\nbool operator<(S a,S b){\\n\\tdouble aa=(a.F*a.S*a.M-a.P)/((a.A+a.B+a.C+a.D+a.E)+(a.D+a.E)*(a.M-1));\\n\\tdouble bb=(b.F*b.S*b.M-b.P)/((b.A+b.B+b.C+b.D+b.E)+(b.D+b.E)*(b.M-1));\\n\\treturn aa>bb||(aa==bb&&a.L<b.L);\\n}\\n\\nint main(){\\n\\n\\tint N;\\n\\tS data[NMAX];\\n\\n\\twhile(1){\\n\\t\\tcin>>N;\\n\\t\\tif(N==0) break;\\n\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tcin>>data[i].L>>data[i].P>>data[i].A>>data[i].B>>data[i].C>>data[i].D>>data[i].E>>data[i].F>>data[i].S>>data[i].M;\\n\\t\\t}\\n\\n\\t\\tsort(data,data+N);\\n\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tcout<<data[i].L<<endl;\\n\\t\\t}\\n\\t\\tcout<<\\\"#\\\"<<endl;\\n\\t}\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.0246,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1195,"cells":{"group_id":{"kind":"string","value":"aoj_2195_cpp"},"problem_description":{"kind":"string","value":"Problem K:\nCat Numbers!\nねこのアリストテレスは数学の問題を考えるのを趣味にしている。今彼が考えている問題は以下のようなものである。\n1以上の自然数\nA\n,\nB\n(\nA\n<\nB\n) に対して、\nA\nから\nB\nまでの自然数の和を\nC\n、\nA\nと\nB\nを十進表記して\nA\n,\nB\nの順に結合したものを\nD\nとすると、両者が等しくなることがある。たとえば1から5までの和は15、2から7までの和は27、7から119までの和は 7119、といった具合である。このような\nA\nと\nB\nのペアのことを cat numbers と呼ぶことにする。アリストテレスは、\nA\nと\nB\nの桁数が与えられたときに、cat numbersを全て列挙したい、と考えた。\nアリストテレスは、\nA\nまたは\nB\nを固定した場合に解が存在するかどうかを確かめる方法は思いついたので、小さい桁数に対しては答えを得ることができた。しかし、桁数が大きくなるにしたがって計算をするのが大変になり、途中でうんざりして投げ出してしまった。そこで、あなたにお願いがある。アリストテレスに代わって、指定された桁数のcat numbersを全て列挙するプログラムを書いてほしい。\nInput\n入力は1行のみからなる。\nA\nの桁数\na\nおよび\nB\nの桁数\nb\nが1つの空白文字で区切られて与えられる。これらは 1 ≤\na\n≤\nb\n≤ 16 を満たす。\nOutput\n指定された桁数のcat numbersを、\nA\nが小さいものから順に出力せよ。\nA\nが同じものが複数ある場合は、\nB\nが小さいものから出力せよ。各行には1つのcat numbersにおける\nA\nと\nB\nを1つの空白文字で区切ったものを出力せよ。また、条件に合うcat numbersが存在しない場合は \"No cats.\" と1行に出力せよ。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n4\n1 1\n1 3\n1 4\n2 2\nOutput for the Sample Input\n1 5\n2 7\n7 119\nNo cats.\n13 53\n18 63\n33 88\n35 91"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2195_9790609","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s; }\n\n\n\nlong long pow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a;\n a = a * a;\n n >>= 1;\n }\n return res;\n}\n\nvector<long long> divisor(long long n) {\n vector<long long> res;\n for (long long i = 1LL; i*i <= n; ++i) {\n if (n%i == 0LL) {\n res.push_back(i);\n long long temp = n/i;\n if (i != temp) res.push_back(temp);\n }\n }\n sort(res.begin(), res.end());\n return res;\n}\n\nint N;\nlong long a, b;\n\nvll div1[20];\nvll div2[20];\n\nint main() {\n long long num = 1;\n for (int i = 1; i <= 16; ++i) {\n num *= 10;\n div1[i] = divisor(num);\n div2[i] = divisor(num-1);\n \n for (int j = 0; j < div1[i].size(); ++j) {\n //COUT(i); COUT(j);\n if ( (div1[i][j] & 1) || (div1[i][j] % (1LL<<i) == 0) ) continue;\n div1[i].erase(div1[i].begin() + j--);\n }\n }\n \n cin >> N;\n for (int id = 0; id < N; ++id) {\n cin >> a >> b;\n long long ten = pow(10LL, b);\n long long ano = pow(10LL, b) - 1;\n \n long long CA = pow(10LL, a-1);\n long long CB = pow(10LL, b-1);\n long long HI = pow(10LL, max(a+1, b+1));\n \n //COUT(a); COUT(b); COUT(div1); COUT(div2);\n \n vector<pll> res;\n for (int i = 0; i < div2[b].size(); ++i) {\n for (int j = 0; j < div1[b].size(); ++j) {\n long long p = div1[b][j] * div2[b][i];\n if (p > HI) break;\n if (p < CB*10-10) continue;\n \n long long q = (ten/div1[b][j]) * (ano/div2[b][i]);\n if (p < q) continue;\n \n long long A = (p + q + 1)/2 - ten;\n long long B = (p - q + 1)/2;\n \n //cout << p << \", \" << q << \" : \" << A << \", \" <<B << endl;\n \n if (A >= CA && A < CA * 10 && B >= CB && B < CB * 10) {\n res.PB(pll(B, A));\n }\n }\n }\n sort(ALL(res));\n for (int i = 0; i < res.size(); ++i) {\n cout << res[i].second << \" \" << res[i].first << endl;\n }\n if (res.size() == 0) puts(\"No cats.\");\n }\n return 0;\n}","accuracy":1,"time_ms":1770,"memory_kb":3388,"score_of_the_acc":-1.66,"final_rank":4},{"submission_id":"aoj_2195_6049703","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\n/*\nミラーラビン素数判定法\n参考資料\n- https://ja.wikipedia.org/w/index.php?curid=946915\n- https://nyaannyaan.github.io/library/prime/fast-factorize.hpp.html\n\n奇素数 p に対し、次が成立する。\nx^2 ≡ 1 (mod p) ⇔ x = -1, 1 (mod p)\n\np は p - 1 = 2^s × d と表すことができる。\nこの時、任意の自然数 a に対し次のいずれかが真となる。\n- a^d ≡ 1 (mod p)\n- a^{2^r * d} ≡ -1 (mod p) (0 <= r <= s-1)\n\n証明：\nフェルマーの小定理より、\na^{p-1} ≡ a^{2^s × d} ≡ 1 (mod p)\nこの平方根は上で述べた事実より、-1 または 1 (mod p) である。\n-1 の場合、後者の式が成立。\n1 の場合、更に平方根を取る操作を繰り返すと同様の議論に帰着する。\n最後まで -1 とならなかった場合、前者の式が成立。\n\nこの命題の対偶をとる。\n奇数 n に対してある数 a が存在し、\n- a^d ≢ 1 (mod n) かつ\n- 任意の r (0 <= r <= s-1) について、a^{2^r * d} ≢ -1 (mod n)\nならば、n は合成数である。\n\n幾つかの a の値を試しそのいずれかに対しても合成数と判断されなければ素数である。\n任意の n < 2^64 を満たす n に対して正確に判定できる a の値が知られている。\n参考：http://miller-rabin.appspot.com/\n*/\n\n/*\nポラードのρ法\n参考資料\n- https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98\n- https://manabitimes.jp/math/1192\n*/\n\n// verify：https://www.acmicpc.net/problem/4149\nnamespace factorize{\n using u64 = uint64_t;\n using u128 = __uint128_t;\n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n u64 binary_gcd(u64 a, u64 b) {\n if (a == 0) return b;\n if (b == 0) return a;\n const int n = __builtin_ctzll(a | b);\n a >>= __builtin_ctzll(a);\n while (b > 0) {\n b >>= __builtin_ctzll(b);\n if (a > b) std::swap(a, b);\n b -= a;\n }\n return a << n;\n }\n\n u128 pow (u128 a, u64 n, u128 mod) {\n u128 res = 1;\n if (a >= mod) a %= mod;\n while (n > 0) {\n if (n & 1) {\n res *= a;\n if (res >= mod) res %= mod;\n }\n a *= a;\n if (a >= mod) a %= mod;\n n >>= 1;\n }\n return res;\n }\n\n bool miller_rabin (u64 n, vector<u64> v) {\n u64 d = n-1;\n while (~d & 1) d >>= 1;\n for (u64 a:v) {\n if (n <= a) break;\n u64 t = d;\n u128 y = pow(a, t, n);\n while (t != n-1 and y != 1 and y != n-1) {\n y *= y; if(y >= n) y %= n;\n t *= 2;\n }\n if (y != n-1 and t % 2 == 0) return false;\n }\n return true;\n }\n \n bool is_prime (u64 n) {\n if (n <= 1) return false;\n if (~n & 1) return (n == 2);\n if (n < (1LL << 30)) {\n return miller_rabin(n, {2, 7, 61});\n }\n else {\n return miller_rabin(n, {2, 325, 9375, 28178, 450775, 9780504, 1795265022});\n }\n }\n\n template <typename T>\n T pollard_rho (T n) {\n if (~n & 1) return 2;\n if (is_prime(n)) return n;\n\n static u128 x,y,c,d;\n auto f = [&](u128 x) {return (x * x % n + c) % n;};\n auto rnd_ = [&](T l, T r) {return rng() % (r - l + 1) + l;};\n\n x = rnd_(2, n);\n y = x;\n c = rnd_(1, n);\n d = 1;\n\n while (d == 1) {\n x = f(x);\n y = f(y); y = f(y);\n d = binary_gcd((x > y ? x-y : y-x), n);\n if (d == n) {\n return pollard_rho(n);\n }\n }\n if (is_prime(d)) {\n return d;\n }\n else {\n return pollard_rho(d);\n }\n }\n\n template <typename T>\n vector<T> prime_factor (T n) {\n vector<T> res;\n for (T i = 2; i*i <= n;) {\n while (n % i == 0) {\n n /= i;\n res.emplace_back(i);\n }\n i += 1 + (~n & 1);\n if (i >= 101 and n >= (1<<20)) {\n while (n > 1) {\n auto p = pollard_rho(n);\n while (n % p == 0) {\n n /= p;\n res.emplace_back(p);\n }\n }\n break;\n }\n }\n if (n > 1) res.emplace_back(n);\n sort(res.begin(), res.end());\n return res;\n }\n\n} // namespace factorize\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int qq; cin >> qq;\n while(qq--){\n int a,b; cin >> a >> b;\n vector<pair<ll,ll>> res;\n vector<ll> v,vv;\n for(int i=0;i<b;i++){\n v.push_back(2);\n }\n for(int i=0;i<b;i++){\n v.push_back(5);\n }\n ll u = 1;\n for(int i=0;i<b;i++){\n u *= 10;\n }\n u--;\n vv = factorize::prime_factor(u);\n auto make_vec=[](vector<ll> v)->vector<ll>{\n vector<ll> res={1};\n for(ll p:v){\n vector<ll> nres = res;\n for(ll pp:res){\n nres.push_back(pp*p);\n }\n res = nres;\n sort(res.begin(), res.end());\n res.erase(unique(res.begin(), res.end()),res.end());\n }\n return res;\n };\n v = make_vec(v);\n vv = make_vec(vv);\n for(auto p:v){\n for(auto pp:vv){\n __int128 S = (__int128)p * (__int128)pp;\n __int128 T = (__int128)((u+1)/p) * (__int128)(u/pp);\n // U = A-B\n // R = A+B\n __int128 U = S-(u+1);\n __int128 R = T-(u);\n if(U+R>0 and (U+R)%2==0 and R>0){\n ll A = (U+R)/2;\n ll B = R-A;\n if(to_string(A).size() != a or to_string(B).size() != b)continue;\n res.push_back({A,B});\n }\n }\n }\n sort(res.begin(), res.end());\n if(res.size() == 0){\n cout << \"No cats.\" << \"\\n\";\n }\n else{\n for(auto p:res){\n cout << p.first << \" \" << p.second << \"\\n\";\n }\n }\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3604,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_2195_6049622","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\n/*\nミラーラビン素数判定法\n参考資料\n- https://ja.wikipedia.org/w/index.php?curid=946915\n- https://nyaannyaan.github.io/library/prime/fast-factorize.hpp.html\n\n奇素数 p に対し、次が成立する。\nx^2 ≡ 1 (mod p) ⇔ x = -1, 1 (mod p)\n\np は p - 1 = 2^s × d と表すことができる。\nこの時、任意の自然数 a に対し次のいずれかが真となる。\n- a^d ≡ 1 (mod p)\n- a^{2^r * d} ≡ -1 (mod p) (0 <= r <= s-1)\n\n証明：\nフェルマーの小定理より、\na^{p-1} ≡ a^{2^s × d} ≡ 1 (mod p)\nこの平方根は上で述べた事実より、-1 または 1 (mod p) である。\n-1 の場合、後者の式が成立。\n1 の場合、更に平方根を取る操作を繰り返すと同様の議論に帰着する。\n最後まで -1 とならなかった場合、前者の式が成立。\n\nこの命題の対偶をとる。\n奇数 n に対してある数 a が存在し、\n- a^d ≢ 1 (mod n) かつ\n- 任意の r (0 <= r <= s-1) について、a^{2^r * d} ≢ -1 (mod n)\nならば、n は合成数である。\n\n幾つかの a の値を試しそのいずれかに対しても合成数と判断されなければ素数である。\n任意の n < 2^64 を満たす n に対して正確に判定できる a の値が知られている。\n参考：http://miller-rabin.appspot.com/\n*/\n\n/*\nポラードのρ法\n参考資料\n- https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98\n- https://manabitimes.jp/math/1192\n*/\n\n// verify：https://www.acmicpc.net/problem/4149\nnamespace factorize{\n using u64 = uint64_t;\n using u128 = __uint128_t;\n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n u64 binary_gcd(u64 a, u64 b) {\n if (a == 0) return b;\n if (b == 0) return a;\n const int n = __builtin_ctzll(a | b);\n a >>= __builtin_ctzll(a);\n while (b > 0) {\n b >>= __builtin_ctzll(b);\n if (a > b) std::swap(a, b);\n b -= a;\n }\n return a << n;\n }\n\n u128 pow (u128 a, u64 n, u128 mod) {\n u128 res = 1;\n if (a >= mod) a %= mod;\n while (n > 0) {\n if (n & 1) {\n res *= a;\n if (res >= mod) res %= mod;\n }\n a *= a;\n if (a >= mod) a %= mod;\n n >>= 1;\n }\n return res;\n }\n\n bool miller_rabin (u64 n, vector<u64> v) {\n u64 d = n-1;\n while (~d & 1) d >>= 1;\n for (u64 a:v) {\n if (n <= a) break;\n u64 t = d;\n u128 y = pow(a, t, n);\n while (t != n-1 and y != 1 and y != n-1) {\n y *= y; if(y >= n) y %= n;\n t *= 2;\n }\n if (y != n-1 and t % 2 == 0) return false;\n }\n return true;\n }\n \n bool is_prime (u64 n) {\n if (n <= 1) return false;\n if (~n & 1) return (n == 2);\n if (n < (1LL << 30)) {\n return miller_rabin(n, {2, 7, 61});\n }\n else {\n return miller_rabin(n, {2, 325, 9375, 28178, 450775, 9780504, 1795265022});\n }\n }\n\n template <typename T>\n T pollard_rho (T n) {\n if (~n & 1) return 2;\n if (is_prime(n)) return n;\n\n static u128 x,y,c,d;\n auto f = [&](u128 x) {return (x * x % n + c) % n;};\n auto rnd_ = [&](T l, T r) {return rng() % (r - l + 1) + l;};\n\n x = rnd_(2, n);\n y = x;\n c = rnd_(1, n);\n d = 1;\n\n while (d == 1) {\n x = f(x);\n y = f(y); y = f(y);\n d = binary_gcd((x > y ? x-y : y-x), n);\n if (d == n) {\n return pollard_rho(n);\n }\n }\n if (is_prime(d)) {\n return d;\n }\n else {\n return pollard_rho(d);\n }\n }\n\n template <typename T>\n vector<T> prime_factor (T n) {\n vector<T> res;\n for (T i = 2; i*i <= n;) {\n while (n % i == 0) {\n n /= i;\n res.emplace_back(i);\n }\n i += 1 + (~n & 1);\n if (i >= 101 and n >= (1<<20)) {\n while (n > 1) {\n auto p = pollard_rho(n);\n while (n % p == 0) {\n n /= p;\n res.emplace_back(p);\n }\n }\n break;\n }\n }\n if (n > 1) res.emplace_back(n);\n sort(res.begin(), res.end());\n return res;\n }\n\n} // namespace factorize\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int qq; cin >> qq;\n while(qq--){\n int a,b; cin >> a >> b;\n vector<pair<ll,ll>> res;\n vector<ll> v,vv;\n for(int i=0;i<b;i++){\n v.push_back(2);\n }\n for(int i=0;i<b;i++){\n v.push_back(5);\n }\n ll u = 1;\n for(int i=0;i<b;i++){\n u *= 10;\n }\n u--;\n vv = factorize::prime_factor(u);\n auto make_vec=[](vector<ll> v)->vector<ll>{\n vector<ll> res={1};\n for(ll p:v){\n vector<ll> nres = res;\n for(ll pp:res){\n nres.push_back(pp*p);\n }\n res = nres;\n sort(res.begin(), res.end());\n res.erase(unique(res.begin(), res.end()),res.end());\n }\n return res;\n };\n v = make_vec(v);\n vv = make_vec(vv);\n for(auto p:v){\n for(auto pp:vv){\n __int128 S = (__int128)p * (__int128)pp;\n __int128 T = (__int128)((u+1)/p) * (__int128)(u/pp);\n // U = A-B\n // R = A+B\n __int128 U = S-(u+1);\n __int128 R = T-(u);\n if(U+R>0 and (U+R)%2==0 and R>0){\n ll A = (U+R)/2;\n ll B = R-A;\n if(to_string(A).size() != a or to_string(B).size() != b)continue;\n res.push_back({A,B});\n }\n }\n }\n sort(res.begin(), res.end());\n if(res.size() == 0){\n cout << \"No cats.\" << \"\\n\";\n }\n else{\n for(auto p:res){\n cout << p.first << \" \" << p.second << \"\\n\";\n }\n }\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3404,"score_of_the_acc":-0.9147,"final_rank":1},{"submission_id":"aoj_2195_1100082","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s; }\n\n\n\nlong long pow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a;\n a = a * a;\n n >>= 1;\n }\n return res;\n}\n\nvector<long long> divisor(long long n) {\n vector<long long> res;\n for (long long i = 1LL; i*i <= n; ++i) {\n if (n%i == 0LL) {\n res.push_back(i);\n long long temp = n/i;\n if (i != temp) res.push_back(temp);\n }\n }\n sort(res.begin(), res.end());\n return res;\n}\n\nint N;\nlong long a, b;\n\nvll div1[20];\nvll div2[20];\n\nint main() {\n long long num = 1;\n for (int i = 1; i <= 16; ++i) {\n num *= 10;\n div1[i] = divisor(num);\n div2[i] = divisor(num-1);\n \n for (int j = 0; j < div1[i].size(); ++j) {\n //COUT(i); COUT(j);\n if ( (div1[i][j] & 1) || (div1[i][j] % (1LL<<i) == 0) ) continue;\n div1[i].erase(div1[i].begin() + j--);\n }\n }\n \n cin >> N;\n for (int id = 0; id < N; ++id) {\n cin >> a >> b;\n long long ten = pow(10LL, b);\n long long ano = pow(10LL, b) - 1;\n \n long long CA = pow(10LL, a-1);\n long long CB = pow(10LL, b-1);\n long long HI = pow(10LL, max(a+1, b+1));\n \n //COUT(a); COUT(b); COUT(div1); COUT(div2);\n \n vector<pll> res;\n for (int i = 0; i < div2[b].size(); ++i) {\n for (int j = 0; j < div1[b].size(); ++j) {\n long long p = div1[b][j] * div2[b][i];\n if (p > HI) break;\n if (p < CB*10-10) continue;\n \n long long q = (ten/div1[b][j]) * (ano/div2[b][i]);\n if (p < q) continue;\n \n long long A = (p + q + 1)/2 - ten;\n long long B = (p - q + 1)/2;\n \n //cout << p << \", \" << q << \" : \" << A << \", \" <<B << endl;\n \n if (A >= CA && A < CA * 10 && B >= CB && B < CB * 10) {\n res.PB(pll(B, A));\n }\n }\n }\n sort(ALL(res));\n for (int i = 0; i < res.size(); ++i) {\n cout << res[i].second << \" \" << res[i].first << endl;\n }\n if (res.size() == 0) puts(\"No cats.\");\n }\n return 0;\n}","accuracy":1,"time_ms":2350,"memory_kb":1260,"score_of_the_acc":-1,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2195_9790609\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <numeric>\\n#include <utility>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vint;\\ntypedef vector<long long> vll;\\ntypedef pair<int,int> pint;\\ntypedef pair<long long, long long> pll;\\n\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(s) (s).begin(),(s).end()\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s; }\\n\\n\\n\\nlong long pow(long long a, long long n) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a;\\n a = a * a;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\nvector<long long> divisor(long long n) {\\n vector<long long> res;\\n for (long long i = 1LL; i*i <= n; ++i) {\\n if (n%i == 0LL) {\\n res.push_back(i);\\n long long temp = n/i;\\n if (i != temp) res.push_back(temp);\\n }\\n }\\n sort(res.begin(), res.end());\\n return res;\\n}\\n\\nint N;\\nlong long a, b;\\n\\nvll div1[20];\\nvll div2[20];\\n\\nint main() {\\n long long num = 1;\\n for (int i = 1; i <= 16; ++i) {\\n num *= 10;\\n div1[i] = divisor(num);\\n div2[i] = divisor(num-1);\\n \\n for (int j = 0; j < div1[i].size(); ++j) {\\n //COUT(i); COUT(j);\\n if ( (div1[i][j] & 1) || (div1[i][j] % (1LL<<i) == 0) ) continue;\\n div1[i].erase(div1[i].begin() + j--);\\n }\\n }\\n \\n cin >> N;\\n for (int id = 0; id < N; ++id) {\\n cin >> a >> b;\\n long long ten = pow(10LL, b);\\n long long ano = pow(10LL, b) - 1;\\n \\n long long CA = pow(10LL, a-1);\\n long long CB = pow(10LL, b-1);\\n long long HI = pow(10LL, max(a+1, b+1));\\n \\n //COUT(a); COUT(b); COUT(div1); COUT(div2);\\n \\n vector<pll> res;\\n for (int i = 0; i < div2[b].size(); ++i) {\\n for (int j = 0; j < div1[b].size(); ++j) {\\n long long p = div1[b][j] * div2[b][i];\\n if (p > HI) break;\\n if (p < CB*10-10) continue;\\n \\n long long q = (ten/div1[b][j]) * (ano/div2[b][i]);\\n if (p < q) continue;\\n \\n long long A = (p + q + 1)/2 - ten;\\n long long B = (p - q + 1)/2;\\n \\n //cout << p << \\\", \\\" << q << \\\" : \\\" << A << \\\", \\\" <<B << endl;\\n \\n if (A >= CA && A < CA * 10 && B >= CB && B < CB * 10) {\\n res.PB(pll(B, A));\\n }\\n }\\n }\\n sort(ALL(res));\\n for (int i = 0; i < res.size(); ++i) {\\n cout << res[i].second << \\\" \\\" << res[i].first << endl;\\n }\\n if (res.size() == 0) puts(\\\"No cats.\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1770,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -1.66,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2195_6049703\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\n/*\\nミラーラビン素数判定法\\n参考資料\\n- https://ja.wikipedia.org/w/index.php?curid=946915\\n- https://nyaannyaan.github.io/library/prime/fast-factorize.hpp.html\\n\\n奇素数 p に対し、次が成立する。\\nx^2 ≡ 1 (mod p) ⇔ x = -1, 1 (mod p)\\n\\np は p - 1 = 2^s × d と表すことができる。\\nこの時、任意の自然数 a に対し次のいずれかが真となる。\\n- a^d ≡ 1 (mod p)\\n- a^{2^r * d} ≡ -1 (mod p) (0 <= r <= s-1)\\n\\n証明：\\nフェルマーの小定理より、\\na^{p-1} ≡ a^{2^s × d} ≡ 1 (mod p)\\nこの平方根は上で述べた事実より、-1 または 1 (mod p) である。\\n-1 の場合、後者の式が成立。\\n1 の場合、更に平方根を取る操作を繰り返すと同様の議論に帰着する。\\n最後まで -1 とならなかった場合、前者の式が成立。\\n\\nこの命題の対偶をとる。\\n奇数 n に対してある数 a が存在し、\\n- a^d ≢ 1 (mod n) かつ\\n- 任意の r (0 <= r <= s-1) について、a^{2^r * d} ≢ -1 (mod n)\\nならば、n は合成数である。\\n\\n幾つかの a の値を試しそのいずれかに対しても合成数と判断されなければ素数である。\\n任意の n < 2^64 を満たす n に対して正確に判定できる a の値が知られている。\\n参考：http://miller-rabin.appspot.com/\\n*/\\n\\n/*\\nポラードのρ法\\n参考資料\\n- https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98\\n- https://manabitimes.jp/math/1192\\n*/\\n\\n// verify：https://www.acmicpc.net/problem/4149\\nnamespace factorize{\\n using u64 = uint64_t;\\n using u128 = __uint128_t;\\n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n u64 binary_gcd(u64 a, u64 b) {\\n if (a == 0) return b;\\n if (b == 0) return a;\\n const int n = __builtin_ctzll(a | b);\\n a >>= __builtin_ctzll(a);\\n while (b > 0) {\\n b >>= __builtin_ctzll(b);\\n if (a > b) std::swap(a, b);\\n b -= a;\\n }\\n return a << n;\\n }\\n\\n u128 pow (u128 a, u64 n, u128 mod) {\\n u128 res = 1;\\n if (a >= mod) a %= mod;\\n while (n > 0) {\\n if (n & 1) {\\n res *= a;\\n if (res >= mod) res %= mod;\\n }\\n a *= a;\\n if (a >= mod) a %= mod;\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n bool miller_rabin (u64 n, vector<u64> v) {\\n u64 d = n-1;\\n while (~d & 1) d >>= 1;\\n for (u64 a:v) {\\n if (n <= a) break;\\n u64 t = d;\\n u128 y = pow(a, t, n);\\n while (t != n-1 and y != 1 and y != n-1) {\\n y *= y; if(y >= n) y %= n;\\n t *= 2;\\n }\\n if (y != n-1 and t % 2 == 0) return false;\\n }\\n return true;\\n }\\n \\n bool is_prime (u64 n) {\\n if (n <= 1) return false;\\n if (~n & 1) return (n == 2);\\n if (n < (1LL << 30)) {\\n return miller_rabin(n, {2, 7, 61});\\n }\\n else {\\n return miller_rabin(n, {2, 325, 9375, 28178, 450775, 9780504, 1795265022});\\n }\\n }\\n\\n template <typename T>\\n T pollard_rho (T n) {\\n if (~n & 1) return 2;\\n if (is_prime(n)) return n;\\n\\n static u128 x,y,c,d;\\n auto f = [&](u128 x) {return (x * x % n + c) % n;};\\n auto rnd_ = [&](T l, T r) {return rng() % (r - l + 1) + l;};\\n\\n x = rnd_(2, n);\\n y = x;\\n c = rnd_(1, n);\\n d = 1;\\n\\n while (d == 1) {\\n x = f(x);\\n y = f(y); y = f(y);\\n d = binary_gcd((x > y ? x-y : y-x), n);\\n if (d == n) {\\n return pollard_rho(n);\\n }\\n }\\n if (is_prime(d)) {\\n return d;\\n }\\n else {\\n return pollard_rho(d);\\n }\\n }\\n\\n template <typename T>\\n vector<T> prime_factor (T n) {\\n vector<T> res;\\n for (T i = 2; i*i <= n;) {\\n while (n % i == 0) {\\n n /= i;\\n res.emplace_back(i);\\n }\\n i += 1 + (~n & 1);\\n if (i >= 101 and n >= (1<<20)) {\\n while (n > 1) {\\n auto p = pollard_rho(n);\\n while (n % p == 0) {\\n n /= p;\\n res.emplace_back(p);\\n }\\n }\\n break;\\n }\\n }\\n if (n > 1) res.emplace_back(n);\\n sort(res.begin(), res.end());\\n return res;\\n }\\n\\n} // namespace factorize\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int qq; cin >> qq;\\n while(qq--){\\n int a,b; cin >> a >> b;\\n vector<pair<ll,ll>> res;\\n vector<ll> v,vv;\\n for(int i=0;i<b;i++){\\n v.push_back(2);\\n }\\n for(int i=0;i<b;i++){\\n v.push_back(5);\\n }\\n ll u = 1;\\n for(int i=0;i<b;i++){\\n u *= 10;\\n }\\n u--;\\n vv = factorize::prime_factor(u);\\n auto make_vec=[](vector<ll> v)->vector<ll>{\\n vector<ll> res={1};\\n for(ll p:v){\\n vector<ll> nres = res;\\n for(ll pp:res){\\n nres.push_back(pp*p);\\n }\\n res = nres;\\n sort(res.begin(), res.end());\\n res.erase(unique(res.begin(), res.end()),res.end());\\n }\\n return res;\\n };\\n v = make_vec(v);\\n vv = make_vec(vv);\\n for(auto p:v){\\n for(auto pp:vv){\\n __int128 S = (__int128)p * (__int128)pp;\\n __int128 T = (__int128)((u+1)/p) * (__int128)(u/pp);\\n // U = A-B\\n // R = A+B\\n __int128 U = S-(u+1);\\n __int128 R = T-(u);\\n if(U+R>0 and (U+R)%2==0 and R>0){\\n ll A = (U+R)/2;\\n ll B = R-A;\\n if(to_string(A).size() != a or to_string(B).size() != b)continue;\\n res.push_back({A,B});\\n }\\n }\\n }\\n sort(res.begin(), res.end());\\n if(res.size() == 0){\\n cout << \\\"No cats.\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n for(auto p:res){\\n cout << p.first << \\\" \\\" << p.second << \\\"\\\\n\\\";\\n }\\n }\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2195_6049622\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\n/*\\nミラーラビン素数判定法\\n参考資料\\n- https://ja.wikipedia.org/w/index.php?curid=946915\\n- https://nyaannyaan.github.io/library/prime/fast-factorize.hpp.html\\n\\n奇素数 p に対し、次が成立する。\\nx^2 ≡ 1 (mod p) ⇔ x = -1, 1 (mod p)\\n\\np は p - 1 = 2^s × d と表すことができる。\\nこの時、任意の自然数 a に対し次のいずれかが真となる。\\n- a^d ≡ 1 (mod p)\\n- a^{2^r * d} ≡ -1 (mod p) (0 <= r <= s-1)\\n\\n証明：\\nフェルマーの小定理より、\\na^{p-1} ≡ a^{2^s × d} ≡ 1 (mod p)\\nこの平方根は上で述べた事実より、-1 または 1 (mod p) である。\\n-1 の場合、後者の式が成立。\\n1 の場合、更に平方根を取る操作を繰り返すと同様の議論に帰着する。\\n最後まで -1 とならなかった場合、前者の式が成立。\\n\\nこの命題の対偶をとる。\\n奇数 n に対してある数 a が存在し、\\n- a^d ≢ 1 (mod n) かつ\\n- 任意の r (0 <= r <= s-1) について、a^{2^r * d} ≢ -1 (mod n)\\nならば、n は合成数である。\\n\\n幾つかの a の値を試しそのいずれかに対しても合成数と判断されなければ素数である。\\n任意の n < 2^64 を満たす n に対して正確に判定できる a の値が知られている。\\n参考：http://miller-rabin.appspot.com/\\n*/\\n\\n/*\\nポラードのρ法\\n参考資料\\n- https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98\\n- https://manabitimes.jp/math/1192\\n*/\\n\\n// verify：https://www.acmicpc.net/problem/4149\\nnamespace factorize{\\n using u64 = uint64_t;\\n using u128 = __uint128_t;\\n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n u64 binary_gcd(u64 a, u64 b) {\\n if (a == 0) return b;\\n if (b == 0) return a;\\n const int n = __builtin_ctzll(a | b);\\n a >>= __builtin_ctzll(a);\\n while (b > 0) {\\n b >>= __builtin_ctzll(b);\\n if (a > b) std::swap(a, b);\\n b -= a;\\n }\\n return a << n;\\n }\\n\\n u128 pow (u128 a, u64 n, u128 mod) {\\n u128 res = 1;\\n if (a >= mod) a %= mod;\\n while (n > 0) {\\n if (n & 1) {\\n res *= a;\\n if (res >= mod) res %= mod;\\n }\\n a *= a;\\n if (a >= mod) a %= mod;\\n n >>= 1;\\n }\\n return res;\\n }\\n\\n bool miller_rabin (u64 n, vector<u64> v) {\\n u64 d = n-1;\\n while (~d & 1) d >>= 1;\\n for (u64 a:v) {\\n if (n <= a) break;\\n u64 t = d;\\n u128 y = pow(a, t, n);\\n while (t != n-1 and y != 1 and y != n-1) {\\n y *= y; if(y >= n) y %= n;\\n t *= 2;\\n }\\n if (y != n-1 and t % 2 == 0) return false;\\n }\\n return true;\\n }\\n \\n bool is_prime (u64 n) {\\n if (n <= 1) return false;\\n if (~n & 1) return (n == 2);\\n if (n < (1LL << 30)) {\\n return miller_rabin(n, {2, 7, 61});\\n }\\n else {\\n return miller_rabin(n, {2, 325, 9375, 28178, 450775, 9780504, 1795265022});\\n }\\n }\\n\\n template <typename T>\\n T pollard_rho (T n) {\\n if (~n & 1) return 2;\\n if (is_prime(n)) return n;\\n\\n static u128 x,y,c,d;\\n auto f = [&](u128 x) {return (x * x % n + c) % n;};\\n auto rnd_ = [&](T l, T r) {return rng() % (r - l + 1) + l;};\\n\\n x = rnd_(2, n);\\n y = x;\\n c = rnd_(1, n);\\n d = 1;\\n\\n while (d == 1) {\\n x = f(x);\\n y = f(y); y = f(y);\\n d = binary_gcd((x > y ? x-y : y-x), n);\\n if (d == n) {\\n return pollard_rho(n);\\n }\\n }\\n if (is_prime(d)) {\\n return d;\\n }\\n else {\\n return pollard_rho(d);\\n }\\n }\\n\\n template <typename T>\\n vector<T> prime_factor (T n) {\\n vector<T> res;\\n for (T i = 2; i*i <= n;) {\\n while (n % i == 0) {\\n n /= i;\\n res.emplace_back(i);\\n }\\n i += 1 + (~n & 1);\\n if (i >= 101 and n >= (1<<20)) {\\n while (n > 1) {\\n auto p = pollard_rho(n);\\n while (n % p == 0) {\\n n /= p;\\n res.emplace_back(p);\\n }\\n }\\n break;\\n }\\n }\\n if (n > 1) res.emplace_back(n);\\n sort(res.begin(), res.end());\\n return res;\\n }\\n\\n} // namespace factorize\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int qq; cin >> qq;\\n while(qq--){\\n int a,b; cin >> a >> b;\\n vector<pair<ll,ll>> res;\\n vector<ll> v,vv;\\n for(int i=0;i<b;i++){\\n v.push_back(2);\\n }\\n for(int i=0;i<b;i++){\\n v.push_back(5);\\n }\\n ll u = 1;\\n for(int i=0;i<b;i++){\\n u *= 10;\\n }\\n u--;\\n vv = factorize::prime_factor(u);\\n auto make_vec=[](vector<ll> v)->vector<ll>{\\n vector<ll> res={1};\\n for(ll p:v){\\n vector<ll> nres = res;\\n for(ll pp:res){\\n nres.push_back(pp*p);\\n }\\n res = nres;\\n sort(res.begin(), res.end());\\n res.erase(unique(res.begin(), res.end()),res.end());\\n }\\n return res;\\n };\\n v = make_vec(v);\\n vv = make_vec(vv);\\n for(auto p:v){\\n for(auto pp:vv){\\n __int128 S = (__int128)p * (__int128)pp;\\n __int128 T = (__int128)((u+1)/p) * (__int128)(u/pp);\\n // U = A-B\\n // R = A+B\\n __int128 U = S-(u+1);\\n __int128 R = T-(u);\\n if(U+R>0 and (U+R)%2==0 and R>0){\\n ll A = (U+R)/2;\\n ll B = R-A;\\n if(to_string(A).size() != a or to_string(B).size() != b)continue;\\n res.push_back({A,B});\\n }\\n }\\n }\\n sort(res.begin(), res.end());\\n if(res.size() == 0){\\n cout << \\\"No cats.\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n for(auto p:res){\\n cout << p.first << \\\" \\\" << p.second << \\\"\\\\n\\\";\\n }\\n }\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.9147,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2195_1100082\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <numeric>\\n#include <utility>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vint;\\ntypedef vector<long long> vll;\\ntypedef pair<int,int> pint;\\ntypedef pair<long long, long long> pll;\\n\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(s) (s).begin(),(s).end()\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P) \\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s; }\\n\\n\\n\\nlong long pow(long long a, long long n) {\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a;\\n a = a * a;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\nvector<long long> divisor(long long n) {\\n vector<long long> res;\\n for (long long i = 1LL; i*i <= n; ++i) {\\n if (n%i == 0LL) {\\n res.push_back(i);\\n long long temp = n/i;\\n if (i != temp) res.push_back(temp);\\n }\\n }\\n sort(res.begin(), res.end());\\n return res;\\n}\\n\\nint N;\\nlong long a, b;\\n\\nvll div1[20];\\nvll div2[20];\\n\\nint main() {\\n long long num = 1;\\n for (int i = 1; i <= 16; ++i) {\\n num *= 10;\\n div1[i] = divisor(num);\\n div2[i] = divisor(num-1);\\n \\n for (int j = 0; j < div1[i].size(); ++j) {\\n //COUT(i); COUT(j);\\n if ( (div1[i][j] & 1) || (div1[i][j] % (1LL<<i) == 0) ) continue;\\n div1[i].erase(div1[i].begin() + j--);\\n }\\n }\\n \\n cin >> N;\\n for (int id = 0; id < N; ++id) {\\n cin >> a >> b;\\n long long ten = pow(10LL, b);\\n long long ano = pow(10LL, b) - 1;\\n \\n long long CA = pow(10LL, a-1);\\n long long CB = pow(10LL, b-1);\\n long long HI = pow(10LL, max(a+1, b+1));\\n \\n //COUT(a); COUT(b); COUT(div1); COUT(div2);\\n \\n vector<pll> res;\\n for (int i = 0; i < div2[b].size(); ++i) {\\n for (int j = 0; j < div1[b].size(); ++j) {\\n long long p = div1[b][j] * div2[b][i];\\n if (p > HI) break;\\n if (p < CB*10-10) continue;\\n \\n long long q = (ten/div1[b][j]) * (ano/div2[b][i]);\\n if (p < q) continue;\\n \\n long long A = (p + q + 1)/2 - ten;\\n long long B = (p - q + 1)/2;\\n \\n //cout << p << \\\", \\\" << q << \\\" : \\\" << A << \\\", \\\" <<B << endl;\\n \\n if (A >= CA && A < CA * 10 && B >= CB && B < CB * 10) {\\n res.PB(pll(B, A));\\n }\\n }\\n }\\n sort(ALL(res));\\n for (int i = 0; i < res.size(); ++i) {\\n cout << res[i].second << \\\" \\\" << res[i].first << endl;\\n }\\n if (res.size() == 0) puts(\\\"No cats.\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2350,\n \"memory_kb\": 1260,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1196,"cells":{"group_id":{"kind":"string","value":"aoj_2197_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nSum of Consecutive Integers\nあなたは数か月に渡る受験戦争を勝ち抜き，晴れてICPC大学に入学することができた．入学手続きの日，大学のキャンパス内では熱狂的なサークルの勧誘活動が行われており，あなたは大量のパンフレットを受け取って帰ってきた．部屋に戻ってきたあなたは受け取ったパンフレットの中から気になる一枚を見つけた．そのパンフレットは大学の広報部から渡されたものだった．\nパンフレットには以下のような問題が記されていた．\n和が\nN\nとなるような，連続する2つ以上の正の整数の組み合わせは，何組存在するでしょうか？例えば， 9 は 2+3+4 と 4+5 の 2通りの組み合わせがあります．\nこの問題の答えが気になったあなたは，プログラムを書いてその答えを調べることにした．したがって，あなたの仕事は，入力として与えられる正の整数\nN\nに対して，問題の答えを出力するプログラムを書くことである．\nInput\n入力はデータセットの並びである．各データセットはひとつの整数\nN\nからなる一行である．ここで 1 ≤\nN\n≤ 1000 である．\n入力の終りは，ひとつのゼロからなる一行で示される．\nOutput\n出力は，入力の各データセットの表す正の整数に対する問題の答えを，入力データセットの順序通りに並べたものである．それ以外の文字が出力にあってはならない．\nSample Input\n9\n500\n0\nOutput for the Sample Input\n2\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2197_10641180","code_snippet":"#include <bits/stdc++.h>\n// using namespace std;\n\nint main() {\n while (true) {\n int N;\n std::cin >> N;\n\n if (N == 0)\n break;\n\n int ans = 0;\n\n for (int i = 1; i <= N; i++)\n for (int j = i + 1; j <= N; j++) {\n int sum = (i + j) * (j - i + 1) / 2;\n // std::cout << i << ' ' << j << \" \" << sum << std::endl;\n ans += sum == N;\n }\n\n std::cout << ans << std::endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.1356,"final_rank":11},{"submission_id":"aoj_2197_10557117","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n vector<int> cum(1001, 0);\n for(int i = 1; i <= 1000; ++i) cum[i] = cum[i - 1] + i;\n while(1){\n int N; cin >> N;\n if(N == 0) break;\n\n int ans = 0;\n for(int i = 0; i < 1000; ++i){\n for(int j = i + 2; j <= 1000; ++j){\n if(cum[j] - cum[i] == N) ++ans;\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3348,"score_of_the_acc":-0.4616,"final_rank":15},{"submission_id":"aoj_2197_9417454","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define SIZE 1005\nint main(){\n int n;\n while(true){\n int sum[SIZE];\n sum[0]=0;\n int count=0;\n\n cin>>n;\n if(n==0)break;\n for(int i=1;i<n;i++){\n sum[i]=sum[i-1]+i;\n }\n for(int i=1;i<n;i++){\n for(int j=0;j<i;j++){\n if((sum[i]-sum[j])==n)count++;\n }\n }\n cout<<count<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":2996,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2197_9295941","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e17;\n\nint main(){\n while(true){\n int n;\n cin >> n;\n if(n==0){\n break;\n }\n\n //sum[i] = 0~iまでの和\n vector<int> sum(n+1);\n for(int i=0;i<=n;i++){\n sum[i] = i;\n }\n for(int i=1;i<=n;i++){\n sum[i] += sum[i-1];\n }\n\n int ans = 0;\n //(l,r]の和\n for(int l=0;l<=n;l++){\n for(int r=l+2;r<=n;r++){\n if(sum[r]-sum[l]==n){\n ans++;\n }\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3024,"score_of_the_acc":-0.0102,"final_rank":2},{"submission_id":"aoj_2197_9258225","code_snippet":"#include<bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n\n#define all(v) v.begin(),v.end()\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll=vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing P = pair<ll,ll>;\nusing vp=vector<pair<ll, ll>>;\n//using mint=modint1000000007;\n//using mint=modint998244353;\n\nconst ll INF=1ll<<60;\nll mod10=1e9+7;\nll mod99=998244353;\nconst double PI = acos(-1);\n\n#define rep(i,n) for (ll i=0;i<n;++i)\n#define per(i,n) for(ll i=n-1;i>=0;--i)\n#define rep2(i,a,n) for (ll i=a;i<n;++i)\n#define per2(i,a,n) for (ll i=a;i>=n;--i)\n\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\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n while(1){\n ll N;cin>>N;\n if(N==0) break;\n ll ans=0;\n rep2(i,1,N){\n ll sum=0;\n rep(j,N+1){\n sum+=i+j;\n if(sum==N) ans++;\n }\n \n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3356,"score_of_the_acc":-0.1312,"final_rank":10},{"submission_id":"aoj_2197_9112663","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\n\nint mt(int n) {\n return n*(n+1)/2;\n}\n\nint main() {\n int n;\n while (true) {\n cin >> n;\n if (!n) {\n return 0;\n }\n int ans = 0;\n \n for (int i = 1; i < 501; i++) {\n for (int j = i+1; j < 501; j++) {\n if (mt(j)-mt(i-1) == n) {\n ans++;\n }\n }\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3132,"score_of_the_acc":-0.0496,"final_rank":5},{"submission_id":"aoj_2197_9060304","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int sum[1000];\n sum[0] = 0;\n for (int i = 1; i < 1000; i++) {\n sum[i] = sum[i - 1] + i;\n }\n while (1) {\n int n;\n cin >> n;\n if (n == 0) break;\n int cnt = 0;\n for (int i = 0; i < 1000; i++) {\n for (int j = i + 2; j < 1000; j++) {\n if (sum[j] - sum[i] == n) {\n cnt++;\n }\n }\n }\n cout << cnt << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3004,"score_of_the_acc":-0.6696,"final_rank":17},{"submission_id":"aoj_2197_8404143","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n map<int,int> ans;\n for(int i=1;i<=499;i++){\n for(int j=i+1;j<=500;j++){\n int S = (i+j)*(j-i+1)/2;\n ans[S]++;\n }\n }\n for(;;){\n int N;\n cin >> N;\n if(N == 0) break;\n cout << ans[N] << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5740,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_2197_8158105","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <stdio.h>\n#include <math.h>\n#include <set>\n#include <map>\n#include <queue>\n#include <cassert>\n#include <numeric>\n\n\n\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define P pair<int, int>\n\n\nint main() {\n\tint n;\n\tint ans = 0;\n\tvector<int>sum;\n\n\tcin >> n;\n\twhile (n != 0) {\n\t\tsum.push_back(0);\n\t\trep(i, n) {\n\t\t\tsum.push_back(sum[i] + i+1);\n\t\t}\n\t\trep(i, sum.size()-1) {\n\t\t\tfor (int j = i + 1;j < sum.size();j++) {\n\t\t\t\tif (sum[j] - sum[i] == n && j - i != 1)ans++;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t\tans = 0; \n\t\tsum.clear();\n\t\tcin >> n;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.0539,"final_rank":6},{"submission_id":"aoj_2197_7908459","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nbool solve(){\n int N;\n cin>>N;\n if(N==0)return false;\n int ans=0;\n vector<int>S(N+1);\n for(int i=1;i<=N;i++){\n S[i]=S[i-1]+i;\n }\n for(int i=0;i<N;i++)for(int j=i+2;j<=N;j++){\n if(S[j]-S[i]==N)ans++;\n }\n cout<<ans<<\"\\n\";\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(1){\n if(!solve()){\n return 0;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3148,"score_of_the_acc":-0.0554,"final_rank":7},{"submission_id":"aoj_2197_7195576","code_snippet":"#include \"bits/stdc++.h\"\n#pragma GCC optimize(\"Ofast\")\n\n// Begin Header {{{\n#pragma region\nusing namespace std;\n\n#ifndef DEBUG\n#define dump(...)\n#endif\n\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)\n#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)\n#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)\n#define var(Type, ...) \\\n Type __VA_ARGS__; \\\n input(__VA_ARGS__)\n#define let const auto\n\nconstexpr size_t operator\"\"_zu(unsigned long long value) {\n return value;\n};\nconstexpr intmax_t operator\"\"_jd(unsigned long long value) {\n return value;\n};\nconstexpr uintmax_t operator\"\"_ju(unsigned long long value) {\n return value;\n};\n\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;\n\nusing usize = size_t;\nusing imax = intmax_t;\nusing uimax = uintmax_t;\nusing ld = long double;\n\ntemplate <class T, class Compare = less<>>\nusing MaxHeap = priority_queue<T, vector<T>, Compare>;\ntemplate <class T, class Compare = greater<>>\nusing MinHeap = priority_queue<T, vector<T>, Compare>;\n\ninline void input() {}\ntemplate <class Head, class... Tail>\ninline void input(Head&& head, Tail&&... tail) {\n cin >> head;\n input(forward<Tail>(tail)...);\n}\n\ntemplate <class Container, class Value = typename Container::value_type,\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\ninline istream& operator>>(istream& is, Container& vs) {\n for (auto& v: vs) is >> v;\n return is;\n}\n\ntemplate <class T, class U>\ninline istream& operator>>(istream& is, pair<T, U>& p) {\n is >> p.first >> p.second;\n return is;\n}\n\ninline void output() {\n cout << \"\\n\";\n}\ntemplate <class Head, class... Tail>\ninline void output(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(tail)) cout << \" \";\n output(forward<Tail>(tail)...);\n}\n\ntemplate <class Container, class Value = typename Container::value_type,\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\ninline ostream& operator<<(ostream& os, const Container& vs) {\n static constexpr const char* delim[] = {\" \", \"\"};\n for (auto it = begin(vs); it != end(vs); ++it) {\n os << delim[it == begin(vs)] << *it;\n }\n return os;\n}\n\ntemplate <class Iterator>\ninline void join(const Iterator& Begin, const Iterator& End, const string& delim = \"\\n\",\n const string& last = \"\\n\") {\n for (auto it = Begin; it != End; ++it) {\n cout << ((it == Begin) ? \"\" : delim) << *it;\n }\n cout << last;\n}\n\ntemplate <class T>\ninline vector<T> makeVector(const T& init_value, size_t sz) {\n return vector<T>(sz, init_value);\n}\n\ntemplate <class T, class... Args>\ninline auto makeVector(const T& init_value, size_t sz, Args... args) {\n return vector<decltype(makeVector<T>(init_value, args...))>(\n sz, makeVector<T>(init_value, args...));\n}\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func> {forward<Func>(f)};\n}\n\ntemplate <class Container>\nstruct reverse_t {\n Container& c;\n reverse_t(Container& c) : c(c) {}\n auto begin() {\n return c.rbegin();\n }\n auto end() {\n return c.rend();\n }\n};\n\ntemplate <class Container>\nauto reversed(Container& c) {\n return reverse_t<Container>(c);\n}\n\ntemplate <class T>\ninline bool chmax(T& a, const T& b) noexcept {\n return b > a && (a = b, true);\n}\n\ntemplate <class T>\ninline bool chmin(T& a, const T& b) noexcept {\n return b < a && (a = b, true);\n}\n\ntemplate <class T>\ninline T diff(const T& a, const T& b) noexcept {\n return a < b ? b - a : a - b;\n}\n\ntemplate <class T>\ninline T sigma(const T& l, const T& r) noexcept {\n return (l + r) * (r - l + 1) / 2;\n}\n\ntemplate <class T>\ninline T ceildiv(const T& n, const T& d) noexcept {\n return (n + d - 1) / d;\n}\n\nvoid operator|=(vector<bool>::reference lhs, const bool rhs) {\n lhs = lhs | rhs;\n}\n\nvoid operator&=(vector<bool>::reference lhs, const bool rhs) {\n lhs = lhs & rhs;\n}\n\nvoid operator^=(vector<bool>::reference lhs, const bool rhs) {\n lhs = lhs ^ rhs;\n}\n\nvoid ioinit() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n clog << fixed << setprecision(10);\n}\n#pragma endregion\n// }}} End Header\n\nint main() {\n ioinit();\n\n intmax_t N;\n while (input(N), N) {\n intmax_t res = 0;\n repc(l, 1, N) repc(r, l + 1, N) {\n res += sigma(l, r) == N;\n }\n output(res);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.1676,"final_rank":14},{"submission_id":"aoj_2197_6638560","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// template {{{\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\n#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)\n\n#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)\n#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)\n\n#define debug(x) cerr << \"(\" << __LINE__ << \")\" << #x << \": \" << (x) << endl\n\nconstexpr i32 inf = 1001001001;\nconstexpr i64 infll = 1001001001001001001ll;\n\nconstexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; \nconstexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};\n\nstruct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;\n\ntemplate <typename T = i64> T input() { T x; cin >> x; return x; }\n\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\"); } return os; } \ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }\n\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\ntemplate <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }\n\ntemplate <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }\ntemplate <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }\n\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n// }}}\n\nvoid solve(int n) {\n vector< int > rs(n);\n whole(iota, rs, 0);\n range(i, 1, rs.size()) rs[i] += rs[i - 1];\n\n int ans = 0;\n range(r, 1, rs.size()) range(l, 0, r) {\n if (rs[r] - rs[l] == n) ans++;\n }\n\n cout << ans << endl;\n}\n\nsigned main() {\n int n;\n\n while (cin >> n, n) {\n solve(n);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3372,"score_of_the_acc":-0.137,"final_rank":12},{"submission_id":"aoj_2197_6619088","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\n\n#define _overload(_1, _2, _3, _4, name, ...) name\n#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)\n#define _rep2(Itr, a, b) _rep3(Itr, a, b, 1)\n#define _rep3(Itr, a, b, step) for (i64 Itr = a; Itr < b; Itr += step)\n#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)\n#define rep(...) repeat(__VA_ARGS__)\n\n#define ALL(X) begin(X), end(X)\n\nusing namespace std;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n i64 n;\n while (cin >> n, n > 0) {\n i64 ans = 0;\n rep(i, 1, n + 1) {\n rep(j, i + 2, n + 1) {\n // [i, j)\n if (n == j * (j - 1) / 2 - i * (i - 1) / 2) ans++;\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3336,"score_of_the_acc":-0.1239,"final_rank":9},{"submission_id":"aoj_2197_6408637","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <iomanip>\n#include <utility>\n#include <tuple>\n#include <functional>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <stdio.h>\n#include <time.h>\n#include <numeric>\n#include <random>\n#include <unordered_set>\n#include <unordered_map>\n#define all(a) (a).begin(), (a).end()\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define req(i, a, b) for (ll i = (a); i < (b); i++)\n#define pb push_back\n#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\\n'\n#define debug2(x, y) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << '\\n'\n#define debug3(x, y, z) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << ',' << #z << ':' << (z) << '\\n'\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> Q;\ntemplate<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using pri_b = priority_queue<T>;\nconstexpr int inf = 1000000010;\nconstexpr int inf2 = 2000000010;\nconstexpr ll INF = 1000000000000000010;\nconstexpr ll INF4 = 4000000000000000010;\nconstexpr int mod1e9 = 1000000007;\nconstexpr int mod998 = 998244353;\nconstexpr ld eps = 1e-12;\nconstexpr ld pi = 3.141592653589793238;\nconstexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };\nint dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };\nll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); }\nvoid fail() { cout << \"-1\\n\"; exit(0); } void no() { cout << \"No\\n\"; exit(0); }\ntemplate<class T> void er(T a) { cout << a << '\\n'; exit(0); }\ntemplate<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }\ntemplate<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }\ntemplate<class T, class U> ostream &operator << (ostream &s, const pair<T, U> &p) { s << p.first << ' ' << p.second; return s; }\n\nstruct fastio {\n\tfastio() {\n\t\tcin.tie(0); cout.tie(0);\n\t\tios::sync_with_stdio(false);\n\t\tcout << fixed << setprecision(20);\n\t\tcerr << fixed << setprecision(20);\n\t}\n}fastio_;\n\nnamespace library {\n\trandom_device seed_gen;\n\tmt19937_64 engine(seed_gen());\n\tll rnum(ll r) { return engine() % r; }\n\tll rnum(ll l, ll r) { return rnum(r - l) + l; }\n\tvector<ll> rvec(ll n, ll r) {\n\t\tvector<ll> res(n);\n\t\trep(i, n) res[i] = rnum(r);\n\t\treturn res;\n\t}\n\tvector<ll> rvec(ll n, ll l, ll r) {\n\t\tvector<ll> res(n);\n\t\trep(i, n) res[i] = rnum(l, r);\n\t\treturn res;\n\t}\n\tvector<vector<ll>> avec(ll n, ll l, ll r) {\n\t\tif (n == 0) return { {} };\n\t\tvector<vector<ll>> pre = avec(n - 1, l, r);\n\t\tvector<vector<ll>> res;\n\t\tfor (vector<ll> v : pre) {\n\t\t\tfor (int i = l; i < r; i++) {\n\t\t\t\tvector<ll> w = v;\n\t\t\t\tw.pb(i);\n\t\t\t\tres.pb(w);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tvector<vector<ll>> avec(ll n, ll r) { return avec(n, 0, r); }\n\tvector<vector<ll>> bvec(ll n, ll l, ll r) {\n\t\tif (n == 0) return { {} };\n\t\tvector<vector<ll>> pre = bvec(n - 1, l, r);\n\t\tvector<vector<ll>> res;\n\t\tfor (vector<ll> v : pre) {\n\t\t\tint b = l;\n\t\t\tif (!v.empty()) b = v.back();\n\t\t\tfor (int i = b; i < r; i++) {\n\t\t\t\tvector<ll> w = v;\n\t\t\t\tw.pb(i);\n\t\t\t\tres.pb(w);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tvector<vector<ll>> bvec(ll n, ll r) { return bvec(n, 0, r); }\n\ttemplate<class T> void shuf(vector<T> &v) { shuffle(all(v), engine); }\n}\n\nusing namespace library;\n\nconstexpr ll mod = mod1e9;\ntemplate <int mod> class modint {\npublic:\n\tint n;\n\tmodint() : n(0) {};\n\tmodint(ll n_) {\n\t\tn = n_ % mod;\n\t\tif (n < 0) n += mod;\n\t}\n\tmodint operator -() const { return n > 0 ? mod - n : -n; }\n\tbool operator == (const modint &m) const { return n == m.n; }\n\tbool operator != (const modint &m) const { return n != m.n; }\n\tmodint &operator += (const modint &m) { n += m.n; if (n >= mod) n -= mod; return *this; }\n\tmodint &operator -= (const modint &m) { n -= m.n; if (n < 0) n += mod; return *this; }\n\tmodint &operator *= (const modint &m) { n = ll(n) * m.n % mod; return *this; }\n\tmodint &operator /= (const modint &m) { n = ll(n) * modinv(m).n % mod; return *this; }\n\tmodint operator +(modint m) const { return modint(*this) += m; }\n\tmodint operator -(modint m) const { return modint(*this) -= m; }\n\tmodint operator *(modint m) const { return modint(*this) *= m; }\n\tmodint operator /(modint m) const { return modint(*this) /= m; }\n\tmodint &operator ++ () { *this += 1; return *this; }\n\tmodint operator ++ (int) { *this += 1; return *this - 1; }\n\tmodint &operator -- () { *this -= 1; return *this; }\n\tmodint operator -- (int) { *this -= 1; return *this + 1; }\n\tmodint pow(ll b) const {\n\t\tmodint res = 1, a = modint(*this);\n\t\twhile (b) {\n\t\t\tif (b & 1) res *= a;\n\t\t\ta *= a;\n\t\t\tb >>= 1;\n\t\t}\n\t\treturn res;\n\t}\n\tfriend istream &operator >> (istream &s, modint<mod> &a) { s >> a.n; return s; }\n\tfriend ostream &operator << (ostream &s, modint<mod> &a) { s << a.n; return s; }\n};\n\nusing mint = modint<mod>;\nvector<mint> fac, inv, facinv;\n\nmint modinv(mint x) {\n\tll a = x.n;\n\tif (a == 0) abort();\n\tif (a < (ll)inv.size()) return inv[a];\n\tll b = mod, u = 1, v = 0;\n\twhile (b) {\n\t\tll t = a / b;\n\t\ta -= t * b; swap(a, b);\n\t\tu -= t * v; swap(u, v);\n\t}\n\tmint res = u;\n\treturn res;\n}\n\nvoid modcalc(int n) {\n\tfac.resize(n); inv.resize(n); facinv.resize(n);\n\tfac[0] = 1; fac[1] = 1; inv[1] = 1;\n\tfacinv[0] = 1; facinv[1] = 1;\n\tfor (ll i = 2; i < n; i++) {\n\t\tfac[i] = fac[i - 1] * i;\n\t\tinv[i] = -inv[mod % i] * (mod / i);\n\t\tfacinv[i] = facinv[i - 1] * inv[i];\n\t}\n}\n\nmint comb(ll n, ll k) {\n\tif (n < 0 || k < 0 || n < k) return 0;\n\treturn fac[n] * facinv[k] * facinv[n - k];\n}\n\nmint perm(ll n, ll k) {\n\tif (n < 0 || k < 0 || n < k) return 0;\n\treturn fac[n] * facinv[n - k];\n}\n\nmint hom(ll n, ll k) {\n\tif (n < 0 || k < 0 || n == 0 && k > 0) return 0;\n\tif (n == 0 && k == 0) return 1;\n\treturn fac[n + k - 1] * facinv[k] * facinv[n - 1];\n}\n\ntemplate<class T> class segtree {\n\tint n;\n\tvector<T> data;\n\tT id = 0;\n\tT operation(T a, T b) { return max(a, b); }\npublic:\n\tsegtree(int _n) {\n\t\tn = 1;\n\t\twhile (n < _n + 2) n <<= 1;\n\t\tdata = vector<T>(2 * n, id);\n\t}\n\tsegtree(vector<T> vec) {\n\t\tint _n = vec.size();\n\t\tn = 1;\n\t\twhile (n < _n + 2) n <<= 1;\n\t\tdata = vector<T>(2 * n, id);\n\t\tfor (int i = 0; i < _n; i++) data[i + n] = vec[i];\n\t\tfor (int i = n - 1; i >= 1; i--) data[i] = operation(data[i << 1], data[i << 1 | 1]);\n\t}\n\tvoid change(int i, T x) {\n\t\ti += n;\n\t\tdata[i] = x;\n\t\twhile (i > 1) {\n\t\t\ti >>= 1;\n\t\t\tdata[i] = operation(data[i << 1], data[i << 1 | 1]);\n\t\t}\n\t}\n\tvoid add(int i, T x) { change(i, data[i + n] + x); }\n\tT get(int a, int b) {\n\t\tT left = id; T right = id;\n\t\ta += n; b += n;\n\t\twhile (a < b) {\n\t\t\tif (a & 1) left = operation(left, data[a++]);\n\t\t\tif (b & 1) right = operation(data[--b], right);\n\t\t\ta >>= 1; b >>= 1;\n\t\t}\n\t\treturn operation(left, right);\n\t}\n\tT get_all() { return data[1]; }\n\tT operator[](int i) { return data[i + n]; }\n};\n\nclass unionfind {\n\tvector<int> par;\n\tvector<int> sz;\n\tvector<int> val;\npublic:\n\tunionfind(int n) {\n\t\tpar = vector<int>(n);\n\t\tfor (int i = 0; i < n; i++) par[i] = i;\n\t\tsz = vector<int>(n, 1);\n\t\tval = vector<int>(n);\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x) return x;\n\t\telse return par[x] = find(par[x]);\n\t}\n\tint size(int x) { return sz[find(x)]; }\n\tbool same(int x, int y) { return find(x) == find(y); }\n\tvoid add(int x) { val[find(x)]++; }\n\tint get(int x) { return val[find(x)]; }\n\tvoid unite(int x, int y) {\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif (x == y) return;\n\t\tif (sz[x] < sz[y]) {\n\t\t\tpar[x] = y;\n\t\t\tsz[y] += sz[x];\n\t\t\tval[y] += val[x];\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tsz[x] += sz[y];\n\t\t\tval[x] += val[y];\n\t\t}\n\t}\n};\n\ntemplate<class T> vector<int> compress(vector<T> vec) {\n\tint vecsize = vec.size();\n\tvector<T> tmpvec = vec;\n\tsort(tmpvec.begin(), tmpvec.end());\n\ttmpvec.erase(unique(tmpvec.begin(), tmpvec.end()), tmpvec.end());\n\tvector<int> res(vecsize);\n\tfor (int i = 0; i < vecsize; i++) res[i] = lower_bound(tmpvec.begin(), tmpvec.end(), vec[i]) - tmpvec.begin();\n\treturn res;\n}\n\nint main() {\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) return 0;\n\t\tint ans = 0;\n\t\treq(i, 1, 1001) {\n\t\t\treq(j, i + 1, 1001) {\n\t\t\t\tint v = (i + j) * (j - i + 1) / 2;\n\t\t\t\tif (n == v) ans++;\n\t\t\t}\n\t\t}\n\t\tcout << ans << '\\n';\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3464,"score_of_the_acc":-1.1706,"final_rank":20},{"submission_id":"aoj_2197_6026902","code_snippet":"/* ICPC */\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef long double ld;\ntypedef pair<ll,ll> pint;\nconst ll MOD = 1000000007;\nconst ll INF = 1e16;\n#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)\n#define Rep(i, s, t) for(ll i = (ll)(s); i < (ll)(t); i++)\n#define ALL(a) (a).begin(),(a).end()\n#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\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\nbool Ret(ll a = 0, ll b = 0, ll c = 0, ll d = 0) {\n if (a == 0 && b == 0 && c == 0 && d == 0) return true;\n else return false;\n}\n\n/* 累積和 */\n\nvector<ll> acc_sum(vector<ll> v, ll ind = 1, bool rev = false) {\n ll n = v.size();\n if (rev) reverse(ALL(v));\n if (ind == 1) {\n vector<ll> ans(n + 1, 0);\n rep(i, n) ans[i + 1] = ans[i] + v[i];\n if (rev) reverse(ALL(ans));\n return ans;\n } else if (ind == 0) {\n vector<ll> ans(n, 0);\n rep(i, n) {\n if (i == 0) ans[i] = v[i];\n else ans[i] = ans[i - 1] + v[i];\n }\n if (rev) reverse(ALL(ans));\n return ans;\n }\n vector<ll> ans(n, INF);\n return ans;\n}\n\nvector<vector<ll>> two_acc_sum(vector<vector<ll>> v) {\n ll h = v.size();\n ll w = v[0].size();\n vector<vector<ll>> ans(h + 1, vector<ll>(w + 1, 0));\n rep(i, h) rep(j, w) ans[i + 1][j + 1] = ans[i][j + 1] + ans[i + 1][j] - ans[i][j] + v[i][j];\n return ans;\n}\n/* 空の配列でRE */\n\n\nint main() {\n IOS;\n vector<ll> V(1010);\n rep(i, 1010) V[i] = i+1;\n vector<ll> SUM = acc_sum(V, 1);\n while(1) {\n ll N; cin >> N;\n if(N == 0) break;\n ll ans = 0;\n rep(i, 1001) {\n Rep(j, i+1, 1001) {\n if(SUM[j] - SUM[i] == N && j - i > 1) {\n ans++;\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3316,"score_of_the_acc":-1.1166,"final_rank":19},{"submission_id":"aoj_2197_6026387","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long double ld;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\ntypedef vector<int> vi;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<long long> vll;\ntypedef vector<double> vd;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define repll(i, n) for (long long int i = 0; i < n; i++)\n#define fin(ans) cout << (ans) << endl\n#define P 1000000007\n#define STI(s) atoi(s.c_str()) // string to int\n#define mp(p, q) make_pair(p, q)\n#define All(a) a.begin(), a.end()\n#define Sort(a) sort(a.begin(), a.end())\n\n/////////////////////////////////////////\n\nint main(void) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n /////////////////////////////////////////////////////\n\n int n; \n vll sum(1000);\n rep(i, 1000) {\n if (i != 0) sum[i] += sum[i - 1] + i;\n }\n\n while (cin >> n) {\n int count = 0;\n if (n == 0) break;\n rep(i, n - 1) {\n for (int j = i + 1; j < n; j++) {\n if ((sum[j] - sum[i]) == n) {\n count++;\n }\n }\n }\n cout << count << endl;\n }\n\n //////////////////////////////////////////////////////\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3116,"score_of_the_acc":-0.0437,"final_rank":3},{"submission_id":"aoj_2197_6007349","code_snippet":"#include <algorithm> \n#include <cstdio>\n#include <iostream>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\nusing namespace std;\ntypedef long long int ll;\ntypedef long double ld;\nconst ll MOD = 1000000007;\nconst int INF = 1001001001;\nconst ld PI = 3.14159265358979323846;\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define Sort(Array) sort(Array.begin(), Array.end())\n#define Reverse(a) reverse(a.begin(), a.end())\n#define out(ans) cout << ans << endl;\ntemplate<class T> bool chmax(T &a, const T& b) {if (a < b) {a = b; return false;} return false;};\ntemplate<class T> bool chmin(T &a, const T& b) {if (a > b) {a = b; return false;} return false;};\ntemplate<class T> void printVec(const vector<T> V) {for (int i = 0; i < V.size() - 1; ++i) {cout << V[i] << ' ';}cout << V[V.size()-1] << endl;};\ntemplate<class T> void printVec2(const vector<vector<T>> V2) {for (vector<int> V : V2) {printVec(V);}};\nll gcd(ll a, ll b) {if (a < b) swap(a, b); if (a % b == 0) return b; return gcd(b, a%b);};\nll lcm(ll a, ll b) {return a/gcd(a,b)*b;};\n// prime\nbool isPrime(ll N) {if (N < 2) return false; for (ll i = 2; i*i <= N; ++i) {if (N % i == 0) return false;}return true;};\n// MOD\nvoid modAdd(ll& a, ll b) {a = (a + b) % MOD;};\nvoid modSub(ll& a, ll b) {a = (a - b) % MOD; if(a < 0) a += MOD;};\nll modPow(ll x, ll n) {ll res = 1;while(n > 0) {if (n & 1) res = res * x % MOD; x = x * x % MOD; n >>= 1;} return res;};\nll modInv(ll a) {return modPow(a, MOD-2);};\nll digitSum(ll N) {string S = to_string(N); ll res = 0; rep(i,S.size()) res += (S[i] - '0'); return res;};\n\n\nint main() {\n\n vector<int> ans;\n while(true) {\n int n; cin >> n;\n if (n == 0) break;\n int cnt = 0;\n for (int a = 1; a < n; ++a) {\n for (int b = a + 1; b < n; ++b) {\n int s = (a + b) * (b - a + 1) / 2;\n if (s == n) ++cnt;\n }\n }\n ans.push_back(cnt);\n }\n for (auto a : ans) cout << a << endl;\n\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3292,"score_of_the_acc":-0.1079,"final_rank":8},{"submission_id":"aoj_2197_5958305","code_snippet":"#include<iostream>\n#include<iomanip>\n#include<cassert>\n#include<math.h>\n#include<complex>\n#include<algorithm>\n#include<utility>\n#include<queue>\n#include<string.h>\n#include<string>\n#include<set>\n#include<map>\n#include<unordered_map>\n#include<functional>\n#include<vector>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> LL;\nconst ll INF=2e18;\nconst ll MOD=1e9+7;\nconst double EPS=1e-9;\nvoid ChMin(ll& x, ll y){\n x=min(x,y);\n}\nvoid ChMax(ll& x, ll y){\n x=max(x,y);\n}\n\nll N;\nint main(){\n while( cin>>N,N!=0){\n ll ans=0;\n for(ll l=1;l<=N;l++){\n for(ll r=l+1;r<=N;r++){\n ans+= ( ( (l+r)*(r-l+1) ) / 2 ==N);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3416,"score_of_the_acc":-0.1531,"final_rank":13},{"submission_id":"aoj_2197_5958304","code_snippet":"//#pragma once\n#define _CRT_SECURE_NO_WARNINGS\n\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <iostream>\n#include <queue>\n#include <algorithm>\n#include <sstream>\n#include <vector>\n#include <math.h>\n#include <set>\n#include <map>\n#include <unordered_map>\n#include <numeric>\n#include <bitset>\n#include <iomanip>\n#include <cctype>\n#include <cstdlib> // srand,rand\n#include <random>\n#include <functional>\n#include <list>\n#include <stack>\n\n\n\n\nusing namespace std;\n#define ll long long\n#define ll128 long long\n#define lp(i,n) for(ll i=0;i<n;i++)\n\n#define modd 1000000007\n#define mod2 998244353\nconst double EPS = 1e-20;\nconst double PI = acos(-1);\n\n#define INF 8223372036854775807ll\n#define ALL(a) (a).begin(),(a).end()\n\n\ntypedef pair<long long, long long> pl;\ntypedef pair<long long, pl> lpl;\ntypedef pair<double, double> pd;\ntypedef pair<ll, string> pls;\n\n\n\ntypedef string::const_iterator State;\nclass ParseError {};\n\n\n\n/*\nclass SegmentTree {\n\n\n\nprivate:\n\n\tll cont_num = 2;\n\tpd initial_v;\n\tvector<pd> dat;\n\n\npublic:\n\n\n\tSegmentTree() {};\n\n\n\tvoid init(ll size, double initial_value_first, double initial_value_second) {\n\n\t\tcont_num = 2;\n\t\tinitial_v.first = initial_value_first;\n\t\tinitial_v.second = initial_value_second;\n\n\t\twhile (cont_num < size) {\n\t\t\tcont_num *= 2;\n\t\t}\n\n\t\tdat.resize(2 * cont_num);//サイズ設定\n\n\t\tfor (int i = 0; i < 2 * cont_num; i++)dat[i] = initial_v;//初期化\n\n\n\n\t}\n\n\n\tvoid Update(ll position, double value_f, double value_s) {\n\n\n\n\t\tll k = cont_num + position;\n\n\t\tdat[k].first = value_f;\n\t\tdat[k].second = value_s;\n\n\t\twhile (k > 1) {\n\t\t\tk /= 2;\n\t\t\tdat[k].first = dat[k * 2 + 1].first * dat[k * 2].first;\n\t\t\tdat[k].second = dat[k * 2 + 1].first * dat[k * 2].second + dat[k * 2 + 1].second;\n\n\n\t\t}\n\n\n\t}\n\n\t/*\n\tll query_proces(ll a, ll b, ll k, ll l, ll r) {\n\n\t\tif (r <= a || b <= l)return initial_v;\n\n\t\tif (a <= l && r <= b)return dat[k];\n\t\telse {\n\t\t\tll vl = query_proces(a, b, k * 2, l, (l + r) / 2);\n\t\t\tll vr = query_proces(a, b, k * 2 + 1, (l + r) / 2, r);\n\t\t\treturn min(vl, vr);\n\t\t}\n\n\t}\n\n\n\tll query(ll left, ll right) {\n\t\treturn query_proces(left, right, 1, 0, cont_num);\n\t}\n\t*/\n\t/*\n\t\tdouble query() {\n\t\t\treturn dat[1].first + dat[1].second;\n\t\t}\n\n\t};*/\n\n\ntemplate <typename T>\nclass Zip {\n\tvector<T> d;\n\tbool flag;\n\tvoid init() {\n\t\tsort(d.begin(), d.end());\n\t\td.erase(unique(d.begin(), d.end()), d.end());\n\t\tflag = false;\n\t}\npublic:\n\tZip() {\n\t\tflag = false;\n\t}\n\tvoid add(T x) {\n\t\td.push_back(x);\n\t\tflag = true;\n\t}\n\tll getNum(T x) {\n\t\tif (flag) init();\n\t\treturn lower_bound(d.begin(), d.end(), x) - d.begin();\n\t}\n\n\tT getVal(ll num) {\n\t\treturn d[num];\n\t}\n\n\tll size() {\n\t\tif (flag) init();\n\t\treturn (ll)d.size();\n\t}\n};\n\n\n\n\ntypedef struct ST\n{\n\tll first;\n\tll second;\n\tll cost;\n\n\tbool operator<(const ST& another) const\n\t{\n\t\treturn cost < another.cost;//比較\n\t};\n\n\tbool operator>(const ST& another) const\n\t{\n\t\treturn cost > another.cost;//比較\n\t};\n\n}ST;\n//queue<ST> qst;\npriority_queue<ST, vector<ST>, greater<ST> > qst;\n\n\n\n/*vector <ST> vst;\nST st[200005];\nST bufst;\nbitset<5000> bits;*/\n\n\nlong long modinv(long long aa, long long mm) {\n\tlong long bb = mm, uu = 1, vv = 0;\n\twhile (bb) {\n\t\tlong long tt = aa / bb;\n\t\taa -= tt * bb; swap(aa, bb);\n\t\tuu -= tt * vv; swap(uu, vv);\n\t}\n\tuu %= mm;\n\tif (uu < 0) uu += mm;\n\treturn uu;\n}\n\n\n\n\n\nll zettai(ll aa) {\n\n\tif (aa < 0) {\n\t\taa *= -1;\n\t}\n\treturn aa;\n\n}\n\nfloat zettai(float aa) {\n\n\tif (aa < 0) {\n\t\taa *= -1;\n\t}\n\treturn aa;\n\n}\n\ndouble zettai(double aa) {\n\n\tif (aa < 0) {\n\t\taa *= -1;\n\t}\n\treturn aa;\n\n}\n\n\n/*\nclass UnionFind\n{\n\npublic:\n\n\n\tvector <ll>pairent;\n\tvector <ll>depth;\n\tvector <ll>size;\n\n\n\tUnionFind(ll Amount) : pairent(Amount, 1), depth(Amount, 1), size(Amount, 1) {\n\n\t\tfor (ll i = 0; i < Amount; i++) {\n\t\t\tpairent[i] = i;\n\t\t}\n\n\n\t}\n\n\n\tll FindPairent(ll x) {\n\t\tif (pairent[x] == x)return x;\n\t\telse return pairent[x] = FindPairent(pairent[x]);\n\n\t}\n\n\n\tll Merge(ll x, ll y) {\n\t\tx = FindPairent(x);\n\t\ty = FindPairent(y);\n\n\t\tif (x != y) {\n\t\t\tif (depth[x] > depth[y]) {\n\t\t\t\tpairent[y] = pairent[x];\n\t\t\t\treturn size[x] += size[y];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpairent[x] = pairent[y];\n\t\t\t\tif (depth[x] == depth[y]) {\n\t\t\t\t\tdepth[y] ++;\n\t\t\t\t}\n\n\t\t\t\treturn size[y] += size[x];\n\t\t\t}\n\n\t\t}\n\t\telse {\n\t\t\treturn -1;\n\t\t}\n\n\n\n\t}\n\n\n\n\tbool IsSame(ll x, ll y) {\n\t\tif (FindPairent(x) == FindPairent(y))return true;\n\t\telse return false;\n\t}\n\n\n\tll GetSize(ll x) {\n\t\tx = FindPairent(x);\n\t\treturn size[x];\n\t}\n\n\n};\n*/\n\n\n\ntemplate <typename T>\nclass RollingHash {\n\nprivate:\n\tvector<T> all_array;\n\tvector<T> sub_array;\n\tvector<bool> match_flag;\n\tvector<ll128> ruijou;\n\tll match_count = 0;\n\tvector<ll>match_place;\n\npublic:\n\n\tvoid Clear() {\n\t\tall_array.clear();\n\t\tsub_array.clear();\n\t\tmatch_flag.clear();\n\t\tmatch_place.clear();\n\t}\n\n\tRollingHash() {\n\t\tClear();\n\t}\n\n\tvoid AddAllArray(T factor) {\n\t\tall_array.push_back(factor);\n\t}\n\n\tvoid AddSubArray(T factor) {\n\t\tsub_array.push_back(factor);\n\t}\n\n\tvoid Calculate_Ruijou(ll128 tei, ll max_num, ll128 mod) {\n\t\truijou.clear();\n\t\truijou.push_back(1);\n\t\tif (max_num > 0) {\n\t\t\twhile (ruijou.size() < max_num + 1) {\n\t\t\t\truijou.push_back(ruijou.back() * tei % mod);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tll128 GetSubHash(ll128 b, ll128 mod) {\n\t\tll128 ans = 0;\n\t\tCalculate_Ruijou(b, sub_array.size(), mod);\n\t\tfor (ll i = 0; i < sub_array.size(); i++) {\n\t\t\tans += (sub_array[i] % mod) * ruijou[sub_array.size() - 1 - i] % mod;\n\t\t\tans %= mod;\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tll128 GetAllHashInit(ll128 b, ll128 mod) {\n\t\tll128 ans = 0;\n\t\tfor (ll i = 0; i < sub_array.size(); i++) {\n\t\t\tans += (all_array[i] % mod) * ruijou[sub_array.size() - 1 - i] % mod;\n\t\t\tans %= mod;\n\t\t}\n\n\t\treturn ans;\n\t}\n\n\tvoid CheckMatchFlag() {\n\t\tmatch_place.clear();\n\t\tmatch_count = 0;\n\t\tfor (ll i = 0; i < match_flag.size(); i++) {\n\t\t\tif (match_flag[i] == true) {\n\t\t\t\tmatch_count++;\n\t\t\t\tmatch_place.push_back(i);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Rolling(ll128 b, ll128 mod) {\n\t\tll128 sub_hash = GetSubHash(b, mod);\n\t\tll128 all_hash = GetAllHashInit(b, mod);\n\n\t\tif (sub_hash != all_hash) {\n\t\t\tmatch_flag[0] = false;\n\t\t}\n\n\t\tfor (ll i = 1; i < match_flag.size(); i++) {\n\t\t\tall_hash = (all_hash * b % mod - all_array[i - 1] % mod * ruijou[sub_array.size()] % mod + all_array[i + sub_array.size() - 1] % mod) % mod;\n\t\t\twhile (all_hash < 0)all_hash += mod;\n\t\t\tall_hash %= mod;\n\t\t\tif (all_hash != sub_hash)match_flag[i] = false;\n\t\t}\n\t}\n\n\tvoid Match() {\n\t\tll128 b = 3;\n\t\t//ll128 mod = 999999999999999989;\n\t\tll128 mod = 1000000007;\n\t\tll128 sub_hash = GetSubHash(b, mod);\n\n\t\tif (sub_array.size() <= all_array.size()) {\n\n\t\t\twhile (match_flag.size() < all_array.size()) {\n\t\t\t\tmatch_flag.push_back(true);\n\t\t\t}\n\n\t\t\twhile (match_flag.size() > all_array.size() - sub_array.size() + 1) {\n\t\t\t\tmatch_flag.pop_back();\n\t\t\t}\n\n\n\t\t\tRolling(b, mod);\n\n\t\t\tb = 5;\n\t\t\tmod = mod2;\n\n\t\t\tRolling(b, mod);\n\n\t\t\tb = 7;\n\t\t\tmod = modd;\n\n\t\t\tRolling(b, mod);\n\n\t\t\tb = mod2;\n\t\t\tmod = modd;\n\n\t\t\tRolling(b, mod);\n\n\t\t\tCheckMatchFlag();\n\n\t\t}\n\n\n\n\t}\n\n\tll GetMatchCount() {\n\t\treturn match_count;\n\t}\n\n\tll GetMatchPlace(ll num) {\n\t\tif (num >= match_place.size())return -1;\n\t\telse return match_place[num];\n\t}\n\n};\n\n\n\nclass UnionFind\n{\n\npublic:\n\n\tvector <ll>pairent;\n\tvector <ll>depth;\n\tvector <ll>size;\n\n\tUnionFind(ll Amount) : pairent(Amount, 1), depth(Amount, 1), size(Amount, 1) {\n\n\t\tfor (ll i = 0; i < Amount; i++) {\n\t\t\tpairent[i] = i;\n\t\t}\n\t}\n\n\n\tll FindPairent(ll x) {\n\t\tif (pairent[x] == x)return x;\n\t\telse return pairent[x] = FindPairent(pairent[x]);\n\t}\n\n\n\tll Merge(ll x, ll y) {\n\t\tx = FindPairent(x);\n\t\ty = FindPairent(y);\n\n\t\tif (x != y) {\n\t\t\tif (depth[x] > depth[y]) {\n\t\t\t\tpairent[y] = pairent[x];\n\t\t\t\treturn size[x] += size[y];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpairent[x] = pairent[y];\n\t\t\t\tif (depth[x] == depth[y]) {\n\t\t\t\t\tdepth[y] ++;\n\t\t\t\t}\n\t\t\t\treturn size[y] += size[x];\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\n\n\tbool IsSame(ll x, ll y) {\n\t\tif (FindPairent(x) == FindPairent(y))return true;\n\t\telse return false;\n\t}\n\n\n\tll GetSize(ll x) {\n\t\tx = FindPairent(x);\n\t\treturn size[x];\n\t}\n\n\n};\n\n\n\n\nstruct Edge\n{\n\tll a, b, cost;\n\n\n\tbool operator<(const Edge& other) const {\n\t\treturn cost < other.cost;\n\t}\n};\n\nstruct Graph\n{\n\tll n; // 頂点数\n\tvector<Edge> es; // 辺集合\n};\n\nclass Kruskal {\n\n\tGraph origin_G;\n\tGraph MST;\n\tll total_cost = 0;\n\npublic:\n\n\tvoid Solve() {\n\t\tUnionFind uf = UnionFind(MST.n);\n\t\tfor (ll i = 0; i < origin_G.es.size(); i++) {\n\t\t\tll a = origin_G.es[i].a;\n\t\t\tll b = origin_G.es[i].b;\n\t\t\tll cost = origin_G.es[i].cost;\n\n\t\t\tif (!uf.IsSame(a, b)) {\n\t\t\t\tuf.Merge(a, b);\n\t\t\t\tMST.es.push_back(origin_G.es[i]);\n\t\t\t\ttotal_cost += cost;\n\t\t\t}\n\t\t}\n\t}\n\n\tKruskal(Graph graph) {\n\t\torigin_G = graph;\n\t\tMST = graph;\n\t\tMST.es.clear();\n\t\tsort(origin_G.es.begin(), origin_G.es.end());\n\t}\n\n\tll GetMinCost() {\n\t\treturn total_cost;\n\t}\n\n};\n\n\nll RepeatSquaring(ll N, ll P, ll M) {\n\tif (P == 0) return 1;\n\tif (P % 2 == 0) {\n\t\tll t = RepeatSquaring(N, P / 2, M) % M;\n\t\treturn t * t % M;\n\t}\n\treturn N * RepeatSquaring(N, P - 1, M) % M;\n}\n\n/*\nll KurikaesiNijou(ll a, ll b, ll P) {\n\n\tif (b == 0)return 1;\n\tif (b % 2 == 0) {\n\t\tll c=KurikaesiNijou(a,b/2,P)%P;\n\t\treturn c * c %P;\n\t}\n\telse {\n\t\tll c = KurikaesiNijou(a, b/2, P) % P;\n\t\treturn a * c * c % P;\n\t}\n\n}*/\n\n\n\n\nll GCD(ll a, ll b) {\n\tif (a % b == 0)return b;\n\telse return GCD(b, a % b);\n}\n\nll Min(ll a, ll b) {\n\tif (a < b)return a;\n\telse return b;\n}\n\nll Max(ll a, ll b) {\n\tif (a > b)return a;\n\telse return b;\n}\n\nll Sum(ll a, ll b) {\n\treturn a + b;\n}\n\nll Add(ll a, ll b) {\n\treturn a + b;\n}\n\ntemplate <typename T>\nclass SegmentTree {\n\tll n;\n\tvector<T> node;\n\tfunction<T(T, T)> fun, fun2;\n\tbool customChange;\n\tT outValue, initValue;\npublic:\n\tvoid init(ll num, function<T(T, T)> resultFunction, T init, T out, function<T(T, T)> changeFunction = NULL) {\n\t\t// changeFunction: (input, beforevalue) => newvalue\n\t\tfun = resultFunction;\n\t\tfun2 = changeFunction;\n\t\tcustomChange = changeFunction != NULL;\n\t\tn = 1;\n\t\twhile (n < num) n *= 2;\n\t\tnode.resize(2 * n - 1);\n\t\tfill(node.begin(), node.end(), init);\n\t\toutValue = out;\n\t\tinitValue = init;\n\t}\n\tvoid valueChange(ll num, T value) {\n\t\tnum += n - 1;\n\t\tif (customChange) node[num] = fun2(value, node[num]);\n\t\telse node[num] = value;\n\t\twhile (num > 0) num = (num - 1) / 2, node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);\n\t}\n\tT rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)\n\t\tif (r == -1) r = n;\n\t\tif (a <= l && r <= b) return node[k];\n\t\tif (b <= l || r <= a) return outValue;\n\t\tll mid = (l + r) / 2;\n\t\treturn fun(rangeQuery(a, b, l, mid, 2 * k + 1), rangeQuery(a, b, mid, r, 2 * k + 2));\n\t}\n};\n\n\nll extgcd(ll a, ll b, ll& x, ll& y) {\n\tif (b == 0) {\n\t\tx = 1;\n\t\ty = 0;\n\t\treturn a;\n\t}\n\tll gcd = extgcd(b, a % b, x, y);\n\tll oldX = x;\n\tx = y;\n\ty = oldX - a / b * y;\n\treturn gcd;\n}\n\n\nclass Combination {\n\n\tvector<ll> factorial;\n\tvector<ll> factorial_inv;\n\tll mod;\n\tll max_n;\n\n\npublic:\n\tvoid Init(ll init_max_n, ll init_mod) {\n\t\tmax_n = init_max_n;\n\t\tmod = init_mod;\n\t\tfactorial.resize(max_n + 1);\n\t\tfactorial[0] = 1;\n\t\tfor (ll i = 1; i < factorial.size(); i++) {\n\t\t\tfactorial[i] = factorial[i - 1] * i;\n\t\t\tfactorial[i] %= mod;\n\t\t}\n\n\t\tfactorial_inv.resize(max_n + 1);\n\t\tfactorial_inv[0] = 1;\n\t\tfor (ll i = 1; i < factorial_inv.size(); i++) {\n\t\t\tfactorial_inv[i] = factorial_inv[i - 1] * modinv(i, mod);\n\t\t\tfactorial_inv[i] %= mod;\n\t\t}\n\t}\n\n\n\n\tll GetComb(ll n, ll k) {\n\t\tif (n < k)return 0;\n\t\tif (k == 0)return 1;\n\n\t\tll comb = factorial[n];\n\t\tcomb *= factorial_inv[k];\n\t\tcomb %= mod;\n\t\tcomb *= factorial_inv[n - k];\n\t\tcomb %= mod;\n\t\treturn comb;\n\t}\n\n\tll GetH(ll n, ll k) {//n+k-1<=max_N\n\t\tll comb = factorial[n + k - 1];\n\t\tcomb *= factorial_inv[n];\n\t\tcomb %= mod;\n\t\tcomb *= factorial_inv[k - 1];\n\t\tcomb %= mod;\n\t\treturn comb;\n\t}\n\n};\n\n\n\nclass Tree {\n\n\tll node_N;\n\tvector<ll> node;\n\tvector<vector<pl>> pass;\n\tll diameter = -1;\n\tvector<ll> dist_Diamieter[2];\n\n\tpl maxDist_Num;\n\npublic:\n\n\n\tvoid Init(ll node_Num) {\n\t\tnode_N = node_Num;\n\t\tnode.resize(node_N + 1);\n\t\tpass.resize(node_N + 1);\n\n\t\tdist_Diamieter[0].resize(node_N + 1);\n\t\tlp(i, node_N + 1)dist_Diamieter[0][i] = -1;\n\t\tdist_Diamieter[1].resize(node_N + 1);\n\t\tlp(i, node_N + 1)dist_Diamieter[1][i] = -1;\n\t}\n\n\tvoid AddEdge(ll a, ll b, ll dist) {\n\t\tpl bufpl;\n\t\tbufpl.first = b;\n\t\tbufpl.second = dist;\n\t\tpass[a].push_back(bufpl);\n\t\tbufpl.first = a;\n\t\tpass[b].push_back(bufpl);\n\t}\n\n\n\tvoid DFS(ll step, ll now, ll dist) {\n\n\t\tdist_Diamieter[step][now] = dist;\n\t\tif (dist_Diamieter[step][now] > maxDist_Num.first) {\n\t\t\tmaxDist_Num.first = dist_Diamieter[step][now];\n\t\t\tmaxDist_Num.second = now;\n\t\t}\n\n\t\tfor (ll i = 0; i < pass[now].size(); i++) {\n\t\t\tll next_node = pass[now][i].first;\n\t\t\tif (dist_Diamieter[step][next_node] == -1) {\n\t\t\t\tDFS(step, next_node, dist + pass[now][i].second);\n\t\t\t}\n\t\t}\n\t}\n\n\tll GetDiameter(ll min_node_num) {\n\t\tif (diameter >= 0)return diameter;\n\t\telse {\n\t\t\tmaxDist_Num.first = -1;\n\t\t\tmaxDist_Num.second = -1;\n\t\t\tDFS(0, min_node_num, 0ll);\n\t\t\tll step2_start = maxDist_Num.second;\n\n\t\t\tmaxDist_Num.first = -1;\n\t\t\tmaxDist_Num.second = -1;\n\t\t\tDFS(1, step2_start, 0ll);\n\n\t\t\tdiameter = maxDist_Num.first;\n\t\t\treturn diameter;\n\t\t}\n\t}\n\n\tll GetDistFromMinNode(ll num) {\n\t\treturn dist_Diamieter[0][num];\n\t}\n\n};\n\n\n\n\nstruct LDE {\n\tll a, b, c, x, y;\n\tll m = 0;\n\tbool check = true;//解が存在するか\n\n\t//初期化\n\tLDE(ll a_, ll b_, ll c_) : a(a_), b(b_), c(c_) {\n\t\tll g = GCD(a, b);\n\t\tif (c % g != 0) {\n\t\t\tcheck = false;\n\t\t}\n\t\telse {\n\t\t\t//ax+by=gの特殊解を求める\n\t\t\textgcd(abs(a), abs(b), x, y);\n\t\t\tif (a < 0)x = -x;\n\t\t\tif (b < 0)y = -y;\n\t\t\t//ax+by=cの特殊解を求める(オーバフローに注意！)\n\t\t\tx *= c / g; y *= c / g;\n\t\t\t//一般解を求めるために割る\n\t\t\ta /= g; b /= g;\n\t\t}\n\t}\n\n\t//拡張ユークリッドの互除法\n\t//返り値:aとbの最大公約数\n\tll extgcd(ll a, ll b, ll& x0, ll& y0) {\n\t\tif (b == 0) {\n\t\t\tx0 = 1;\n\t\t\ty0 = 0;\n\t\t\treturn a;\n\t\t}\n\t\tll d = extgcd(b, a % b, y0, x0);\n\t\ty0 -= a / b * x0;\n\t\treturn d;\n\t}\n\n\t//パラメータmの更新(書き換え)\n\tvoid m_update(ll m_) {\n\t\tx += (m_ - m) * b;\n\t\ty -= (m_ - m) * a;\n\t\tm = m_;\n\t}\n};\n\n\n/*\ntemplate< typename Monoid >\nstruct SegmentTreee {\n\tusing F = function< Monoid(Monoid, Monoid) >;\n\n\tint sz;\n\tvector< Monoid > seg;\n\n\tconst F f;\n\tconst Monoid M1;\n\n\tSegmentTreee(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\n\t\tsz = 1;\n\t\twhile (sz < n) sz <<= 1;\n\t\tseg.assign(2 * sz, M1);\n\t}\n\n\tvoid set(int k, const Monoid& x) {\n\t\tseg[k + sz] = x;\n\t}\n\n\tvoid build() {\n\t\tfor (int k = sz - 1; k > 0; k--) {\n\t\t\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n\t\t}\n\t}\n\n\tvoid update(int k, const Monoid& x) {\n\t\tk += sz;\n\t\tseg[k] = x;\n\t\twhile (k >>= 1) {\n\t\t\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n\t\t}\n\t}\n\n\tMonoid query(int a, int b) {\n\t\tMonoid L = M1, R = M1;\n\t\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) L = f(L, seg[a++]);\n\t\t\tif (b & 1) R = f(seg[--b], R);\n\t\t}\n\t\treturn f(L, R);\n\t}\n\n\tMonoid operator[](const int& k) const {\n\t\treturn seg[k + sz];\n\t}\n\n\ttemplate< typename C >\n\tint find_subtree(int a, const C& check, Monoid& M, bool type) {\n\t\twhile (a < sz) {\n\t\t\tMonoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\n\t\t\tif (check(nxt)) a = 2 * a + type;\n\t\t\telse M = nxt, a = 2 * a + 1 - type;\n\t\t}\n\t\treturn a - sz;\n\t}\n\n\n\ttemplate< typename C >\n\tint find_first(int a, const C& check) {\n\t\tMonoid L = M1;\n\t\tif (a <= 0) {\n\t\t\tif (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\n\t\t\treturn -1;\n\t\t}\n\t\tint b = sz;\n\t\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) {\n\t\t\t\tMonoid nxt = f(L, seg[a]);\n\t\t\t\tif (check(nxt)) return find_subtree(a, check, L, false);\n\t\t\t\tL = nxt;\n\t\t\t\t++a;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\n\ttemplate< typename C >\n\tint find_last(int b, const C& check) {\n\t\tMonoid R = M1;\n\t\tif (b >= sz) {\n\t\t\tif (check(f(seg[1], R))) return find_subtree(1, check, R, true);\n\t\t\treturn -1;\n\t\t}\n\t\tint a = sz;\n\t\tfor (b += sz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (b & 1) {\n\t\t\t\tMonoid nxt = f(seg[--b], R);\n\t\t\t\tif (check(nxt)) return find_subtree(b, check, R, true);\n\t\t\t\tR = nxt;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n};\n\n*/\n\n\nvector<pair<long long, long long> > prime_factorize(long long N) {\n\tvector<pair<long long, long long> > res;\n\tfor (long long a = 2; a * a <= N; ++a) {\n\t\tif (N % a != 0) continue;\n\t\tlong long ex = 0;\n\t\twhile (N % a == 0) {\n\t\t\t++ex;\n\t\t\tN /= a;\n\t\t}\n\t\tres.push_back({ a, ex });\n\t}\n\tif (N != 1) res.push_back({ N, 1 });\n\treturn res;\n}\n\n\nCombination co;\ntypedef pair<int, int> pi;\npriority_queue<pl, vector<pl>, greater<pl> > pqpl;\n\n\npriority_queue<ll, vector<ll>, greater<ll> > pqll;\n\n\nll nck(ll n, ll k, ll m) {\n\tll ans = 1;\n\tll pre_ans = 1;\n\tif (k == 0)return 1;\n\tfor (ll i = 1; i <= k; i++) {\n\t\tpre_ans = ans;\n\t\tans = pre_ans * (n - i + 1);\n\t\tans %= m;\n\t\tans *= modinv(i, m);\n\t\tans %= modd;\n\t}\n\treturn ans;\n}\n\nll N,M,K;\n\nll a, b;\nmap<ll,ll> llmap;\nvector<bool> vll;\n\nint main() {\n\twhile (true) {\n\t\tcin >> N;\n\t\tif (N == 0)break;\n\t\tll ans = 0;\n\t\tfor (ll i = 1; i < N; i++) {\n\t\t\tfor (ll j = i + 1; j < N; j++) {\n\t\t\t\tif ((i + j) * (j - i + 1) / 2 == N)ans++;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\t//cout << fixed << setprecision(12) << bb << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3124,"score_of_the_acc":-0.0466,"final_rank":4},{"submission_id":"aoj_2197_5936543","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define int long long\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define pb push_back\n#define ALL(obj) (obj).begin(), (obj).end()\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define pii pair<int, int>\n#define us unordered_set\n#define ud unordered_dict\n#define Lower_bound(vec, n) distance((vec).begin(), lower_bound((vec).begin(), (vec).end(), (n)))\n#define Upper_bound(vec, n) distance((vec).begin(), upper_bound((vec).begin(), (vec).end(), (n)))\n#define Erase(vec) (vec).erase(unique((vec).begin(), (vec).end()), (vec).end())\n//template <class T = int> in()(T x; cin >> x; return (x);)\n//template <class T> print(T& x) (cout << x << endl;)\n//using template <class T> vec = vector<T>;\nusing Graph = vector<vector<int>>;\nconst int INF = 1LL << 60;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n\nsigned main() {\n vi acc;\n int acc_sum = 0;\n FOR(i, 0, 1000) {\n acc_sum += i;\n acc.push_back(acc_sum);\n }\n\n int n;\n while (true) {\n cin >> n;\n if (n == 0) break;\n\n int ans = 0;\n for (int i = 1000; i >= 0; i--) {\n REP(j, i-1) {\n if (acc[i] - acc[j] == n) {\n //cout << \"acc[\" << i << \"]= \" << acc[i];\n //cout << \" acc[\" << j << \"]= \" << acc[j];\n //cout << \" ans = \" << ans << endl;\n ans++;\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3356,"score_of_the_acc":-0.4645,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2197_10641180\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// using namespace std;\\n\\nint main() {\\n while (true) {\\n int N;\\n std::cin >> N;\\n\\n if (N == 0)\\n break;\\n\\n int ans = 0;\\n\\n for (int i = 1; i <= N; i++)\\n for (int j = i + 1; j <= N; j++) {\\n int sum = (i + j) * (j - i + 1) / 2;\\n // std::cout << i << ' ' << j << \\\" \\\" << sum << std::endl;\\n ans += sum == N;\\n }\\n\\n std::cout << ans << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.1356,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2197_10557117\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n vector<int> cum(1001, 0);\\n for(int i = 1; i <= 1000; ++i) cum[i] = cum[i - 1] + i;\\n while(1){\\n int N; cin >> N;\\n if(N == 0) break;\\n\\n int ans = 0;\\n for(int i = 0; i < 1000; ++i){\\n for(int j = i + 2; j <= 1000; ++j){\\n if(cum[j] - cum[i] == N) ++ans;\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.4616,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2197_9417454\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define SIZE 1005\\nint main(){\\n int n;\\n while(true){\\n int sum[SIZE];\\n sum[0]=0;\\n int count=0;\\n\\n cin>>n;\\n if(n==0)break;\\n for(int i=1;i<n;i++){\\n sum[i]=sum[i-1]+i;\\n }\\n for(int i=1;i<n;i++){\\n for(int j=0;j<i;j++){\\n if((sum[i]-sum[j])==n)count++;\\n }\\n }\\n cout<<count<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2996,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2197_9295941\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\\nconst long long MOD1 = 1000000007;\\nconst long long MOD2 = 998244353;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst long long INF = 1e17;\\n\\nint main(){\\n while(true){\\n int n;\\n cin >> n;\\n if(n==0){\\n break;\\n }\\n\\n //sum[i] = 0~iまでの和\\n vector<int> sum(n+1);\\n for(int i=0;i<=n;i++){\\n sum[i] = i;\\n }\\n for(int i=1;i<=n;i++){\\n sum[i] += sum[i-1];\\n }\\n\\n int ans = 0;\\n //(l,r]の和\\n for(int l=0;l<=n;l++){\\n for(int r=l+2;r<=n;r++){\\n if(sum[r]-sum[l]==n){\\n ans++;\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3024,\n \"score_of_the_acc\": -0.0102,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2197_9258225\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n\\n#define all(v) v.begin(),v.end()\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing vll=vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing P = pair<ll,ll>;\\nusing vp=vector<pair<ll, ll>>;\\n//using mint=modint1000000007;\\n//using mint=modint998244353;\\n\\nconst ll INF=1ll<<60;\\nll mod10=1e9+7;\\nll mod99=998244353;\\nconst double PI = acos(-1);\\n\\n#define rep(i,n) for (ll i=0;i<n;++i)\\n#define per(i,n) for(ll i=n-1;i>=0;--i)\\n#define rep2(i,a,n) for (ll i=a;i<n;++i)\\n#define per2(i,a,n) for (ll i=a;i>=n;--i)\\n\\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\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while(1){\\n ll N;cin>>N;\\n if(N==0) break;\\n ll ans=0;\\n rep2(i,1,N){\\n ll sum=0;\\n rep(j,N+1){\\n sum+=i+j;\\n if(sum==N) ans++;\\n }\\n \\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.1312,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2197_9112663\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(a) a.begin(),a.end()\\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\\nconst long long mod = 1000000007;\\nconst long long INF = 1e18;\\n\\nint mt(int n) {\\n return n*(n+1)/2;\\n}\\n\\nint main() {\\n int n;\\n while (true) {\\n cin >> n;\\n if (!n) {\\n return 0;\\n }\\n int ans = 0;\\n \\n for (int i = 1; i < 501; i++) {\\n for (int j = i+1; j < 501; j++) {\\n if (mt(j)-mt(i-1) == n) {\\n ans++;\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.0496,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2197_9060304\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n int sum[1000];\\n sum[0] = 0;\\n for (int i = 1; i < 1000; i++) {\\n sum[i] = sum[i - 1] + i;\\n }\\n while (1) {\\n int n;\\n cin >> n;\\n if (n == 0) break;\\n int cnt = 0;\\n for (int i = 0; i < 1000; i++) {\\n for (int j = i + 2; j < 1000; j++) {\\n if (sum[j] - sum[i] == n) {\\n cnt++;\\n }\\n }\\n }\\n cout << cnt << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3004,\n \"score_of_the_acc\": -0.6696,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2197_8404143\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n map<int,int> ans;\\n for(int i=1;i<=499;i++){\\n for(int j=i+1;j<=500;j++){\\n int S = (i+j)*(j-i+1)/2;\\n ans[S]++;\\n }\\n }\\n for(;;){\\n int N;\\n cin >> N;\\n if(N == 0) break;\\n cout << ans[N] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5740,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2197_8158105\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <stdio.h>\\n#include <math.h>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <cassert>\\n#include <numeric>\\n\\n\\n\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define P pair<int, int>\\n\\n\\nint main() {\\n\\tint n;\\n\\tint ans = 0;\\n\\tvector<int>sum;\\n\\n\\tcin >> n;\\n\\twhile (n != 0) {\\n\\t\\tsum.push_back(0);\\n\\t\\trep(i, n) {\\n\\t\\t\\tsum.push_back(sum[i] + i+1);\\n\\t\\t}\\n\\t\\trep(i, sum.size()-1) {\\n\\t\\t\\tfor (int j = i + 1;j < sum.size();j++) {\\n\\t\\t\\t\\tif (sum[j] - sum[i] == n && j - i != 1)ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t\\tans = 0; \\n\\t\\tsum.clear();\\n\\t\\tcin >> n;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.0539,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2197_7908459\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve(){\\n int N;\\n cin>>N;\\n if(N==0)return false;\\n int ans=0;\\n vector<int>S(N+1);\\n for(int i=1;i<=N;i++){\\n S[i]=S[i-1]+i;\\n }\\n for(int i=0;i<N;i++)for(int j=i+2;j<=N;j++){\\n if(S[j]-S[i]==N)ans++;\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(1){\\n if(!solve()){\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.0554,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2197_7195576\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#pragma GCC optimize(\\\"Ofast\\\")\\n\\n// Begin Header {{{\\n#pragma region\\nusing namespace std;\\n\\n#ifndef DEBUG\\n#define dump(...)\\n#endif\\n\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)\\n#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)\\n#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)\\n#define var(Type, ...) \\\\\\n Type __VA_ARGS__; \\\\\\n input(__VA_ARGS__)\\n#define let const auto\\n\\nconstexpr size_t operator\\\"\\\"_zu(unsigned long long value) {\\n return value;\\n};\\nconstexpr intmax_t operator\\\"\\\"_jd(unsigned long long value) {\\n return value;\\n};\\nconstexpr uintmax_t operator\\\"\\\"_ju(unsigned long long value) {\\n return value;\\n};\\n\\nconstexpr int INF = 0x3f3f3f3f;\\nconstexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;\\n\\nusing usize = size_t;\\nusing imax = intmax_t;\\nusing uimax = uintmax_t;\\nusing ld = long double;\\n\\ntemplate <class T, class Compare = less<>>\\nusing MaxHeap = priority_queue<T, vector<T>, Compare>;\\ntemplate <class T, class Compare = greater<>>\\nusing MinHeap = priority_queue<T, vector<T>, Compare>;\\n\\ninline void input() {}\\ntemplate <class Head, class... Tail>\\ninline void input(Head&& head, Tail&&... tail) {\\n cin >> head;\\n input(forward<Tail>(tail)...);\\n}\\n\\ntemplate <class Container, class Value = typename Container::value_type,\\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\\ninline istream& operator>>(istream& is, Container& vs) {\\n for (auto& v: vs) is >> v;\\n return is;\\n}\\n\\ntemplate <class T, class U>\\ninline istream& operator>>(istream& is, pair<T, U>& p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ninline void output() {\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate <class Head, class... Tail>\\ninline void output(Head&& head, Tail&&... tail) {\\n cout << head;\\n if (sizeof...(tail)) cout << \\\" \\\";\\n output(forward<Tail>(tail)...);\\n}\\n\\ntemplate <class Container, class Value = typename Container::value_type,\\n enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>\\ninline ostream& operator<<(ostream& os, const Container& vs) {\\n static constexpr const char* delim[] = {\\\" \\\", \\\"\\\"};\\n for (auto it = begin(vs); it != end(vs); ++it) {\\n os << delim[it == begin(vs)] << *it;\\n }\\n return os;\\n}\\n\\ntemplate <class Iterator>\\ninline void join(const Iterator& Begin, const Iterator& End, const string& delim = \\\"\\\\n\\\",\\n const string& last = \\\"\\\\n\\\") {\\n for (auto it = Begin; it != End; ++it) {\\n cout << ((it == Begin) ? \\\"\\\" : delim) << *it;\\n }\\n cout << last;\\n}\\n\\ntemplate <class T>\\ninline vector<T> makeVector(const T& init_value, size_t sz) {\\n return vector<T>(sz, init_value);\\n}\\n\\ntemplate <class T, class... Args>\\ninline auto makeVector(const T& init_value, size_t sz, Args... args) {\\n return vector<decltype(makeVector<T>(init_value, args...))>(\\n sz, makeVector<T>(init_value, args...));\\n}\\n\\ntemplate <class Func>\\nclass FixPoint : Func {\\npublic:\\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\\n\\n template <class... Args>\\n constexpr decltype(auto) operator()(Args&&... args) const {\\n return Func::operator()(*this, std::forward<Args>(args)...);\\n }\\n};\\n\\ntemplate <class Func>\\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\\n return FixPoint<Func> {forward<Func>(f)};\\n}\\n\\ntemplate <class Container>\\nstruct reverse_t {\\n Container& c;\\n reverse_t(Container& c) : c(c) {}\\n auto begin() {\\n return c.rbegin();\\n }\\n auto end() {\\n return c.rend();\\n }\\n};\\n\\ntemplate <class Container>\\nauto reversed(Container& c) {\\n return reverse_t<Container>(c);\\n}\\n\\ntemplate <class T>\\ninline bool chmax(T& a, const T& b) noexcept {\\n return b > a && (a = b, true);\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T& a, const T& b) noexcept {\\n return b < a && (a = b, true);\\n}\\n\\ntemplate <class T>\\ninline T diff(const T& a, const T& b) noexcept {\\n return a < b ? b - a : a - b;\\n}\\n\\ntemplate <class T>\\ninline T sigma(const T& l, const T& r) noexcept {\\n return (l + r) * (r - l + 1) / 2;\\n}\\n\\ntemplate <class T>\\ninline T ceildiv(const T& n, const T& d) noexcept {\\n return (n + d - 1) / d;\\n}\\n\\nvoid operator|=(vector<bool>::reference lhs, const bool rhs) {\\n lhs = lhs | rhs;\\n}\\n\\nvoid operator&=(vector<bool>::reference lhs, const bool rhs) {\\n lhs = lhs & rhs;\\n}\\n\\nvoid operator^=(vector<bool>::reference lhs, const bool rhs) {\\n lhs = lhs ^ rhs;\\n}\\n\\nvoid ioinit() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n clog << fixed << setprecision(10);\\n}\\n#pragma endregion\\n// }}} End Header\\n\\nint main() {\\n ioinit();\\n\\n intmax_t N;\\n while (input(N), N) {\\n intmax_t res = 0;\\n repc(l, 1, N) repc(r, l + 1, N) {\\n res += sigma(l, r) == N;\\n }\\n output(res);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.1676,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2197_6638560\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// template {{{\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\n\\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\\n#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)\\n\\n#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)\\n#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)\\n\\n#define debug(x) cerr << \\\"(\\\" << __LINE__ << \\\")\\\" << #x << \\\": \\\" << (x) << endl\\n\\nconstexpr i32 inf = 1001001001;\\nconstexpr i64 infll = 1001001001001001001ll;\\n\\nconstexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; \\nconstexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};\\n\\nstruct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;\\n\\ntemplate <typename T = i64> T input() { T x; cin >> x; return x; }\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? \\\" \\\" : \\\"\\\"); } return os; } \\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }\\n\\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; return os; }\\ntemplate <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }\\n\\ntemplate <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }\\ntemplate <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }\\n\\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n// }}}\\n\\nvoid solve(int n) {\\n vector< int > rs(n);\\n whole(iota, rs, 0);\\n range(i, 1, rs.size()) rs[i] += rs[i - 1];\\n\\n int ans = 0;\\n range(r, 1, rs.size()) range(l, 0, r) {\\n if (rs[r] - rs[l] == n) ans++;\\n }\\n\\n cout << ans << endl;\\n}\\n\\nsigned main() {\\n int n;\\n\\n while (cin >> n, n) {\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.137,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2197_6619088\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\n\\n#define _overload(_1, _2, _3, _4, name, ...) name\\n#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)\\n#define _rep2(Itr, a, b) _rep3(Itr, a, b, 1)\\n#define _rep3(Itr, a, b, step) for (i64 Itr = a; Itr < b; Itr += step)\\n#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)\\n#define rep(...) repeat(__VA_ARGS__)\\n\\n#define ALL(X) begin(X), end(X)\\n\\nusing namespace std;\\nusing i64 = int64_t;\\nusing u64 = uint64_t;\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n i64 n;\\n while (cin >> n, n > 0) {\\n i64 ans = 0;\\n rep(i, 1, n + 1) {\\n rep(j, i + 2, n + 1) {\\n // [i, j)\\n if (n == j * (j - 1) / 2 - i * (i - 1) / 2) ans++;\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2197_6408637\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <iomanip>\\n#include <utility>\\n#include <tuple>\\n#include <functional>\\n#include <bitset>\\n#include <cassert>\\n#include <complex>\\n#include <stdio.h>\\n#include <time.h>\\n#include <numeric>\\n#include <random>\\n#include <unordered_set>\\n#include <unordered_map>\\n#define all(a) (a).begin(), (a).end()\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define req(i, a, b) for (ll i = (a); i < (b); i++)\\n#define pb push_back\\n#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\\\\n'\\n#define debug2(x, y) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << '\\\\n'\\n#define debug3(x, y, z) cerr << __LINE__ << ' ' << #x << ':' << (x) << ',' << #y << ':' << (y) << ',' << #z << ':' << (z) << '\\\\n'\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef pair<ll, ll> P;\\ntypedef pair<ll, P> Q;\\ntemplate<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using pri_b = priority_queue<T>;\\nconstexpr int inf = 1000000010;\\nconstexpr int inf2 = 2000000010;\\nconstexpr ll INF = 1000000000000000010;\\nconstexpr ll INF4 = 4000000000000000010;\\nconstexpr int mod1e9 = 1000000007;\\nconstexpr int mod998 = 998244353;\\nconstexpr ld eps = 1e-12;\\nconstexpr ld pi = 3.141592653589793238;\\nconstexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };\\nint dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };\\nll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); }\\nvoid fail() { cout << \\\"-1\\\\n\\\"; exit(0); } void no() { cout << \\\"No\\\\n\\\"; exit(0); }\\ntemplate<class T> void er(T a) { cout << a << '\\\\n'; exit(0); }\\ntemplate<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }\\ntemplate<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }\\ntemplate<class T, class U> ostream &operator << (ostream &s, const pair<T, U> &p) { s << p.first << ' ' << p.second; return s; }\\n\\nstruct fastio {\\n\\tfastio() {\\n\\t\\tcin.tie(0); cout.tie(0);\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcout << fixed << setprecision(20);\\n\\t\\tcerr << fixed << setprecision(20);\\n\\t}\\n}fastio_;\\n\\nnamespace library {\\n\\trandom_device seed_gen;\\n\\tmt19937_64 engine(seed_gen());\\n\\tll rnum(ll r) { return engine() % r; }\\n\\tll rnum(ll l, ll r) { return rnum(r - l) + l; }\\n\\tvector<ll> rvec(ll n, ll r) {\\n\\t\\tvector<ll> res(n);\\n\\t\\trep(i, n) res[i] = rnum(r);\\n\\t\\treturn res;\\n\\t}\\n\\tvector<ll> rvec(ll n, ll l, ll r) {\\n\\t\\tvector<ll> res(n);\\n\\t\\trep(i, n) res[i] = rnum(l, r);\\n\\t\\treturn res;\\n\\t}\\n\\tvector<vector<ll>> avec(ll n, ll l, ll r) {\\n\\t\\tif (n == 0) return { {} };\\n\\t\\tvector<vector<ll>> pre = avec(n - 1, l, r);\\n\\t\\tvector<vector<ll>> res;\\n\\t\\tfor (vector<ll> v : pre) {\\n\\t\\t\\tfor (int i = l; i < r; i++) {\\n\\t\\t\\t\\tvector<ll> w = v;\\n\\t\\t\\t\\tw.pb(i);\\n\\t\\t\\t\\tres.pb(w);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tvector<vector<ll>> avec(ll n, ll r) { return avec(n, 0, r); }\\n\\tvector<vector<ll>> bvec(ll n, ll l, ll r) {\\n\\t\\tif (n == 0) return { {} };\\n\\t\\tvector<vector<ll>> pre = bvec(n - 1, l, r);\\n\\t\\tvector<vector<ll>> res;\\n\\t\\tfor (vector<ll> v : pre) {\\n\\t\\t\\tint b = l;\\n\\t\\t\\tif (!v.empty()) b = v.back();\\n\\t\\t\\tfor (int i = b; i < r; i++) {\\n\\t\\t\\t\\tvector<ll> w = v;\\n\\t\\t\\t\\tw.pb(i);\\n\\t\\t\\t\\tres.pb(w);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tvector<vector<ll>> bvec(ll n, ll r) { return bvec(n, 0, r); }\\n\\ttemplate<class T> void shuf(vector<T> &v) { shuffle(all(v), engine); }\\n}\\n\\nusing namespace library;\\n\\nconstexpr ll mod = mod1e9;\\ntemplate <int mod> class modint {\\npublic:\\n\\tint n;\\n\\tmodint() : n(0) {};\\n\\tmodint(ll n_) {\\n\\t\\tn = n_ % mod;\\n\\t\\tif (n < 0) n += mod;\\n\\t}\\n\\tmodint operator -() const { return n > 0 ? mod - n : -n; }\\n\\tbool operator == (const modint &m) const { return n == m.n; }\\n\\tbool operator != (const modint &m) const { return n != m.n; }\\n\\tmodint &operator += (const modint &m) { n += m.n; if (n >= mod) n -= mod; return *this; }\\n\\tmodint &operator -= (const modint &m) { n -= m.n; if (n < 0) n += mod; return *this; }\\n\\tmodint &operator *= (const modint &m) { n = ll(n) * m.n % mod; return *this; }\\n\\tmodint &operator /= (const modint &m) { n = ll(n) * modinv(m).n % mod; return *this; }\\n\\tmodint operator +(modint m) const { return modint(*this) += m; }\\n\\tmodint operator -(modint m) const { return modint(*this) -= m; }\\n\\tmodint operator *(modint m) const { return modint(*this) *= m; }\\n\\tmodint operator /(modint m) const { return modint(*this) /= m; }\\n\\tmodint &operator ++ () { *this += 1; return *this; }\\n\\tmodint operator ++ (int) { *this += 1; return *this - 1; }\\n\\tmodint &operator -- () { *this -= 1; return *this; }\\n\\tmodint operator -- (int) { *this -= 1; return *this + 1; }\\n\\tmodint pow(ll b) const {\\n\\t\\tmodint res = 1, a = modint(*this);\\n\\t\\twhile (b) {\\n\\t\\t\\tif (b & 1) res *= a;\\n\\t\\t\\ta *= a;\\n\\t\\t\\tb >>= 1;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tfriend istream &operator >> (istream &s, modint<mod> &a) { s >> a.n; return s; }\\n\\tfriend ostream &operator << (ostream &s, modint<mod> &a) { s << a.n; return s; }\\n};\\n\\nusing mint = modint<mod>;\\nvector<mint> fac, inv, facinv;\\n\\nmint modinv(mint x) {\\n\\tll a = x.n;\\n\\tif (a == 0) abort();\\n\\tif (a < (ll)inv.size()) return inv[a];\\n\\tll b = mod, u = 1, v = 0;\\n\\twhile (b) {\\n\\t\\tll t = a / b;\\n\\t\\ta -= t * b; swap(a, b);\\n\\t\\tu -= t * v; swap(u, v);\\n\\t}\\n\\tmint res = u;\\n\\treturn res;\\n}\\n\\nvoid modcalc(int n) {\\n\\tfac.resize(n); inv.resize(n); facinv.resize(n);\\n\\tfac[0] = 1; fac[1] = 1; inv[1] = 1;\\n\\tfacinv[0] = 1; facinv[1] = 1;\\n\\tfor (ll i = 2; i < n; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i;\\n\\t\\tinv[i] = -inv[mod % i] * (mod / i);\\n\\t\\tfacinv[i] = facinv[i - 1] * inv[i];\\n\\t}\\n}\\n\\nmint comb(ll n, ll k) {\\n\\tif (n < 0 || k < 0 || n < k) return 0;\\n\\treturn fac[n] * facinv[k] * facinv[n - k];\\n}\\n\\nmint perm(ll n, ll k) {\\n\\tif (n < 0 || k < 0 || n < k) return 0;\\n\\treturn fac[n] * facinv[n - k];\\n}\\n\\nmint hom(ll n, ll k) {\\n\\tif (n < 0 || k < 0 || n == 0 && k > 0) return 0;\\n\\tif (n == 0 && k == 0) return 1;\\n\\treturn fac[n + k - 1] * facinv[k] * facinv[n - 1];\\n}\\n\\ntemplate<class T> class segtree {\\n\\tint n;\\n\\tvector<T> data;\\n\\tT id = 0;\\n\\tT operation(T a, T b) { return max(a, b); }\\npublic:\\n\\tsegtree(int _n) {\\n\\t\\tn = 1;\\n\\t\\twhile (n < _n + 2) n <<= 1;\\n\\t\\tdata = vector<T>(2 * n, id);\\n\\t}\\n\\tsegtree(vector<T> vec) {\\n\\t\\tint _n = vec.size();\\n\\t\\tn = 1;\\n\\t\\twhile (n < _n + 2) n <<= 1;\\n\\t\\tdata = vector<T>(2 * n, id);\\n\\t\\tfor (int i = 0; i < _n; i++) data[i + n] = vec[i];\\n\\t\\tfor (int i = n - 1; i >= 1; i--) data[i] = operation(data[i << 1], data[i << 1 | 1]);\\n\\t}\\n\\tvoid change(int i, T x) {\\n\\t\\ti += n;\\n\\t\\tdata[i] = x;\\n\\t\\twhile (i > 1) {\\n\\t\\t\\ti >>= 1;\\n\\t\\t\\tdata[i] = operation(data[i << 1], data[i << 1 | 1]);\\n\\t\\t}\\n\\t}\\n\\tvoid add(int i, T x) { change(i, data[i + n] + x); }\\n\\tT get(int a, int b) {\\n\\t\\tT left = id; T right = id;\\n\\t\\ta += n; b += n;\\n\\t\\twhile (a < b) {\\n\\t\\t\\tif (a & 1) left = operation(left, data[a++]);\\n\\t\\t\\tif (b & 1) right = operation(data[--b], right);\\n\\t\\t\\ta >>= 1; b >>= 1;\\n\\t\\t}\\n\\t\\treturn operation(left, right);\\n\\t}\\n\\tT get_all() { return data[1]; }\\n\\tT operator[](int i) { return data[i + n]; }\\n};\\n\\nclass unionfind {\\n\\tvector<int> par;\\n\\tvector<int> sz;\\n\\tvector<int> val;\\npublic:\\n\\tunionfind(int n) {\\n\\t\\tpar = vector<int>(n);\\n\\t\\tfor (int i = 0; i < n; i++) par[i] = i;\\n\\t\\tsz = vector<int>(n, 1);\\n\\t\\tval = vector<int>(n);\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\telse return par[x] = find(par[x]);\\n\\t}\\n\\tint size(int x) { return sz[find(x)]; }\\n\\tbool same(int x, int y) { return find(x) == find(y); }\\n\\tvoid add(int x) { val[find(x)]++; }\\n\\tint get(int x) { return val[find(x)]; }\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\t\\tif (x == y) return;\\n\\t\\tif (sz[x] < sz[y]) {\\n\\t\\t\\tpar[x] = y;\\n\\t\\t\\tsz[y] += sz[x];\\n\\t\\t\\tval[y] += val[x];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tsz[x] += sz[y];\\n\\t\\t\\tval[x] += val[y];\\n\\t\\t}\\n\\t}\\n};\\n\\ntemplate<class T> vector<int> compress(vector<T> vec) {\\n\\tint vecsize = vec.size();\\n\\tvector<T> tmpvec = vec;\\n\\tsort(tmpvec.begin(), tmpvec.end());\\n\\ttmpvec.erase(unique(tmpvec.begin(), tmpvec.end()), tmpvec.end());\\n\\tvector<int> res(vecsize);\\n\\tfor (int i = 0; i < vecsize; i++) res[i] = lower_bound(tmpvec.begin(), tmpvec.end(), vec[i]) - tmpvec.begin();\\n\\treturn res;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\tif (n == 0) return 0;\\n\\t\\tint ans = 0;\\n\\t\\treq(i, 1, 1001) {\\n\\t\\t\\treq(j, i + 1, 1001) {\\n\\t\\t\\t\\tint v = (i + j) * (j - i + 1) / 2;\\n\\t\\t\\t\\tif (n == v) ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -1.1706,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2197_6026902\",\n \"code_snippet\": \"/* ICPC */\\n#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef long double ld;\\ntypedef pair<ll,ll> pint;\\nconst ll MOD = 1000000007;\\nconst ll INF = 1e16;\\n#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)\\n#define Rep(i, s, t) for(ll i = (ll)(s); i < (ll)(t); i++)\\n#define ALL(a) (a).begin(),(a).end()\\n#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\\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\\nbool Ret(ll a = 0, ll b = 0, ll c = 0, ll d = 0) {\\n if (a == 0 && b == 0 && c == 0 && d == 0) return true;\\n else return false;\\n}\\n\\n/* 累積和 */\\n\\nvector<ll> acc_sum(vector<ll> v, ll ind = 1, bool rev = false) {\\n ll n = v.size();\\n if (rev) reverse(ALL(v));\\n if (ind == 1) {\\n vector<ll> ans(n + 1, 0);\\n rep(i, n) ans[i + 1] = ans[i] + v[i];\\n if (rev) reverse(ALL(ans));\\n return ans;\\n } else if (ind == 0) {\\n vector<ll> ans(n, 0);\\n rep(i, n) {\\n if (i == 0) ans[i] = v[i];\\n else ans[i] = ans[i - 1] + v[i];\\n }\\n if (rev) reverse(ALL(ans));\\n return ans;\\n }\\n vector<ll> ans(n, INF);\\n return ans;\\n}\\n\\nvector<vector<ll>> two_acc_sum(vector<vector<ll>> v) {\\n ll h = v.size();\\n ll w = v[0].size();\\n vector<vector<ll>> ans(h + 1, vector<ll>(w + 1, 0));\\n rep(i, h) rep(j, w) ans[i + 1][j + 1] = ans[i][j + 1] + ans[i + 1][j] - ans[i][j] + v[i][j];\\n return ans;\\n}\\n/* 空の配列でRE */\\n\\n\\nint main() {\\n IOS;\\n vector<ll> V(1010);\\n rep(i, 1010) V[i] = i+1;\\n vector<ll> SUM = acc_sum(V, 1);\\n while(1) {\\n ll N; cin >> N;\\n if(N == 0) break;\\n ll ans = 0;\\n rep(i, 1001) {\\n Rep(j, i+1, 1001) {\\n if(SUM[j] - SUM[i] == N && j - i > 1) {\\n ans++;\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -1.1166,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2197_6026387\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cctype>\\n#include <climits>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long double ld;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\ntypedef vector<int> vi;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<long long> vll;\\ntypedef vector<double> vd;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define repll(i, n) for (long long int i = 0; i < n; i++)\\n#define fin(ans) cout << (ans) << endl\\n#define P 1000000007\\n#define STI(s) atoi(s.c_str()) // string to int\\n#define mp(p, q) make_pair(p, q)\\n#define All(a) a.begin(), a.end()\\n#define Sort(a) sort(a.begin(), a.end())\\n\\n/////////////////////////////////////////\\n\\nint main(void) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n /////////////////////////////////////////////////////\\n\\n int n; \\n vll sum(1000);\\n rep(i, 1000) {\\n if (i != 0) sum[i] += sum[i - 1] + i;\\n }\\n\\n while (cin >> n) {\\n int count = 0;\\n if (n == 0) break;\\n rep(i, n - 1) {\\n for (int j = i + 1; j < n; j++) {\\n if ((sum[j] - sum[i]) == n) {\\n count++;\\n }\\n }\\n }\\n cout << count << endl;\\n }\\n\\n //////////////////////////////////////////////////////\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.0437,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2197_6007349\",\n \"code_snippet\": \"#include <algorithm> \\n#include <cstdio>\\n#include <iostream>\\n#include <map>\\n#include <math.h>\\n#include <queue>\\n#include <set>\\n#include <stack>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef long double ld;\\nconst ll MOD = 1000000007;\\nconst int INF = 1001001001;\\nconst ld PI = 3.14159265358979323846;\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define Sort(Array) sort(Array.begin(), Array.end())\\n#define Reverse(a) reverse(a.begin(), a.end())\\n#define out(ans) cout << ans << endl;\\ntemplate<class T> bool chmax(T &a, const T& b) {if (a < b) {a = b; return false;} return false;};\\ntemplate<class T> bool chmin(T &a, const T& b) {if (a > b) {a = b; return false;} return false;};\\ntemplate<class T> void printVec(const vector<T> V) {for (int i = 0; i < V.size() - 1; ++i) {cout << V[i] << ' ';}cout << V[V.size()-1] << endl;};\\ntemplate<class T> void printVec2(const vector<vector<T>> V2) {for (vector<int> V : V2) {printVec(V);}};\\nll gcd(ll a, ll b) {if (a < b) swap(a, b); if (a % b == 0) return b; return gcd(b, a%b);};\\nll lcm(ll a, ll b) {return a/gcd(a,b)*b;};\\n// prime\\nbool isPrime(ll N) {if (N < 2) return false; for (ll i = 2; i*i <= N; ++i) {if (N % i == 0) return false;}return true;};\\n// MOD\\nvoid modAdd(ll& a, ll b) {a = (a + b) % MOD;};\\nvoid modSub(ll& a, ll b) {a = (a - b) % MOD; if(a < 0) a += MOD;};\\nll modPow(ll x, ll n) {ll res = 1;while(n > 0) {if (n & 1) res = res * x % MOD; x = x * x % MOD; n >>= 1;} return res;};\\nll modInv(ll a) {return modPow(a, MOD-2);};\\nll digitSum(ll N) {string S = to_string(N); ll res = 0; rep(i,S.size()) res += (S[i] - '0'); return res;};\\n\\n\\nint main() {\\n\\n vector<int> ans;\\n while(true) {\\n int n; cin >> n;\\n if (n == 0) break;\\n int cnt = 0;\\n for (int a = 1; a < n; ++a) {\\n for (int b = a + 1; b < n; ++b) {\\n int s = (a + b) * (b - a + 1) / 2;\\n if (s == n) ++cnt;\\n }\\n }\\n ans.push_back(cnt);\\n }\\n for (auto a : ans) cout << a << endl;\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -0.1079,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2197_5958305\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\n#include<cassert>\\n#include<math.h>\\n#include<complex>\\n#include<algorithm>\\n#include<utility>\\n#include<queue>\\n#include<string.h>\\n#include<string>\\n#include<set>\\n#include<map>\\n#include<unordered_map>\\n#include<functional>\\n#include<vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> LL;\\nconst ll INF=2e18;\\nconst ll MOD=1e9+7;\\nconst double EPS=1e-9;\\nvoid ChMin(ll& x, ll y){\\n x=min(x,y);\\n}\\nvoid ChMax(ll& x, ll y){\\n x=max(x,y);\\n}\\n\\nll N;\\nint main(){\\n while( cin>>N,N!=0){\\n ll ans=0;\\n for(ll l=1;l<=N;l++){\\n for(ll r=l+1;r<=N;r++){\\n ans+= ( ( (l+r)*(r-l+1) ) / 2 ==N);\\n }\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.1531,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2197_5958304\",\n \"code_snippet\": \"//#pragma once\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string>\\n#include <iostream>\\n#include <queue>\\n#include <algorithm>\\n#include <sstream>\\n#include <vector>\\n#include <math.h>\\n#include <set>\\n#include <map>\\n#include <unordered_map>\\n#include <numeric>\\n#include <bitset>\\n#include <iomanip>\\n#include <cctype>\\n#include <cstdlib> // srand,rand\\n#include <random>\\n#include <functional>\\n#include <list>\\n#include <stack>\\n\\n\\n\\n\\nusing namespace std;\\n#define ll long long\\n#define ll128 long long\\n#define lp(i,n) for(ll i=0;i<n;i++)\\n\\n#define modd 1000000007\\n#define mod2 998244353\\nconst double EPS = 1e-20;\\nconst double PI = acos(-1);\\n\\n#define INF 8223372036854775807ll\\n#define ALL(a) (a).begin(),(a).end()\\n\\n\\ntypedef pair<long long, long long> pl;\\ntypedef pair<long long, pl> lpl;\\ntypedef pair<double, double> pd;\\ntypedef pair<ll, string> pls;\\n\\n\\n\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\n\\n\\n/*\\nclass SegmentTree {\\n\\n\\n\\nprivate:\\n\\n\\tll cont_num = 2;\\n\\tpd initial_v;\\n\\tvector<pd> dat;\\n\\n\\npublic:\\n\\n\\n\\tSegmentTree() {};\\n\\n\\n\\tvoid init(ll size, double initial_value_first, double initial_value_second) {\\n\\n\\t\\tcont_num = 2;\\n\\t\\tinitial_v.first = initial_value_first;\\n\\t\\tinitial_v.second = initial_value_second;\\n\\n\\t\\twhile (cont_num < size) {\\n\\t\\t\\tcont_num *= 2;\\n\\t\\t}\\n\\n\\t\\tdat.resize(2 * cont_num);//サイズ設定\\n\\n\\t\\tfor (int i = 0; i < 2 * cont_num; i++)dat[i] = initial_v;//初期化\\n\\n\\n\\n\\t}\\n\\n\\n\\tvoid Update(ll position, double value_f, double value_s) {\\n\\n\\n\\n\\t\\tll k = cont_num + position;\\n\\n\\t\\tdat[k].first = value_f;\\n\\t\\tdat[k].second = value_s;\\n\\n\\t\\twhile (k > 1) {\\n\\t\\t\\tk /= 2;\\n\\t\\t\\tdat[k].first = dat[k * 2 + 1].first * dat[k * 2].first;\\n\\t\\t\\tdat[k].second = dat[k * 2 + 1].first * dat[k * 2].second + dat[k * 2 + 1].second;\\n\\n\\n\\t\\t}\\n\\n\\n\\t}\\n\\n\\t/*\\n\\tll query_proces(ll a, ll b, ll k, ll l, ll r) {\\n\\n\\t\\tif (r <= a || b <= l)return initial_v;\\n\\n\\t\\tif (a <= l && r <= b)return dat[k];\\n\\t\\telse {\\n\\t\\t\\tll vl = query_proces(a, b, k * 2, l, (l + r) / 2);\\n\\t\\t\\tll vr = query_proces(a, b, k * 2 + 1, (l + r) / 2, r);\\n\\t\\t\\treturn min(vl, vr);\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\tll query(ll left, ll right) {\\n\\t\\treturn query_proces(left, right, 1, 0, cont_num);\\n\\t}\\n\\t*/\\n\\t/*\\n\\t\\tdouble query() {\\n\\t\\t\\treturn dat[1].first + dat[1].second;\\n\\t\\t}\\n\\n\\t};*/\\n\\n\\ntemplate <typename T>\\nclass Zip {\\n\\tvector<T> d;\\n\\tbool flag;\\n\\tvoid init() {\\n\\t\\tsort(d.begin(), d.end());\\n\\t\\td.erase(unique(d.begin(), d.end()), d.end());\\n\\t\\tflag = false;\\n\\t}\\npublic:\\n\\tZip() {\\n\\t\\tflag = false;\\n\\t}\\n\\tvoid add(T x) {\\n\\t\\td.push_back(x);\\n\\t\\tflag = true;\\n\\t}\\n\\tll getNum(T x) {\\n\\t\\tif (flag) init();\\n\\t\\treturn lower_bound(d.begin(), d.end(), x) - d.begin();\\n\\t}\\n\\n\\tT getVal(ll num) {\\n\\t\\treturn d[num];\\n\\t}\\n\\n\\tll size() {\\n\\t\\tif (flag) init();\\n\\t\\treturn (ll)d.size();\\n\\t}\\n};\\n\\n\\n\\n\\ntypedef struct ST\\n{\\n\\tll first;\\n\\tll second;\\n\\tll cost;\\n\\n\\tbool operator<(const ST& another) const\\n\\t{\\n\\t\\treturn cost < another.cost;//比較\\n\\t};\\n\\n\\tbool operator>(const ST& another) const\\n\\t{\\n\\t\\treturn cost > another.cost;//比較\\n\\t};\\n\\n}ST;\\n//queue<ST> qst;\\npriority_queue<ST, vector<ST>, greater<ST> > qst;\\n\\n\\n\\n/*vector <ST> vst;\\nST st[200005];\\nST bufst;\\nbitset<5000> bits;*/\\n\\n\\nlong long modinv(long long aa, long long mm) {\\n\\tlong long bb = mm, uu = 1, vv = 0;\\n\\twhile (bb) {\\n\\t\\tlong long tt = aa / bb;\\n\\t\\taa -= tt * bb; swap(aa, bb);\\n\\t\\tuu -= tt * vv; swap(uu, vv);\\n\\t}\\n\\tuu %= mm;\\n\\tif (uu < 0) uu += mm;\\n\\treturn uu;\\n}\\n\\n\\n\\n\\n\\nll zettai(ll aa) {\\n\\n\\tif (aa < 0) {\\n\\t\\taa *= -1;\\n\\t}\\n\\treturn aa;\\n\\n}\\n\\nfloat zettai(float aa) {\\n\\n\\tif (aa < 0) {\\n\\t\\taa *= -1;\\n\\t}\\n\\treturn aa;\\n\\n}\\n\\ndouble zettai(double aa) {\\n\\n\\tif (aa < 0) {\\n\\t\\taa *= -1;\\n\\t}\\n\\treturn aa;\\n\\n}\\n\\n\\n/*\\nclass UnionFind\\n{\\n\\npublic:\\n\\n\\n\\tvector <ll>pairent;\\n\\tvector <ll>depth;\\n\\tvector <ll>size;\\n\\n\\n\\tUnionFind(ll Amount) : pairent(Amount, 1), depth(Amount, 1), size(Amount, 1) {\\n\\n\\t\\tfor (ll i = 0; i < Amount; i++) {\\n\\t\\t\\tpairent[i] = i;\\n\\t\\t}\\n\\n\\n\\t}\\n\\n\\n\\tll FindPairent(ll x) {\\n\\t\\tif (pairent[x] == x)return x;\\n\\t\\telse return pairent[x] = FindPairent(pairent[x]);\\n\\n\\t}\\n\\n\\n\\tll Merge(ll x, ll y) {\\n\\t\\tx = FindPairent(x);\\n\\t\\ty = FindPairent(y);\\n\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (depth[x] > depth[y]) {\\n\\t\\t\\t\\tpairent[y] = pairent[x];\\n\\t\\t\\t\\treturn size[x] += size[y];\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tpairent[x] = pairent[y];\\n\\t\\t\\t\\tif (depth[x] == depth[y]) {\\n\\t\\t\\t\\t\\tdepth[y] ++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\treturn size[y] += size[x];\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tbool IsSame(ll x, ll y) {\\n\\t\\tif (FindPairent(x) == FindPairent(y))return true;\\n\\t\\telse return false;\\n\\t}\\n\\n\\n\\tll GetSize(ll x) {\\n\\t\\tx = FindPairent(x);\\n\\t\\treturn size[x];\\n\\t}\\n\\n\\n};\\n*/\\n\\n\\n\\ntemplate <typename T>\\nclass RollingHash {\\n\\nprivate:\\n\\tvector<T> all_array;\\n\\tvector<T> sub_array;\\n\\tvector<bool> match_flag;\\n\\tvector<ll128> ruijou;\\n\\tll match_count = 0;\\n\\tvector<ll>match_place;\\n\\npublic:\\n\\n\\tvoid Clear() {\\n\\t\\tall_array.clear();\\n\\t\\tsub_array.clear();\\n\\t\\tmatch_flag.clear();\\n\\t\\tmatch_place.clear();\\n\\t}\\n\\n\\tRollingHash() {\\n\\t\\tClear();\\n\\t}\\n\\n\\tvoid AddAllArray(T factor) {\\n\\t\\tall_array.push_back(factor);\\n\\t}\\n\\n\\tvoid AddSubArray(T factor) {\\n\\t\\tsub_array.push_back(factor);\\n\\t}\\n\\n\\tvoid Calculate_Ruijou(ll128 tei, ll max_num, ll128 mod) {\\n\\t\\truijou.clear();\\n\\t\\truijou.push_back(1);\\n\\t\\tif (max_num > 0) {\\n\\t\\t\\twhile (ruijou.size() < max_num + 1) {\\n\\t\\t\\t\\truijou.push_back(ruijou.back() * tei % mod);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\\n\\n\\tll128 GetSubHash(ll128 b, ll128 mod) {\\n\\t\\tll128 ans = 0;\\n\\t\\tCalculate_Ruijou(b, sub_array.size(), mod);\\n\\t\\tfor (ll i = 0; i < sub_array.size(); i++) {\\n\\t\\t\\tans += (sub_array[i] % mod) * ruijou[sub_array.size() - 1 - i] % mod;\\n\\t\\t\\tans %= mod;\\n\\t\\t}\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tll128 GetAllHashInit(ll128 b, ll128 mod) {\\n\\t\\tll128 ans = 0;\\n\\t\\tfor (ll i = 0; i < sub_array.size(); i++) {\\n\\t\\t\\tans += (all_array[i] % mod) * ruijou[sub_array.size() - 1 - i] % mod;\\n\\t\\t\\tans %= mod;\\n\\t\\t}\\n\\n\\t\\treturn ans;\\n\\t}\\n\\n\\tvoid CheckMatchFlag() {\\n\\t\\tmatch_place.clear();\\n\\t\\tmatch_count = 0;\\n\\t\\tfor (ll i = 0; i < match_flag.size(); i++) {\\n\\t\\t\\tif (match_flag[i] == true) {\\n\\t\\t\\t\\tmatch_count++;\\n\\t\\t\\t\\tmatch_place.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid Rolling(ll128 b, ll128 mod) {\\n\\t\\tll128 sub_hash = GetSubHash(b, mod);\\n\\t\\tll128 all_hash = GetAllHashInit(b, mod);\\n\\n\\t\\tif (sub_hash != all_hash) {\\n\\t\\t\\tmatch_flag[0] = false;\\n\\t\\t}\\n\\n\\t\\tfor (ll i = 1; i < match_flag.size(); i++) {\\n\\t\\t\\tall_hash = (all_hash * b % mod - all_array[i - 1] % mod * ruijou[sub_array.size()] % mod + all_array[i + sub_array.size() - 1] % mod) % mod;\\n\\t\\t\\twhile (all_hash < 0)all_hash += mod;\\n\\t\\t\\tall_hash %= mod;\\n\\t\\t\\tif (all_hash != sub_hash)match_flag[i] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid Match() {\\n\\t\\tll128 b = 3;\\n\\t\\t//ll128 mod = 999999999999999989;\\n\\t\\tll128 mod = 1000000007;\\n\\t\\tll128 sub_hash = GetSubHash(b, mod);\\n\\n\\t\\tif (sub_array.size() <= all_array.size()) {\\n\\n\\t\\t\\twhile (match_flag.size() < all_array.size()) {\\n\\t\\t\\t\\tmatch_flag.push_back(true);\\n\\t\\t\\t}\\n\\n\\t\\t\\twhile (match_flag.size() > all_array.size() - sub_array.size() + 1) {\\n\\t\\t\\t\\tmatch_flag.pop_back();\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tRolling(b, mod);\\n\\n\\t\\t\\tb = 5;\\n\\t\\t\\tmod = mod2;\\n\\n\\t\\t\\tRolling(b, mod);\\n\\n\\t\\t\\tb = 7;\\n\\t\\t\\tmod = modd;\\n\\n\\t\\t\\tRolling(b, mod);\\n\\n\\t\\t\\tb = mod2;\\n\\t\\t\\tmod = modd;\\n\\n\\t\\t\\tRolling(b, mod);\\n\\n\\t\\t\\tCheckMatchFlag();\\n\\n\\t\\t}\\n\\n\\n\\n\\t}\\n\\n\\tll GetMatchCount() {\\n\\t\\treturn match_count;\\n\\t}\\n\\n\\tll GetMatchPlace(ll num) {\\n\\t\\tif (num >= match_place.size())return -1;\\n\\t\\telse return match_place[num];\\n\\t}\\n\\n};\\n\\n\\n\\nclass UnionFind\\n{\\n\\npublic:\\n\\n\\tvector <ll>pairent;\\n\\tvector <ll>depth;\\n\\tvector <ll>size;\\n\\n\\tUnionFind(ll Amount) : pairent(Amount, 1), depth(Amount, 1), size(Amount, 1) {\\n\\n\\t\\tfor (ll i = 0; i < Amount; i++) {\\n\\t\\t\\tpairent[i] = i;\\n\\t\\t}\\n\\t}\\n\\n\\n\\tll FindPairent(ll x) {\\n\\t\\tif (pairent[x] == x)return x;\\n\\t\\telse return pairent[x] = FindPairent(pairent[x]);\\n\\t}\\n\\n\\n\\tll Merge(ll x, ll y) {\\n\\t\\tx = FindPairent(x);\\n\\t\\ty = FindPairent(y);\\n\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (depth[x] > depth[y]) {\\n\\t\\t\\t\\tpairent[y] = pairent[x];\\n\\t\\t\\t\\treturn size[x] += size[y];\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tpairent[x] = pairent[y];\\n\\t\\t\\t\\tif (depth[x] == depth[y]) {\\n\\t\\t\\t\\t\\tdepth[y] ++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn size[y] += size[x];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tbool IsSame(ll x, ll y) {\\n\\t\\tif (FindPairent(x) == FindPairent(y))return true;\\n\\t\\telse return false;\\n\\t}\\n\\n\\n\\tll GetSize(ll x) {\\n\\t\\tx = FindPairent(x);\\n\\t\\treturn size[x];\\n\\t}\\n\\n\\n};\\n\\n\\n\\n\\nstruct Edge\\n{\\n\\tll a, b, cost;\\n\\n\\n\\tbool operator<(const Edge& other) const {\\n\\t\\treturn cost < other.cost;\\n\\t}\\n};\\n\\nstruct Graph\\n{\\n\\tll n; // 頂点数\\n\\tvector<Edge> es; // 辺集合\\n};\\n\\nclass Kruskal {\\n\\n\\tGraph origin_G;\\n\\tGraph MST;\\n\\tll total_cost = 0;\\n\\npublic:\\n\\n\\tvoid Solve() {\\n\\t\\tUnionFind uf = UnionFind(MST.n);\\n\\t\\tfor (ll i = 0; i < origin_G.es.size(); i++) {\\n\\t\\t\\tll a = origin_G.es[i].a;\\n\\t\\t\\tll b = origin_G.es[i].b;\\n\\t\\t\\tll cost = origin_G.es[i].cost;\\n\\n\\t\\t\\tif (!uf.IsSame(a, b)) {\\n\\t\\t\\t\\tuf.Merge(a, b);\\n\\t\\t\\t\\tMST.es.push_back(origin_G.es[i]);\\n\\t\\t\\t\\ttotal_cost += cost;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tKruskal(Graph graph) {\\n\\t\\torigin_G = graph;\\n\\t\\tMST = graph;\\n\\t\\tMST.es.clear();\\n\\t\\tsort(origin_G.es.begin(), origin_G.es.end());\\n\\t}\\n\\n\\tll GetMinCost() {\\n\\t\\treturn total_cost;\\n\\t}\\n\\n};\\n\\n\\nll RepeatSquaring(ll N, ll P, ll M) {\\n\\tif (P == 0) return 1;\\n\\tif (P % 2 == 0) {\\n\\t\\tll t = RepeatSquaring(N, P / 2, M) % M;\\n\\t\\treturn t * t % M;\\n\\t}\\n\\treturn N * RepeatSquaring(N, P - 1, M) % M;\\n}\\n\\n/*\\nll KurikaesiNijou(ll a, ll b, ll P) {\\n\\n\\tif (b == 0)return 1;\\n\\tif (b % 2 == 0) {\\n\\t\\tll c=KurikaesiNijou(a,b/2,P)%P;\\n\\t\\treturn c * c %P;\\n\\t}\\n\\telse {\\n\\t\\tll c = KurikaesiNijou(a, b/2, P) % P;\\n\\t\\treturn a * c * c % P;\\n\\t}\\n\\n}*/\\n\\n\\n\\n\\nll GCD(ll a, ll b) {\\n\\tif (a % b == 0)return b;\\n\\telse return GCD(b, a % b);\\n}\\n\\nll Min(ll a, ll b) {\\n\\tif (a < b)return a;\\n\\telse return b;\\n}\\n\\nll Max(ll a, ll b) {\\n\\tif (a > b)return a;\\n\\telse return b;\\n}\\n\\nll Sum(ll a, ll b) {\\n\\treturn a + b;\\n}\\n\\nll Add(ll a, ll b) {\\n\\treturn a + b;\\n}\\n\\ntemplate <typename T>\\nclass SegmentTree {\\n\\tll n;\\n\\tvector<T> node;\\n\\tfunction<T(T, T)> fun, fun2;\\n\\tbool customChange;\\n\\tT outValue, initValue;\\npublic:\\n\\tvoid init(ll num, function<T(T, T)> resultFunction, T init, T out, function<T(T, T)> changeFunction = NULL) {\\n\\t\\t// changeFunction: (input, beforevalue) => newvalue\\n\\t\\tfun = resultFunction;\\n\\t\\tfun2 = changeFunction;\\n\\t\\tcustomChange = changeFunction != NULL;\\n\\t\\tn = 1;\\n\\t\\twhile (n < num) n *= 2;\\n\\t\\tnode.resize(2 * n - 1);\\n\\t\\tfill(node.begin(), node.end(), init);\\n\\t\\toutValue = out;\\n\\t\\tinitValue = init;\\n\\t}\\n\\tvoid valueChange(ll num, T value) {\\n\\t\\tnum += n - 1;\\n\\t\\tif (customChange) node[num] = fun2(value, node[num]);\\n\\t\\telse node[num] = value;\\n\\t\\twhile (num > 0) num = (num - 1) / 2, node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);\\n\\t}\\n\\tT rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)\\n\\t\\tif (r == -1) r = n;\\n\\t\\tif (a <= l && r <= b) return node[k];\\n\\t\\tif (b <= l || r <= a) return outValue;\\n\\t\\tll mid = (l + r) / 2;\\n\\t\\treturn fun(rangeQuery(a, b, l, mid, 2 * k + 1), rangeQuery(a, b, mid, r, 2 * k + 2));\\n\\t}\\n};\\n\\n\\nll extgcd(ll a, ll b, ll& x, ll& y) {\\n\\tif (b == 0) {\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t\\treturn a;\\n\\t}\\n\\tll gcd = extgcd(b, a % b, x, y);\\n\\tll oldX = x;\\n\\tx = y;\\n\\ty = oldX - a / b * y;\\n\\treturn gcd;\\n}\\n\\n\\nclass Combination {\\n\\n\\tvector<ll> factorial;\\n\\tvector<ll> factorial_inv;\\n\\tll mod;\\n\\tll max_n;\\n\\n\\npublic:\\n\\tvoid Init(ll init_max_n, ll init_mod) {\\n\\t\\tmax_n = init_max_n;\\n\\t\\tmod = init_mod;\\n\\t\\tfactorial.resize(max_n + 1);\\n\\t\\tfactorial[0] = 1;\\n\\t\\tfor (ll i = 1; i < factorial.size(); i++) {\\n\\t\\t\\tfactorial[i] = factorial[i - 1] * i;\\n\\t\\t\\tfactorial[i] %= mod;\\n\\t\\t}\\n\\n\\t\\tfactorial_inv.resize(max_n + 1);\\n\\t\\tfactorial_inv[0] = 1;\\n\\t\\tfor (ll i = 1; i < factorial_inv.size(); i++) {\\n\\t\\t\\tfactorial_inv[i] = factorial_inv[i - 1] * modinv(i, mod);\\n\\t\\t\\tfactorial_inv[i] %= mod;\\n\\t\\t}\\n\\t}\\n\\n\\n\\n\\tll GetComb(ll n, ll k) {\\n\\t\\tif (n < k)return 0;\\n\\t\\tif (k == 0)return 1;\\n\\n\\t\\tll comb = factorial[n];\\n\\t\\tcomb *= factorial_inv[k];\\n\\t\\tcomb %= mod;\\n\\t\\tcomb *= factorial_inv[n - k];\\n\\t\\tcomb %= mod;\\n\\t\\treturn comb;\\n\\t}\\n\\n\\tll GetH(ll n, ll k) {//n+k-1<=max_N\\n\\t\\tll comb = factorial[n + k - 1];\\n\\t\\tcomb *= factorial_inv[n];\\n\\t\\tcomb %= mod;\\n\\t\\tcomb *= factorial_inv[k - 1];\\n\\t\\tcomb %= mod;\\n\\t\\treturn comb;\\n\\t}\\n\\n};\\n\\n\\n\\nclass Tree {\\n\\n\\tll node_N;\\n\\tvector<ll> node;\\n\\tvector<vector<pl>> pass;\\n\\tll diameter = -1;\\n\\tvector<ll> dist_Diamieter[2];\\n\\n\\tpl maxDist_Num;\\n\\npublic:\\n\\n\\n\\tvoid Init(ll node_Num) {\\n\\t\\tnode_N = node_Num;\\n\\t\\tnode.resize(node_N + 1);\\n\\t\\tpass.resize(node_N + 1);\\n\\n\\t\\tdist_Diamieter[0].resize(node_N + 1);\\n\\t\\tlp(i, node_N + 1)dist_Diamieter[0][i] = -1;\\n\\t\\tdist_Diamieter[1].resize(node_N + 1);\\n\\t\\tlp(i, node_N + 1)dist_Diamieter[1][i] = -1;\\n\\t}\\n\\n\\tvoid AddEdge(ll a, ll b, ll dist) {\\n\\t\\tpl bufpl;\\n\\t\\tbufpl.first = b;\\n\\t\\tbufpl.second = dist;\\n\\t\\tpass[a].push_back(bufpl);\\n\\t\\tbufpl.first = a;\\n\\t\\tpass[b].push_back(bufpl);\\n\\t}\\n\\n\\n\\tvoid DFS(ll step, ll now, ll dist) {\\n\\n\\t\\tdist_Diamieter[step][now] = dist;\\n\\t\\tif (dist_Diamieter[step][now] > maxDist_Num.first) {\\n\\t\\t\\tmaxDist_Num.first = dist_Diamieter[step][now];\\n\\t\\t\\tmaxDist_Num.second = now;\\n\\t\\t}\\n\\n\\t\\tfor (ll i = 0; i < pass[now].size(); i++) {\\n\\t\\t\\tll next_node = pass[now][i].first;\\n\\t\\t\\tif (dist_Diamieter[step][next_node] == -1) {\\n\\t\\t\\t\\tDFS(step, next_node, dist + pass[now][i].second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll GetDiameter(ll min_node_num) {\\n\\t\\tif (diameter >= 0)return diameter;\\n\\t\\telse {\\n\\t\\t\\tmaxDist_Num.first = -1;\\n\\t\\t\\tmaxDist_Num.second = -1;\\n\\t\\t\\tDFS(0, min_node_num, 0ll);\\n\\t\\t\\tll step2_start = maxDist_Num.second;\\n\\n\\t\\t\\tmaxDist_Num.first = -1;\\n\\t\\t\\tmaxDist_Num.second = -1;\\n\\t\\t\\tDFS(1, step2_start, 0ll);\\n\\n\\t\\t\\tdiameter = maxDist_Num.first;\\n\\t\\t\\treturn diameter;\\n\\t\\t}\\n\\t}\\n\\n\\tll GetDistFromMinNode(ll num) {\\n\\t\\treturn dist_Diamieter[0][num];\\n\\t}\\n\\n};\\n\\n\\n\\n\\nstruct LDE {\\n\\tll a, b, c, x, y;\\n\\tll m = 0;\\n\\tbool check = true;//解が存在するか\\n\\n\\t//初期化\\n\\tLDE(ll a_, ll b_, ll c_) : a(a_), b(b_), c(c_) {\\n\\t\\tll g = GCD(a, b);\\n\\t\\tif (c % g != 0) {\\n\\t\\t\\tcheck = false;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t//ax+by=gの特殊解を求める\\n\\t\\t\\textgcd(abs(a), abs(b), x, y);\\n\\t\\t\\tif (a < 0)x = -x;\\n\\t\\t\\tif (b < 0)y = -y;\\n\\t\\t\\t//ax+by=cの特殊解を求める(オーバフローに注意！)\\n\\t\\t\\tx *= c / g; y *= c / g;\\n\\t\\t\\t//一般解を求めるために割る\\n\\t\\t\\ta /= g; b /= g;\\n\\t\\t}\\n\\t}\\n\\n\\t//拡張ユークリッドの互除法\\n\\t//返り値:aとbの最大公約数\\n\\tll extgcd(ll a, ll b, ll& x0, ll& y0) {\\n\\t\\tif (b == 0) {\\n\\t\\t\\tx0 = 1;\\n\\t\\t\\ty0 = 0;\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tll d = extgcd(b, a % b, y0, x0);\\n\\t\\ty0 -= a / b * x0;\\n\\t\\treturn d;\\n\\t}\\n\\n\\t//パラメータmの更新(書き換え)\\n\\tvoid m_update(ll m_) {\\n\\t\\tx += (m_ - m) * b;\\n\\t\\ty -= (m_ - m) * a;\\n\\t\\tm = m_;\\n\\t}\\n};\\n\\n\\n/*\\ntemplate< typename Monoid >\\nstruct SegmentTreee {\\n\\tusing F = function< Monoid(Monoid, Monoid) >;\\n\\n\\tint sz;\\n\\tvector< Monoid > seg;\\n\\n\\tconst F f;\\n\\tconst Monoid M1;\\n\\n\\tSegmentTreee(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n) sz <<= 1;\\n\\t\\tseg.assign(2 * sz, M1);\\n\\t}\\n\\n\\tvoid set(int k, const Monoid& x) {\\n\\t\\tseg[k + sz] = x;\\n\\t}\\n\\n\\tvoid build() {\\n\\t\\tfor (int k = sz - 1; k > 0; k--) {\\n\\t\\t\\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid update(int k, const Monoid& x) {\\n\\t\\tk += sz;\\n\\t\\tseg[k] = x;\\n\\t\\twhile (k >>= 1) {\\n\\t\\t\\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tMonoid query(int a, int b) {\\n\\t\\tMonoid L = M1, R = M1;\\n\\t\\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n\\t\\t\\tif (a & 1) L = f(L, seg[a++]);\\n\\t\\t\\tif (b & 1) R = f(seg[--b], R);\\n\\t\\t}\\n\\t\\treturn f(L, R);\\n\\t}\\n\\n\\tMonoid operator[](const int& k) const {\\n\\t\\treturn seg[k + sz];\\n\\t}\\n\\n\\ttemplate< typename C >\\n\\tint find_subtree(int a, const C& check, Monoid& M, bool type) {\\n\\t\\twhile (a < sz) {\\n\\t\\t\\tMonoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\\n\\t\\t\\tif (check(nxt)) a = 2 * a + type;\\n\\t\\t\\telse M = nxt, a = 2 * a + 1 - type;\\n\\t\\t}\\n\\t\\treturn a - sz;\\n\\t}\\n\\n\\n\\ttemplate< typename C >\\n\\tint find_first(int a, const C& check) {\\n\\t\\tMonoid L = M1;\\n\\t\\tif (a <= 0) {\\n\\t\\t\\tif (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tint b = sz;\\n\\t\\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n\\t\\t\\tif (a & 1) {\\n\\t\\t\\t\\tMonoid nxt = f(L, seg[a]);\\n\\t\\t\\t\\tif (check(nxt)) return find_subtree(a, check, L, false);\\n\\t\\t\\t\\tL = nxt;\\n\\t\\t\\t\\t++a;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\\n\\n\\ttemplate< typename C >\\n\\tint find_last(int b, const C& check) {\\n\\t\\tMonoid R = M1;\\n\\t\\tif (b >= sz) {\\n\\t\\t\\tif (check(f(seg[1], R))) return find_subtree(1, check, R, true);\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tint a = sz;\\n\\t\\tfor (b += sz; a < b; a >>= 1, b >>= 1) {\\n\\t\\t\\tif (b & 1) {\\n\\t\\t\\t\\tMonoid nxt = f(seg[--b], R);\\n\\t\\t\\t\\tif (check(nxt)) return find_subtree(b, check, R, true);\\n\\t\\t\\t\\tR = nxt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\\n};\\n\\n*/\\n\\n\\nvector<pair<long long, long long> > prime_factorize(long long N) {\\n\\tvector<pair<long long, long long> > res;\\n\\tfor (long long a = 2; a * a <= N; ++a) {\\n\\t\\tif (N % a != 0) continue;\\n\\t\\tlong long ex = 0;\\n\\t\\twhile (N % a == 0) {\\n\\t\\t\\t++ex;\\n\\t\\t\\tN /= a;\\n\\t\\t}\\n\\t\\tres.push_back({ a, ex });\\n\\t}\\n\\tif (N != 1) res.push_back({ N, 1 });\\n\\treturn res;\\n}\\n\\n\\nCombination co;\\ntypedef pair<int, int> pi;\\npriority_queue<pl, vector<pl>, greater<pl> > pqpl;\\n\\n\\npriority_queue<ll, vector<ll>, greater<ll> > pqll;\\n\\n\\nll nck(ll n, ll k, ll m) {\\n\\tll ans = 1;\\n\\tll pre_ans = 1;\\n\\tif (k == 0)return 1;\\n\\tfor (ll i = 1; i <= k; i++) {\\n\\t\\tpre_ans = ans;\\n\\t\\tans = pre_ans * (n - i + 1);\\n\\t\\tans %= m;\\n\\t\\tans *= modinv(i, m);\\n\\t\\tans %= modd;\\n\\t}\\n\\treturn ans;\\n}\\n\\nll N,M,K;\\n\\nll a, b;\\nmap<ll,ll> llmap;\\nvector<bool> vll;\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> N;\\n\\t\\tif (N == 0)break;\\n\\t\\tll ans = 0;\\n\\t\\tfor (ll i = 1; i < N; i++) {\\n\\t\\t\\tfor (ll j = i + 1; j < N; j++) {\\n\\t\\t\\t\\tif ((i + j) * (j - i + 1) / 2 == N)ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\t//cout << fixed << setprecision(12) << bb << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.0466,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2197_5936543\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define int long long\\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\\n#define REP(i, n) for (int i = 0; i < (n); i++)\\n#define pb push_back\\n#define ALL(obj) (obj).begin(), (obj).end()\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define pii pair<int, int>\\n#define us unordered_set\\n#define ud unordered_dict\\n#define Lower_bound(vec, n) distance((vec).begin(), lower_bound((vec).begin(), (vec).end(), (n)))\\n#define Upper_bound(vec, n) distance((vec).begin(), upper_bound((vec).begin(), (vec).end(), (n)))\\n#define Erase(vec) (vec).erase(unique((vec).begin(), (vec).end()), (vec).end())\\n//template <class T = int> in()(T x; cin >> x; return (x);)\\n//template <class T> print(T& x) (cout << x << endl;)\\n//using template <class T> vec = vector<T>;\\nusing Graph = vector<vector<int>>;\\nconst int INF = 1LL << 60;\\nconst int MOD = (int)1e9 + 7;\\nconst double EPS = 1e-9;\\n\\nsigned main() {\\n vi acc;\\n int acc_sum = 0;\\n FOR(i, 0, 1000) {\\n acc_sum += i;\\n acc.push_back(acc_sum);\\n }\\n\\n int n;\\n while (true) {\\n cin >> n;\\n if (n == 0) break;\\n\\n int ans = 0;\\n for (int i = 1000; i >= 0; i--) {\\n REP(j, i-1) {\\n if (acc[i] - acc[j] == n) {\\n //cout << \\\"acc[\\\" << i << \\\"]= \\\" << acc[i];\\n //cout << \\\" acc[\\\" << j << \\\"]= \\\" << acc[j];\\n //cout << \\\" ans = \\\" << ans << endl;\\n ans++;\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.4645,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1197,"cells":{"group_id":{"kind":"string","value":"aoj_2193_cpp"},"problem_description":{"kind":"string","value":"Problem I:\n夏への扉\nなつめは大のねこ好きである。なつめの家ではずっとねこを飼っておらず、ねこ好きななつめはいつも野良ねこと遊んでいた。しかし、今回なつめは決心し、自分の家でねこを一匹飼うことにした。なつめはねこを家に迎え、レノンと名付けてかわいがり始めた。\nなつめの家はたくさんの部屋と、それらをつなぐたくさんの扉からなっており、扉は次の2種類がある。\n人間用の普通の扉\nなつめは開けることができるが、レノンが自分で開けることはできない。なつめとレノンの両方が通ることができる。一度開ければ、その後は開いたままにしておける。\nねこ用の小さな扉\nレノンが自分であけて自由に通ることができる。ただし小さいために、なつめが通ることはできない。\nレノンは夏が大好きである。だから、冬になり家の外がまっしろな雪で覆われてしまう頃になると、彼の機嫌はとても悪くなってしまった。しかし、彼は家にたくさんあるドアのうち、あるひとつの扉が「夏」へとつながっていると信じているようだった。なつめはその扉を「夏への扉」と呼んでいる。そして、寒くて不機嫌になってくると、レノンはきまってその扉の向こうへ行きたがるのである。\n冬のある日、レノンがまた「夏への扉」の奥へ行こうと思い立った。しかし、レノンがひとりで扉を開けて、夏への扉の奥へ行けるとは限らない。その時はもちろん、なつめはレノンの手伝いをしなければならない。つまり、なつめしか開けることの出来ない扉をいくつか開いて、レノンが「夏への扉」の向こう側へ行けるようにしてあげるのだ。\n最初、家の中の全ての扉は閉まっている。家の部屋の接続関係、なつめおよびレノンの初期位置が与えられる。なつめとレノンが最適な戦略をとった時、レノンが「夏への扉」の先へいくために\nなつめが開けなければならない扉\nの最小数を計算しなさい。\n以下の図は、サンプル入力の例を図示したものである。\n図: サンプル入力の初期状態\nInput\n入力の1行目には、部屋の数\nn\nと扉の数\nm\nが1つの空白文字で区切って与えられる。部屋にはそれぞれ 0 から\nn\nの番号が割り振られており、0は「夏への扉」の先をあらわす。2行目はなつめが最初にいる部屋の番号とレノンが最初にいる部屋の番号が、1つの空白文字で区切って与えられる。どちらの部屋番号も1以上であり、最初から「夏への扉」の先にいることはない。続く\nm\n行には、\nm\n枚の扉の情報がそれぞれ1行ずつ与えられる。各行はふたつの部屋IDと扉の種類を表す1文字のアルファベットからなり、1つの空白文字で区切られている。扉は指定されたふたつの部屋を繋いでおり、種類はアルファベットが\nN\nのとき人間用の普通の扉、\nL\nのときねこ用の小さな扉である。扉が同じ部屋同士を繋ぐことはない。部屋IDが0のものを含む扉が「夏への扉」であり、これは入力中に必ずただ1つ存在する。1 <= n, m <= 100000を満たす。\nOutput\nなつめが開けなければならない扉の最小数を、1行で出力せよ。\nNotes on Submission\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\nSample Input\n2\n4 6\n1 2\n1 2 N\n2 3 N\n3 4 N\n4 1 N\n1 4 L\n4 0 L\n4 6\n1 2\n1 2 N\n2 3 N\n3 4 N\n4 1 N\n1 4 L\n4 0 N\nOutput for the Sample Input\n1\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2193_9080420","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main(){\n\n int cnt;\n cin >> cnt;\n int n,m,hs,cs;\n for(int k=0;k<cnt;k++){\n cin >> n >> m;\n cin >> hs >> cs;\n \n vector<vector<int>> dh(n+1),dc(n+1);\n int a,b;\n char c;\n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n if(c=='N'){\n dh[a].push_back(b);\n dh[b].push_back(a);\n }else{\n dc[a].push_back(b);\n dc[b].push_back(a);\n \n }\n }\n \n vector<bool> cfs(n+1,false),ctg(n+1,false);\n vector<int> cfsd(n+1,INT_MAX),ctgd(n+1,INT_MAX),hfsd(n+1,INT_MAX);\n cfs[cs]=true;\n ctg[0]=true;\n queue<int> que,ques,queg;\n que.push(cs);\n ques.push(cs);\n cfsd[cs]=0;\n while(!que.empty()){\n int cp=que.front();\n que.pop();\n for(int i=0;i<(int)dc[cp].size();i++){\n if(!cfs[dc[cp][i]]){ \n cfs[dc[cp][i]]=true;\n que.push(dc[cp][i]);\n ques.push(dc[cp][i]);\n cfsd[dc[cp][i]]=0;\n }\n }\n }\n if(cfs[0]){\n cout << 0 << endl;\n continue;\n }\n \n que.push(0);\n queg.push(0);\n ctgd[0]=0;\n while(!que.empty()){\n int cp=que.front();\n que.pop();\n for(int i=0;i<(int)dc[cp].size();i++){\n if(!ctg[dc[cp][i]]){ \n ctg[dc[cp][i]]=true;\n que.push(dc[cp][i]);\n queg.push(dc[cp][i]);\n ctgd[dc[cp][i]]=0;\n }\n }\n }\n \n while(!ques.empty()){\n int cp=ques.front();\n ques.pop();\n for(int i=0;i<(int)dh[cp].size();i++){\n if(cfsd[dh[cp][i]]==INT_MAX){\n cfsd[dh[cp][i]]=cfsd[cp]+1;\n ques.push(dh[cp][i]);\n }\n }\n }\n while(!queg.empty()){\n int cp=queg.front();\n queg.pop();\n for(int i=0;i<(int)dh[cp].size();i++){\n if(ctgd[dh[cp][i]]==INT_MAX){\n ctgd[dh[cp][i]]=ctgd[cp]+1;\n queg.push(dh[cp][i]);\n }\n }\n }\n \n hfsd[hs]=0;\n que.push(hs);\n while(!que.empty()){\n int hp=que.front();\n que.pop();\n for(int i=0;i<(int)dh[hp].size();i++){\n if(hfsd[dh[hp][i]]==INT_MAX){\n hfsd[dh[hp][i]]=hfsd[hp]+1;\n que.push(dh[hp][i]);\n }\n }\n }\n \n int ans=INT_MAX;\n for(int i=0;i<=n;i++){\n if((cfsd[i]==INT_MAX)||(ctgd[i]==INT_MAX)||(hfsd[i]==INT_MAX)) continue;\n ans=min(ans,cfsd[i]+ctgd[i]+hfsd[i]);\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":12064,"score_of_the_acc":-0.4621,"final_rank":5},{"submission_id":"aoj_2193_6049702","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct UnionFind{\n vector<int> par,num;\n UnionFind(int n):par(n),num(n,1){\n iota(par.begin(),par.end(),0); //include<numeric>\n }\n int find(int v){\n return (par[v]==v)?v:(par[v]=find(par[v]));\n }\n void unite(int u,int v){\n u=find(u),v=find(v);\n if(u==v)return;\n if(num[u]<num[v])swap(u,v);\n num[u]+=num[v];\n par[v]=u;\n }\n bool same(int u,int v){\n return find(u) == find(v);\n }\n int size(int v){\n return num[find(v)];\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int qq; cin >> qq;\n while(qq--){\n int n,m; cin >> n >> m;\n UnionFind uf(n+1);\n vector<vector<int>> g(n+1);\n int na,le; cin >> na >> le;\n for(int i=0;i<m;i++){\n int x,y; cin >> x >> y;\n char c; cin >> c;\n if(c == 'N'){\n g[x].push_back(y);\n g[y].push_back(x);\n }\n else{\n uf.unite(x, y);\n }\n }\n if(uf.same(le, 0)){\n cout << 0 << \"\\n\"; continue;\n }\n vector<int> dp1(n+1,-1);\n dp1[na] = 0;\n queue<int> q; q.push(na);\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp1[t] == -1){\n dp1[t] = dp1[s]+1;\n q.push(t);\n }\n }\n }\n vector<int> dp2(n+1,-1);\n for(int i=0;i<=n;i++){\n if(uf.same(le, i)){\n dp2[i] = 0; q.push(i);\n }\n }\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp2[t] == -1){\n dp2[t] = dp2[s]+1;\n q.push(t);\n }\n }\n }\n vector<int> dp3(n+1,-1);\n for(int i=0;i<=n;i++){\n if(uf.same(0, i)){\n dp3[i] = 0; q.push(i);\n }\n }\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp3[t] == -1){\n dp3[t] = dp3[s]+1;\n q.push(t);\n }\n }\n }\n int res = 1e9;\n for(int i=0;i<=n;i++){\n if(dp1[i] == -1 or dp2[i] == -1 or dp3[i] == -1)continue;\n res = min(res, dp1[i]+dp2[i]+dp3[i]);\n }\n cout << res << \"\\n\";\n }\n}","accuracy":1,"time_ms":70,"memory_kb":10332,"score_of_the_acc":-0.2234,"final_rank":1},{"submission_id":"aoj_2193_6049334","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct UnionFind{\n vector<int> par,num;\n UnionFind(int n):par(n),num(n,1){\n iota(par.begin(),par.end(),0); //include<numeric>\n }\n int find(int v){\n return (par[v]==v)?v:(par[v]=find(par[v]));\n }\n void unite(int u,int v){\n u=find(u),v=find(v);\n if(u==v)return;\n if(num[u]<num[v])swap(u,v);\n num[u]+=num[v];\n par[v]=u;\n }\n bool same(int u,int v){\n return find(u) == find(v);\n }\n int size(int v){\n return num[find(v)];\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int qq; cin >> qq;\n while(qq--){\n int n,m; cin >> n >> m;\n UnionFind uf(n+1);\n vector<vector<int>> g(n+1);\n int na,le; cin >> na >> le;\n for(int i=0;i<m;i++){\n int x,y; cin >> x >> y;\n char c; cin >> c;\n if(c == 'N'){\n g[x].push_back(y);\n g[y].push_back(x);\n }\n else{\n uf.unite(x, y);\n }\n }\n if(uf.same(le, 0)){\n cout << 0 << \"\\n\"; continue;\n }\n vector<int> dp1(n+1,-1);\n dp1[na] = 0;\n queue<int> q; q.push(na);\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp1[t] == -1){\n dp1[t] = dp1[s]+1;\n q.push(t);\n }\n }\n }\n vector<int> dp2(n+1,-1);\n for(int i=0;i<=n;i++){\n if(uf.same(le, i)){\n dp2[i] = 0; q.push(i);\n }\n }\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp2[t] == -1){\n dp2[t] = dp2[s]+1;\n q.push(t);\n }\n }\n }\n vector<int> dp3(n+1,-1);\n for(int i=0;i<=n;i++){\n if(uf.same(0, i)){\n dp3[i] = 0; q.push(i);\n }\n }\n while(q.size()){\n int s = q.front(); q.pop();\n for(int t:g[s]){\n if(dp3[t] == -1){\n dp3[t] = dp3[s]+1;\n q.push(t);\n }\n }\n }\n int res = 1e9;\n for(int i=0;i<=n;i++){\n if(dp1[i] == -1 or dp2[i] == -1 or dp3[i] == -1)continue;\n res = min(res, dp1[i]+dp2[i]+dp3[i]);\n }\n cout << res << \"\\n\";\n }\n}","accuracy":1,"time_ms":70,"memory_kb":10480,"score_of_the_acc":-0.2309,"final_rank":2},{"submission_id":"aoj_2193_4626732","code_snippet":"#include <iostream>\n#include <utility>\n#include <tuple>\n#include <vector>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <array>\n#include <string>\n#include <stack>\n#include <cassert>\n#include <memory>\n#include <random>\n\n\nint main() {\n\tint t; std::cin >> t;\n\tfor (; t > 0; --t) {\n\t\tint n, m; std::cin >> n >> m;\n\t\tint human_start, cat_start; std::cin >> human_start >> cat_start;\n\t\tstd::vector<std::vector<int>> rooms(n + 1), for_cat(n + 1);\n\t\tfor (auto i = 0; i < m; ++i) {\n\t\t\tint a, b; std::string type; std::cin >> a >> b >> type;\n\t\t\tif (type == \"N\") {\n\t\t\t\trooms[a].push_back(b);\n\t\t\t\trooms[b].push_back(a);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor_cat[a].push_back(b);\n\t\t\t\tfor_cat[b].push_back(a);\n\t\t\t}\n\t\t}\n\t\tstd::queue<int> queue;\n\t\tstd::vector<bool> can_move_from_start(n + 1, false), can_move_to_goal(n + 1, false);\n\t\tcan_move_from_start[cat_start] = true; queue.push(cat_start);\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto next : for_cat[top]) if (!can_move_from_start[next]) {\n\t\t\t\tcan_move_from_start[next] = true;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t\tcan_move_to_goal[0] = true; queue.push(0);\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto next : for_cat[top]) if (!can_move_to_goal[next]) {\n\t\t\t\tcan_move_to_goal[next] = true;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t\tstd::vector<int> from_start(n + 1, INT_MAX), to_goal(n + 1, INT_MAX), from_cat(n + 1, INT_MAX);\n\t\tfor (auto i = 0; i < can_move_to_goal.size(); ++i) if (can_move_to_goal[i]) {\n\t\t\tto_goal[i] = 0; queue.push(i);\n\t\t}\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto next : rooms[top]) if (to_goal[next] == INT_MAX) {\n\t\t\t\tto_goal[next] = to_goal[top] + 1;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t\tfrom_start[human_start] = 0; queue.push(human_start);\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto next : rooms[top]) if (from_start[next] == INT_MAX) {\n\t\t\t\tfrom_start[next] = from_start[top] + 1;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t\tfor (auto i = 0; i < can_move_from_start.size(); ++i) if (can_move_from_start[i]) {\n\t\t\tfrom_cat[i] = 0; queue.push(i);\n\t\t}\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto next : rooms[top]) if (from_cat[next] == INT_MAX) {\n\t\t\t\tfrom_cat[next] = from_cat[top] + 1;\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t\tint min_open = INT_MAX;\n\t\tfor (auto i = 0; i < n + 1; ++i) {\n\t\t\tif (from_start[i] == INT_MAX || to_goal[i] == INT_MAX || from_cat[i] == INT_MAX) continue;\n\t\t\tif (can_move_from_start[i] && can_move_to_goal[i]) {\n\t\t\t\tmin_open = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmin_open = std::min(min_open, from_start[i] + to_goal[i] + from_cat[i]);\n\t\t}\n\t\tstd::cout << min_open << '\\n';\n\t}\n}","accuracy":1,"time_ms":250,"memory_kb":11936,"score_of_the_acc":-0.6055,"final_rank":12},{"submission_id":"aoj_2193_3110473","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\nenum Type{\n\tbase_human,\n\tbase_cat,\n\tbase_can_area,\n};\n\nstruct Info{\n\tInfo(int arg_room_id,int arg_sum_cost){\n\t\troom_id = arg_room_id;\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 room_id,sum_cost;\n};\n\nint goal;\nint num_room,num_door;\nint min_dist[3][NUM];\nint height[NUM],boss[NUM];\nvector<int> human_G[NUM],cat_G[NUM];\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint is_same_group(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\t//既に同じグループなら何もしない\n\tif(boss_x == boss_y)return;\n\n\t//高さが高い方に吸収する\n\tif(height[x] > height[y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[x] < height[y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[x] == height[y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\nvoid init(){\n\tfor(int i = 0; i <= num_room; i++){ //★0が「夏への扉」の先★\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i <= num_room; i++){\n\t\thuman_G[i].clear();\n\t\tcat_G[i].clear();\n\t}\n\n\tscanf(\"%d %d\",&num_room,&num_door);\n\n\tinit();\n\n\tint start_human,start_cat;\n\tscanf(\"%d %d\",&start_human,&start_cat);\n\n\tint from,to;\n\tchar buf[2];\n\n\tfor(int loop = 0; loop < num_door; loop++){\n\t\tscanf(\"%d %d %s\",&from,&to,buf);\n\n\t\tif(buf[0] == 'N'){ //人間用\n\n\t\t\thuman_G[from].push_back(to);\n\t\t\thuman_G[to].push_back(from);\n\n\t\t}else{ //猫用\n\n\t\t\tunite(from,to);\n\n\t\t\tcat_G[from].push_back(to);\n\t\t\tcat_G[to].push_back(from);\n\t\t}\n\t}\n\n\t//最初から自力ゴール可能な領域にいる場合\n\tif(is_same_group(goal,start_cat)){\n\t\tprintf(\"0\\n\");\n\t\treturn;\n\t}\n\n\t/*\n\t * 人間がある部屋に移動する際の最小コストは猫の動きに無関係\n\t */\n\tfor(int i = 0; i <= num_room; i++)min_dist[base_human][i] = BIG_NUM;\n\n\tpriority_queue<Info> Q;\n\tmin_dist[base_human][start_human] = 0;\n\tQ.push(Info(start_human,0));\n\n\tint next_room,next_cost;\n\n\t//人間がある部屋に移動する最短コストを求める(通過できないので、猫用のエッジは無視)\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_cost > min_dist[base_human][Q.top().room_id]){\n\n\t\t\tQ.pop();\n\n\t\t}else{\n\n\t\t\tnext_cost = Q.top().sum_cost+1;\n\n\t\t\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\n\n\t\t\t\tnext_room = human_G[Q.top().room_id][i];\n\n\t\t\t\tif(min_dist[base_human][next_room] > next_cost){\n\t\t\t\t\tmin_dist[base_human][next_room] = next_cost;\n\t\t\t\t\tQ.push(Info(next_room,next_cost));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\t//[猫の初期稼働範囲]への、人間が到達する最短コストを逆算で求める\n\tfor(int i = 0; i <= num_room; i++)min_dist[base_cat][i] = BIG_NUM;\n\n\tmin_dist[base_cat][start_cat] = 0;\n\tQ.push(Info(start_cat,0));\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_cost > min_dist[base_cat][Q.top().room_id]){\n\n\t\t\tQ.pop();\n\n\t\t}else{\n\n\t\t\tif(Q.top().sum_cost == 0){ //★★start地点から移動可能な範囲のみ、猫扉で移動(猫が可能な限り動いた方が最適)★★\n\n\t\t\t\t//猫用エッジ\n\t\t\t\tfor(int i = 0; i < cat_G[Q.top().room_id].size(); i++){\n\t\t\t\t\tnext_room = cat_G[Q.top().room_id][i];\n\n\t\t\t\t\tif(is_same_group(start_cat,next_room)){ //猫がstart地点から自力で辿り着ける部屋\n\n\t\t\t\t\t\tnext_cost = Q.top().sum_cost;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tnext_cost = Q.top().sum_cost+1;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(min_dist[base_cat][next_room] > next_cost){\n\t\t\t\t\t\tmin_dist[base_cat][next_room] = next_cost;\n\t\t\t\t\t\tQ.push(Info(next_room,next_cost));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t//人間用エッジ\n\t\t\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\n\n\t\t\t\tnext_room = human_G[Q.top().room_id][i];\n\n\t\t\t\tif(is_same_group(start_cat,next_room)){ //猫がstart地点から自力で辿り着ける部屋\n\n\t\t\t\t\tnext_cost = Q.top().sum_cost;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tnext_cost = Q.top().sum_cost+1;\n\t\t\t\t}\n\n\t\t\t\tif(min_dist[base_cat][next_room] > next_cost){\n\t\t\t\t\tmin_dist[base_cat][next_room] = next_cost;\n\t\t\t\t\tQ.push(Info(next_room,next_cost));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\t//[猫が自力でゴールできる領域]への最短コストを求める\n\tfor(int i = 0; i <= num_room; i++)min_dist[base_can_area][i] = BIG_NUM;\n\n\tmin_dist[base_can_area][goal] = 0;\n\tQ.push(Info(goal,0));\n\n\twhile(!Q.empty()){\n\t\tif(Q.top().sum_cost > min_dist[base_can_area][Q.top().room_id]){\n\n\t\t\tQ.pop();\n\n\t\t}else{\n\n\t\t\tif(Q.top().sum_cost == 0){ //★★猫が自力でゴール可能な範囲のみ、猫扉で移動(猫が可能な限り動いた方が最適)★★\n\n\t\t\t\t//猫用エッジ\n\t\t\t\tfor(int i = 0; i < cat_G[Q.top().room_id].size(); i++){\n\t\t\t\t\tnext_room = cat_G[Q.top().room_id][i];\n\n\t\t\t\t\tif(is_same_group(goal,next_room)){ //猫が自力でゴール可の部屋\n\n\t\t\t\t\t\tnext_cost = Q.top().sum_cost;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tnext_cost = Q.top().sum_cost+1;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(min_dist[base_can_area][next_room] > next_cost){\n\t\t\t\t\t\tmin_dist[base_can_area][next_room] = next_cost;\n\t\t\t\t\t\tQ.push(Info(next_room,next_cost));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//人間用エッジ\n\t\t\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\n\n\t\t\t\tnext_room = human_G[Q.top().room_id][i];\n\n\t\t\t\tif(is_same_group(goal,next_room)){ //猫が自力でゴール可の部屋\n\n\t\t\t\t\tnext_cost = Q.top().sum_cost;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tnext_cost = Q.top().sum_cost+1;\n\t\t\t\t}\n\n\t\t\t\tif(min_dist[base_can_area][next_room] > next_cost){\n\t\t\t\t\tmin_dist[base_can_area][next_room] = next_cost;\n\t\t\t\t\tQ.push(Info(next_room,next_cost));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tint ans = BIG_NUM;\n\tfor(int i = 0; i <= num_room; i++){\n\t\tif(min_dist[base_human][i] == BIG_NUM || min_dist[base_cat][i] == BIG_NUM || min_dist[base_can_area][i] == BIG_NUM)continue;\n\t\tans = min(ans,min_dist[base_human][i]+min_dist[base_cat][i]+min_dist[base_can_area][i]);\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\tint num_case;\n\n\tscanf(\"%d\",&num_case);\n\n\tgoal = 0;\n\n\tfor(int i = 0; i < num_case; i++){\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":140,"memory_kb":15036,"score_of_the_acc":-0.581,"final_rank":10},{"submission_id":"aoj_2193_2642242","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\n\nstruct UnionFind {\n\tvector<int> data;\n\tUnionFind(int size) : data(size, -1) { }\n\tbool unionSet(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (x != y) {\n\t\t\tif (data[y] < data[x]) swap(x, y);\n\t\t\tdata[x] += data[y]; data[y] = x;\n\t\t}\n\t\treturn x != y;\n\t}\n\tint root(int x) {\n\t\treturn data[x] < 0 ? x : data[x] = root(data[x]);\n\t}\n\tint size(int x) {\n\t\treturn -data[root(x)];\n\t}\n};\n\nvector<int>diss(const vector<int> goals, const vector<vector<int>>&edges) {\n\tqueue<int>que;\n\tvector<int>memo(edges.size(),1e8);\n\tfor (auto goal : goals) {\n\t\tmemo[goal]=0;\n\t\tque.push(goal);\n\t}\n\twhile (!que.empty()) {\n\t\tauto now(que.front());\n\t\tque.pop();\n\t\tfor (auto e : edges[now]) {\n\t\t\tif (memo[e] > memo[now] + 1) {\n\t\t\t\tmemo[e]=memo[now]+1;\n\t\t\t\tque.push(e);\n\t\t\t}\n\t\t}\n\t}\n\treturn memo;\n}\n\nint main() {\n\tint Q;cin>>Q;\n\twhile (Q--) {\n\t\tint N,M;cin>>N>>M;\n\t\tvector<vector<int>>edges(N+1);\n\t\tint natu,reno;cin>>natu>>reno;\n\t\tUnionFind uf(N+1);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint a,b;char ch;cin>>a>>b>>ch;\n\t\t\tif (ch == 'N') {\n\t\t\t\tedges[a].push_back(b);\n\t\t\t\tedges[b].push_back(a);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf.unionSet(a,b);\n\t\t\t}\n\t\t}\n\t\tvector<int>reno_same;\n\t\tvector<int>goal_same;\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tif(uf.root(i)==uf.root(reno))reno_same.push_back(i);\n\t\t\tif(uf.root(i)==uf.root(0))goal_same.push_back(i);\n\t\t}\n\t\tauto natu_dis(diss(vector<int>{natu}, edges));\n\t\tauto goal_dis(diss(goal_same, edges));\n\t\tauto reno_dis(diss(reno_same,edges));\n\n\t\tint ans=1e9;\n\t\tfor (int i = 0; i <= N; ++i) {\n\t\t\tint sum=natu_dis[i]+goal_dis[i]+reno_dis[i];\n\t\t\tif(ans>sum)ans=sum;\n\t\t}\n\t\tif(uf.root(reno)==uf.root(0))ans=0;\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":9984,"score_of_the_acc":-0.4722,"final_rank":7},{"submission_id":"aoj_2193_1417664","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <map>\n#include <climits>\n#include <complex>\n#include <numeric>\nusing namespace std;\n\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,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)\n#define ALL(c) (c).begin(), (c).end()\n\ntypedef long long int ll;\ntypedef pair<int, int> pii;\ntypedef pair<int, pair<int, int> > pipii;\ntypedef vector<int> vi;\n\nconst int MOD = 1e9+7;\n\n\ntypedef int Weight;\nconst Weight INF=99999999;\nstruct Edge{\n int src,dst;\n Weight weight;\n int rev;\n Edge(int f, int t, Weight c, int rev=0):src(f),dst(t),weight(c),rev(rev){}\n bool operator < (const Edge& re)const{ return weight > re.weight;}\n};\ntypedef vector<vector<Edge> > Graph;\nvoid add_edge(Graph &G, int s, int t, Weight cap){\n G[s].push_back(Edge(s, t, cap, G[t].size()));\n}\nvoid shortestPath(const Graph &g, int s, vector<Weight> &dist, vector<int> &prev) {\n int n = g.size();\n dist.assign(n, INF); dist[s] = 0;\n prev.assign(n, -1);\n priority_queue<Edge> Q;\n for(Q.push(Edge(-2, s, 0)); !Q.empty();){\n Edge e = Q.top(); Q.pop();\n if(prev[e.dst] != -1) continue;\n prev[e.dst] = e.src;\n FOR(f,g[e.dst]) {\n if (dist[f->dst] > e.weight+f->weight){\n dist[f->dst] = e.weight+f->weight;\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\n }\n }\n }\n}\nvoid bfs(const Graph &g, int s, vector<Weight> &dist, vector<int> &prev) {\n int n = g.size();\n dist.assign(n, INF); dist[s] = 0;\n prev.assign(n, -1);\n priority_queue<Edge> Q;\n for(Q.push(Edge(-2, s, 0)); !Q.empty();){\n Edge e = Q.top(); Q.pop();\n if(prev[e.dst] != -1) continue;\n prev[e.dst] = e.src;\n FOR(f,g[e.dst]) {\n if(e.weight != 0 && f->weight == 0) continue;\n if (dist[f->dst] > e.weight+f->weight){\n dist[f->dst] = e.weight+f->weight;\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\n }\n }\n }\n}\n\n\nint main(void){\n int t;\n cin >> t;\n while(t--){\n int n, m;\n cin >> n >> m;\n int natsume, lennon;\n cin >> natsume >> lennon;\n natsume--; lennon--;\n Graph g(n), lg(n), sg(n);\n int summer, tosummer = 0;\n vector<pii> cat;\n REP(i, m){\n int x, y; char c;\n cin >> x >> y >> c;\n x--; y--;\n\n if(min(x, y) == -1){\n summer = max(x, y);\n if(c == 'N') tosummer = 1; \n else tosummer = 0;\n continue;\n }\n\n if(c == 'N'){\n add_edge(g, x ,y, 1);\n add_edge(g, y, x, 1);\n add_edge(lg, x ,y, 1);\n add_edge(lg, y, x, 1);\n add_edge(sg, x ,y, 1);\n add_edge(sg, y, x, 1);\n }else{\n cat.push_back(pii(x, y));\n add_edge(lg, x ,y, 0);\n add_edge(lg, y ,x, 0);\n }\n }\n if(!tosummer){\n FOR(e, cat){\n add_edge(sg, (*e).first, (*e).second, 0); \n add_edge(sg, (*e).second, (*e).first, 0);\n }\n }\n vi dist_g, dist_lg, dist_sg, prev;\n shortestPath(g, natsume, dist_g, prev);\n prev.clear();\n bfs(lg, lennon, dist_lg, prev);\n prev.clear();\n bfs(sg, summer, dist_sg, prev);\n int ans = INF;\n if(!tosummer && dist_sg[lennon] == 0){\n cout << 0 << endl;\n continue;\n }\n REP(i, n){\n //cout << dist_g[i] << \":\" << dist_lg[i] << \":\" << dist_sg[i] << endl;\n ans = min(ans, dist_g[i] + dist_lg[i] + dist_sg[i] + tosummer);\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":600,"memory_kb":25492,"score_of_the_acc":-1.8833,"final_rank":19},{"submission_id":"aoj_2193_1417430","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<set>\n#include<map>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<complex>\n#include<tuple>\n\nusing namespace std;\n\n#define reep(i, s, n) for(int i=s;i<(int)n;i++)\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 all(v) v.begin(), v.end()\n#define tyd typedef\n#define vc vector\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\nconst int INF = 1<<28;\t\n\nint T, n, m, nat, len;\n\nstruct UnionFind{\n\tvector<int> d;\n\tUnionFind(int n):d(n, -1){}\n\tbool unite(int x, int y){\n\t\tif((x = root(x)) != (y = root(y))){\n\t\t\tif(d[y] < d[x]) swap(x, y);\n\t\t\td[x] += d[y]; d[y] = x;\n\t\t}\n\t\treturn x != y;\n\t}\n\tint root(int x){return d[x] < 0 ? x : d[x] = root(d[x]);}\n};\n\nvi bfs(const vector<vi> &g, vi s){\n\tvi dp(n+1, INF);\n\tqueue<int> q;\n\tfor(int u : s){\n\t\tq.push(u);\n\t\tdp[u] = 0;\n\t}\n\twhile(!q.empty()){\n\t\tint u = q.front(); q.pop();\n\t\tfor(int v : g[u])if(dp[u]+1 < dp[v]){\n\t\t\tq.push(v);\n\t\t\tdp[v] = dp[u] + 1;\n\t\t}\n\t}\n\treturn dp;\n}\n\n\nint main(){\n\tcin >> T;\n\twhile(T--){\n\t\tcin >> n >> m >> nat >> len;\n\t\tvector<vi> g(n+1);\n\t\tUnionFind uf(n+1);\n\t\tREP(i, m){\n\t\t\tint u, v; char c;\n\t\t\tcin >> u >> v >> c;\n\t\t\tif(c == 'N'){\n\t\t\t\tg[u].pb(v);\n\t\t\t\tg[v].pb(u);\n\t\t\t}else{\n\t\t\t\tuf.unite(u, v);\n\t\t\t}\n\t\t}\n\t\tif(uf.root(0) == uf.root(len)){\n\t\t\tputs(\"0\");\n\t\t\tcontinue;\n\t\t}\n\t\tvi s1, s2;\n\t\tREP(i, n+1) if(uf.root(i) == uf.root(len)) s1.pb(i);\n\t\tREP(i, n+1) if(uf.root(i) == uf.root(0)) s2.pb(i);\n\t\tauto d1 = bfs(g, s1);\n\t\tauto d2 = bfs(g, s2);\n\t\tauto d3 = bfs(g, vi({nat}));\n\t\tREP(i, n)if(uf.root(i) == 0){\n\t\t\td1[i] = d1[0];\n\t\t\td2[i] = d2[0];\n\t\t\td3[i] = d3[0];\n\t\t}\n//\t\tcout << \"uf: \" ;REP(i, n+1) cout << uf.root(i) << \", \"; cout << endl;\n//\t\tcout << \"d1: \" ;REP(i, n+1) cout << d1[i] << \", \"; cout << endl;\n//\t\tcout << \"d2: \" ; REP(i, n+1) cout << d2[i] << \", \"; cout << endl;\n//\t\tcout << \"d3: \" ; REP(i, n+1) cout << d3[i] << \", \"; cout << endl;\n\t\tint ans = INF;\n\t\tREP(i, n) ans = min(ans, d1[i] + d2[i] + d3[i]);\n\t\tif(ans < INF) printf(\"%d\\n\", ans);\n\t\telse puts(\"-1\");\n\t}\n\treturn 0;\n\t\n}","accuracy":1,"time_ms":250,"memory_kb":8124,"score_of_the_acc":-0.4102,"final_rank":4},{"submission_id":"aoj_2193_1371991","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\nusing namespace std;\n\nstruct Edge {\n int dst,weight;\n bool type[2]; // 0 -> hito, 1 -> nyanko\n Edge(int dst=-1,int weight=0,bool a=false,bool b=false) : dst(dst), weight(weight) {\n type[0] = a, type[1] = b;\n }\n};\n\nconst int MAX_V = 100100;\nint V,E,Natsume,Lennon;\nvector<Edge> G[MAX_V];\nint par[MAX_V],rank[MAX_V];\n\ninline void init(int n=MAX_V){ rep(i,n) par[i] = i, rank[i] = 0; }\n\nint find(int x) {\n if( x == par[x] ) return x;\n return par[x] = find(par[x]);\n}\n\nvoid unit(int x,int y){\n x = find(x), y = find(y);\n if( x != y ) {\n if( rank[x] > rank[y] ) par[y] = x;\n else {\n par[x] = y;\n if( par[x] == par[y] ) ++rank[y];\n }\n }\n}\n\nvoid draw(int sp,int type){\n deque<int> deq;\n deq.push_back(sp);\n while( !deq.empty() ){\n int cur = deq.front(); deq.pop_front();\n rep(i,(int)G[cur].size()){\n int next = G[cur][i].dst;\n if( !G[cur][i].type[type] ) continue;\n if( find(cur) != find(next) ) {\n unit(cur,next);\n deq.push_back(next);\n }\n }\n }\n}\n\nconst int IINF = INT_MAX;\nint mindist[3][MAX_V]; // 0-> Natsume, 1-> Summer, 2-> Lennon\n\nvoid calc(int stype,vector<int> &sp){\n rep(i,V) mindist[stype][i] = IINF;\n deque<int> deq;\n rep(i,sp.size()) {\n mindist[stype][sp[i]] = 0;\n deq.push_back(sp[i]);\n }\n while( !deq.empty() ){\n int cur = deq.front(); deq.pop_front();\n rep(i,G[cur].size()){\n int next = G[cur][i].dst;\n if( !G[cur][i].type[0] ) continue;\n if( mindist[stype][next] > mindist[stype][cur] + 1 ){\n mindist[stype][next] = mindist[stype][cur] + 1;\n deq.push_back(next);\n }\n }\n }\n}\n\nvoid compute(){\n draw(0,1);\n draw(Lennon,1);\n if( find(0) == find(Lennon) ) { puts(\"0\"); return; }\n vector<int> sp;\n sp.push_back(Natsume);\n calc(0,sp);\n sp.clear();\n\n rep(i,V) if( find(0) == find(i) ) sp.push_back(i);\n calc(1,sp);\n sp.clear();\n\n rep(i,V) if( find(Lennon) == find(i) ) sp.push_back(i);\n calc(2,sp);\n \n int mini = IINF;\n rep(i,V) if( mindist[0][i] != IINF && mindist[1][i] != IINF && mindist[2][i] != IINF ) {\n mini = min(mini,mindist[0][i]+mindist[1][i]+mindist[2][i]);\n }\n\n cout << mini << endl;\n\n}\n\nint main(int argc,char** argv){\n int T;\n cin >> T;\n while( T-- ) {\n cin >> V >> E;\n cin >> Natsume >> Lennon;\n ++V;\n rep(i,V) G[i].clear();\n init(V);\n rep(_,E){\n int s,t;\n char c;\n cin >> s >> t >> c;\n if( c == 'N' ) {\n G[s].push_back(Edge(t,1,true,false));\n G[t].push_back(Edge(s,1,true,false));\n } else {\n G[s].push_back(Edge(t,0,false,true));\n G[t].push_back(Edge(s,0,false,true));\n }\n }\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":12768,"score_of_the_acc":-0.6982,"final_rank":15},{"submission_id":"aoj_2193_1370304","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nstruct Edge {\n int v, w;\n};\n \ntypedef vector<vector<Edge> > Graph;\ntypedef pair<int, int> Pair;\n \nconst int INF = 1<<28;\n \nint n, m, N, L;\nGraph g;\n \nvector<int> dijkstra(int src, int scost) {\n vector<int> cost(n, INF);\n priority_queue<Pair, vector<Pair>, greater<Pair> > que;\n cost[src] = scost;\n que.push(Pair(scost, src));\n while(que.size()) {\n const Pair s = que.top(); que.pop();\n if(cost[s.second] < s.first) continue;\n for(int i = 0; i < g[s.second].size(); ++i) {\n const Edge &e = g[s.second][i];\n if(s.first && !e.w) continue; //\n const Pair t(s.first + e.w, e.v);\n if(cost[t.second] <= t.first) continue;\n cost[t.second] = t.first;\n que.push(t);\n }\n }\n return cost;\n}\n \nstruct State {\n int v, f, cost;\n bool operator < (const State &s) const {\n return cost > s.cost;\n }\n};\n \nint main() {\n int T; cin >> T;\n while(T--) {\n cin >> n >> m;\n ++n;\n cin >> N >> L;\n g = Graph(n);\n for(int i = 0; i < m; ++i) {\n int a, b; char c;\n cin >> a >> b >> c;\n g[a].push_back((Edge){b, c == 'N'});\n g[b].push_back((Edge){a, c == 'N'});\n }\n vector<int> fromN = dijkstra(N, 1);\n vector<int> fromL = dijkstra(L, 0);\n vector<int> fromS = dijkstra(0, 0);\n if(fromL[0] == 0) {\n cout << 0 << endl;\n continue;\n }\n int res = INF;\n for(int i = 0; i < n; ++i) {\n res = min(res, fromN[i] + fromL[i] + fromS[i] - 1);\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":9096,"score_of_the_acc":-0.66,"final_rank":14},{"submission_id":"aoj_2193_1260877","code_snippet":"#include <iostream>\n#include <complex>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <deque>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <vector>\n#include <set>\n#include <limits>\n#include <cstdio>\n#include <cctype>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <ctime>\nusing namespace std;\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\n#define SORT(v) sort((v).begin(), (v).end())\n#define REVERSE(v) reverse((v).begin(), (v).end())\ntypedef pair<int, int> P;\nconst int INF = 1e9;\n\nint N, M, hs, cs;\n\nvoid dfs(int n, set<int> &S, vector< vector<int> > &es){\n S.insert(n);\n for(int next : es[n]) if(S.find(next) == S.end()) dfs(next, S, es);\n}\n\nvoid bfs(vector< vector<int> > &es, queue<int> &open, vector<int> &closed){\n while(!open.empty()){\n int now = open.front(), cost = closed[now]; open.pop();\n for(int next : es[now]){\n if(closed[next] > cost + 1){\n closed[next] = cost + 1;\n open.push(next);\n }\n }\n }\n}\n\nint main() {\n int T; cin >>T;\n while(T--){\n cin >>N >>M >>hs >>cs;\n N++;\n vector< vector<int> > hes(N), ces(N);\n REP(i, M){\n int a, b; char c; cin >>a >>b >>c;\n if(c == 'N') { hes[a].push_back(b); hes[b].push_back(a); }\n else { ces[a].push_back(b); ces[b].push_back(a); }\n }\n\n set<int> X, Y;\n dfs(cs, X, ces); dfs(0, Y, ces);\n if(X == Y) { cout <<0 <<endl; continue; }\n\n vector<int> A, B, C, ac(N, INF), bc(N, INF), cc(N, INF);\n queue<int> aq, bq, cq;\n aq.push(hs); ac[hs] = 0;\n for(int n : X) { bq.push(n); bc[n] = 0; }\n for(int n : Y) { cq.push(n); cc[n] = 0; }\n bfs(hes, aq, ac);\n bfs(hes, bq, bc);\n bfs(hes, cq, cc);\n\n int ans = INF;\n REP(i, N) ans = min(ans, ac[i] + bc[i] + cc[i]);\n cout <<ans <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":10168,"score_of_the_acc":-0.5816,"final_rank":11},{"submission_id":"aoj_2193_1135459","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<queue>\n#include<vector>\nusing namespace std;\nvector<int> g[110000];\nvector<int> g2[110000];\nchar in[4];\nint v1[110000];\nint v2[110000];\nint A[110000];\nint B[110000];\nint C[110000];\nint main(){\n\tint T;scanf(\"%d\",&T);\n\twhile(T--){\n\t\tint a,b;scanf(\"%d%d\",&a,&b);\n\t\tint c,d;scanf(\"%d%d\",&c,&d);\n\t\tfor(int i=0;i<a+1;i++)g[i].clear();\n\t\tfor(int i=0;i<a+1;i++)g2[i].clear();\n\t\tfor(int i=0;i<b;i++){\n\t\t\tint p,q;scanf(\"%d%d%s\",&p,&q,in);\n\t\t\tif(in[0]=='N'){\n\t\t\t\tg[p].push_back(q);\n\t\t\t\tg[q].push_back(p);\n\t\t\t}else{\n\t\t\t\tg2[p].push_back(q);\n\t\t\t\tg2[q].push_back(p);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a+1;i++)v1[i]=v2[i]=0;\n\t\tqueue<int>Q;\n\t\tQ.push(0);\n\t\tv1[0]=1;\n\t\twhile(Q.size()){\n\t\t\tint at=Q.front();Q.pop();\n\t\t\tfor(int i=0;i<g2[at].size();i++)if(!v1[g2[at][i]]){\n\t\t\t\tv1[g2[at][i]]=1;\n\t\t\t\tQ.push(g2[at][i]);\n\t\t\t}\n\t\t}\n\t\tv2[d]=1;\n\t\tQ.push(d);\n\t\twhile(Q.size()){\n\t\t\tint at=Q.front();Q.pop();\n\t\t\tfor(int i=0;i<g2[at].size();i++)if(!v2[g2[at][i]]){\n\t\t\t\tv2[g2[at][i]]=1;\n\t\t\t\tQ.push(g2[at][i]);\n\t\t\t}\n\t\t}\n\t\tif(v1[d]){\n\t\t\tprintf(\"0\\n\");continue;\n\t\t}\n\t\tfor(int i=0;i<a+1;i++)A[i]=B[i]=C[i]=99999999;\n\t\tA[c]=0;\n\t\tQ.push(c);\n\t\twhile(Q.size()){\n\t\t\tint at=Q.front();Q.pop();\n\t\t\tfor(int i=0;i<g[at].size();i++){\n\t\t\t\tif(A[g[at][i]]>9999999){\n\t\t\t\t\tA[g[at][i]]=A[at]+1;\n\t\t\t\t\tQ.push(g[at][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a+1;i++)if(v1[i]){\n\t\t\tQ.push(i);\n\t\t\tB[i]=0;\n\t\t}\n\t\twhile(Q.size()){\n\t\t\tint at=Q.front();Q.pop();\n\t\t\tfor(int i=0;i<g[at].size();i++){\n\t\t\t\tif(B[g[at][i]]>9999999){\n\t\t\t\t\tB[g[at][i]]=B[at]+1;\n\t\t\t\t\tQ.push(g[at][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a+1;i++)if(v2[i]){\n\t\t\tQ.push(i);\n\t\t\tC[i]=0;\n\t\t}\n\t\twhile(Q.size()){\n\t\t\tint at=Q.front();Q.pop();\n\t\t\tfor(int i=0;i<g[at].size();i++){\n\t\t\t\tif(C[g[at][i]]>9999999){\n\t\t\t\t\tC[g[at][i]]=C[at]+1;\n\t\t\t\t\tQ.push(g[at][i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ret=999999999;\n\t\tfor(int i=0;i<a+1;i++)ret=min(ret,A[i]+B[i]+C[i]);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":140,"memory_kb":13312,"score_of_the_acc":-0.4927,"final_rank":8},{"submission_id":"aoj_2193_563658","code_snippet":"#include<cstdio>\n#include<vector>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\nclass union_find{\n\tvector<int> a;\npublic:\n\tunion_find(int n):a(n,-1){}\n\tint find(int x){\n\t\tif(a[x]<0) return x;\n\t\treturn a[x]=find(a[x]);\n\t}\n\tvoid unite(int x,int y){\n\t\tx=find(x),y=find(y);\n\t\tif(x!=y){ a[x]+=a[y]; a[y]=x; }\n\t}\n};\n\nint main(){\n\tint T; scanf(\"%d\",&T);\n\twhile(T--){\n\t\tint n,m,natsume,renon; scanf(\"%d%d%d%d\",&n,&m,&natsume,&renon);\n\n\t\tstatic vector<int> G[100001]; // Natsume graph\n\t\trep(u,n+1) G[u].clear();\n\n\t\tunion_find U(n+1);\n\t\trep(i,m){\n\t\t\tint u,v;\n\t\t\tchar c; scanf(\"%d%d %c\",&u,&v,&c);\n\t\t\tif(c=='N'){\n\t\t\t\tG[u].push_back(v);\n\t\t\t\tG[v].push_back(u);\n\t\t\t}\n\t\t\telse U.unite(u,v);\n\t\t}\n\n\t\tif(U.find(renon)==U.find(0)){ puts(\"0\"); continue; }\n\n\t\tstatic int d1[100001]; // d1[u] := dist(Natsume,u)\n\t\trep(u,n+1) d1[u]=INF;\n\t\t{\n\t\t\tint head=0,tail=0;\n\t\t\tstatic int Q[100001];\n\t\t\td1[natsume]=0;\n\t\t\tQ[tail++]=natsume;\n\t\t\twhile(head<tail){\n\t\t\t\tint u=Q[head++];\n\t\t\t\trep(i,G[u].size()){\n\t\t\t\t\tint v=G[u][i];\n\t\t\t\t\tif(d1[v]==INF) d1[v]=d1[u]+1, Q[tail++]=v;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tstatic int d2[100001]; // d2[u] := dist(Renon,u)\n\t\trep(u,n+1) d2[u]=INF;\n\t\t{\n\t\t\tint head=0,tail=0;\n\t\t\tstatic int Q[100001];\n\t\t\trep(u,n+1) if(U.find(u)==U.find(renon)) d2[u]=0, Q[tail++]=u;\n\t\t\twhile(head<tail){\n\t\t\t\tint u=Q[head++];\n\t\t\t\trep(i,G[u].size()){\n\t\t\t\t\tint v=G[u][i];\n\t\t\t\t\tif(d2[v]==INF) d2[v]=d2[u]+1, Q[tail++]=v;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tstatic int d3[100001]; // d3[u] := dist(summer,u)\n\t\trep(u,n+1) d3[u]=INF;\n\t\t{\n\t\t\tint head=0,tail=0;\n\t\t\tstatic int Q[100001];\n\t\t\trep(u,n+1) if(U.find(u)==U.find(0)) d3[u]=0, Q[tail++]=u;\n\t\t\twhile(head<tail){\n\t\t\t\tint u=Q[head++];\n\t\t\t\trep(i,G[u].size()){\n\t\t\t\t\tint v=G[u][i];\n\t\t\t\t\tif(d3[v]==INF) d3[v]=d3[u]+1, Q[tail++]=v;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans=INF;\n\t\trep(u,n+1) ans=min(ans,d1[u]+d2[u]+d3[u]);\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":9516,"score_of_the_acc":-0.2816,"final_rank":3},{"submission_id":"aoj_2193_501281","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <bitset>\n#include <numeric>\n#include <climits>\n#include <cfloat>\nusing namespace std;\n\nconst int INF = INT_MAX / 4;\n\nvoid catMove(const vector<vector<int> >& edges, int start, vector<bool>& move)\n{\n int n = edges.size();\n move.assign(n, false);\n move[start] = true;\n queue<int> q;\n q.push(start);\n\n while(!q.empty()){\n int s = q.front();\n q.pop();\n for(unsigned i=0; i<edges[s].size(); ++i){\n int t = edges[s][i];\n if(!move[t]){\n move[t] = true;\n q.push(t);\n }\n }\n }\n}\n\nvoid humanMove(const vector<vector<int> >& edges, const vector<bool>& start, vector<int>& cost)\n{\n int n = edges.size();\n cost.assign(n, INF);\n queue<int> q;\n for(int i=0; i<n; ++i){\n if(start[i]){\n cost[i] = 0;\n q.push(i);\n }\n }\n\n while(!q.empty()){\n int s = q.front();\n q.pop();\n for(unsigned i=0; i<edges[s].size(); ++i){\n int t = edges[s][i];\n if(cost[t] == INF){\n cost[t] = cost[s] + 1;\n q.push(t);\n }\n }\n }\n}\n\nint main()\n{\n int d;\n cin >> d;\n\n while(--d >= 0){\n int n, m, sh, sc;\n cin >> n >> m >> sh >> sc;\n\n vector<vector<int> > edgesH(n+1), edgesC(n+1);\n for(int i=0; i<m; ++i){\n int a, b;\n char c;\n cin >> a >> b >> c;\n\n if(c == 'N'){\n edgesH[a].push_back(b);\n edgesH[b].push_back(a);\n }else{\n edgesC[a].push_back(b);\n edgesC[b].push_back(a);\n }\n }\n\n vector<bool> move1, move2;\n catMove(edgesC, 0, move1);\n catMove(edgesC, sc, move2);\n\n vector<bool> move3(n+1);\n move3[sh] = true;\n\n if(move1[sc]){\n cout << 0 << endl;\n continue;\n }\n\n vector<int> cost1, cost2, cost3;\n humanMove(edgesH, move1, cost1);\n humanMove(edgesH, move2, cost2);\n humanMove(edgesH, move3, cost3);\n\n int ret = INF;\n for(int i=0; i<=n; ++i)\n ret = min(ret, cost1[i] + cost2[i] + cost3[i]);\n cout << ret << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":10244,"score_of_the_acc":-0.6355,"final_rank":13},{"submission_id":"aoj_2193_406144","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\nstruct Edge {\n int dst;\n char c;\n};\n\ntypedef vector<vector<Edge> > G;\nconst int N = 100005;\nbool visited[N];\n\nvoid bfs(const G &g, int s, vector<int> &v) {\n int n = g.size();\n REP(i,n) visited[i] = 0;\n queue<int> Q; Q.push(s);\n visited[s] = 1;\n while(!Q.empty()) {\n int now = Q.front(); Q.pop();\n v.push_back(now);\n FOR(it, g[now]) {\n if (it->c == 'N') continue;\n int dst = it->dst;\n if (!visited[dst]) {\n visited[dst] = 1;\n Q.push(dst);\n }\n }\n }\n}\n\nvoid bfs2(const G &g, const vector<int> &v, int *dist) {\n int n = g.size();\n REP(i,n) dist[i] = INF;\n queue<int> Q;\n FOR(it, v) {\n Q.push(*it);\n dist[*it] = 0;\n }\n while(!Q.empty()) {\n int now = Q.front(); Q.pop();\n FOR(it, g[now]) {\n if (it->c == 'L') continue;\n int dst = it->dst;\n if (dist[dst] == INF) {\n dist[dst] = dist[now] + 1;\n Q.push(dst);\n }\n }\n }\n}\n\nint dist1[N];\nint dist2[N];\nint dist3[N];\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n int n, m;\n cin >> n >> m;\n int ns, ls;\n cin >> ns >> ls;\n G g(n+1);\n REP(i,m) {\n char c;\n int a,b;\n cin >> a >> b >> c;\n g[a].push_back((Edge){b,c});\n g[b].push_back((Edge){a,c});\n }\n vector<int> vA; // レノンがいる場所から自由にいける場所\n vector<int> vB; // 夏への扉から自由にいける場所\n bfs(g,ls,vA);\n bfs(g,0,vB);\n if (find(ALL(vA),0) != vA.end()) {\n cout << 0 << endl;\n continue;\n }\n bfs2(g,vA,dist1);\n bfs2(g,vB,dist2);\n bfs2(g,vector<int>(1,ns),dist3);\n int ans = INF;\n REP(i,n+1) {\n //cout << dist1[i] << \" \" << dist2[i] << \" \" << dist3[i] << endl;\n ans = min(ans, dist1[i]+dist2[i]+dist3[i]);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":560,"memory_kb":5972,"score_of_the_acc":-0.8167,"final_rank":16},{"submission_id":"aoj_2193_316557","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\ntypedef vector<int> Edges;\ntypedef vector<Edges> Graph;\n\nstruct Node {\n int state;\n int from;\n int cost;\n Node(int state, int from, int cost) :\n state(state), from(from), cost(cost) {;}\n bool operator<(const Node &rhs) const {\n return cost > rhs.cost;\n }\n};\n\nint natume;\nint lennon;\nint n, m;\nGraph mainG;\nGraph nekoG;\nbool end[100010];\nint dist[100010];\nbool visit[2][100010];\n\nint main() {\n int test;\n scanf(\"%d\", &test);\n while (test--) {\n MEMSET(dist, 0x0f);\n MEMSET(end, false);\n scanf(\"%d %d\", &n, &m);\n scanf(\"%d %d\", &natume, &lennon);\n mainG = Graph(n + 1);\n nekoG = Graph(n + 1);\n REP(i, m) {\n int f, t;\n char c;\n scanf(\"%d %d %c\", &f, &t, &c);\n if (c == 'N') {\n mainG[f].push_back(t);\n mainG[t].push_back(f);\n } else {\n nekoG[f].push_back(t);\n nekoG[t].push_back(f);\n }\n }\n\n // clac end\n {\n queue<int> que;\n que.push(lennon);\n end[lennon] = true;\n while (!que.empty()) {\n int from = que.front();\n que.pop();\n FORIT(it, nekoG[from]) {\n int to = *it;\n if (end[to]) { continue; }\n end[to] = true;\n que.push(to);\n }\n }\n }\n if (end[0]) {\n puts(\"0\");\n continue;\n }\n\n // calc dist\n {\n queue<pair<int, int> > que;\n que.push(make_pair(natume, 0));\n MEMSET(visit, false);\n while (!que.empty()) {\n int from = que.front().first;\n int cost = que.front().second;\n que.pop();\n if (visit[0][from]) { continue; }\n visit[0][from] = true;\n dist[from] = cost;\n FORIT(it, mainG[from]) {\n int to = *it;\n if (visit[0][to]) { continue; }\n que.push(make_pair(to, cost + 1));\n }\n }\n }\n\n\n priority_queue<Node> pque;\n // push pque\n {\n queue<int> que;\n que.push(0);\n MEMSET(visit, false);\n visit[0][0] = true;\n while (!que.empty()) {\n int from = que.front();\n que.pop();\n pque.push(Node(0, from, 0));\n FORIT(it, nekoG[from]) {\n int to = *it;\n if (visit[0][to]) { continue; }\n visit[0][to] = true;\n que.push(to);\n }\n }\n }\n\n // calc ans\n MEMSET(visit, false);\n while (!pque.empty()) {\n int state = pque.top().state;\n int from = pque.top().from;\n int cost = pque.top().cost;\n pque.pop();\n if (visit[state][from]) { continue; }\n visit[state][from] = true;\n if (state == 1 && end[from]) {\n printf(\"%d\\n\", cost);\n break;\n }\n FORIT(it, mainG[from]) {\n int to = *it;\n if (visit[state][to]) { continue; }\n int ncost = cost + 1;\n pque.push(Node(state, to, ncost));\n }\n if (state == 0) {\n pque.push(Node(1, from, cost + dist[from]));\n }\n }\n }\n}","accuracy":1,"time_ms":320,"memory_kb":7584,"score_of_the_acc":-0.4992,"final_rank":9},{"submission_id":"aoj_2193_211631","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<stack>\n#include<map>\n#include<set>\n#include<queue>\n#include<cstdio>\n#include<climits>\n#include<cmath>\n#include<cstring>\n#include<string>\n#include<sstream>\n#include<numeric>\n#include<cassert>\n\n#define f first\n#define s second\n#define mp make_pair\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\n#define print(x) printf(\"%d\\n\",x)\n\nusing namespace std;\n\ntypedef unsigned int uint;\ntypedef long long ll;\n\nconst int _dx[] = {0,1,0,-1};\nconst int _dy[] = {-1,0,1,0};\n\nint getInt(){\n int ret = 0,c;\n c = getchar();\n while(!isdigit(c)) c = getchar();\n while(isdigit(c)){\n ret *= 10;\n ret += c - '0';\n c = getchar();\n }\n return ret;\n}\n\nint nmemo[100001];\nint nlmemo[100001];\nint nsmemo[100001];\nint lmemo[100001];\nint smemo[100001];\n\nvoid make_memo(const vector<vector<int> > &door, int *memo, const vector<int> &start){\n queue<int> q;\n FOR(it, start){ memo[*it] = 0; q.push(*it); }\n while(q.size()){\n int pos = q.front(); q.pop(); int cnt = memo[pos];\n FOR(it, door[pos]) if(memo[*it] == -1){\n memo[*it] = cnt + 1; q.push(*it);\n }\n }\n}\n\nint main(){\n int c; scanf(\"%d\", &c);\n while(c --> 0){\n int n, m;\n scanf(\"%d%d\", &n, &m);\n \n int natsume, lenon;\n scanf(\"%d%d\", &natsume, &lenon);\n\n vector<vector<int> > ndoor(n+1);\n vector<vector<int> > ldoor(n+1);\n\n REP(i, m){\n int a, b; char p;\n scanf(\"%d%d %c\", &a, &b, &p);\n if(p == 'N'){\n\tndoor[a].push_back(b);\n\tndoor[b].push_back(a);\n }else{\n\tldoor[a].push_back(b);\n\tldoor[b].push_back(a);\n }\n }\n\n REP(i, n+1) nsmemo[i] = nlmemo[i] = nmemo[i] = lmemo[i] = smemo[i] = -1;\n\n make_memo(ndoor, nmemo, vector<int>(1, natsume));\n make_memo(ldoor, lmemo, vector<int>(1, lenon));\n make_memo(ldoor, smemo, vector<int>(1, 0));\n\n if(lmemo[0] != -1){\n print(0);\n }else{\n vector<int> l; REP(i, n+1) if(lmemo[i] != -1) l.push_back(i);\n vector<int> s; REP(i, n+1) if(smemo[i] != -1) s.push_back(i);\n make_memo(ndoor, nlmemo, l);\n make_memo(ndoor, nsmemo, s);\n \n int ans = INT_MAX;\n REP(i, n+1) if(nmemo[i] != -1 && nsmemo[i] != -1 && nlmemo[i] != -1)\n\tans = min(ans, nmemo[i] + nsmemo[i] + nlmemo[i]);\n \n print(ans);\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":7052,"score_of_the_acc":-0.472,"final_rank":6},{"submission_id":"aoj_2193_193950","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <string>\n#include <set>\nusing namespace std;\n\nvector<vector<int> > h_edges, c_edges;\n\nvoid dfs1(set<int> &ss,int start) {\n queue<int> q; q.push(start); ss.insert(start);\n while(!q.empty()) {\n int ns = q.front(); q.pop();\n for(int i=0; i<c_edges[ns].size(); ++i)\n if(ss.find(c_edges[ns][i]) == ss.end()) {\n q.push(c_edges[ns][i]);\n ss.insert(c_edges[ns][i]);\n }\n }\n}\n\nvoid bfs(queue<int> &q,vector<int> &dist) {\n while(!q.empty()) {\n int ns = q.front(); q.pop();\n for(int i=0; i<h_edges[ns].size(); ++i) {\n if(dist[h_edges[ns][i]] > dist[ns]+1) {\n dist[h_edges[ns][i]] = dist[ns]+1;\n q.push(h_edges[ns][i]);\n }\n }\n }\n}\n\nint main() {\n int n,m,tc,a,b,h_start,c_start;\n string s;\n cin>>tc;\n\n while(tc--) {\n cin>>n>>m;\n cin>>h_start>>c_start;\n h_edges.clear(); c_edges.clear();\n h_edges.resize(n+1); c_edges.resize(n+1);\n\n for(int i=0; i<m; ++i) {\n cin>>a>>b>>s;\n if(s == \"N\") {\n h_edges[a].push_back(b);\n h_edges[b].push_back(a);\n }else{\n c_edges[a].push_back(b);\n c_edges[b].push_back(a);\n }\n }\n\n set<int> canReach,fromGoal;\n // dfs1\n dfs1(canReach, c_start);\n dfs1(fromGoal, 0);\n\n if(canReach.find(0) != canReach.end()) {\n cout<<0<<endl;\n continue;\n }\n\n queue<int> q;\n vector<int> d1(n+1,1<<29), d2(n+1, 1<<29), d3(n+1, 1<<29);\n d1[h_start] = 0; q.push(h_start);\n bfs(q,d1);\n\n// cout<<canReach.size()<<endl;\n for(set<int>::iterator it = canReach.begin();\n it != canReach.end(); ++it) {\n q.push(*it); d2[*it] = 0;\n }\n bfs(q,d2);\n\n for(set<int>::iterator it = fromGoal.begin();\n it != fromGoal.end(); ++it) {\n q.push(*it); d3[*it] = 0;\n }\n bfs(q,d3);\n\n int ans = 1<<29;\n for(int i=0; i<=n; ++i) {\n// cout<<i<<\" -> \"<<d1[i]<<\",\"<<d2[i]<<\",\"<<d3[i]<<endl;\n ans = min(ans, d1[i]+d2[i]+d3[i]);\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":650,"memory_kb":7440,"score_of_the_acc":-1.0419,"final_rank":17},{"submission_id":"aoj_2193_80954","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\nconst int N = 100005;\nconst int inf = ( 1 << 21);\n\n\nclass Edge{\npublic:\n int next,c;\n};\n\nclass state{\npublic:\n int now,c;\n bool operator<(const state & a)const{\n return c > a.c;\n }\n};\n\nvoid dijkstra(vector<int>&ini,int n,vector<Edge> *edge,int *cost){\n rep(i,n)cost[i]=inf;\n \n priority_queue<state> Q;\n rep(i,ini.size()){\n Q.push((state){ini[i],0});\n }\n \n while(!Q.empty()){\n state now = Q.top();Q.pop();\n if (cost[now.now] != inf)continue;\n cost[now.now]=now.c;\n rep(i,edge[now.now].size()){\n int next=edge[now.now][i].next,nec=now.c+edge[now.now][i].c;\n Q.push((state){next,nec});\n }\n }\n}\n\nvector<Edge> Ledge[N],Nedge[N];\nint Lcost[N],Scost[N],Ncost[N];\nint LBFS[N],SBFS[N];\n\ntemplate<class T> void op(T &in,int n){rep(i,n)cout<<in[i]<<' ';cout << endl;}\n\nint solve(int n,int L,int S,int N){\n vector<int> ini;\n ini.push_back(L);\n dijkstra(ini,n,Ledge,LBFS);\n // op(LBFS,n);\n if (LBFS[S] != inf)return 0;//natune is not needed\n ini.clear();\n\n \n\n ini.push_back(S);\n dijkstra(ini,n,Ledge,SBFS);\n ini.clear();\n\n // op(SBFS,n);\n\n\n vector<int> Lini,Nini,Sini;\n Nini.push_back(N);\n rep(i,n){\n if (LBFS[i] != inf)Lini.push_back(i);\n if (SBFS[i] != inf)Sini.push_back(i);\n }\n\n dijkstra(Lini,n,Nedge,Lcost);\n dijkstra(Sini,n,Nedge,Scost);\n dijkstra(Nini,n,Nedge,Ncost);\n\n \n int ans = inf;\n rep(i,n){\n //if (LBFS[i] == inf && SBFS[i] == inf)\n ans=min(ans,Ncost[i]+Scost[i]+Lcost[i]);\n }\n return ans;\n}\n\n\nmain(){\n int te;\n cin>>te;\n while(te--){\n int n,m;\n cin>>n >>m;\n n++;\n rep(i,n)Nedge[i].clear(),Ledge[i].clear();\n int S = 0,L,N;\n cin>>N>>L;\n\n rep(i,m){\n int f,t;\n char k;\n cin>>f>>t>>k;\n if (k == 'L'){\n\tLedge[f].pb((Edge){t,1});\n\tLedge[t].pb((Edge){f,1});\n }else if (k == 'N'){\n\tNedge[f].pb((Edge){t,1});\n\tNedge[t].pb((Edge){f,1});\n }\n }\n cout << solve(n,L,S,N) << endl;\n }\n}","accuracy":1,"time_ms":670,"memory_kb":10000,"score_of_the_acc":-1.2064,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2193_9080420\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n\\n int cnt;\\n cin >> cnt;\\n int n,m,hs,cs;\\n for(int k=0;k<cnt;k++){\\n cin >> n >> m;\\n cin >> hs >> cs;\\n \\n vector<vector<int>> dh(n+1),dc(n+1);\\n int a,b;\\n char c;\\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n if(c=='N'){\\n dh[a].push_back(b);\\n dh[b].push_back(a);\\n }else{\\n dc[a].push_back(b);\\n dc[b].push_back(a);\\n \\n }\\n }\\n \\n vector<bool> cfs(n+1,false),ctg(n+1,false);\\n vector<int> cfsd(n+1,INT_MAX),ctgd(n+1,INT_MAX),hfsd(n+1,INT_MAX);\\n cfs[cs]=true;\\n ctg[0]=true;\\n queue<int> que,ques,queg;\\n que.push(cs);\\n ques.push(cs);\\n cfsd[cs]=0;\\n while(!que.empty()){\\n int cp=que.front();\\n que.pop();\\n for(int i=0;i<(int)dc[cp].size();i++){\\n if(!cfs[dc[cp][i]]){ \\n cfs[dc[cp][i]]=true;\\n que.push(dc[cp][i]);\\n ques.push(dc[cp][i]);\\n cfsd[dc[cp][i]]=0;\\n }\\n }\\n }\\n if(cfs[0]){\\n cout << 0 << endl;\\n continue;\\n }\\n \\n que.push(0);\\n queg.push(0);\\n ctgd[0]=0;\\n while(!que.empty()){\\n int cp=que.front();\\n que.pop();\\n for(int i=0;i<(int)dc[cp].size();i++){\\n if(!ctg[dc[cp][i]]){ \\n ctg[dc[cp][i]]=true;\\n que.push(dc[cp][i]);\\n queg.push(dc[cp][i]);\\n ctgd[dc[cp][i]]=0;\\n }\\n }\\n }\\n \\n while(!ques.empty()){\\n int cp=ques.front();\\n ques.pop();\\n for(int i=0;i<(int)dh[cp].size();i++){\\n if(cfsd[dh[cp][i]]==INT_MAX){\\n cfsd[dh[cp][i]]=cfsd[cp]+1;\\n ques.push(dh[cp][i]);\\n }\\n }\\n }\\n while(!queg.empty()){\\n int cp=queg.front();\\n queg.pop();\\n for(int i=0;i<(int)dh[cp].size();i++){\\n if(ctgd[dh[cp][i]]==INT_MAX){\\n ctgd[dh[cp][i]]=ctgd[cp]+1;\\n queg.push(dh[cp][i]);\\n }\\n }\\n }\\n \\n hfsd[hs]=0;\\n que.push(hs);\\n while(!que.empty()){\\n int hp=que.front();\\n que.pop();\\n for(int i=0;i<(int)dh[hp].size();i++){\\n if(hfsd[dh[hp][i]]==INT_MAX){\\n hfsd[dh[hp][i]]=hfsd[hp]+1;\\n que.push(dh[hp][i]);\\n }\\n }\\n }\\n \\n int ans=INT_MAX;\\n for(int i=0;i<=n;i++){\\n if((cfsd[i]==INT_MAX)||(ctgd[i]==INT_MAX)||(hfsd[i]==INT_MAX)) continue;\\n ans=min(ans,cfsd[i]+ctgd[i]+hfsd[i]);\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 12064,\n \"score_of_the_acc\": -0.4621,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2193_6049702\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nstruct UnionFind{\\n vector<int> par,num;\\n UnionFind(int n):par(n),num(n,1){\\n iota(par.begin(),par.end(),0); //include<numeric>\\n }\\n int find(int v){\\n return (par[v]==v)?v:(par[v]=find(par[v]));\\n }\\n void unite(int u,int v){\\n u=find(u),v=find(v);\\n if(u==v)return;\\n if(num[u]<num[v])swap(u,v);\\n num[u]+=num[v];\\n par[v]=u;\\n }\\n bool same(int u,int v){\\n return find(u) == find(v);\\n }\\n int size(int v){\\n return num[find(v)];\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int qq; cin >> qq;\\n while(qq--){\\n int n,m; cin >> n >> m;\\n UnionFind uf(n+1);\\n vector<vector<int>> g(n+1);\\n int na,le; cin >> na >> le;\\n for(int i=0;i<m;i++){\\n int x,y; cin >> x >> y;\\n char c; cin >> c;\\n if(c == 'N'){\\n g[x].push_back(y);\\n g[y].push_back(x);\\n }\\n else{\\n uf.unite(x, y);\\n }\\n }\\n if(uf.same(le, 0)){\\n cout << 0 << \\\"\\\\n\\\"; continue;\\n }\\n vector<int> dp1(n+1,-1);\\n dp1[na] = 0;\\n queue<int> q; q.push(na);\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp1[t] == -1){\\n dp1[t] = dp1[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n vector<int> dp2(n+1,-1);\\n for(int i=0;i<=n;i++){\\n if(uf.same(le, i)){\\n dp2[i] = 0; q.push(i);\\n }\\n }\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp2[t] == -1){\\n dp2[t] = dp2[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n vector<int> dp3(n+1,-1);\\n for(int i=0;i<=n;i++){\\n if(uf.same(0, i)){\\n dp3[i] = 0; q.push(i);\\n }\\n }\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp3[t] == -1){\\n dp3[t] = dp3[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n int res = 1e9;\\n for(int i=0;i<=n;i++){\\n if(dp1[i] == -1 or dp2[i] == -1 or dp3[i] == -1)continue;\\n res = min(res, dp1[i]+dp2[i]+dp3[i]);\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 10332,\n \"score_of_the_acc\": -0.2234,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2193_6049334\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nstruct UnionFind{\\n vector<int> par,num;\\n UnionFind(int n):par(n),num(n,1){\\n iota(par.begin(),par.end(),0); //include<numeric>\\n }\\n int find(int v){\\n return (par[v]==v)?v:(par[v]=find(par[v]));\\n }\\n void unite(int u,int v){\\n u=find(u),v=find(v);\\n if(u==v)return;\\n if(num[u]<num[v])swap(u,v);\\n num[u]+=num[v];\\n par[v]=u;\\n }\\n bool same(int u,int v){\\n return find(u) == find(v);\\n }\\n int size(int v){\\n return num[find(v)];\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int qq; cin >> qq;\\n while(qq--){\\n int n,m; cin >> n >> m;\\n UnionFind uf(n+1);\\n vector<vector<int>> g(n+1);\\n int na,le; cin >> na >> le;\\n for(int i=0;i<m;i++){\\n int x,y; cin >> x >> y;\\n char c; cin >> c;\\n if(c == 'N'){\\n g[x].push_back(y);\\n g[y].push_back(x);\\n }\\n else{\\n uf.unite(x, y);\\n }\\n }\\n if(uf.same(le, 0)){\\n cout << 0 << \\\"\\\\n\\\"; continue;\\n }\\n vector<int> dp1(n+1,-1);\\n dp1[na] = 0;\\n queue<int> q; q.push(na);\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp1[t] == -1){\\n dp1[t] = dp1[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n vector<int> dp2(n+1,-1);\\n for(int i=0;i<=n;i++){\\n if(uf.same(le, i)){\\n dp2[i] = 0; q.push(i);\\n }\\n }\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp2[t] == -1){\\n dp2[t] = dp2[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n vector<int> dp3(n+1,-1);\\n for(int i=0;i<=n;i++){\\n if(uf.same(0, i)){\\n dp3[i] = 0; q.push(i);\\n }\\n }\\n while(q.size()){\\n int s = q.front(); q.pop();\\n for(int t:g[s]){\\n if(dp3[t] == -1){\\n dp3[t] = dp3[s]+1;\\n q.push(t);\\n }\\n }\\n }\\n int res = 1e9;\\n for(int i=0;i<=n;i++){\\n if(dp1[i] == -1 or dp2[i] == -1 or dp3[i] == -1)continue;\\n res = min(res, dp1[i]+dp2[i]+dp3[i]);\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 10480,\n \"score_of_the_acc\": -0.2309,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2193_4626732\",\n \"code_snippet\": \"#include <iostream>\\n#include <utility>\\n#include <tuple>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <array>\\n#include <string>\\n#include <stack>\\n#include <cassert>\\n#include <memory>\\n#include <random>\\n\\n\\nint main() {\\n\\tint t; std::cin >> t;\\n\\tfor (; t > 0; --t) {\\n\\t\\tint n, m; std::cin >> n >> m;\\n\\t\\tint human_start, cat_start; std::cin >> human_start >> cat_start;\\n\\t\\tstd::vector<std::vector<int>> rooms(n + 1), for_cat(n + 1);\\n\\t\\tfor (auto i = 0; i < m; ++i) {\\n\\t\\t\\tint a, b; std::string type; std::cin >> a >> b >> type;\\n\\t\\t\\tif (type == \\\"N\\\") {\\n\\t\\t\\t\\trooms[a].push_back(b);\\n\\t\\t\\t\\trooms[b].push_back(a);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfor_cat[a].push_back(b);\\n\\t\\t\\t\\tfor_cat[b].push_back(a);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::queue<int> queue;\\n\\t\\tstd::vector<bool> can_move_from_start(n + 1, false), can_move_to_goal(n + 1, false);\\n\\t\\tcan_move_from_start[cat_start] = true; queue.push(cat_start);\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto next : for_cat[top]) if (!can_move_from_start[next]) {\\n\\t\\t\\t\\tcan_move_from_start[next] = true;\\n\\t\\t\\t\\tqueue.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcan_move_to_goal[0] = true; queue.push(0);\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto next : for_cat[top]) if (!can_move_to_goal[next]) {\\n\\t\\t\\t\\tcan_move_to_goal[next] = true;\\n\\t\\t\\t\\tqueue.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::vector<int> from_start(n + 1, INT_MAX), to_goal(n + 1, INT_MAX), from_cat(n + 1, INT_MAX);\\n\\t\\tfor (auto i = 0; i < can_move_to_goal.size(); ++i) if (can_move_to_goal[i]) {\\n\\t\\t\\tto_goal[i] = 0; queue.push(i);\\n\\t\\t}\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto next : rooms[top]) if (to_goal[next] == INT_MAX) {\\n\\t\\t\\t\\tto_goal[next] = to_goal[top] + 1;\\n\\t\\t\\t\\tqueue.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfrom_start[human_start] = 0; queue.push(human_start);\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto next : rooms[top]) if (from_start[next] == INT_MAX) {\\n\\t\\t\\t\\tfrom_start[next] = from_start[top] + 1;\\n\\t\\t\\t\\tqueue.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto i = 0; i < can_move_from_start.size(); ++i) if (can_move_from_start[i]) {\\n\\t\\t\\tfrom_cat[i] = 0; queue.push(i);\\n\\t\\t}\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto next : rooms[top]) if (from_cat[next] == INT_MAX) {\\n\\t\\t\\t\\tfrom_cat[next] = from_cat[top] + 1;\\n\\t\\t\\t\\tqueue.push(next);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint min_open = INT_MAX;\\n\\t\\tfor (auto i = 0; i < n + 1; ++i) {\\n\\t\\t\\tif (from_start[i] == INT_MAX || to_goal[i] == INT_MAX || from_cat[i] == INT_MAX) continue;\\n\\t\\t\\tif (can_move_from_start[i] && can_move_to_goal[i]) {\\n\\t\\t\\t\\tmin_open = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tmin_open = std::min(min_open, from_start[i] + to_goal[i] + from_cat[i]);\\n\\t\\t}\\n\\t\\tstd::cout << min_open << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 11936,\n \"score_of_the_acc\": -0.6055,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2193_3110473\",\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\\nenum Type{\\n\\tbase_human,\\n\\tbase_cat,\\n\\tbase_can_area,\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_room_id,int arg_sum_cost){\\n\\t\\troom_id = arg_room_id;\\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 room_id,sum_cost;\\n};\\n\\nint goal;\\nint num_room,num_door;\\nint min_dist[3][NUM];\\nint height[NUM],boss[NUM];\\nvector<int> human_G[NUM],cat_G[NUM];\\n\\nint get_boss(int id){\\n\\tif(boss[id] == id)return id;\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]);\\n\\t}\\n}\\n\\nint is_same_group(int x,int y){\\n\\treturn get_boss(x) == get_boss(y);\\n}\\n\\nvoid unite(int x,int y){\\n\\tint boss_x = get_boss(x);\\n\\tint boss_y = get_boss(y);\\n\\n\\t//既に同じグループなら何もしない\\n\\tif(boss_x == boss_y)return;\\n\\n\\t//高さが高い方に吸収する\\n\\tif(height[x] > height[y]){\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\n\\t}else if(height[x] < height[y]){\\n\\n\\t\\tboss[boss_x] = boss_y;\\n\\n\\t}else{ //height[x] == height[y]\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\t\\theight[x]++;\\n\\t}\\n}\\n\\nvoid init(){\\n\\tfor(int i = 0; i <= num_room; i++){ //★0が「夏への扉」の先★\\n\\t\\tboss[i] = i;\\n\\t\\theight[i] = 0;\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i <= num_room; i++){\\n\\t\\thuman_G[i].clear();\\n\\t\\tcat_G[i].clear();\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&num_room,&num_door);\\n\\n\\tinit();\\n\\n\\tint start_human,start_cat;\\n\\tscanf(\\\"%d %d\\\",&start_human,&start_cat);\\n\\n\\tint from,to;\\n\\tchar buf[2];\\n\\n\\tfor(int loop = 0; loop < num_door; loop++){\\n\\t\\tscanf(\\\"%d %d %s\\\",&from,&to,buf);\\n\\n\\t\\tif(buf[0] == 'N'){ //人間用\\n\\n\\t\\t\\thuman_G[from].push_back(to);\\n\\t\\t\\thuman_G[to].push_back(from);\\n\\n\\t\\t}else{ //猫用\\n\\n\\t\\t\\tunite(from,to);\\n\\n\\t\\t\\tcat_G[from].push_back(to);\\n\\t\\t\\tcat_G[to].push_back(from);\\n\\t\\t}\\n\\t}\\n\\n\\t//最初から自力ゴール可能な領域にいる場合\\n\\tif(is_same_group(goal,start_cat)){\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\t/*\\n\\t * 人間がある部屋に移動する際の最小コストは猫の動きに無関係\\n\\t */\\n\\tfor(int i = 0; i <= num_room; i++)min_dist[base_human][i] = BIG_NUM;\\n\\n\\tpriority_queue<Info> Q;\\n\\tmin_dist[base_human][start_human] = 0;\\n\\tQ.push(Info(start_human,0));\\n\\n\\tint next_room,next_cost;\\n\\n\\t//人間がある部屋に移動する最短コストを求める(通過できないので、猫用のエッジは無視)\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_cost > min_dist[base_human][Q.top().room_id]){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tnext_cost = Q.top().sum_cost+1;\\n\\n\\t\\t\\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_room = human_G[Q.top().room_id][i];\\n\\n\\t\\t\\t\\tif(min_dist[base_human][next_room] > next_cost){\\n\\t\\t\\t\\t\\tmin_dist[base_human][next_room] = next_cost;\\n\\t\\t\\t\\t\\tQ.push(Info(next_room,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\t//[猫の初期稼働範囲]への、人間が到達する最短コストを逆算で求める\\n\\tfor(int i = 0; i <= num_room; i++)min_dist[base_cat][i] = BIG_NUM;\\n\\n\\tmin_dist[base_cat][start_cat] = 0;\\n\\tQ.push(Info(start_cat,0));\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_cost > min_dist[base_cat][Q.top().room_id]){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(Q.top().sum_cost == 0){ //★★start地点から移動可能な範囲のみ、猫扉で移動(猫が可能な限り動いた方が最適)★★\\n\\n\\t\\t\\t\\t//猫用エッジ\\n\\t\\t\\t\\tfor(int i = 0; i < cat_G[Q.top().room_id].size(); i++){\\n\\t\\t\\t\\t\\tnext_room = cat_G[Q.top().room_id][i];\\n\\n\\t\\t\\t\\t\\tif(is_same_group(start_cat,next_room)){ //猫がstart地点から自力で辿り着ける部屋\\n\\n\\t\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost+1;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(min_dist[base_cat][next_room] > next_cost){\\n\\t\\t\\t\\t\\t\\tmin_dist[base_cat][next_room] = next_cost;\\n\\t\\t\\t\\t\\t\\tQ.push(Info(next_room,next_cost));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//人間用エッジ\\n\\t\\t\\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_room = human_G[Q.top().room_id][i];\\n\\n\\t\\t\\t\\tif(is_same_group(start_cat,next_room)){ //猫がstart地点から自力で辿り着ける部屋\\n\\n\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost+1;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(min_dist[base_cat][next_room] > next_cost){\\n\\t\\t\\t\\t\\tmin_dist[base_cat][next_room] = next_cost;\\n\\t\\t\\t\\t\\tQ.push(Info(next_room,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\t//[猫が自力でゴールできる領域]への最短コストを求める\\n\\tfor(int i = 0; i <= num_room; i++)min_dist[base_can_area][i] = BIG_NUM;\\n\\n\\tmin_dist[base_can_area][goal] = 0;\\n\\tQ.push(Info(goal,0));\\n\\n\\twhile(!Q.empty()){\\n\\t\\tif(Q.top().sum_cost > min_dist[base_can_area][Q.top().room_id]){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(Q.top().sum_cost == 0){ //★★猫が自力でゴール可能な範囲のみ、猫扉で移動(猫が可能な限り動いた方が最適)★★\\n\\n\\t\\t\\t\\t//猫用エッジ\\n\\t\\t\\t\\tfor(int i = 0; i < cat_G[Q.top().room_id].size(); i++){\\n\\t\\t\\t\\t\\tnext_room = cat_G[Q.top().room_id][i];\\n\\n\\t\\t\\t\\t\\tif(is_same_group(goal,next_room)){ //猫が自力でゴール可の部屋\\n\\n\\t\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost+1;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(min_dist[base_can_area][next_room] > next_cost){\\n\\t\\t\\t\\t\\t\\tmin_dist[base_can_area][next_room] = next_cost;\\n\\t\\t\\t\\t\\t\\tQ.push(Info(next_room,next_cost));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//人間用エッジ\\n\\t\\t\\tfor(int i = 0; i < human_G[Q.top().room_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_room = human_G[Q.top().room_id][i];\\n\\n\\t\\t\\t\\tif(is_same_group(goal,next_room)){ //猫が自力でゴール可の部屋\\n\\n\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tnext_cost = Q.top().sum_cost+1;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(min_dist[base_can_area][next_room] > next_cost){\\n\\t\\t\\t\\t\\tmin_dist[base_can_area][next_room] = next_cost;\\n\\t\\t\\t\\t\\tQ.push(Info(next_room,next_cost));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = BIG_NUM;\\n\\tfor(int i = 0; i <= num_room; i++){\\n\\t\\tif(min_dist[base_human][i] == BIG_NUM || min_dist[base_cat][i] == BIG_NUM || min_dist[base_can_area][i] == BIG_NUM)continue;\\n\\t\\tans = min(ans,min_dist[base_human][i]+min_dist[base_cat][i]+min_dist[base_can_area][i]);\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\tint num_case;\\n\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tgoal = 0;\\n\\n\\tfor(int i = 0; i < num_case; i++){\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 15036,\n \"score_of_the_acc\": -0.581,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2193_2642242\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\n\\nstruct UnionFind {\\n\\tvector<int> data;\\n\\tUnionFind(int size) : data(size, -1) { }\\n\\tbool unionSet(int x, int y) {\\n\\t\\tx = root(x); y = root(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (data[y] < data[x]) swap(x, y);\\n\\t\\t\\tdata[x] += data[y]; data[y] = x;\\n\\t\\t}\\n\\t\\treturn x != y;\\n\\t}\\n\\tint root(int x) {\\n\\t\\treturn data[x] < 0 ? x : data[x] = root(data[x]);\\n\\t}\\n\\tint size(int x) {\\n\\t\\treturn -data[root(x)];\\n\\t}\\n};\\n\\nvector<int>diss(const vector<int> goals, const vector<vector<int>>&edges) {\\n\\tqueue<int>que;\\n\\tvector<int>memo(edges.size(),1e8);\\n\\tfor (auto goal : goals) {\\n\\t\\tmemo[goal]=0;\\n\\t\\tque.push(goal);\\n\\t}\\n\\twhile (!que.empty()) {\\n\\t\\tauto now(que.front());\\n\\t\\tque.pop();\\n\\t\\tfor (auto e : edges[now]) {\\n\\t\\t\\tif (memo[e] > memo[now] + 1) {\\n\\t\\t\\t\\tmemo[e]=memo[now]+1;\\n\\t\\t\\t\\tque.push(e);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn memo;\\n}\\n\\nint main() {\\n\\tint Q;cin>>Q;\\n\\twhile (Q--) {\\n\\t\\tint N,M;cin>>N>>M;\\n\\t\\tvector<vector<int>>edges(N+1);\\n\\t\\tint natu,reno;cin>>natu>>reno;\\n\\t\\tUnionFind uf(N+1);\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tint a,b;char ch;cin>>a>>b>>ch;\\n\\t\\t\\tif (ch == 'N') {\\n\\t\\t\\t\\tedges[a].push_back(b);\\n\\t\\t\\t\\tedges[b].push_back(a);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf.unionSet(a,b);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int>reno_same;\\n\\t\\tvector<int>goal_same;\\n\\t\\tfor (int i = 0; i <= N; ++i) {\\n\\t\\t\\tif(uf.root(i)==uf.root(reno))reno_same.push_back(i);\\n\\t\\t\\tif(uf.root(i)==uf.root(0))goal_same.push_back(i);\\n\\t\\t}\\n\\t\\tauto natu_dis(diss(vector<int>{natu}, edges));\\n\\t\\tauto goal_dis(diss(goal_same, edges));\\n\\t\\tauto reno_dis(diss(reno_same,edges));\\n\\n\\t\\tint ans=1e9;\\n\\t\\tfor (int i = 0; i <= N; ++i) {\\n\\t\\t\\tint sum=natu_dis[i]+goal_dis[i]+reno_dis[i];\\n\\t\\t\\tif(ans>sum)ans=sum;\\n\\t\\t}\\n\\t\\tif(uf.root(reno)==uf.root(0))ans=0;\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 9984,\n \"score_of_the_acc\": -0.4722,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2193_1417664\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <queue>\\n#include <map>\\n#include <climits>\\n#include <complex>\\n#include <numeric>\\nusing namespace std;\\n\\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,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n\\ntypedef long long int ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<int, pair<int, int> > pipii;\\ntypedef vector<int> vi;\\n\\nconst int MOD = 1e9+7;\\n\\n\\ntypedef int Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n int src,dst;\\n Weight weight;\\n int rev;\\n Edge(int f, int t, Weight c, int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n bool operator < (const Edge& re)const{ return weight > re.weight;}\\n};\\ntypedef vector<vector<Edge> > Graph;\\nvoid add_edge(Graph &G, int s, int t, Weight cap){\\n G[s].push_back(Edge(s, t, cap, G[t].size()));\\n}\\nvoid shortestPath(const Graph &g, int s, vector<Weight> &dist, vector<int> &prev) {\\n int n = g.size();\\n dist.assign(n, INF); dist[s] = 0;\\n prev.assign(n, -1);\\n priority_queue<Edge> Q;\\n for(Q.push(Edge(-2, s, 0)); !Q.empty();){\\n Edge e = Q.top(); Q.pop();\\n if(prev[e.dst] != -1) continue;\\n prev[e.dst] = e.src;\\n FOR(f,g[e.dst]) {\\n if (dist[f->dst] > e.weight+f->weight){\\n dist[f->dst] = e.weight+f->weight;\\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\\n }\\n }\\n }\\n}\\nvoid bfs(const Graph &g, int s, vector<Weight> &dist, vector<int> &prev) {\\n int n = g.size();\\n dist.assign(n, INF); dist[s] = 0;\\n prev.assign(n, -1);\\n priority_queue<Edge> Q;\\n for(Q.push(Edge(-2, s, 0)); !Q.empty();){\\n Edge e = Q.top(); Q.pop();\\n if(prev[e.dst] != -1) continue;\\n prev[e.dst] = e.src;\\n FOR(f,g[e.dst]) {\\n if(e.weight != 0 && f->weight == 0) continue;\\n if (dist[f->dst] > e.weight+f->weight){\\n dist[f->dst] = e.weight+f->weight;\\n Q.push(Edge(f->src, f->dst, e.weight+f->weight));\\n }\\n }\\n }\\n}\\n\\n\\nint main(void){\\n int t;\\n cin >> t;\\n while(t--){\\n int n, m;\\n cin >> n >> m;\\n int natsume, lennon;\\n cin >> natsume >> lennon;\\n natsume--; lennon--;\\n Graph g(n), lg(n), sg(n);\\n int summer, tosummer = 0;\\n vector<pii> cat;\\n REP(i, m){\\n int x, y; char c;\\n cin >> x >> y >> c;\\n x--; y--;\\n\\n if(min(x, y) == -1){\\n summer = max(x, y);\\n if(c == 'N') tosummer = 1; \\n else tosummer = 0;\\n continue;\\n }\\n\\n if(c == 'N'){\\n add_edge(g, x ,y, 1);\\n add_edge(g, y, x, 1);\\n add_edge(lg, x ,y, 1);\\n add_edge(lg, y, x, 1);\\n add_edge(sg, x ,y, 1);\\n add_edge(sg, y, x, 1);\\n }else{\\n cat.push_back(pii(x, y));\\n add_edge(lg, x ,y, 0);\\n add_edge(lg, y ,x, 0);\\n }\\n }\\n if(!tosummer){\\n FOR(e, cat){\\n add_edge(sg, (*e).first, (*e).second, 0); \\n add_edge(sg, (*e).second, (*e).first, 0);\\n }\\n }\\n vi dist_g, dist_lg, dist_sg, prev;\\n shortestPath(g, natsume, dist_g, prev);\\n prev.clear();\\n bfs(lg, lennon, dist_lg, prev);\\n prev.clear();\\n bfs(sg, summer, dist_sg, prev);\\n int ans = INF;\\n if(!tosummer && dist_sg[lennon] == 0){\\n cout << 0 << endl;\\n continue;\\n }\\n REP(i, n){\\n //cout << dist_g[i] << \\\":\\\" << dist_lg[i] << \\\":\\\" << dist_sg[i] << endl;\\n ans = min(ans, dist_g[i] + dist_lg[i] + dist_sg[i] + tosummer);\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 25492,\n \"score_of_the_acc\": -1.8833,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2193_1417430\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<queue>\\n#include<set>\\n#include<map>\\n#include<cstring>\\n#include<string>\\n#include<sstream>\\n#include<complex>\\n#include<tuple>\\n\\nusing namespace std;\\n\\n#define reep(i, s, n) for(int i=s;i<(int)n;i++)\\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 all(v) v.begin(), v.end()\\n#define tyd typedef\\n#define vc vector\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\nconst int INF = 1<<28;\\t\\n\\nint T, n, m, nat, len;\\n\\nstruct UnionFind{\\n\\tvector<int> d;\\n\\tUnionFind(int n):d(n, -1){}\\n\\tbool unite(int x, int y){\\n\\t\\tif((x = root(x)) != (y = root(y))){\\n\\t\\t\\tif(d[y] < d[x]) swap(x, y);\\n\\t\\t\\td[x] += d[y]; d[y] = x;\\n\\t\\t}\\n\\t\\treturn x != y;\\n\\t}\\n\\tint root(int x){return d[x] < 0 ? x : d[x] = root(d[x]);}\\n};\\n\\nvi bfs(const vector<vi> &g, vi s){\\n\\tvi dp(n+1, INF);\\n\\tqueue<int> q;\\n\\tfor(int u : s){\\n\\t\\tq.push(u);\\n\\t\\tdp[u] = 0;\\n\\t}\\n\\twhile(!q.empty()){\\n\\t\\tint u = q.front(); q.pop();\\n\\t\\tfor(int v : g[u])if(dp[u]+1 < dp[v]){\\n\\t\\t\\tq.push(v);\\n\\t\\t\\tdp[v] = dp[u] + 1;\\n\\t\\t}\\n\\t}\\n\\treturn dp;\\n}\\n\\n\\nint main(){\\n\\tcin >> T;\\n\\twhile(T--){\\n\\t\\tcin >> n >> m >> nat >> len;\\n\\t\\tvector<vi> g(n+1);\\n\\t\\tUnionFind uf(n+1);\\n\\t\\tREP(i, m){\\n\\t\\t\\tint u, v; char c;\\n\\t\\t\\tcin >> u >> v >> c;\\n\\t\\t\\tif(c == 'N'){\\n\\t\\t\\t\\tg[u].pb(v);\\n\\t\\t\\t\\tg[v].pb(u);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tuf.unite(u, v);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(uf.root(0) == uf.root(len)){\\n\\t\\t\\tputs(\\\"0\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tvi s1, s2;\\n\\t\\tREP(i, n+1) if(uf.root(i) == uf.root(len)) s1.pb(i);\\n\\t\\tREP(i, n+1) if(uf.root(i) == uf.root(0)) s2.pb(i);\\n\\t\\tauto d1 = bfs(g, s1);\\n\\t\\tauto d2 = bfs(g, s2);\\n\\t\\tauto d3 = bfs(g, vi({nat}));\\n\\t\\tREP(i, n)if(uf.root(i) == 0){\\n\\t\\t\\td1[i] = d1[0];\\n\\t\\t\\td2[i] = d2[0];\\n\\t\\t\\td3[i] = d3[0];\\n\\t\\t}\\n//\\t\\tcout << \\\"uf: \\\" ;REP(i, n+1) cout << uf.root(i) << \\\", \\\"; cout << endl;\\n//\\t\\tcout << \\\"d1: \\\" ;REP(i, n+1) cout << d1[i] << \\\", \\\"; cout << endl;\\n//\\t\\tcout << \\\"d2: \\\" ; REP(i, n+1) cout << d2[i] << \\\", \\\"; cout << endl;\\n//\\t\\tcout << \\\"d3: \\\" ; REP(i, n+1) cout << d3[i] << \\\", \\\"; cout << endl;\\n\\t\\tint ans = INF;\\n\\t\\tREP(i, n) ans = min(ans, d1[i] + d2[i] + d3[i]);\\n\\t\\tif(ans < INF) printf(\\\"%d\\\\n\\\", ans);\\n\\t\\telse puts(\\\"-1\\\");\\n\\t}\\n\\treturn 0;\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 8124,\n \"score_of_the_acc\": -0.4102,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2193_1371991\",\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\\nusing namespace std;\\n\\nstruct Edge {\\n int dst,weight;\\n bool type[2]; // 0 -> hito, 1 -> nyanko\\n Edge(int dst=-1,int weight=0,bool a=false,bool b=false) : dst(dst), weight(weight) {\\n type[0] = a, type[1] = b;\\n }\\n};\\n\\nconst int MAX_V = 100100;\\nint V,E,Natsume,Lennon;\\nvector<Edge> G[MAX_V];\\nint par[MAX_V],rank[MAX_V];\\n\\ninline void init(int n=MAX_V){ rep(i,n) par[i] = i, rank[i] = 0; }\\n\\nint find(int x) {\\n if( x == par[x] ) return x;\\n return par[x] = find(par[x]);\\n}\\n\\nvoid unit(int x,int y){\\n x = find(x), y = find(y);\\n if( x != y ) {\\n if( rank[x] > rank[y] ) par[y] = x;\\n else {\\n par[x] = y;\\n if( par[x] == par[y] ) ++rank[y];\\n }\\n }\\n}\\n\\nvoid draw(int sp,int type){\\n deque<int> deq;\\n deq.push_back(sp);\\n while( !deq.empty() ){\\n int cur = deq.front(); deq.pop_front();\\n rep(i,(int)G[cur].size()){\\n int next = G[cur][i].dst;\\n if( !G[cur][i].type[type] ) continue;\\n if( find(cur) != find(next) ) {\\n unit(cur,next);\\n deq.push_back(next);\\n }\\n }\\n }\\n}\\n\\nconst int IINF = INT_MAX;\\nint mindist[3][MAX_V]; // 0-> Natsume, 1-> Summer, 2-> Lennon\\n\\nvoid calc(int stype,vector<int> &sp){\\n rep(i,V) mindist[stype][i] = IINF;\\n deque<int> deq;\\n rep(i,sp.size()) {\\n mindist[stype][sp[i]] = 0;\\n deq.push_back(sp[i]);\\n }\\n while( !deq.empty() ){\\n int cur = deq.front(); deq.pop_front();\\n rep(i,G[cur].size()){\\n int next = G[cur][i].dst;\\n if( !G[cur][i].type[0] ) continue;\\n if( mindist[stype][next] > mindist[stype][cur] + 1 ){\\n mindist[stype][next] = mindist[stype][cur] + 1;\\n deq.push_back(next);\\n }\\n }\\n }\\n}\\n\\nvoid compute(){\\n draw(0,1);\\n draw(Lennon,1);\\n if( find(0) == find(Lennon) ) { puts(\\\"0\\\"); return; }\\n vector<int> sp;\\n sp.push_back(Natsume);\\n calc(0,sp);\\n sp.clear();\\n\\n rep(i,V) if( find(0) == find(i) ) sp.push_back(i);\\n calc(1,sp);\\n sp.clear();\\n\\n rep(i,V) if( find(Lennon) == find(i) ) sp.push_back(i);\\n calc(2,sp);\\n \\n int mini = IINF;\\n rep(i,V) if( mindist[0][i] != IINF && mindist[1][i] != IINF && mindist[2][i] != IINF ) {\\n mini = min(mini,mindist[0][i]+mindist[1][i]+mindist[2][i]);\\n }\\n\\n cout << mini << endl;\\n\\n}\\n\\nint main(int argc,char** argv){\\n int T;\\n cin >> T;\\n while( T-- ) {\\n cin >> V >> E;\\n cin >> Natsume >> Lennon;\\n ++V;\\n rep(i,V) G[i].clear();\\n init(V);\\n rep(_,E){\\n int s,t;\\n char c;\\n cin >> s >> t >> c;\\n if( c == 'N' ) {\\n G[s].push_back(Edge(t,1,true,false));\\n G[t].push_back(Edge(s,1,true,false));\\n } else {\\n G[s].push_back(Edge(t,0,false,true));\\n G[t].push_back(Edge(s,0,false,true));\\n }\\n }\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 12768,\n \"score_of_the_acc\": -0.6982,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2193_1370304\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nstruct Edge {\\n int v, w;\\n};\\n \\ntypedef vector<vector<Edge> > Graph;\\ntypedef pair<int, int> Pair;\\n \\nconst int INF = 1<<28;\\n \\nint n, m, N, L;\\nGraph g;\\n \\nvector<int> dijkstra(int src, int scost) {\\n vector<int> cost(n, INF);\\n priority_queue<Pair, vector<Pair>, greater<Pair> > que;\\n cost[src] = scost;\\n que.push(Pair(scost, src));\\n while(que.size()) {\\n const Pair s = que.top(); que.pop();\\n if(cost[s.second] < s.first) continue;\\n for(int i = 0; i < g[s.second].size(); ++i) {\\n const Edge &e = g[s.second][i];\\n if(s.first && !e.w) continue; //\\n const Pair t(s.first + e.w, e.v);\\n if(cost[t.second] <= t.first) continue;\\n cost[t.second] = t.first;\\n que.push(t);\\n }\\n }\\n return cost;\\n}\\n \\nstruct State {\\n int v, f, cost;\\n bool operator < (const State &s) const {\\n return cost > s.cost;\\n }\\n};\\n \\nint main() {\\n int T; cin >> T;\\n while(T--) {\\n cin >> n >> m;\\n ++n;\\n cin >> N >> L;\\n g = Graph(n);\\n for(int i = 0; i < m; ++i) {\\n int a, b; char c;\\n cin >> a >> b >> c;\\n g[a].push_back((Edge){b, c == 'N'});\\n g[b].push_back((Edge){a, c == 'N'});\\n }\\n vector<int> fromN = dijkstra(N, 1);\\n vector<int> fromL = dijkstra(L, 0);\\n vector<int> fromS = dijkstra(0, 0);\\n if(fromL[0] == 0) {\\n cout << 0 << endl;\\n continue;\\n }\\n int res = INF;\\n for(int i = 0; i < n; ++i) {\\n res = min(res, fromN[i] + fromL[i] + fromS[i] - 1);\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 9096,\n \"score_of_the_acc\": -0.66,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2193_1260877\",\n \"code_snippet\": \"#include <iostream>\\n#include <complex>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <deque>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <vector>\\n#include <set>\\n#include <limits>\\n#include <cstdio>\\n#include <cctype>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <ctime>\\nusing namespace std;\\n#define REP(i, j) for(int i = 0; i < (int)(j); ++i)\\n#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define REVERSE(v) reverse((v).begin(), (v).end())\\ntypedef pair<int, int> P;\\nconst int INF = 1e9;\\n\\nint N, M, hs, cs;\\n\\nvoid dfs(int n, set<int> &S, vector< vector<int> > &es){\\n S.insert(n);\\n for(int next : es[n]) if(S.find(next) == S.end()) dfs(next, S, es);\\n}\\n\\nvoid bfs(vector< vector<int> > &es, queue<int> &open, vector<int> &closed){\\n while(!open.empty()){\\n int now = open.front(), cost = closed[now]; open.pop();\\n for(int next : es[now]){\\n if(closed[next] > cost + 1){\\n closed[next] = cost + 1;\\n open.push(next);\\n }\\n }\\n }\\n}\\n\\nint main() {\\n int T; cin >>T;\\n while(T--){\\n cin >>N >>M >>hs >>cs;\\n N++;\\n vector< vector<int> > hes(N), ces(N);\\n REP(i, M){\\n int a, b; char c; cin >>a >>b >>c;\\n if(c == 'N') { hes[a].push_back(b); hes[b].push_back(a); }\\n else { ces[a].push_back(b); ces[b].push_back(a); }\\n }\\n\\n set<int> X, Y;\\n dfs(cs, X, ces); dfs(0, Y, ces);\\n if(X == Y) { cout <<0 <<endl; continue; }\\n\\n vector<int> A, B, C, ac(N, INF), bc(N, INF), cc(N, INF);\\n queue<int> aq, bq, cq;\\n aq.push(hs); ac[hs] = 0;\\n for(int n : X) { bq.push(n); bc[n] = 0; }\\n for(int n : Y) { cq.push(n); cc[n] = 0; }\\n bfs(hes, aq, ac);\\n bfs(hes, bq, bc);\\n bfs(hes, cq, cc);\\n\\n int ans = INF;\\n REP(i, N) ans = min(ans, ac[i] + bc[i] + cc[i]);\\n cout <<ans <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 10168,\n \"score_of_the_acc\": -0.5816,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2193_1135459\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<queue>\\n#include<vector>\\nusing namespace std;\\nvector<int> g[110000];\\nvector<int> g2[110000];\\nchar in[4];\\nint v1[110000];\\nint v2[110000];\\nint A[110000];\\nint B[110000];\\nint C[110000];\\nint main(){\\n\\tint T;scanf(\\\"%d\\\",&T);\\n\\twhile(T--){\\n\\t\\tint a,b;scanf(\\\"%d%d\\\",&a,&b);\\n\\t\\tint c,d;scanf(\\\"%d%d\\\",&c,&d);\\n\\t\\tfor(int i=0;i<a+1;i++)g[i].clear();\\n\\t\\tfor(int i=0;i<a+1;i++)g2[i].clear();\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tint p,q;scanf(\\\"%d%d%s\\\",&p,&q,in);\\n\\t\\t\\tif(in[0]=='N'){\\n\\t\\t\\t\\tg[p].push_back(q);\\n\\t\\t\\t\\tg[q].push_back(p);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tg2[p].push_back(q);\\n\\t\\t\\t\\tg2[q].push_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a+1;i++)v1[i]=v2[i]=0;\\n\\t\\tqueue<int>Q;\\n\\t\\tQ.push(0);\\n\\t\\tv1[0]=1;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint at=Q.front();Q.pop();\\n\\t\\t\\tfor(int i=0;i<g2[at].size();i++)if(!v1[g2[at][i]]){\\n\\t\\t\\t\\tv1[g2[at][i]]=1;\\n\\t\\t\\t\\tQ.push(g2[at][i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv2[d]=1;\\n\\t\\tQ.push(d);\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint at=Q.front();Q.pop();\\n\\t\\t\\tfor(int i=0;i<g2[at].size();i++)if(!v2[g2[at][i]]){\\n\\t\\t\\t\\tv2[g2[at][i]]=1;\\n\\t\\t\\t\\tQ.push(g2[at][i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(v1[d]){\\n\\t\\t\\tprintf(\\\"0\\\\n\\\");continue;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a+1;i++)A[i]=B[i]=C[i]=99999999;\\n\\t\\tA[c]=0;\\n\\t\\tQ.push(c);\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint at=Q.front();Q.pop();\\n\\t\\t\\tfor(int i=0;i<g[at].size();i++){\\n\\t\\t\\t\\tif(A[g[at][i]]>9999999){\\n\\t\\t\\t\\t\\tA[g[at][i]]=A[at]+1;\\n\\t\\t\\t\\t\\tQ.push(g[at][i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a+1;i++)if(v1[i]){\\n\\t\\t\\tQ.push(i);\\n\\t\\t\\tB[i]=0;\\n\\t\\t}\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint at=Q.front();Q.pop();\\n\\t\\t\\tfor(int i=0;i<g[at].size();i++){\\n\\t\\t\\t\\tif(B[g[at][i]]>9999999){\\n\\t\\t\\t\\t\\tB[g[at][i]]=B[at]+1;\\n\\t\\t\\t\\t\\tQ.push(g[at][i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a+1;i++)if(v2[i]){\\n\\t\\t\\tQ.push(i);\\n\\t\\t\\tC[i]=0;\\n\\t\\t}\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint at=Q.front();Q.pop();\\n\\t\\t\\tfor(int i=0;i<g[at].size();i++){\\n\\t\\t\\t\\tif(C[g[at][i]]>9999999){\\n\\t\\t\\t\\t\\tC[g[at][i]]=C[at]+1;\\n\\t\\t\\t\\t\\tQ.push(g[at][i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ret=999999999;\\n\\t\\tfor(int i=0;i<a+1;i++)ret=min(ret,A[i]+B[i]+C[i]);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 13312,\n \"score_of_the_acc\": -0.4927,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2193_563658\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst int INF=1<<29;\\n\\nclass union_find{\\n\\tvector<int> a;\\npublic:\\n\\tunion_find(int n):a(n,-1){}\\n\\tint find(int x){\\n\\t\\tif(a[x]<0) return x;\\n\\t\\treturn a[x]=find(a[x]);\\n\\t}\\n\\tvoid unite(int x,int y){\\n\\t\\tx=find(x),y=find(y);\\n\\t\\tif(x!=y){ a[x]+=a[y]; a[y]=x; }\\n\\t}\\n};\\n\\nint main(){\\n\\tint T; scanf(\\\"%d\\\",&T);\\n\\twhile(T--){\\n\\t\\tint n,m,natsume,renon; scanf(\\\"%d%d%d%d\\\",&n,&m,&natsume,&renon);\\n\\n\\t\\tstatic vector<int> G[100001]; // Natsume graph\\n\\t\\trep(u,n+1) G[u].clear();\\n\\n\\t\\tunion_find U(n+1);\\n\\t\\trep(i,m){\\n\\t\\t\\tint u,v;\\n\\t\\t\\tchar c; scanf(\\\"%d%d %c\\\",&u,&v,&c);\\n\\t\\t\\tif(c=='N'){\\n\\t\\t\\t\\tG[u].push_back(v);\\n\\t\\t\\t\\tG[v].push_back(u);\\n\\t\\t\\t}\\n\\t\\t\\telse U.unite(u,v);\\n\\t\\t}\\n\\n\\t\\tif(U.find(renon)==U.find(0)){ puts(\\\"0\\\"); continue; }\\n\\n\\t\\tstatic int d1[100001]; // d1[u] := dist(Natsume,u)\\n\\t\\trep(u,n+1) d1[u]=INF;\\n\\t\\t{\\n\\t\\t\\tint head=0,tail=0;\\n\\t\\t\\tstatic int Q[100001];\\n\\t\\t\\td1[natsume]=0;\\n\\t\\t\\tQ[tail++]=natsume;\\n\\t\\t\\twhile(head<tail){\\n\\t\\t\\t\\tint u=Q[head++];\\n\\t\\t\\t\\trep(i,G[u].size()){\\n\\t\\t\\t\\t\\tint v=G[u][i];\\n\\t\\t\\t\\t\\tif(d1[v]==INF) d1[v]=d1[u]+1, Q[tail++]=v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tstatic int d2[100001]; // d2[u] := dist(Renon,u)\\n\\t\\trep(u,n+1) d2[u]=INF;\\n\\t\\t{\\n\\t\\t\\tint head=0,tail=0;\\n\\t\\t\\tstatic int Q[100001];\\n\\t\\t\\trep(u,n+1) if(U.find(u)==U.find(renon)) d2[u]=0, Q[tail++]=u;\\n\\t\\t\\twhile(head<tail){\\n\\t\\t\\t\\tint u=Q[head++];\\n\\t\\t\\t\\trep(i,G[u].size()){\\n\\t\\t\\t\\t\\tint v=G[u][i];\\n\\t\\t\\t\\t\\tif(d2[v]==INF) d2[v]=d2[u]+1, Q[tail++]=v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tstatic int d3[100001]; // d3[u] := dist(summer,u)\\n\\t\\trep(u,n+1) d3[u]=INF;\\n\\t\\t{\\n\\t\\t\\tint head=0,tail=0;\\n\\t\\t\\tstatic int Q[100001];\\n\\t\\t\\trep(u,n+1) if(U.find(u)==U.find(0)) d3[u]=0, Q[tail++]=u;\\n\\t\\t\\twhile(head<tail){\\n\\t\\t\\t\\tint u=Q[head++];\\n\\t\\t\\t\\trep(i,G[u].size()){\\n\\t\\t\\t\\t\\tint v=G[u][i];\\n\\t\\t\\t\\t\\tif(d3[v]==INF) d3[v]=d3[u]+1, Q[tail++]=v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint ans=INF;\\n\\t\\trep(u,n+1) ans=min(ans,d1[u]+d2[u]+d3[u]);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 9516,\n \"score_of_the_acc\": -0.2816,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2193_501281\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <numeric>\\n#include <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nconst int INF = INT_MAX / 4;\\n\\nvoid catMove(const vector<vector<int> >& edges, int start, vector<bool>& move)\\n{\\n int n = edges.size();\\n move.assign(n, false);\\n move[start] = true;\\n queue<int> q;\\n q.push(start);\\n\\n while(!q.empty()){\\n int s = q.front();\\n q.pop();\\n for(unsigned i=0; i<edges[s].size(); ++i){\\n int t = edges[s][i];\\n if(!move[t]){\\n move[t] = true;\\n q.push(t);\\n }\\n }\\n }\\n}\\n\\nvoid humanMove(const vector<vector<int> >& edges, const vector<bool>& start, vector<int>& cost)\\n{\\n int n = edges.size();\\n cost.assign(n, INF);\\n queue<int> q;\\n for(int i=0; i<n; ++i){\\n if(start[i]){\\n cost[i] = 0;\\n q.push(i);\\n }\\n }\\n\\n while(!q.empty()){\\n int s = q.front();\\n q.pop();\\n for(unsigned i=0; i<edges[s].size(); ++i){\\n int t = edges[s][i];\\n if(cost[t] == INF){\\n cost[t] = cost[s] + 1;\\n q.push(t);\\n }\\n }\\n }\\n}\\n\\nint main()\\n{\\n int d;\\n cin >> d;\\n\\n while(--d >= 0){\\n int n, m, sh, sc;\\n cin >> n >> m >> sh >> sc;\\n\\n vector<vector<int> > edgesH(n+1), edgesC(n+1);\\n for(int i=0; i<m; ++i){\\n int a, b;\\n char c;\\n cin >> a >> b >> c;\\n\\n if(c == 'N'){\\n edgesH[a].push_back(b);\\n edgesH[b].push_back(a);\\n }else{\\n edgesC[a].push_back(b);\\n edgesC[b].push_back(a);\\n }\\n }\\n\\n vector<bool> move1, move2;\\n catMove(edgesC, 0, move1);\\n catMove(edgesC, sc, move2);\\n\\n vector<bool> move3(n+1);\\n move3[sh] = true;\\n\\n if(move1[sc]){\\n cout << 0 << endl;\\n continue;\\n }\\n\\n vector<int> cost1, cost2, cost3;\\n humanMove(edgesH, move1, cost1);\\n humanMove(edgesH, move2, cost2);\\n humanMove(edgesH, move3, cost3);\\n\\n int ret = INF;\\n for(int i=0; i<=n; ++i)\\n ret = min(ret, cost1[i] + cost2[i] + cost3[i]);\\n cout << ret << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 10244,\n \"score_of_the_acc\": -0.6355,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2193_406144\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <cstdio>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <valarray>\\n#include <bitset>\\n#include <stack>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int INF = 1<<29;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8;\\n\\nstruct Edge {\\n int dst;\\n char c;\\n};\\n\\ntypedef vector<vector<Edge> > G;\\nconst int N = 100005;\\nbool visited[N];\\n\\nvoid bfs(const G &g, int s, vector<int> &v) {\\n int n = g.size();\\n REP(i,n) visited[i] = 0;\\n queue<int> Q; Q.push(s);\\n visited[s] = 1;\\n while(!Q.empty()) {\\n int now = Q.front(); Q.pop();\\n v.push_back(now);\\n FOR(it, g[now]) {\\n if (it->c == 'N') continue;\\n int dst = it->dst;\\n if (!visited[dst]) {\\n visited[dst] = 1;\\n Q.push(dst);\\n }\\n }\\n }\\n}\\n\\nvoid bfs2(const G &g, const vector<int> &v, int *dist) {\\n int n = g.size();\\n REP(i,n) dist[i] = INF;\\n queue<int> Q;\\n FOR(it, v) {\\n Q.push(*it);\\n dist[*it] = 0;\\n }\\n while(!Q.empty()) {\\n int now = Q.front(); Q.pop();\\n FOR(it, g[now]) {\\n if (it->c == 'L') continue;\\n int dst = it->dst;\\n if (dist[dst] == INF) {\\n dist[dst] = dist[now] + 1;\\n Q.push(dst);\\n }\\n }\\n }\\n}\\n\\nint dist1[N];\\nint dist2[N];\\nint dist3[N];\\n\\nint main() {\\n int T;\\n cin >> T;\\n while(T--) {\\n int n, m;\\n cin >> n >> m;\\n int ns, ls;\\n cin >> ns >> ls;\\n G g(n+1);\\n REP(i,m) {\\n char c;\\n int a,b;\\n cin >> a >> b >> c;\\n g[a].push_back((Edge){b,c});\\n g[b].push_back((Edge){a,c});\\n }\\n vector<int> vA; // レノンがいる場所から自由にいける場所\\n vector<int> vB; // 夏への扉から自由にいける場所\\n bfs(g,ls,vA);\\n bfs(g,0,vB);\\n if (find(ALL(vA),0) != vA.end()) {\\n cout << 0 << endl;\\n continue;\\n }\\n bfs2(g,vA,dist1);\\n bfs2(g,vB,dist2);\\n bfs2(g,vector<int>(1,ns),dist3);\\n int ans = INF;\\n REP(i,n+1) {\\n //cout << dist1[i] << \\\" \\\" << dist2[i] << \\\" \\\" << dist3[i] << endl;\\n ans = min(ans, dist1[i]+dist2[i]+dist3[i]);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 5972,\n \"score_of_the_acc\": -0.8167,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2193_316557\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\ntypedef vector<int> Edges;\\ntypedef vector<Edges> Graph;\\n\\nstruct Node {\\n int state;\\n int from;\\n int cost;\\n Node(int state, int from, int cost) :\\n state(state), from(from), cost(cost) {;}\\n bool operator<(const Node &rhs) const {\\n return cost > rhs.cost;\\n }\\n};\\n\\nint natume;\\nint lennon;\\nint n, m;\\nGraph mainG;\\nGraph nekoG;\\nbool end[100010];\\nint dist[100010];\\nbool visit[2][100010];\\n\\nint main() {\\n int test;\\n scanf(\\\"%d\\\", &test);\\n while (test--) {\\n MEMSET(dist, 0x0f);\\n MEMSET(end, false);\\n scanf(\\\"%d %d\\\", &n, &m);\\n scanf(\\\"%d %d\\\", &natume, &lennon);\\n mainG = Graph(n + 1);\\n nekoG = Graph(n + 1);\\n REP(i, m) {\\n int f, t;\\n char c;\\n scanf(\\\"%d %d %c\\\", &f, &t, &c);\\n if (c == 'N') {\\n mainG[f].push_back(t);\\n mainG[t].push_back(f);\\n } else {\\n nekoG[f].push_back(t);\\n nekoG[t].push_back(f);\\n }\\n }\\n\\n // clac end\\n {\\n queue<int> que;\\n que.push(lennon);\\n end[lennon] = true;\\n while (!que.empty()) {\\n int from = que.front();\\n que.pop();\\n FORIT(it, nekoG[from]) {\\n int to = *it;\\n if (end[to]) { continue; }\\n end[to] = true;\\n que.push(to);\\n }\\n }\\n }\\n if (end[0]) {\\n puts(\\\"0\\\");\\n continue;\\n }\\n\\n // calc dist\\n {\\n queue<pair<int, int> > que;\\n que.push(make_pair(natume, 0));\\n MEMSET(visit, false);\\n while (!que.empty()) {\\n int from = que.front().first;\\n int cost = que.front().second;\\n que.pop();\\n if (visit[0][from]) { continue; }\\n visit[0][from] = true;\\n dist[from] = cost;\\n FORIT(it, mainG[from]) {\\n int to = *it;\\n if (visit[0][to]) { continue; }\\n que.push(make_pair(to, cost + 1));\\n }\\n }\\n }\\n\\n\\n priority_queue<Node> pque;\\n // push pque\\n {\\n queue<int> que;\\n que.push(0);\\n MEMSET(visit, false);\\n visit[0][0] = true;\\n while (!que.empty()) {\\n int from = que.front();\\n que.pop();\\n pque.push(Node(0, from, 0));\\n FORIT(it, nekoG[from]) {\\n int to = *it;\\n if (visit[0][to]) { continue; }\\n visit[0][to] = true;\\n que.push(to);\\n }\\n }\\n }\\n\\n // calc ans\\n MEMSET(visit, false);\\n while (!pque.empty()) {\\n int state = pque.top().state;\\n int from = pque.top().from;\\n int cost = pque.top().cost;\\n pque.pop();\\n if (visit[state][from]) { continue; }\\n visit[state][from] = true;\\n if (state == 1 && end[from]) {\\n printf(\\\"%d\\\\n\\\", cost);\\n break;\\n }\\n FORIT(it, mainG[from]) {\\n int to = *it;\\n if (visit[state][to]) { continue; }\\n int ncost = cost + 1;\\n pque.push(Node(state, to, ncost));\\n }\\n if (state == 0) {\\n pque.push(Node(1, from, cost + dist[from]));\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 7584,\n \"score_of_the_acc\": -0.4992,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2193_211631\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<queue>\\n#include<cstdio>\\n#include<climits>\\n#include<cmath>\\n#include<cstring>\\n#include<string>\\n#include<sstream>\\n#include<numeric>\\n#include<cassert>\\n\\n#define f first\\n#define s second\\n#define mp make_pair\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)\\n#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)\\n#define ALL(c) (c).begin(), (c).end()\\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\\n#define print(x) printf(\\\"%d\\\\n\\\",x)\\n\\nusing namespace std;\\n\\ntypedef unsigned int uint;\\ntypedef long long ll;\\n\\nconst int _dx[] = {0,1,0,-1};\\nconst int _dy[] = {-1,0,1,0};\\n\\nint getInt(){\\n int ret = 0,c;\\n c = getchar();\\n while(!isdigit(c)) c = getchar();\\n while(isdigit(c)){\\n ret *= 10;\\n ret += c - '0';\\n c = getchar();\\n }\\n return ret;\\n}\\n\\nint nmemo[100001];\\nint nlmemo[100001];\\nint nsmemo[100001];\\nint lmemo[100001];\\nint smemo[100001];\\n\\nvoid make_memo(const vector<vector<int> > &door, int *memo, const vector<int> &start){\\n queue<int> q;\\n FOR(it, start){ memo[*it] = 0; q.push(*it); }\\n while(q.size()){\\n int pos = q.front(); q.pop(); int cnt = memo[pos];\\n FOR(it, door[pos]) if(memo[*it] == -1){\\n memo[*it] = cnt + 1; q.push(*it);\\n }\\n }\\n}\\n\\nint main(){\\n int c; scanf(\\\"%d\\\", &c);\\n while(c --> 0){\\n int n, m;\\n scanf(\\\"%d%d\\\", &n, &m);\\n \\n int natsume, lenon;\\n scanf(\\\"%d%d\\\", &natsume, &lenon);\\n\\n vector<vector<int> > ndoor(n+1);\\n vector<vector<int> > ldoor(n+1);\\n\\n REP(i, m){\\n int a, b; char p;\\n scanf(\\\"%d%d %c\\\", &a, &b, &p);\\n if(p == 'N'){\\n\\tndoor[a].push_back(b);\\n\\tndoor[b].push_back(a);\\n }else{\\n\\tldoor[a].push_back(b);\\n\\tldoor[b].push_back(a);\\n }\\n }\\n\\n REP(i, n+1) nsmemo[i] = nlmemo[i] = nmemo[i] = lmemo[i] = smemo[i] = -1;\\n\\n make_memo(ndoor, nmemo, vector<int>(1, natsume));\\n make_memo(ldoor, lmemo, vector<int>(1, lenon));\\n make_memo(ldoor, smemo, vector<int>(1, 0));\\n\\n if(lmemo[0] != -1){\\n print(0);\\n }else{\\n vector<int> l; REP(i, n+1) if(lmemo[i] != -1) l.push_back(i);\\n vector<int> s; REP(i, n+1) if(smemo[i] != -1) s.push_back(i);\\n make_memo(ndoor, nlmemo, l);\\n make_memo(ndoor, nsmemo, s);\\n \\n int ans = INT_MAX;\\n REP(i, n+1) if(nmemo[i] != -1 && nsmemo[i] != -1 && nlmemo[i] != -1)\\n\\tans = min(ans, nmemo[i] + nsmemo[i] + nlmemo[i]);\\n \\n print(ans);\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 7052,\n \"score_of_the_acc\": -0.472,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2193_193950\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <set>\\nusing namespace std;\\n\\nvector<vector<int> > h_edges, c_edges;\\n\\nvoid dfs1(set<int> &ss,int start) {\\n queue<int> q; q.push(start); ss.insert(start);\\n while(!q.empty()) {\\n int ns = q.front(); q.pop();\\n for(int i=0; i<c_edges[ns].size(); ++i)\\n if(ss.find(c_edges[ns][i]) == ss.end()) {\\n q.push(c_edges[ns][i]);\\n ss.insert(c_edges[ns][i]);\\n }\\n }\\n}\\n\\nvoid bfs(queue<int> &q,vector<int> &dist) {\\n while(!q.empty()) {\\n int ns = q.front(); q.pop();\\n for(int i=0; i<h_edges[ns].size(); ++i) {\\n if(dist[h_edges[ns][i]] > dist[ns]+1) {\\n dist[h_edges[ns][i]] = dist[ns]+1;\\n q.push(h_edges[ns][i]);\\n }\\n }\\n }\\n}\\n\\nint main() {\\n int n,m,tc,a,b,h_start,c_start;\\n string s;\\n cin>>tc;\\n\\n while(tc--) {\\n cin>>n>>m;\\n cin>>h_start>>c_start;\\n h_edges.clear(); c_edges.clear();\\n h_edges.resize(n+1); c_edges.resize(n+1);\\n\\n for(int i=0; i<m; ++i) {\\n cin>>a>>b>>s;\\n if(s == \\\"N\\\") {\\n h_edges[a].push_back(b);\\n h_edges[b].push_back(a);\\n }else{\\n c_edges[a].push_back(b);\\n c_edges[b].push_back(a);\\n }\\n }\\n\\n set<int> canReach,fromGoal;\\n // dfs1\\n dfs1(canReach, c_start);\\n dfs1(fromGoal, 0);\\n\\n if(canReach.find(0) != canReach.end()) {\\n cout<<0<<endl;\\n continue;\\n }\\n\\n queue<int> q;\\n vector<int> d1(n+1,1<<29), d2(n+1, 1<<29), d3(n+1, 1<<29);\\n d1[h_start] = 0; q.push(h_start);\\n bfs(q,d1);\\n\\n// cout<<canReach.size()<<endl;\\n for(set<int>::iterator it = canReach.begin();\\n it != canReach.end(); ++it) {\\n q.push(*it); d2[*it] = 0;\\n }\\n bfs(q,d2);\\n\\n for(set<int>::iterator it = fromGoal.begin();\\n it != fromGoal.end(); ++it) {\\n q.push(*it); d3[*it] = 0;\\n }\\n bfs(q,d3);\\n\\n int ans = 1<<29;\\n for(int i=0; i<=n; ++i) {\\n// cout<<i<<\\\" -> \\\"<<d1[i]<<\\\",\\\"<<d2[i]<<\\\",\\\"<<d3[i]<<endl;\\n ans = min(ans, d1[i]+d2[i]+d3[i]);\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 7440,\n \"score_of_the_acc\": -1.0419,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2193_80954\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\nconst int N = 100005;\\nconst int inf = ( 1 << 21);\\n\\n\\nclass Edge{\\npublic:\\n int next,c;\\n};\\n\\nclass state{\\npublic:\\n int now,c;\\n bool operator<(const state & a)const{\\n return c > a.c;\\n }\\n};\\n\\nvoid dijkstra(vector<int>&ini,int n,vector<Edge> *edge,int *cost){\\n rep(i,n)cost[i]=inf;\\n \\n priority_queue<state> Q;\\n rep(i,ini.size()){\\n Q.push((state){ini[i],0});\\n }\\n \\n while(!Q.empty()){\\n state now = Q.top();Q.pop();\\n if (cost[now.now] != inf)continue;\\n cost[now.now]=now.c;\\n rep(i,edge[now.now].size()){\\n int next=edge[now.now][i].next,nec=now.c+edge[now.now][i].c;\\n Q.push((state){next,nec});\\n }\\n }\\n}\\n\\nvector<Edge> Ledge[N],Nedge[N];\\nint Lcost[N],Scost[N],Ncost[N];\\nint LBFS[N],SBFS[N];\\n\\ntemplate<class T> void op(T &in,int n){rep(i,n)cout<<in[i]<<' ';cout << endl;}\\n\\nint solve(int n,int L,int S,int N){\\n vector<int> ini;\\n ini.push_back(L);\\n dijkstra(ini,n,Ledge,LBFS);\\n // op(LBFS,n);\\n if (LBFS[S] != inf)return 0;//natune is not needed\\n ini.clear();\\n\\n \\n\\n ini.push_back(S);\\n dijkstra(ini,n,Ledge,SBFS);\\n ini.clear();\\n\\n // op(SBFS,n);\\n\\n\\n vector<int> Lini,Nini,Sini;\\n Nini.push_back(N);\\n rep(i,n){\\n if (LBFS[i] != inf)Lini.push_back(i);\\n if (SBFS[i] != inf)Sini.push_back(i);\\n }\\n\\n dijkstra(Lini,n,Nedge,Lcost);\\n dijkstra(Sini,n,Nedge,Scost);\\n dijkstra(Nini,n,Nedge,Ncost);\\n\\n \\n int ans = inf;\\n rep(i,n){\\n //if (LBFS[i] == inf && SBFS[i] == inf)\\n ans=min(ans,Ncost[i]+Scost[i]+Lcost[i]);\\n }\\n return ans;\\n}\\n\\n\\nmain(){\\n int te;\\n cin>>te;\\n while(te--){\\n int n,m;\\n cin>>n >>m;\\n n++;\\n rep(i,n)Nedge[i].clear(),Ledge[i].clear();\\n int S = 0,L,N;\\n cin>>N>>L;\\n\\n rep(i,m){\\n int f,t;\\n char k;\\n cin>>f>>t>>k;\\n if (k == 'L'){\\n\\tLedge[f].pb((Edge){t,1});\\n\\tLedge[t].pb((Edge){f,1});\\n }else if (k == 'N'){\\n\\tNedge[f].pb((Edge){t,1});\\n\\tNedge[t].pb((Edge){f,1});\\n }\\n }\\n cout << solve(n,L,S,N) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 670,\n \"memory_kb\": 10000,\n \"score_of_the_acc\": -1.2064,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1198,"cells":{"group_id":{"kind":"string","value":"aoj_2202_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nCanal: Water Going Up and Down\nACM国には中央を東西に流れる川がある．この川は西の隣国からACM国を通り東の隣国へと流れており，ACM国内の全長は\nK\nkmである．この川にいくつかの閘門を設置し，運河として利用することが計画されている．\n閘門とは，異なる2つの水位間を船が移動するための仕組みである．閘門は上流側と下流側にそれぞれ水門を持ち，それらの間に閘室と呼ばれる小さな水域を持つ．この閘室に船を入れた後に注水あるいは排水を行い，閘室の水位を上下させることで船も上下させる．以下にその模式図を示す．\n図 F-1: 閘門の模式図\nこの川の川幅はあまり広くないため，西から東へ一方通行の運河となることが決まっている．設計の担当者は，運河を効率良く運用するため，予想される船の航行スケジュールに合わせて閘門の設置場所などを最適にしたいと考えている．\nあなたは設計担当者に雇われているプログラマーである．あなたの仕事は，閘門の情報と複数の船の航行スケジュールが与えられたとき，全ての船が川を通過するまでの時間をシミュレーションにより求めるプログラムを書くことである．\n各閘門は以下の情報によって表される．\nACM国西端からの距離\nX\n(km)\n水位の切り替えに必要な水の容積\nL\n(L)\n単位時間あたりの最大注水量\nF\n(L/h)\n単位時間あたりの最大排水量\nD\n(L/h)\n閘門の西側の水位と東側の水位の上下関係\n便宜上，シミュレーションにおいて，川はACM国外においても同様に無限に続いているものとする．\nシミュレーションの開始時点において，全ての閘室の水位は東側と西側の水位のうち，低い方にある．また，航行スケジュールに含まれる船は，ACM国の西端を先頭地点として，入力で与えられる順に東から西に向かって1kmおきに並んでいるものとする． 便宜上，先頭の船の初期位置を0km地点とする．\nシミュレーション開始とともに船は東に向かって航行を始める．このとき，ある船の前後1km未満に他の船が入ってはならない．\n各船にはそれぞれ最大船速\nV\n(km/h)が設定されている．船は一瞬で任意の船速に達し，さらに一瞬で静止することすらできる．基本的に船は最大船速で航行するが，先行する船より後続の船のほうが最大船速が速く，かつ後続の船が先行する船の1km手前に追いついた場合は，後続の船は先行する船と同じ船速で航行する．船及び閘門の大きさは無視できるものとする．\n船は，閘門の西側の水位と閘室の水位が等しいときのみ，その閘門に入ることができる．同様に，閘門の東側の水位と閘室の水位が等しいときのみ，その閘門から出ることができる．各閘室の水位は，中に船がいない場合は，その閘門の西側の水位と一致するまで上昇または下降する．また，船がいる場合は，その閘門の東側の水位と一致するまで変位する．閘門の丁度1km先で船が停泊している場合でも，船は閘門から出ることができる．ただし，このとき，船は先行する船が発進するまで閘門から出たところで停泊しなければならない．\n船はACM国の東端を通過した後，可能な限りの速度で無限遠まで航行する．全ての船がACM国の東端を通過し終えた時点でシミュレーションは終了する．\nInput\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\nN\nM\nK\nX\n1\nL\n1\nF\n1\nD\n1\nUD\n1\nX\n2\nL\n2\nF\n2\nD\n2\nUD\n2\n...\nX\nN\nL\nN\nF\nN\nD\nN\nUD\nN\nV\n1\nV\n2\n...\nV\nM\n最初の1行は3つの整数\nN\n,\nM\n,\nK\nからなる．\nN\n(1 ≤\nN\n≤ 100) は閘門の数，\nM\n(1 ≤\nM\n≤ 100) は船の数，\nK\n(2 ≤\nK\n≤ 1000) は川のACM国内における全長をそれぞれ表す．\n続く\nN\n行は閘門の情報を表す． 各行は5つの整数\nX\ni\n,\nL\ni\n,\nF\ni\n,\nD\ni\n,\nUD\ni\nからなる．\nX\ni\n(1 ≤\nX\ni\n≤\nK\n- 1) は閘門\ni\nのACM国西端からの位置(km)，\nL\ni\n(1 ≤\nL\ni\n≤ 1000) は閘門\ni\nの水位の切り替えに必要な水の容積(L)，\nF\ni\n(1 ≤\nF\ni\n≤ 1000) は閘門\ni\nの単位時間あたりの最大注水量(L/h)，\nD\ni\n(1 ≤\nD\ni\n≤ 1000) は閘門\ni\nの単位時間あたりの最大排水量(L/h)，\nUD\ni\n(\nUD\ni\n∈ {0, 1})は閘門\ni\nの西側の水位と東側の水位の上下関係をそれぞれ表す．\nUD\ni\nが 0 の場合，閘門\ni\nは西側より東側が水位が高いことを表す．一方\nUD\ni\nが 1 の場合，閘門\ni\nは西側より東側が水位が低いことを表す．\n続く\nM\n行には，各行に\ni\n番目の船の最大船速(km/h)を表す整数\nV\ni\n(1 ≤\nV\ni\n≤ 1000) が与えられる．\n閘門は\nX\ni\nの値の小さい順で与えられる．また，同一の位置に複数の閘門が設置されることはない．\n入力の終りはスペースで区切られた3個のゼロからなる．\nOutput\n各データセットに対し，シミュレーション開始から終了までの時刻を1行で出力せよ．出力する値は10\n-6\n以下の誤差を含んでいても構わない．値は小数点以下何桁表示しても構わない．\nSample Input\n1 1 100\n50 200 20 40 0\n1\n2 4 100\n7 4 1 4 1\n19 5 1 4 0\n5\n3\n7\n9\n1 2 3\n1 1 1 1 0\n1\n3\n1 2 10\n5 10 1 1 1\n2\n3\n0 0 0\nOutput for the Sample Input\n110\n46.6666666667\n5\n41.6666666667"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2202_6370146","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2022.03.03 02:02:13 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &number_of_ships) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : number_of_ships) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &number_of_ships) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : number_of_ships) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\nstruct gate {\n\tdouble x;\n\tdouble water;\n\tdouble fill;\n\tdouble reduce;\n\tdouble left_height;\n\tdouble right_height;\n\tgate(double x, double water, double fill, double reduce, double lh, double rh)\n\t\t: x(x), water(water), fill(fill), reduce(reduce), left_height(lh), right_height(rh) {}\n};\n\nconst double eps = 1e-8;\nbool eq(double a, double b) { return abs(a - b) < eps; }\n\ndouble solve(int gate_number) {\n\tint number_of_ships;\n\tdouble goal;\n\tcin >> number_of_ships >> goal;\n\n\tV<gate> gates;\n\trep(gate_number) {\n\t\tDBL(x, water, fill, reduce);\n\t\tbool lft;\n\t\tcin >> lft;\n\t\tdouble lh, rh;\n\t\tlh = rh = 0;\n\t\tif(lft)\n\t\t\tlh = water;\n\t\telse\n\t\t\trh = water;\n\t\tgate g(x, water, fill, reduce, lh, rh);\n\t\tdebug(x, water, fill, reduce, lh, rh);\n\t\tgates.push_back(g);\n\t}\n\n\tVEC(double, maxspeed, number_of_ships);\n\n\tV<double> place(number_of_ships);\n\trep(i, number_of_ships) place[i] = -i;\n\tvector<double> water(gate_number, 0.);\n\tvector<int> gate_to_ship(gate_number, -1);\n\tvector<int> ship_to_gate(number_of_ships, -1);\n\tvector<int> gate_next(number_of_ships, 0);\n\tV<double> velocity(number_of_ships);\n\n\tauto preceed_time = [&](const double time_span) {\n\t\trep(i, number_of_ships) place[i] += velocity[i] * time_span;\n\t\trep(j, gate_number) {\n\t\t\tconst gate &g = gates[j];\n\t\t\tif(gate_to_ship[j] == -1) {\t // switched to left\n\t\t\t\tif(g.left_height < g.right_height) water[j] -= time_span * g.reduce;\n\t\t\t\t// water[j] = min(g.right_height, water[j] + g.fill * time_span);\n\t\t\t\telse\n\t\t\t\t\twater[j] += time_span * g.fill;\n\t\t\t\t// water[j] = max(g.right_height, water[j] - g.reduce * time_span);\n\t\t\t} else {\n\t\t\t\tif(g.left_height < g.right_height) water[j] += time_span * g.fill;\n\t\t\t\t// water[j] = max(g.left_height, water[j] - g.reduce * time_span);\n\t\t\t\telse\n\t\t\t\t\twater[j] -= time_span * g.reduce;\n\t\t\t\t// water[j] = min(g.left_height, water[j] + g.fill * time_span);\n\t\t\t\t// water[j] += g.fill * time_span;\n\t\t\t}\n\t\t\tchmax(water[j], 0.);\n\t\t\tchmin(water[j], g.water);\n\t\t}\n\t\trep(shipid, number_of_ships) {\n\t\t\tif(ship_to_gate[shipid] == -1) {\n\t\t\t\tconst int nxtid = gate_next[shipid];\n\t\t\t\tif(nxtid < gate_number) {\n\t\t\t\t\tconst gate > = gates[nxtid];\n\t\t\t\t\tdebug(gt.x, place[shipid]);\n\t\t\t\t\tif(eq(gt.x, place[shipid])) {\n\t\t\t\t\t\tif(eq(gt.left_height, water[nxtid])) {\n\t\t\t\t\t\t\tship_to_gate[shipid] = nxtid;\n\t\t\t\t\t\t\tgate_to_ship[nxtid] = shipid;\n\t\t\t\t\t\t\tvelocity[shipid] = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tconst int gateid = ship_to_gate[shipid];\n\t\t\t\tassert(in_range(gateid, 0, gate_number));\n\t\t\t\tconst gate &g = gates[gateid];\n\t\t\t\tif(eq(g.right_height, water[gateid])) {\n\t\t\t\t\tgate_next[shipid]++;\n\t\t\t\t\tship_to_gate[shipid] = -1;\n\t\t\t\t\tgate_to_ship[gateid] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trep(shipid, number_of_ships) {\n\t\t\tdouble &vel = velocity[shipid];\n\n\t\t\tif(ship_to_gate[shipid] != -1)\n\t\t\t\tvel = 0;\n\t\t\telse {\n\t\t\t\tif(shipid) {\n\t\t\t\t\tdouble dist = place[shipid - 1] - place[shipid];\n\t\t\t\t\tvel = (eq(dist, 1.) ? min(maxspeed[shipid], velocity[shipid - 1]) : maxspeed[shipid]);\n\t\t\t\t} else {\n\t\t\t\t\tvel = maxspeed[shipid];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst int nxtgateid = gate_next[shipid];\n\t\t\tif(nxtgateid < gate_number) {\n\t\t\t\tconst auto > = gates[nxtgateid];\n\t\t\t\tif(eq(gt.x, place[shipid])) vel = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn;\n\t};\n\n\tpreceed_time(0.);\n\n\tdouble time = 0;\n\tauto nxt_incident = [&]() {\n\t\tdouble ret = INF;\n\t\t// if(eps < velocity.back()) {\n\t\t// \tchmin(ret, (goal - place.back()) / velocity.back());\n\t\t// }\n\n\t\tif(gate_next.back() == gate_number)\n\t\t\tif(chmin(ret, (goal - place.back()) / velocity.back())) {\n\t\t\t\tdebug(ret);\n\t\t\t\t// debug(\"end is coming!\");\n\t\t\t}\n\n\t\trep(shipid, number_of_ships) {\n\t\t\tconst double &vel = velocity[shipid];\n\t\t\tconst double &plc = place[shipid];\n\t\t\tif(shipid) {\n\t\t\t\tdouble dist = place[shipid - 1] - plc - 1.;\n\t\t\t\tassert(dist > -eps);\n\t\t\t\tdouble vel_diff = vel - velocity[shipid - 1];\n\t\t\t\tif(vel_diff > eps) {\n\t\t\t\t\tif(chmin(ret, dist / vel_diff)) {\n\t\t\t\t\t\tdebug(ret);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ship_to_gate[shipid] != -1) continue;\n\t\t\tint nxtgateid = gate_next[shipid];\n\t\t\tif(nxtgateid < gate_number) {\n\t\t\t\tconst double dist = gates[nxtgateid].x - place[shipid];\n\t\t\t\tif(!eq(dist, 0.))\n\t\t\t\t\tif(chmin(ret, dist / vel)) {\n\t\t\t\t\t\tdebug(ret);\n\t\t\t\t\t\tdebug(dist, vel);\n\t\t\t\t\t\tif(ret < eps) exit(0);\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(gateid, gate_number) {\n\t\t\tdouble watercap, fill, reduce;\n\t\t\tconst auto &g = gates[gateid];\n\t\t\twatercap = g.water;\n\t\t\tfill = g.fill;\n\t\t\treduce = g.reduce;\n\n\t\t\tif(gate_to_ship[gateid] == -1 && !eq(g.left_height, water[gateid])) {\n\t\t\t\tdouble chg = g.fill;\n\t\t\t\tif(g.left_height < g.right_height) chg = g.reduce;\n\t\t\t\tdouble diff = abs(g.left_height - water[gateid]);\n\t\t\t\tif(chmin(ret, diff / chg)) {\n\t\t\t\t\tdebug(ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(gate_to_ship[gateid] != -1 && !eq(g.right_height, water[gateid])) {\n\t\t\t\t// chmin(ret, (watercap - water[gateid]) / fill);\n\t\t\t\tdouble chg = g.fill;\n\t\t\t\tif(g.left_height > g.right_height) chg = g.reduce;\n\t\t\t\tdouble diff = abs(g.right_height - water[gateid]);\n\t\t\t\tif(chmin(ret, diff / chg)) {\n\t\t\t\t\tdebug(ret);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t};\n\n\twhile(place.back() < goal - eps) {\n\t\tdouble timelen = nxt_incident();\n\t\tpreceed_time(timelen);\n\t\ttime += timelen;\n\t\tdebug(place, time);\n\t\tdebug(velocity);\n\t\tdebug(ship_to_gate);\n\t\tdebug(gate_to_ship);\n\t\tdebug(gate_next);\n\t\tdebug(water);\n\n\t\tconst gate &g = gates.front();\n\t\tdebug(g.x, g.water, g.left_height, g.right_height, g.reduce, g.fill);\n\t}\n\n\treturn time;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\t// cin >> n;\n\twhile(cin >> n && n) {\n\t\tcout << solve(n) << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3624,"score_of_the_acc":-0.605,"final_rank":5},{"submission_id":"aoj_2202_3138800","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.0000001\n#define NUM 105\n\nenum Type{\n\tCATCH_UP,\n\tARRIVE_ROOM,\n\tWATER_UP,\n\tWATER_DOWN,\n\tFINISH,\n};\n\nenum Water{\n\tWest,\n\tEast,\n\tMoving,\n};\n\nstruct Info{\n\tvoid set(double arg_loc,double arg_down_time,double arg_up_time,bool arg_is_east_higher){\n\t\tloc = arg_loc;\n\t\tdown_time = arg_down_time;\n\t\tup_time = arg_up_time;\n\t\tis_east_higher = arg_is_east_higher;\n\t}\n\tdouble loc,down_time,up_time,move_end_time;\n\tbool is_east_higher;\n\tint wait_ship_id;\n\tWater water,next_water;\n};\n\nstruct Ship{\n\tvoid set(double arg_current_loc,int arg_max_speed,int arg_current_speed){\n\t\tcurrent_loc = arg_current_loc;\n\t\tmax_speed = arg_max_speed;\n\t\tcurrent_speed = arg_current_speed;\n\t}\n\tdouble current_loc;\n\tbool is_waiting;\n\tint last_room,max_speed,current_speed;\n};\n\nstruct Data{\n\tData(){\n\t\tevent_time = 0;\n\t\tship_id = 0;\n\t\troom_id = 0;\n\t\ttype = CATCH_UP;\n\t}\n\tData(double arg_event_time,int arg_ship_id,int arg_room_id,Type arg_type){\n\t\tevent_time = arg_event_time;\n\t\tship_id = arg_ship_id;\n\t\troom_id = arg_room_id;\n\t\ttype = arg_type;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn event_time > arg.event_time;\n\t}\n\tdouble event_time;\n\tint ship_id,room_id;\n\tType type;\n};\n\nint num_room,num_ship;\nint debug_array[NUM];\ndouble LENGTH;\nInfo info[NUM];\nShip ship[NUM];\n\nvoid set_speed(int ship_head){\n\n\t//★前の船との距離がちょうど1kmで、1つ前の航行速度より最大速度が速いなら、1つ前のスピードに合わせる\n\tfor(int i = ship_head+1; i < num_ship; i++){\n\n\t\tif(ship[i].is_waiting)continue; //閘門の中ならSKIP\n\n\t\tif(ship[i-1].current_loc-ship[i].current_loc > 1.0){ //距離が1より大きい\n\n\t\t\tship[i].current_speed = ship[i].max_speed;\n\t\t\tcontinue;\n\t\t}\n\n\t\t//距離がちょうど1\n\t\tif(ship[i].max_speed > ship[i-1].current_speed){\n\n\t\t\tship[i].current_speed = ship[i-1].current_speed;\n\t\t}else{\n\n\t\t\tship[i].current_speed = ship[i].max_speed;\n\t\t}\n\t}\n}\n\nvoid calc_loc(int ship_head,double add_time){\n\n\tfor(int i = ship_head; i < num_ship; i++){\n\t\tship[i].current_loc += ship[i].current_speed*add_time;\n\t}\n}\n\n//ある船が、ある閘門に到着するまでの時間を求める\ndouble calc_time(int ship_id,int room_id){\n\n\tdouble dist = info[room_id].loc-ship[ship_id].current_loc;\n\treturn dist/(double)ship[ship_id].current_speed;\n}\n\nvoid func(){\n\n\tdouble X,L,F,D;\n\tint UD;\n\n\tdouble first_time = BIG_NUM;\n\tType first_event = ARRIVE_ROOM;\n\tint first_ship,first_room;\n\n\t//閘門の情報を取得\n\tfor(int i = 0; i < num_room; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf %d\",&X,&L,&F,&D,&UD);\n\t\tinfo[i].set(X,L/D,L/F,UD == 0);\n\n\t\t//シミュレーションの開始時点において、水位は低い方に合っている\n\t\tif(info[i].is_east_higher){\n\t\t\tinfo[i].water = West;\n\t\t}else{\n\t\t\t//★★★西側の水位に合わせる★★★\n\t\t\tinfo[i].water = Moving;\n\t\t\tinfo[i].next_water = West;\n\t\t\tinfo[i].move_end_time = info[i].up_time;\n\t\t\tif(first_time > info[i].up_time){\n\t\t\t\tfirst_time = info[i].up_time;\n\t\t\t\tfirst_event = WATER_UP;\n\t\t\t\tfirst_ship = -1;\n\t\t\t\tfirst_room = i;\n\t\t\t}\n\t\t}\n\t\tinfo[i].wait_ship_id = -1; //★待っている船があれば、そのidを持つ★\n\t}\n\tinfo[num_room].loc = LENGTH; //★時間計算簡易化のため★\n\n\tint tmp_speed;\n\n\t//船の情報を取得\n\tfor(int i = 0; i < num_ship; i++){\n\n\t\tscanf(\"%d\",&tmp_speed);\n\t\tship[i].set(-1*i,tmp_speed,tmp_speed);\n\t\tship[i].last_room = -1; //最後に通過した閘門のインデックス\n\t\tship[i].is_waiting = false;\n\t\tdebug_array[i] = 0;\n\t}\n\n\tint tmp_id,next_ship,next_room;\n\tdouble ans = BIG_NUM;\n\tdouble tmp_time;\n\n\tType next_type;\n\n\t//★最初は1km等間隔に並んでいるため、まず船の速度を設定する★\n\tset_speed(0);\n\n\t/*★★船の速度が変化するイベントは、前のものが終わるまで、次のものをpushしない★★*/\n\n\tpriority_queue<Data> Q;\n\n\tif(first_event == ARRIVE_ROOM){\n\n\t\tQ.push(Data(calc_time(0,0),0,0,ARRIVE_ROOM)); //全ての閘門の水位が西に合っているなら、先頭の船のイベントを追加\n\t}else{\n\n\t\ttmp_time = calc_time(0,0);\n\n\t\tif(tmp_time < first_time){\n\n\t\t\tQ.push(Data(tmp_time,0,0,ARRIVE_ROOM));\n\t\t}else{\n\n\t\t\tQ.push(Data(first_time,first_ship,first_room,first_event));\n\t\t}\n\t}\n\n\tData data;\n\tdouble current_time,pre_time = 0,next_time;\n\tint ship_head = 0;\n\n\twhile(true){\n\n\t\tdata = Q.top();\n\t\tQ.pop();\n\n\t\tcurrent_time = Q.top().event_time;\n\t\t//★★船全体を動かす★★\n\t\tif(fabs(current_time-pre_time) > EPS){\n\t\t\tcalc_loc(0,current_time-pre_time);\n\t\t}\n\n\t\tswitch(data.type){\n\t\tcase CATCH_UP: //ある船が別の船の1km後方に到達した場合\n\n\t\t\tship[data.ship_id].current_speed = ship[data.ship_id-1].current_speed;\n\t\t\tset_speed(data.ship_id); //影響を後ろに伝播させる\n\n\t\t\tbreak;\n\n\t\tcase ARRIVE_ROOM: //ある船がある閘門に到達した場合\n\n\t\t\t//閘門の中ではspeed0とする\n\t\t\tship[data.ship_id].current_speed = 0;\n\t\t\tship[data.ship_id].is_waiting = true;\n\t\t\t//自分以降の船に、停止情報を伝える\n\t\t\tset_speed(data.ship_id);\n\n\t\t\tinfo[data.room_id].wait_ship_id = data.ship_id; //★とりあえず待つ★\n\n\t\t\tif(info[data.room_id].water == West){ //水位が西側に合っている場合のみ中に入る\n\n\t\t\t\tif(info[data.room_id].is_east_higher){\n\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\t}else{\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\t}\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase WATER_UP:\n\n\t\t\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合\n\n\t\t\t\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\n\t\t\t\ttmp_id = info[data.room_id].wait_ship_id;\n\t\t\t\tship[tmp_id].last_room = data.room_id; //通過済とする\n\t\t\t\tship[tmp_id].is_waiting = false;\n\t\t\t\tdebug_array[tmp_id]++;\n\t\t\t\tinfo[data.room_id].wait_ship_id = -1;\n\n\t\t\t\t//★閘門を通過した船の速度を設定する\n\t\t\t\tif(tmp_id == 0){\n\n\t\t\t\t\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\n\t\t\t\t\tset_speed(tmp_id); //影響を伝播させる\n\n\t\t\t\t}else{ //自分が先頭でないなら、自分の1つ前から計算すれば良い\n\n\t\t\t\t\tset_speed(tmp_id-1);\n\t\t\t\t}\n\n\t\t\t\t//閘門の水位が動き終わる時刻等を設定\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\tinfo[data.room_id].next_water = West;\n\n\t\t\t}else{ //西側の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\n\n\t\t\t\tinfo[data.room_id].water = West;\n\t\t\t\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\n\n\t\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WATER_DOWN:\n\n\t\t\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\n\n\t\t\t\tinfo[data.room_id].water = West;\n\t\t\t\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\n\t\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t\t}\n\n\t\t\t}else{ //西側の方が水位が高い場合\n\n\t\t\t\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\n\t\t\t\ttmp_id = info[data.room_id].wait_ship_id;\n\t\t\t\tship[tmp_id].last_room = data.room_id; //通過済とする\n\t\t\t\tship[tmp_id].is_waiting = false;\n\t\t\t\tinfo[data.room_id].wait_ship_id = -1;\n\t\t\t\tdebug_array[tmp_id]++;\n\n\t\t\t\t//★閘門を通過した船の速度を設定する:仮に自分が先頭でないなら、自分の1つ前から計算すれば良い★\n\t\t\t\tif(tmp_id == 0){\n\n\t\t\t\t\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\n\t\t\t\t\tset_speed(tmp_id); //影響を伝播させる\n\n\t\t\t\t}else{\n\n\t\t\t\t\tset_speed(tmp_id-1);\n\t\t\t\t}\n\n\t\t\t\t//閘門の水位が動き終わる時刻等を設定\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\tinfo[data.room_id].next_water = West;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase FINISH: //ある船が川を抜けた場合\n\n\t\t\tans = current_time;\n\n\t\t\tship_head++;\n\t\t\tbreak;\n\t\t}\n\n\t\tif(ship_head == num_ship)break;\n\n\t\t/*★★★最も早く起こる、次のイベントを計算★★★*/\n\t\tnext_time = BIG_NUM;\n\n\t\t//船を走査\n\t\tfor(int i = 0; i < num_ship; i++){\n\n\t\t\tif(fabs(ship[i].current_speed) < EPS){ //★閘門前、または前が詰まっているために待ち状態ならSKIP\n\n\t\t\t\t//★★★ぴったり、閘門の前で止まっている場合あり★★★\n\t\t\t\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS && ship[i].is_waiting == false){\n\n\t\t\t\t\tnext_time = current_time; //現在なので必ず最速\n\t\t\t\t\tnext_ship = i;\n\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\tnext_type = ARRIVE_ROOM;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\t//★1つ前の船の1km手前に追いつく時刻\n\t\t\t\tif(i != 0 && ship[i].current_speed > ship[i-1].current_speed){\n\n\t\t\t\t\ttmp_time = current_time+((ship[i-1].current_loc-ship[i].current_loc)-1.0)/(double)(ship[i].current_speed-ship[i-1].current_speed);\n\n\t\t\t\t\tif(next_time > tmp_time){\n\n\t\t\t\t\t\tif(fabs(next_time-tmp_time) < EPS){\n\t\t\t\t\t\t\tnext_time = current_time;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = -1;\n\t\t\t\t\t\tnext_type = CATCH_UP;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(i < ship_head || fabs(ship[i].current_speed) < EPS)continue;\n\n\t\t\t\t//★閘門に到達する時刻\n\t\t\t\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS){\n\n\t\t\t\t\ttmp_time = current_time;\n\n\t\t\t\t}else{\n\n\t\t\t\t\ttmp_time = current_time+calc_time(i,ship[i].last_room+1);\n\t\t\t\t}\n\n\t\t\t\tif(ship[i].last_room+1 == num_room){ //次で川を出る場合\n\n\t\t\t\t\tif(next_time > tmp_time){\n\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\t\tnext_type = FINISH;\n\t\t\t\t\t}\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(next_time > tmp_time){\n\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\t\tnext_type = ARRIVE_ROOM;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//閘門を走査\n\t\tfor(int i = 0; i < num_room; i++){\n\n\t\t\tif(info[i].water != Moving)continue;\n\n\t\t\tif(next_time > info[i].move_end_time){\n\n\t\t\t\tnext_time = info[i].move_end_time;\n\t\t\t\tnext_room = i;\n\t\t\t\tnext_ship = -1;\n\n\t\t\t\tif(info[i].is_east_higher){\n\n\t\t\t\t\tif(info[i].next_water == West){\n\t\t\t\t\t\tnext_type = WATER_DOWN;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_type = WATER_UP;\n\t\t\t\t\t}\n\t\t\t\t}else{ //西の方が水位が高い\n\n\t\t\t\t\tif(info[i].next_water == West){\n\t\t\t\t\t\tnext_type = WATER_UP;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_type = WATER_DOWN;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tQ.push(Data(next_time,next_ship,next_room,next_type));\n\n\t\tpre_time = current_time;\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %lf\",&num_room,&num_ship,&LENGTH);\n\t\tif(num_room == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":390,"memory_kb":3176,"score_of_the_acc":-1.3473,"final_rank":9},{"submission_id":"aoj_2202_3138795","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.0000001\n#define NUM 105\n\nenum Type{\n\tCATCH_UP,\n\tARRIVE_ROOM,\n\tWATER_UP,\n\tWATER_DOWN,\n\tFINISH,\n};\n\nenum Water{\n\tWest,\n\tEast,\n\tMoving,\n};\n\nstruct Info{\n\tvoid set(double arg_loc,double arg_down_time,double arg_up_time,bool arg_is_east_higher){\n\t\tloc = arg_loc;\n\t\tdown_time = arg_down_time;\n\t\tup_time = arg_up_time;\n\t\tis_east_higher = arg_is_east_higher;\n\t}\n\tdouble loc,down_time,up_time,move_end_time;\n\tbool is_east_higher;\n\tint wait_ship_id;\n\tWater water,next_water;\n};\n\nstruct Ship{\n\tvoid set(double arg_current_loc,int arg_max_speed,int arg_current_speed){\n\t\tcurrent_loc = arg_current_loc;\n\t\tmax_speed = arg_max_speed;\n\t\tcurrent_speed = arg_current_speed;\n\t}\n\tdouble current_loc;\n\tbool is_waiting;\n\tint last_room,max_speed,current_speed;\n};\n\nstruct Data{\n\tData(){\n\t\tevent_time = 0;\n\t\tship_id = 0;\n\t\troom_id = 0;\n\t\ttype = CATCH_UP;\n\t}\n\tData(double arg_event_time,int arg_ship_id,int arg_room_id,Type arg_type){\n\t\tevent_time = arg_event_time;\n\t\tship_id = arg_ship_id;\n\t\troom_id = arg_room_id;\n\t\ttype = arg_type;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn event_time > arg.event_time;\n\t}\n\tdouble event_time;\n\tint ship_id,room_id;\n\tType type;\n};\n\nint num_room,num_ship;\nint debug_array[NUM];\ndouble LENGTH;\nInfo info[NUM];\nShip ship[NUM];\n\nvoid set_speed(int ship_head){\n\n\t//★前の船との距離がちょうど1kmで、1つ前の航行速度より最大速度が速いなら、1つ前のスピードに合わせる\n\tfor(int i = ship_head+1; i < num_ship; i++){\n\n\t\tif(ship[i].is_waiting)continue; //閘門の中ならSKIP\n\n\t\tif(ship[i-1].current_loc-ship[i].current_loc > 1.0){ //距離が1より大きい\n\n\t\t\tship[i].current_speed = ship[i].max_speed;\n\t\t\tcontinue;\n\t\t}\n\n\t\t//距離がちょうど1\n\t\tif(ship[i].max_speed > ship[i-1].current_speed){\n\n\t\t\tship[i].current_speed = ship[i-1].current_speed;\n\t\t}else{\n\n\t\t\tship[i].current_speed = ship[i].max_speed;\n\t\t}\n\t}\n}\n\nvoid calc_loc(int ship_head,double add_time){\n\n\tfor(int i = ship_head; i < num_ship; i++){\n\t\tship[i].current_loc += ship[i].current_speed*add_time;\n\t}\n}\n\n//ある船が、ある閘門に到着するまでの時間を求める\ndouble calc_time(int ship_id,int room_id){\n\n\tdouble dist = info[room_id].loc-ship[ship_id].current_loc;\n\treturn dist/(double)ship[ship_id].current_speed;\n}\n\nbool STOP = false;\nint num_case = 0;\nvoid func(){\n\n\tdouble X,L,F,D;\n\tint UD;\n\n\tdouble first_time = BIG_NUM;\n\tType first_event = ARRIVE_ROOM;\n\tint first_ship,first_room;\n\n\t//閘門の情報を取得\n\tfor(int i = 0; i < num_room; i++){\n\n\t\tscanf(\"%lf %lf %lf %lf %d\",&X,&L,&F,&D,&UD);\n\t\tinfo[i].set(X,L/D,L/F,UD == 0);\n\n\t\t//シミュレーションの開始時点において、水位は低い方に合っている\n\t\tif(info[i].is_east_higher){\n\t\t\tinfo[i].water = West;\n\t\t}else{\n\t\t\t//★★★西側の水位に合わせる★★★\n\t\t\tinfo[i].water = Moving;\n\t\t\tinfo[i].next_water = West;\n\t\t\tinfo[i].move_end_time = info[i].up_time;\n\t\t\tif(first_time > info[i].up_time){\n\t\t\t\tfirst_time = info[i].up_time;\n\t\t\t\tfirst_event = WATER_UP;\n\t\t\t\tfirst_ship = -1;\n\t\t\t\tfirst_room = i;\n\t\t\t}\n\t\t}\n\t\tinfo[i].wait_ship_id = -1; //★待っている船があれば、そのidを持つ★\n\t}\n\tinfo[num_room].loc = LENGTH; //★時間計算簡易化のため★\n\n\tint tmp_speed;\n\n\t//船の情報を取得\n\tfor(int i = 0; i < num_ship; i++){\n\n\t\tscanf(\"%d\",&tmp_speed);\n\t\tship[i].set(-1*i,tmp_speed,tmp_speed);\n\t\tship[i].last_room = -1; //最後に通過した閘門のインデックス\n\t\tship[i].is_waiting = false;\n\t\tdebug_array[i] = 0;\n\t}\n\n\tint tmp_id,next_ship,next_room;\n\tdouble ans = BIG_NUM;\n\tdouble tmp_time;\n\n\tType next_type;\n\n\t//★最初は1km等間隔に並んでいるため、まず船の速度を設定する★\n\tset_speed(0);\n\n\t/*★★船の速度が変化するイベントは、前のものが終わるまで、次のものをpushしない★★*/\n\n\tpriority_queue<Data> Q;\n\n\tif(first_event == ARRIVE_ROOM){\n\n\t\tQ.push(Data(calc_time(0,0),0,0,ARRIVE_ROOM)); //全ての閘門の水位が西に合っているなら、先頭の船のイベントを追加\n\t}else{\n\n\t\ttmp_time = calc_time(0,0);\n\n\t\tif(tmp_time < first_time){\n\n\t\t\tQ.push(Data(tmp_time,0,0,ARRIVE_ROOM));\n\t\t}else{\n\n\t\t\tQ.push(Data(first_time,first_ship,first_room,first_event));\n\t\t}\n\t}\n\n\tData data;\n\tdouble current_time,pre_time = 0,next_time;\n\tint ship_head = 0;\n\n\t//int debug = 0;\n\n\twhile(true){\n\t\t/*debug++;\n\t\tif(debug == 1000000){\n\t\t\tprintf(\"LOOP!!\\n\");\n\t\t\tprintf(\"case:%d\\n\",num_case);\n\t\t\tSTOP = true;\n\t\t\treturn;\n\t\t}\n*/\n\t\tdata = Q.top();\n\t\tQ.pop();\n\n\t\tcurrent_time = Q.top().event_time;\n\t\t//★★船全体を動かす★★\n\t\tif(fabs(current_time-pre_time) > EPS){\n\t\t\tcalc_loc(0,current_time-pre_time);\n\t\t}\n\n\t\t/*if(fabs(current_time-pre_time) > EPS && fabs(current_time-pre_time) < 0.001-EPS){\n\t\t\tprintf(\"diff:%.10lf\\n\",fabs(current_time-pre_time));\n\t\t\treturn;\n\t\t}\n\n\t\tprintf(\"\\ncurrent_time:%.3lf head_ship:%d\\n\",current_time,ship_head);*/\n\n\t\t/*if(fabs(current_time-BIG_NUM) < EPS){\n\t\t\tprintf(\"強制終了\\n\");\n\t\t\tprintf(\"case:%d\\n\",num_case);\n\t\t\tSTOP = true;\n\t\t\treturn;\n\t\t}*/\n\n\t\tswitch(data.type){\n\t\tcase CATCH_UP: //ある船が別の船の1km後方に到達した場合\n\n\t\t\t//printf(\"CATCH_UP :船%d\\n\",data.ship_id);\n\n\t\t\tship[data.ship_id].current_speed = ship[data.ship_id-1].current_speed;\n\t\t\tset_speed(data.ship_id); //影響を後ろに伝播させる\n\n\t\t\tbreak;\n\n\t\tcase ARRIVE_ROOM: //ある船がある閘門に到達した場合\n\n\t\t\t//printf(\"ARRIVE_ROOM 船:%d 部屋:%d\\n\",data.ship_id,data.room_id);\n\n\t\t\t//閘門の中ではspeed0とする\n\t\t\tship[data.ship_id].current_speed = 0;\n\t\t\tship[data.ship_id].is_waiting = true;\n\t\t\t//自分以降の船に、停止情報を伝える\n\t\t\tset_speed(data.ship_id);\n\n\t\t\tinfo[data.room_id].wait_ship_id = data.ship_id; //★とりあえず待つ★\n\n\t\t\tif(info[data.room_id].water == West){ //水位が西側に合っている場合のみ中に入る\n\n\t\t\t\tif(info[data.room_id].is_east_higher){\n\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\t}else{\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\t}\n\t\t\t\t//printf(\"move_end:%.2lf\\n\",info[data.room_id].move_end_time);\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase WATER_UP:\n\n\t\t\t//printf(\"WATER_UP 部屋%d\\n\",data.room_id);\n\n\t\t\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合\n\n\t\t\t\t//printf(\"東が高く、かつ東にいある\\n\");\n\n\t\t\t\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\n\t\t\t\ttmp_id = info[data.room_id].wait_ship_id;\n\t\t\t\t//printf(\"船:%d\\n\",tmp_id);\n\t\t\t\tship[tmp_id].last_room = data.room_id; //通過済とする\n\t\t\t\tship[tmp_id].is_waiting = false;\n\t\t\t\tdebug_array[tmp_id]++;\n\t\t\t\tinfo[data.room_id].wait_ship_id = -1;\n\n\t\t\t\t//★閘門を通過した船の速度を設定する\n\t\t\t\tif(tmp_id == 0){\n\n\t\t\t\t\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\n\t\t\t\t\tset_speed(tmp_id); //影響を伝播させる\n\n\t\t\t\t}else{ //自分が先頭でないなら、自分の1つ前から計算すれば良い\n\n\t\t\t\t\tset_speed(tmp_id-1);\n\t\t\t\t}\n\n\t\t\t\t//閘門の水位が動き終わる時刻等を設定\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\t//printf(\"move_end:%.3lf\\n\",info[data.room_id].move_end_time);\n\t\t\t\tinfo[data.room_id].next_water = West;\n\n\t\t\t}else{ //西側の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\n\n\t\t\t\t//printf(\"西が高く、かつ西にいる\\n\");\n\n\t\t\t\tinfo[data.room_id].water = West;\n\t\t\t\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\n\t\t\t\t\t//printf(\"船%dが待っている\\n\",info[data.room_id].wait_ship_id);\n\t\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\n\t\t\t\t\t//printf(\"move_end:%.2lf\\n\",info[data.room_id].move_end_time);\n\t\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\tcase WATER_DOWN:\n\n\t\t\t//printf(\"WATER_DOWN 部屋%d\\n\",data.room_id);\n\n\t\t\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\n\n\t\t\t\t//printf(\"東が高くて、今西にいる\\n\");\n\n\t\t\t\tinfo[data.room_id].water = West;\n\t\t\t\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\n\t\t\t\t\t//printf(\"船%dが待っている\\n\",info[data.room_id].wait_ship_id);\n\t\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\t\t//printf(\"move_end:%.2lf\\n\",info[data.room_id].move_end_time);\n\t\t\t\t\tinfo[data.room_id].next_water = East;\n\t\t\t\t}\n\n\t\t\t}else{ //西側の方が水位が高い場合\n\n\t\t\t\t//printf(\"西が高くて、今東にいる\\n\");\n\n\t\t\t\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\n\t\t\t\ttmp_id = info[data.room_id].wait_ship_id;\n\t\t\t\t//printf(\"船%d\\n\",tmp_id);\n\t\t\t\tship[tmp_id].last_room = data.room_id; //通過済とする\n\t\t\t\tship[tmp_id].is_waiting = false;\n\t\t\t\tinfo[data.room_id].wait_ship_id = -1;\n\t\t\t\tdebug_array[tmp_id]++;\n\n\t\t\t\t//★閘門を通過した船の速度を設定する:仮に自分が先頭でないなら、自分の1つ前から計算すれば良い★\n\t\t\t\tif(tmp_id == 0){\n\n\t\t\t\t\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\n\t\t\t\t\tset_speed(tmp_id); //影響を伝播させる\n\n\t\t\t\t}else{\n\n\t\t\t\t\tset_speed(tmp_id-1);\n\t\t\t\t}\n\n\t\t\t\t//閘門の水位が動き終わる時刻等を設定\n\t\t\t\tinfo[data.room_id].water = Moving;\n\t\t\t\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\n\t\t\t\t//printf(\"move_end:%.2lf\\n\",info[data.room_id].move_end_time);\n\t\t\t\tinfo[data.room_id].next_water = West;\n\t\t\t}\n\n\t\t\tbreak;\n\t\tcase FINISH: //ある船が川を抜けた場合\n\n\t\t\t//printf(\"FINISH\\n\");\n\n\t\t\tans = current_time;\n\n\t\t\tship_head++;\n\t\t\tbreak;\n\t\t}\n\n\t\tif(ship_head == num_ship)break;\n\n\t\t/*★★★最も早く起こる、次のイベントを計算★★★*/\n\t\tnext_time = BIG_NUM;\n\n\t\t//船を走査\n\t\tfor(int i = 0; i < num_ship; i++){\n\n\t\t\tif(fabs(ship[i].current_speed) < EPS){ //★閘門前、または前が詰まっているために待ち状態ならSKIP\n\n\t\t\t\t//★★★ぴったり、閘門の前で止まっている場合あり★★★\n\t\t\t\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS && ship[i].is_waiting == false){\n\n\t\t\t\t\tnext_time = current_time; //現在なので必ず最速\n\t\t\t\t\tnext_ship = i;\n\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\tnext_type = ARRIVE_ROOM;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\n\t\t\t\t\tprintf(\"locAA\\n\");\n\t\t\t\t\tprintf(\"diff:%.10lf\\n\",fabs(current_time-next_time));\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}*/\n\n\t\t\t}else{\n\n\t\t\t\t//★1つ前の船の1km手前に追いつく時刻\n\t\t\t\tif(i != 0 && ship[i].current_speed > ship[i-1].current_speed){\n\n\t\t\t\t\ttmp_time = current_time+((ship[i-1].current_loc-ship[i].current_loc)-1.0)/(double)(ship[i].current_speed-ship[i-1].current_speed);\n\n\t\t\t\t\t//printf(\"船%dが%.2lfに追いつく\\n\",i,tmp_time);\n\n\t\t\t\t\tif(next_time > tmp_time){\n\n\t\t\t\t\t\tif(fabs(next_time-tmp_time) < EPS){\n\t\t\t\t\t\t\tnext_time = current_time;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = -1;\n\t\t\t\t\t\tnext_type = CATCH_UP;\n\n\t\t\t\t\t\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\n\t\t\t\t\t\t\t\t\t\t\tprintf(\"locBB\\n\");\n\t\t\t\t\t\t\t\t\t\t\tprintf(\"diff:%.10lf\\n\",fabs(current_time-next_time));\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t\t\t\t\t}*/\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(i < ship_head || fabs(ship[i].current_speed) < EPS)continue;\n\n\t\t\t\t//★閘門に到達する時刻\n\t\t\t\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS){\n\n\t\t\t\t\ttmp_time = current_time;\n\n\t\t\t\t}else{\n\n\t\t\t\t\ttmp_time = current_time+calc_time(i,ship[i].last_room+1);\n\t\t\t\t}\n\t\t\t\t//printf(\"tmp_time:%.2lf\\n\",tmp_time);\n\n\t\t\t\tif(ship[i].last_room+1 == num_room){ //次で川を出る場合\n\n\t\t\t\t\tif(next_time > tmp_time){\n\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\t\tnext_type = FINISH;\n\t\t\t\t\t}\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(next_time > tmp_time){\n\t\t\t\t\t\tnext_time = tmp_time;\n\t\t\t\t\t\tnext_ship = i;\n\t\t\t\t\t\tnext_room = ship[i].last_room+1;\n\t\t\t\t\t\tnext_type = ARRIVE_ROOM;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\n\t\t\t\tprintf(\"locCC\\n\");\n\t\t\t\tprintf(\"船%d 門:%d 船スピード:%d 船loc:%.3lf 門loc:%.3lf\\n\",i,ship[i].last_room+1,ship[i].current_speed,ship[i].current_loc,info[ship[i].last_room+1].loc);\n\t\t\t\tprintf(\"diff:%.10lf\\n\",fabs(current_time-next_time));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}*/\n\t\t\t}\n\t\t}\n\n\t\t//閘門を走査\n\t\tfor(int i = 0; i < num_room; i++){\n\n\t\t\tif(info[i].water != Moving)continue;\n\n\t\t\tif(next_time > info[i].move_end_time){\n\n\t\t\t\tnext_time = info[i].move_end_time;\n\t\t\t\tnext_room = i;\n\t\t\t\tnext_ship = -1;\n\n\t\t\t\t//printf(\"閘門%d\\n\",i);\n\n\t\t\t\tif(info[i].is_east_higher){\n\n\t\t\t\t\tif(info[i].next_water == West){\n\t\t\t\t\t\tnext_type = WATER_DOWN;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_type = WATER_UP;\n\t\t\t\t\t}\n\t\t\t\t}else{ //西の方が水位が高い\n\n\t\t\t\t\tif(info[i].next_water == West){\n\t\t\t\t\t\tnext_type = WATER_UP;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tnext_type = WATER_DOWN;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tQ.push(Data(next_time,next_ship,next_room,next_type));\n\n\t\tpre_time = current_time;\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n\tnum_case++;\n\n\t/*for(int i = 0; i < num_ship; i++){\n\t\tif(debug_array[i] != 100){\n\t\t\tprintf(\"船%d debug_array:%d\\n\",i,debug_array[i]);\n\t\t}\n\t}*/\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %lf\",&num_room,&num_ship,&LENGTH);\n\t\tif(num_room == 0)break;\n\n\t\tfunc();\n\t\tif(STOP)break;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":400,"memory_kb":3148,"score_of_the_acc":-1.3697,"final_rank":10},{"submission_id":"aoj_2202_1556140","code_snippet":"#include<iostream>\n\nusing namespace std;\n\ndouble in[123][2234],out[123][2234];\n\nint main(){\n for(int N,M,K;cin>>N>>M>>K,N|M|K;){\n int O=M-1;\n double canal[2234]={};\n double rtime[2234]={},ltime[2234]={};\n for(int i=0;i<N;i++){\n int X,L,F,D,UD;\n cin>>X>>L>>F>>D>>UD;\n rtime[X+O]=UD?L*1./D:L*1./F;\n ltime[X+O]=UD?L*1./F:L*1./D;\n if(UD){\n\tcanal[X+O]=ltime[X+O];\n }\n }\n int V[123];\n for(int i=0;i<M;i++){\n cin>>V[i];\n }\n for(int i=0;i<M;i++){\n double t=0;\n for(int j=O-i;j<2200;j++){\n\tin[i][j]=t;\n\tout[i][j]=max(t,canal[j])+rtime[j];\n\tcanal[j]=out[i][j]+ltime[j];\n\tt=max(out[i][j]+1./V[i],!i?0:in[i-1][j+2]);\n }\n }\n cout<<fixed<<in[M-1][K+O]<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5076,"score_of_the_acc":-0.5961,"final_rank":4},{"submission_id":"aoj_2202_1426514","code_snippet":"#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nstruct kanmon{\n\tdouble x;\n\tdouble L,F,D;\n\tint UD;\n\tdouble up,down;\n};\nvoid mainmain(){\n\tint n,m,K;\n\n\twhile(cin>>n>>m>>K,n||m||K){\n\t\tvector<kanmon> v(n);\n\t\tvint pos(K+300,-1);\n\t\trep(i,n){\n\t\t\tcin>>v[i].x>>v[i].L>>v[i].F>>v[i].D>>v[i].UD;\n\t\t\tv[i].up=v[i].L/v[i].F;\n\t\t\tv[i].down=v[i].L/v[i].D;\n\t\t\tpos[v[i].x+150]=i;\n\t\t}\n\t\tvector<double> w(m);\n\t\trep(i,m) cin>>w[i];\n\t\tvector<VV(double)> dp;\n\t\tinitvv(dp,m,K+300,vector<double>(2,0));\n\t\trep(i,m){\n\t\t\tdp[i][-i+150][0]=dp[i][-i+150][1]=0;\n\t\t}\n\t\trep(i,m){\n\t\t\treep(j,-i+150+1,K+(m-1-i)+150+1){\n\t\t\t\tif(!i){\n\t\t\t\t\tif(pos[j]==-1){\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j][1]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tint p=pos[j];\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t\tif(v[p].UD){\n\t\t\t\t\t\t\tdp[i][j][0]=max(dp[i][j][0],v[p].up);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[i][j][1]=dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif(pos[j]==-1){\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j][1]=max(dp[i][j-1][1]+1.0/w[i],dp[i-1][j+1][0]);\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tint p=pos[j];\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t\tdp[i][j][0]=max(dp[i][j][0],max(dp[i-1][j+1][0],dp[i-1][j][1]+(v[p].UD?v[p].up:v[p].down)));\n\t\t\t\t\t\tdp[i][j][1]=max(dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down),dp[i-1][j+1][0]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<dp[m-1][K+150][0]<<endl;\n\t}\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(10);\n mainmain();\n}","accuracy":1,"time_ms":30,"memory_kb":8516,"score_of_the_acc":-1.0513,"final_rank":6},{"submission_id":"aoj_2202_1426512","code_snippet":"#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\nstruct kanmon{\n\tdouble x;\n\tdouble L,F,D;\n\tint UD;\n\tdouble up,down;\n};\nvoid mainmain(){\n\tint n,m,K;\n\n\twhile(cin>>n>>m>>K,n||m||K){\n\t\tvector<kanmon> v(n);\n\t\tvint pos(K+300,-1);\n\t\trep(i,n){\n\t\t\tcin>>v[i].x>>v[i].L>>v[i].F>>v[i].D>>v[i].UD;\n\t\t\tv[i].up=v[i].L/v[i].F;\n\t\t\tv[i].down=v[i].L/v[i].D;\n\t\t\tpos[v[i].x+150]=i;\n\t\t}\n\t\tvector<double> w(m);\n\t\trep(i,m) cin>>w[i];\n\t\tvector<VV(double)> dp;\n\t\tinitvv(dp,m,K+300,vector<double>(2,0));\n\t\trep(i,m){\n\t\t\tdp[i][-i+150][0]=dp[i][-i+150][1]=0;\n\t\t}\n\t\trep(i,m){\n\t\t\treep(j,-i+150+1,K+(m-1-i)+150+1){\n\t\t\t\tif(!i){\n\t\t\t\t\tif(pos[j]==-1){\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j][1]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tint p=pos[j];\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t\tif(v[p].UD){\n\t\t\t\t\t\t\tdp[i][j][0]=max(dp[i][j][0],v[p].up);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[i][j][1]=dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tif(pos[j]==-1){\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j][1]=max(dp[i][j-1][1]+1.0/w[i],dp[i-1][j+1][0]);\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tint p=pos[j];\n\t\t\t\t\t\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\n\t\t\t\t\t\tdp[i][j][0]=max(dp[i][j][0],max(dp[i-1][j+1][0],dp[i-1][j][1]+(v[p].UD?v[p].up:v[p].down)));\n\t\t\t\t\t\tdp[i][j][1]=max(dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down),dp[i-1][j+1][0]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// cout<<i<<\" \"<<j-150<<\" \"<<dp[i][j][0]<<endl;\n\t\t\t}\n\t\t\t// cout<<endl;\n\t\t}\n\t\tcout<<dp[m-1][K+150][0]<<endl;\n\t\t// rep(i,n){\n\t\t// \tdouble t;\n\t\t// \tif(i){\n\t\t// \t\tt=max((v[i].x-v[i-1].x)/w[0],(v[i].UD==0)?0.0:v[i].up)+dp[0][i];\n\t\t// \t}\n\t\t// \telse{\n\t\t// \t\tt=max(v[i].x/w[0],(v[i].UD==0)?v[i].down:v[i].up);\n\t\t// \t}\n\t\t// \tdp[0][i+1]=t+(v[i].UD==0?v[i].up:v[i].down);\n\t\t\t// cout<<i<<\" \"<<dp[0][i+1]<<endl;\n\t\t// }\n\t\t// dp[0][n+1]=dp[0][n]+(K-v[n-1].x)/w[0];\n\t\t// reep(i,1,m){\n\t\t// \trep(j,n){\n\t\t// \t\tdouble t1;\n\t\t// \t\tif(j){\n\t\t// \t\t\tt1=(v[j].x-v[j-1].x)/w[i];\n\t\t// \t\t}\n\t\t// \t\telse{\n\t\t// \t\t\tt1=v[j].x/w[i];\n\t\t// \t\t}\n\t\t// \t\tt1=max(t1,dp[i-1][j]);\n\t\t// \t}\n\t\t// }\n\t}\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(10);\n mainmain();\n}","accuracy":1,"time_ms":30,"memory_kb":8516,"score_of_the_acc":-1.0513,"final_rank":6},{"submission_id":"aoj_2202_1390640","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint N,M,K;\nint UD[200];\nint x[200],l[200],f[200],d[200];\ndouble X[200],L[200],F[200],D[200];\ndouble V[200],t[200];\n\nint id[2000];\nmap<int,double> s[200];\n\nint main(){\n while(1){\n\n for(int i=0;i<200;i++)s[i].clear();\n for(int i=0;i<2000;i++)id[i]=-1;\n\n cin>>N>>M>>K;\n if(N==0&&M==0&&K==0)break;\n \n for(int i=0;i<N;i++){\n cin>>x[i]>>l[i]>>f[i]>>d[i]>>UD[i];\n X[i]=x[i],L[i]=l[i],F[i]=f[i],D[i]=d[i];\n id[x[i]]=i;\n } \n\n for(int i=0;i<M;i++)cin>>V[i];\n \n for(int i=0;i<N;i++){\n t[i]=0;\n if(UD[i]==1){\n t[i]=L[i]/F[i];\n swap(F[i],D[i]);\n }\n }\n \n\n for(int j=1;j<=K+M-1;j++){\n s[0][j]=s[0][j-1]+1.0/V[0];\n if(id[j-1]==-1)continue;\n int k=id[j-1];\n\n if(s[0][j-1]<t[k]){\n\ts[0][j]=t[k]+L[k]/F[k]+1.0/V[0];\n\tt[k]=t[k]+L[k]/F[k]+L[k]/D[k];\n }else{\n\ts[0][j]=s[0][j-1]+L[k]/F[k]+1.0/V[0];\n\tt[k]=s[0][j-1]+L[k]/F[k]+L[k]/D[k];\n }\n }\n\n \n for(int i=1;i<M;i++){\n double v=1.0/V[i];\n for(int j=-i+1;j<=-i+K+M-1;j++){\n\ts[i][j]=max(s[i][j-1]+v,s[i-1][j+1]);\n\tif(j-1<0||id[j-1]==-1)continue;\n\tint k=id[j-1];\n\tif(s[i][j-1]<t[k]){\n\t s[i][j]=max(s[i][j],t[k]+L[k]/F[k]+v);\n\t t[k]=t[k]+L[k]/F[k]+L[k]/D[k];\n\t}else{\n\t s[i][j]=max(s[i][j],s[i][j-1]+L[k]/F[k]+v);\n\t t[k]=s[i][j-1]+L[k]/F[k]+L[k]/D[k];\n\t}\n }\n }\n \n printf(\"%.10f\\n\",s[M-1][K]);\n }\n return 0;\n\n}","accuracy":1,"time_ms":80,"memory_kb":8152,"score_of_the_acc":-1.1367,"final_rank":8},{"submission_id":"aoj_2202_1129383","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\ndouble last[1120];\nint x[110];\nint l[110];\nint f[110];\nint d[110];\nint u[110];\nint p[1120];\ndouble q[110];\nint v[110];\nint main(){\n\tint a,b,c;\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),a){\n\t\tfor(int i=0;i<=c+b+2;i++)p[i]=-1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tscanf(\"%d%d%d%d%d\",x+i,l+i,f+i,d+i,u+i);\n\t\t\tif(!u[i]){\n\t\t\t\tswap(f[i],d[i]);\n\t\t\t}\n\t\t\tp[x[i]]=i;\n\t\t}\n\t\tfor(int i=0;i<a;i++)q[i]=-999999999;\n\t\tfor(int i=0;i<=c+b+2;i++)last[i]=-999999999;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tif(u[i]==1)q[i]=-(double)l[i]/d[i];\n\t\t}\n\t//\tfor(int i=0;i<a;i++)printf(\"%f\\n\",q[i]);\n\t\tfor(int i=0;i<b;i++)scanf(\"%d\",v+i);\n\t\tfor(int i=0;i<b;i++){\n\t\t\n\t\t\tdouble now=0;\n\t\t\tfor(int j=0;j<=c+b;j++){\n\t\t\t\tif(j==0){\n\t\t\t\t\tnow=(double)i/v[i];\n\t\t\t\t}else now+=1.0/v[i];\n\t\t\t\tnow=max(now,last[j+1]);\n\t\t\t\t\n\t\t\t\tlast[j]=now;\n\t\t\t\tif(~p[j]){\n\t\t\t\t\tint at=p[j];\n\t\t\t\t\tnow=max(now,q[at]+(double)l[at]/f[at]+(double)l[at]/d[at]);\n\t\t\t\t\tq[at]=now;\n\t\t\t\t\tnow+=(double)l[at]/d[at];\n\t\t\t\t}\n\t\t\t//\tprintf(\"%d %d: %f\\n\",i,j,now);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.12f\\n\",last[c]);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":1084,"score_of_the_acc":-0.1273,"final_rank":2},{"submission_id":"aoj_2202_557968","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\n#define chmax(a,b) (a<b?(a=b,1):0)\n#define chmin(a,b) (a>b?(a=b,1):0)\n#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\nstruct Koumon {\n int x,l,f,d,ud;\n Koumon() {}\n Koumon(int x, int l, int f, int d, int ud) :\n x(x),l(l),f(f),d(d),ud(ud) {}\n double otime() {\n if (ud) return double(l)/d;\n else return double(l)/f;\n }\n double itime() {\n if (ud) return double(l)/f;\n else return double(l)/d;\n }\n double ini() {\n if (ud) return double(l)/f;\n else return 0;\n }\n};\n\ndouble dpin[101][1500];\ndouble dpout[101][1500];\ndouble dpava[101][1500];\n\nKoumon koumon[100];\nint kid[1500];\nint v[100];\n\nint main() {\n int n, m, k;\n while(cin>>n>>m>>k,n||m||k) {\n memset(kid,-1,sizeof(kid));\n REP(i,n) {\n int x,l,f,d,ud;\n cin>>x>>l>>f>>d>>ud;\n x+=100;\n koumon[i]=Koumon(x,l,f,d,ud);\n kid[x] = i;\n }\n REP(i,m) cin>>v[i];\n REP(i,m+1)REP(j,k+105) {\n dpin[i][j]=dpout[i][j]=dpava[i][j]=-1e100;\n }\n REP(i,m) {\n REP(j,k+103) {\n if (kid[j] >= 0) {\n dpava[i+1][j+1] = max(koumon[kid[j]].ini(), dpout[i][j+1] + koumon[kid[j]].itime());\n }\n dpin[i+1][j+1] = max(dpout[i+1][j]+1.0/v[i], dpin[i][j+2]);\n if (i==100-j) dpin[i+1][j+1] = 0;\n if (kid[j] >= 0) chmax(dpin[i+1][j+1], dpava[i+1][j+1]);\n dpout[i+1][j+1] = dpin[i+1][j+1];\n if (kid[j] >= 0) chmax(dpout[i+1][j+1], dpin[i+1][j+1] + koumon[kid[j]].otime());\n // cout << i << \" \" << j << \" \" << dpin[i+1][j+1] << \" \" << dpout[i+1][j+1] << endl;\n }\n }\n printf(\"%.10f\\n\", dpout[m][k+101]);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4752,"score_of_the_acc":-0.558,"final_rank":3},{"submission_id":"aoj_2202_81166","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\n#define INF (1<<30)\nint x[105], l[105], f[105], d[105], ud[105], v[105];\n\ndouble up(int n)\n{\n\treturn 1.0*l[n]/f[n];\n}\n\ndouble down(int n)\n{\n\treturn 1.0*l[n]/d[n];\n}\n\ndouble dp[105][1250];\n\nint main()\n{\n\tcout << setiosflags(ios::fixed) << setprecision(10);\n\t\n\tint N,M,K;\n\twhile(cin >> N >> M >> K, (N||M||K))\n\t{\n\t\tv[0]=INF;\n\t\tK+=100;\n\n\t\tx[N]=INF;\n\t\t\n\t\tmemset(dp,0,sizeof(dp));\n\t\t\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tcin >> x[i] >> l[i] >> f[i] >> d[i] >> ud[i];\n\t\t\tx[i]+=100;\n\t\t}\n\t\tfor(int i=1; i<=M; i++)\n\t\t\tcin >> v[i];\t\n\t\t\n\t\tfor(int i=0; i<=K+100; i++)\n\t\t\tdp[0][i]=0;\n\t\t\n\t\tfor(int i=0; i<N; i++)\n\t\t{\n\t\t\tif(ud[i]==0) dp[0][x[i]]=-INF;\n\t\t}\n\t\t\t\n\t\tfor(int i=1; i<=M; i++)\n\t\t{\n\t\t\tint g=0;\n\t\t\tfor(int j=100-i+2; j<=K+102; j++)\n\t\t\t{\n\t\t\t\tdouble tmp = dp[i-1][j+1];\n\t\t\t\tif(x[g+1]==j+1)\n\t\t\t\t{\n\t\t\t\t\tif(ud[g+1]==0) tmp-=up(g+1);\n\t\t\t\t\tif(ud[g+1]==1) tmp-=down(g+1);\n\t\t\t\t}\n\n\t\t\t\tif(x[g]!=j)\n\t\t\t\t{\n\t\t\t\t\tdp[i][j]=max(dp[i][j-1] + 1.0/v[i], tmp);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\n\t\t\t\t\tif(ud[g]==0) \n\t\t\t\t\t{\n\t\t\t\t\t\tdp[i][j]=max(dp[i][j-1]+1.0/v[i], max(dp[i-1][j]+down(g), tmp));\n\t\t\t\t\t\tdp[i][j]+=up(g);\n\t\t\t\t\t}\n\t\t\t\t\tif(ud[g]==1) \n\t\t\t\t\t{\n\t\t\t\t\t\tdp[i][j]=max(dp[i][j-1]+1.0/v[i], max(dp[i-1][j]+ up(g), tmp));\n\t\t\t\t\t\tdp[i][j]+=down(g);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg++;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << dp[M][K] << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2202_6370146\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.03.03 02:02:13 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &number_of_ships) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : number_of_ships) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &number_of_ships) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : number_of_ships) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\nstruct gate {\\n\\tdouble x;\\n\\tdouble water;\\n\\tdouble fill;\\n\\tdouble reduce;\\n\\tdouble left_height;\\n\\tdouble right_height;\\n\\tgate(double x, double water, double fill, double reduce, double lh, double rh)\\n\\t\\t: x(x), water(water), fill(fill), reduce(reduce), left_height(lh), right_height(rh) {}\\n};\\n\\nconst double eps = 1e-8;\\nbool eq(double a, double b) { return abs(a - b) < eps; }\\n\\ndouble solve(int gate_number) {\\n\\tint number_of_ships;\\n\\tdouble goal;\\n\\tcin >> number_of_ships >> goal;\\n\\n\\tV<gate> gates;\\n\\trep(gate_number) {\\n\\t\\tDBL(x, water, fill, reduce);\\n\\t\\tbool lft;\\n\\t\\tcin >> lft;\\n\\t\\tdouble lh, rh;\\n\\t\\tlh = rh = 0;\\n\\t\\tif(lft)\\n\\t\\t\\tlh = water;\\n\\t\\telse\\n\\t\\t\\trh = water;\\n\\t\\tgate g(x, water, fill, reduce, lh, rh);\\n\\t\\tdebug(x, water, fill, reduce, lh, rh);\\n\\t\\tgates.push_back(g);\\n\\t}\\n\\n\\tVEC(double, maxspeed, number_of_ships);\\n\\n\\tV<double> place(number_of_ships);\\n\\trep(i, number_of_ships) place[i] = -i;\\n\\tvector<double> water(gate_number, 0.);\\n\\tvector<int> gate_to_ship(gate_number, -1);\\n\\tvector<int> ship_to_gate(number_of_ships, -1);\\n\\tvector<int> gate_next(number_of_ships, 0);\\n\\tV<double> velocity(number_of_ships);\\n\\n\\tauto preceed_time = [&](const double time_span) {\\n\\t\\trep(i, number_of_ships) place[i] += velocity[i] * time_span;\\n\\t\\trep(j, gate_number) {\\n\\t\\t\\tconst gate &g = gates[j];\\n\\t\\t\\tif(gate_to_ship[j] == -1) {\\t // switched to left\\n\\t\\t\\t\\tif(g.left_height < g.right_height) water[j] -= time_span * g.reduce;\\n\\t\\t\\t\\t// water[j] = min(g.right_height, water[j] + g.fill * time_span);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\twater[j] += time_span * g.fill;\\n\\t\\t\\t\\t// water[j] = max(g.right_height, water[j] - g.reduce * time_span);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif(g.left_height < g.right_height) water[j] += time_span * g.fill;\\n\\t\\t\\t\\t// water[j] = max(g.left_height, water[j] - g.reduce * time_span);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\twater[j] -= time_span * g.reduce;\\n\\t\\t\\t\\t// water[j] = min(g.left_height, water[j] + g.fill * time_span);\\n\\t\\t\\t\\t// water[j] += g.fill * time_span;\\n\\t\\t\\t}\\n\\t\\t\\tchmax(water[j], 0.);\\n\\t\\t\\tchmin(water[j], g.water);\\n\\t\\t}\\n\\t\\trep(shipid, number_of_ships) {\\n\\t\\t\\tif(ship_to_gate[shipid] == -1) {\\n\\t\\t\\t\\tconst int nxtid = gate_next[shipid];\\n\\t\\t\\t\\tif(nxtid < gate_number) {\\n\\t\\t\\t\\t\\tconst gate > = gates[nxtid];\\n\\t\\t\\t\\t\\tdebug(gt.x, place[shipid]);\\n\\t\\t\\t\\t\\tif(eq(gt.x, place[shipid])) {\\n\\t\\t\\t\\t\\t\\tif(eq(gt.left_height, water[nxtid])) {\\n\\t\\t\\t\\t\\t\\t\\tship_to_gate[shipid] = nxtid;\\n\\t\\t\\t\\t\\t\\t\\tgate_to_ship[nxtid] = shipid;\\n\\t\\t\\t\\t\\t\\t\\tvelocity[shipid] = 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tconst int gateid = ship_to_gate[shipid];\\n\\t\\t\\t\\tassert(in_range(gateid, 0, gate_number));\\n\\t\\t\\t\\tconst gate &g = gates[gateid];\\n\\t\\t\\t\\tif(eq(g.right_height, water[gateid])) {\\n\\t\\t\\t\\t\\tgate_next[shipid]++;\\n\\t\\t\\t\\t\\tship_to_gate[shipid] = -1;\\n\\t\\t\\t\\t\\tgate_to_ship[gateid] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(shipid, number_of_ships) {\\n\\t\\t\\tdouble &vel = velocity[shipid];\\n\\n\\t\\t\\tif(ship_to_gate[shipid] != -1)\\n\\t\\t\\t\\tvel = 0;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif(shipid) {\\n\\t\\t\\t\\t\\tdouble dist = place[shipid - 1] - place[shipid];\\n\\t\\t\\t\\t\\tvel = (eq(dist, 1.) ? min(maxspeed[shipid], velocity[shipid - 1]) : maxspeed[shipid]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tvel = maxspeed[shipid];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tconst int nxtgateid = gate_next[shipid];\\n\\t\\t\\tif(nxtgateid < gate_number) {\\n\\t\\t\\t\\tconst auto > = gates[nxtgateid];\\n\\t\\t\\t\\tif(eq(gt.x, place[shipid])) vel = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn;\\n\\t};\\n\\n\\tpreceed_time(0.);\\n\\n\\tdouble time = 0;\\n\\tauto nxt_incident = [&]() {\\n\\t\\tdouble ret = INF;\\n\\t\\t// if(eps < velocity.back()) {\\n\\t\\t// \\tchmin(ret, (goal - place.back()) / velocity.back());\\n\\t\\t// }\\n\\n\\t\\tif(gate_next.back() == gate_number)\\n\\t\\t\\tif(chmin(ret, (goal - place.back()) / velocity.back())) {\\n\\t\\t\\t\\tdebug(ret);\\n\\t\\t\\t\\t// debug(\\\"end is coming!\\\");\\n\\t\\t\\t}\\n\\n\\t\\trep(shipid, number_of_ships) {\\n\\t\\t\\tconst double &vel = velocity[shipid];\\n\\t\\t\\tconst double &plc = place[shipid];\\n\\t\\t\\tif(shipid) {\\n\\t\\t\\t\\tdouble dist = place[shipid - 1] - plc - 1.;\\n\\t\\t\\t\\tassert(dist > -eps);\\n\\t\\t\\t\\tdouble vel_diff = vel - velocity[shipid - 1];\\n\\t\\t\\t\\tif(vel_diff > eps) {\\n\\t\\t\\t\\t\\tif(chmin(ret, dist / vel_diff)) {\\n\\t\\t\\t\\t\\t\\tdebug(ret);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(ship_to_gate[shipid] != -1) continue;\\n\\t\\t\\tint nxtgateid = gate_next[shipid];\\n\\t\\t\\tif(nxtgateid < gate_number) {\\n\\t\\t\\t\\tconst double dist = gates[nxtgateid].x - place[shipid];\\n\\t\\t\\t\\tif(!eq(dist, 0.))\\n\\t\\t\\t\\t\\tif(chmin(ret, dist / vel)) {\\n\\t\\t\\t\\t\\t\\tdebug(ret);\\n\\t\\t\\t\\t\\t\\tdebug(dist, vel);\\n\\t\\t\\t\\t\\t\\tif(ret < eps) exit(0);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(gateid, gate_number) {\\n\\t\\t\\tdouble watercap, fill, reduce;\\n\\t\\t\\tconst auto &g = gates[gateid];\\n\\t\\t\\twatercap = g.water;\\n\\t\\t\\tfill = g.fill;\\n\\t\\t\\treduce = g.reduce;\\n\\n\\t\\t\\tif(gate_to_ship[gateid] == -1 && !eq(g.left_height, water[gateid])) {\\n\\t\\t\\t\\tdouble chg = g.fill;\\n\\t\\t\\t\\tif(g.left_height < g.right_height) chg = g.reduce;\\n\\t\\t\\t\\tdouble diff = abs(g.left_height - water[gateid]);\\n\\t\\t\\t\\tif(chmin(ret, diff / chg)) {\\n\\t\\t\\t\\t\\tdebug(ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(gate_to_ship[gateid] != -1 && !eq(g.right_height, water[gateid])) {\\n\\t\\t\\t\\t// chmin(ret, (watercap - water[gateid]) / fill);\\n\\t\\t\\t\\tdouble chg = g.fill;\\n\\t\\t\\t\\tif(g.left_height > g.right_height) chg = g.reduce;\\n\\t\\t\\t\\tdouble diff = abs(g.right_height - water[gateid]);\\n\\t\\t\\t\\tif(chmin(ret, diff / chg)) {\\n\\t\\t\\t\\t\\tdebug(ret);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\n\\twhile(place.back() < goal - eps) {\\n\\t\\tdouble timelen = nxt_incident();\\n\\t\\tpreceed_time(timelen);\\n\\t\\ttime += timelen;\\n\\t\\tdebug(place, time);\\n\\t\\tdebug(velocity);\\n\\t\\tdebug(ship_to_gate);\\n\\t\\tdebug(gate_to_ship);\\n\\t\\tdebug(gate_next);\\n\\t\\tdebug(water);\\n\\n\\t\\tconst gate &g = gates.front();\\n\\t\\tdebug(g.x, g.water, g.left_height, g.right_height, g.reduce, g.fill);\\n\\t}\\n\\n\\treturn time;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\t// cin >> n;\\n\\twhile(cin >> n && n) {\\n\\t\\tcout << solve(n) << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.605,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2202_3138800\",\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.0000001\\n#define NUM 105\\n\\nenum Type{\\n\\tCATCH_UP,\\n\\tARRIVE_ROOM,\\n\\tWATER_UP,\\n\\tWATER_DOWN,\\n\\tFINISH,\\n};\\n\\nenum Water{\\n\\tWest,\\n\\tEast,\\n\\tMoving,\\n};\\n\\nstruct Info{\\n\\tvoid set(double arg_loc,double arg_down_time,double arg_up_time,bool arg_is_east_higher){\\n\\t\\tloc = arg_loc;\\n\\t\\tdown_time = arg_down_time;\\n\\t\\tup_time = arg_up_time;\\n\\t\\tis_east_higher = arg_is_east_higher;\\n\\t}\\n\\tdouble loc,down_time,up_time,move_end_time;\\n\\tbool is_east_higher;\\n\\tint wait_ship_id;\\n\\tWater water,next_water;\\n};\\n\\nstruct Ship{\\n\\tvoid set(double arg_current_loc,int arg_max_speed,int arg_current_speed){\\n\\t\\tcurrent_loc = arg_current_loc;\\n\\t\\tmax_speed = arg_max_speed;\\n\\t\\tcurrent_speed = arg_current_speed;\\n\\t}\\n\\tdouble current_loc;\\n\\tbool is_waiting;\\n\\tint last_room,max_speed,current_speed;\\n};\\n\\nstruct Data{\\n\\tData(){\\n\\t\\tevent_time = 0;\\n\\t\\tship_id = 0;\\n\\t\\troom_id = 0;\\n\\t\\ttype = CATCH_UP;\\n\\t}\\n\\tData(double arg_event_time,int arg_ship_id,int arg_room_id,Type arg_type){\\n\\t\\tevent_time = arg_event_time;\\n\\t\\tship_id = arg_ship_id;\\n\\t\\troom_id = arg_room_id;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn event_time > arg.event_time;\\n\\t}\\n\\tdouble event_time;\\n\\tint ship_id,room_id;\\n\\tType type;\\n};\\n\\nint num_room,num_ship;\\nint debug_array[NUM];\\ndouble LENGTH;\\nInfo info[NUM];\\nShip ship[NUM];\\n\\nvoid set_speed(int ship_head){\\n\\n\\t//★前の船との距離がちょうど1kmで、1つ前の航行速度より最大速度が速いなら、1つ前のスピードに合わせる\\n\\tfor(int i = ship_head+1; i < num_ship; i++){\\n\\n\\t\\tif(ship[i].is_waiting)continue; //閘門の中ならSKIP\\n\\n\\t\\tif(ship[i-1].current_loc-ship[i].current_loc > 1.0){ //距離が1より大きい\\n\\n\\t\\t\\tship[i].current_speed = ship[i].max_speed;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//距離がちょうど1\\n\\t\\tif(ship[i].max_speed > ship[i-1].current_speed){\\n\\n\\t\\t\\tship[i].current_speed = ship[i-1].current_speed;\\n\\t\\t}else{\\n\\n\\t\\t\\tship[i].current_speed = ship[i].max_speed;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc_loc(int ship_head,double add_time){\\n\\n\\tfor(int i = ship_head; i < num_ship; i++){\\n\\t\\tship[i].current_loc += ship[i].current_speed*add_time;\\n\\t}\\n}\\n\\n//ある船が、ある閘門に到着するまでの時間を求める\\ndouble calc_time(int ship_id,int room_id){\\n\\n\\tdouble dist = info[room_id].loc-ship[ship_id].current_loc;\\n\\treturn dist/(double)ship[ship_id].current_speed;\\n}\\n\\nvoid func(){\\n\\n\\tdouble X,L,F,D;\\n\\tint UD;\\n\\n\\tdouble first_time = BIG_NUM;\\n\\tType first_event = ARRIVE_ROOM;\\n\\tint first_ship,first_room;\\n\\n\\t//閘門の情報を取得\\n\\tfor(int i = 0; i < num_room; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf %d\\\",&X,&L,&F,&D,&UD);\\n\\t\\tinfo[i].set(X,L/D,L/F,UD == 0);\\n\\n\\t\\t//シミュレーションの開始時点において、水位は低い方に合っている\\n\\t\\tif(info[i].is_east_higher){\\n\\t\\t\\tinfo[i].water = West;\\n\\t\\t}else{\\n\\t\\t\\t//★★★西側の水位に合わせる★★★\\n\\t\\t\\tinfo[i].water = Moving;\\n\\t\\t\\tinfo[i].next_water = West;\\n\\t\\t\\tinfo[i].move_end_time = info[i].up_time;\\n\\t\\t\\tif(first_time > info[i].up_time){\\n\\t\\t\\t\\tfirst_time = info[i].up_time;\\n\\t\\t\\t\\tfirst_event = WATER_UP;\\n\\t\\t\\t\\tfirst_ship = -1;\\n\\t\\t\\t\\tfirst_room = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tinfo[i].wait_ship_id = -1; //★待っている船があれば、そのidを持つ★\\n\\t}\\n\\tinfo[num_room].loc = LENGTH; //★時間計算簡易化のため★\\n\\n\\tint tmp_speed;\\n\\n\\t//船の情報を取得\\n\\tfor(int i = 0; i < num_ship; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&tmp_speed);\\n\\t\\tship[i].set(-1*i,tmp_speed,tmp_speed);\\n\\t\\tship[i].last_room = -1; //最後に通過した閘門のインデックス\\n\\t\\tship[i].is_waiting = false;\\n\\t\\tdebug_array[i] = 0;\\n\\t}\\n\\n\\tint tmp_id,next_ship,next_room;\\n\\tdouble ans = BIG_NUM;\\n\\tdouble tmp_time;\\n\\n\\tType next_type;\\n\\n\\t//★最初は1km等間隔に並んでいるため、まず船の速度を設定する★\\n\\tset_speed(0);\\n\\n\\t/*★★船の速度が変化するイベントは、前のものが終わるまで、次のものをpushしない★★*/\\n\\n\\tpriority_queue<Data> Q;\\n\\n\\tif(first_event == ARRIVE_ROOM){\\n\\n\\t\\tQ.push(Data(calc_time(0,0),0,0,ARRIVE_ROOM)); //全ての閘門の水位が西に合っているなら、先頭の船のイベントを追加\\n\\t}else{\\n\\n\\t\\ttmp_time = calc_time(0,0);\\n\\n\\t\\tif(tmp_time < first_time){\\n\\n\\t\\t\\tQ.push(Data(tmp_time,0,0,ARRIVE_ROOM));\\n\\t\\t}else{\\n\\n\\t\\t\\tQ.push(Data(first_time,first_ship,first_room,first_event));\\n\\t\\t}\\n\\t}\\n\\n\\tData data;\\n\\tdouble current_time,pre_time = 0,next_time;\\n\\tint ship_head = 0;\\n\\n\\twhile(true){\\n\\n\\t\\tdata = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tcurrent_time = Q.top().event_time;\\n\\t\\t//★★船全体を動かす★★\\n\\t\\tif(fabs(current_time-pre_time) > EPS){\\n\\t\\t\\tcalc_loc(0,current_time-pre_time);\\n\\t\\t}\\n\\n\\t\\tswitch(data.type){\\n\\t\\tcase CATCH_UP: //ある船が別の船の1km後方に到達した場合\\n\\n\\t\\t\\tship[data.ship_id].current_speed = ship[data.ship_id-1].current_speed;\\n\\t\\t\\tset_speed(data.ship_id); //影響を後ろに伝播させる\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase ARRIVE_ROOM: //ある船がある閘門に到達した場合\\n\\n\\t\\t\\t//閘門の中ではspeed0とする\\n\\t\\t\\tship[data.ship_id].current_speed = 0;\\n\\t\\t\\tship[data.ship_id].is_waiting = true;\\n\\t\\t\\t//自分以降の船に、停止情報を伝える\\n\\t\\t\\tset_speed(data.ship_id);\\n\\n\\t\\t\\tinfo[data.room_id].wait_ship_id = data.ship_id; //★とりあえず待つ★\\n\\n\\t\\t\\tif(info[data.room_id].water == West){ //水位が西側に合っている場合のみ中に入る\\n\\n\\t\\t\\t\\tif(info[data.room_id].is_east_higher){\\n\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase WATER_UP:\\n\\n\\t\\t\\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合\\n\\n\\t\\t\\t\\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\\n\\t\\t\\t\\ttmp_id = info[data.room_id].wait_ship_id;\\n\\t\\t\\t\\tship[tmp_id].last_room = data.room_id; //通過済とする\\n\\t\\t\\t\\tship[tmp_id].is_waiting = false;\\n\\t\\t\\t\\tdebug_array[tmp_id]++;\\n\\t\\t\\t\\tinfo[data.room_id].wait_ship_id = -1;\\n\\n\\t\\t\\t\\t//★閘門を通過した船の速度を設定する\\n\\t\\t\\t\\tif(tmp_id == 0){\\n\\n\\t\\t\\t\\t\\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\\n\\t\\t\\t\\t\\tset_speed(tmp_id); //影響を伝播させる\\n\\n\\t\\t\\t\\t}else{ //自分が先頭でないなら、自分の1つ前から計算すれば良い\\n\\n\\t\\t\\t\\t\\tset_speed(tmp_id-1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//閘門の水位が動き終わる時刻等を設定\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\tinfo[data.room_id].next_water = West;\\n\\n\\t\\t\\t}else{ //西側の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\\n\\n\\t\\t\\t\\tinfo[data.room_id].water = West;\\n\\t\\t\\t\\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\\n\\n\\t\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase WATER_DOWN:\\n\\n\\t\\t\\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\\n\\n\\t\\t\\t\\tinfo[data.room_id].water = West;\\n\\t\\t\\t\\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\\n\\t\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //西側の方が水位が高い場合\\n\\n\\t\\t\\t\\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\\n\\t\\t\\t\\ttmp_id = info[data.room_id].wait_ship_id;\\n\\t\\t\\t\\tship[tmp_id].last_room = data.room_id; //通過済とする\\n\\t\\t\\t\\tship[tmp_id].is_waiting = false;\\n\\t\\t\\t\\tinfo[data.room_id].wait_ship_id = -1;\\n\\t\\t\\t\\tdebug_array[tmp_id]++;\\n\\n\\t\\t\\t\\t//★閘門を通過した船の速度を設定する:仮に自分が先頭でないなら、自分の1つ前から計算すれば良い★\\n\\t\\t\\t\\tif(tmp_id == 0){\\n\\n\\t\\t\\t\\t\\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\\n\\t\\t\\t\\t\\tset_speed(tmp_id); //影響を伝播させる\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tset_speed(tmp_id-1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//閘門の水位が動き終わる時刻等を設定\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\tinfo[data.room_id].next_water = West;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak;\\n\\t\\tcase FINISH: //ある船が川を抜けた場合\\n\\n\\t\\t\\tans = current_time;\\n\\n\\t\\t\\tship_head++;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tif(ship_head == num_ship)break;\\n\\n\\t\\t/*★★★最も早く起こる、次のイベントを計算★★★*/\\n\\t\\tnext_time = BIG_NUM;\\n\\n\\t\\t//船を走査\\n\\t\\tfor(int i = 0; i < num_ship; i++){\\n\\n\\t\\t\\tif(fabs(ship[i].current_speed) < EPS){ //★閘門前、または前が詰まっているために待ち状態ならSKIP\\n\\n\\t\\t\\t\\t//★★★ぴったり、閘門の前で止まっている場合あり★★★\\n\\t\\t\\t\\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS && ship[i].is_waiting == false){\\n\\n\\t\\t\\t\\t\\tnext_time = current_time; //現在なので必ず最速\\n\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\tnext_type = ARRIVE_ROOM;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t//★1つ前の船の1km手前に追いつく時刻\\n\\t\\t\\t\\tif(i != 0 && ship[i].current_speed > ship[i-1].current_speed){\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time+((ship[i-1].current_loc-ship[i].current_loc)-1.0)/(double)(ship[i].current_speed-ship[i-1].current_speed);\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(next_time-tmp_time) < EPS){\\n\\t\\t\\t\\t\\t\\t\\tnext_time = current_time;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = -1;\\n\\t\\t\\t\\t\\t\\tnext_type = CATCH_UP;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(i < ship_head || fabs(ship[i].current_speed) < EPS)continue;\\n\\n\\t\\t\\t\\t//★閘門に到達する時刻\\n\\t\\t\\t\\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS){\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time+calc_time(i,ship[i].last_room+1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(ship[i].last_room+1 == num_room){ //次で川を出る場合\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\t\\tnext_type = FINISH;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\t\\tnext_type = ARRIVE_ROOM;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//閘門を走査\\n\\t\\tfor(int i = 0; i < num_room; i++){\\n\\n\\t\\t\\tif(info[i].water != Moving)continue;\\n\\n\\t\\t\\tif(next_time > info[i].move_end_time){\\n\\n\\t\\t\\t\\tnext_time = info[i].move_end_time;\\n\\t\\t\\t\\tnext_room = i;\\n\\t\\t\\t\\tnext_ship = -1;\\n\\n\\t\\t\\t\\tif(info[i].is_east_higher){\\n\\n\\t\\t\\t\\t\\tif(info[i].next_water == West){\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_DOWN;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_UP;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{ //西の方が水位が高い\\n\\n\\t\\t\\t\\t\\tif(info[i].next_water == West){\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_UP;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_DOWN;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tQ.push(Data(next_time,next_ship,next_room,next_type));\\n\\n\\t\\tpre_time = current_time;\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %lf\\\",&num_room,&num_ship,&LENGTH);\\n\\t\\tif(num_room == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -1.3473,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2202_3138795\",\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.0000001\\n#define NUM 105\\n\\nenum Type{\\n\\tCATCH_UP,\\n\\tARRIVE_ROOM,\\n\\tWATER_UP,\\n\\tWATER_DOWN,\\n\\tFINISH,\\n};\\n\\nenum Water{\\n\\tWest,\\n\\tEast,\\n\\tMoving,\\n};\\n\\nstruct Info{\\n\\tvoid set(double arg_loc,double arg_down_time,double arg_up_time,bool arg_is_east_higher){\\n\\t\\tloc = arg_loc;\\n\\t\\tdown_time = arg_down_time;\\n\\t\\tup_time = arg_up_time;\\n\\t\\tis_east_higher = arg_is_east_higher;\\n\\t}\\n\\tdouble loc,down_time,up_time,move_end_time;\\n\\tbool is_east_higher;\\n\\tint wait_ship_id;\\n\\tWater water,next_water;\\n};\\n\\nstruct Ship{\\n\\tvoid set(double arg_current_loc,int arg_max_speed,int arg_current_speed){\\n\\t\\tcurrent_loc = arg_current_loc;\\n\\t\\tmax_speed = arg_max_speed;\\n\\t\\tcurrent_speed = arg_current_speed;\\n\\t}\\n\\tdouble current_loc;\\n\\tbool is_waiting;\\n\\tint last_room,max_speed,current_speed;\\n};\\n\\nstruct Data{\\n\\tData(){\\n\\t\\tevent_time = 0;\\n\\t\\tship_id = 0;\\n\\t\\troom_id = 0;\\n\\t\\ttype = CATCH_UP;\\n\\t}\\n\\tData(double arg_event_time,int arg_ship_id,int arg_room_id,Type arg_type){\\n\\t\\tevent_time = arg_event_time;\\n\\t\\tship_id = arg_ship_id;\\n\\t\\troom_id = arg_room_id;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn event_time > arg.event_time;\\n\\t}\\n\\tdouble event_time;\\n\\tint ship_id,room_id;\\n\\tType type;\\n};\\n\\nint num_room,num_ship;\\nint debug_array[NUM];\\ndouble LENGTH;\\nInfo info[NUM];\\nShip ship[NUM];\\n\\nvoid set_speed(int ship_head){\\n\\n\\t//★前の船との距離がちょうど1kmで、1つ前の航行速度より最大速度が速いなら、1つ前のスピードに合わせる\\n\\tfor(int i = ship_head+1; i < num_ship; i++){\\n\\n\\t\\tif(ship[i].is_waiting)continue; //閘門の中ならSKIP\\n\\n\\t\\tif(ship[i-1].current_loc-ship[i].current_loc > 1.0){ //距離が1より大きい\\n\\n\\t\\t\\tship[i].current_speed = ship[i].max_speed;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t//距離がちょうど1\\n\\t\\tif(ship[i].max_speed > ship[i-1].current_speed){\\n\\n\\t\\t\\tship[i].current_speed = ship[i-1].current_speed;\\n\\t\\t}else{\\n\\n\\t\\t\\tship[i].current_speed = ship[i].max_speed;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc_loc(int ship_head,double add_time){\\n\\n\\tfor(int i = ship_head; i < num_ship; i++){\\n\\t\\tship[i].current_loc += ship[i].current_speed*add_time;\\n\\t}\\n}\\n\\n//ある船が、ある閘門に到着するまでの時間を求める\\ndouble calc_time(int ship_id,int room_id){\\n\\n\\tdouble dist = info[room_id].loc-ship[ship_id].current_loc;\\n\\treturn dist/(double)ship[ship_id].current_speed;\\n}\\n\\nbool STOP = false;\\nint num_case = 0;\\nvoid func(){\\n\\n\\tdouble X,L,F,D;\\n\\tint UD;\\n\\n\\tdouble first_time = BIG_NUM;\\n\\tType first_event = ARRIVE_ROOM;\\n\\tint first_ship,first_room;\\n\\n\\t//閘門の情報を取得\\n\\tfor(int i = 0; i < num_room; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf %lf %d\\\",&X,&L,&F,&D,&UD);\\n\\t\\tinfo[i].set(X,L/D,L/F,UD == 0);\\n\\n\\t\\t//シミュレーションの開始時点において、水位は低い方に合っている\\n\\t\\tif(info[i].is_east_higher){\\n\\t\\t\\tinfo[i].water = West;\\n\\t\\t}else{\\n\\t\\t\\t//★★★西側の水位に合わせる★★★\\n\\t\\t\\tinfo[i].water = Moving;\\n\\t\\t\\tinfo[i].next_water = West;\\n\\t\\t\\tinfo[i].move_end_time = info[i].up_time;\\n\\t\\t\\tif(first_time > info[i].up_time){\\n\\t\\t\\t\\tfirst_time = info[i].up_time;\\n\\t\\t\\t\\tfirst_event = WATER_UP;\\n\\t\\t\\t\\tfirst_ship = -1;\\n\\t\\t\\t\\tfirst_room = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tinfo[i].wait_ship_id = -1; //★待っている船があれば、そのidを持つ★\\n\\t}\\n\\tinfo[num_room].loc = LENGTH; //★時間計算簡易化のため★\\n\\n\\tint tmp_speed;\\n\\n\\t//船の情報を取得\\n\\tfor(int i = 0; i < num_ship; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&tmp_speed);\\n\\t\\tship[i].set(-1*i,tmp_speed,tmp_speed);\\n\\t\\tship[i].last_room = -1; //最後に通過した閘門のインデックス\\n\\t\\tship[i].is_waiting = false;\\n\\t\\tdebug_array[i] = 0;\\n\\t}\\n\\n\\tint tmp_id,next_ship,next_room;\\n\\tdouble ans = BIG_NUM;\\n\\tdouble tmp_time;\\n\\n\\tType next_type;\\n\\n\\t//★最初は1km等間隔に並んでいるため、まず船の速度を設定する★\\n\\tset_speed(0);\\n\\n\\t/*★★船の速度が変化するイベントは、前のものが終わるまで、次のものをpushしない★★*/\\n\\n\\tpriority_queue<Data> Q;\\n\\n\\tif(first_event == ARRIVE_ROOM){\\n\\n\\t\\tQ.push(Data(calc_time(0,0),0,0,ARRIVE_ROOM)); //全ての閘門の水位が西に合っているなら、先頭の船のイベントを追加\\n\\t}else{\\n\\n\\t\\ttmp_time = calc_time(0,0);\\n\\n\\t\\tif(tmp_time < first_time){\\n\\n\\t\\t\\tQ.push(Data(tmp_time,0,0,ARRIVE_ROOM));\\n\\t\\t}else{\\n\\n\\t\\t\\tQ.push(Data(first_time,first_ship,first_room,first_event));\\n\\t\\t}\\n\\t}\\n\\n\\tData data;\\n\\tdouble current_time,pre_time = 0,next_time;\\n\\tint ship_head = 0;\\n\\n\\t//int debug = 0;\\n\\n\\twhile(true){\\n\\t\\t/*debug++;\\n\\t\\tif(debug == 1000000){\\n\\t\\t\\tprintf(\\\"LOOP!!\\\\n\\\");\\n\\t\\t\\tprintf(\\\"case:%d\\\\n\\\",num_case);\\n\\t\\t\\tSTOP = true;\\n\\t\\t\\treturn;\\n\\t\\t}\\n*/\\n\\t\\tdata = Q.top();\\n\\t\\tQ.pop();\\n\\n\\t\\tcurrent_time = Q.top().event_time;\\n\\t\\t//★★船全体を動かす★★\\n\\t\\tif(fabs(current_time-pre_time) > EPS){\\n\\t\\t\\tcalc_loc(0,current_time-pre_time);\\n\\t\\t}\\n\\n\\t\\t/*if(fabs(current_time-pre_time) > EPS && fabs(current_time-pre_time) < 0.001-EPS){\\n\\t\\t\\tprintf(\\\"diff:%.10lf\\\\n\\\",fabs(current_time-pre_time));\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"\\\\ncurrent_time:%.3lf head_ship:%d\\\\n\\\",current_time,ship_head);*/\\n\\n\\t\\t/*if(fabs(current_time-BIG_NUM) < EPS){\\n\\t\\t\\tprintf(\\\"強制終了\\\\n\\\");\\n\\t\\t\\tprintf(\\\"case:%d\\\\n\\\",num_case);\\n\\t\\t\\tSTOP = true;\\n\\t\\t\\treturn;\\n\\t\\t}*/\\n\\n\\t\\tswitch(data.type){\\n\\t\\tcase CATCH_UP: //ある船が別の船の1km後方に到達した場合\\n\\n\\t\\t\\t//printf(\\\"CATCH_UP :船%d\\\\n\\\",data.ship_id);\\n\\n\\t\\t\\tship[data.ship_id].current_speed = ship[data.ship_id-1].current_speed;\\n\\t\\t\\tset_speed(data.ship_id); //影響を後ろに伝播させる\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase ARRIVE_ROOM: //ある船がある閘門に到達した場合\\n\\n\\t\\t\\t//printf(\\\"ARRIVE_ROOM 船:%d 部屋:%d\\\\n\\\",data.ship_id,data.room_id);\\n\\n\\t\\t\\t//閘門の中ではspeed0とする\\n\\t\\t\\tship[data.ship_id].current_speed = 0;\\n\\t\\t\\tship[data.ship_id].is_waiting = true;\\n\\t\\t\\t//自分以降の船に、停止情報を伝える\\n\\t\\t\\tset_speed(data.ship_id);\\n\\n\\t\\t\\tinfo[data.room_id].wait_ship_id = data.ship_id; //★とりあえず待つ★\\n\\n\\t\\t\\tif(info[data.room_id].water == West){ //水位が西側に合っている場合のみ中に入る\\n\\n\\t\\t\\t\\tif(info[data.room_id].is_east_higher){\\n\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//printf(\\\"move_end:%.2lf\\\\n\\\",info[data.room_id].move_end_time);\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\tcase WATER_UP:\\n\\n\\t\\t\\t//printf(\\\"WATER_UP 部屋%d\\\\n\\\",data.room_id);\\n\\n\\t\\t\\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合\\n\\n\\t\\t\\t\\t//printf(\\\"東が高く、かつ東にいある\\\\n\\\");\\n\\n\\t\\t\\t\\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\\n\\t\\t\\t\\ttmp_id = info[data.room_id].wait_ship_id;\\n\\t\\t\\t\\t//printf(\\\"船:%d\\\\n\\\",tmp_id);\\n\\t\\t\\t\\tship[tmp_id].last_room = data.room_id; //通過済とする\\n\\t\\t\\t\\tship[tmp_id].is_waiting = false;\\n\\t\\t\\t\\tdebug_array[tmp_id]++;\\n\\t\\t\\t\\tinfo[data.room_id].wait_ship_id = -1;\\n\\n\\t\\t\\t\\t//★閘門を通過した船の速度を設定する\\n\\t\\t\\t\\tif(tmp_id == 0){\\n\\n\\t\\t\\t\\t\\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\\n\\t\\t\\t\\t\\tset_speed(tmp_id); //影響を伝播させる\\n\\n\\t\\t\\t\\t}else{ //自分が先頭でないなら、自分の1つ前から計算すれば良い\\n\\n\\t\\t\\t\\t\\tset_speed(tmp_id-1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//閘門の水位が動き終わる時刻等を設定\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\t//printf(\\\"move_end:%.3lf\\\\n\\\",info[data.room_id].move_end_time);\\n\\t\\t\\t\\tinfo[data.room_id].next_water = West;\\n\\n\\t\\t\\t}else{ //西側の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\\n\\n\\t\\t\\t\\t//printf(\\\"西が高く、かつ西にいる\\\\n\\\");\\n\\n\\t\\t\\t\\tinfo[data.room_id].water = West;\\n\\t\\t\\t\\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\\n\\t\\t\\t\\t\\t//printf(\\\"船%dが待っている\\\\n\\\",info[data.room_id].wait_ship_id);\\n\\t\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].down_time;\\n\\t\\t\\t\\t\\t//printf(\\\"move_end:%.2lf\\\\n\\\",info[data.room_id].move_end_time);\\n\\t\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tcase WATER_DOWN:\\n\\n\\t\\t\\t//printf(\\\"WATER_DOWN 部屋%d\\\\n\\\",data.room_id);\\n\\n\\t\\t\\tif(info[data.room_id].is_east_higher){ //東の方が水位が高い場合(★船は中にいないが、手前で待っている場合あり★)\\n\\n\\t\\t\\t\\t//printf(\\\"東が高くて、今西にいる\\\\n\\\");\\n\\n\\t\\t\\t\\tinfo[data.room_id].water = West;\\n\\t\\t\\t\\tif(info[data.room_id].wait_ship_id != -1){ //水位の変動を待っている船がいる場合\\n\\t\\t\\t\\t\\t//printf(\\\"船%dが待っている\\\\n\\\",info[data.room_id].wait_ship_id);\\n\\t\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\t\\t//printf(\\\"move_end:%.2lf\\\\n\\\",info[data.room_id].move_end_time);\\n\\t\\t\\t\\t\\tinfo[data.room_id].next_water = East;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //西側の方が水位が高い場合\\n\\n\\t\\t\\t\\t//printf(\\\"西が高くて、今東にいる\\\\n\\\");\\n\\n\\t\\t\\t\\t//★基本的に閘門の水位は西側に合わせるので、必ず船がいるはず\\n\\t\\t\\t\\ttmp_id = info[data.room_id].wait_ship_id;\\n\\t\\t\\t\\t//printf(\\\"船%d\\\\n\\\",tmp_id);\\n\\t\\t\\t\\tship[tmp_id].last_room = data.room_id; //通過済とする\\n\\t\\t\\t\\tship[tmp_id].is_waiting = false;\\n\\t\\t\\t\\tinfo[data.room_id].wait_ship_id = -1;\\n\\t\\t\\t\\tdebug_array[tmp_id]++;\\n\\n\\t\\t\\t\\t//★閘門を通過した船の速度を設定する:仮に自分が先頭でないなら、自分の1つ前から計算すれば良い★\\n\\t\\t\\t\\tif(tmp_id == 0){\\n\\n\\t\\t\\t\\t\\tship[tmp_id].current_speed = ship[tmp_id].max_speed;\\n\\t\\t\\t\\t\\tset_speed(tmp_id); //影響を伝播させる\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tset_speed(tmp_id-1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//閘門の水位が動き終わる時刻等を設定\\n\\t\\t\\t\\tinfo[data.room_id].water = Moving;\\n\\t\\t\\t\\tinfo[data.room_id].move_end_time = current_time+info[data.room_id].up_time;\\n\\t\\t\\t\\t//printf(\\\"move_end:%.2lf\\\\n\\\",info[data.room_id].move_end_time);\\n\\t\\t\\t\\tinfo[data.room_id].next_water = West;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak;\\n\\t\\tcase FINISH: //ある船が川を抜けた場合\\n\\n\\t\\t\\t//printf(\\\"FINISH\\\\n\\\");\\n\\n\\t\\t\\tans = current_time;\\n\\n\\t\\t\\tship_head++;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tif(ship_head == num_ship)break;\\n\\n\\t\\t/*★★★最も早く起こる、次のイベントを計算★★★*/\\n\\t\\tnext_time = BIG_NUM;\\n\\n\\t\\t//船を走査\\n\\t\\tfor(int i = 0; i < num_ship; i++){\\n\\n\\t\\t\\tif(fabs(ship[i].current_speed) < EPS){ //★閘門前、または前が詰まっているために待ち状態ならSKIP\\n\\n\\t\\t\\t\\t//★★★ぴったり、閘門の前で止まっている場合あり★★★\\n\\t\\t\\t\\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS && ship[i].is_waiting == false){\\n\\n\\t\\t\\t\\t\\tnext_time = current_time; //現在なので必ず最速\\n\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\tnext_type = ARRIVE_ROOM;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\\n\\t\\t\\t\\t\\tprintf(\\\"locAA\\\\n\\\");\\n\\t\\t\\t\\t\\tprintf(\\\"diff:%.10lf\\\\n\\\",fabs(current_time-next_time));\\n\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}*/\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t//★1つ前の船の1km手前に追いつく時刻\\n\\t\\t\\t\\tif(i != 0 && ship[i].current_speed > ship[i-1].current_speed){\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time+((ship[i-1].current_loc-ship[i].current_loc)-1.0)/(double)(ship[i].current_speed-ship[i-1].current_speed);\\n\\n\\t\\t\\t\\t\\t//printf(\\\"船%dが%.2lfに追いつく\\\\n\\\",i,tmp_time);\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\n\\t\\t\\t\\t\\t\\tif(fabs(next_time-tmp_time) < EPS){\\n\\t\\t\\t\\t\\t\\t\\tnext_time = current_time;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = -1;\\n\\t\\t\\t\\t\\t\\tnext_type = CATCH_UP;\\n\\n\\t\\t\\t\\t\\t\\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tprintf(\\\"locBB\\\\n\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tprintf(\\\"diff:%.10lf\\\\n\\\",fabs(current_time-next_time));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}*/\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(i < ship_head || fabs(ship[i].current_speed) < EPS)continue;\\n\\n\\t\\t\\t\\t//★閘門に到達する時刻\\n\\t\\t\\t\\tif(fabs(ship[i].current_loc-info[ship[i].last_room+1].loc) < EPS){\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\ttmp_time = current_time+calc_time(i,ship[i].last_room+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//printf(\\\"tmp_time:%.2lf\\\\n\\\",tmp_time);\\n\\n\\t\\t\\t\\tif(ship[i].last_room+1 == num_room){ //次で川を出る場合\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\t\\tnext_type = FINISH;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(next_time > tmp_time){\\n\\t\\t\\t\\t\\t\\tnext_time = tmp_time;\\n\\t\\t\\t\\t\\t\\tnext_ship = i;\\n\\t\\t\\t\\t\\t\\tnext_room = ship[i].last_room+1;\\n\\t\\t\\t\\t\\t\\tnext_type = ARRIVE_ROOM;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/*if(fabs(current_time-next_time) > EPS && fabs(current_time-next_time) < 0.001-EPS){\\n\\t\\t\\t\\tprintf(\\\"locCC\\\\n\\\");\\n\\t\\t\\t\\tprintf(\\\"船%d 門:%d 船スピード:%d 船loc:%.3lf 門loc:%.3lf\\\\n\\\",i,ship[i].last_room+1,ship[i].current_speed,ship[i].current_loc,info[ship[i].last_room+1].loc);\\n\\t\\t\\t\\tprintf(\\\"diff:%.10lf\\\\n\\\",fabs(current_time-next_time));\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t}*/\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//閘門を走査\\n\\t\\tfor(int i = 0; i < num_room; i++){\\n\\n\\t\\t\\tif(info[i].water != Moving)continue;\\n\\n\\t\\t\\tif(next_time > info[i].move_end_time){\\n\\n\\t\\t\\t\\tnext_time = info[i].move_end_time;\\n\\t\\t\\t\\tnext_room = i;\\n\\t\\t\\t\\tnext_ship = -1;\\n\\n\\t\\t\\t\\t//printf(\\\"閘門%d\\\\n\\\",i);\\n\\n\\t\\t\\t\\tif(info[i].is_east_higher){\\n\\n\\t\\t\\t\\t\\tif(info[i].next_water == West){\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_DOWN;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_UP;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{ //西の方が水位が高い\\n\\n\\t\\t\\t\\t\\tif(info[i].next_water == West){\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_UP;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tnext_type = WATER_DOWN;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tQ.push(Data(next_time,next_ship,next_room,next_type));\\n\\n\\t\\tpre_time = current_time;\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\tnum_case++;\\n\\n\\t/*for(int i = 0; i < num_ship; i++){\\n\\t\\tif(debug_array[i] != 100){\\n\\t\\t\\tprintf(\\\"船%d debug_array:%d\\\\n\\\",i,debug_array[i]);\\n\\t\\t}\\n\\t}*/\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %lf\\\",&num_room,&num_ship,&LENGTH);\\n\\t\\tif(num_room == 0)break;\\n\\n\\t\\tfunc();\\n\\t\\tif(STOP)break;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -1.3697,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2202_1556140\",\n \"code_snippet\": \"#include<iostream>\\n\\nusing namespace std;\\n\\ndouble in[123][2234],out[123][2234];\\n\\nint main(){\\n for(int N,M,K;cin>>N>>M>>K,N|M|K;){\\n int O=M-1;\\n double canal[2234]={};\\n double rtime[2234]={},ltime[2234]={};\\n for(int i=0;i<N;i++){\\n int X,L,F,D,UD;\\n cin>>X>>L>>F>>D>>UD;\\n rtime[X+O]=UD?L*1./D:L*1./F;\\n ltime[X+O]=UD?L*1./F:L*1./D;\\n if(UD){\\n\\tcanal[X+O]=ltime[X+O];\\n }\\n }\\n int V[123];\\n for(int i=0;i<M;i++){\\n cin>>V[i];\\n }\\n for(int i=0;i<M;i++){\\n double t=0;\\n for(int j=O-i;j<2200;j++){\\n\\tin[i][j]=t;\\n\\tout[i][j]=max(t,canal[j])+rtime[j];\\n\\tcanal[j]=out[i][j]+ltime[j];\\n\\tt=max(out[i][j]+1./V[i],!i?0:in[i-1][j+2]);\\n }\\n }\\n cout<<fixed<<in[M-1][K+O]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5076,\n \"score_of_the_acc\": -0.5961,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2202_1426514\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <set>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstdio>\\n#include <cstring>\\n#include <iterator>\\n#include <bitset>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <fstream>\\n#include <iomanip>\\n//#include <utility>\\n//#include <memory>\\n//#include <functional>\\n//#include <deque>\\n//#include <cctype>\\n//#include <ctime>\\n//#include <numeric>\\n//#include <list>\\n//#include <iomanip>\\n\\n//#if __cplusplus >= 201103L\\n//#include <array>\\n//#include <tuple>\\n//#include <initializer_list>\\n//#include <forward_list>\\n//\\n//#define cauto const auto&\\n//#else\\n\\n//#endif\\n\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef vector<int> vint;\\ntypedef vector<vector<int> > vvint;\\ntypedef vector<long long> vll, vLL;\\ntypedef vector<vector<long long> > vvll, vvLL;\\n\\n#define VV(T) vector<vector< T > >\\n\\ntemplate <class T>\\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\\n v.assign(a, vector<T>(b, t));\\n}\\n\\ntemplate <class F, class T>\\nvoid convert(const F &f, T &t){\\n stringstream ss;\\n ss << f;\\n ss >> t;\\n}\\n\\n#undef _P\\n#define _P(...) (void)printf(__VA_ARGS__)\\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) reep((i),0,(n))\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB push_back\\n#define F first\\n#define S second\\n#define mkp make_pair\\n#define RALL(v) (v).rbegin(),(v).rend()\\n#define DEBUG\\n#ifdef DEBUG\\n#define dump(x) cout << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n#else\\n#define dump(x) \\n#define debug(x) \\n#endif\\n#define LDcout(x,n) fixed<<setprecision(n)<<x\\n\\n#define MOD 1000000007LL\\n#define EPS 1e-8\\nstatic const int INF=1<<24;\\nstruct kanmon{\\n\\tdouble x;\\n\\tdouble L,F,D;\\n\\tint UD;\\n\\tdouble up,down;\\n};\\nvoid mainmain(){\\n\\tint n,m,K;\\n\\n\\twhile(cin>>n>>m>>K,n||m||K){\\n\\t\\tvector<kanmon> v(n);\\n\\t\\tvint pos(K+300,-1);\\n\\t\\trep(i,n){\\n\\t\\t\\tcin>>v[i].x>>v[i].L>>v[i].F>>v[i].D>>v[i].UD;\\n\\t\\t\\tv[i].up=v[i].L/v[i].F;\\n\\t\\t\\tv[i].down=v[i].L/v[i].D;\\n\\t\\t\\tpos[v[i].x+150]=i;\\n\\t\\t}\\n\\t\\tvector<double> w(m);\\n\\t\\trep(i,m) cin>>w[i];\\n\\t\\tvector<VV(double)> dp;\\n\\t\\tinitvv(dp,m,K+300,vector<double>(2,0));\\n\\t\\trep(i,m){\\n\\t\\t\\tdp[i][-i+150][0]=dp[i][-i+150][1]=0;\\n\\t\\t}\\n\\t\\trep(i,m){\\n\\t\\t\\treep(j,-i+150+1,K+(m-1-i)+150+1){\\n\\t\\t\\t\\tif(!i){\\n\\t\\t\\t\\t\\tif(pos[j]==-1){\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j][1]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tint p=pos[j];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t\\tif(v[p].UD){\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][0]=max(dp[i][j][0],v[p].up);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tdp[i][j][1]=dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tif(pos[j]==-1){\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j][1]=max(dp[i][j-1][1]+1.0/w[i],dp[i-1][j+1][0]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tint p=pos[j];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=max(dp[i][j][0],max(dp[i-1][j+1][0],dp[i-1][j][1]+(v[p].UD?v[p].up:v[p].down)));\\n\\t\\t\\t\\t\\t\\tdp[i][j][1]=max(dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down),dp[i-1][j+1][0]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<dp[m-1][K+150][0]<<endl;\\n\\t}\\n}\\n\\n\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n \\tcout<<fixed<<setprecision(10);\\n mainmain();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8516,\n \"score_of_the_acc\": -1.0513,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2202_1426512\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <set>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstdio>\\n#include <cstring>\\n#include <iterator>\\n#include <bitset>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <fstream>\\n#include <iomanip>\\n//#include <utility>\\n//#include <memory>\\n//#include <functional>\\n//#include <deque>\\n//#include <cctype>\\n//#include <ctime>\\n//#include <numeric>\\n//#include <list>\\n//#include <iomanip>\\n\\n//#if __cplusplus >= 201103L\\n//#include <array>\\n//#include <tuple>\\n//#include <initializer_list>\\n//#include <forward_list>\\n//\\n//#define cauto const auto&\\n//#else\\n\\n//#endif\\n\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef vector<int> vint;\\ntypedef vector<vector<int> > vvint;\\ntypedef vector<long long> vll, vLL;\\ntypedef vector<vector<long long> > vvll, vvLL;\\n\\n#define VV(T) vector<vector< T > >\\n\\ntemplate <class T>\\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\\n v.assign(a, vector<T>(b, t));\\n}\\n\\ntemplate <class F, class T>\\nvoid convert(const F &f, T &t){\\n stringstream ss;\\n ss << f;\\n ss >> t;\\n}\\n\\n#undef _P\\n#define _P(...) (void)printf(__VA_ARGS__)\\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) reep((i),0,(n))\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB push_back\\n#define F first\\n#define S second\\n#define mkp make_pair\\n#define RALL(v) (v).rbegin(),(v).rend()\\n#define DEBUG\\n#ifdef DEBUG\\n#define dump(x) cout << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n#else\\n#define dump(x) \\n#define debug(x) \\n#endif\\n#define LDcout(x,n) fixed<<setprecision(n)<<x\\n\\n#define MOD 1000000007LL\\n#define EPS 1e-8\\nstatic const int INF=1<<24;\\nstruct kanmon{\\n\\tdouble x;\\n\\tdouble L,F,D;\\n\\tint UD;\\n\\tdouble up,down;\\n};\\nvoid mainmain(){\\n\\tint n,m,K;\\n\\n\\twhile(cin>>n>>m>>K,n||m||K){\\n\\t\\tvector<kanmon> v(n);\\n\\t\\tvint pos(K+300,-1);\\n\\t\\trep(i,n){\\n\\t\\t\\tcin>>v[i].x>>v[i].L>>v[i].F>>v[i].D>>v[i].UD;\\n\\t\\t\\tv[i].up=v[i].L/v[i].F;\\n\\t\\t\\tv[i].down=v[i].L/v[i].D;\\n\\t\\t\\tpos[v[i].x+150]=i;\\n\\t\\t}\\n\\t\\tvector<double> w(m);\\n\\t\\trep(i,m) cin>>w[i];\\n\\t\\tvector<VV(double)> dp;\\n\\t\\tinitvv(dp,m,K+300,vector<double>(2,0));\\n\\t\\trep(i,m){\\n\\t\\t\\tdp[i][-i+150][0]=dp[i][-i+150][1]=0;\\n\\t\\t}\\n\\t\\trep(i,m){\\n\\t\\t\\treep(j,-i+150+1,K+(m-1-i)+150+1){\\n\\t\\t\\t\\tif(!i){\\n\\t\\t\\t\\t\\tif(pos[j]==-1){\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j][1]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tint p=pos[j];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t\\tif(v[p].UD){\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][0]=max(dp[i][j][0],v[p].up);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tdp[i][j][1]=dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tif(pos[j]==-1){\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j][1]=max(dp[i][j-1][1]+1.0/w[i],dp[i-1][j+1][0]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tint p=pos[j];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=dp[i][j-1][1]+1.0/w[i];\\n\\t\\t\\t\\t\\t\\tdp[i][j][0]=max(dp[i][j][0],max(dp[i-1][j+1][0],dp[i-1][j][1]+(v[p].UD?v[p].up:v[p].down)));\\n\\t\\t\\t\\t\\t\\tdp[i][j][1]=max(dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down),dp[i-1][j+1][0]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// cout<<i<<\\\" \\\"<<j-150<<\\\" \\\"<<dp[i][j][0]<<endl;\\n\\t\\t\\t}\\n\\t\\t\\t// cout<<endl;\\n\\t\\t}\\n\\t\\tcout<<dp[m-1][K+150][0]<<endl;\\n\\t\\t// rep(i,n){\\n\\t\\t// \\tdouble t;\\n\\t\\t// \\tif(i){\\n\\t\\t// \\t\\tt=max((v[i].x-v[i-1].x)/w[0],(v[i].UD==0)?0.0:v[i].up)+dp[0][i];\\n\\t\\t// \\t}\\n\\t\\t// \\telse{\\n\\t\\t// \\t\\tt=max(v[i].x/w[0],(v[i].UD==0)?v[i].down:v[i].up);\\n\\t\\t// \\t}\\n\\t\\t// \\tdp[0][i+1]=t+(v[i].UD==0?v[i].up:v[i].down);\\n\\t\\t\\t// cout<<i<<\\\" \\\"<<dp[0][i+1]<<endl;\\n\\t\\t// }\\n\\t\\t// dp[0][n+1]=dp[0][n]+(K-v[n-1].x)/w[0];\\n\\t\\t// reep(i,1,m){\\n\\t\\t// \\trep(j,n){\\n\\t\\t// \\t\\tdouble t1;\\n\\t\\t// \\t\\tif(j){\\n\\t\\t// \\t\\t\\tt1=(v[j].x-v[j-1].x)/w[i];\\n\\t\\t// \\t\\t}\\n\\t\\t// \\t\\telse{\\n\\t\\t// \\t\\t\\tt1=v[j].x/w[i];\\n\\t\\t// \\t\\t}\\n\\t\\t// \\t\\tt1=max(t1,dp[i-1][j]);\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t}\\n}\\n\\n\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n \\tcout<<fixed<<setprecision(10);\\n mainmain();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8516,\n \"score_of_the_acc\": -1.0513,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2202_1390640\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint N,M,K;\\nint UD[200];\\nint x[200],l[200],f[200],d[200];\\ndouble X[200],L[200],F[200],D[200];\\ndouble V[200],t[200];\\n\\nint id[2000];\\nmap<int,double> s[200];\\n\\nint main(){\\n while(1){\\n\\n for(int i=0;i<200;i++)s[i].clear();\\n for(int i=0;i<2000;i++)id[i]=-1;\\n\\n cin>>N>>M>>K;\\n if(N==0&&M==0&&K==0)break;\\n \\n for(int i=0;i<N;i++){\\n cin>>x[i]>>l[i]>>f[i]>>d[i]>>UD[i];\\n X[i]=x[i],L[i]=l[i],F[i]=f[i],D[i]=d[i];\\n id[x[i]]=i;\\n } \\n\\n for(int i=0;i<M;i++)cin>>V[i];\\n \\n for(int i=0;i<N;i++){\\n t[i]=0;\\n if(UD[i]==1){\\n t[i]=L[i]/F[i];\\n swap(F[i],D[i]);\\n }\\n }\\n \\n\\n for(int j=1;j<=K+M-1;j++){\\n s[0][j]=s[0][j-1]+1.0/V[0];\\n if(id[j-1]==-1)continue;\\n int k=id[j-1];\\n\\n if(s[0][j-1]<t[k]){\\n\\ts[0][j]=t[k]+L[k]/F[k]+1.0/V[0];\\n\\tt[k]=t[k]+L[k]/F[k]+L[k]/D[k];\\n }else{\\n\\ts[0][j]=s[0][j-1]+L[k]/F[k]+1.0/V[0];\\n\\tt[k]=s[0][j-1]+L[k]/F[k]+L[k]/D[k];\\n }\\n }\\n\\n \\n for(int i=1;i<M;i++){\\n double v=1.0/V[i];\\n for(int j=-i+1;j<=-i+K+M-1;j++){\\n\\ts[i][j]=max(s[i][j-1]+v,s[i-1][j+1]);\\n\\tif(j-1<0||id[j-1]==-1)continue;\\n\\tint k=id[j-1];\\n\\tif(s[i][j-1]<t[k]){\\n\\t s[i][j]=max(s[i][j],t[k]+L[k]/F[k]+v);\\n\\t t[k]=t[k]+L[k]/F[k]+L[k]/D[k];\\n\\t}else{\\n\\t s[i][j]=max(s[i][j],s[i][j-1]+L[k]/F[k]+v);\\n\\t t[k]=s[i][j-1]+L[k]/F[k]+L[k]/D[k];\\n\\t}\\n }\\n }\\n \\n printf(\\\"%.10f\\\\n\\\",s[M-1][K]);\\n }\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 8152,\n \"score_of_the_acc\": -1.1367,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2202_1129383\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\ndouble last[1120];\\nint x[110];\\nint l[110];\\nint f[110];\\nint d[110];\\nint u[110];\\nint p[1120];\\ndouble q[110];\\nint v[110];\\nint main(){\\n\\tint a,b,c;\\n\\twhile(scanf(\\\"%d%d%d\\\",&a,&b,&c),a){\\n\\t\\tfor(int i=0;i<=c+b+2;i++)p[i]=-1;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tscanf(\\\"%d%d%d%d%d\\\",x+i,l+i,f+i,d+i,u+i);\\n\\t\\t\\tif(!u[i]){\\n\\t\\t\\t\\tswap(f[i],d[i]);\\n\\t\\t\\t}\\n\\t\\t\\tp[x[i]]=i;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a;i++)q[i]=-999999999;\\n\\t\\tfor(int i=0;i<=c+b+2;i++)last[i]=-999999999;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tif(u[i]==1)q[i]=-(double)l[i]/d[i];\\n\\t\\t}\\n\\t//\\tfor(int i=0;i<a;i++)printf(\\\"%f\\\\n\\\",q[i]);\\n\\t\\tfor(int i=0;i<b;i++)scanf(\\\"%d\\\",v+i);\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\n\\t\\t\\tdouble now=0;\\n\\t\\t\\tfor(int j=0;j<=c+b;j++){\\n\\t\\t\\t\\tif(j==0){\\n\\t\\t\\t\\t\\tnow=(double)i/v[i];\\n\\t\\t\\t\\t}else now+=1.0/v[i];\\n\\t\\t\\t\\tnow=max(now,last[j+1]);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tlast[j]=now;\\n\\t\\t\\t\\tif(~p[j]){\\n\\t\\t\\t\\t\\tint at=p[j];\\n\\t\\t\\t\\t\\tnow=max(now,q[at]+(double)l[at]/f[at]+(double)l[at]/d[at]);\\n\\t\\t\\t\\t\\tq[at]=now;\\n\\t\\t\\t\\t\\tnow+=(double)l[at]/d[at];\\n\\t\\t\\t\\t}\\n\\t\\t\\t//\\tprintf(\\\"%d %d: %f\\\\n\\\",i,j,now);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.12f\\\\n\\\",last[c]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1084,\n \"score_of_the_acc\": -0.1273,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2202_557968\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <cstdio>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <valarray>\\n#include <bitset>\\n#include <stack>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\n#define chmax(a,b) (a<b?(a=b,1):0)\\n#define chmin(a,b) (a>b?(a=b,1):0)\\n#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int INF = 1<<29;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8;\\n\\nstruct Koumon {\\n int x,l,f,d,ud;\\n Koumon() {}\\n Koumon(int x, int l, int f, int d, int ud) :\\n x(x),l(l),f(f),d(d),ud(ud) {}\\n double otime() {\\n if (ud) return double(l)/d;\\n else return double(l)/f;\\n }\\n double itime() {\\n if (ud) return double(l)/f;\\n else return double(l)/d;\\n }\\n double ini() {\\n if (ud) return double(l)/f;\\n else return 0;\\n }\\n};\\n\\ndouble dpin[101][1500];\\ndouble dpout[101][1500];\\ndouble dpava[101][1500];\\n\\nKoumon koumon[100];\\nint kid[1500];\\nint v[100];\\n\\nint main() {\\n int n, m, k;\\n while(cin>>n>>m>>k,n||m||k) {\\n memset(kid,-1,sizeof(kid));\\n REP(i,n) {\\n int x,l,f,d,ud;\\n cin>>x>>l>>f>>d>>ud;\\n x+=100;\\n koumon[i]=Koumon(x,l,f,d,ud);\\n kid[x] = i;\\n }\\n REP(i,m) cin>>v[i];\\n REP(i,m+1)REP(j,k+105) {\\n dpin[i][j]=dpout[i][j]=dpava[i][j]=-1e100;\\n }\\n REP(i,m) {\\n REP(j,k+103) {\\n if (kid[j] >= 0) {\\n dpava[i+1][j+1] = max(koumon[kid[j]].ini(), dpout[i][j+1] + koumon[kid[j]].itime());\\n }\\n dpin[i+1][j+1] = max(dpout[i+1][j]+1.0/v[i], dpin[i][j+2]);\\n if (i==100-j) dpin[i+1][j+1] = 0;\\n if (kid[j] >= 0) chmax(dpin[i+1][j+1], dpava[i+1][j+1]);\\n dpout[i+1][j+1] = dpin[i+1][j+1];\\n if (kid[j] >= 0) chmax(dpout[i+1][j+1], dpin[i+1][j+1] + koumon[kid[j]].otime());\\n // cout << i << \\\" \\\" << j << \\\" \\\" << dpin[i+1][j+1] << \\\" \\\" << dpout[i+1][j+1] << endl;\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", dpout[m][k+101]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4752,\n \"score_of_the_acc\": -0.558,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2202_81166\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cstring>\\n#include <algorithm>\\nusing namespace std;\\n\\n#define INF (1<<30)\\nint x[105], l[105], f[105], d[105], ud[105], v[105];\\n\\ndouble up(int n)\\n{\\n\\treturn 1.0*l[n]/f[n];\\n}\\n\\ndouble down(int n)\\n{\\n\\treturn 1.0*l[n]/d[n];\\n}\\n\\ndouble dp[105][1250];\\n\\nint main()\\n{\\n\\tcout << setiosflags(ios::fixed) << setprecision(10);\\n\\t\\n\\tint N,M,K;\\n\\twhile(cin >> N >> M >> K, (N||M||K))\\n\\t{\\n\\t\\tv[0]=INF;\\n\\t\\tK+=100;\\n\\n\\t\\tx[N]=INF;\\n\\t\\t\\n\\t\\tmemset(dp,0,sizeof(dp));\\n\\t\\t\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tcin >> x[i] >> l[i] >> f[i] >> d[i] >> ud[i];\\n\\t\\t\\tx[i]+=100;\\n\\t\\t}\\n\\t\\tfor(int i=1; i<=M; i++)\\n\\t\\t\\tcin >> v[i];\\t\\n\\t\\t\\n\\t\\tfor(int i=0; i<=K+100; i++)\\n\\t\\t\\tdp[0][i]=0;\\n\\t\\t\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t{\\n\\t\\t\\tif(ud[i]==0) dp[0][x[i]]=-INF;\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\tfor(int i=1; i<=M; i++)\\n\\t\\t{\\n\\t\\t\\tint g=0;\\n\\t\\t\\tfor(int j=100-i+2; j<=K+102; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdouble tmp = dp[i-1][j+1];\\n\\t\\t\\t\\tif(x[g+1]==j+1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(ud[g+1]==0) tmp-=up(g+1);\\n\\t\\t\\t\\t\\tif(ud[g+1]==1) tmp-=down(g+1);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(x[g]!=j)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdp[i][j]=max(dp[i][j-1] + 1.0/v[i], tmp);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif(ud[g]==0) \\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdp[i][j]=max(dp[i][j-1]+1.0/v[i], max(dp[i-1][j]+down(g), tmp));\\n\\t\\t\\t\\t\\t\\tdp[i][j]+=up(g);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(ud[g]==1) \\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdp[i][j]=max(dp[i][j-1]+1.0/v[i], max(dp[i-1][j]+ up(g), tmp));\\n\\t\\t\\t\\t\\t\\tdp[i][j]+=down(g);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << dp[M][K] << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1199,"cells":{"group_id":{"kind":"string","value":"aoj_2205_cpp"},"problem_description":{"kind":"string","value":"Problem B:\n宝くじチェッカー\nあなたは無事進学振り分けを終え、駒場近辺から本郷近辺へ引っ越す準備の最中であった。 家の中を整理していたところ去年購入した宝くじが大量に見つかった。 交換期限を確認したところ明日までに換金しなければならないのだが、引っ越しの準備がまだ全く終わっていないため少額の当選金のために宝くじ売り場まで行くのは面倒である。 そこであなたはいくら当選金が得られるかを調べることにした。\n宝くじは8桁の数字からなる。当選番号は同じく8桁で数字と'*'から構成され、持っている宝くじと数字部分が一致した場合、当選番号に応じた当選金が支払われる。\n例えば所持している宝くじの番号が \"12345678\" の場合、当選番号が \"*******8\" や \"****5678\" の場合は当選となるが、当選番号が \"****4678\" のときは当選とはならない。当選番号は複数あり得て、それぞれ独立に当選金が支払われる。ただし、当選番号は1枚の宝くじが2つ以上の当選番号に当たらないように選ばれる。たとえば当選番号が \"*******8\", \"****5678\" の2つであった場合、 \"12345678\" は両方に当選してしまうため、このような当選番号の選ばれ方がされることはない。\nあなたの仕事は、入力として与えられる所持している宝くじの番号と宝くじの当選番号に対して、いくらの当選金が得られるかを出力するプログラムを書くことである。\nInput\n入力は以下のような形式で与えられる。\nn\nm\nN\n1\nM\n1\n...\nN\nn\nM\nn\nB\n1\n...\nB\nm\n1行目では当選番号の数\nn\n(1 ≤\nn\n≤ 100)と所持している宝くじの枚数\nm\n(1 ≤\nm\n≤ 1000)がそれぞれ整数で与えられる。\n続く\nn\n行では、各行に当選番号\nN\ni\nと当選金\nM\ni\n(1 ≤\nM\ni\n≤ 1000000)が与えられる。当選金は整数である。当選番号の形式は問題文中で述べたとおりである。\n続く\nm\n行では所持している宝くじの番号が与えられる。\nOutput\n当選金の合計額を出力せよ。\nNotes on Test Cases\n上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。\nn が 0 のとき入力の終わりを示します。\nSample Input\n3 3\n*******1 100\n******22 1000\n11111112 1000000\n01203291\n02382022\n11111111\n10 10\n****3228 149416\n****3992 198635\n****4286 77783\n****4843 225244\n***49835 231046\n***59393 379996\n*5763748 437345\n*6726222 58054\n*8117882 16375\n*9244339 537727\n77885716\n96726222\n26971031\n66652868\n89599648\n37772338\n64679621\n65479161\n92959393\n57855682\n0 0\nOutput for Sample Input\n1200\n438050"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2205_8809123","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int n, m;\n \n while (true) {\n cin >> n >> m;\n \n if (n == 0 && m == 0)\n break;\n \n int ans = 0;\n vector<int> o(n);\n vector<string> b(n);\n\n for (int i = 0; i < n; i++)\n cin >> b[i] >> o[i];\n \n for (int i = 0; i < m; i++) {\n string l;\n cin >> l;\n bool match = false;\n \n for (int j = 0; j < n; j++) {\n bool f = true;\n \n for (int k = 0; k < 8; k++) {\n if (b[j].substr(k, 1) != \"*\" && b[j].substr(k, 1) != l.substr(k, 1)) {\n f = false;\n break;\n }\n }\n \n if (f) {\n match = true;\n ans += o[j];\n break;\n }\n }\n \n if (!match)\n ans += 0;\n }\n \n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":130,"memory_kb":3176,"score_of_the_acc":-0.5688,"final_rank":16},{"submission_id":"aoj_2205_8809119","code_snippet":"#include <iostream>\nusing namespace std;\nint main() {\n int n, m;\n cin >> n >> m;\n while (n || m) {\n int* o = new int[n];\n string* b = new string[n];\n for (int i = 0; i < n; i++)\n cin >> b[i] >> o[i];\n int ans = 0;\n for (int i = 0; i < m; i++) {\n string l;\n cin >> l;\n for (int j = 0; j < n; j++) {\n bool f = true;\n for (int k = 0; k < 8; k++) {\n if (b[j][k] != '*' && b[j][k] != l[k]) {\n f = false;\n break;\n }\n }\n if (f) {\n ans += o[j];\n break;\n }\n }\n }\n cout << ans << endl;\n delete[] o;\n delete[] b;\n cin >> n >> m;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3096,"score_of_the_acc":-0.236,"final_rank":4},{"submission_id":"aoj_2205_5867789","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <regex>\n\nusing namespace std;\n\nint main()\n{\n int n, m;\n int prize;\n \n vector<pair<int, string> > winning;\n vector<string> lottery;\n vector<bool> is_winning;\n\n const regex r(\"[^*]+\");\n smatch number, result;\n \n while(1) {\n cin >> n >> m;\n if (n == 0) break;\n \n winning.clear();\n lottery.clear();\n is_winning.clear();\n prize = 0;\n \n while(n--) {\n pair<int, string> tmp;\n cin >> tmp.second >> tmp.first;\n winning.push_back(tmp);\n }\n\n while(m--) {\n string s;\n cin >> s;\n lottery.push_back(s);\n is_winning.push_back(false);\n }\n\n sort(winning.begin(), winning.end(), greater<pair<int, string>>());\n\n for (size_t i = 0; i < winning.size(); i++) {\n regex_search(winning[i].second, number, r);\n string s = number.str() + \"$\";\n for (size_t j = 0; j < lottery.size(); j++) {\n if (regex_search(lottery[j], result, regex(s)) && is_winning[j] == false) {\n prize += winning[i].first;\n is_winning[j] = true;\n }\n }\n }\n cout << prize << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":3368,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2205_5825814","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 while(1)\n {\n int n,m;\n cin>>n>>m;\n if(n==0) break;\n string s[n];\n int money[n];\n rep(i,n){\n cin>>s[i]>>money[i];\n }\n int ans=0;\n rep(i,m){\n string t;\n cin>>t;\n rep(j,n){\n int flag=1;\n rep(l,8){\n if(s[j][l]!='*'&&s[j][l]!=t[l]){\n flag=0;\n }\n }\n if(flag==1) {\n ans+=money[j];\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3012,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2205_4244231","code_snippet":"#include<iostream>\n#include<vector>\n#include <cmath>\n#include <map>\n#include <algorithm>\n#include <string>\n#include<sstream>\nusing namespace std;\nint main(void){\n \n long long int n , m;\n while(1){\n cin >> n >> m;\n if(n ==0 &&m ==0){\n break ;\n }\n string a[n] ;//当選番号\n int g[n] ;//賞金\n for(int i = 0 ; i < n ; i++){\n cin >> a[i] >> g[i] ;\n }\n\n int b[m] ;//宝くじの番号\n\n for(int j = 0 ; j < m ; j++){\n cin >> b[j] ;\n\n }\n int countc = 0;//*の数\n int tempg = 0;\n char hh;\n string temp ;//当選番号（一時保存）\n int atemp ;//当選番号（int）\n long long int sum = 0;//賞金合計\n\n\n for(int i = 0; i < n ; i++){\n temp = a[i];\n for(int k = 0 ; k < 8 ; k++){\n if(temp[k] == '*'){\n countc++ ;\n \n }\n }//〇\n if(countc ==7){\n hh = temp[7] ;\n atemp = ((int)hh) -48;\n }else{\n for(int o = 0 ; o < 8 - countc ; o++){\n hh = temp[7 - o] ;\n \n atemp += (int)(((int)hh-48) * (int)pow(10.0 , (double)o)) ;\n \n }\n //cout <<\"atemp\" << atemp << endl;\n }\n for(int j = 0; j < m ; j++){\n \n if(b[j] % ((long long int )pow( 10.0, 8-countc)) == atemp ){\n sum += g[i] ;\n \n } \n //cout <<\"TAKARA\"<< b[j] % ((long long int )pow( 10.0, 8-countc)) << endl;\n }\n\n atemp = 0 ;\n countc = 0;\n \n }\n\n cout << sum << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.7753,"final_rank":19},{"submission_id":"aoj_2205_4243874","code_snippet":"#include<algorithm>\n#include<bitset>\n#include<cassert>\n#include<cfloat>\n#include<climits>\n#include<cmath>\n#include<deque>\n#include<functional>\n#include<iomanip>\n#include<iostream>\n#include<map>\n#include<queue>\n#include<set>\n#include<stack>\n#include<string>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<vector>\n\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\n\nusing namespace std;\n\ntypedef long long int ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\n\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n\treturn vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value == 0>::type\nfill_v(T& t, const V& v) { t = v; }\ntemplate<typename T, typename V>\ntypename enable_if<is_class<T>::value != 0>::type\nfill_v(T& t, const V& v) {\n\tfor (auto& e : t) fill_v(e, v);\n}\n\n\n// aよりもbが大きいならばaをbで更新する\n// (更新されたならばtrueを返す)\ntemplate <typename T>\nbool chmax(T & a, const T & b) {\n\tif (a < b) {\n\t\ta = b; // aをbで更新\n\t\treturn true;\n\t}\n\treturn false;\n}\n// aよりもbが小さいならばaをbで更新する\n// (更新されたならばtrueを返す)\ntemplate <typename T>\nbool chmin(T & a, const T & b) {\n\tif (a > b) {\n\t\ta = b; // aをbで更新\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n#define ARRAY_MAX 100005\nconst int INF = 1e9 + 7;\nconst ll MOD = 1e9 + 7;\n\nint dx[4] = { 1,0,0,-1 };\nint dy[4] = { 0,1,-1,0 };\n\n\n/******************************************************************************************/\n\n\n\nint main() {\n\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout << fixed << setprecision(10);\n\n\tll n,m;\n\n\twhile(cin >> n >> m,n){\n\n\n\t\tll ans = 0;\n\t\tvector<string> N(n);\n\t\tvector<int> M(n);\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcin >> N[i] >> M[i];\n\t\t\treverse(N[i].begin(),N[i].end());\n\t\t}\n\t\t\n\t\tvector<string> kuji(m);\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tcin >> kuji[i];\n\t\t\treverse(kuji[i].begin(),kuji[i].end());\n\t\t}\n\t\t//kuji\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\t//prize\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t{\n\t\t\t\t//cout << \"i= \" << i << endl;\n\t\t\t\tbool flag = true;\n\t\t\t\tfor (int k = 0; k < 8; k++)\n\t\t\t\t{\n\t\t\t\t\tif(N[j][k] == '*'){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\n\t\t\t\t\tflag &= (kuji[i][k] == N[j][k]);\n\t\t\t\t}\n\t\t\t\tif(flag){\n\t\t\t\t\tans += M[j];\n\t\t\t\t}\n\n\t\t\t}\n\t\n\t\t}\n\t\n\t\tcout << ans << endl;\n\t}\n\t\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.2472,"final_rank":5},{"submission_id":"aoj_2205_4243848","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, s, n) for (int i = s; i < n; ++i)\n#define rep(i, n) REP(i, 0, n)\n#define SORT(c) sort((c).begin(), (c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n#define DEBUG false\n// sort(a.begin(), a.end(), std::greater<int>());\n\n/*\nstd::vector<std::string> split(const std::string &input, char delimiter)\n{\n std::istringstream stream(input);\n\n std::string field;\n std::vector<std::string> result;\n while (std::getline(stream, field, delimiter))\n {\n result.push_back(field);\n }\n return result;\n}\n*/\n/*\nint dfs(int foo, int timer)\n{\n //foo is node number\n if (finds[foo].first != -1)\n return timer;\n finds[foo].first = ++timer;\n int result = timer;\n if (data[foo].size() != 0)\n {\n rep(i, data[foo].size())\n {\n result = dfs(data[foo][i], result);\n }\n }\n finds[foo].second = ++result;\n return result;\n}\n*/\n\nint main()\n{\n int n, m;\n while (true)\n {\n cin >> n >> m;\n if (n == 0 || m == 0)\n break;\n vector<string> a;\n vector<int> b;\n rep(i, n)\n {\n string c;\n int d;\n cin >> c >> d;\n a.push_back(c);\n b.push_back(d);\n }\n int ans = 0;\n rep(i, m)\n {\n string num;\n cin >> num;\n rep(j, a.size())\n {\n string foo = a[j];\n rep(k, foo.size())\n {\n if (foo[k] == '*')\n {\n foo[k] = num[k];\n }\n }\n if (foo == num)\n ans += b[j];\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3148,"score_of_the_acc":-0.4181,"final_rank":10},{"submission_id":"aoj_2205_4243835","code_snippet":"/*\nDear ToM,\nCongratulations on your graduation!\nYou did a great job!\n ☆ﾟ*＠*ﾟ☆\n (＠*｡☆｡*＠\n /☆｡*＠ﾟ*☆\n▲/／｡＠｡*☆＠*\n ▼―ｰ｡*＠ﾟ*☆\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,s,n) for(int i=s; i<n; ++i)\n#define rep(i,n) REP(i,0,n)\n#define SORT(c) sort((c).begin(),(c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n#define DEBUG false\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\n\nint main(){\n\tll n, m;\n\twhile(cin >> n >> m, n, m){\n\t\tll ans = 0;\n\t\tmap<string, ll> mp;\n\t\trep(i, n){\n\t\t\tstring s;\n\t\t\tll num;\n\t\t\tcin >> s >> num;\n\t\t\tmp[s] = num;\n\t\t}\n\t\trep(i, m){\n\t\t\tstring my;\n\t\t\tcin >> my;\n\t\t\tfor(auto it:mp){\n\t\t\t\tbool flag = true;\n\t\t\t\trep(j, (int)my.size()){\n\t\t\t\t\tif(it.first[j] == '*') continue;\n\t\t\t\t\tif(my[j] != it.first[j]){\n\t\t\t\t\t\tflag = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(flag) ans += (it.second);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3068,"score_of_the_acc":-0.1573,"final_rank":3},{"submission_id":"aoj_2205_4243834","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool ok(string &a, string &b){\n bool res = true;\n for(int i=7;i>=0;i--){\n res &= (a[i] == '*' || a[i] == b[i]);\n }\n return res;\n}\n\nbool solve(){\n int n, m;\n cin >> n >> m;\n if(n == 0) return true;\n vector<string> s(n), t(m);\n vector<int> c(n);\n for(int i=0;i<n;i++){\n cin >> s[i] >> c[i];\n }\n for(int i=0;i<m;i++){\n cin >> t[i];\n }\n int ans = 0;\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n if(ok(s[j],t[i])){\n ans += c[j];\n break;\n }\n }\n }\n cout << ans << endl;\n return false;\n}\n\nint main(){\n while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3220,"score_of_the_acc":-0.5843,"final_rank":17},{"submission_id":"aoj_2205_4243832","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n > 0){\n vector<pair<string, int>> v;\n for(int i=0;i<n;++i){\n string s;\n int money;\n cin >> s >> money;\n v.emplace_back(s, money);\n }\n int ans = 0;\n for(int i=0;i<m;++i){\n string b;\n cin >> b;\n for(auto e: v){\n bool flag = true;\n for(int j=0;j<8;++j){\n if(e.first[j] != '*' && e.first[j] != b[j]){\n flag = false;\n break;\n }\n }\n if(flag){\n ans += e.second;\n break;\n }\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3176,"score_of_the_acc":-0.4787,"final_rank":13},{"submission_id":"aoj_2205_3778416","code_snippet":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n int n,m,sum,c[110],d[110];\n string s[110],b;\n\n while(cin >> n >> m,n!=0&&m!=0){\n for(int i=0;i<n;i++){\n cin >> s[i] >> c[i];\n d[i] = 0;\n if(s[i].rfind(\"*\") != string::npos) d[i] = s[i].rfind(\"*\")+1;\n }\n \n sum = 0;\n for(int i=0;i<m;i++){\n cin >> b;\n for(int j=0;j<n;j++){\n if(b.substr(d[j],8-d[j]) == s[j].substr(d[j],8-d[j])) sum += c[j];\n }\n }\n cout << sum << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3152,"score_of_the_acc":-0.4293,"final_rank":11},{"submission_id":"aoj_2205_3647070","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\nusing namespace std;\n\nint main(){\n int m,n;\n while(cin >> n >> m,n){\n vector<string> cv;\n vector<string> nv;\n vector<int> iv;\n for(int i=0; i<n; ++i){\n string tmp;\n int num;\n cin >> tmp >> num;\n cv.push_back(tmp);\n iv.push_back(num);\n } \n for(int i=0; i<m; ++i){\n string tmp;\n cin >> tmp;\n nv.push_back(tmp);\n }\n int ans = 0;\n for(int i=0; i<n; ++i){\n for(int j=0; j<m; ++j){\n bool frg = true;\n for(int k=0; k<8; ++k){\n if(cv[i][k]!='*' && cv[i][k]!=nv[j][k]){frg = false;}\n }\n if(frg){ans+=iv[i];}\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3108,"score_of_the_acc":-0.2697,"final_rank":6},{"submission_id":"aoj_2205_3647001","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n while(1){\n int n,m;\n cin>>n>>m;\n if(n == 0){\n break;\n }\n\n vector<string> number;\n vector<int> money;\n for(int i = 0;i < n;++i){\n string a;\n int b;\n cin>>a>>b;\n\n number.push_back(a);\n money.push_back(b);\n }\n\n vector<string> ticket;\n for(int i = 0;i < m;++i){\n string a;\n cin>>a;\n\n ticket.push_back(a);\n }\n\n int sum = 0;\n for(int i = 0;i < number.size();++i){\n int e = 0;\n string c = number.at(i);\n\n for(int j = 0;j < c.size();++j){\n char d = c.at(j);\n if(d == '*'){\n ++e;\n }\n }\n c.erase(c.begin(), c.begin() + e);\n\n for(int j = 0;j < ticket.size();++j){\n string f = ticket.at(j);\n f.erase(f.begin(), f.begin() + e);\n\n if(f == c){\n sum += money.at(i);\n }\n }\n }\n\n cout<<sum<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3176,"score_of_the_acc":-0.4877,"final_rank":14},{"submission_id":"aoj_2205_3646975","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nint main(){\n int n,m;\n string tnum[100];\n int tv[100];\n string num;\n \n while(cin>>n>>m){\n int sum=0;\n if(n==0 && m==0)\n break;\n \n for(int i=0;i<n;i++){\n cin>>tnum[i]>>tv[i];\n }\n\n for(int i=0;i<m;i++){\n cin>>num;\n for(int j=0;j<n;j++){\n bool hit=true;\n for(int k=0;k<8;k++){\n if(tnum[j][k]=='*')\n continue;\n if(num[k]!=tnum[j][k])\n hit=false;\n }\n if(hit==true)\n sum+=tv[j];\n }\n }\n\n cout<<sum<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3152,"score_of_the_acc":-0.3933,"final_rank":8},{"submission_id":"aoj_2205_3646923","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\nusing namespace std;\n\nint main() {\n int n, m;\n vector<string> N, B;\n vector<int> M;\n\n while(cin >> n, n) {\n cin >> m;\n\n for(int i = 0; i < n; i++) {\n string str;\n int money;\n cin >> str >> money;\n N.push_back(str);\n M.push_back(money);\n }\n\n for(int i = 0; i < m; i++) {\n string str;\n cin >> str;\n B.push_back(str);\n }\n\n int ans = 0;\n for(int i = 0; i < m; i++) {\n for(int j = 0; j < n; j++) {\n int chance = 1;\n for(int k = 0; k < 8; k++) {\n if(N[j][k] != '*') {\n if(N[j][k] != B[i][k]) {\n chance = 0;\n break;\n }\n }\n }\n if(chance == 1)\n ans += M[j];\n }\n }\n cout << ans << endl;\n M.clear();\n N.clear();\n B.clear();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3168,"score_of_the_acc":-0.4382,"final_rank":12},{"submission_id":"aoj_2205_3646907","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main(){\n\n int n,m;\n\n while(1){\n\n\tcin >> n >> m;\n\n\tif(n == 0 && m == 0)\n\t break;\n\n\tvector<string> N(n);\n\tvector<int> M(n);\n\tvector<string> B(m);\n\n\tfor(int i=0;i<n;++i)\n\t cin >> N[i] >> M[i];\n\n\tfor(int i=0;i<m;++i)\n\t cin >> B[i];\n\n\tint sum = 0;\n\t\n\tfor(int i=0;i<n;++i){\n\t for(int j=0;j<m;++j){\n\t\tfor(int k=7;k>=0;--k){\n\t\t if(N[i][k] == '*' || (k == 0 && N[i][k] == B[j][k])){\n\t\t\tsum += M[i];\n\t\t\tbreak;\n\t\t }\n\t\t \n\t\t if(N[i][k] != B[j][k])\n\t\t\tbreak;\n\t\t \n\t\t}\n\t }\n\t}\n\tcout << sum << endl;\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.6067,"final_rank":18},{"submission_id":"aoj_2205_3646818","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\nint main(){\n int n,m;\n while(cin >> n >> m,n){\n vector<string> s(n);\n vector<int> num(n);\n for(int i = 0; i < n; i++)cin >> s[i] >> num[i];\n int ans = 0;\n while(m--){\n string t;\n cin >> t;\n for(int i = 0; i < n; i++){\n bool c = true;\n for(int j = 0; j < 8; j++){\n if(s[i][j] != '*' && t[j] != s[i][j])c = false;\n }\n if(c)ans += num[i];\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3128,"score_of_the_acc":-0.3258,"final_rank":7},{"submission_id":"aoj_2205_3441433","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 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 Cout(x) cout << (x) << endl\n#define Cout2(x, y) cout << (x) << \" \" << (y) << endl\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\ntypedef long long LL;\ntypedef vector<int> VI;\ntypedef vector<LL> VL;\ntypedef vector<string> VS;\ntypedef vector<bool> VB;\ntypedef vector<vector<int>> VVI;\ntypedef pair<int, int> PII;\nconst int inf = 1e9;\nconst double pi = acos(-1.0);\n\nbool Check(string a, string b) {\n\tbool ret = true;\n\tfor (int i = 7; i >= 0 && a[i] != '*'; i--) {\n\t\tif (a[i] != b[i])ret = false;\n\t}\n\treturn ret;\n}\n\nint main() {\n\tint n, m;\n\twhile (cin >> n >> m && (n || m)) {\n\t\tVS n2(n), b(m); VI m2(n);\n\t\trep(i, n)cin >> n2[i] >> m2[i];\n\t\trep(i, m)cin >> b[i];\n\n\t\tint ans = 0;\n\t\trep(i, n) {\n\t\t\trep(j, m)ans += Check(n2[i], b[j])*m2[i];\n\t\t}\n\t\tCout(ans);\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":3172,"score_of_the_acc":-0.4945,"final_rank":15},{"submission_id":"aoj_2205_3420204","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\nusing namespace std;\nbool f(string a, string b) {\n\tfor (int i = 0; i < 8; i++)if (a[i] != '*'&&a[i] != b[i])return 0; return 1;\n}\nstring p[123]; int q[123];\nsigned main() {\n\twhile (1) {\n\t\tint n, m, sum = 0;\n\t\tcin >> n >> m;\n\t\tif (!n)return 0;\n\t\tfor (int i = 0; i < n; i++)cin >> p[i] >> q[i];\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tstring k; cin >> k;\n\t\t\tfor (int j = 0; j < n; j++)if (f(p[j], k))sum += q[j];\n\t\t}\n\t\tcout << sum << endl;\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":3136,"score_of_the_acc":-0.3934,"final_rank":9},{"submission_id":"aoj_2205_3408213","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n,m;\nstring N[101];\nint M[101];\nstring B[1001];\n\nint main(){\n\twhile(cin >> n >> m, n != 0 && m != 0){\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tcin >> N[i] >> M[i];\n\t\t}\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tcin >> B[i];\n\t\t}\n\t\t\n\t\tint score = 0;\n\t\tfor(int i = 0; i < m; i++){ // B\n\t\t\tfor(int j = 0; j < n; j++){ // N,M\n\t\t\t\tbool f = true;\n\t\t\t\tfor(int k = 0; k < 8; k++){\n\t\t\t\t\tif(N[j][k] != B[i][k] && N[j][k] != '*'){\n\t\t\t\t\t\tf = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(f){\n\t\t\t\t\tscore += M[j];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << score << endl;\n\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3052,"score_of_the_acc":-0.1124,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2205_8809123\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n int n, m;\\n \\n while (true) {\\n cin >> n >> m;\\n \\n if (n == 0 && m == 0)\\n break;\\n \\n int ans = 0;\\n vector<int> o(n);\\n vector<string> b(n);\\n\\n for (int i = 0; i < n; i++)\\n cin >> b[i] >> o[i];\\n \\n for (int i = 0; i < m; i++) {\\n string l;\\n cin >> l;\\n bool match = false;\\n \\n for (int j = 0; j < n; j++) {\\n bool f = true;\\n \\n for (int k = 0; k < 8; k++) {\\n if (b[j].substr(k, 1) != \\\"*\\\" && b[j].substr(k, 1) != l.substr(k, 1)) {\\n f = false;\\n break;\\n }\\n }\\n \\n if (f) {\\n match = true;\\n ans += o[j];\\n break;\\n }\\n }\\n \\n if (!match)\\n ans += 0;\\n }\\n \\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.5688,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2205_8809119\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n while (n || m) {\\n int* o = new int[n];\\n string* b = new string[n];\\n for (int i = 0; i < n; i++)\\n cin >> b[i] >> o[i];\\n int ans = 0;\\n for (int i = 0; i < m; i++) {\\n string l;\\n cin >> l;\\n for (int j = 0; j < n; j++) {\\n bool f = true;\\n for (int k = 0; k < 8; k++) {\\n if (b[j][k] != '*' && b[j][k] != l[k]) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n ans += o[j];\\n break;\\n }\\n }\\n }\\n cout << ans << endl;\\n delete[] o;\\n delete[] b;\\n cin >> n >> m;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.236,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2205_5867789\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <regex>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int n, m;\\n int prize;\\n \\n vector<pair<int, string> > winning;\\n vector<string> lottery;\\n vector<bool> is_winning;\\n\\n const regex r(\\\"[^*]+\\\");\\n smatch number, result;\\n \\n while(1) {\\n cin >> n >> m;\\n if (n == 0) break;\\n \\n winning.clear();\\n lottery.clear();\\n is_winning.clear();\\n prize = 0;\\n \\n while(n--) {\\n pair<int, string> tmp;\\n cin >> tmp.second >> tmp.first;\\n winning.push_back(tmp);\\n }\\n\\n while(m--) {\\n string s;\\n cin >> s;\\n lottery.push_back(s);\\n is_winning.push_back(false);\\n }\\n\\n sort(winning.begin(), winning.end(), greater<pair<int, string>>());\\n\\n for (size_t i = 0; i < winning.size(); i++) {\\n regex_search(winning[i].second, number, r);\\n string s = number.str() + \\\"$\\\";\\n for (size_t j = 0; j < lottery.size(); j++) {\\n if (regex_search(lottery[j], result, regex(s)) && is_winning[j] == false) {\\n prize += winning[i].first;\\n is_winning[j] = true;\\n }\\n }\\n }\\n cout << prize << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2205_5825814\",\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 while(1)\\n {\\n int n,m;\\n cin>>n>>m;\\n if(n==0) break;\\n string s[n];\\n int money[n];\\n rep(i,n){\\n cin>>s[i]>>money[i];\\n }\\n int ans=0;\\n rep(i,m){\\n string t;\\n cin>>t;\\n rep(j,n){\\n int flag=1;\\n rep(l,8){\\n if(s[j][l]!='*'&&s[j][l]!=t[l]){\\n flag=0;\\n }\\n }\\n if(flag==1) {\\n ans+=money[j];\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3012,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2205_4244231\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include <cmath>\\n#include <map>\\n#include <algorithm>\\n#include <string>\\n#include<sstream>\\nusing namespace std;\\nint main(void){\\n \\n long long int n , m;\\n while(1){\\n cin >> n >> m;\\n if(n ==0 &&m ==0){\\n break ;\\n }\\n string a[n] ;//当選番号\\n int g[n] ;//賞金\\n for(int i = 0 ; i < n ; i++){\\n cin >> a[i] >> g[i] ;\\n }\\n\\n int b[m] ;//宝くじの番号\\n\\n for(int j = 0 ; j < m ; j++){\\n cin >> b[j] ;\\n\\n }\\n int countc = 0;//*の数\\n int tempg = 0;\\n char hh;\\n string temp ;//当選番号（一時保存）\\n int atemp ;//当選番号（int）\\n long long int sum = 0;//賞金合計\\n\\n\\n for(int i = 0; i < n ; i++){\\n temp = a[i];\\n for(int k = 0 ; k < 8 ; k++){\\n if(temp[k] == '*'){\\n countc++ ;\\n \\n }\\n }//〇\\n if(countc ==7){\\n hh = temp[7] ;\\n atemp = ((int)hh) -48;\\n }else{\\n for(int o = 0 ; o < 8 - countc ; o++){\\n hh = temp[7 - o] ;\\n \\n atemp += (int)(((int)hh-48) * (int)pow(10.0 , (double)o)) ;\\n \\n }\\n //cout <<\\\"atemp\\\" << atemp << endl;\\n }\\n for(int j = 0; j < m ; j++){\\n \\n if(b[j] % ((long long int )pow( 10.0, 8-countc)) == atemp ){\\n sum += g[i] ;\\n \\n } \\n //cout <<\\\"TAKARA\\\"<< b[j] % ((long long int )pow( 10.0, 8-countc)) << endl;\\n }\\n\\n atemp = 0 ;\\n countc = 0;\\n \\n }\\n\\n cout << sum << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.7753,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2205_4243874\",\n \"code_snippet\": \"#include<algorithm>\\n#include<bitset>\\n#include<cassert>\\n#include<cfloat>\\n#include<climits>\\n#include<cmath>\\n#include<deque>\\n#include<functional>\\n#include<iomanip>\\n#include<iostream>\\n#include<map>\\n#include<queue>\\n#include<set>\\n#include<stack>\\n#include<string>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<vector>\\n\\n#define REP(i, n) for(int i = 0;i < n;i++)\\n#define REPR(i, n) for(int i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(int i = m;i < n;i++)\\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\\n#define SORT(v, n) sort(v, v+n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define llong long long\\n#define pb(a) push_back(a)\\n\\nusing namespace std;\\n\\ntypedef long long int ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\n\\ntemplate<typename T>\\nvector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T, typename... Ts>\\nauto make_v(size_t a, Ts... ts) {\\n\\treturn vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\\n}\\ntemplate<typename T, typename V>\\ntypename enable_if<is_class<T>::value == 0>::type\\nfill_v(T& t, const V& v) { t = v; }\\ntemplate<typename T, typename V>\\ntypename enable_if<is_class<T>::value != 0>::type\\nfill_v(T& t, const V& v) {\\n\\tfor (auto& e : t) fill_v(e, v);\\n}\\n\\n\\n// aよりもbが大きいならばaをbで更新する\\n// (更新されたならばtrueを返す)\\ntemplate <typename T>\\nbool chmax(T & a, const T & b) {\\n\\tif (a < b) {\\n\\t\\ta = b; // aをbで更新\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n// aよりもbが小さいならばaをbで更新する\\n// (更新されたならばtrueを返す)\\ntemplate <typename T>\\nbool chmin(T & a, const T & b) {\\n\\tif (a > b) {\\n\\t\\ta = b; // aをbで更新\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\n\\n#define ARRAY_MAX 100005\\nconst int INF = 1e9 + 7;\\nconst ll MOD = 1e9 + 7;\\n\\nint dx[4] = { 1,0,0,-1 };\\nint dy[4] = { 0,1,-1,0 };\\n\\n\\n/******************************************************************************************/\\n\\n\\n\\nint main() {\\n\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(10);\\n\\n\\tll n,m;\\n\\n\\twhile(cin >> n >> m,n){\\n\\n\\n\\t\\tll ans = 0;\\n\\t\\tvector<string> N(n);\\n\\t\\tvector<int> M(n);\\n\\n\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t{\\n\\t\\t\\tcin >> N[i] >> M[i];\\n\\t\\t\\treverse(N[i].begin(),N[i].end());\\n\\t\\t}\\n\\t\\t\\n\\t\\tvector<string> kuji(m);\\n\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t{\\n\\t\\t\\tcin >> kuji[i];\\n\\t\\t\\treverse(kuji[i].begin(),kuji[i].end());\\n\\t\\t}\\n\\t\\t//kuji\\n\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t{\\n\\t\\t\\t//prize\\n\\t\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//cout << \\\"i= \\\" << i << endl;\\n\\t\\t\\t\\tbool flag = true;\\n\\t\\t\\t\\tfor (int k = 0; k < 8; k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(N[j][k] == '*'){\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\t\\tflag &= (kuji[i][k] == N[j][k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(flag){\\n\\t\\t\\t\\t\\tans += M[j];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\n\\t\\t}\\n\\t\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\t\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.2472,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2205_4243848\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i, s, n) for (int i = s; i < n; ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define SORT(c) sort((c).begin(), (c).end())\\n#define IINF INT_MAX\\n#define LLINF LLONG_MAX\\n#define DEBUG false\\n// sort(a.begin(), a.end(), std::greater<int>());\\n\\n/*\\nstd::vector<std::string> split(const std::string &input, char delimiter)\\n{\\n std::istringstream stream(input);\\n\\n std::string field;\\n std::vector<std::string> result;\\n while (std::getline(stream, field, delimiter))\\n {\\n result.push_back(field);\\n }\\n return result;\\n}\\n*/\\n/*\\nint dfs(int foo, int timer)\\n{\\n //foo is node number\\n if (finds[foo].first != -1)\\n return timer;\\n finds[foo].first = ++timer;\\n int result = timer;\\n if (data[foo].size() != 0)\\n {\\n rep(i, data[foo].size())\\n {\\n result = dfs(data[foo][i], result);\\n }\\n }\\n finds[foo].second = ++result;\\n return result;\\n}\\n*/\\n\\nint main()\\n{\\n int n, m;\\n while (true)\\n {\\n cin >> n >> m;\\n if (n == 0 || m == 0)\\n break;\\n vector<string> a;\\n vector<int> b;\\n rep(i, n)\\n {\\n string c;\\n int d;\\n cin >> c >> d;\\n a.push_back(c);\\n b.push_back(d);\\n }\\n int ans = 0;\\n rep(i, m)\\n {\\n string num;\\n cin >> num;\\n rep(j, a.size())\\n {\\n string foo = a[j];\\n rep(k, foo.size())\\n {\\n if (foo[k] == '*')\\n {\\n foo[k] = num[k];\\n }\\n }\\n if (foo == num)\\n ans += b[j];\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.4181,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2205_4243835\",\n \"code_snippet\": \"/*\\nDear ToM,\\nCongratulations on your graduation!\\nYou did a great job!\\n ☆ﾟ*＠*ﾟ☆\\n (＠*｡☆｡*＠\\n /☆｡*＠ﾟ*☆\\n▲/／｡＠｡*☆＠*\\n ▼―ｰ｡*＠ﾟ*☆\\n*/\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,s,n) for(int i=s; i<n; ++i)\\n#define rep(i,n) REP(i,0,n)\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define IINF INT_MAX\\n#define LLINF LLONG_MAX\\n#define DEBUG false\\n\\ntypedef long long ll;\\ntypedef pair<int, int> ii;\\n\\nint main(){\\n\\tll n, m;\\n\\twhile(cin >> n >> m, n, m){\\n\\t\\tll ans = 0;\\n\\t\\tmap<string, ll> mp;\\n\\t\\trep(i, n){\\n\\t\\t\\tstring s;\\n\\t\\t\\tll num;\\n\\t\\t\\tcin >> s >> num;\\n\\t\\t\\tmp[s] = num;\\n\\t\\t}\\n\\t\\trep(i, m){\\n\\t\\t\\tstring my;\\n\\t\\t\\tcin >> my;\\n\\t\\t\\tfor(auto it:mp){\\n\\t\\t\\t\\tbool flag = true;\\n\\t\\t\\t\\trep(j, (int)my.size()){\\n\\t\\t\\t\\t\\tif(it.first[j] == '*') continue;\\n\\t\\t\\t\\t\\tif(my[j] != it.first[j]){\\n\\t\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(flag) ans += (it.second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -0.1573,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2205_4243834\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool ok(string &a, string &b){\\n bool res = true;\\n for(int i=7;i>=0;i--){\\n res &= (a[i] == '*' || a[i] == b[i]);\\n }\\n return res;\\n}\\n\\nbool solve(){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0) return true;\\n vector<string> s(n), t(m);\\n vector<int> c(n);\\n for(int i=0;i<n;i++){\\n cin >> s[i] >> c[i];\\n }\\n for(int i=0;i<m;i++){\\n cin >> t[i];\\n }\\n int ans = 0;\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n if(ok(s[j],t[i])){\\n ans += c[j];\\n break;\\n }\\n }\\n }\\n cout << ans << endl;\\n return false;\\n}\\n\\nint main(){\\n while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.5843,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2205_4243832\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nint main(){\\n int n, m;\\n while(cin >> n >> m, n > 0){\\n vector<pair<string, int>> v;\\n for(int i=0;i<n;++i){\\n string s;\\n int money;\\n cin >> s >> money;\\n v.emplace_back(s, money);\\n }\\n int ans = 0;\\n for(int i=0;i<m;++i){\\n string b;\\n cin >> b;\\n for(auto e: v){\\n bool flag = true;\\n for(int j=0;j<8;++j){\\n if(e.first[j] != '*' && e.first[j] != b[j]){\\n flag = false;\\n break;\\n }\\n }\\n if(flag){\\n ans += e.second;\\n break;\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.4787,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2205_3778416\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int n,m,sum,c[110],d[110];\\n string s[110],b;\\n\\n while(cin >> n >> m,n!=0&&m!=0){\\n for(int i=0;i<n;i++){\\n cin >> s[i] >> c[i];\\n d[i] = 0;\\n if(s[i].rfind(\\\"*\\\") != string::npos) d[i] = s[i].rfind(\\\"*\\\")+1;\\n }\\n \\n sum = 0;\\n for(int i=0;i<m;i++){\\n cin >> b;\\n for(int j=0;j<n;j++){\\n if(b.substr(d[j],8-d[j]) == s[j].substr(d[j],8-d[j])) sum += c[j];\\n }\\n }\\n cout << sum << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.4293,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2205_3647070\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\nusing namespace std;\\n\\nint main(){\\n int m,n;\\n while(cin >> n >> m,n){\\n vector<string> cv;\\n vector<string> nv;\\n vector<int> iv;\\n for(int i=0; i<n; ++i){\\n string tmp;\\n int num;\\n cin >> tmp >> num;\\n cv.push_back(tmp);\\n iv.push_back(num);\\n } \\n for(int i=0; i<m; ++i){\\n string tmp;\\n cin >> tmp;\\n nv.push_back(tmp);\\n }\\n int ans = 0;\\n for(int i=0; i<n; ++i){\\n for(int j=0; j<m; ++j){\\n bool frg = true;\\n for(int k=0; k<8; ++k){\\n if(cv[i][k]!='*' && cv[i][k]!=nv[j][k]){frg = false;}\\n }\\n if(frg){ans+=iv[i];}\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3108,\n \"score_of_the_acc\": -0.2697,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2205_3647001\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n while(1){\\n int n,m;\\n cin>>n>>m;\\n if(n == 0){\\n break;\\n }\\n\\n vector<string> number;\\n vector<int> money;\\n for(int i = 0;i < n;++i){\\n string a;\\n int b;\\n cin>>a>>b;\\n\\n number.push_back(a);\\n money.push_back(b);\\n }\\n\\n vector<string> ticket;\\n for(int i = 0;i < m;++i){\\n string a;\\n cin>>a;\\n\\n ticket.push_back(a);\\n }\\n\\n int sum = 0;\\n for(int i = 0;i < number.size();++i){\\n int e = 0;\\n string c = number.at(i);\\n\\n for(int j = 0;j < c.size();++j){\\n char d = c.at(j);\\n if(d == '*'){\\n ++e;\\n }\\n }\\n c.erase(c.begin(), c.begin() + e);\\n\\n for(int j = 0;j < ticket.size();++j){\\n string f = ticket.at(j);\\n f.erase(f.begin(), f.begin() + e);\\n\\n if(f == c){\\n sum += money.at(i);\\n }\\n }\\n }\\n\\n cout<<sum<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.4877,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2205_3646975\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\n\\nint main(){\\n int n,m;\\n string tnum[100];\\n int tv[100];\\n string num;\\n \\n while(cin>>n>>m){\\n int sum=0;\\n if(n==0 && m==0)\\n break;\\n \\n for(int i=0;i<n;i++){\\n cin>>tnum[i]>>tv[i];\\n }\\n\\n for(int i=0;i<m;i++){\\n cin>>num;\\n for(int j=0;j<n;j++){\\n bool hit=true;\\n for(int k=0;k<8;k++){\\n if(tnum[j][k]=='*')\\n continue;\\n if(num[k]!=tnum[j][k])\\n hit=false;\\n }\\n if(hit==true)\\n sum+=tv[j];\\n }\\n }\\n\\n cout<<sum<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.3933,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2205_3646923\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\nusing namespace std;\\n\\nint main() {\\n int n, m;\\n vector<string> N, B;\\n vector<int> M;\\n\\n while(cin >> n, n) {\\n cin >> m;\\n\\n for(int i = 0; i < n; i++) {\\n string str;\\n int money;\\n cin >> str >> money;\\n N.push_back(str);\\n M.push_back(money);\\n }\\n\\n for(int i = 0; i < m; i++) {\\n string str;\\n cin >> str;\\n B.push_back(str);\\n }\\n\\n int ans = 0;\\n for(int i = 0; i < m; i++) {\\n for(int j = 0; j < n; j++) {\\n int chance = 1;\\n for(int k = 0; k < 8; k++) {\\n if(N[j][k] != '*') {\\n if(N[j][k] != B[i][k]) {\\n chance = 0;\\n break;\\n }\\n }\\n }\\n if(chance == 1)\\n ans += M[j];\\n }\\n }\\n cout << ans << endl;\\n M.clear();\\n N.clear();\\n B.clear();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.4382,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2205_3646907\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main(){\\n\\n int n,m;\\n\\n while(1){\\n\\n\\tcin >> n >> m;\\n\\n\\tif(n == 0 && m == 0)\\n\\t break;\\n\\n\\tvector<string> N(n);\\n\\tvector<int> M(n);\\n\\tvector<string> B(m);\\n\\n\\tfor(int i=0;i<n;++i)\\n\\t cin >> N[i] >> M[i];\\n\\n\\tfor(int i=0;i<m;++i)\\n\\t cin >> B[i];\\n\\n\\tint sum = 0;\\n\\t\\n\\tfor(int i=0;i<n;++i){\\n\\t for(int j=0;j<m;++j){\\n\\t\\tfor(int k=7;k>=0;--k){\\n\\t\\t if(N[i][k] == '*' || (k == 0 && N[i][k] == B[j][k])){\\n\\t\\t\\tsum += M[i];\\n\\t\\t\\tbreak;\\n\\t\\t }\\n\\t\\t \\n\\t\\t if(N[i][k] != B[j][k])\\n\\t\\t\\tbreak;\\n\\t\\t \\n\\t\\t}\\n\\t }\\n\\t}\\n\\tcout << sum << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.6067,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2205_3646818\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\nusing namespace std;\\nint main(){\\n int n,m;\\n while(cin >> n >> m,n){\\n vector<string> s(n);\\n vector<int> num(n);\\n for(int i = 0; i < n; i++)cin >> s[i] >> num[i];\\n int ans = 0;\\n while(m--){\\n string t;\\n cin >> t;\\n for(int i = 0; i < n; i++){\\n bool c = true;\\n for(int j = 0; j < 8; j++){\\n if(s[i][j] != '*' && t[j] != s[i][j])c = false;\\n }\\n if(c)ans += num[i];\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3128,\n \"score_of_the_acc\": -0.3258,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2205_3441433\",\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 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 Cout(x) cout << (x) << endl\\n#define Cout2(x, y) cout << (x) << \\\" \\\" << (y) << endl\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntypedef long long LL;\\ntypedef vector<int> VI;\\ntypedef vector<LL> VL;\\ntypedef vector<string> VS;\\ntypedef vector<bool> VB;\\ntypedef vector<vector<int>> VVI;\\ntypedef pair<int, int> PII;\\nconst int inf = 1e9;\\nconst double pi = acos(-1.0);\\n\\nbool Check(string a, string b) {\\n\\tbool ret = true;\\n\\tfor (int i = 7; i >= 0 && a[i] != '*'; i--) {\\n\\t\\tif (a[i] != b[i])ret = false;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tint n, m;\\n\\twhile (cin >> n >> m && (n || m)) {\\n\\t\\tVS n2(n), b(m); VI m2(n);\\n\\t\\trep(i, n)cin >> n2[i] >> m2[i];\\n\\t\\trep(i, m)cin >> b[i];\\n\\n\\t\\tint ans = 0;\\n\\t\\trep(i, n) {\\n\\t\\t\\trep(j, m)ans += Check(n2[i], b[j])*m2[i];\\n\\t\\t}\\n\\t\\tCout(ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.4945,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2205_3420204\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\nusing namespace std;\\nbool f(string a, string b) {\\n\\tfor (int i = 0; i < 8; i++)if (a[i] != '*'&&a[i] != b[i])return 0; return 1;\\n}\\nstring p[123]; int q[123];\\nsigned main() {\\n\\twhile (1) {\\n\\t\\tint n, m, sum = 0;\\n\\t\\tcin >> n >> m;\\n\\t\\tif (!n)return 0;\\n\\t\\tfor (int i = 0; i < n; i++)cin >> p[i] >> q[i];\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tstring k; cin >> k;\\n\\t\\t\\tfor (int j = 0; j < n; j++)if (f(p[j], k))sum += q[j];\\n\\t\\t}\\n\\t\\tcout << sum << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -0.3934,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2205_3408213\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n,m;\\nstring N[101];\\nint M[101];\\nstring B[1001];\\n\\nint main(){\\n\\twhile(cin >> n >> m, n != 0 && m != 0){\\n\\t\\tfor(int i = 0; i < n; i++){\\n\\t\\t\\tcin >> N[i] >> M[i];\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < m; i++){\\n\\t\\t\\tcin >> B[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\tint score = 0;\\n\\t\\tfor(int i = 0; i < m; i++){ // B\\n\\t\\t\\tfor(int j = 0; j < n; j++){ // N,M\\n\\t\\t\\t\\tbool f = true;\\n\\t\\t\\t\\tfor(int k = 0; k < 8; k++){\\n\\t\\t\\t\\t\\tif(N[j][k] != B[i][k] && N[j][k] != '*'){\\n\\t\\t\\t\\t\\t\\tf = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(f){\\n\\t\\t\\t\\t\\tscore += M[j];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << score << endl;\\n\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3052,\n \"score_of_the_acc\": -0.1124,\n \"final_rank\": 2\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":11,"numItemsPerPage":100,"numTotalItems":2103,"offset":1100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTc0Njk3OSwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5NzUwNTc5LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.qEPSHz4C4e8H0fkrZtuPn1uUtLcjBKy1GLOo3khlfhHtjD1f-634StVDIMfyOW4kdX6I75cUWe__NNTaMDpBDw","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_2069_cpp | Greedy, Greedy.
Once upon a time, there lived a dumb king. He always messes things up based on his whimsical ideas.
This time, he decided to renew the kingdom’s coin system. Currently the kingdom has three types of
coins of values 1, 5, and 25. He is thinking of replacing these with another set of coins.
Yesterday, he ... | [
{
"submission_id": "aoj_2069_10946129",
"code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<cstdio>\n\nusing namespace std;\n\ntypedef long long LL;\n\nconst int N = 55, M = 100010, INF = 0x3f3f3f3f;\n\nint w[N];\nint f[M];\n\nint main()\n{\n int n, t = 1;\n while(sca... |
aoj_2076_cpp | Flame of Nucleus
Year 20XX — a nuclear explosion has burned the world. Half the people on the planet have died. Fearful.
One city, fortunately, was not directly damaged by the explosion. This city consists of
N
domes (numbered 1
through
N
inclusive) and
M
bidirectional transportation pipelines connecting the domes. In ... | [
{
"submission_id": "aoj_2076_9663227",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define Bankai ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\nconst int MX_SIZE= 1e2 + 10;\nconst int oo=1e9 + 1;\nconst int MOD=1e9+7;\n\nint tc = 0;\n\nvoid File() {\n#ifndef ONLINE_JUDGE\n ... |
aoj_2083_cpp | Problem E:
Black Force
A dam construction project was designed around an area called Black Force. The area is surrounded by
mountains and its rugged terrain is said to be very suitable for constructing a dam.
However, the project is now almost pushed into cancellation by a strong protest campaign started by the
local r... | [
{
"submission_id": "aoj_2083_10357089",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <list>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include... |
aoj_2079_cpp | Problem A:
Dance Dance Revolution
Dance Dance Revolution
is one of the most popular arcade games in Japan. The rule of this game is very
simple. A series of four arrow symbols,
up
,
down
,
left
and
right
, flows downwards on the screen in time
to music. The machine has four panels under your foot, each of which corresp... | [
{
"submission_id": "aoj_2079_2456027",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint main() {\n\tint n; cin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tstring s; cin >> s;\n\t\tfor (int j = 0; j < s.size() - 1; j++) {\n\t\t\tif (s[j] == s[j + 1]) {\n\t\t\t\tcout << \"No\\n... |
aoj_2081_cpp | Problem C:
Save the Energy
You were caught in a magical trap and transferred to a strange field due to its cause. This field is three-
dimensional and has many straight paths of infinite length. With your special ability, you found where
you can exit the field, but moving there is not so easy. You can move along the pa... | [
{
"submission_id": "aoj_2081_9061681",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rn... |
aoj_2080_cpp | Problem B:
Compress Files
Your computer is a little old-fashioned. Its CPU is slow, its memory is not enough, and its hard drive is
near to running out of space. It is natural for you to hunger for a new computer, but sadly you are not so
rich. You have to live with the aged computer for a while.
At present, you have a... | [
{
"submission_id": "aoj_2080_9612551",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n while (1) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) {\n return 0;\n }\n vector <int > a(n), b(n);\n for (int i = 0; i < ... |
aoj_2082_cpp | Problem D:
Goofy Converter
Nathan O. Davis is a student at the department of integrated systems. He is now taking a class in in-
tegrated curcuits. He is an idiot. One day, he got an assignment as follows: design a logic circuit that
takes a sequence of positive integers as input, and that outputs a sequence of 1-bit i... | [
{
"submission_id": "aoj_2082_10626371",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll s(ll n){\n ll sum = 0;\n for(int i = 0; (1 << i) <= n; i++){\n sum += ((1 << i) | n) == n;\n }\n return sum;\n}\nint main() {\n ll n,m;\n while(cin >> n... |
aoj_2088_cpp | Problem E:
Spirograph
Some of you might have seen instruments like the figure below.
Figure 1: Spirograph
There are a fixed circle (indicated by
A
in the figure) and a smaller interior circle with some
pinholes (indicated by
B
). By putting a pen point through one of the pinholes and then rolling
the circle
B
without s... | [
{
"submission_id": "aoj_2088_3149619",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\nconst double PI = acos(-1);\n\nint gcd(int a, int b){\n if(a%b==0) return b;\n return gcd(b,a%b);\n}\n\nint main(){\n whi... |
aoj_2094_cpp | Problem B:
Jaggie Spheres
Let
J
(
n
) be a three-dimensional body that
is a union of unit cubes whose all vertices lie on integer coordinates,
contains all points that are closer than the distance of √
n
to the origin, and
is the smallest of all such bodies.
The figure below shows how
J
(1),
J
(2), and
J
(3) look.
Figu... | [
{
"submission_id": "aoj_2094_1049392",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <cmath>\n#include <queue>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 2000 + 10;\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, 1, 0, -1}... |
aoj_2085_cpp | Problem B:
Turn Left
Taro got a driver’s license with a great effort in his campus days, but unfortunately there had
been no opportunities for him to drive. He ended up obtaining a gold license.
One day, he and his friends made a plan to go on a trip to Kyoto with you. At the end of their
meeting, they agreed to go aro... | [
{
"submission_id": "aoj_2085_4649077",
"code_snippet": "#include <iostream>\n#include <utility>\n#include <tuple>\n#include <vector>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <functional>\n#include <climits>\n#inclu... |
aoj_2086_cpp | Problem C:
!
You are one of ICPC participants and in charge of developing a library for multiprecision numbers
and radix conversion. You have just finished writing the code, so next you have to test if it
works correctly. You decided to write a simple, well-known factorial function for this purpose:
Your task is to wri... | [
{
"submission_id": "aoj_2086_3764345",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<climits>\nusing namespace std;\ntypedef long long ll;\n#define inRange(x,a,b) (a <= x && x <= b)\n\nint main(){\n int n;\n string m;\n vector<int> p({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31});\n ... |
aoj_2089_cpp | Problem F:
Mysterious Dungeons
The Kingdom of Aqua Canora Mystica is a very affluent and peaceful country, but around the
kingdom, there are many evil monsters that kill people. So the king gave an order to you to kill
the master monster.
You came to the dungeon where the monster lived. The dungeon consists of a grid o... | [
{
"submission_id": "aoj_2089_5264769",
"code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <string>\n#include <map>\n#include <stack>\n#include <climits>\n#include <array>\n#includ... |
aoj_2098_cpp | Problem F:
Two-finger Programming
Franklin Jenkins is a programmer, but he isn’t good at typing keyboards. So he always uses only ‘f’
and ‘j’ (keys on the home positions of index fingers) for variable names. He insists two characters are
enough to write programs, but naturally his friends don’t agree with him: they say... | [
{
"submission_id": "aoj_2098_10433830",
"code_snippet": "// AOJ #2098 Two-finger Programming\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct Var { int scope, start, end; ll w; };\nenum TokType { ID, KW, NUM, OP, PUNC };\n\nint main(){\n ios::sync_with_stdi... |
aoj_2084_cpp | Problem A:
Hit and Blow
Hit and blow
is a popular code-breaking game played by two people, one codemaker and one
codebreaker. The objective of this game is that the codebreaker guesses correctly a secret
number the codemaker makes in his or her mind.
The game is played as follows. The codemaker first chooses a secret n... | [
{
"submission_id": "aoj_2084_10486221",
"code_snippet": "#include \"bits/stdc++.h\"\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusin... |
aoj_2091_cpp | Problem H:
Petoris
You are playing a puzzle game named
petoris
. It is played with a board divided into square
grids and square tiles each of which fits to a single grid.
In each step of the game, you have a board partially filled with tiles. You also have a block
consisting of several tiles. You are to place this bloc... | [
{
"submission_id": "aoj_2091_5515486",
"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... |
aoj_2090_cpp | Problem G:
Repeated Subsequences
You are a treasure hunter traveling around the world. Finally, you’ve got an ancient text
indicating the place where the treasure was hidden. The ancient text looks like a meaningless
string of characters at first glance. Actually, the secret place is embedded as the
longest repeated
su... | [
{
"submission_id": "aoj_2090_10695784",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[1010][1010];\n\nstring get(string a, string b)\n{\n memset(dp, 0, sizeof dp);\n\n int n = a.size(), m = b.size();\n a = '#' + a;\n b = '#' + b;\n for (int i = 1; i <= n; i++)\n ... |
aoj_2097_cpp | Problem E:
Triangles
There is a group that paints an emblem on the ground to invite aliens every year. You are a member of
this group and you have to paint the emblem this year.
The shape of the emblem is described as follows. It is made of
n
regular triangles whose sides are
equally one unit length long. These triangl... | [
{
"submission_id": "aoj_2097_3057313",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define EQ(... |
aoj_2099_cpp | Problem G:
Walk under a Scorching Sun
Edward R. Nelson is visiting a strange town for some task today. This city is built on a two-dimensional
flat ground with several vertical buildings each of which forms a convex polygon when seen from above
on it (that is to say, the buidlings are convex polygon columns). Edward ne... | [
{
"submission_id": "aoj_2099_3166070",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\n#include <utility>\n#include <map>\nusing namespace std;\nconst double EPS = 1e-6;\nconst double INF = 1e12;\ncons... |
aoj_2095_cpp | Problem C:
Nagashi Soumen
Mr. Natsume, the captain of a baseball club, decided to hold a
nagashi-soumen
party. He first planned
to put a flume at the arena, and let members stand by the side of the flume to eat soumen. But they are
so weird that they adhere to each special position, and refused to move to the side of t... | [
{
"submission_id": "aoj_2095_9342791",
"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_2096_cpp | Problem D:
Private Teacher
You are working as a private teacher. Since you are giving lessons to many pupils, you are very busy,
especially during examination seasons. This season is no exception in that regard.
You know days of the week convenient for each pupil, and also know how many lessons you have to give
to him ... | [
{
"submission_id": "aoj_2096_9347701",
"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_2103_cpp | Problem D:
バトルタウン
あなたは友人たちとゲームを開発することにした．
ゲームのタイトルは「バトルタウン」．
戦車による市街戦をテーマにしたゲームだ．
ゲーム開発の第一歩として，次のようなプロトタイプを開発することにした．
このプロトタイプでは，登場する戦車はプレイヤーの戦車のみであり，
敵の戦車は登場しない．
プレイヤーの戦車はプレイヤーの入力に従ってマップ上で様々な動作をする．
以下に，戦車の動作に関する仕様を述べる．
マップの構成要素は表1の通りである．
戦車が移動できるのはマップ内の平地の上だけである．
表1: マップの構成要素
文字
要素
.
平地
*
レ... | [
{
"submission_id": "aoj_2103_1910162",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nchar map[20][20];\nint dx[4]={0,0,-1,1},dy[4]={-1,1,0,0};\nchar dm[4]={'^','v','<','>'};\nint main(){\n\tint t;\n\tcin>>t;\n\tfor(int r=0;r<t;r++){\n\tif(r!=0)cout<<endl;\n\tint h,w;\n\tcin>>h... |
aoj_2102_cpp | Problem C:
ラミー
あなたの友達は最近 UT-Rummy というカードゲームを思いついた．
このゲームで使うカードには赤・緑・青のいずれかの色と1から9までのいずれかの番号が
つけられている．
このゲームのプレイヤーはそれぞれ9枚の手札を持ち，
自分のターンに手札から1枚選んで捨てて，
代わりに山札から1枚引いてくるということを繰り返す．
このように順番にターンを進めていき，
最初に手持ちのカードに3枚ずつ3つの「セット」を作ったプレイヤーが勝ちとなる．
セットとは，同じ色の3枚のカードからなる組で，すべて同じ数を持っているか
連番をなしているもののことを言う... | [
{
"submission_id": "aoj_2102_10946120",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing P = pair<int, char>;\n\nint main() {\n int n;\n cin >> n;\n while(n--) {\n vector<P> v(9);\n for(int i=0; i<9; ++i) {\n cin >> v[i].first;\n }\n fo... |
aoj_2101_cpp | Problem B:
完全数
ある整数
N
に対し，その数自身を除く約数の和を
S
とする．
N
=
S
のとき
N
は完全数 (perfect number)，
N
>
S
のとき
N
は不足数 (deficient number)，
N
<
S
のとき
N
は過剰数 (abundant number) と呼ばれる．
与えられた整数が，完全数・不足数・過剰数のどれであるかを
判定するプログラムを作成せよ．
プログラムの実行時間が制限時間を越えないように注意すること．
Input
入力はデータセットの並びからなる．
データセットの数は 100 以下である．
各データセットは整数
N
(0 <
N
≤ 1000... | [
{
"submission_id": "aoj_2101_4196635",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef vector<pair<int,int> > pr;\nconst int H_MX = 100000001;\n\nint N;\npr v;\nvector<int> prime;\nunsigned int bset[H_MX/32+1] = {0};\n\nbool get_b(int i){\n\tint bank = i / 32;\n\tint ofs = i % 32;... |
aoj_2105_cpp | Problem F:
Problem F: リズムマシーン
Advanced Computer Music社（ACM社）は，
あらかじめプログラムされたリズム通りに音楽を演奏する
リズムマシーンを販売していた．
ある時，ACM社は新しいリズムマシーンを開発して売り出そうとしていた．
ACM社の旧製品は同時に1つの音しか鳴らすことができなかったのに対し，
新製品では最大で8つの音を同時に鳴らせるようになるというのが
一番の目玉機能であった．
今まで複数の旧製品を利用して演奏する必要のあった曲が
新製品1台で済むようになるので，
ACM社は新製品への移行を推進させる... | [
{
"submission_id": "aoj_2105_2863552",
"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#in... |
aoj_2108_cpp | Problem I:
Aaron と Bruce
Aaron は凶悪な犯罪者である．
彼は幾度も犯罪を繰り返しながら
（万引き2回，のぞき16回，下着泥棒256回，食い逃げ65,536回）
も，その人並み外れた身体能力を用いて
警察の手から逃れ続けてきた．
Bruce は警察官である．
彼は突出した運動能力は持っていないが，
写真撮影が趣味であり，
彼の撮った写真が雑誌に載るほどの腕前を持っている．
ある日，Bruce は山奥に写真撮影をしに来た．
すると偶然 Aaron のアジトを突き止めてしまった．
Bruce が逃げる Aaron を追っていくと，... | [
{
"submission_id": "aoj_2108_5890083",
"code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setpr... |
aoj_2109_cpp | Problem J:
いにしえの数式
あなたの友人の考古学者が遺跡を発掘していた．
ある日，彼は怪しげな記号の羅列が刻まれている石盤を大量に発見した．
彼はこの大発見に大喜びし，すぐさま石盤に刻まれている記号の解読を始めた．
何週間にもわたる彼の解読の努力の結果，
どうやらこれらの石盤には変数・演算子・カッコの組み合わせで成り立っている
数式のようなものが刻まれていることがわかった．
発掘した石盤と遺跡に関わる文献を調べていくうちに彼はさらに，
それぞれの石盤で演算子の結合規則が異なっており，
それぞれの石盤の先頭に演算子の結合規則が記されているらしいことを突きとめた．... | [
{
"submission_id": "aoj_2109_4399733",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nint G;\nint CLOSE[105]... |
aoj_2104_cpp | Problem E:
カントリーロード
ある過疎地域での話である．
この地域ではカントリーロードと呼ばれるまっすぐな道に沿って，
家がまばらに建っている．
今までこの地域には電気が通っていなかったのだが，
今回政府からいくつかの発電機が与えられることになった．
発電機は好きなところに設置できるが，
家に電気が供給されるにはどれかの発電機に電線を介してつながっていなければならず，
電線には長さに比例するコストが発生する．
地域で唯一の技術系公務員であるあなたの仕事は，
すべての家に電気が供給されるという条件の下で，
できるだけ電線の長さの総計が短くなるよう... | [
{
"submission_id": "aoj_2104_10853081",
"code_snippet": "#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#define MAXSIZE 1000005\n#define LL long long\n#define INF 0x3f3f3f3f\n\nusing namespace std;\n\nLL pos[MAXSIZE];\nLL dist[MAXSIZE];\n\... |
aoj_2107_cpp | Problem H:
いけるかな？
あるところに，日本各地をまわりながら商売をする社長がいた．
彼はある日，不思議な切符を手に入れた．
その切符を使うと，なんと目的地までの距離によらず電車の運賃が無料になるという．
ただし，
現在の駅から隣接する駅へ移動するのを1ステップと数えたときに，
移動するステップ数がちょうど切符に書かれた数と等しくならないと
追加料金を取られてしまう．
ある区間をただちに折り返すような移動は禁止されているが，
既に訪れた駅や区間を複数回通ること自体は許される．
たとえば，駅1・駅2・駅1と移動することはできないが，
駅1・駅2・... | [
{
"submission_id": "aoj_2107_11030243",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <valarray>\n#include <utility>\nusing namespace std;\n\nstruct Matrix{\n int n;\n valarray<int> a;\n Matrix(int N) : n(N), a(N*N) {a=0;}\n void set(int x, int i, int j){\n a[i*n+j] = ... |
aoj_2114_cpp | Problem C:
Median Filter
The median filter is a nonlinear digital filter used to reduce noise in images, sounds, and other kinds of signals.
It examines each sample of the input through a
window
and then emits the
median
of the samples in the win-
dow. Roughly speaking, a window is an interval that contains a target sa... | [
{
"submission_id": "aoj_2114_10437995",
"code_snippet": "// AOJ #2114 Median Filter\n// 2025.5.1\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint dp_min[256][256], dp_max[256][256], ndp_min[256][256], ndp_max[256][256];\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie... |
aoj_2113_cpp | Problem B:
Electrophoretic
Scientist Frank, majoring in electrochemistry, has developed line-shaped strange electrodes called
F-electrodes
.
During being activated, each F-electrode causes a special potential on and between the two lines touching the
F-electrode’s endpoints at a right angle. Then electrically-charged p... | [
{
"submission_id": "aoj_2113_8029844",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\ntypedef long double LD;\n\nconst int N = 205;\nconst int MAXN = 100005;\nconst LD eps = 1e-9;\n\ninline int sgn(LD x) {\n return x > eps? 1 : x < -eps? -1 : 0;\n}\n\nstruct Point... |
aoj_2116_cpp | Problem E:
Subdividing a Land
Indigo Real-estate Company is now planning to develop a new housing complex. The entire complex is a square,
all of whose edges are equally
a
meters. The complex contains
n
subdivided blocks, each of which is a
b
-meter
square. Here both
a
and
b
are positive integers.
However the project i... | [
{
"submission_id": "aoj_2116_7138451",
"code_snippet": "#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair... |
aoj_2121_cpp | Problem J:
Castle Wall
A new lord assumed the position by the death of the previous lord in a Far Eastern province.
The new greedy lord hates concave polygons, because he believes they need much wasted area to be drawn on
paper. He always wants to modify them to convex ones.
His castle is currently surrounded by a wall... | [
{
"submission_id": "aoj_2121_1128016",
"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#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_FR... |
aoj_2106_cpp | Problem G:
エナジー・トランスポーター
とある研究所で，
エネルギー伝達用の媒体の開発をしていた．
この媒体は図3に示すような特殊な物質からなる
ポリマー構造をなしている．
(-α-Ea-β-)
n
図3: エネルギー伝達用媒体の構造．
図の Ea で示した部分がこの媒体のもっとも特徴的な部位の
エナジーアキュムレータ (Energy Accumulator) である．
このEa基は 1 kJ 幅で離散化された多様なエネルギー状態を取ることができる．
あるEa基を励起させると，
そのEa基のα側に結合している隣接したEa基に蓄積されている全エネルギーを
β側に... | [
{
"submission_id": "aoj_2106_8859757",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#define REP(i, s, n) for (int i = s; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define MAX 150\nusing namespace std;\nbool dp[MAX][MAX][2];\nint main() {\n ios_base::sync_with_stdio(fals... |
aoj_2117_cpp | Problem F:
Connect Line Segments
Your dear son Arnie is addicted to a puzzle named
Connect Line Segments
.
In this puzzle, you are given several line segments placed on a two-dimensional area. You are allowed to add
some new line segments each connecting the end points of two existing line segments. The objective is to... | [
{
"submission_id": "aoj_2117_10853928",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<complex>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nconst int MAXN=1<<14;\nconst double inf=1.0e20;\ntypedef complex<double> point;\nvector<int> s[MAXN],t[MAXN];\npoi... |
aoj_2118_cpp | Problem G:
Oil Company
Irving & Cohen Petroleum Corporation has decided to develop a new oil field in an area. A preliminary survey
has been done and they created a detailed grid map of the area which indicates the reserve of oil.
They are now planning to construct mining plants on several grid blocks according this ma... | [
{
"submission_id": "aoj_2118_2651329",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\n... |
aoj_2115_cpp | Problem D:
Life Game
You are working at a production plant of biological weapons. You are a maintainer of a terrible virus weapon
with very high reproductive power. The virus has a tendency to build up regular hexagonal colonies. So as a
whole, the virus weapon forms a hexagonal grid, each hexagon being a colony of the... | [
{
"submission_id": "aoj_2115_10848975",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n \nint dir[18][2] =\n{\n { -1, -1,}, { -1, 0}, {0, -1}, {0, 1}, {1, 0}, {1, 1},\n { -1, -1,}, { -1, 0}, {0, -1}, {0, 1}, {1, -1}, {1, 0},\n { -1, 0,}, { -1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}\n};\n \nl... |
aoj_2119_cpp | Problem H:
Finding the Top RPS Player
A company “ACM Foods” is preparing for opening its chain shop in a certain area, but another company “ICPC
Pizza” is also planning to set up its branch shop in the same area. In general, two competitive shops gain less
incomes if they are located so close to each other. Thus, if bo... | [
{
"submission_id": "aoj_2119_10852992",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nconst int MAXN=30;\nint a[MAXN], b[MAXN];\nint main(){\n int n, m, cs=1;\n while(cin>>n>>m&&n+m){\n int cnt=0;\n memset(a,0,sizeof a);\... |
aoj_2123_cpp | Problem B:
Divisor Function
Teiji is a number theory lover. All numbers are his friends - so long as they are integers. One day, while
preparing for the next class as a teaching assistant, he is interested in a number-theoretical function called the
divisor function
. The divisor function
σ
(
n
) is defined as the sum ... | [
{
"submission_id": "aoj_2123_10972771",
"code_snippet": "#include<bits/stdc++.h>\n#define ll long long\n\nusing namespace std;\nconst int N = 33;\n\nll k;\nbool prime[N];\nvector<int> p;\n\nvoid sieve() {\n memset(prime, true, sizeof(prime));\n prime[0] = prime[1] = false;\n for (int i = 2; i * i <... |
aoj_2126_cpp | Problem F:
Alien Pianist
One day an alien came from some star far away in the universe. He was interested in cultures on the earth,
especially music. He enjoyed listening various kinds of music, and then he decided to play music by himself.
Fortunately, he met a composer in a concert and became a friend with him. He re... | [
{
"submission_id": "aoj_2126_10505742",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n/* вершина аккорда */\nstruct Node {\n int key; // номер клавиши\n int note; // номер ноты\n vector<int> out; // исходящие рёбра\n};\n\nint main() {\n ios::sync_with_stdio... |
aoj_2125_cpp | Problem D:
Land Mark
“Hey, what’s up? It’s already 30 minutes past eleven!”
“I’m so sorry, but actually I got lost. I have no idea where I am now at all and I got tired wandering around.
Please help!”
- Today you came to the metropolis to play with your friend. But she didn’t show up at the appointed time.
What happene... | [
{
"submission_id": "aoj_2125_3646382",
"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#... |
aoj_2124_cpp | Problem C:
Magical Dungeon
Arthur C. Malory is a wandering valiant fighter (in a game world).
One day, he visited a small village and stayed overnight. Next morning, the village mayor called on him. The
mayor said a monster threatened the village and requested him to defeat it. He was so kind that he decided to
help sa... | [
{
"submission_id": "aoj_2124_4748207",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 105\n\nst... |
aoj_2133_cpp | Problem C:
Alice and Bob
Alice and Bob are in love with each other, but they have difficulty going out on a date - Alice is a very
busy graduate student at the ACM university.
For this reason, Bob came to the ACM university to meet her on a day. He tried to reach the meeting
spot but got lost because the campus of the ... | [
{
"submission_id": "aoj_2133_1044772",
"code_snippet": "/* \n方針\n0. 初期状態で既にAliceが見えているか判定 =(YES)=> 0.000 と出力して終わる\n1. Bombと長方形の角を結ぶ線分を列挙\n 線分は建物の角とぶつかるor平行であるならそのまま伸ばしていく ( 建物につっこんだら終了 )\n2. Aliceから各点 ( 建物の角、線分の端点 ) への最短距離を求める\n3. 各点から直接到達可能なBombの線分をみつけ、その点までの距離 + その点からBombの線分までの最短距離を計算し、最も短いものを記録\n */\n\... |
aoj_2131_cpp | Problem A:
Pi is Three
π
(spelled pi in English) is a mathematical constant representing the circumference of a circle whose di-
ameter is one unit length. The name
π
is said to come from the first letter of the Greek words περιφέρεια (meaning periphery) and περίμετρος (perimeter).
Recently, the government of some coun... | [
{
"submission_id": "aoj_2131_2375984",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n double d;\n while(cin >> d){\n if(abs(d) < 0.000000001) break;\n int den = -1, num = -1;\n for(int i = 1;;i++){\n double tmp = 20.0;\n for(int j = i*3;;j++){\n ... |
aoj_2129_cpp | Problem I:
Text Justification
You are hired by the ∀I¶אΞ℘, an extraterrestrial intelligence, as a programmer of their typesetting system. Your
task today is to design an algorithm for
text justification
.
Text justification is to equalize the line widths as much as possible by inserting line breaks at appropriate posi-... | [
{
"submission_id": "aoj_2129_9679451",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl \"\\n\"\n\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace __gnu_pbds;\n\n#define ordered_set tree<int, nuint_type,great... |
aoj_2130_cpp | Problem J:
Billion Million Thousand
A linguist, Nodvic Natharus Damenhof (commonly called
Dr. Usoperant
), invented an artificial language
Usoperant
in 2007. The word
usoperant
means ‘one which tires’. Damenhof’s goal was to create a complex and
pedantic language that would remind many difficulties in universal communi... | [
{
"submission_id": "aoj_2130_10855711",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n\nint max(int a,int b)\n{\n return a>b ? a : b;\n}\n\nint min(int a,int b)\n{\n return a<b ? a : b;\n}\n\nint main()\n{\n int n;\n int i,j,k;\n char w[110][110];\n int p[110];\n char expre[... |
aoj_2136_cpp | Problem F:
Webby Subway
You are an officer of the Department of Land and Transport in Oykot City. The department has a plan to
build a subway network in the city central of Oykot.
In the plan,
n
subway lines are built, and each line has two or more stations. Because of technical
problems, a rail track between two stati... | [
{
"submission_id": "aoj_2136_8865474",
"code_snippet": "//\n// 彩色数を求める O(N2^N) のアルゴリズム\n//\n// cf.\n// https://drken1215.hatenablog.com/entry/2019/01/16/030000\n//\n// verified\n// ARC 171 D - Rolling Hash\n// https://atcoder.jp/contests/arc171/tasks/arc171_d\n//\n// AOJ 2136 Webby Subway\n// ... |
aoj_2134_cpp | Problem D:
Deadly Dice Game
T.I. Financial Group, a world-famous group of finance companies, has decided to hold an evil gambling
game in which insolvent debtors compete for special treatment of exemption from their debts.
In this game, each debtor starts from one cell on the stage called the Deadly Ring. The Deadly Ri... | [
{
"submission_id": "aoj_2134_10350010",
"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_2137_cpp | Problem G:
Time Trial
Some people like finishing computer games in an extremely short time. Terry A. Smith is one of such
and prefers role playing games particularly.
He is now trying to find a shorter play for one of the key events in a role playing game. In this event,
a player is presented a kind of puzzle on a grid... | [
{
"submission_id": "aoj_2137_9570105",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rn... |
aoj_2132_cpp | Problem B:
Left Hand Rule
The left-hand rule, which is also known as the wall follower, is a well-known strategy that solves a two-
dimensional maze. The strategy can be stated as follows: once you have entered the maze, walk around
with keeping your left hand in contact with the wall until you reach the goal. In fact,... | [
{
"submission_id": "aoj_2132_9582911",
"code_snippet": "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nconst int N = 110;\n\nint w, h, n;\nbool wall[N][N][4], used[N][N][4];\nint dx[] = {-1, 0, 1, 0};\nint dy[] = {0, -1, 0, 1};\n\nint main() {\n while(cin >> w >> h >> n) {\n if(w ... |
aoj_2142_cpp | Problem B:
Bitwise Kingdom
In the Bitwise Kingdom, located somewhere in the universe, there are exactly 2
N
citizens living and each
of them has a unique identification string that represents his or her class in the society. An identification
string is a binary string of length
N
which consists of characters ‘
0
’ or ‘... | [
{
"submission_id": "aoj_2142_3916277",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n//TEMPLATE\n#define pb push_back\n#define mp make_pair\n#define ll long long\n#define ld long double\n//#define pi 3.1415926536\n#defin... |
aoj_2139_cpp | Problem I:
Memory Match
Memory match is a single-player game which employs a set of 2
M
cards. Each card is labeled with a
number between 1 and
M
on its face. For each number
i
(1 ≤
i
≤
M
), there are exactly two cards which
have the number
i
. At the start of the game, all cards are shuffled and laid face down on a ta... | [
{
"submission_id": "aoj_2139_3176197",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n cout<<fixed<<setprecision(12);\n ll n;\n while(cin>>n && n){\n vector<vector<double>> dp(1000,vector<double>(1000,0));\n double ans=0;\n dp[n/2][0]=1;\n for(... |
aoj_2138_cpp | Problem H:
Vending Machine
There has been marketing warfare among beverage vendors, and they have been working hard for in-
crease of their sales. The Kola-Coqua Company is one of the most successful vendors among those:
their impressive advertisements toward the world has brought the overwhelming market share of their... | [
{
"submission_id": "aoj_2138_9570147",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rn... |
aoj_2135_cpp | Problem E:
Reverse a Road
Andrew R. Klein resides in the city of Yanwoe, and goes to his working place in this city every weekday.
He has been totally annoyed with the road traffic of this city. All the roads in this city are one-way, so he
has to drive a longer way than he thinks he need.
One day, the following though... | [
{
"submission_id": "aoj_2135_10351752",
"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_2143_cpp | Problem C:
Adaptive Time Slicing Quantization
Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quanti-
zation in a class. It is a process that approximates analog data (e.g. electrical pressure) by a finite set of
discrete values or integers.
He had an assignment to write a... | [
{
"submission_id": "aoj_2143_10318952",
"code_snippet": "// AOJ #2143 Adaptive Time Slicing Quantization\n// 2025.3.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst double INF = 1e12;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, M, L;\n while(true) {\n cin... |
aoj_2141_cpp | Problem A:
Girls' Party
Issac H. Ives hosted a party for girls. He had some nice goods and wanted to distribute them to the girls
as the presents. However, there were not enough number of presents and thus he needed to decide who
would take them. He held a game for that purpose.
Before the game, Issac had all the girls... | [
{
"submission_id": "aoj_2141_10295302",
"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_2149_cpp | Problem A:
Luck Manipulator
Nathan O. Davis くんは，あるゲームを攻略中であり，非常にレアなアイテムを手に入れようと四苦八苦していた．このレアなアイテムは，カジノのスロットマシーンで特殊な絵柄を一列に揃えたときに手に入れることができる．スロットマシーンには
N
個のリールがあり，ボタンを一回押すと現在回転している最も左側のリールが停止する．そのため，このレアアイテムを手に入れるためには
N
回ボタンを押す必要がある．また，特殊な絵柄で停止させるためにはあるタイミングでボタンを押す必要がある．ところが，このボタンを押すタイミングは非常にシビアであるため，なかなか上手くいかずに困っていた．そこで... | [
{
"submission_id": "aoj_2149_10946117",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\n#define FOR(i,s,t ) for(int i = s; i< t ; i++)\nusing VL = vector<LL>;\n\nvoid solve() {\n\tLL N, A, B, C, X;\n\twhile (cin >> N >> A >> B >> C >> X, N) {\n\t\tVL y(N);\n\t\tFOR(i, ... |
aoj_2150_cpp | Problem B:
Matsuzaki Number
Matsuzaki 教授は，宇宙の真理を研究している科学者である．人生，宇宙，すべての答えは 42 であると言われているが，Matsuzaki 教授はこれだけでは宇宙の真理を解明するには不十分であると考えている．Matsuzaki 教授は，宇宙の真理は 2 つのパラメータからなる関数で表されると考えており，42 はその 1 つに過ぎないというのである．
Matsuzaki 教授の定義した関数 M(
N
,
P
) は，
N
より大きい素数を 2 つ選んで（同じ数を 2 つでも構わない）和をとることで得られる数の全体を，小さいほうから順番に並べたときに，
P
番目に現れる数を表す... | [
{
"submission_id": "aoj_2150_10848227",
"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 INT = 1e9;\nconst ll LINF = 1e18;\n\nstruct UF{\n vector<int> d;\n UF(int size):d(size,-1){}\n bool u(int... |
aoj_2151_cpp | Problem C:
Brave Princess Revisited
ある貧乏な国のおてんばで勇敢なお姫様が，政略結婚のため別の国に嫁ぐことになった．ところがお姫様を亡き者としようとしている悪漢が嫁ぎ先への道の途中で刺客を放っている．
お姫様を無事に相手国に送り届けるため，あなたは安全な経路を既に決定していたのだが，お姫様の今までに通ったことのない道を通ってみたいという
わがままな
たっての願いで別の道を通ることとなった．そこであなたは地図を見ながらお姫様が通る道を決めなおすことにした．
全ての道は，宿場同士をつなぐ街道である．便宜上，出発地点及び目的地点も宿場とする．ところが，新しい道は治安の問題を抱えていた．盗賊やお姫様を亡き... | [
{
"submission_id": "aoj_2151_10855706",
"code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define RE... |
aoj_2152_cpp | Problem D:
Restrictive Filesystem
あなたは新型記録媒体の開発チームに所属するプログラマーである．この記録媒体はデータの読み込み及び消去はランダムアクセスが可能である．一方，データを書き込むときは，常に先頭から順番にアクセスしていき，最初に見つかった空き領域にしか書き込むことができない．
あなたはこの記録媒体用のファイルシステムの構築を始めた．このファイルシステムでは，記録媒体の制限から，データは先頭の空き領域から順に書き込まれる．書き込みの途中で別のデータが存在する領域に至った場合は，残りのデータをその後ろの空き領域から書き込んでいく．
データの書き込みはセクタと呼ばれる単位で行われる．セクタには ... | [
{
"submission_id": "aoj_2152_10854094",
"code_snippet": "#include <set>\n#include <cstdio>\n#include <vector>\n#pragma warning(disable : 4996)\nusing namespace std;\nint Q, x, y; char b[4];\nint main() {\n\twhile (scanf(\"%d\", &Q), Q) {\n\t\tvector<vector<int> > v;\n\t\twhile (Q--) {\n\t\t\tscanf(\"%s\", b... |
aoj_2155_cpp | Problem A:
Infected Computer
Adam Ivan is working as a system administrator at Soy Group, Inc. He is now facing at a big trouble:
a number of computers under his management have been infected by a computer virus. Unfortunately,
anti-virus system in his company failed to detect this virus because it was very new.
Adam h... | [
{
"submission_id": "aoj_2155_11061883",
"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_2154_cpp | Problem F:
Shore Erosion
あなたは地元の市役所に勤めるプログラマーである．あなたの住んでいる町は観光業が盛んで，とくに離れ小島にある海岸の海水浴場が人気がある．この島の周囲は砂浜により構成されているのだが，近年海岸浸食によって砂浜の面積が減ってきた．事態を重く見た観光課は，あなたに砂浜の形状変化のシミュレーションを依頼してきた．
シミュレーションでは，現在の砂浜の形状をもとに，ある期間が経過した後の砂浜の形状を求める．簡単のため，島の海岸線の形状は多角形（凸とは限らない）とみなす．期間のうちに，砂浜は現在の海岸線からマンハッタン距離で
R
だけ浸食されて海に沈むものと仮定する．ここで，マンハッタン距離とは
x... | [
{
"submission_id": "aoj_2154_10517869",
"code_snippet": "// AOJ #2154 Shore Erosion\n// 2025.5.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 1e-9;\nconst double EPS2 = 1e-2;\nconst double Ma[2] = {1184.6393175351, 1427.4096013511};\nconst double Aa[2] = {1176.5504733859, 1427.3630... |
aoj_2153_cpp | Problem E:
Mirror Cave
双子の冒険者 Rin と Len は鏡の洞窟でお宝を探している．この洞窟には鏡の間という対になった 2 つの部屋があり，その部屋の扉の向こうには高価な宝が眠っているという．
便宜上，2 つの部屋はそれぞれ
W
×
H
のセルが格子状に並んだものとみなす．部屋の外側は壁で囲まれている．また，部屋の内側にもところどころ壁が設置されており，壁の配置されているセルには進入することができない．宝の部屋への扉を開くためには，2 人が左右対称の動きをして，同時に特定のセルに到達しなければならない．しかも，片方だけが先に到達した場合は，扉はロックされて開かなくなってしまう．
左右対称の動きとは，北と北，... | [
{
"submission_id": "aoj_2153_10853099",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nstruct P {\n\tint x, y;\n\tP(int x, int y) : x(x), y(y) {}\n};\n\nint dx[] = { 1, 0, -1, 0 };\nint dy[] = { 0, 1, 0, -1 };\n\nint mp[50][50][50][50];\n\nint main()\n{\n\tint W, H, lsx, lsy, rsx, rsy, lgx... |
aoj_2157_cpp | Problem C:
Dial Lock
A dial lock is a kind of lock which has some dials with printed numbers. It has a special sequence of
numbers, namely an unlocking sequence, to be opened.
You are working at a manufacturer of dial locks. Your job is to verify that every manufactured lock is
unlocked by its unlocking sequence. In ot... | [
{
"submission_id": "aoj_2157_10854049",
"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_2156_cpp | Problem B:
Magic Slayer
You are in a fantasy monster-ridden world. You are a slayer fighting against the monsters with magic
spells.
The monsters have
hit points
for each, which represent their vitality. You can decrease their hit points
by your magic spells: each spell gives certain points of
damage
, by which monster... | [
{
"submission_id": "aoj_2156_10849238",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#define N 110010\nusing namespace std;\nint hp[110];\n\nstruct weapon{\n int c,p;\n}all[110],sig[110];\nint dp[2][N];\nint all_num,sig_num;\nint m,n;\nvoid init()\n{\... |
aoj_2159_cpp | Problem E:
Symmetry
Open Binary and Object Group organizes a programming contest every year. Mr. Hex belongs to this
group and joins the judge team of the contest. This year, he created a geometric problem with its solution
for the contest. The problem required a set of points forming a line-symmetric polygon for the i... | [
{
"submission_id": "aoj_2159_10208150",
"code_snippet": "// AOJ #2159\n// Symmetry 2025.2.10\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst double EPS = 1e-9;\n \nbool dEqual(double a, double b, double eps = EPS) {\n return fabs(a-b) < eps;\n}\n \ndouble normalizeAngle(... |
aoj_2161_cpp | Problem G:
Defend the Bases
A country Gizevom is being under a sneak and fierce attack by their foe. They have to deploy one or
more troops to every base immediately in order to defend their country. Otherwise their foe would take
all the bases and declare "All your base are belong to us."
You are asked to write a prog... | [
{
"submission_id": "aoj_2161_9574108",
"code_snippet": "#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nbs on max time available for max flow >= M\n\n*/\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst double ... |
aoj_2158_cpp | Problem D:
Double Sorting
Here we describe a typical problem. There are
n
balls and
n
boxes. Each ball is labeled by a unique
number from 1 to
n
. Initially each box contains one of these balls. We can swap two balls in adjacent
boxes. We are to sort these balls in increasing order by swaps, i.e. move the ball labeled ... | [
{
"submission_id": "aoj_2158_10111919",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <map>\n\nusing namespace std;\ntypedef long long ... |
aoj_2162_cpp | Problem H:
Galaxy Wide Web Service
The volume of access to a web service varies from time to time in a day. Also, the hours with the highest
volume of access varies from service to service. For example, a service popular in the United States
may receive more access in the daytime in the United States, while another ser... | [
{
"submission_id": "aoj_2162_10848624",
"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>; usin... |
aoj_2163_cpp | Problem I:
Tatami
A tatami mat, a Japanese traditional floor cover, has a rectangular form with aspect ratio 1:2. When
spreading tatami mats on a floor, it is prohibited to make a cross with the border of the tatami mats,
because it is believed to bring bad luck.
Your task is to write a program that reports how many po... | [
{
"submission_id": "aoj_2163_10853925",
"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_2164_cpp | Problem J:
Revenge of the Round Table
Two contries A and B have decided to make a meeting to get acquainted with each other.
n
ambassadors
from A and B will attend the meeting in total.
A round table is prepared for in the meeting. The ambassadors are getting seated at the round table, but
they have agreed that more th... | [
{
"submission_id": "aoj_2164_8393779",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MOD = 1000003;\n\nclass modint {\nprivate:\n\tint x;\npublic:\n\tmodint() : x(0) {}\n\tmodint(long long n) : x(n >= 0 ? n % MOD : (MOD - (-n) % MOD) % MOD) {}\n\tint get() const { return x; }\... |
aoj_2165_cpp | Problem A:
Strange String Manipulation
A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for-
mulas:
where
S
,
A
,
C
, and
M
are all parameters. In this problem, 0 ≤
S
,
A
,
C
≤ 15 and
M
= 256.
Now suppose we have some input string
I
(⋅), where each character in the string... | [
{
"submission_id": "aoj_2165_11061950",
"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_2168_cpp | Problem D:
Luigi's Tavern
Luigi's Tavern is a thriving tavern in the Kingdom of Nahaila. The owner of the tavern Luigi supports to
organize a party, because the main customers of the tavern are adventurers. Each adventurer has a job:
hero, warrior, cleric or mage.
Any party should meet the following conditions:
A party... | [
{
"submission_id": "aoj_2168_10852845",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n\nconst int N = 20000;\nconst int inf = 100000;\nint tot, id[N], nxt[N], lst[N], cap[N];\nint H, W, C, M, Nw, Nc, Nm, S, cH, cW, cC, c... |
aoj_2169_cpp | Problem E:
Colored Octahedra
A young boy John is playing with eight triangular panels. These panels are all regular triangles of the
same size, each painted in a single color; John is forming various octahedra with them.
While he enjoys his playing, his father is wondering how many octahedra can be made of these panels... | [
{
"submission_id": "aoj_2169_9685761",
"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_2174_cpp | Problem J:
Secret Operation
Mary Ice is a member of a spy group. She is about to carry out a secret operation with her colleague.
She has got into a target place just now, but unfortunately the colleague has not reached there yet. She
needs to hide from her enemy George Water until the colleague comes. Mary may want to... | [
{
"submission_id": "aoj_2174_3857380",
"code_snippet": "bool debug=false;\n#include <stdio.h>\n#include <utility>\n#include <vector>\n#include <math.h>\nusing namespace std;\ntypedef pair<double,double> pd;\ntypedef pair<pd,double> ppdd;\ntypedef pair<pd,pd> ppdpd;\n#define F first\n#define S second\n#defin... |
aoj_2172_cpp | Problem H:
Queen's Case
A small country called Maltius was governed by a queen. The queen was known as an oppressive ruler.
People in the country suffered from heavy taxes and forced labor. So some young people decided to form
a revolutionary army and fight against the queen. Now, they besieged the palace and have just... | [
{
"submission_id": "aoj_2172_9417496",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <type... |
aoj_2177_cpp | Problem C:
Champernowne Constant
Champernown constant is an irrational number represented in decimal by "
0.
" followed by
concatenation of all positive integers in the increasing order. The first few digits of this constant
are: 0.123456789101112...
Your task is to write a program that outputs the
K
digits of Chapnern... | [
{
"submission_id": "aoj_2177_5844175",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, k;\n\nstring solve();\nint check(int x);\n\nint main() {\n while (1) {\n cin >> n >> k;\n if (!(n + k)) break;\n cout << solve() << endl;\n }\n return 0;\n}\n\nstring solve() {\n int... |
aoj_2173_cpp | Problem I:
Wind Passages
Wind Corridor is a covered passageway where strong wind is always blowing. It is a long corridor of
width W, and there are several pillars in it. Each pillar is a right prism and its face is a polygon (not
necessarily convex).
In this problem, we consider two-dimensional space where the positiv... | [
{
"submission_id": "aoj_2173_10854020",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\n#include<vector>\n#include<cmath>\nusing namespace std;\ntypedef double LD;\nconst LD eps=1e-10;\nconst int maxn=210;\nLD sqr(LD x){return x*x;}\nint sgn(LD x){\n\treturn (x... |
aoj_2171_cpp | Problem G:
Strange Couple
Alice and Bob are going to drive from their home to a theater for a date. They are very challenging - they have no maps with them even though they don’t know the route at all (since they have just moved to
their new home). Yes, they will be going just by their feeling.
The town they drive can ... | [
{
"submission_id": "aoj_2171_10851264",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\n#define INF 0x3f3f3f3f\n#define N 110\n#define eps 1e-15\n#define LL long long\nusing namespace std;\nint n, s, t, q[N];\n\nint d[N][N], w[N][N];\nvoid Floy... |
aoj_2176_cpp | Problem B:
For the Peace
This is a story of a world somewhere far from the earth. In this world, the land is parted into a
number of countries ruled by empires. This world is not very peaceful: they have been involved
in army race.
They are competing in production of missiles in particular. Nevertheless, no countries h... | [
{
"submission_id": "aoj_2176_10851161",
"code_snippet": "#ifdef _WIN32\n#define getc_unlocked(stdin) getc(stdin)\n#endif\n#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <string>\n#include <list>\n#include <bitset>\n#include <vector>\n#include <stack>\n#include <q... |
aoj_2170_cpp | Problem F:
Marked Ancestor
You are given a tree
T
that consists of
N
nodes. Each node is numbered from 1 to
N
, and node 1 is always the root node of
T
. Consider the following two operations on
T
:
M v
: (Mark) Mark node
v
.
Q v
: (Query) Print the index of the nearest marked ancestor of node
v
which is nearest to it.... | [
{
"submission_id": "aoj_2170_11051033",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\ntypedef pair<char, int> pci;\n\nstack<pci> s;\n\nint fa[100010];\nint p[100010];\nint vis[100010];\n\nvector<int> e[100010];\n\n... |
aoj_2178_cpp | Problem D:
Futon
The sales department of Japanese Ancient Giant Corp. is visiting a hot spring resort for their
recreational trip. For deepening their friendships, they are staying in one large room of a
Japanese-style hotel called a ryokan.
In the ryokan, people sleep in Japanese-style beds called futons. They all hav... | [
{
"submission_id": "aoj_2178_10848267",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <queue>\n#include <stack>\n#include <map>\n#include <string>\n\nusing namespace std;\n\ntypedef long long l... |
aoj_2167_cpp | Problem C:
Find the Point
We understand that reading English is a great pain to many of you. So we’ll keep this problem statememt
simple. Write a program that reports the point equally distant from a set of lines given as the input. In
case of no solutions or multiple solutions, your program should report as such.
Inpu... | [
{
"submission_id": "aoj_2167_8216118",
"code_snippet": "#include <bits/stdc++.h>\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-6)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n#define COUNTER_CLOCKWISE 1\n#define CLOCKWISE -1\n#define ONLINE_BACK 2\n#def... |
aoj_2179_cpp | Problem E:
Safe Area
Nathan O. Davis is challenging a kind of shooter game. In this game, enemies emit laser beams
from outside of the screen. A laser beam is a straight line with a certain thickness. Nathan
moves a circular-shaped machine within the screen, in such a way it does not overlap a laser
beam. As in many sh... | [
{
"submission_id": "aoj_2179_10853964",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <cmath>\n#include <ctime>\n#include <utility>\n#include <map>\n#include <set>\n#include <queue>\n#incl... |
aoj_2180_cpp | Problem F:
Water Tank
You built an apartment. The apartment has a water tank with a capacity of
L
in order to
store water for the residents. The tank works as a buffer between the water company and the
residents.
It is required to keep the tank "not empty" at least during use of water. A pump is used to
provide water i... | [
{
"submission_id": "aoj_2180_10849597",
"code_snippet": "#include<iostream>\n#include<stdio.h>\n#include<cstring>\n\nusing namespace std;\n\nlong long n,l,s[100000],t[100000],u[100000],i,j;\ndouble ans,lb,ub,mid;\n\nbool tr ( double t_flow ) {\n\n\tdouble cap=l;\n\tfor(i=0;i<=n+1;i++)\n\t{\n\t\tcap=cap+t_fl... |
aoj_2183_cpp | Problem I:
Crystal Jails
Artistic Crystal Manufacture developed products named Crystal Jails. They are cool ornaments
forming a rectangular solid. They consist of colorful crystal cubes. There are bright cores on the
center of cubes, which are the origin of the name. The combination of various colored reflections
shows... | [
{
"submission_id": "aoj_2183_1429723",
"code_snippet": "#include<stdio.h>\n#include<algorithm>\n#include<set>\n#include<vector>\n#include<queue>\n\nusing namespace std;\nchar in[5][5][5];\nchar tmp[5][5][5];\nint bit[30][24];\nint mw[30][24];\nint md[30][24];\nint mh[30][24];\nint SZ[30];\n\nint W,D,H;\nint... |
aoj_2182_cpp | Problem H:
Eleven Lover
Edward Leven loves multiples of eleven very much. When he sees a number, he always tries
to find consecutive subsequences (or substrings) forming multiples of eleven. He calls such
subsequences as 11-sequences. For example, he can find an 11-sequence 781 in a number 17819.
He thinks a number whi... | [
{
"submission_id": "aoj_2182_10849107",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <string>\n\nusing namespace std;\n#define MAXN 88000\n\nstring s;\nlong long f[MAXN][12], g[MAXN][12];\nint a[MAXN];\n\nint num(char x)\n{\n return x - '0';\n}\n\nint mm(int x)\n{\n while (x < 0)... |
aoj_2181_cpp | Problem G:
Neko's Treasure
Maki is a house cat. One day she fortunately came at a wonderful-looking dried fish. Since she
felt not hungry on that day, she put it up in her bed. However there was a problem; a rat was
living in her house, and he was watching for a chance to steal her food. To secure the fish during
the t... | [
{
"submission_id": "aoj_2181_10853898",
"code_snippet": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n\ntypedef struct _c {\n int x,y,r;\n}circle;\n\nconst double LIT=1e-6;\n\ncircle p1[2000],p2[2000];\nint dp1[2000], dp2[2000];\n\nint cmp(const void *a, const void... |
aoj_2189_cpp | Problem E:
足し算ゲーム
ねこのファーブルは足し算を用いた簡単なゲームを思いつき、同じくねこで友達のオードリーと一緒にやってみることにした。
ゲームのルールは次のようなものである。まず最初に、適当な正の整数を選び、そこからスタートする。各プレーヤーは、その数のうち隣り合う2つの桁を選択して和を計算し、もとの2つの数字と置き換える。たとえば、「1234」の十の位と百の位を選ぶと、次の数は「154」となる。「5555」の十の位と百の位を選んだ場合は「5105」となる。このような操作を数が1桁になるまで交互に繰り返し、操作ができなくなったプレーヤーが負けとなる。
ゲーム開始時の整数の値が与えられる。先攻であるファーブルと後攻であ... | [
{
"submission_id": "aoj_2189_1912847",
"code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint solve(string S) {\n\tif (S.size() == 1)return 0;\n\tstring U = S;\n\tint F = (int)(U[0] - '0') + (int)(U[1] - '0');\n\tU = to_string(F) + U.substr(2, U.size() - 2);\n\treturn solve(U) + 1;... |
aoj_2192_cpp | Problem H:
あみだくじ
なつめは大のねこ好きである。なつめは今日も日課としている野良ねこのブラッシングをするために，いつも野良ねこが集まってくる校庭の一角に向かうことにした。
そのスポットに今日は
n
匹のねこが集まってきた。なつめは全員をブラッシングしてやりたかったのだが，ちょうどそこに来る直前に突然用事が出来てしまい，時間的に一匹しかブラッシングしてやれないことになってしまった。ブラッシングはどのねこも楽しみにしているので，一匹だけやると他のねこが嫉妬してしまう。そこでねこたちを納得させるために，どのねこをブラッシングするかをあみだくじで決めることにした。
あみだくじは
n
本の縦線とあらかじめ引いた
m
本の横線から... | [
{
"submission_id": "aoj_2192_2303693",
"code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\n#define fr first\n#define sc second\n\nconst int INF=1000000000;\n\nstruct SEG{\n int siz;\n int s[1<<18];\n void init(){\n siz = 1<<17;... |
aoj_2184_cpp | Problem J:
Cave Explorer
Mike Smith is a man exploring caves all over the world.
One day, he faced a scaring creature blocking his way. He got scared, but in short time he took
his knife and then slashed it to attempt to kill it. Then they were split into parts, which soon
died out but the largest one. He slashed the c... | [
{
"submission_id": "aoj_2184_9824183",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <cstring>\n#include <cassert>\n#include <vector>\ntypedef long long ll;\n//typedef long double ld;\ntypedef double ld;\ntypedef std::vector<int> Vint... |
aoj_2187_cpp | Problem C:
カードゲーム
ねこのゲイツとジャッキーは、2人で遊ぶカードゲームのルールを考えた。そのルールとは次のようなものである。
まず、1から18の数字が書かれたカードをシャッフルし、それぞれのプレーヤーに9枚ずつ配る。両者は同時に1枚のカードを同時に出し、その値によってスコアを得る。値の大きいカードを出したプレーヤーは、大きい方の値と小さい方の値の和を自分のスコアに加える。その際、値の小さいカードを出したプレーヤーはスコアを得られない。また、一度場に出されたカードは二度と使うことはできない。カードをすべて使い終わった後にスコアが大きかったプレーヤーの勝ちとする。
ゲイツとジャッキーは互いに無作為にカードを選んで出してみ... | [
{
"submission_id": "aoj_2187_9066307",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nvector<int> a(9),b(9);\nint aw=0,bw=0;\n\nvoid ck(int k,int usd,int as,int bs){\n for(int i=0;i<9;i++){\n if((usd&(1<<i))!=0) continue;\n //cout << k << \" \" << i << endl;\n... |
aoj_2194_cpp | Problem J:
ねこ泥棒と金曜日のお屋敷
なつめは大のねこ好きである。なつめの通学路には通称ねこ屋敷と呼ばれている家がある。その家はたくさんのねこを飼っていることで有名で、なつめは通学途中によくこの家の前で飼いねこに遭遇し、一緒に遊んでいた。そんなある日、なつめは衝撃的な事実を知ってしまった。それは、実はねこ屋敷の主人は、機嫌が悪くなるとよく飼いねこたちを虐待している、ということだった。ねこ屋敷の主人を許せなくなったなつめは、ねこたちを救うため、主人の居ない間にねこたちを盗みだすことにした。
なつめはねこ屋敷の主人の行動パターンを観察し、毎週決まって出掛けているタイミングをねらってねこたちを盗みだすことにした。ねこ屋敷は二次元... | [
{
"submission_id": "aoj_2194_3227728",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <utility>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (ab... |
aoj_2191_cpp | Problem G:
挨拶の多い本屋さん
なつめは大のねこ好きである。なつめはある日、いつも親しくしている野良ねこたちから、ねこたちが開いている不思議な本屋に行こうと誘われた。その本屋ではたくさんのねこの写真が載った本が売られていると聞き、なつめは喜んでついていくことにした。
なつめは知らなかったのだが、ねこたちに連れられていった本屋は全国にチェーン店を持つ有名店であった。その店ではしっかりとした店員用マニュアルが用意されており、どの店舗でも店員の行動が統一されている。以下はそのマニュアルからの抜粋である。
店員からユークリッド距離10以内のドアからお客様が入店された際には、
X
秒間かけて大声で「いらっしゃいませこんにちは」といわ... | [
{
"submission_id": "aoj_2191_2660721",
"code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\n... |
aoj_2190_cpp | Problem F:
天使の階段
なつめの住んでいる街の上に浮かんでいる雲には、天使が住んでいる。その天使はなつめと同じくねこ好きで、しばしばねこと遊びに地上に降りてくる。地上に降りるために、天使は雲から地上へ繋がる長い長い階段を作った。しかし、毎回毎回ただ降りていくだけではつまらないと思った天使は、階段に細工をして、段を踏むと音が出るようにした。これを使って、音楽を奏でながら降りていくのだ。
音楽は12種類の音を使って奏でるものである。今回、音のオクターブは無視することにして、 C, C#, D, D#, E, F, F#, G, G#, A, A#, B の12種類のみを考える。隣りあう音同士の差を半音と呼ぶ。たとえば、Cを半音... | [
{
"submission_id": "aoj_2190_9073606",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef int64_t ll;\n\nvector<string> oc={\"C\",\"C#\",\"D\",\"D#\",\"E\",\"F\",\"F#\",\"G\",\"G#\",\"A\",\"A#\",\"B\"};\nvector<int> ti(50000+1),si(50000+1);\n\nint tc=0,sc=0;\n\nbool nxt(int ps,int cnt)... |
aoj_2198_cpp | Problem B:
Moonlight Farm
あなたは大人気webゲーム「ムーンライト牧場」に熱中している．このゲームの目的は，畑で作物を育て，それらを売却して収入を得て，その収入によって牧場を大きくしていくことである．
あなたは速く畑を大きくしたいと考えた．そこで手始めにゲーム中で育てることのできる作物を，時間あたりの収入効率にもとづいて並べることにした．
作物を育てるには種を買わなければならない．ここで作物
i
の種の名前は
L
i
，値段は
P
i
でそれぞれ与えられる．畑に種を植えると時間
A
i
後に芽が出る．芽が出てから時間
B
i
後に若葉が出る．若葉が出てから時間
C
i
後に葉が茂る．葉が茂ってから時間
D
... | [
{
"submission_id": "aoj_2198_3572710",
"code_snippet": "#include<bits/stdc++.h>\n#define ll long long\n#define fi first\n#define se second\n#define rep(i, j, k) for (auto i = j; i < k; i++)\n#define rrep(i, j, k) for (auto i = j; i > k; i--)\nusing namespace std;\n\nvoid solve(int &n) {\n map<int, string> ... |
aoj_2195_cpp | Problem K:
Cat Numbers!
ねこのアリストテレスは数学の問題を考えるのを趣味にしている。今彼が考えている問題は以下のようなものである。
1以上の自然数
A
,
B
(
A
<
B
) に対して、
A
から
B
までの自然数の和を
C
、
A
と
B
を十進表記して
A
,
B
の順に結合したものを
D
とすると、両者が等しくなることがある。たとえば1から5までの和は15、2から7までの和は27、7から119までの和は 7119、といった具合である。このような
A
と
B
のペアのことを cat numbers と呼ぶことにする。アリストテレスは、
A
と
B
の桁数が与えられたときに、cat numbersを全て... | [
{
"submission_id": "aoj_2195_9790609",
"code_snippet": "#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include... |
aoj_2197_cpp | Problem A:
Sum of Consecutive Integers
あなたは数か月に渡る受験戦争を勝ち抜き，晴れてICPC大学に入学することができた．入学手続きの日，大学のキャンパス内では熱狂的なサークルの勧誘活動が行われており，あなたは大量のパンフレットを受け取って帰ってきた．部屋に戻ってきたあなたは受け取ったパンフレットの中から気になる一枚を見つけた．そのパンフレットは大学の広報部から渡されたものだった．
パンフレットには以下のような問題が記されていた．
和が
N
となるような，連続する2つ以上の正の整数の組み合わせは，何組存在するでしょうか？例えば， 9 は 2+3+4 と 4+5 の 2通りの組み合わせがあります．... | [
{
"submission_id": "aoj_2197_10641180",
"code_snippet": "#include <bits/stdc++.h>\n// using namespace std;\n\nint main() {\n while (true) {\n int N;\n std::cin >> N;\n\n if (N == 0)\n break;\n\n int ans = 0;\n\n for (int i = 1; i <= N; i++)\n for (... |
aoj_2193_cpp | Problem I:
夏への扉
なつめは大のねこ好きである。なつめの家ではずっとねこを飼っておらず、ねこ好きななつめはいつも野良ねこと遊んでいた。しかし、今回なつめは決心し、自分の家でねこを一匹飼うことにした。なつめはねこを家に迎え、レノンと名付けてかわいがり始めた。
なつめの家はたくさんの部屋と、それらをつなぐたくさんの扉からなっており、扉は次の2種類がある。
人間用の普通の扉
なつめは開けることができるが、レノンが自分で開けることはできない。なつめとレノンの両方が通ることができる。一度開ければ、その後は開いたままにしておける。
ねこ用の小さな扉
レノンが自分であけて自由に通ることができる。ただし小さいために、なつめが通ることはで... | [
{
"submission_id": "aoj_2193_9080420",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main(){\n\n int cnt;\n cin >> cnt;\n int n,m,hs,cs;\n for(int k=0;k<cnt;k++){\n cin >> n >> m;\n cin >> hs >> cs;\n \n vector<vector<int>> dh(n+1),dc(n+1);\n in... |
aoj_2202_cpp | Problem F:
Canal: Water Going Up and Down
ACM国には中央を東西に流れる川がある．この川は西の隣国からACM国を通り東の隣国へと流れており，ACM国内の全長は
K
kmである．この川にいくつかの閘門を設置し，運河として利用することが計画されている．
閘門とは，異なる2つの水位間を船が移動するための仕組みである．閘門は上流側と下流側にそれぞれ水門を持ち，それらの間に閘室と呼ばれる小さな水域を持つ．この閘室に船を入れた後に注水あるいは排水を行い，閘室の水位を上下させることで船も上下させる．以下にその模式図を示す．
図 F-1: 閘門の模式図
この川の川幅はあまり広くないため，西から東へ一方通行の... | [
{
"submission_id": "aoj_2202_6370146",
"code_snippet": "/*\tauthor: Kite_kuma\n\tcreated: 2022.03.03 02:02:13 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(... |
aoj_2205_cpp | Problem B:
宝くじチェッカー
あなたは無事進学振り分けを終え、駒場近辺から本郷近辺へ引っ越す準備の最中であった。 家の中を整理していたところ去年購入した宝くじが大量に見つかった。 交換期限を確認したところ明日までに換金しなければならないのだが、引っ越しの準備がまだ全く終わっていないため少額の当選金のために宝くじ売り場まで行くのは面倒である。 そこであなたはいくら当選金が得られるかを調べることにした。
宝くじは8桁の数字からなる。当選番号は同じく8桁で数字と'*'から構成され、持っている宝くじと数字部分が一致した場合、当選番号に応じた当選金が支払われる。
例えば所持している宝くじの番号が "12345678" の場合、当選番... | [
{
"submission_id": "aoj_2205_8809123",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n int n, m;\n \n while (true) {\n cin >> n >> m;\n \n if (n == 0 && m == 0)\n break;\n \n int ans = 0;\n vector<int> o(n);\n vector<string> b(n);\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.