pii;\ntypedef vector vpl;\ntypedef tuple 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 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 inline bool chmax(T1 &a,T2 b){\n\tif(a 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 inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate 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 \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 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 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 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 \nusing namespace std;\n\n//geometry library by maine\n\n//basic\nusing Real = double;\nusing Point = complex;\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;\nusing Polygon = vector;\nusing Polygons = vector;\nusing Lines = vector;\nusing Segments = vector;\nusing Circles = vector;\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 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 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 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 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 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 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 \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> 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 r1(N);\n vector 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 r2(M);\n vector 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 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 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\tvectorc(N);\n\t\tsort(c.begin(), c.end());\n\t\tvectora;\n\t\tvectorb;\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>dp(a.size(), vector(b.size(), -MOD));\n\t\tvector>aok(a.size(), vector(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>bok(b.size(), vector(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>ok(a.size(), vector(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\n#include\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 >f(int sx,int sy,int gx,int gy)\n{\n\tvectorid;\n\tfor(int i=0;i >E;\n\tfor(int i=0;idist(n,1);\n\tfor(int i=0;ie:E)if(dist[e.first]+1>dist[e.second])dist[e.second]=dist[e.first]+1;\n\t}\n\tvector >ret(n);\n\tfor(int i=0;i>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>X[i]>>Y[i]>>R[i];\n\t\tvector >A=f(sx,sy,gx,gy);\n\t\tvector >B=f(gx,gy,sx,sy);\n\t\tint ans=0;\n\t\tfor(pairp:A)if(ansp:B)if(ansp:A)for(pairq: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\nusing namespace std;\ntypedef long long ll;\ntemplatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (beps) return counter_clockwise;\n if(cross(a,b)<-eps) return clockwise;\n if(dot(a,b)<-eps) return online_back;\n if(a.norm() 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 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 Commontangent(Circle c1,Circle c2){\n vector 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 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;ib.y) swap(a,b);\n if(a.yeps) 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=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=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>N;\n if(N==0) break;\n Point s,t;\n cin>>s.x>>s.y>>t.x>>t.y;\n \n vector C(N);\n for(int i=0;i>C[i].c.x>>C[i].c.y>>C[i].r;\n \n sort(all(C),[](auto a,auto b){\n return a.r=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<\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 bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntypedef complex P;\n\nint n;\nP s, t;\nP p[1005];\nvector G[10005];\n\nvoid init() {\n rep(i, 10005) G[i].clear();\n}\n\nvoid solve() {\n vector
a, b;\n vector 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 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 \nusing namespace std;\ntypedef long long ll;\ntypedef pair l_l;\ntypedef pair i_i;\ntemplate\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate\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 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 \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(args)...); })\n\ntemplate\nconstexpr i64 SIZE(const C& c) noexcept { return static_cast(c.size()); }\n\ntemplate\nconstexpr i64 SIZE(const T (&)[N]) noexcept { return static_cast(N); }\n\ntemplate::value)>\nconstexpr T ABS(T x) noexcept {\n return x < 0 ? -x : x;\n}\n\ntemplate\nconstexpr i64 CMP(T x, T y) noexcept { return (y\nconstexpr i64 SGN(T x) noexcept { return CMP(x,T(0)); }\n\ntemplate>\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>\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\nauto ON(BinaryFunc&& bf, UnaryFunc&& uf) {\n return [bf=forward(bf),uf=forward(uf)](const auto& x, const auto& y) {\n return bf(uf(x), uf(y));\n };\n}\n\ntemplate\nauto LT_ON(F&& f) {\n return ON(less<>{}, forward(f));\n}\n\ntemplate\nauto GT_ON(F&& f) {\n return ON(greater<>{}, forward(f));\n}\n\ntemplate\nauto EQ_ON(F&& f) {\n return ON(equal_to<>{}, forward(f));\n}\n\ntemplate\nauto NE_ON(F&& f) {\n return ON(not_equal_to<>{}, forward(f));\n}\n\n// tuple {{{\ntemplate\nvoid tuple_enumerate(tuple&, F&&) {}\n\ntemplate I)>\nvoid tuple_enumerate(tuple& t, F&& f) {\n f(I, get(t));\n tuple_enumerate(t, forward(f));\n}\n\ntemplate\nvoid tuple_enumerate(const tuple&, F&&) {}\n\ntemplate I)>\nvoid tuple_enumerate(const tuple& t, F&& f) {\n f(I, get(t));\n tuple_enumerate(t, forward(f));\n}\n// }}}\n\n// container {{{\ntemplate struct is_container : false_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\ntemplate struct is_container> : true_type {};\n\ntemplate\nstruct ProconHash {\n size_t operator()(const T& x) const noexcept {\n return hash{}(x);\n }\n};\n\ntemplate\nsize_t procon_hash_value(const T& x) noexcept {\n return ProconHash{}(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\nstruct ProconHash> {\n size_t operator()(const pair& 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\nstruct ProconHash