0){\\n\\t\\t\\t// ccw \\n\\t\\t\\t// c\\n\\t\\t\\t// a --> b \\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\t\\tif (signcr < 0){\\n\\t\\t\\t// cw\\n\\t\\t\\t// a --> b\\n\\t\\t\\t// c\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tif (sign_dot(b, c) < 0){\\n\\t\\t\\t// c a --> b\\n\\t\\t\\treturn 2;\\n\\t\\t}\\n\\t\\tif (norm(b) < norm(c)){\\n\\t\\t\\t// a --> b c\\n\\t\\t\\treturn -2;\\n\\t\\t}\\n\\t\\t// a - c -> b\\n\\t\\treturn 0;\\n\\t}\\n friend bool has_common_point(const point &a, const point &b){\\n return sign(a.x - b.x) == 0 && sign(a.y - b.y) == 0;\\n }\\n\\n ld arg() const {\\n std::complex a(x, y);\\n return std::arg(a);\\n }\\n};\\n\\ntemplate\\nstruct arg_less {\\n constexpr bool operator()(const point &l, const point &r){\\n using std::atan2;\\n return atan2(l.y, l.x) < atan2(r.y, r.x);\\n }\\n};\\n\\ntemplate\\nvoid arg_sort(std::vector> &a){\\n\\tstd::sort(a.begin(), a.end(), arg_less{});\\n}\\n\\n\\ntemplate\\nstd::vector upper_convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) ptr--;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[i] - a[c], a[c] - a[p]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate\\nstd::vector lower_convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) continue;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[c] - a[p], a[i] - a[c]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate\\nstd::vector convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tauto upper = upper_convex_hull_index(a);\\n\\tauto lower = lower_convex_hull_index(a);\\n\\tif (upper.size() == 1u){\\n\\t\\t// lower.size() == 1u\\n\\t\\tif (a[upper.front()] == a[lower.front()]){\\n\\t\\t\\treturn {upper.front()};\\n\\t\\t}\\n\\t\\treturn {lower.front(), upper.front()};\\n\\t}\\n\\tif (a[upper.back()] == a[lower.back()]){\\n\\t\\tlower.pop_back();\\n\\t}\\n\\tlower.insert(lower.end(), upper.rbegin(), upper.rend());\\n\\tif (a[upper.front()] == a[lower.front()]) lower.pop_back();\\n\\treturn lower;\\n}\\n\\n\\ntemplate\\nstruct line {\\n\\tpoint end0, end1;\\n line () {}\\n\\tline (const point &_end0, const point &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const line &) const = default;\\n\\tpoint direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const line &a, const line &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const line &a, const line &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const line &a, const point &b){\\n\\t\\treturn sign(cross(a.direction(), b - a.end0)) == 0;\\n\\t}\\n\\tfriend bool has_common_point(const line &a, const line &b){\\n\\t\\treturn !is_parallel(a, b) || has_common_point(a, b.end0);\\n\\t}\\n\\tfriend point common_point(const line &a, const line &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tfriend point projection(const line &a, const point &b){\\n\\t\\tauto dir = a.direction();\\n\\t\\treturn a.end0 + dir * (dot(dir, b - a.end0) / norm(dir));\\n\\t}\\n\\tfriend point reflection(const line &a, const point &b){\\n\\t\\tauto prj = projection(a, b);\\n\\t\\treturn prj + prj - b;\\n\\t}\\n friend line perpendicular_bisector(const point &p1, const point &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line(ctr, ctr + dir);\\n }\\n};\\n\\ntemplate\\nline perpendicular_bisector(const point &p1, const point &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line(ctr, ctr + dir);\\n}\\n\\n\\ntemplate\\nstruct segment {\\n\\tpoint end0, end1;\\n segment () {}\\n\\tsegment (const point &_end0, const point &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const segment &) const = default;\\n\\tpoint direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const segment &a, const segment &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const segment &a, const segment &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const segment &a, const segment &b){\\n\\t\\treturn ccw(a.end0, a.end1, b.end0) * ccw(a.end0, a.end1, b.end1) <= 0\\n\\t\\t\\t&& ccw(b.end0, b.end1, a.end0) * ccw(b.end0, b.end1, a.end1) <= 0;\\n\\t}\\n\\tfriend bool has_common_point(const segment &a, const point &b){\\n\\t\\treturn ccw(a.end0, a.end1, b) == 0;\\n\\t}\\n\\tfriend point common_point(const segment &a, const segment &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\tif (has_common_point(a, b.end0)){\\n\\t\\t\\t\\treturn b.end0;\\n\\t\\t\\t}\\n\\t\\t\\tif (has_common_point(a, b.end1)){\\n\\t\\t\\t\\treturn b.end1;\\n\\t\\t\\t}\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tline as_line() const {\\n\\t\\treturn line(end0, end1);\\n\\t}\\n};\\n\\ntemplate\\nstruct circle {\\n point center;\\n Float radius;\\n circle () {}\\n circle (const point &_center, const Float &_radius) : center(_center), radius(_radius) {\\n assert(sign(radius) >= 0);\\n if (radius < Float{}){\\n radius = Float{};\\n }\\n }\\n friend int num_of_common_tangents(const circle &a, const circle &b){\\n if (has_common_point(a.center, b.center) && sign(a.radius - b.radius) == 0){\\n return 5; // infty\\n }\\n Float d = abs(a.center - b.center);\\n Float r1 = a.radius, r2 = b.radius;\\n int sumsign = sign(d - (r1 + r2));\\n if (sumsign >= 0) return sumsign + 3;\\n using std::abs;\\n int diffsign = sign(d - abs(r1 - r2));\\n return diffsign + 1;\\n }\\n friend bool has_common_point(const circle &a, const circle &b){\\n int cnt = num_of_common_tangents(a, b);\\n return cnt == 1 || cnt == 2 || cnt == 3 || cnt == 5;\\n }\\n friend bool has_common_point(const circle &c, const line &l){\\n point p = reflection(l, c.center);\\n Float d = abs(c.center, p);\\n return sign(c.radius - d) >= 0;\\n }\\n friend bool has_common_point(const circle &c, const segment &s){\\n return std::ranges::any_of(common_points(c, s.as_line()), [&](auto p){\\n return has_common_point(s, p);\\n });\\n }\\n friend bool has_common_point(const circle &c, const point &p){\\n return sign(abs(p - c.center) - c.radius) == 0;\\n }\\n friend std::vector> common_points(const circle &a, const circle &b){\\n int cnt = num_of_common_tangents(a, b);\\n assert(cnt != 5); // cannot be same circle\\n if (cnt == 0 || cnt == 4){\\n return {};\\n }\\n Float d = abs(a.center - b.center);\\n Float x = (d*d + a.radius*a.radius - b.radius*b.radius) / (d + d);\\n point p = a.center + (b.center - a.center) * x / d;\\n if (cnt == 1 || cnt == 3 || sign(a.radius - x) <= 0){\\n return {p};\\n }\\n point v = rot90(b.center - a.center);\\n using std::sqrt;\\n v *= sqrt(a.radius*a.radius - x*x) / abs(v);\\n return {p + v, p - v};\\n }\\n friend std::vector> common_points(const circle &c, const line &l) {\\n point p = projection(l, c.center);\\n Float d = abs(c.center - p);\\n int cnt = sign(c.radius - d) + 1;\\n if (cnt == 0){\\n return {};\\n }\\n if (cnt == 1){\\n return {p};\\n }\\n point v = l.direction();\\n using std::sqrt;\\n v *= sqrt(c.radius*c.radius - d*d) / abs(v);\\n return {p + v, p - v};\\n }\\n};\\n\\n} // float_geometry\\n\\nusing namespace float_geometry;\\nusing vec=point;\\n\\nvoid solve(ll N,ll M) {\\n\\tvector AP(N);\\n\\trep(i,N){\\n\\t\\tcin>>AP[i];\\n\\t}\\n\\tvector> edge(M);\\n\\trep(i,M){\\n\\t\\tll a,b;\\n\\t\\tld v;\\n\\t\\tcin>>a>>b>>v;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tedge[i]={a,b,v};\\n\\t}\\n\\tauto wp_cost=[&](ll ES)->ld {\\n\\t\\tif (ES==0)return 0;\\n\\t\\tld sum=0;\\n\\t\\tvec sum_v(0,0);\\n\\t\\trep(j,M){\\n\\t\\t\\tif (~ES >> j & 1) continue;\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tsum+=1/(v*v);\\n\\t\\t\\tsum_v+=AP[a]/(v*v);\\n\\t\\t}\\n\\t\\tsum_v/=sum;\\n\\t\\tld cost=0;\\n\\t\\trep(j,M){\\n\\t\\t\\tif (~ES>>j&1)continue;\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tld d=(abs(sum_v-AP[a])/v);\\n\\t\\t\\tcost+=d*d;\\n\\t\\t}\\n\\t\\treturn cost;\\n\\t};\\n\\tauto cost_set=[&](ll S)->ld {\\n\\t\\tset ES_set;\\n\\t\\trep(j,M){\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tif (~S>>a&1)continue;\\n\\t\\t\\tcircle cent(AP[a],abs(AP[a]-AP[b]));\\n\\t\\t\\tvector cpt;\\n\\t\\t\\tset same;\\n\\t\\t\\tsame.insert(j);\\n\\t\\t\\trep(nj,M){\\n\\t\\t\\t\\tif (j==nj)continue;\\n\\t\\t\\t\\tauto [na,nb,nv]=edge[nj];\\n\\t\\t\\t\\tif (~S>>na&1)continue;\\n\\t\\t\\t\\tcircle cr(AP[na],abs(AP[na]-AP[nb]));\\n\\t\\t\\t\\tif (num_of_common_tangents(cent,cr)==5){\\n\\t\\t\\t\\t\\tsame.insert(nj);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tauto ps=common_points(cent,cr);\\n\\t\\t\\t\\tfor (auto pp:ps){\\n\\t\\t\\t\\t\\tcpt.push_back((pp-AP[a]).arg());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(all(cpt));\\n\\t\\t\\tvector CP;\\n\\t\\t\\tif (cpt.size()==0){\\n\\t\\t\\t\\tCP.push_back(AP[a]+vec(cent.radius,0));\\n\\t\\t\\t}\\n\\t\\t\\telse if (cpt.size()==1){\\n\\t\\t\\t\\tld ar=cpt[0]+1.57;\\n\\t\\t\\t\\tCP.push_back(AP[a]+rot(vec(cent.radius,0),ar));\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tll sz=cpt.size();\\n\\t\\t\\t\\trep(k,sz){\\n\\t\\t\\t\\t\\tld ar=cpt[k]+cpt[(k+1)%sz];\\n\\t\\t\\t\\t\\tar/=2;\\n\\t\\t\\t\\t\\tCP.push_back(AP[a]+rot(vec(cent.radius,0),ar));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (vec p:CP){\\n\\t\\t\\t\\tll ps=0;\\n\\t\\t\\t\\trep(nj,M){\\n\\t\\t\\t\\t\\tif (same.contains(nj))continue;\\n\\t\\t\\t\\t\\tauto [na,nb,nv]=edge[nj];\\n\\t\\t\\t\\t\\tif (~S>>na&1)continue;\\n\\t\\t\\t\\t\\tif (abs(AP[na]-p)>a&1)continue;\\n\\t\\t\\t\\tif (es>>j&1)continue;\\n\\t\\t\\t\\tld d=(abs(AP[a]-AP[b])/v);\\n\\t\\t\\t\\tc+=d*d;\\n\\t\\t\\t}\\n\\t\\t\\tc+=wp_cost(es);\\n\\t\\t\\tchmin(mc,c);\\n\\t\\t}\\n\\t\\treturn mc;\\n\\t};\\n\\tauto pt_div=[&]()->ld {\\n\\t\\tset div_set;\\n\\t\\trep(i,N){\\n\\t\\t\\trep(ni,N){\\n\\t\\t\\t\\tll S=0;\\n\\t\\t\\t\\tvector ol;\\n\\t\\t\\t\\trep(j,N){\\n\\t\\t\\t\\t\\tll cw=ccw(AP[i],AP[ni],AP[j]);\\n\\t\\t\\t\\t\\tif (cw==1){\\n\\t\\t\\t\\t\\t\\tS^=1LL<>N>>M;\\n\\t\\tif (N==0)break;\\n solve(N,M);\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 3640,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.6044,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1614_10579455\",\n \"code_snippet\": \"#include \\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\n#define rep(i,n) for(ll i=0;i T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate\\nostream &operator<<(ostream &os, const vector &a){\\n\\tif (a.empty()) return os;\\n\\tos << a.front();\\n\\tfor (auto e : a | views::drop(1)){\\n\\t\\tos << ' ' << e;\\n\\t}\\n\\treturn os;\\n}\\nvoid dump(auto... vs) {\\n\\t((cout << vs << ' '), ...) << endl;\\n}\\n\\n\\n// #pragma once\\n\\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n\\n#if __has_include()\\n\\n#include\\n\\n#endif\\n\\nnamespace float_geometry {\\n\\ntemplate\\nstruct is_floating_point_number : std::bool_constant {};\\n\\ntemplate\\nstruct is_floating_point_number : std::bool_constant {};\\n\\n#if __has_include()\\n\\ntemplate\\nstruct is_floating_point_number>> : std::bool_constant {};\\n\\ntemplate\\nstruct is_floating_point_number>> : std::bool_constant {};\\n\\n#endif\\n\\ntemplate\\nconcept FloatingPoint = is_floating_point_number::value;\\n\\ntemplate\\nconstexpr Float EPS = Float{1e-9};\\n\\ntemplate\\nconstexpr int sign(const Float &x, Float eps = EPS){\\n return (x < -eps ? -1 : x > eps ? 1 : 0);\\n}\\n\\ntemplate\\nstruct point {\\n Float x, y;\\n point () {}\\n point (Float _x, Float _y) : x(_x), y(_y) {}\\n point &operator+=(const point &r){\\n x += r.x;\\n y += r.y;\\n return *this;\\n }\\n point &operator-=(const point &r){\\n x -= r.x;\\n y -= r.y;\\n return *this;\\n }\\n point operator+() const {\\n return *this;\\n }\\n point operator-() const {\\n x = -x;\\n y = -y;\\n return *this;\\n }\\n point &operator*=(const Float &a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n\\tpoint &operator/=(const Float &a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n friend point operator+(const point& lhs, const point& rhs){\\n return point(lhs) += rhs;\\n }\\n friend point operator-(const point& lhs, const point& rhs){\\n return point(lhs) -= rhs;\\n }\\n friend point operator*(const point& lhs, const Float& a){\\n return point(lhs) *= a;\\n }\\n friend point operator*(const Float& a, const point& rhs){\\n return point(rhs) *= a;\\n }\\n\\tfriend point operator/(const point& lhs, const Float& a){\\n return point(lhs) /= a;\\n }\\n auto operator<=>(const point&) const = default;\\n // friend bool operator<(const point &lhs, const point &rhs){\\n // if (lhs.x == rhs.x) return lhs.y < rhs.y;\\n // return lhs.x < rhs.x;\\n // }\\n // friend bool operator==(const point &lhs, const point &rhs){\\n // return (lhs.x == rhs.x && lhs.y == rhs.y);\\n // }\\n friend std::ostream &operator<<(std::ostream &os, const point& p){\\n return os << p.x << ' ' << p.y;\\n }\\n friend std::istream &operator>>(std::istream &is, point &a){\\n Float _x, _y; is >> _x >> _y;\\n a = point(_x, _y);\\n return (is);\\n }\\n friend Float norm(const point &a) {\\n return a.x*a.x + a.y*a.y;\\n }\\n friend Float dot(const point &a, const point &b){\\n return a.x*b.x + a.y*b.y;\\n }\\n friend Float cross(const point &a, const point &b){\\n return a.x*b.y - a.y*b.x;\\n }\\n\\tfriend point rot90(const point &a){\\n\\t\\treturn point(-a.y, a.x);\\n\\t}\\n friend point rot(const point &a, const Float rad){\\n using std::cos, std::sin;\\n Float cosrad = cos(rad);\\n Float sinrad = sin(rad);\\n return point(a.x * cosrad - a.y * sinrad, a.x * sinrad + a.y * cosrad);\\n }\\n friend Float abs(const point &a){\\n using std::sqrt;\\n return sqrt(norm(a));\\n }\\n\\n friend int quadrant_atan2(const point &a){\\n // not origin point\\n // ceil ( atan2(y,x) / (pi/2) )\\n\\t\\tint signx = sign(a.x);\\n\\t\\tint signy = sign(a.y);\\n\\t\\tif (signx <= 0 && signy < 0) return -1;\\n\\t\\tif (signx > 0 && signy <= 0) return 0;\\n\\t\\tif (signx >= 0 && signy > 0) return 1;\\n\\t\\tif (signx < 0 && signy >= 0) return 2;\\n // origin point x == 0 && y == 0\\n return 0;\\n }\\n\\n friend int sign_cross(const point &a, const point &b){\\n using std::abs;\\n return sign(cross(a, b), EPS * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(cross(a, b), EPS * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n }\\n\\n friend int sign_dot(const point &a, const point &b){\\n using std::abs;\\n return sign(dot(a, b), EPS * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(dot(a, b), EPS * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n }\\n\\n\\tfriend int ccw(const point &a, point b, point c){\\n\\t\\tb -= a;\\n\\t\\tc -= a;\\n\\t\\tint signcr = sign_cross(b, c);\\n\\t\\tif (signcr > 0){\\n\\t\\t\\t// ccw \\n\\t\\t\\t// c\\n\\t\\t\\t// a --> b \\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\t\\tif (signcr < 0){\\n\\t\\t\\t// cw\\n\\t\\t\\t// a --> b\\n\\t\\t\\t// c\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tif (sign_dot(b, c) < 0){\\n\\t\\t\\t// c a --> b\\n\\t\\t\\treturn 2;\\n\\t\\t}\\n\\t\\tif (norm(b) < norm(c)){\\n\\t\\t\\t// a --> b c\\n\\t\\t\\treturn -2;\\n\\t\\t}\\n\\t\\t// a - c -> b\\n\\t\\treturn 0;\\n\\t}\\n friend bool has_common_point(const point &a, const point &b){\\n return sign(a.x - b.x) == 0 && sign(a.y - b.y) == 0;\\n }\\n\\n ld arg() const {\\n std::complex a(x, y);\\n return std::arg(a);\\n }\\n};\\n\\ntemplate\\nstruct arg_less {\\n constexpr bool operator()(const point &l, const point &r){\\n using std::atan2;\\n return atan2(l.y, l.x) < atan2(r.y, r.x);\\n }\\n};\\n\\ntemplate\\nvoid arg_sort(std::vector> &a){\\n\\tstd::sort(a.begin(), a.end(), arg_less{});\\n}\\n\\n\\ntemplate\\nstd::vector upper_convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) ptr--;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[i] - a[c], a[c] - a[p]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate\\nstd::vector lower_convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) continue;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[c] - a[p], a[i] - a[c]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate\\nstd::vector convex_hull_index(const std::vector> &a){\\n\\tif (a.empty()) return {};\\n\\tauto upper = upper_convex_hull_index(a);\\n\\tauto lower = lower_convex_hull_index(a);\\n\\tif (upper.size() == 1u){\\n\\t\\t// lower.size() == 1u\\n\\t\\tif (a[upper.front()] == a[lower.front()]){\\n\\t\\t\\treturn {upper.front()};\\n\\t\\t}\\n\\t\\treturn {lower.front(), upper.front()};\\n\\t}\\n\\tif (a[upper.back()] == a[lower.back()]){\\n\\t\\tlower.pop_back();\\n\\t}\\n\\tlower.insert(lower.end(), upper.rbegin(), upper.rend());\\n\\tif (a[upper.front()] == a[lower.front()]) lower.pop_back();\\n\\treturn lower;\\n}\\n\\n\\ntemplate\\nstruct line {\\n\\tpoint end0, end1;\\n line () {}\\n\\tline (const point &_end0, const point &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const line &) const = default;\\n\\tpoint direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const line &a, const line &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const line &a, const line &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const line &a, const point &b){\\n\\t\\treturn sign(cross(a.direction(), b - a.end0)) == 0;\\n\\t}\\n\\tfriend bool has_common_point(const line &a, const line &b){\\n\\t\\treturn !is_parallel(a, b) || has_common_point(a, b.end0);\\n\\t}\\n\\tfriend point common_point(const line &a, const line &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tfriend point projection(const line &a, const point &b){\\n\\t\\tauto dir = a.direction();\\n\\t\\treturn a.end0 + dir * (dot(dir, b - a.end0) / norm(dir));\\n\\t}\\n\\tfriend point reflection(const line &a, const point &b){\\n\\t\\tauto prj = projection(a, b);\\n\\t\\treturn prj + prj - b;\\n\\t}\\n friend line perpendicular_bisector(const point &p1, const point &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line(ctr, ctr + dir);\\n }\\n};\\n\\ntemplate\\nline perpendicular_bisector(const point &p1, const point &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line(ctr, ctr + dir);\\n}\\n\\n\\ntemplate\\nstruct segment {\\n\\tpoint end0, end1;\\n segment () {}\\n\\tsegment (const point &_end0, const point &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const segment &) const = default;\\n\\tpoint direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const segment &a, const segment &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const segment &a, const segment &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const segment &a, const segment &b){\\n\\t\\treturn ccw(a.end0, a.end1, b.end0) * ccw(a.end0, a.end1, b.end1) <= 0\\n\\t\\t\\t&& ccw(b.end0, b.end1, a.end0) * ccw(b.end0, b.end1, a.end1) <= 0;\\n\\t}\\n\\tfriend bool has_common_point(const segment &a, const point &b){\\n\\t\\treturn ccw(a.end0, a.end1, b) == 0;\\n\\t}\\n\\tfriend point common_point(const segment &a, const segment &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\tif (has_common_point(a, b.end0)){\\n\\t\\t\\t\\treturn b.end0;\\n\\t\\t\\t}\\n\\t\\t\\tif (has_common_point(a, b.end1)){\\n\\t\\t\\t\\treturn b.end1;\\n\\t\\t\\t}\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tline as_line() const {\\n\\t\\treturn line(end0, end1);\\n\\t}\\n};\\n\\ntemplate\\nstruct circle {\\n point center;\\n Float radius;\\n circle () {}\\n circle (const point &_center, const Float &_radius) : center(_center), radius(_radius) {\\n assert(sign(radius) >= 0);\\n if (radius < Float{}){\\n radius = Float{};\\n }\\n }\\n friend int num_of_common_tangents(const circle &a, const circle &b){\\n if (has_common_point(a.center, b.center) && sign(a.radius - b.radius) == 0){\\n return 5; // infty\\n }\\n Float d = abs(a.center - b.center);\\n Float r1 = a.radius, r2 = b.radius;\\n int sumsign = sign(d - (r1 + r2));\\n if (sumsign >= 0) return sumsign + 3;\\n using std::abs;\\n int diffsign = sign(d - abs(r1 - r2));\\n return diffsign + 1;\\n }\\n friend bool has_common_point(const circle &a, const circle &b){\\n int cnt = num_of_common_tangents(a, b);\\n return cnt == 1 || cnt == 2 || cnt == 3 || cnt == 5;\\n }\\n friend bool has_common_point(const circle &c, const line &l){\\n point p = reflection(l, c.center);\\n Float d = abs(c.center, p);\\n return sign(c.radius - d) >= 0;\\n }\\n friend bool has_common_point(const circle &c, const segment &s){\\n return std::ranges::any_of(common_points(c, s.as_line()), [&](auto p){\\n return has_common_point(s, p);\\n });\\n }\\n friend bool has_common_point(const circle &c, const point &p){\\n return sign(abs(p - c.center) - c.radius) == 0;\\n }\\n friend std::vector> common_points(const circle &a, const circle &b){\\n int cnt = num_of_common_tangents(a, b);\\n assert(cnt != 5); // cannot be same circle\\n if (cnt == 0 || cnt == 4){\\n return {};\\n }\\n Float d = abs(a.center - b.center);\\n Float x = (d*d + a.radius*a.radius - b.radius*b.radius) / (d + d);\\n point p = a.center + (b.center - a.center) * x / d;\\n if (cnt == 1 || cnt == 3 || sign(a.radius - x) <= 0){\\n return {p};\\n }\\n point v = rot90(b.center - a.center);\\n using std::sqrt;\\n v *= sqrt(a.radius*a.radius - x*x) / abs(v);\\n return {p + v, p - v};\\n }\\n friend std::vector> common_points(const circle &c, const line &l) {\\n point p = projection(l, c.center);\\n Float d = abs(c.center - p);\\n int cnt = sign(c.radius - d) + 1;\\n if (cnt == 0){\\n return {};\\n }\\n if (cnt == 1){\\n return {p};\\n }\\n point v = l.direction();\\n using std::sqrt;\\n v *= sqrt(c.radius*c.radius - d*d) / abs(v);\\n return {p + v, p - v};\\n }\\n};\\n\\n} // float_geometry\\n\\nusing namespace float_geometry;\\nusing vec=point;\\n\\nvoid solve(ll N,ll M) {\\n\\tvector AP(N);\\n\\trep(i,N){\\n\\t\\tcin>>AP[i];\\n\\t}\\n\\tvector> edge(M);\\n\\trep(i,M){\\n\\t\\tll a,b;\\n\\t\\tld v;\\n\\t\\tcin>>a>>b>>v;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tedge[i]={a,b,v};\\n\\t}\\n\\tauto wp_cost=[&](ll ES)->ld {\\n\\t\\tif (ES==0)return 0;\\n\\t\\tld sum=0;\\n\\t\\tvec sum_v(0,0);\\n\\t\\trep(j,M){\\n\\t\\t\\tif (~ES >> j & 1) continue;\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tsum+=1/(v*v);\\n\\t\\t\\tsum_v+=AP[a]/(v*v);\\n\\t\\t}\\n\\t\\tsum_v/=sum;\\n\\t\\tld cost=0;\\n\\t\\trep(j,M){\\n\\t\\t\\tif (~ES>>j&1)continue;\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tld d=(abs(sum_v-AP[a])/v);\\n\\t\\t\\tcost+=d*d;\\n\\t\\t}\\n\\t\\treturn cost;\\n\\t};\\n\\tauto cost_set=[&](ll S)->ld {\\n\\t\\tif (S == 0) return 0;\\n\\t\\tset ES_set;\\n\\t\\trep(j,M){\\n\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\tif (~S>>a&1)continue;\\n\\t\\t\\tcircle cent(AP[a],abs(AP[a]-AP[b]));\\n\\t\\t\\tvector cpt;\\n\\t\\t\\tset same;\\n\\t\\t\\tsame.insert(j);\\n\\t\\t\\trep(nj,M){\\n\\t\\t\\t\\tif (j==nj)continue;\\n\\t\\t\\t\\tauto [na,nb,nv]=edge[nj];\\n\\t\\t\\t\\tif (~S>>na&1)continue;\\n\\t\\t\\t\\tcircle cr(AP[na],abs(AP[na]-AP[nb]));\\n\\t\\t\\t\\tif (num_of_common_tangents(cent,cr)==5){\\n\\t\\t\\t\\t\\tsame.insert(nj);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tauto ps=common_points(cent,cr);\\n\\t\\t\\t\\tfor (auto pp:ps){\\n\\t\\t\\t\\t\\tcpt.push_back((pp-AP[a]).arg());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(all(cpt));\\n\\t\\t\\tvector CP;\\n\\t\\t\\tif (cpt.size()==0){\\n\\t\\t\\t\\tCP.push_back(AP[a]+vec(cent.radius,0));\\n\\t\\t\\t}\\n\\t\\t\\telse if (cpt.size()==1){\\n\\t\\t\\t\\tld ar=cpt[0]+acos(-1);\\n\\t\\t\\t\\tCP.push_back(AP[a]+rot(vec(cent.radius,0),ar));\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tll sz=cpt.size();\\n\\t\\t\\t\\trep(k,sz){\\n\\t\\t\\t\\t\\tld ar=cpt[k]+(k == sz-1 ? cpt[0]+acos(-1)*2 : cpt[k+1]);\\n\\t\\t\\t\\t\\tar/=2;\\n\\t\\t\\t\\t\\tCP.push_back(AP[a]+rot(vec(cent.radius,0),ar));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (vec p:CP){\\n\\t\\t\\t\\tll ps=0;\\n\\t\\t\\t\\trep(nj,M){\\n\\t\\t\\t\\t\\tif (same.contains(nj))continue;\\n\\t\\t\\t\\t\\tauto [na,nb,nv]=edge[nj];\\n\\t\\t\\t\\t\\tif (~S>>na&1)continue;\\n\\t\\t\\t\\t\\tif (abs(AP[na]-p)>a&1)continue;\\n\\t\\t\\t\\tif (es>>j&1)continue;\\n\\t\\t\\t\\tld d=(abs(AP[a]-AP[b])/v);\\n\\t\\t\\t\\tc+=d*d;\\n\\t\\t\\t}\\n\\t\\t\\tc+=wp_cost(es);\\n\\t\\t\\tchmin(mc,c);\\n\\t\\t}\\n\\t\\treturn mc;\\n\\t};\\n\\tauto pt_div=[&]()->ld {\\n\\t\\tset div_set;\\n\\t\\trep(i,N){\\n\\t\\t\\trep(ni,N){\\n\\t\\t\\t\\tll S=0;\\n\\t\\t\\t\\tvector ol;\\n\\t\\t\\t\\trep(j,N){\\n\\t\\t\\t\\t\\tll cw=ccw(AP[i],AP[ni],AP[j]);\\n\\t\\t\\t\\t\\tif (cw==1){\\n\\t\\t\\t\\t\\t\\tS^=1LL<>N>>M;\\n\\t\\tif (N==0)break;\\n solve(N,M);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3700,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.6167,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1614_7743984\",\n \"code_snippet\": \"#include\\n\\n#define rep(i,s,n) for (int i = s; i < (int)(n); i++)\\n#define rrep(i,s,n) for (int i = (int)(n)-1; i >= (int)(s); i--)\\n#define all(v) v.begin(),v.end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\ntemplate bool chmin(T &a, const T &b){\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate bool chmax(T &a, const T &b){\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\nnamespace lib{\\n\\nusing namespace std;\\n\\n} // namespace lib;\\n\\nusing namespace lib;\\n\\nnamespace lib {\\n\\nusing vec = complex;\\nconst ld eps = 1e-7;\\n\\nvoid ldout(int len = 15){\\n cout << fixed << setprecision(len);\\n}\\n\\nint sgn(ld a) {\\n return (a < -eps) ? -1 : (a > eps) ? 1 : 0;\\n}\\n\\nld dot(const vec &a, const vec &b){\\n return (conj(a) * b).real();\\n}\\n\\nld cross(const vec &a, const vec &b){\\n return (conj(a) * b).imag();\\n}\\n\\nint isp(const vec &a, const vec &b, const vec &c) {\\n int cross_sgn = sgn(cross(b - a, c - a));\\n if(cross_sgn == 0) {\\n if(sgn(dot(b - a, c - a)) < 0) return -2;\\n if(sgn(dot(a - b, c - b)) < 0) return 2;\\n }\\n return cross_sgn;\\n}\\n\\nvec rot90(const vec &a) {\\n return {-a.imag(), a.real()};\\n}\\n\\nvec rot(const vec &a, ld rad){\\n return a * vec(cosl(rad),sinl(rad));\\n}\\n\\nbool comp_for_argument_sort(const vec &lhs, const vec &rhs){\\n //if (abs(arg(lhs)-arg(rhs)) < eps) return false; // need ?\\n return arg(lhs) < arg(rhs);\\n}\\n\\n} // namespace lib\\n\\n\\nnamespace lib {\\n\\nstruct line {\\n vec a, b;\\n};\\n\\nvec proj(const line &l, const vec &p) {\\n vec ab = l.b - l.a;\\n return l.a + ab * (dot(ab, p - l.a) / norm(ab));\\n}\\n\\nvec refl(const line &l, const vec &p) {\\n return proj(l, p) * ld(2) - p;\\n}\\n\\nint intersection(const line &a, const line &b) {\\n if(sgn(cross(a.b - a.a, b.a - b.b)) != 0) {\\n if(sgn(dot(a.b - a.a, b.a - b.b)) == 0) {\\n return 1;\\n }\\n return 0;\\n }\\n else if(sgn(cross(a.b - a.a, b.a - a.a)) != 0) {\\n return 2;\\n }\\n else {\\n return 3;\\n }\\n}\\n\\nld dist(const line &a, const vec &p) {\\n return abs(cross(p - a.a, a.b - a.a) / abs(a.b - a.a));\\n}\\n\\nvec cross_point(const line &a, const line &b) {\\n assert(intersection(a, b) < 2);\\n return a.a + (a.b - a.a) * cross(b.a - a.a, b.b - b.a) / cross(a.b - a.a, b.b - b.a);\\n}\\n\\n}\\n\\nnamespace lib {\\n\\nstruct circle {\\n vec c;\\n ld r;\\n};\\n\\nint intersection(const circle &c1, const circle &c2) {\\n ld d = abs(c1.c - c2.c);\\n ld r1 = c1.r;\\n ld r2 = c2.r;\\n if(r1 < r2) std::swap(r1, r2);\\n if(sgn(d - (r1 + r2)) > 0) {\\n return 4;\\n }\\n else if(sgn(d - (r1 + r2) == 0)) {\\n return 3;\\n }\\n else if(sgn(d - r1 + r2) > 0) {\\n return 2;\\n }\\n else if(sgn(d - r1 + r2) == 0) {\\n return 1;\\n }\\n else return 0;\\n}\\n\\ncircle incircle_of_triangle(const vec &a, const vec &b, const vec &c) {\\n ld A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n vec in = A * a + B * b + C * c;\\n in /= A + B + C;\\n ld r = abs(cross(in - a, b - a) / abs(b - a));\\n return {in, r};\\n}\\n\\ncircle circumscribed_circle_of_triangle(const vec &a, const vec &b, const vec &c) {\\n line p = {(a + b)/ld(2.0), (a + b)/ld(2.0)+rot90(b - a)};\\n line q = {(b + c)/ld(2.0), (b + c)/ld(2.0)+rot90(c - b)};\\n vec cross = cross_point(p, q);\\n return {cross, abs(a-cross)};\\n}\\n\\nvector cross_point(const circle &c, const line &l) {\\n vector ps;\\n ld d = dist(l, c.c);\\n if(sgn(d - c.r) == 0) ps.emplace_back(proj(l, c.c));\\n else if(sgn(d - c.r) < 0) {\\n vec p = proj(l, c.c);\\n vec v = l.b - l.a;\\n v *= sqrt(max(c.r*c.r - d * d, ld(0))) / abs(v);\\n ps.emplace_back(p + v);\\n ps.emplace_back(p - v);\\n }\\n return ps;\\n}\\n\\nvector cross_point(const circle &c1, const circle &c2) {\\n vector ps;\\n int cnt_tangent = intersection(c1, c2);\\n if(cnt_tangent == 0 || cnt_tangent == 4) return {};\\n ld d = abs(c2.c - c1.c);\\n ld x = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n vec p = c1.c + (c2.c - c1.c) * x / d;\\n vec v = rot90(c2.c - c1.c);\\n if(cnt_tangent == 1 || cnt_tangent == 3) ps.emplace_back(p);\\n else {\\n v *= sqrt(max(c1.r * c1.r - x * x, ld(0))) / abs(v);\\n ps.emplace_back(p + v);\\n ps.emplace_back(p - v);\\n }\\n return ps;\\n}\\n\\n}\\n\\n\\ntemplate\\nvoid vout(const vector &a){\\n rep(i,0,a.size()){\\n cout << a[i] << \\\" \\\\n\\\"[i == a.size()-1];\\n } cout << endl;\\n}\\n\\nbool on_line(const line &a, const vec &v){\\n return sgn(dist(a,v)) == 0;\\n}\\n\\nbool same_line(const line &a, const line &b){\\n return on_line(a,b.a) && on_line(a,b.b);\\n}\\n\\nbool same_circle(const circle &a, const circle &b){\\n return sgn(abs(a.c-b.c)) == 0 && sgn(abs(a.r-b.r)) == 0;\\n}\\n\\nll gcd_safe(ll a, ll b){\\n return gcd(abs(a),abs(b));\\n}\\n\\nstruct Line{\\n ll a, b, c; // ax + by = c\\n ll xp, yp, xq, yq;\\n void norm(){ // a >= 0, if (a == 0) -> b >= 0, gcd(a,b,c) = 1\\n if (a < 0) a = -a, b = -b, c = -c;\\n if (a == 0) if (b < 0) b = -b, c = -c;\\n ll g = gcd_safe(gcd_safe(a,b),c);\\n a /= g, b /= g, c /= g;\\n }\\n Line (ll _a = 1, ll _b = 0, ll _c = 0) : a(_a), b(_b), c(_c) {\\n assert(_a != 0 || _b != 0);\\n norm();\\n }\\n Line (ll x1, ll y1, ll x2, ll y2){ // --- (x1,y1) --- (x2,y2) ---\\n assert(x1 != x2 || y1 != y2);\\n ll wx = x2 - x1, wy = y2 - y1;\\n ll wg = gcd_safe(wx,wy);\\n a = wy / wg, b = -wx / wg;\\n c = a * x1 + b * y1;\\n norm();\\n xp = x1, yp = y1, xq = x2, yq = y2;\\n }\\n bool operator<(const Line &rhs) const { // to use set or map for Line\\n if (a == rhs.a){\\n if (b == rhs.b) return c < rhs.c;\\n return b < rhs.b;\\n }\\n return a < rhs.a;\\n }\\n};\\n\\nusing P = pair;\\n\\nvoid input_point(int n, int m, vector &a, vector &lines, vector &cirs,\\n vector
&es, vector cirst;\\n rep(i,0,m){\\n int u, v; cin >> u >> v; u--, v--;\\n ld vr; cin >> vr;\\n es[i] = P(u,v);\\n vrs[i] = 1/vr/vr;\\n nmsk[u] |= (1LL << i);\\n int dx = xs[u] - xs[v];\\n int dy = ys[u] - ys[v];\\n cirst.insert(make_pair(u,dx*dx+dy*dy));\\n }\\n for (auto p : cirst){\\n cirs.push_back({a[p.first],sqrtl(p.second)});\\n }\\n}\\n\\nvoid solve1(int n, int m){\\n ldout();\\n vector es(m);\\n vector